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
..
cmp-types.ll	BBVectorize: Check the types of compare instructions	2012-11-12 19:41:38 +00:00
loop1.ll	BBVectorize: Commit the rest of the test-case change.	2012-11-01 21:57:27 +00:00
sh-rec.ll	BBVectorize: Use a more sophisticated check for input cost	2012-11-12 21:21:02 +00:00
sh-types.ll	BBVectorize: Check the input types of shuffles for legality	2012-11-12 14:50:59 +00:00
simple-ldstr.ll	BBVectorize: Use target costs for incoming and outgoing values instead of the depth heuristic.	2012-11-01 21:50:12 +00:00
simple.ll	BBVectorize: Use target costs for incoming and outgoing values instead of the depth heuristic.	2012-11-01 21:50:12 +00:00
vs-cast.ll