#pragma once #include #include #include #include "BasicBlock.h" #include "types.h" #include "ast.h" #include "icode.h" #include "locident.h" #include "error.h" #include "graph.h" #include "bundle.h" #include "StackFrame.h" /* PROCEDURE NODE */ struct CALL_GRAPH; 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; }; } struct FunctionType { bool m_vararg; bool isVarArg() const {return m_vararg;} }; struct Assignment { COND_EXPR *lhs; COND_EXPR *rhs; }; 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: dword 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 */ flags32 flg; /* Combination of Icode & Proc flags */ int16 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 */ std::vector m_cfg; /* Ptr. to BB list/CFG */ std::vector m_dfsLast; std::vector heldBBs; //BB * *dfsLast; /* Array of pointers to BBs in dfsLast // * (reverse postorder) order */ Int numBBs; /* Number of BBs in the graph cfg */ boolT hasCase; /* Procedure has a case node */ /* For interprocedural live analysis */ std::bitset<32> liveIn; /* Registers used before defined */ std::bitset<32> 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; } void compoundCond(); void writeProcComments(); void lowLevelAnalysis(); void bindIcodeOff(); void dataFlow(std::bitset<32> &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); boolT process_JMP(ICODE *pIcode, STATE *pstate, CALL_GRAPH *pcallGraph); boolT process_CALL(ICODE *pIcode, CALL_GRAPH *pcallGraph, STATE *pstate); void displayCFG(); void freeCFG(); void codeGen(std::ostream &fs); void displayStats(); void mergeFallThrough(BB *pBB); void structIfs(); void structLoops(derSeq *derivedG); void buildCFG(); void controlFlowAnalysis(); void newRegArg(ICODE *picode, ICODE *ticode); protected: // 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); 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(std::bitset<32> &in_liveOut); void findIdioms(); void propLong(); void genLiveKtes(); byte findDerivedSeq (derSeq *derivedGi); bool nextOrderGraph(derSeq *derivedGi); };