forked from OSchip/llvm-project
a45688a72c
relevant aggregate build instructions only (UserCost). Users are detected with findBuildAggregate routine and the trick is that following SLP vectorization may end up vectorizing entire list with smaller chunks. Cost adjustment then is applied for individual chunks and these adjustments obviously have to be smaller than the entire aggregate build cost. Differential Revision: https://reviews.llvm.org/D80773 |
||
|---|---|---|
| .. | ||
| 64-bit-vector.ll | ||
| PR38339.ll | ||
| accelerate-vector-functions.ll | ||
| commute.ll | ||
| ext-trunc.ll | ||
| gather-cost.ll | ||
| gather-reduce.ll | ||
| gather-root.ll | ||
| getelementptr.ll | ||
| horizontal.ll | ||
| invalid_type.ll | ||
| lit.local.cfg | ||
| load-store-q.ll | ||
| matmul.ll | ||
| minimum-sizes.ll | ||
| mismatched-intrinsics.ll | ||
| nontemporal.ll | ||
| remarks.ll | ||
| scalable-vector.ll | ||
| sdiv-pow2.ll | ||
| spillcost-di.ll | ||
| transpose.ll | ||
| tsc-s352.ll | ||