OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:bSignificand
(Results
1 - 6
of
6
) sorted by null
/external/compiler-rt/lib/
adddf3.c
68
rep_t
bSignificand
= bRep & significandMask;
72
if (bExponent == 0) bExponent = normalize(&
bSignificand
);
84
bSignificand
= (
bSignificand
| implicitBit) << 3;
91
const bool sticky =
bSignificand
<< (typeWidth - align);
92
bSignificand
=
bSignificand
>> align | sticky;
94
bSignificand
= 1; // sticky; b is known to be non-zero.
99
aSignificand -=
bSignificand
;
114
aSignificand +=
bSignificand
;
[
all
...]
addsf3.c
67
rep_t
bSignificand
= bRep & significandMask;
71
if (bExponent == 0) bExponent = normalize(&
bSignificand
);
83
bSignificand
= (
bSignificand
| implicitBit) << 3;
90
const bool sticky =
bSignificand
<< (typeWidth - align);
91
bSignificand
=
bSignificand
>> align | sticky;
93
bSignificand
= 1; // sticky; b is known to be non-zero.
98
aSignificand -=
bSignificand
;
113
aSignificand +=
bSignificand
;
[
all
...]
divdf3.c
31
rep_t
bSignificand
= toRep(b) & significandMask;
68
if (bAbs < implicitBit) scale -= normalize(&
bSignificand
);
75
bSignificand
|= implicitBit;
82
const uint32_t q31b =
bSignificand
>> 21;
108
const uint32_t q63blo =
bSignificand
<< 11;
152
residual = (aSignificand << 53) - quotient *
bSignificand
;
156
residual = (aSignificand << 52) - quotient *
bSignificand
;
173
const bool round = (residual << 1) >
bSignificand
;
divsf3.c
31
rep_t
bSignificand
= toRep(b) & significandMask;
68
if (bAbs < implicitBit) scale -= normalize(&
bSignificand
);
75
bSignificand
|= implicitBit;
82
uint32_t q31b =
bSignificand
<< 8;
137
residual = (aSignificand << 24) - quotient *
bSignificand
;
141
residual = (aSignificand << 23) - quotient *
bSignificand
;
158
const bool round = (residual << 1) >
bSignificand
;
muldf3.c
28
rep_t
bSignificand
= toRep(b) & significandMask;
65
if (bAbs < implicitBit) scale += normalize(&
bSignificand
);
72
bSignificand
|= implicitBit;
80
wideMultiply(aSignificand,
bSignificand
<< exponentBits,
mulsf3.c
28
rep_t
bSignificand
= toRep(b) & significandMask;
65
if (bAbs < implicitBit) scale += normalize(&
bSignificand
);
72
bSignificand
|= implicitBit;
80
wideMultiply(aSignificand,
bSignificand
<< exponentBits,
Completed in 974 milliseconds