Chandler Carruth b9619110af [LCG] Implement Tarjan's algorithm correctly this time. We have to walk ... up the stack finishing the exploration of each entries children before we're finished in addition to accounting for their low-links. Added a unittest that really hammers home the need for this with interlocking cycles that would each appear distinct otherwise and crash or compute the wrong result. As part of this, nuke a stale fixme and bring the rest of the implementation still more closely in line with the original algorithm. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@206966 91177308-0d34-0410-b5e6-96231b3b80d8		2014-04-23 10:31:17 +00:00
..
CFGTest.cpp	Replace OwningPtr<T> with std::unique_ptr<T>.	2014-03-06 05:51:42 +00:00
CMakeLists.txt	[LCG] Add a unittest for the LazyCallGraph. I had a weak moment and	2014-04-23 08:08:49 +00:00
LazyCallGraphTest.cpp	[LCG] Implement Tarjan's algorithm correctly this time. We have to walk	2014-04-23 10:31:17 +00:00
Makefile	Reimplement isPotentiallyReachable to make nocapture deduction much stronger.	2013-07-27 01:24:00 +00:00
ScalarEvolutionTest.cpp	Move all of the header files which are involved in modelling the LLVM IR	2013-01-02 11:36:10 +00:00