We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1dcb6dc commit d38addfCopy full SHA for d38addf
llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp
@@ -17000,7 +17000,7 @@ void BoUpSLP::computeMinimumValueSizes() {
17000
// Check if the root is trunc and the next node is gather/buildvector, then
17001
// keep trunc in scalars, which is free in most cases.
17002
if (E.isGather() && IsTruncRoot && E.UserTreeIndices.size() == 1 &&
17003
- E.Idx > (IsStoreOrInsertElt ? 2 : 1) &&
+ E.Idx > (IsStoreOrInsertElt ? 2u : 1u) &&
17004
all_of(E.Scalars, [&](Value *V) {
17005
return V->hasOneUse() || isa<Constant>(V) ||
17006
(!V->hasNUsesOrMore(UsesLimit) &&
0 commit comments