Dan Gohman f06c835f76 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.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@56867 91177308-0d34-0410-b5e6-96231b3b80d8
2008-09-30 18:30:35 +00:00
2008-09-26 04:40:32 +00:00
2008-09-30 15:18:29 +00:00
2008-01-24 05:16:36 +00:00
2008-09-26 04:40:32 +00:00
2007-08-03 05:43:35 +00:00
2008-09-24 17:23:28 +00:00
2008-09-26 04:40:32 +00:00
2008-07-28 20:50:25 +00:00

Low Level Virtual Machine (LLVM)
================================

This directory and its subdirectories contain source code for the Low Level 
Virtual Machine, a toolkit for the construction of highly optimized compilers,
optimizers, and runtime environments. 

LLVM is open source software. You may freely distribute it under the terms of
the license agreement found in LICENSE.txt.

Please see the HTML documentation provided in docs/index.html for further
assistance with LLVM.
Description
Mirror of official llvm git repository located at http://llvm.org/git/llvm. Updated every five minutes.
Readme 473 MiB
Languages
LLVM 46.9%
C++ 42.5%
Assembly 8.9%
C 0.6%
Python 0.4%
Other 0.5%