aboutsummaryrefslogtreecommitdiff
path: root/llvm/unittests/ProfileData/MemProfTest.cpp
diff options
context:
space:
mode:
authorElvis Wang <elvis.wang@sifive.com>2024-12-12 09:26:19 +0800
committerGitHub <noreply@github.com>2024-12-12 09:26:19 +0800
commita6742094324d7166b451c749acf81d27a504c47b (patch)
treedc9bcb9ea068754d308df9ebd5c644a7e56409a5 /llvm/unittests/ProfileData/MemProfTest.cpp
parent44c05a627ffb4bdd63b477d2d74b2b6db2f87c74 (diff)
downloadllvm-a6742094324d7166b451c749acf81d27a504c47b.zip
llvm-a6742094324d7166b451c749acf81d27a504c47b.tar.gz
llvm-a6742094324d7166b451c749acf81d27a504c47b.tar.bz2
[RISCV][TTI] Model the cost of insert/extractelt when the vector split into multiple register group and idx exceed single group. (#118401)
This patch implements the cost when the size of the vector need to split into multiple groups and the index exceed single vector group. For extract element, we need to store split vectors to stack and load the target element. For insert element, we need to store split vectors to stack and store the target element and load vectors back. After this patch, the cost of insert/extract element will close to the generated assembly.
Diffstat (limited to 'llvm/unittests/ProfileData/MemProfTest.cpp')
0 files changed, 0 insertions, 0 deletions