diff options
| author | David Sherwood <david.sherwood@arm.com> | 2025-06-13 11:43:50 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-06-13 11:43:50 +0100 |
| commit | 541e5118ce570c9bed74cb5ff836f88cf1c0e644 (patch) | |
| tree | 72c4d69348ea3d48003e4ae183e60ad8803a4312 /llvm/lib/ProfileData/Coverage/CoverageMapping.cpp | |
| parent | 2019553a0b8811a23d7546cbace52a8e241a3b37 (diff) | |
| download | llvm-541e5118ce570c9bed74cb5ff836f88cf1c0e644.zip llvm-541e5118ce570c9bed74cb5ff836f88cf1c0e644.tar.gz llvm-541e5118ce570c9bed74cb5ff836f88cf1c0e644.tar.bz2 | |
[LV] Use getFixedValue instead of getKnownMinValue when appropriate (#143526)
There are many places in VPlan and LoopVectorize where we use
getKnownMinValue to discover the number of elements in a vector. Where
we expect the vector to have a fixed length, I have used the stronger
getFixedValue call. I believe this is clearer and adds extra protection
in the form of an assert in getFixedValue that the vector is not
scalable.
While looking at VPFirstOrderRecurrencePHIRecipe::computeCost I also
took the liberty of simplifying the code.
In theory I believe this patch should be NFC, but I'm reluctant to add
that to the title in case we're just missing tests for some of the VPlan
changes. I built and ran the LLVM test suite when targeting neoverse-v1
and it seemed ok.
Diffstat (limited to 'llvm/lib/ProfileData/Coverage/CoverageMapping.cpp')
0 files changed, 0 insertions, 0 deletions