[LCG] Rotate logic applied to the top of the DFSStack to instead be
authorChandler Carruth <chandlerc@gmail.com>
Thu, 24 Apr 2014 09:59:59 +0000 (09:59 +0000)
committerChandler Carruth <chandlerc@gmail.com>
Thu, 24 Apr 2014 09:59:59 +0000 (09:59 +0000)
commit6c7af1bde87d8184d2dda773d68efac61ad128e2
tree62d6b95f0ba56610a023cf421a7b93d14b8a0850
parent9e9ec347602a40f82e6f5f4935908c0c8eb448a7
[LCG] Rotate logic applied to the top of the DFSStack to instead be
applied prior to pushing a node onto the DFSStack. This is the first
step toward avoiding the stack entirely for leaf nodes. It also
simplifies things a bit and I think is pointing the way toward factoring
some more of the shared logic out of the two implementations.

It is also making it more obvious how to restructure the loops
themselves to be a bit easier to read (although no different in terms of
functionality).

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