OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:ti_int
(Results
1 - 25
of
84
) sorted by relevancy
1
2
3
4
/src/sys/external/bsd/compiler_rt/dist/lib/builtins/
negti2.c
21
COMPILER_RT_ABI
ti_int
22
__negti2(
ti_int
a)
absvti2.c
23
COMPILER_RT_ABI
ti_int
24
__absvti2(
ti_int
a)
26
const int N = (int)(sizeof(
ti_int
) * CHAR_BIT);
27
if (a == ((
ti_int
)1 << (N-1)))
29
const
ti_int
s = a >> (N - 1);
negvti2.c
23
COMPILER_RT_ABI
ti_int
24
__negvti2(
ti_int
a)
26
const
ti_int
MIN = (
ti_int
)1 << ((int)(sizeof(
ti_int
) * CHAR_BIT)-1);
muloti4.c
23
COMPILER_RT_ABI
ti_int
24
__muloti4(
ti_int
a,
ti_int
b, int* overflow)
26
const int N = (int)(sizeof(
ti_int
) * CHAR_BIT);
27
const
ti_int
MIN = (
ti_int
)1 << (N-1);
28
const
ti_int
MAX = ~MIN;
30
ti_int
result = a * b;
43
ti_int
sa = a >> (N - 1);
44
ti_int
abs_a = (a ^ sa) - sa
[
all
...]
divti3.c
21
COMPILER_RT_ABI
ti_int
22
__divti3(
ti_int
a,
ti_int
b)
24
const int bits_in_tword_m1 = (int)(sizeof(
ti_int
) * CHAR_BIT) - 1;
25
ti_int
s_a = a >> bits_in_tword_m1; /* s_a = a < 0 ? -1 : 0 */
26
ti_int
s_b = b >> bits_in_tword_m1; /* s_b = b < 0 ? -1 : 0 */
modti3.c
21
COMPILER_RT_ABI
ti_int
22
__modti3(
ti_int
a,
ti_int
b)
24
const int bits_in_tword_m1 = (int)(sizeof(
ti_int
) * CHAR_BIT) - 1;
25
ti_int
s = b >> bits_in_tword_m1; /* s = b < 0 ? -1 : 0 */
31
return ((
ti_int
)r ^ s) - s; /* negate if s == -1 */
fixdfti.c
17
typedef
ti_int
fixint_t;
21
COMPILER_RT_ABI
ti_int
fixsfti.c
17
typedef
ti_int
fixint_t;
21
COMPILER_RT_ABI
ti_int
fixtfti.c
15
typedef
ti_int
fixint_t;
19
COMPILER_RT_ABI
ti_int
mulvti3.c
23
COMPILER_RT_ABI
ti_int
24
__mulvti3(
ti_int
a,
ti_int
b)
26
const int N = (int)(sizeof(
ti_int
) * CHAR_BIT);
27
const
ti_int
MIN = (
ti_int
)1 << (N-1);
28
const
ti_int
MAX = ~MIN;
41
ti_int
sa = a >> (N - 1);
42
ti_int
abs_a = (a ^ sa) - sa;
43
ti_int
sb = b >> (N - 1)
[
all
...]
addvti3.c
23
COMPILER_RT_ABI
ti_int
24
__addvti3(
ti_int
a,
ti_int
b)
26
ti_int
s = (tu_int) a + (tu_int) b;
subvti3.c
23
COMPILER_RT_ABI
ti_int
24
__subvti3(
ti_int
a,
ti_int
b)
26
ti_int
s = (tu_int) a - (tu_int) b;
fixxfti.c
22
*
ti_int
is a 128 bit integral type
23
* value in long double is representable in
ti_int
30
COMPILER_RT_ABI
ti_int
33
const
ti_int
ti_max = (
ti_int
)((~(tu_int)0) / 2);
34
const
ti_int
ti_min = -ti_max - 1;
40
ti_int
s = -(si_int)((fb.u.high.s.low & 0x00008000) >> 15);
41
ti_int
r = fb.u.low.all;
42
if ((unsigned)e >= sizeof(
ti_int
) * CHAR_BIT)
/src/sys/external/bsd/compiler_rt/dist/test/Unit/
parityti2_test.c
22
si_int __parityti2(
ti_int
a);
24
int naive_parity(
ti_int
a)
32
int test__parityti2(
ti_int
a)
46
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
56
if (test__parityti2(((
ti_int
)rand() << 96) + ((
ti_int
)rand() << 64) +
57
((
ti_int
)rand() << 32) + rand()))
divti3_test.c
21
ti_int
__divti3(
ti_int
a,
ti_int
b);
23
int test__divti3(
ti_int
a,
ti_int
b,
ti_int
expected)
25
ti_int
x = __divti3(a, b);
44
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
modti3_test.c
21
ti_int
__modti3(
ti_int
a,
ti_int
b);
23
int test__modti3(
ti_int
a,
ti_int
b,
ti_int
expected)
25
ti_int
x = __modti3(a, b);
44
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
absvti2_test.c
24
ti_int
__absvti2(
ti_int
a);
26
int test__absvti2(
ti_int
a)
28
ti_int
x = __absvti2(a);
29
ti_int
expected = a;
77
if (test__absvti2(make_ti(((
ti_int
)rand() << 32) | rand(),
78
((
ti_int
)rand() << 32) | rand())))
popcountti2_test.c
22
si_int __popcountti2(
ti_int
a);
24
int naive_popcount(
ti_int
a)
32
int test__popcountti2(
ti_int
a)
46
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
74
if (test__popcountti2(((
ti_int
)rand() << 96) | ((
ti_int
)rand() << 64) |
75
((
ti_int
)rand() << 32) | rand()))
subvti3_test.c
24
ti_int
__subvti3(
ti_int
a,
ti_int
b);
26
int test__subvti3(
ti_int
a,
ti_int
b)
28
ti_int
x = __subvti3(a, b);
29
ti_int
expected = a - b;
/src/sys/external/bsd/compiler_rt/dist/test/builtins/Unit/
parityti2_test.c
22
COMPILER_RT_ABI si_int __parityti2(
ti_int
a);
24
int naive_parity(
ti_int
a)
32
int test__parityti2(
ti_int
a)
46
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
56
if (test__parityti2(((
ti_int
)rand() << 96) + ((
ti_int
)rand() << 64) +
57
((
ti_int
)rand() << 32) + rand()))
divti3_test.c
21
COMPILER_RT_ABI
ti_int
__divti3(
ti_int
a,
ti_int
b);
23
int test__divti3(
ti_int
a,
ti_int
b,
ti_int
expected)
25
ti_int
x = __divti3(a, b);
44
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
modti3_test.c
21
COMPILER_RT_ABI
ti_int
__modti3(
ti_int
a,
ti_int
b);
23
int test__modti3(
ti_int
a,
ti_int
b,
ti_int
expected)
25
ti_int
x = __modti3(a, b);
44
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
absvti2_test.c
24
COMPILER_RT_ABI
ti_int
__absvti2(
ti_int
a);
26
int test__absvti2(
ti_int
a)
28
ti_int
x = __absvti2(a);
29
ti_int
expected = a;
77
if (test__absvti2(make_ti(((
ti_int
)rand() << 32) | rand(),
78
((
ti_int
)rand() << 32) | rand())))
popcountti2_test.c
22
COMPILER_RT_ABI si_int __popcountti2(
ti_int
a);
24
int naive_popcount(
ti_int
a)
32
int test__popcountti2(
ti_int
a)
46
char assumption_1[sizeof(
ti_int
) == 2*sizeof(di_int)] = {0};
74
if (test__popcountti2(((
ti_int
)rand() << 96) | ((
ti_int
)rand() << 64) |
75
((
ti_int
)rand() << 32) | rand()))
subvti3_test.c
24
COMPILER_RT_ABI
ti_int
__subvti3(
ti_int
a,
ti_int
b);
26
int test__subvti3(
ti_int
a,
ti_int
b)
28
ti_int
x = __subvti3(a, b);
29
ti_int
expected = a - b;
Completed in 55 milliseconds
1
2
3
4
Indexes created Mon Oct 13 01:09:56 GMT 2025