RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity

Update comments.

Browse Source 
llvm-svn: 59834
This commit is contained in:
Dan Gohman 2008-11-21 19:10:41 +00:00
parent 08bdf9dfab
commit 13a8a98bd8
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/CodeGen/SelectionDAG/SelectionDAG.cpp
View File

@ -4647,8 +4647,8 @@ unsigned SelectionDAG::AssignTopologicalOrder() {
// it is at the end of the list. // it is at the end of the list.
allnodes_iterator SortedPos = allnodes_begin(); allnodes_iterator SortedPos = allnodes_begin();
// Visit all the nodes. Add nodes with no operands to the TopOrder result // Visit all the nodes. Move nodes with no operands to the front of
// array immediately. Annotate nodes that do have operands with their // the list immediately. Annotate nodes that do have operands with their
// operand count. Before we do this, the Node Id fields of the nodes // operand count. Before we do this, the Node Id fields of the nodes
// may contain arbitrary values. After, the Node Id fields for nodes // may contain arbitrary values. After, the Node Id fields for nodes
// before SortedPos will contain the topological sort index, and the // 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!"); "Last node in topologic sort has unexpected id!");
assert(AllNodes.back().use_empty() && assert(AllNodes.back().use_empty() &&
"Last node in topologic sort has users!"); "Last node in topologic sort has users!");
assert(DAGSize == allnodes_size() && "TopOrder result count mismatch!"); assert(DAGSize == allnodes_size() && "Node count mismatch!");
return DAGSize; return DAGSize;
} }