From: Chris Lattner <sabre@nondot.org>
Date: Sun, 17 Nov 2002 23:10:27 +0000 (+0000)
Subject: Omit the indirect node when printing call graphs
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=e9c04aedcad5916e5fad3d5fcd2fb47fcb530712;p=oota-llvm.git

Omit the indirect node when printing call graphs


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@4733 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/include/llvm/Analysis/CallGraph.h b/include/llvm/Analysis/CallGraph.h
index fde7c82abbe..2b0faa23827 100644
--- a/include/llvm/Analysis/CallGraph.h
+++ b/include/llvm/Analysis/CallGraph.h
@@ -253,7 +253,9 @@ template<> struct GraphTraits<CallGraph*> : public GraphTraits<CallGraphNode*> {
   // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
   typedef mapped_iterator<CallGraph::iterator, DerefFun> nodes_iterator;
   static nodes_iterator nodes_begin(CallGraph *CG) {
-    return map_iterator(CG->begin(), DerefFun(CGdereference));
+    CallGraph::iterator I = CG->begin();
+    ++I;
+    return map_iterator(I, DerefFun(CGdereference));
   }
   static nodes_iterator nodes_end  (CallGraph *CG) {
     return map_iterator(CG->end(), DerefFun(CGdereference));