aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/StackProtector.cpp
diff options
context:
space:
mode:
authorPhilip Reames <preames@rivosinc.com>2024-09-23 07:21:54 -0700
committerGitHub <noreply@github.com>2024-09-23 07:21:54 -0700
commit0b524efa953ce4a1f41ff6abaa8e3c5f757e40e2 (patch)
tree9b2a120a34eb51154aee058d7b468aa2a62ccb07 /llvm/lib/CodeGen/StackProtector.cpp
parent21627236363d629f6a5b820f45a6071371e4b8db (diff)
downloadllvm-0b524efa953ce4a1f41ff6abaa8e3c5f757e40e2.zip
llvm-0b524efa953ce4a1f41ff6abaa8e3c5f757e40e2.tar.gz
llvm-0b524efa953ce4a1f41ff6abaa8e3c5f757e40e2.tar.bz2
[RISCV][TTI] Reduce cost of a <N x i1> build_vector pattern (#109449)
This is a follow up to 7f6bbb3. When lowering a <N x i1> build_vector, we currently chose to extend to i8, perform the build_vector there, and then truncate back in vector. Our costing on the other hand accounts for it as if we performed a vector extend, an insert, and a vector extract for every element. This significantly over estimates the cost. Note that we can likely do better in our build_vector lowering here by packing the bits in scalar, and doing a build_vector of the packed bits. Regardless, our costing should match our lowering.
Diffstat (limited to 'llvm/lib/CodeGen/StackProtector.cpp')
0 files changed, 0 insertions, 0 deletions