Stepan Dyatkovskiy 88c5c42c5c Improved compile time: ... 1. Size heuristics changed. Now we calculate number of unswitching branches only once per loop. 2. Some checks was moved from UnswitchIfProfitable to processCurrentLoop, since it is not changed during processCurrentLoop iteration. It allows decide to skip some loops at an early stage. Extended statistics: - Added total number of instructions analyzed. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@147935 91177308-0d34-0410-b5e6-96231b3b80d8		2012-01-11 08:40:51 +00:00
..
2006-06-13-SingleEntryPHI.ll
2006-06-27-DeadSwitchCase.ll
2007-05-09-tl.ll
2007-05-09-Unreachable.ll
2007-07-12-ExitDomInfo.ll
2007-07-13-DomInfo.ll
2007-07-18-DomInfo.ll
2007-08-01-Dom.ll
2007-08-01-LCSSA.ll
2007-10-04-DomFrontier.ll
2008-06-02-DomInfo.ll
2008-06-17-DomFrontier.ll
2008-11-03-Invariant.ll
2010-11-18-LCSSA.ll	Factor code for testing whether replacing one value with another	2010-11-18 19:59:41 +00:00
2011-06-02-CritSwitch.ll	Bail on unswitching a switch statement for a case with a critical edge. We name	2011-06-03 06:27:15 +00:00
2011-09-26-EHCrash.ll	Split the landing pad basic block with the correct function. Also merge the	2011-09-27 00:59:31 +00:00
2011-11-18-SimpleSwitch.ll	Reinstate r146578; it doesn't appear to be the cause of some recent execution-	2011-12-22 21:06:36 +00:00
2011-11-18-TwoSwitches-Threshold.ll	Improved compile time:	2012-01-11 08:40:51 +00:00
2011-11-18-TwoSwitches.ll	Reinstate r146578; it doesn't appear to be the cause of some recent execution-	2011-12-22 21:06:36 +00:00
basictest.ll
crash.ll
dg.exp
infinite-loop.ll
preserve-analyses.ll