[PATCH] D19984: [LV] Preserve order of dependences in interleaved accesses analysis

[silviu.baranga@arm.com via llvm-commits]

sbaranga added a comment.

Thanks for making the changes. I think this looks much better.

Cheers,
Silviu


================
Comment at: lib/Transforms/Vectorize/LoopVectorize.cpp:5078
@@ +5077,3 @@
+  // and B is the source. If such a dependence exists, we can't reorder.
+  for (auto Dep : *Dependences)
+    if (A == Dep.getDestination(*LAI) && B == Dep.getSource(*LAI))
----------------
We should be able to do this faster than O(n) - maybe with some pre-processing of dependences.


http://reviews.llvm.org/D19984