OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Quotient
(Results
1 - 7
of
7
) sorted by null
/external/llvm/unittests/Transforms/Utils/
IntegerDivision.cpp
49
Instruction*
Quotient
= dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0));
50
EXPECT_TRUE(
Quotient
&&
Quotient
->getOpcode() == Instruction::Sub);
79
Instruction*
Quotient
= dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0));
80
EXPECT_TRUE(
Quotient
&&
Quotient
->getOpcode() == Instruction::PHI);
170
Instruction*
Quotient
= dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0));
171
EXPECT_TRUE(
Quotient
&&
Quotient
->getOpcode() == Instruction::Sub);
200
Instruction*
Quotient
= dyn_cast<Instruction>(cast<User>(Ret)->getOperand(0))
[
all
...]
/external/llvm/lib/Support/
ScaledNumber.cpp
69
uint64_t
Quotient
= Dividend64 / Divisor;
72
// If
Quotient
needs to be shifted, leave the rounding to getAdjusted().
73
if (
Quotient
> UINT32_MAX)
74
return getAdjusted<uint32_t>(
Quotient
, Shift);
77
return getRounded<uint32_t>(
Quotient
, Shift, Remainder >= getHalf(Divisor));
103
uint64_t
Quotient
= Dividend / Divisor;
106
// Continue building the
quotient
with long division.
107
while (!(
Quotient
>> 63) && Dividend) {
113
// Get the next bit of
Quotient
.
114
Quotient
<<= 1
[
all
...]
/external/llvm/lib/Transforms/Utils/
BypassSlowDivision.cpp
39
PHINode *
Quotient
;
43
:
Quotient
(InQuotient), Remainder(InRemainder) {}
206
// Replace all uses of div instruction with
quotient
phi node
207
J->replaceAllUsesWith(Value.
Quotient
);
IntegerDivision.cpp
82
// Remainder = Dividend -
Quotient
*Divisor
86
// ; %
quotient
= udiv i32 %dividend, %divisor
87
// ; %product = mul i32 %divisor, %
quotient
89
Value *
Quotient
= Builder.CreateUDiv(Dividend, Divisor);
90
Value *Product = Builder.CreateMul(Divisor,
Quotient
);
93
if (Instruction *UDiv = dyn_cast<Instruction>(
Quotient
))
99
/// Generate code to divide two signed integers. Returns the
quotient
, rounded
149
/// Returns the
quotient
, rounded towards 0. Builder's insert point should
455
Value *
Quotient
= generateSignedDivisionCode(Div->getOperand(0),
457
Div->replaceAllUsesWith(
Quotient
);
[
all
...]
/external/mesa3d/src/gallium/drivers/radeon/
AMDGPUISelLowering.cpp
223
//
Quotient
= mulhu(Tmp0, Num)
224
SDValue
Quotient
= DAG.getNode(ISD::MULHU, DL, VT, Tmp0, Num);
226
// Num_S_Remainder =
Quotient
* Den
227
SDValue Num_S_Remainder = DAG.getNode(ISD::UMULO, DL, VT,
Quotient
, Den);
249
// Quotient_A_One =
Quotient
+ 1
250
SDValue Quotient_A_One = DAG.getNode(ISD::ADD, DL, VT,
Quotient
,
253
// Quotient_S_One =
Quotient
- 1
254
SDValue Quotient_S_One = DAG.getNode(ISD::SUB, DL, VT,
Quotient
,
257
// Div = (Tmp1 == 0 ?
Quotient
: Quotient_A_One)
259
Quotient
, Quotient_A_One, ISD::SETEQ)
[
all
...]
/external/llvm/lib/Analysis/
ScalarEvolution.cpp
695
// Computes the
Quotient
and Remainder of the division of Numerator by
698
const SCEV *Denominator, const SCEV **
Quotient
,
707
*
Quotient
= D.One;
713
*
Quotient
= D.Zero;
718
// A simple case when N/1. The
quotient
is N.
720
*
Quotient
= Numerator;
728
*
Quotient
= Numerator;
730
divide(SE, *
Quotient
, Op, &Q, &R);
731
*
Quotient
= Q;
736
*
Quotient
= D.Zero
[
all
...]
/external/llvm/lib/Target/AMDGPU/
AMDGPUISelLowering.cpp
[
all
...]
Completed in 736 milliseconds