#pragma once #include #include #include #include "BasicBlock.h" #include "locident.h" #include "state.h" #include "icode.h" #include "StackFrame.h" /* PROCEDURE NODE */ struct CALL_GRAPH; struct Expr; struct Disassembler; struct Function; struct CALL_GRAPH; typedef llvm::iplist FunctionListType; typedef FunctionListType lFunction; typedef lFunction::iterator ilFunction; namespace llvm { // Traits for intrusive list of basic blocks... template<> struct ilist_traits : public ilist_default_traits { // createSentinel is used to get hold of the node that marks the end of the // list... (same trick used here as in ilist_traits) BB *createSentinel() const { return static_cast(&Sentinel); } static void destroySentinel(BB*) {} BB *provideInitialHead() const { return createSentinel(); } BB *ensureHead(BB*) const { return createSentinel(); } static void noteHead(BB*, BB*) {} //static ValueSymbolTable *getSymTab(Function *ItemParent); private: mutable ilist_half_node Sentinel; }; } /* Procedure FLAGS */ enum PROC_FLAGS { PROC_BADINST=0x00000100,/* Proc contains invalid or 386 instruction */ PROC_IJMP =0x00000200,/* Proc incomplete due to indirect jmp */ PROC_ICALL =0x00000400, /* Proc incomplete due to indirect call */ PROC_HLL =0x00001000, /* Proc is likely to be from a HLL */ CALL_PASCAL =0x00002000, /* Proc uses Pascal calling convention */ CALL_C =0x00004000, /* Proc uses C calling convention */ CALL_UNKNOWN=0x00008000, /* Proc uses unknown calling convention */ PROC_NEAR =0x00010000, /* Proc exits with near return */ PROC_FAR =0x00020000, /* Proc exits with far return */ GRAPH_IRRED =0x00100000, /* Proc generates an irreducible graph */ SI_REGVAR =0x00200000, /* SI is used as a stack variable */ DI_REGVAR =0x00400000, /* DI is used as a stack variable */ PROC_IS_FUNC=0x00800000, /* Proc is a function */ REG_ARGS =0x01000000, /* Proc has registers as arguments */ PROC_VARARG =0x02000000, /* Proc has variable arguments */ PROC_OUTPUT =0x04000000, /* C for this proc has been output */ PROC_RUNTIME=0x08000000, /* Proc is part of the runtime support */ PROC_ISLIB =0x10000000, /* Proc is a library function */ PROC_ASM =0x20000000, /* Proc is an intrinsic assembler routine */ PROC_IS_HLL =0x40000000 /* Proc has HLL prolog code */ #define CALL_MASK 0xFFFF9FFF /* Masks off CALL_C and CALL_PASCAL */ }; struct FunctionType { bool m_vararg; bool isVarArg() const {return m_vararg;} }; struct Assignment { Expr *lhs; Expr *rhs; }; struct JumpTable { uint32_t start; uint32_t finish; bool valid() {return start m_listBB; /* Ptr. to BB list/CFG */ public: typedef std::list::iterator iterator; iterator begin() { return m_listBB.begin(); } iterator end() { return m_listBB.end(); } BB * &front() { return m_listBB.front();} void nodeSplitting() { /* Converts the irreducible graph G into an equivalent reducible one, by * means of node splitting. */ fprintf(stderr,"Attempt to perform node splitting: NOT IMPLEMENTED\n"); } void push_back(BB *v) { m_listBB.push_back(v);} }; struct Function : public llvm::ilist_node { typedef llvm::iplist BasicBlockListType; // BasicBlock iterators... typedef BasicBlockListType::iterator iterator; typedef BasicBlockListType::const_iterator const_iterator; private: BasicBlockListType BasicBlocks; ///< The basic blocks public: uint32_t procEntry; /* label number */ std::string name; /* Meaningful name for this proc */ STATE state; /* Entry state */ int depth; /* Depth at which we found it - for printing */ uint32_t flg; /* Combination of Icode & Proc flags */ int16_t cbParam; /* Probable no. of bytes of parameters */ STKFRAME args; /* Array of arguments */ LOCAL_ID localId; /* Local identifiers */ ID retVal; /* Return value - identifier */ /* Icodes and control flow graph */ CIcodeRec Icode; /* Object with ICODE records */ FunctionCfg m_actual_cfg; std::list m_cfg; /* Ptr. to BB list/CFG */ std::vector m_dfsLast; std::list heldBBs; //BB * *dfsLast; /* Array of pointers to BBs in dfsLast // * (reverse postorder) order */ size_t numBBs; /* Number of BBs in the graph cfg */ bool hasCase; /* Procedure has a case node */ /* For interprocedural live analysis */ LivenessSet liveIn; /* Registers used before defined */ LivenessSet liveOut; /* Registers that may be used in successors */ bool liveAnal; /* Procedure has been analysed already */ Function(void */*ty*/=0) : procEntry(0),depth(0),flg(0),cbParam(0),m_cfg(0),m_dfsLast(0),numBBs(0), hasCase(false),liveIn(0),liveOut(0),liveAnal(0)//,next(0),prev(0) { } public: static Function *Create(void *ty=0,int /*Linkage*/=0,const std::string &nm="",void */*module*/=0) { Function *r=new Function(ty); r->name = nm; return r; } bool anyFlagsSet(uint32_t t) { return (flg&t)!=0;} bool hasRegArgs() const { return (flg & REG_ARGS)!=0;} bool isLibrary() const { return (flg & PROC_ISLIB)!=0;} void compoundCond(); void writeProcComments(); void lowLevelAnalysis(); void bindIcodeOff(); void dataFlow(LivenessSet &liveOut); void compressCFG(); void highLevelGen(); void structure(derSeq *derivedG); derSeq *checkReducibility(); void createCFG(); void markImpure(); void findImmedDom(); void FollowCtrl(CALL_GRAPH *pcallGraph, STATE *pstate); void process_operands(ICODE &pIcode, STATE *pstate); bool process_JMP(ICODE &pIcode, STATE *pstate, CALL_GRAPH *pcallGraph); boolT process_CALL(ICODE &pIcode, CALL_GRAPH *pcallGraph, STATE *pstate); void freeCFG(); void codeGen(std::ostream &fs); void mergeFallThrough(BB *pBB); void structIfs(); void structLoops(derSeq *derivedG); void buildCFG(Disassembler &ds); void controlFlowAnalysis(); void newRegArg(iICODE picode, iICODE ticode); void writeProcComments(std::ostream &ostr); void displayCFG(); void displayStats(); void processHliCall(Expr *exp, iICODE picode); void preprocessReturnDU(LivenessSet &_liveOut); Expr * adjustActArgType(Expr *_exp, hlType forType); std::string writeCall(Function *tproc, STKFRAME &args, int *numLoc); protected: void extractJumpTableRange(ICODE& pIcode, STATE *pstate, JumpTable &table); bool followAllTableEntries(JumpTable &table, uint32_t cs, ICODE &pIcode, CALL_GRAPH *pcallGraph, STATE *pstate); bool removeInEdge_Flag_and_ProcessLatch(BB *pbb, BB *a, BB *b); bool Case_X_and_Y(BB* pbb, BB* thenBB, BB* elseBB); bool Case_X_or_Y(BB* pbb, BB* thenBB, BB* elseBB); bool Case_notX_or_Y(BB* pbb, BB* thenBB, BB* elseBB); bool Case_notX_and_Y(BB* pbb, BB* thenBB, BB* elseBB); void replaceInEdge(BB* where, BB* which, BB* with); void processExpPush(int &numHlIcodes, iICODE picode); // TODO: replace those with friend visitor ? void propLongReg(int loc_ident_idx, const ID &pLocId); void propLongStk(int i, const ID &pLocId); void propLongGlb(int i, const ID &pLocId); void processTargetIcode(iICODE picode, int &numHlIcodes, iICODE ticode, bool isLong); int findBackwarLongDefs(int loc_ident_idx, const ID &pLocId, iICODE iter); int findForwardLongUses(int loc_ident_idx, const ID &pLocId, iICODE beg); void structCases(); void findExps(); void genDU1(); void elimCondCodes(); void liveRegAnalysis(LivenessSet &in_liveOut); void findIdioms(); void propLong(); void genLiveKtes(); uint8_t findDerivedSeq (derSeq &derivedGi); bool nextOrderGraph(derSeq &derivedGi); };