[LCG] Rather than removing nodes from the SCC entry set when we process
authorChandler Carruth <chandlerc@gmail.com>
Sat, 26 Apr 2014 09:45:55 +0000 (09:45 +0000)
committerChandler Carruth <chandlerc@gmail.com>
Sat, 26 Apr 2014 09:45:55 +0000 (09:45 +0000)
commit9a1fab37c72e134bfca980bd69a58a593a7bc148
tree35151a4f74dfdcead3a28f4853fedfa4ef4b541f
parent797bbced53454aeb6bb143bcd23db5a32b4a9b06
[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.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@207312 91177308-0d34-0410-b5e6-96231b3b80d8
include/llvm/Analysis/LazyCallGraph.h
lib/Analysis/LazyCallGraph.cpp