Chandler Carruth 797bbced53 [LCG] Rotate the full SCC finding algorithm to avoid round-trips through ... the DFS stack for leaves in the call graph. As mentioned in my previous commit, this is particularly interesting for graphs which have high fan out but low connectivity resulting in many leaves. For such graphs, this can remove a large % of the DFS stack traffic even though it doesn't make the stack much smaller. It's a bit easier to formulate this for the full algorithm because that one stops completely for each SCC. For example, I was able to directly eliminate the "Recurse" boolean used to continue an outer loop from the inner loop. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@207311 91177308-0d34-0410-b5e6-96231b3b80d8		2014-04-26 09:28:00 +00:00
..
Analysis	[LCG] Rotate the full SCC finding algorithm to avoid round-trips through	2014-04-26 09:28:00 +00:00
AsmParser
Bitcode
CodeGen	[DAG] During DAG legalization keep opaque constants even after expanding.	2014-04-26 02:58:04 +00:00
DebugInfo	Fix missing include	2014-04-25 21:42:35 +00:00
ExecutionEngine
IR	Add missing include guards and missing #include, found by modules build.	2014-04-26 00:53:26 +00:00
IRReader
LineEditor
Linker
LTO	Add an -mattr option to the gold plugin to support subtarget features in LTO	2014-04-25 21:46:51 +00:00
MC	Fix quadratic performance during debug compression due to sections x symbols iteration.	2014-04-25 00:48:01 +00:00
Object
Option
ProfileData	ProfileData: Treat missing function counts as malformed	2014-04-25 02:45:33 +00:00
Support
TableGen
Target	[X86] Implement TargetLowering::getScalingFactorCost hook.	2014-04-26 01:11:26 +00:00
Transforms	RecursivelyDeleteTriviallyDeadInstructions() could remove	2014-04-26 05:58:11 +00:00
CMakeLists.txt
LLVMBuild.txt
Makefile