Chandler Carruth febf86d7e3 [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). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@207935 91177308-0d34-0410-b5e6-96231b3b80d8		2014-05-04 09:38:32 +00:00
..
ADT	Fix a use of uninitialized memory in SmallVector's move-assignment operator.	2014-04-30 15:49:06 +00:00
Analysis	[LCG] Add the last (and most complex) of the edge insertion mutation	2014-05-04 09:38:32 +00:00
Bitcode
CodeGen
DebugInfo
ExecutionEngine	[PM] Add pass run listeners to the pass manager.	2014-04-28 18:19:25 +00:00
IR
LineEditor	raw_ostream: Forward declare OpenFlags and include FileSystem.h only where necessary.	2014-04-29 23:26:49 +00:00
Linker	LinkModulesTest.cpp: Reformat.	2014-04-29 15:52:46 +00:00
MC
Object	ELFObjectWriter: deduplicate suffices in strtab	2014-04-30 16:25:02 +00:00
Option
Support	SupportTest: Fix test names harder	2014-04-29 17:07:45 +00:00
Transforms
CMakeLists.txt	[CMake] Enable llvm/unittests/LinkerTests. It had not been enabled since r199354.	2014-04-29 15:52:36 +00:00
Makefile
Makefile.unittest