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

[Misha Brukman]

Changes in directory llvm/lib/Analysis/DataStructure:

DataStructure.cpp updated: 1.119 -> 1.120
DataStructureAA.cpp updated: 1.9 -> 1.10
Local.cpp updated: 1.60 -> 1.61

---
Log message:

Fixed spelling and grammar.


---
Diffs of the changes:

Index: llvm/lib/Analysis/DataStructure/DataStructure.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.119 llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.120
--- llvm/lib/Analysis/DataStructure/DataStructure.cpp:1.119	Tue Aug  5 13:38:37 2003
+++ llvm/lib/Analysis/DataStructure/DataStructure.cpp	Thu Sep 11 13:12:35 2003
@@ -960,7 +960,7 @@
   }
 
   if (!(CloneFlags & DontCloneAuxCallNodes)) {
-    // Copy the auxillary function calls list...
+    // Copy the auxiliary function calls list...
     unsigned FC = AuxFunctionCalls.size();  // FirstCall
     AuxFunctionCalls.reserve(FC+G.AuxFunctionCalls.size());
     for (unsigned i = 0, ei = G.AuxFunctionCalls.size(); i != ei; ++i)
@@ -1062,7 +1062,7 @@
   // Actually mark the node
   N->setIncompleteMarker();
 
-  // Recusively process children...
+  // Recursively process children...
   for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize)
     if (DSNode *DSN = N->getLink(i).getNode())
       markIncompleteNode(DSN);
@@ -1386,7 +1386,7 @@
   // merging...
   removeTriviallyDeadNodes();
 
-  // FIXME: Merge nontrivially identical call nodes...
+  // FIXME: Merge non-trivially identical call nodes...
 
   // Alive - a set that holds all nodes found to be reachable/alive.
   hash_set<DSNode*> Alive;


Index: llvm/lib/Analysis/DataStructure/DataStructureAA.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.9 llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.10
--- llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.9	Wed Jul  2 18:56:51 2003
+++ llvm/lib/Analysis/DataStructure/DataStructureAA.cpp	Thu Sep 11 13:12:35 2003
@@ -102,7 +102,7 @@
       DSNode  *N1 = I->second.getNode(),  *N2 = J->second.getNode();
       unsigned O1 = I->second.getOffset(), O2 = J->second.getOffset();
         
-      // We can only make a judgement of one of the nodes is complete...
+      // We can only make a judgment of one of the nodes is complete...
       if (N1->isComplete() || N2->isComplete()) {
         if (N1 != N2)
           return NoAlias;   // Completely different nodes.


Index: llvm/lib/Analysis/DataStructure/Local.cpp
diff -u llvm/lib/Analysis/DataStructure/Local.cpp:1.60 llvm/lib/Analysis/DataStructure/Local.cpp:1.61
--- llvm/lib/Analysis/DataStructure/Local.cpp:1.60	Fri Aug  1 17:14:28 2003
+++ llvm/lib/Analysis/DataStructure/Local.cpp	Thu Sep 11 13:12:35 2003
@@ -347,7 +347,7 @@
           unsigned RawOffset = Offset+Value.getOffset();
 
           // Loop over all of the elements of the array, merging them into the
-          // zero'th element.
+          // zeroth element.
           for (unsigned i = 1, e = ATy->getNumElements(); i != e; ++i)
             // Merge all of the byte components of this array element
             for (unsigned j = 0; j != ElSize; ++j)