diff options
author | Duncan Sands <baldrick@free.fr> | 2008-09-05 12:31:56 +0000 |
---|---|---|
committer | Duncan Sands <baldrick@free.fr> | 2008-09-05 12:31:56 +0000 |
commit | e4a48c75810653dd3e566967b5ad4190d2101d05 (patch) | |
tree | 395e5c68035b70ea74bdcbb34a658b2e800480ee /include/llvm/Analysis/CallGraph.h | |
parent | cae62e34984e413414304eab959797ec5c2cbf32 (diff) | |
download | external_llvm-e4a48c75810653dd3e566967b5ad4190d2101d05.zip external_llvm-e4a48c75810653dd3e566967b5ad4190d2101d05.tar.gz external_llvm-e4a48c75810653dd3e566967b5ad4190d2101d05.tar.bz2 |
Strip trailing whitespace.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@55834 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/Analysis/CallGraph.h')
-rw-r--r-- | include/llvm/Analysis/CallGraph.h | 28 |
1 files changed, 14 insertions, 14 deletions
diff --git a/include/llvm/Analysis/CallGraph.h b/include/llvm/Analysis/CallGraph.h index 3fe03b5..5fd0bdc 100644 --- a/include/llvm/Analysis/CallGraph.h +++ b/include/llvm/Analysis/CallGraph.h @@ -104,16 +104,16 @@ public: return I->second; } - /// Returns the CallGraphNode which is used to represent undetermined calls + /// Returns the CallGraphNode which is used to represent undetermined calls /// into the callgraph. Override this if you want behavioral inheritance. virtual CallGraphNode* getExternalCallingNode() const { return 0; } - + /// Return the root/main method in the module, or some other root node, such - /// as the externalcallingnode. Overload these if you behavioral + /// as the externalcallingnode. Overload these if you behavioral /// inheritance. virtual CallGraphNode* getRoot() { return 0; } virtual const CallGraphNode* getRoot() const { return 0; } - + //===--------------------------------------------------------------------- // Functions to keep a call graph up to date with a function that has been // modified. @@ -140,17 +140,17 @@ public: /// it will insert a new CallGraphNode for the specified function if one does /// not already exist. CallGraphNode *getOrInsertFunction(const Function *F); - + //===--------------------------------------------------------------------- // Pass infrastructure interface glue code... // protected: CallGraph() {} - + public: virtual ~CallGraph() { destroy(); } - /// initialize - Call this method before calling other methods, + /// initialize - Call this method before calling other methods, /// re/initializes the state of the CallGraph. /// void initialize(Module &M); @@ -158,7 +158,7 @@ public: virtual void print(std::ostream &o, const Module *M) const; void print(std::ostream *o, const Module *M) const { if (o) print(*o, M); } void dump() const; - + protected: // destroy - Release memory for the call graph virtual void destroy(); @@ -229,7 +229,7 @@ public: /// specified call site. Note that this method takes linear time, so it /// should be used sparingly. void removeCallEdgeFor(CallSite CS); - + /// removeAnyCallEdgeTo - This method removes any call edges from this node to /// the specified callee function. This takes more time to execute than /// removeCallEdgeTo, so it should not be used unless necessary. @@ -253,22 +253,22 @@ template <> struct GraphTraits<CallGraphNode*> { typedef std::pair<CallSite, CallGraphNode*> CGNPairTy; typedef std::pointer_to_unary_function<CGNPairTy, CallGraphNode*> CGNDerefFun; - + static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; } - + typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType; - + static inline ChildIteratorType child_begin(NodeType *N) { return map_iterator(N->begin(), CGNDerefFun(CGNDeref)); } static inline ChildIteratorType child_end (NodeType *N) { return map_iterator(N->end(), CGNDerefFun(CGNDeref)); } - + static CallGraphNode *CGNDeref(CGNPairTy P) { return P.second; } - + }; template <> struct GraphTraits<const CallGraphNode*> { |