aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp
diff options
context:
space:
mode:
authorPhilip Reames <preames@rivosinc.com>2023-03-29 07:30:46 -0700
committerPhilip Reames <listmail@philipreames.com>2023-03-29 07:36:35 -0700
commit57492b1eeb99761afbe97a893df19b934c11e6f1 (patch)
tree7c9c41f01316d8b57df79b49bb92ee082d5a2859 /llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp
parent267d6d665cf2379ebfcc65fa385a35529c83a7d0 (diff)
downloadllvm-57492b1eeb99761afbe97a893df19b934c11e6f1.zip
llvm-57492b1eeb99761afbe97a893df19b934c11e6f1.tar.gz
llvm-57492b1eeb99761afbe97a893df19b934c11e6f1.tar.bz2
[RISCV] Cost model for general case of dual vector permute
The cost model was not accounting for the fact that we can generate a dual vrgather + an index expression sequence instead of scalarizing. A couple cases to call out: 1) I did not model the difference between vrgather and vrgatherei16. The result is the constant pool cost can be slightly understated on RV32. I don't think we care, but if someone disagrees, this would be easy to add. 2) Our current codegen for i8 vectors longer than 256 (which is the limit of what this costs) has some room for improvement. 3) As indicated by the *regression* in reported cost for <2 x iN> vectors, our current vector lowering is missing support for a sub-case where scalarize-and-insert is actually faster than the generic fallback path. Differential Revision: https://reviews.llvm.org/D147063
Diffstat (limited to 'llvm/lib/CodeGen/AssignmentTrackingAnalysis.cpp')
0 files changed, 0 insertions, 0 deletions