Hal Finkel 64e1b28643 Allow BBVectorize to form non-2^n-length vectors. ... The original algorithm only used recursive pair fusion of equal-length types. This is now extended to allow pairing of any types that share the same underlying scalar type. Because we would still generally prefer the 2^n-length types, those are formed first. Then a second set of iterations form the non-2^n-length types. Also, a call to SimplifyInstructionsInBlock has been added after each pairing iteration. This takes care of DCE (and a few other things) that make the following iterations execute somewhat faster. For the same reason, some of the simple shuffle-combination cases are now handled internally. There is some additional refactoring work to be done, but I've had many requests for this feature, so additional refactoring will come soon in future commits (as will additional test cases). git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@159330 91177308-0d34-0410-b5e6-96231b3b80d8		2012-06-28 05:42:42 +00:00
..
cycle.ll
func-alias.ll
ld1.ll
lit.local.cfg
loop1.ll
mem-op-depth.ll
metadata.ll
no-ldstr-conn.ll
req-depth.ll
search-limit.ll
simple3.ll	Allow BBVectorize to form non-2^n-length vectors.	2012-06-28 05:42:42 +00:00
simple-int.ll
simple-ldstr-ptrs.ll
simple-ldstr.ll
simple-sel.ll	Allow controlling vectorization of boolean values separately from other integer types.	2012-06-24 13:28:01 +00:00
simple-tst.ll
simple.ll	Allow BBVectorize to form non-2^n-length vectors.	2012-06-28 05:42:42 +00:00