Chandler Carruth 464bda3a16 Teach the reassociate pass to fold chains of multiplies with repeated ... elements to minimize the number of multiplies required to compute the final result. This uses a heuristic to attempt to form near-optimal binary exponentiation-style multiply chains. While there are some cases it misses, it seems to at least a decent job on a very diverse range of inputs. Initial benchmarks show no interesting regressions, and an 8% improvement on SPASS. Let me know if any other interesting results (in either direction) crop up! Credit to Richard Smith for the core algorithm, and helping code the patch itself. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@155616 91177308-0d34-0410-b5e6-96231b3b80d8		2012-04-26 05:30:30 +00:00
..
2002-05-15-AgressiveSubMove.ll
2002-05-15-MissedTree.ll
2002-05-15-SubReassociate2.ll
2002-05-15-SubReassociate.ll
2002-07-09-DominanceProblem.ll
2003-08-12-InfiniteLoop.ll
2005-08-24-Crash.ll
2005-09-01-ArrayOutOfBounds.ll
2006-04-27-ReassociateVector.ll
2011-01-26-UseAfterFree.ll	Land the long talked about "type system rewrite" patch. This	2011-07-09 17:41:24 +00:00
basictest.ll
crash.ll	Fix reassociate to postpone certain instruction deletions until	2011-03-10 19:51:54 +00:00
inverses.ll
lit.local.cfg	Replace all instances of dg.exp file with lit.local.cfg, since all tests are run with LIT now and now Dejagnu. dg.exp is no longer needed.	2012-02-16 06:28:33 +00:00
looptest.ll
mulfactor.ll	Teach the reassociate pass to fold chains of multiplies with repeated	2012-04-26 05:30:30 +00:00
negation.ll
optional-flags.ll	fix PR9215, preventing -reassociate from clearing nsw/nuw when	2011-02-17 01:29:24 +00:00
otherops.ll
secondary.ll	Fix reassociate to use a worklist instead of recursing when new	2011-04-12 00:11:56 +00:00
shift-factor.ll
shifttest.ll
subtest2.ll
subtest.ll