fix a bug in post-order iterators with external storage, patch by

[oota-llvm.git] / include / llvm / ADT / GraphTraits.h

diff --git a/include/llvm/ADT/GraphTraits.h b/include/llvm/ADT/GraphTraits.h
index 2b3a78b336c30e30214422e0fa033acddb226481..2d103cf83eb83f414f366ce84aa9d02663ba308d 100644 (file)
--- a/include/llvm/ADT/GraphTraits.h
+++ b/include/llvm/ADT/GraphTraits.h
@@ -2,8 +2,8 @@
 //
 //                     The LLVM Compiler Infrastructure
 //
-// This file was developed by the LLVM research group and is distributed under
-// the University of Illinois Open Source License. See LICENSE.TXT for details.
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
@@ -78,21 +78,21 @@ struct Inverse {
   inline Inverse(const GraphType &G) : Graph(G) {}
 };
 
-// Provide a partial specialization of GraphTraits so that the inverse of an inverse
-// falls back to the original graph.
+// Provide a partial specialization of GraphTraits so that the inverse of an
+// inverse falls back to the original graph.
 template<class T>
 struct GraphTraits<Inverse<Inverse<T> > > {
   typedef typename GraphTraits<T>::NodeType NodeType;
   typedef typename GraphTraits<T>::ChildIteratorType ChildIteratorType;
-  
+
   static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
     return GraphTraits<T>::getEntryNode(G->Graph.Graph);
   }
-  
+
   static ChildIteratorType child_begin(NodeType* N) {
     return GraphTraits<T>::child_begin(N);
   }
-  
+
   static ChildIteratorType child_end(NodeType* N) {
     return GraphTraits<T>::child_end(N);
   }