[llvm] r186786 - Revert a part of r186420. Don't forbid multiple store chains that merge.

[Chandler Carruth]

On Sat, Jul 20, 2013 at 11:12 PM, Nadav Rotem <nrotem at apple.com> wrote:

> Author: nadav
> Date: Sun Jul 21 01:12:57 2013
> New Revision: 186786
>
> URL: http://llvm.org/viewvc/llvm-project?rev=186786&view=rev
> Log:
> Revert a part of r186420. Don't forbid multiple store chains that merge.
>

Test case?


>
> Modified:
>     llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp
>
> Modified: llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp
> URL:
> http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp?rev=186786&r1=186785&r2=186786&view=diff
>
> ==============================================================================
> --- llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp (original)
> +++ llvm/trunk/lib/Transforms/Vectorize/SLPVectorizer.cpp Sun Jul 21
> 01:12:57 2013
> @@ -1700,10 +1700,8 @@ bool SLPVectorizer::vectorizeStores(Arra
>    // Do a quadratic search on all of the given stores and find
>    // all of the pairs of stores that follow each other.
>    for (unsigned i = 0, e = Stores.size(); i < e; ++i) {
> -    if (Heads.count(Stores[i]))
> -      continue;
>      for (unsigned j = 0; j < e; ++j) {
> -      if (i == j || Tails.count(Stores[j]))
> +      if (i == j)
>          continue;
>
>        if (R.isConsecutiveAccess(Stores[i], Stores[j])) {
>
>
> _______________________________________________
> llvm-commits mailing list
> llvm-commits at cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20130720/b452a58c/attachment.html>