Alexey Bataev 438682de6a [SLP]Merge reorder and reuse shuffles. ...

It is possible to merge reuse and reorder shuffles and reduce the total
cost of the ivectorization tree/number of final instructions.

Differential Revision: https://reviews.llvm.org/D92668

2020-12-07 07:50:00 -08:00

..

64-bit-vector.ll

…

accelerate-vector-functions.ll

…

commute.ll

…

ext-trunc.ll

…

gather-cost.ll

[CostModel] Add basic implementation of getGatherScatterOpCost.

2020-11-26 12:02:25 +00:00

gather-reduce.ll

…

gather-root.ll

…

getelementptr.ll

…

horizontal.ll

[SLP] Pass VecPred argument to getCmpSelInstrCost.

2020-11-03 10:16:43 +00:00

insertelement.ll

…

invalid_type.ll

…

lit.local.cfg

…

load-store-q.ll

…

matmul.ll

…

minimum-sizes.ll

…

mismatched-intrinsics.ll

…

mul.ll

[AArch64][CostModel] Fix cost for mul <2 x i64>

2020-11-30 11:36:55 +00:00

nontemporal.ll

…

PR38339.ll

[SLP]Merge reorder and reuse shuffles.

2020-12-07 07:50:00 -08:00

remarks.ll

…

scalable-vector.ll

…

sdiv-pow2.ll

…

spillcost-di.ll

…

spillcost-order.ll

…

transpose.ll

…

tsc-s352.ll

…

vectorizable-selects-min-max.ll

[SLP] Pass VecPred argument to getCmpSelInstrCost.

2020-11-03 10:16:43 +00:00

vectorizable-selects-uniform-cmps.ll

[SLP] Pass VecPred argument to getCmpSelInstrCost.

2020-11-03 10:16:43 +00:00