Optimize ScheduleDAGRRList's topological sort to use one pass instead
authorDan Gohman <gohman@apple.com>
Wed, 27 Aug 2008 16:29:48 +0000 (16:29 +0000)
committerDan Gohman <gohman@apple.com>
Wed, 27 Aug 2008 16:29:48 +0000 (16:29 +0000)
commite5a8dc5cc4647cdfd97c71165d4c8f805b4c78a3
tree4f2686b954104845edb470029c9298e3b36d2fe6
parent3a09d891a47c3f887bb1d9fec0355dffdc205b38
Optimize ScheduleDAGRRList's topological sort to use one pass instead
of two, and to not need a scratch std::vector. Also, compute the ordering
immediately in the result array, instead of in another scratch std::vector
that is copied to the result array.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@55421 91177308-0d34-0410-b5e6-96231b3b80d8
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp