Dan Gohman 5a2169ee6e Optimize SelectionDAG's AssignTopologicalOrder even further.
Completely eliminate the TopOrder std::vector. Instead, sort
the AllNodes list in place. This also eliminates the need to
call AllNodes.size(), a linear-time operation, before
performing the sort.

Also, eliminate the Sources temporary std::vector, since it
essentially duplicates the sorted result as it is being
built.

This also changes the direction of the topological sort
from bottom-up to top-down. The AllNodes list starts out in
roughly top-down order, so this reduces the amount of
reordering needed. Top-down is also more convenient for
Legalize, and ISel needed only minor adjustments.

llvm-svn: 56867
2008-09-30 18:30:35 +00:00
..
2008-09-22 10:06:26 +00:00
2008-09-25 21:00:45 +00:00
2008-09-22 23:28:18 +00:00
2008-09-25 21:00:45 +00:00
2008-09-27 00:08:24 +00:00
2008-09-29 18:16:38 +00:00
2008-09-25 21:00:45 +00:00
2008-02-27 06:33:05 +00:00
2008-07-17 16:51:19 +00:00
2008-04-01 04:00:45 +00:00
2008-07-05 22:41:37 +00:00
2008-07-01 17:44:24 +00:00
2008-06-24 17:46:48 +00:00
2008-08-23 22:43:21 +00:00