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 fde7c82abbe72a791da69dfe5ee37f5a31a4e711..2b0faa238279407b677601b288a455274865297c 100644 (file)
--- 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));