Chandler Carruth 2ccafe8399 [LCG] Add the last (and most complex) of the edge insertion mutation ... operations on the call graph. This one forms a cycle, and while not as complex as removing an internal edge from an SCC, it involves a reasonable amount of work to find all of the nodes newly connected in a cycle. Also somewhat alarming is the worst case complexity here: it might have to walk roughly the entire SCC inverse DAG to insert a single edge. This is carefully documented in the API (I hope). llvm-svn: 207935		2014-05-04 09:38:32 +00:00
..
CFGTest.cpp	Replace OwningPtr<T> with std::unique_ptr<T>.	2014-03-06 05:51:42 +00:00
CMakeLists.txt	[TBAA] Fix handling of mixed TBAA (path-aware and non-path-aware TBAA).	2014-05-03 22:32:52 +00:00
LazyCallGraphTest.cpp	[LCG] Add the last (and most complex) of the edge insertion mutation	2014-05-04 09:38:32 +00:00
Makefile	Reimplement isPotentiallyReachable to make nocapture deduction much stronger.	2013-07-27 01:24:00 +00:00
MixedTBAATest.cpp	[TBAA] Fix handling of mixed TBAA (path-aware and non-path-aware TBAA).	2014-05-03 22:32:52 +00:00
ScalarEvolutionTest.cpp