Nadav Rotem 55306bdea5 Fix a bug in the code that checks if we can vectorize loops while using dynamic ... memory bound checks. Before the fix we were able to vectorize this loop from the Livermore Loops benchmark: for ( k=1 ; k<n ; k++ ) x[k] = x[k-1] + y[k]; git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@170811 91177308-0d34-0410-b5e6-96231b3b80d8		2012-12-21 00:07:35 +00:00
..
X86
12-12-11-if-conv.ll
2012-10-20-infloop.ll
2012-10-22-isconsec.ll
cast-induction.ll
cpp-new-array.ll
flags.ll
gcc-examples.ll
if-conv-crash.ll
if-conversion-reduction.ll
if-conversion.ll
increment.ll
induction_plus.ll
intrinsic.ll
lit.local.cfg
no_int_induction.ll
non-const-n.ll
read-only.ll
reduction.ll
runtime-check.ll
same-base-access.ll	Fix a bug in the code that checks if we can vectorize loops while using dynamic	2012-12-21 00:07:35 +00:00
scalar-select.ll
small-loop.ll
small-size.ll
start-non-zero.ll
write-only.ll