aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Writer/BitcodeWriter.cpp
diff options
context:
space:
mode:
authorAlex Bradbury <asb@igalia.com>2024-11-15 15:21:06 +0000
committerAlex Bradbury <asb@igalia.com>2024-11-15 15:21:39 +0000
commit298127dcbe2ecd1f3c49c2109ac96654778f20be (patch)
treefb97475565646e6bf985ddb6834448d5af25059e /llvm/lib/Bitcode/Writer/BitcodeWriter.cpp
parente6cc58922f5f36e1eecdaf2f44a5ef7501acc139 (diff)
downloadllvm-298127dcbe2ecd1f3c49c2109ac96654778f20be.zip
llvm-298127dcbe2ecd1f3c49c2109ac96654778f20be.tar.gz
llvm-298127dcbe2ecd1f3c49c2109ac96654778f20be.tar.bz2
Reapply [IR] Initial introduction of llvm.experimental.memset_pattern (#97583)
Relands 7ff3a9acd84654c9ec2939f45ba27f162ae7fbc3 after regenerating the test case. Supersedes the draft PR #94992, taking a different approach following feedback: * Lower in PreISelIntrinsicLowering * Don't require that the number of bytes to set is a compile-time constant * Define llvm.memset_pattern rather than llvm.memset_pattern.inline As discussed in the [RFC thread](https://discourse.llvm.org/t/rfc-introducing-an-llvm-memset-pattern-inline-intrinsic/79496), the intent is that the intrinsic will be lowered to loops, a sequence of stores, or libcalls depending on the expected cost and availability of libcalls on the target. Right now, there's just a single lowering path that aims to handle all cases. My intent would be to follow up with additional PRs that add additional optimisations when possible (e.g. when libcalls are available, when arguments are known to be constant etc).
Diffstat (limited to 'llvm/lib/Bitcode/Writer/BitcodeWriter.cpp')
0 files changed, 0 insertions, 0 deletions