[llvm-commits] [llvm] r59834 - /llvm/trunk/lib/CodeGen/SelectionDAG/SelectionDAG.cpp

Dan Gohman gohman at apple.com
Fri Nov 21 11:10:41 PST 2008


Author: djg
Date: Fri Nov 21 13:10:41 2008
New Revision: 59834

URL: http://llvm.org/viewvc/llvm-project?rev=59834&view=rev
Log:
Update comments.

Modified:
    llvm/trunk/lib/CodeGen/SelectionDAG/SelectionDAG.cpp

Modified: llvm/trunk/lib/CodeGen/SelectionDAG/SelectionDAG.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CodeGen/SelectionDAG/SelectionDAG.cpp?rev=59834&r1=59833&r2=59834&view=diff

==============================================================================
--- llvm/trunk/lib/CodeGen/SelectionDAG/SelectionDAG.cpp (original)
+++ llvm/trunk/lib/CodeGen/SelectionDAG/SelectionDAG.cpp Fri Nov 21 13:10:41 2008
@@ -4647,8 +4647,8 @@
   // it is at the end of the list.
   allnodes_iterator SortedPos = allnodes_begin();
 
-  // Visit all the nodes. Add nodes with no operands to the TopOrder result
-  // array immediately. Annotate nodes that do have operands with their
+  // Visit all the nodes. Move nodes with no operands to the front of
+  // the list immediately. Annotate nodes that do have operands with their
   // operand count. Before we do this, the Node Id fields of the nodes
   // may contain arbitrary values. After, the Node Id fields for nodes
   // before SortedPos will contain the topological sort index, and the
@@ -4704,7 +4704,7 @@
          "Last node in topologic sort has unexpected id!");
   assert(AllNodes.back().use_empty() &&
          "Last node in topologic sort has users!");
-  assert(DAGSize == allnodes_size() && "TopOrder result count mismatch!");
+  assert(DAGSize == allnodes_size() && "Node count mismatch!");
   return DAGSize;
 }
 





More information about the llvm-commits mailing list