HomeSort by: relevance | last modified time | path
    Searched refs:low (Results 1 - 25 of 1370) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/gpl3/binutils/dist/gas/
flonum-copy.c 30 in_length = in->leader - in->low;
32 if (in->leader < in->low)
34 out->leader = out->low - 1; /* 0.0 case */
38 out_length = out->high - out->low;
49 memset (out->low + in_length + 1, 0, out_length - in_length);
52 memcpy (out->low, in->low,
55 out->leader = in->leader - in->low + out->low;
63 memcpy (out->low, in->low + shorten
    [all...]
  /src/external/gpl3/binutils.old/dist/gas/
flonum-copy.c 30 in_length = in->leader - in->low;
32 if (in->leader < in->low)
34 out->leader = out->low - 1; /* 0.0 case */
38 out_length = out->high - out->low;
49 memset (out->low + in_length + 1, 0, out_length - in_length);
52 memcpy (out->low, in->low,
55 out->leader = in->leader - in->low + out->low;
63 memcpy (out->low, in->low + shorten
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
wide-int-bitmask.h 38 uint64_t low, high; member in class:wide_int_bitmask
43 : low (0), high (0)
49 : low (l), high (0)
55 : low (l), high (h)
62 low &= b.low;
70 low |= b.low;
78 return wide_int_bitmask (~low, ~high);
84 return wide_int_bitmask (low | b.low, high | b.high)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
wide-int-bitmask.h 38 uint64_t low, high; member in class:wide_int_bitmask
43 : low (0), high (0)
49 : low (l), high (0)
55 : low (l), high (h)
62 low &= b.low;
70 low |= b.low;
78 return wide_int_bitmask (~low, ~high);
84 return wide_int_bitmask (low | b.low, high | b.high)
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
sum.c 4 int sum(int *list, int low, int high)
7 for (i = low; i <= high; i++)
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
sum.c 4 int sum(int *list, int low, int high)
7 for (i = low; i <= high; i++)
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/
udivmoddi4.c 45 *rem = n.s.low % d.s.low;
46 return n.s.low / d.s.low;
53 *rem = n.s.low;
57 if (d.s.low == 0)
66 *rem = n.s.high % d.s.low;
67 return n.s.high / d.s.low;
70 if (n.s.low == 0)
79 r.s.low = 0
    [all...]
udivmodti4.c 47 *rem = n.s.low % d.s.low;
48 return n.s.low / d.s.low;
55 *rem = n.s.low;
59 if (d.s.low == 0)
68 *rem = n.s.high % d.s.low;
69 return n.s.high / d.s.low;
72 if (n.s.low == 0)
81 r.s.low = 0
    [all...]
ashlti3.c 32 result.s.low = 0;
33 result.s.high = input.s.low << (b - bits_in_dword);
39 result.s.low = input.s.low << b;
40 result.s.high = (input.s.high << b) | (input.s.low >> (bits_in_dword - b));
multi3.c 28 r.s.low = (a & lower_mask) * (b & lower_mask);
29 du_int t = r.s.low >> bits_in_dword_2;
30 r.s.low &= lower_mask;
32 r.s.low += (t & lower_mask) << bits_in_dword_2;
34 t = r.s.low >> bits_in_dword_2;
35 r.s.low &= lower_mask;
37 r.s.low += (t & lower_mask) << bits_in_dword_2;
53 r.all = __mulddi3(x.s.low, y.s.low);
54 r.s.high += x.s.high * y.s.low + x.s.low * y.s.high
    [all...]
fixunsxfdi.c 38 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
39 if (e < 0 || (fb.u.high.s.low & 0x00008000))
43 return fb.u.low.all >> (63 - e);
fixunsxfsi.c 37 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
38 if (e < 0 || (fb.u.high.s.low & 0x00008000))
42 return fb.u.low.s.high >> (31 - e);
fixunsxfti.c 37 int e = (fb.u.high.s.low & 0x00007FFF) - 16383;
38 if (e < 0 || (fb.u.high.s.low & 0x00008000))
42 tu_int r = fb.u.low.all;
int_types.h 39 su_int low; member in struct:__anon4068::__anon4069
43 su_int low;
54 su_int low; member in struct:__anon4070::__anon4071
58 su_int low;
80 du_int low; member in struct:__anon4072::__anon4073
84 du_int low;
95 du_int low; member in struct:__anon4074::__anon4075
99 du_int low;
107 r.s.low = l;
114 r.s.low = l
135 udwords low; member in struct:__anon4078
    [all...]
cmpdi2.c 33 if (x.s.low < y.s.low)
35 if (x.s.low > y.s.low)
cmpti2.c 35 if (x.s.low < y.s.low)
37 if (x.s.low > y.s.low)
ucmpdi2.c 33 if (x.s.low < y.s.low)
35 if (x.s.low > y.s.low)
ucmpti2.c 35 if (x.s.low < y.s.low)
37 if (x.s.low > y.s.low)
muldi3.c 26 r.s.low = (a & lower_mask) * (b & lower_mask);
27 su_int t = r.s.low >> bits_in_word_2;
28 r.s.low &= lower_mask;
30 r.s.low += (t & lower_mask) << bits_in_word_2;
32 t = r.s.low >> bits_in_word_2;
33 r.s.low &= lower_mask;
35 r.s.low += (t & lower_mask) << bits_in_word_2;
51 r.all = __muldsi3(x.s.low, y.s.low);
52 r.s.high += x.s.high * y.s.low + x.s.low * y.s.high
    [all...]
ctzti2.c 28 const di_int f = -(x.s.low == 0);
29 return __builtin_ctzll((x.s.high & f) | (x.s.low & ~f)) +
ffsdi2.c 26 if (x.s.low == 0)
32 return __builtin_ctz(x.s.low) + 1;
  /src/external/gpl3/gcc/dist/libgfortran/runtime/
select_inc.c 31 CHARTYPE *low; member in struct:__anon14425
53 int i, low, high, mid; local
61 if (table->low == NULL && table->high == NULL)
71 /* Try the high and low bounds if present. */
73 if (table->low == NULL)
89 if (compare_string (t->low_len, t->low, selector_len, selector) <= 0)
100 low = -1;
103 while (low + 1 < high)
105 mid = (low + high) / 2;
108 i = compare_string (t->low_len, t->low, selector_len, selector)
    [all...]
  /src/external/gpl3/gcc.old/dist/libgfortran/runtime/
select_inc.c 31 CHARTYPE *low; member in struct:__anon16837
53 int i, low, high, mid; local
61 if (table->low == NULL && table->high == NULL)
71 /* Try the high and low bounds if present. */
73 if (table->low == NULL)
89 if (compare_string (t->low_len, t->low, selector_len, selector) <= 0)
100 low = -1;
103 while (low + 1 < high)
105 mid = (low + high) / 2;
108 i = compare_string (t->low_len, t->low, selector_len, selector)
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/ppc/
floatditf.c 15 doublebits low = { .d = twop52 }; local
16 low.x |= a & UINT64_C(0x00000000ffffffff); /* 0x1.0p52 + low 32 bits of a. */
21 * high_addend and low.d, and we wish to return their sum
31 result.s.hi = high_addend + low.d;
32 result.s.lo = (high_addend - result.s.hi) + low.d;
floatunditf.c 19 doublebits low = { .d = twop52 }; local
22 low.x |= a & UINT64_C(0x00000000ffffffff); /* 0x1.0p52 + low 32 bits of a */
27 * high_addend and low.d, and we wish to return their sum
36 result.s.hi = high_addend + low.d;
37 result.s.lo = (high_addend - result.s.hi) + low.d;

Completed in 98 milliseconds

1 2 3 4 5 6 7 8 91011>>