[PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count

[Dorit Nuzman via Phabricator via llvm-commits]

This revision was automatically updated to reflect the committed changes.
Closed by commit rL294892: [LV/LoopAccess] Check statically if an unknown dependence distance can be  (authored by dorit).

Changed prior to commit:
  https://reviews.llvm.org/D28044?vs=86777&id=88118#toc

Repository:
  rL LLVM

https://reviews.llvm.org/D28044

Files:
  llvm/trunk/lib/Analysis/LoopAccessAnalysis.cpp
  llvm/trunk/test/Analysis/LoopAccessAnalysis/multiple-strides-rt-memory-checks.ll
  llvm/trunk/test/Analysis/LoopAccessAnalysis/pr31098.ll
  llvm/trunk/test/Transforms/LoopVectorize/multiple-strides-vectorization.ll
  llvm/trunk/test/Transforms/LoopVectorize/pr31098.ll

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D28044.88118.patch
Type: text/x-patch
Size: 15322 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20170212/c1db3e14/attachment-0001.bin>