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 258927e commit 99a2e89Copy full SHA for 99a2e89
llvm/lib/Transforms/Scalar/Reassociate.cpp
@@ -957,8 +957,8 @@ static BinaryOperator *ConvertShiftToMul(Instruction *Shl) {
957
/// Scan backwards and forwards among values with the same rank as element i
958
/// to see if X exists. If X does not exist, return i. This is useful when
959
/// scanning for 'x' when we see '-x' because they both get the same rank.
960
-static unsigned FindInOperandList(SmallVectorImpl<ValueEntry> &Ops, unsigned i,
961
- Value *X) {
+static unsigned FindInOperandList(const SmallVectorImpl<ValueEntry> &Ops,
+ unsigned i, Value *X) {
962
unsigned XRank = Ops[i].Rank;
963
unsigned e = Ops.size();
964
for (unsigned j = i+1; j != e && Ops[j].Rank == XRank; ++j) {
0 commit comments