forked from OSchip/llvm-project
e4b9640867
Currently bottom-to-top reordering analysis counts orders of the operands and then adds natural order counts for the operand users. It is very conservative, this the user nodes themselves may require reordering. Patch improves bottom-to-top analysis by checking for the user nodes if they require/allows the reordring. If the user node must be reordered, has reused scalars, is an alternate op vectorization node, is a non-ordered gather node or may allow reordering because of the reordered operands, such node is considered as the node that allows reodring and is not counted as a node with the natural order. Differential Revision: https://reviews.llvm.org/D120492 |
||
|---|---|---|
| .. | ||
| AArch64 | ||
| AMDGPU | ||
| ARM | ||
| NVPTX | ||
| PowerPC | ||
| RISCV | ||
| SystemZ | ||
| VE | ||
| WebAssembly | ||
| X86 | ||
| XCore | ||
| int_sideeffect.ll | ||
| reschedule.ll | ||
| slp-hr-with-reuse.ll | ||
| slp-max-phi-size.ll | ||
| slp-max-reg-size.ll | ||
| slp-umax-rdx-matcher-crash.ll | ||
| slp-variable-insertelement.ll | ||
| vectorizable-functions-inseltpoison.ll | ||
| vectorizable-functions.ll | ||