diff options
| author | Chandler Carruth <chandlerc@gmail.com> | 2014-04-26 09:45:55 +0000 |
|---|---|---|
| committer | Chandler Carruth <chandlerc@gmail.com> | 2014-04-26 09:45:55 +0000 |
| commit | 90821c2a93668510bd1703ca9879e9f2e49e5cca (patch) | |
| tree | f32615115035ee0f034a804e1c28f41c9744138a /llvm/lib/CodeGen/CodeGenPrepare.cpp | |
| parent | 5e2d70b9a3ac93069115a0e30749750ae1764c6c (diff) | |
| download | llvm-90821c2a93668510bd1703ca9879e9f2e49e5cca.zip llvm-90821c2a93668510bd1703ca9879e9f2e49e5cca.tar.gz llvm-90821c2a93668510bd1703ca9879e9f2e49e5cca.tar.bz2 | |
[LCG] Rather than removing nodes from the SCC entry set when we process
them, just skip over any DFS-numbered nodes when finding the next root
of a DFS. This allows the entry set to just be a vector as we populate
it from a uniqued source. It also removes the possibility for a linear
scan of the entry set to actually do the removal which can make things
go quadratic if we get unlucky.
llvm-svn: 207312
Diffstat (limited to 'llvm/lib/CodeGen/CodeGenPrepare.cpp')
0 files changed, 0 insertions, 0 deletions