[llvm-commits] CVS: llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp GraphAuxiliary.cpp ProfilePaths.cpp

[Misha Brukman]

Changes in directory llvm/lib/Transforms/Instrumentation/ProfilePaths:

Graph.cpp updated: 1.10 -> 1.11
GraphAuxiliary.cpp updated: 1.17 -> 1.18
ProfilePaths.cpp updated: 1.33 -> 1.34

---
Log message:

Fix spelling.


---
Diffs of the changes:  (+11 -11)

Index: llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp
diff -u llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp:1.10 llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp:1.11
--- llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp:1.10	Fri Aug  1 17:15:02 2003
+++ llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.cpp	Fri Oct 10 12:49:04 2003
@@ -174,7 +174,7 @@
 
 //add an edge
 //this adds an edge ONLY when 
-//the edge to be added doesn not already exist
+//the edge to be added does not already exist
 //we "equate" two edges here only with their 
 //end points
 void Graph::addEdge(Edge ed, int w){
@@ -497,7 +497,7 @@
 
 //reverse the sign of weights on edges
 //this way, max-spanning tree could be obtained
-//usin min-spanning tree, and vice versa
+//using min-spanning tree, and vice versa
 void Graph::reverseWts(){
   vector<Node *> allNodes=getAllNodes();
   for(vector<Node *>::iterator NI=allNodes.begin(), NE=allNodes.end(); NI!=NE; 


Index: llvm/lib/Transforms/Instrumentation/ProfilePaths/GraphAuxiliary.cpp
diff -u llvm/lib/Transforms/Instrumentation/ProfilePaths/GraphAuxiliary.cpp:1.17 llvm/lib/Transforms/Instrumentation/ProfilePaths/GraphAuxiliary.cpp:1.18
--- llvm/lib/Transforms/Instrumentation/ProfilePaths/GraphAuxiliary.cpp:1.17	Wed Sep 10 15:35:21 2003
+++ llvm/lib/Transforms/Instrumentation/ProfilePaths/GraphAuxiliary.cpp	Fri Oct 10 12:49:04 2003
@@ -1,6 +1,6 @@
-//===-- GrapAuxillary.cpp- Auxillary functions on graph ----------*- C++ -*--=//
+//===-- GrapAuxiliary.cpp- Auxiliary functions on graph ----------*- C++ -*--=//
 //
-//auxillary function associated with graph: they
+//auxiliary function associated with graph: they
 //all operate on graph, and help in inserting
 //instrumentation for trace generation
 //
@@ -132,7 +132,7 @@
 }
 
 //This is a helper function to get the edge increments
-//This is used in conjuntion with inc_DFS
+//This is used in conjunction with inc_DFS
 //to get the edge increments
 //Edge increment implies assigning a value to all the edges in the graph
 //such that if we traverse along any path from root to exit, and
@@ -144,7 +144,7 @@
  if(e.isNull()) 
     return 1;
  
- //check that the edges must have atleast one common endpoint
+ //check that the edges must have at least one common endpoint
   assert(*(e.getFirst())==*(f.getFirst()) ||
 	 *(e.getFirst())==*(f.getSecond()) || 
 	 *(e.getSecond())==*(f.getFirst()) ||


Index: llvm/lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp
diff -u llvm/lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp:1.33 llvm/lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp:1.34
--- llvm/lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp:1.33	Wed Sep 24 17:06:25 2003
+++ llvm/lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp	Fri Oct 10 12:49:04 2003
@@ -1,6 +1,6 @@
 //===-- ProfilePaths.cpp - interface to insert instrumentation ---*- C++ -*--=//
 //
-// This inserts intrumentation for counting
+// This inserts instrumentation for counting
 // execution of paths though a given function
 // Its implemented as a "Function" Pass, and called using opt
 //
@@ -13,7 +13,7 @@
 //
 // The algorithms work on a Graph constructed over the nodes
 // made from Basic Blocks: The transformations then take place on
-// the constucted graph (implementation in Graph.cpp and GraphAuxillary.cpp)
+// the constructed graph (implementation in Graph.cpp and GraphAuxiliary.cpp)
 // and finally, appropriate instrumentation is placed over suitable edges.
 // (code inserted through EdgeCode.cpp).
 // 
@@ -81,7 +81,7 @@
   Node *tmp;
   Node *exitNode = 0, *startNode = 0;
 
-  // The nodes must be uniquesly identified:
+  // The nodes must be uniquely identified:
   // That is, no two nodes must hav same BB*
   
   for (Function::iterator BB = F.begin(), BE = F.end(); BB != BE; ++BB) {
@@ -93,7 +93,7 @@
       startNode=nd;
   }
 
-  // now do it againto insert edges
+  // now do it again to insert edges
   for (Function::iterator BB = F.begin(), BE = F.end(); BB != BE; ++BB){
     Node *nd=findBB(nodes, BB);
     assert(nd && "No node for this edge!");
@@ -174,7 +174,7 @@
 
 
   if(fr->getParent()->getName() == "main"){
-    //intialize threshold
+    //initialize threshold
 
     // FIXME: THIS IS HORRIBLY BROKEN.  FUNCTION PASSES CANNOT DO THIS, EXCEPT
     // IN THEIR INITIALIZE METHOD!!