Hal Finkel 86c88c938a BBVectorize: Use a more sophisticated check for input cost ...

The old checking code, which assumed that input shuffles and insert-elements
could always be folded (and thus were free) is too simple.
This can only happen in special circumstances.
Using the simple check caused infinite recursion.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@167750 91177308-0d34-0410-b5e6-96231b3b80d8

2012-11-12 21:21:02 +00:00

..

X86

BBVectorize: Use a more sophisticated check for input cost

2012-11-12 21:21:02 +00:00

cycle.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00

func-alias.ll

…

ld1.ll

…

lit.local.cfg

Move target-specific BBVectorize tests into a separate directory.

2012-10-26 19:38:09 +00:00

loop1.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00

mem-op-depth.ll

…

metadata.ll

…

no-ldstr-conn.ll

…

req-depth.ll

…

search-limit.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00

simple3.ll

Allow BBVectorize to form non-2^n-length vectors.

2012-06-28 05:42:42 +00:00

simple-int.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00

simple-ldstr-ptrs.ll

Disable generation of pointer vectors by BBVectorize.

2012-10-26 00:05:26 +00:00

simple-ldstr.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00

simple-sel.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00

simple-tst.ll

…

simple.ll

BBVectorize: Choose pair ordering to minimize shuffles

2012-10-31 15:17:07 +00:00