HomeSort by relevance Sort by last modified time
    Searched defs:Quotient (Results 1 - 4 of 4) sorted by null

  /external/llvm/unittests/Transforms/Utils/
IntegerDivision.cpp 48 Instruction* Quotient = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0));
49 EXPECT_TRUE(Quotient && Quotient->getOpcode() == Instruction::Sub);
78 Instruction* Quotient = dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0));
79 EXPECT_TRUE(Quotient && Quotient->getOpcode() == Instruction::PHI);
  /external/llvm/lib/Target/R600/
AMDGPUISelLowering.cpp 283 // Quotient = mulhu(Tmp0, Num)
284 SDValue Quotient = DAG.getNode(ISD::MULHU, DL, VT, Tmp0, Num);
286 // Num_S_Remainder = Quotient * Den
287 SDValue Num_S_Remainder = DAG.getNode(ISD::UMULO, DL, VT, Quotient, Den);
309 // Quotient_A_One = Quotient + 1
310 SDValue Quotient_A_One = DAG.getNode(ISD::ADD, DL, VT, Quotient,
313 // Quotient_S_One = Quotient - 1
314 SDValue Quotient_S_One = DAG.getNode(ISD::SUB, DL, VT, Quotient,
317 // Div = (Tmp1 == 0 ? Quotient : Quotient_A_One)
319 Quotient, Quotient_A_One, ISD::SETEQ)
    [all...]
  /external/llvm/lib/Transforms/Utils/
BypassSlowDivision.cpp 38 PHINode *Quotient;
42 : Quotient(InQuotient), Remainder(InRemainder) {}
205 // Replace all uses of div instruction with quotient phi node
206 J->replaceAllUsesWith(Value.Quotient);
IntegerDivision.cpp 69 // Remainder = Dividend - Quotient*Divisor
71 // ; %quotient = udiv i32 %dividend, %divisor
72 // ; %product = mul i32 %divisor, %quotient
74 Value *Quotient = Builder.CreateUDiv(Dividend, Divisor);
75 Value *Product = Builder.CreateMul(Divisor, Quotient);
78 if (Instruction *UDiv = dyn_cast<Instruction>(Quotient))
84 /// Generate code to divide two signed integers. Returns the quotient, rounded
123 /// quotient, rounded towards 0. Builder's insert point should be pointing where
397 Value *Quotient = generateSignedDivisionCode(Div->getOperand(0),
399 Div->replaceAllUsesWith(Quotient);
    [all...]

Completed in 278 milliseconds