46     Value *Remainder;  member
49         : Quotient(InQuotient), Remainder(InRemainder) {}  in QuotRemPair()
52   /// A quotient and remainder, plus a BB from which they logically "originate".
53   /// If you use Quotient or Remainder in a Phi node, you should use BB as its
58     Value *Remainder = nullptr;  member
145 /// Reuses previously-computed dividend or remainder from the current BB if
147 /// perform the optimization and caches the resulting dividend and remainder.
170   return isDivisionOp() ? Value.Quotient : Value.Remainder;  in getReplacement()
271     DivRemPair.Remainder = Builder.CreateSRem(Dividend, Divisor);  in createSlowBB()
274     DivRemPair.Remainder = Builder.CreateURem(Dividend, Divisor);  in createSlowBB()
302   DivRemPair.Remainder =  in createFastBB()
319   RemPhi->addIncoming(LHS.Remainder, LHS.BB);  in createDivRemPhiNodes()
320   RemPhi->addIncoming(RHS.Remainder, RHS.BB);  in createDivRemPhiNodes()
409     //    at all: The quotient is 0 and the remainder is equal to Dividend.  in insertFastDivAndRem()
422     Long.Remainder = Dividend;  in insertFastDivAndRem()
476     for (Value *V : {KV.second.Quotient, KV.second.Remainder})  in bypassSlowDivision()