diff options
| author | Alexey Bataev <a.bataev@outlook.com> | 2021-12-14 10:02:06 -0800 |
|---|---|---|
| committer | Alexey Bataev <a.bataev@outlook.com> | 2022-05-11 06:08:55 -0700 |
| commit | f5d45d70a5114c6c93822ba9f8e9e042f881238f (patch) | |
| tree | 492d836647c28e372063bc8a7d14541d279e4bf1 /clang/lib/Frontend/CompilerInvocation.cpp | |
| parent | 400587ba0c8b14537e5b52190ee2fc869f2f9728 (diff) | |
| download | llvm-f5d45d70a5114c6c93822ba9f8e9e042f881238f.zip llvm-f5d45d70a5114c6c93822ba9f8e9e042f881238f.tar.gz llvm-f5d45d70a5114c6c93822ba9f8e9e042f881238f.tar.bz2 | |
[SLP]Further improvement of the cost model for scalars used in buildvectors.
Further improvement of the cost model for the scalars used in
buildvectors sequences. The main functionality is outlined into
a separate function.
The cost is calculated in the following way:
1. If the Base vector is not undef vector, resizing the very first mask to
have common VF and perform action for 2 input vectors (including non-undef
Base). Other shuffle masks are combined with the resulting after the 1 stage and processed as a shuffle of 2 elements.
2. If the Base is undef vector and have only 1 shuffle mask, perform the
action only for 1 vector with the given mask, if it is not the identity
mask.
3. If > 2 masks are used, perform serie of shuffle actions for 2 vectors,
combing the masks properly between the steps.
The original implementation misses the very first analysis for the Base
vector, so the cost might too optimistic in some cases. But it improves
the cost for the insertelements which are part of the current SLP graph.
Part of D107966.
Differential Revision: https://reviews.llvm.org/D115750
Diffstat (limited to 'clang/lib/Frontend/CompilerInvocation.cpp')
0 files changed, 0 insertions, 0 deletions