From 8dfa51c5efe2e0b7da9f66e7d5d1d29931430630 Mon Sep 17 00:00:00 2001 From: Dan Gohman Date: Fri, 21 Nov 2008 19:10:41 +0000 Subject: [PATCH] Update comments. llvm-svn: 59834 --- llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp b/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp index d22a65d2ff8e..02159de0c758 100644 --- a/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp +++ b/llvm/lib/CodeGen/SelectionDAG/SelectionDAG.cpp @@ -4647,8 +4647,8 @@ unsigned SelectionDAG::AssignTopologicalOrder() { // 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 @@ unsigned SelectionDAG::AssignTopologicalOrder() { "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; }