[all-commits] [llvm/llvm-project] a1cab0: [LV] Use cost base decision for uniform mem op str...
Philip Reames via All-commits
all-commits at lists.llvm.org
Wed Aug 3 07:48:13 PDT 2022
Branch: refs/heads/main
Home: https://github.com/llvm/llvm-project
Commit: a1cab0daae43ad2c81e30e73d250b05e64963065
https://github.com/llvm/llvm-project/commit/a1cab0daae43ad2c81e30e73d250b05e64963065
Author: Philip Reames <preames at rivosinc.com>
Date: 2022-08-03 (Wed, 03 Aug 2022)
Changed paths:
M llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
Log Message:
-----------
[LV] Use cost base decision for uniform mem op strategy [nfc-ish]
This is mostly a stylistic change to make the uniform memop widening cost
code fit more naturally with the sourounding code. Its not strictly
speaking NFC as I added in the store with invariant value case, and we
could in theory have a target where a gather/scatter is cheaper than a
single load/store... but it's probably NFC in practice. Note that the
scatter/gather result can still be overriden later if the result is
uniform-by-parts.
More information about the All-commits
mailing list