diff options
| author | Philip Reames <preames@rivosinc.com> | 2022-06-26 12:50:57 -0700 |
|---|---|---|
| committer | Philip Reames <listmail@philipreames.com> | 2022-06-27 12:44:38 -0700 |
| commit | aadc9d26a3618a47f317417fbd903b2bcd232e98 (patch) | |
| tree | 7804332021e0eee8186484ec098d2ad3cd11d2b6 /lldb/source/Commands/CommandObjectGUI.cpp | |
| parent | 8f7cca90af6e06daab4ce23cb0f894380ca7a6a1 (diff) | |
| download | llvm-aadc9d26a3618a47f317417fbd903b2bcd232e98.zip llvm-aadc9d26a3618a47f317417fbd903b2bcd232e98.tar.gz llvm-aadc9d26a3618a47f317417fbd903b2bcd232e98.tar.bz2 | |
[RISCV] Cost model for scalable reductions
This extends the existing cost model for reductions for scalable vectors.
The existing cost model assumes that reductions are roughly logarithmic in cost for unordered variants and linear for ordered ones. This change keeps that same basic model, and extends it out to the maximum number of elements a scalable vector could possibly have.
This results in costs which aren't terribly high for unordered reductions, but are for ordered ones. This seems about right; we want to strongly bias away from using scalable ordered reductions if the cost might be linear in VL.
Differential Revision: https://reviews.llvm.org/D127447
Diffstat (limited to 'lldb/source/Commands/CommandObjectGUI.cpp')
0 files changed, 0 insertions, 0 deletions