summaryrefslogtreecommitdiffstats
path: root/llvm/lib/CodeGen/MachineFunctionPass.cpp
diff options
context:
space:
mode:
authorDan Gohman <gohman@apple.com>2010-05-26 18:52:00 +0000
committerDan Gohman <gohman@apple.com>2010-05-26 18:52:00 +0000
commit52c27383241147457f9da0e24e1c7f39b51d80db (patch)
tree428a303382cceacc166d976dcfbbd024164792b0 /llvm/lib/CodeGen/MachineFunctionPass.cpp
parentb3807452fe0bda108731b735004e6678034baff2 (diff)
downloadbcm5719-llvm-52c27383241147457f9da0e24e1c7f39b51d80db.tar.gz
bcm5719-llvm-52c27383241147457f9da0e24e1c7f39b51d80db.zip
Eliminate the use of PriorityQueue and just use a std::vector,
implementing pop with a linear search for a "best" element. The priority queue was a neat idea, but in practice the comparison functions depend on dynamic information. llvm-svn: 104718
Diffstat (limited to 'llvm/lib/CodeGen/MachineFunctionPass.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud