@@ -18965,15 +18965,15 @@ bool DAGCombiner::CombineToPreIndexedLoadStore(SDNode *N) {
1896518965 // Now check for #3 and #4.
1896618966 bool RealUse = false;
1896718967
18968- for (SDNode *Use : Ptr->users()) {
18969- if (Use == N)
18968+ for (SDNode *User : Ptr->users()) {
18969+ if (User == N)
1897018970 continue;
18971- if (SDNode::hasPredecessorHelper(Use , Visited, Worklist, MaxSteps))
18971+ if (SDNode::hasPredecessorHelper(User , Visited, Worklist, MaxSteps))
1897218972 return false;
1897318973
1897418974 // If Ptr may be folded in addressing mode of other use, then it's
1897518975 // not profitable to do this transformation.
18976- if (!canFoldInAddressingMode(Ptr.getNode(), Use , DAG, TLI))
18976+ if (!canFoldInAddressingMode(Ptr.getNode(), User , DAG, TLI))
1897718977 RealUse = true;
1897818978 }
1897918979
@@ -19089,29 +19089,29 @@ static bool shouldCombineToPostInc(SDNode *N, SDValue Ptr, SDNode *PtrUse,
1908919089
1909019090 SmallPtrSet<const SDNode *, 32> Visited;
1909119091 unsigned MaxSteps = SelectionDAG::getHasPredecessorMaxSteps();
19092- for (SDNode *Use : BasePtr->users()) {
19093- if (Use == Ptr.getNode())
19092+ for (SDNode *User : BasePtr->users()) {
19093+ if (User == Ptr.getNode())
1909419094 continue;
1909519095
1909619096 // No if there's a later user which could perform the index instead.
19097- if (isa<MemSDNode>(Use )) {
19097+ if (isa<MemSDNode>(User )) {
1909819098 bool IsLoad = true;
1909919099 bool IsMasked = false;
1910019100 SDValue OtherPtr;
19101- if (getCombineLoadStoreParts(Use , ISD::POST_INC, ISD::POST_DEC, IsLoad,
19101+ if (getCombineLoadStoreParts(User , ISD::POST_INC, ISD::POST_DEC, IsLoad,
1910219102 IsMasked, OtherPtr, TLI)) {
1910319103 SmallVector<const SDNode *, 2> Worklist;
19104- Worklist.push_back(Use );
19104+ Worklist.push_back(User );
1910519105 if (SDNode::hasPredecessorHelper(N, Visited, Worklist, MaxSteps))
1910619106 return false;
1910719107 }
1910819108 }
1910919109
1911019110 // If all the uses are load / store addresses, then don't do the
1911119111 // transformation.
19112- if (Use ->getOpcode() == ISD::ADD || Use ->getOpcode() == ISD::SUB) {
19113- for (SDNode *UseUse : Use ->users())
19114- if (canFoldInAddressingMode(Use, UseUse , DAG, TLI))
19112+ if (User ->getOpcode() == ISD::ADD || User ->getOpcode() == ISD::SUB) {
19113+ for (SDNode *UserUser : User ->users())
19114+ if (canFoldInAddressingMode(User, UserUser , DAG, TLI))
1911519115 return false;
1911619116 }
1911719117 }
@@ -20515,24 +20515,24 @@ bool DAGCombiner::isMulAddWithConstProfitable(SDNode *MulNode, SDValue AddNode,
2051520515 return true;
2051620516
2051720517 // Walk all the users of the constant with which we're multiplying.
20518- for (SDNode *Use : ConstNode->users()) {
20519- if (Use == MulNode) // This use is the one we're on right now. Skip it.
20518+ for (SDNode *User : ConstNode->users()) {
20519+ if (User == MulNode) // This use is the one we're on right now. Skip it.
2052020520 continue;
2052120521
20522- if (Use ->getOpcode() == ISD::MUL) { // We have another multiply use.
20522+ if (User ->getOpcode() == ISD::MUL) { // We have another multiply use.
2052320523 SDNode *OtherOp;
2052420524 SDNode *MulVar = AddNode.getOperand(0).getNode();
2052520525
2052620526 // OtherOp is what we're multiplying against the constant.
20527- if (Use ->getOperand(0) == ConstNode)
20528- OtherOp = Use ->getOperand(1).getNode();
20527+ if (User ->getOperand(0) == ConstNode)
20528+ OtherOp = User ->getOperand(1).getNode();
2052920529 else
20530- OtherOp = Use ->getOperand(0).getNode();
20530+ OtherOp = User ->getOperand(0).getNode();
2053120531
2053220532 // Check to see if multiply is with the same operand of our "add".
2053320533 //
2053420534 // ConstNode = CONST
20535- // Use = ConstNode * A <-- visiting Use . OtherOp is A.
20535+ // User = ConstNode * A <-- visiting User . OtherOp is A.
2053620536 // ...
2053720537 // AddNode = (A + c1) <-- MulVar is A.
2053820538 // = AddNode * ConstNode <-- current visiting instruction.
@@ -20550,7 +20550,7 @@ bool DAGCombiner::isMulAddWithConstProfitable(SDNode *MulNode, SDValue AddNode,
2055020550 // ... = AddNode * ConstNode <-- current visiting instruction.
2055120551 // ...
2055220552 // OtherOp = (A + c2)
20553- // Use = OtherOp * ConstNode <-- visiting Use .
20553+ // User = OtherOp * ConstNode <-- visiting User .
2055420554 //
2055520555 // If we make this transformation, we will have a common
2055620556 // multiply (CONST * A) after we also do the same transformation
@@ -23182,8 +23182,8 @@ SDValue DAGCombiner::visitEXTRACT_VECTOR_ELT(SDNode *N) {
2318223182 isa<ConstantSDNode>(Use->getOperand(1));
2318323183 })) {
2318423184 APInt DemandedElts = APInt::getZero(NumElts);
23185- for (SDNode *Use : VecOp->users()) {
23186- auto *CstElt = cast<ConstantSDNode>(Use ->getOperand(1));
23185+ for (SDNode *User : VecOp->users()) {
23186+ auto *CstElt = cast<ConstantSDNode>(User ->getOperand(1));
2318723187 if (CstElt->getAPIntValue().ult(NumElts))
2318823188 DemandedElts.setBit(CstElt->getZExtValue());
2318923189 }
0 commit comments