From 3ebd0eeaeb94b7f607409408e3c25024db671b66 Mon Sep 17 00:00:00 2001 From: Dan Gohman Date: Fri, 21 Nov 2008 19:10:41 +0000 Subject: [PATCH] Update comments. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@59834 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/CodeGen/SelectionDAG/SelectionDAG.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/CodeGen/SelectionDAG/SelectionDAG.cpp b/lib/CodeGen/SelectionDAG/SelectionDAG.cpp index d22a65d2ff8..02159de0c75 100644 --- a/lib/CodeGen/SelectionDAG/SelectionDAG.cpp +++ b/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; } -- 2.34.1