Chris Lattner | bb2a28f | 2002-03-26 22:39:06 +0000 | [diff] [blame] | 1 | //===- FunctionRepBuilder.h - Structures for graph building ------*- C++ -*--=// |
| 2 | // |
| 3 | // This file defines the FunctionRepBuilder and InitVisitor classes that are |
| 4 | // used to build the local data structure graph for a method. |
| 5 | // |
| 6 | //===----------------------------------------------------------------------===// |
| 7 | |
| 8 | #ifndef DATA_STRUCTURE_METHOD_REP_BUILDER_H |
| 9 | #define DATA_STRUCTURE_METHOD_REP_BUILDER_H |
| 10 | |
| 11 | #include "llvm/Analysis/DataStructure.h" |
| 12 | #include "llvm/Support/InstVisitor.h" |
| 13 | |
| 14 | // DEBUG_DATA_STRUCTURE_CONSTRUCTION - Define this to 1 if you want debug output |
| 15 | #define DEBUG_DATA_STRUCTURE_CONSTRUCTION 0 |
| 16 | |
| 17 | class FunctionRepBuilder; |
| 18 | |
| 19 | // InitVisitor - Used to initialize the worklists for data structure analysis. |
| 20 | // Iterate over the instructions in the method, creating nodes for malloc and |
| 21 | // call instructions. Add all uses of these to the worklist of instructions |
| 22 | // to process. |
| 23 | // |
| 24 | class InitVisitor : public InstVisitor<InitVisitor> { |
| 25 | FunctionRepBuilder *Rep; |
| 26 | Function *Func; |
| 27 | public: |
| 28 | InitVisitor(FunctionRepBuilder *R, Function *F) : Rep(R), Func(F) {} |
| 29 | |
| 30 | void visitCallInst(CallInst *CI); |
| 31 | void visitAllocationInst(AllocationInst *AI); |
| 32 | void visitInstruction(Instruction *I); |
| 33 | |
| 34 | // visitOperand - If the specified instruction operand is a global value, add |
| 35 | // a node for it... |
| 36 | // |
| 37 | void visitOperand(Value *V); |
| 38 | }; |
| 39 | |
| 40 | |
| 41 | // FunctionRepBuilder - This builder object creates the datastructure graph for |
| 42 | // a method. |
| 43 | // |
| 44 | class FunctionRepBuilder : InstVisitor<FunctionRepBuilder> { |
| 45 | friend class InitVisitor; |
| 46 | FunctionDSGraph *F; |
| 47 | PointerValSet RetNode; |
| 48 | |
| 49 | // ValueMap - Mapping between values we are processing and the possible |
| 50 | // datastructures that they may point to... |
| 51 | map<Value*, PointerValSet> ValueMap; |
| 52 | |
| 53 | // CallMap - Keep track of which call nodes correspond to which call insns. |
| 54 | // The reverse mapping is stored in the CallDSNodes themselves. |
| 55 | // |
| 56 | map<CallInst*, CallDSNode*> CallMap; |
| 57 | |
| 58 | // Worklist - Vector of (pointer typed) instructions to process still... |
| 59 | std::vector<Instruction *> WorkList; |
| 60 | |
| 61 | // Nodes - Keep track of all of the resultant nodes, because there may not |
| 62 | // be edges connecting these to anything. |
| 63 | // |
| 64 | std::vector<DSNode*> Nodes; |
| 65 | std::vector<ShadowDSNode*> ShadowNodes; |
| 66 | |
| 67 | // addAllUsesToWorkList - Add all of the instructions users of the specified |
| 68 | // value to the work list for further processing... |
| 69 | // |
| 70 | void addAllUsesToWorkList(Value *V); |
| 71 | |
| 72 | public: |
| 73 | FunctionRepBuilder(FunctionDSGraph *f) : F(f) { |
| 74 | initializeWorkList(F->getFunction()); |
| 75 | processWorkList(); |
| 76 | } |
| 77 | |
| 78 | void addNode(DSNode *N) { Nodes.push_back(N); } |
| 79 | const std::vector<DSNode*> &getNodes() const { return Nodes; } |
| 80 | |
| 81 | void addShadowNode(ShadowDSNode *N) { ShadowNodes.push_back(N); } |
| 82 | const std::vector<ShadowDSNode*> &getShadowNodes() const {return ShadowNodes;} |
| 83 | |
| 84 | const PointerValSet &getRetNode() const { return RetNode; } |
| 85 | |
| 86 | const map<Value*, PointerValSet> &getValueMap() const { return ValueMap; } |
| 87 | private: |
| 88 | static PointerVal getIndexedPointerDest(const PointerVal &InP, |
| 89 | const MemAccessInst *MAI); |
| 90 | |
| 91 | void initializeWorkList(Function *Func); |
| 92 | void processWorkList() { |
| 93 | // While the worklist still has instructions to process, process them! |
| 94 | while (!WorkList.empty()) { |
| 95 | Instruction *I = WorkList.back(); WorkList.pop_back(); |
| 96 | #if DEBUG_DATA_STRUCTURE_CONSTRUCTION |
| 97 | cerr << "Processing worklist inst: " << I; |
| 98 | #endif |
| 99 | |
| 100 | visit(I); // Dispatch to a visitXXX function based on instruction type... |
| 101 | #if DEBUG_DATA_STRUCTURE_CONSTRUCTION |
| 102 | if (I->hasName() && ValueMap.count(I)) { |
| 103 | cerr << "Inst %" << I->getName() << " value is:\n"; |
| 104 | ValueMap[I].print(cerr); |
| 105 | } |
| 106 | #endif |
| 107 | } |
| 108 | } |
| 109 | |
| 110 | //===--------------------------------------------------------------------===// |
| 111 | // Functions used to process the worklist of instructions... |
| 112 | // |
| 113 | // Allow the visitor base class to invoke these methods... |
| 114 | friend class InstVisitor<FunctionRepBuilder>; |
| 115 | |
| 116 | void visitGetElementPtrInst(GetElementPtrInst *GEP); |
| 117 | void visitReturnInst(ReturnInst *RI); |
| 118 | void visitLoadInst(LoadInst *LI); |
| 119 | void visitStoreInst(StoreInst *SI); |
| 120 | void visitCallInst(CallInst *CI); |
| 121 | void visitPHINode(PHINode *PN); |
| 122 | void visitSetCondInst(SetCondInst *SCI) {} // SetEQ & friends are ignored |
| 123 | void visitFreeInst(FreeInst *FI) {} // Ignore free instructions |
| 124 | void visitInstruction(Instruction *I) { |
| 125 | std::cerr << "\n\n\nUNKNOWN INSTRUCTION type: " << I << "\n\n\n"; |
| 126 | assert(0 && "Cannot proceed"); |
| 127 | } |
| 128 | }; |
| 129 | |
| 130 | #endif |