summaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorSanjay Patel <spatel@rotateright.com>2021-10-29 15:47:14 -0400
committerSanjay Patel <spatel@rotateright.com>2021-10-29 15:48:35 -0400
commit285b8abce483eaa25e20d3f3bd704592c3bdec88 (patch)
tree5193d173c6e8035a3146357634ef6c5fe47c3ebe /llvm/lib/Bitcode/Reader/BitcodeReader.cpp
parent837518d6a08b793906b3f45251cdc4d04ff02317 (diff)
[x86] limit vector increment fold to allow load folding
The tests are based on the example from: https://llvm.org/PR52032 I suspect that it looks worse than it actually is. :) That is, llvm-mca says there's no uop/timing difference with the load folding and pcmpeq vs. broadcast on Haswell (and probably other targets). The load-folding definitely makes the code smaller, so it's good for that at least. So this requires carving a narrow hole in the transform to get just this case without changing others that look good as-is (in other words, the transform still seems good for most examples). Differential Revision: https://reviews.llvm.org/D112464
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions