[PATCH] D125111: [SLP] Make reordering aware of external vectorizable scalar stores.

Alexey Bataev via Phabricator via llvm-commits llvm-commits at lists.llvm.org
Fri May 6 15:07:41 PDT 2022


ABataev added inline comments.


================
Comment at: llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp:3528
     if (Optional<OrdersType> CurrentOrder =
             getReorderingData(*TE, /*TopToBottom=*/true)) {
       // Do not include ordering for nodes used in the alt opcode vectorization,
----------------
vporpo wrote:
> ABataev wrote:
> > Maybe just add another analysis somewhere here instead of adding new fields etc.?
> We could do the check here, but I think it is a bit more explicit if we have a field in TreeEntry. Also it is very similar in nature to the other reordering data, so I think they should be represented in a similar way. It also helps with debugging because you can actually see it with a `dumpVectorizableTree()` dump just like the other reordering data. Wdyt?
I rather doubt that it is wise decision to waste some extra memory just to handle this corner case.


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D125111/new/

https://reviews.llvm.org/D125111



More information about the llvm-commits mailing list