[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/DataStructure.cpp TopDownClosure.cpp

[Misha Brukman]

Changes in directory llvm/lib/Analysis/DataStructure:

DataStructure.cpp updated: 1.172 -> 1.173
TopDownClosure.cpp updated: 1.66 -> 1.67

---
Log message:

Wrapped code and comments at 80 cols; doxygenified some comments.


---
Diffs of the changes:  (+20 -18)

Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.172 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.173
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.172	Fri Mar 12 19:14:23 2004
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp	Wed Apr 28 23:05:30 2004
@@ -464,7 +464,8 @@
   // If we found our type exactly, early exit
   if (SubType == NewTy) return false;
 
-  // Differing function types don't require us to merge.  They are not values anyway.
+  // Differing function types don't require us to merge.  They are not values
+  // anyway.
   if (isa<FunctionType>(SubType) &&
       isa<FunctionType>(NewTy)) return false;
 
@@ -555,9 +556,9 @@
 
 
 
-// addEdgeTo - Add an edge from the current node to the specified node.  This
-// can cause merging of nodes in the graph.
-//
+/// addEdgeTo - Add an edge from the current node to the specified node.  This
+/// can cause merging of nodes in the graph.
+///
 void DSNode::addEdgeTo(unsigned Offset, const DSNodeHandle &NH) {
   if (NH.isNull()) return;       // Nothing to do
 
@@ -571,10 +572,10 @@
 }
 
 
-// MergeSortedVectors - Efficiently merge a vector into another vector where
-// duplicates are not allowed and both are sorted.  This assumes that 'T's are
-// efficiently copyable and have sane comparison semantics.
-//
+/// MergeSortedVectors - Efficiently merge a vector into another vector where
+/// duplicates are not allowed and both are sorted.  This assumes that 'T's are
+/// efficiently copyable and have sane comparison semantics.
+///
 static void MergeSortedVectors(std::vector<GlobalValue*> &Dest,
                                const std::vector<GlobalValue*> &Src) {
   // By far, the most common cases will be the simple ones.  In these cases,
@@ -722,14 +723,14 @@
 }
 
 
-// mergeWith - Merge this node and the specified node, moving all links to and
-// from the argument node into the current node, deleting the node argument.
-// Offset indicates what offset the specified node is to be merged into the
-// current node.
-//
-// The specified node may be a null pointer (in which case, we update it to
-// point to this node).
-//
+/// mergeWith - Merge this node and the specified node, moving all links to and
+/// from the argument node into the current node, deleting the node argument.
+/// Offset indicates what offset the specified node is to be merged into the
+/// current node.
+///
+/// The specified node may be a null pointer (in which case, we update it to
+/// point to this node).
+///
 void DSNode::mergeWith(const DSNodeHandle &NH, unsigned Offset) {
   DSNode *N = NH.getNode();
   if (N == this && NH.getOffset() == Offset)


Index: llvm/lib/Analysis/DataStructure/TopDownClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.66 llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.67
--- llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.66	Sat Feb  7 19:51:48 2004
+++ llvm/lib/Analysis/DataStructure/TopDownClosure.cpp	Wed Apr 28 23:05:30 2004
@@ -62,9 +62,10 @@
   // globals graph.
   const DSScalarMap &GGSM = GlobalsGraph->getScalarMap();
   hash_set<DSNode*> Visited;
-  for (DSScalarMap::global_iterator I = GGSM.global_begin(), E = GGSM.global_end();
+  for (DSScalarMap::global_iterator I=GGSM.global_begin(), E=GGSM.global_end();
        I != E; ++I)
-    markReachableFunctionsExternallyAccessible(GGSM.find(*I)->second.getNode(), Visited);
+    markReachableFunctionsExternallyAccessible(GGSM.find(*I)->second.getNode(),
+                                               Visited);
 
   // Loop over unresolved call nodes.  Any functions passed into (but not
   // returned!) from unresolvable call nodes may be invoked outside of the