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

1 2

  /src/lib/libc/gdtoa/
g_dfmt.c 59 sign = L[_0] & 0x80000000L;
60 if ((L[_0] & 0x7ff00000) == 0x7ff00000) {
64 if (L[_0] & 0xfffff || L[_1]) {
72 if (L[_1] == 0 && (L[_0] ^ sign) == 0 /*d == 0.*/) {
75 if (L[_0] & 0x80000000L)
83 bits[1] = L[_0] & 0xfffff;
84 if ( (ex = (L[_0] >> 20) & 0x7ff) !=0)
strtopQ.c 36 #undef _0
42 #define _0 0 macro
48 #define _0 3 macro
82 L[_0] = (bits[3] & ~0x10000) | ((expt + 0x3fff + 112) << 16);
89 L[_0] = bits[3];
93 L[_0] = 0x7fff0000;
104 L[_0] |= 0x80000000L;
strtopx.c 36 #undef _0
42 #define _0 0 macro
49 #define _0 4 macro
80 L[_0] = 0;
85 L[_0] = expt + 0x3fff + 63;
94 L[_0] = 0x7fff;
107 L[_0] |= 0x8000;
g_ddfmt.c 70 if ((L[_0] & 0x7ff00000L) == 0x7ff00000L) {
72 if (L[_0] & 0xfffff || L[_1]) {
76 if ((L[2+_0] & 0x7ff00000) == 0x7ff00000) {
77 if (L[2+_0] & 0xfffff || L[2+_1])
79 if ((L[_0] ^ L[2+_0]) & 0x80000000L)
84 if (L[_0] & 0x80000000L)
88 if ((L[2+_0] & 0x7ff00000) == 0x7ff00000) {
90 if (L[_0] & 0xfffff || L[_1])
97 if (L[_0] & L[2+_0] & 0x80000000L
    [all...]
strtopxL.c 36 #undef _0
42 #define _0 0 macro
47 #define _0 2 macro
80 L[_0] = (expt + 0x3fff + 63) << 16;
84 L[_0] = 0x7fff << 16;
95 L[_0] |= 0x80000000L;
strtorQ.c 36 #undef _0
42 #define _0 0 macro
48 #define _0 3 macro
72 L[_0] = (bits[3] & ~0x10000) | ((expt + 0x3fff + 112) << 16);
79 L[_0] = bits[3];
83 L[_0] = 0x7fff0000;
94 L[_0] |= 0x80000000L;
strtorx.c 36 #undef _0
42 #define _0 0 macro
49 #define _0 4 macro
70 L[_0] = 0;
75 L[_0] = expt + 0x3fff + 63;
84 L[_0] = 0x7fff;
97 L[_0] |= 0x8000;
g_xLfmt.c 36 #undef _0
42 #define _0 0 macro
47 #define _0 2 macro
75 sign = L[_0] & 0x80000000L;
78 if ( (ex = (L[_0] >> 16) & 0x7fff) !=0) {
strtodnrp.c 70 u.L[_0] = (bits[1] & ~0x100000) | ((expt + 0x3ff + 52) << 20);
75 u.L[_0] = bits[1];
79 u.L[_0] = 0x7ff00000;
89 u.L[_0] = 0x7ff00000 | bits[1];
93 u.L[_0] |= 0x80000000L;
strtordd.c 53 L[_0] = (bits[2] >> 21) | (bits[3] << 11 & 0xfffff)
91 L[2+_0] = (bits[1] & 0xfffff) | (expt << 20);
104 L[_0] = bits[1];
110 L[_0] = ((bits[3] << i | bits[2] >> j) & 0xfffff)
113 L[2+_0] = bits[1] & (((ULong)1L << j) - 1);
122 L[_0] = (bits[2] >> j & 0xfffff) | ((33 + j) << 20);
124 L[2+_0] = bits[1] & (((ULong)1L << j) - 1);
129 L[_0] = (bits[2] & 0xfffff) | (33 << 20);
131 L[2+_0] = 0;
136 L[_0] = (((bits[2] << i) | (bits[1] >> j)) & 0xfffff
    [all...]
g_Qfmt.c 36 #undef _0
42 #define _0 0 macro
48 #define _0 3 macro
77 sign = L[_0] & 0x80000000L;
78 bits[3] = L[_0] & 0xffff;
83 if ( (ex = (L[_0] & 0x7fff0000L) >> 16) !=0) {
strtorxL.c 36 #undef _0
42 #define _0 0 macro
47 #define _0 2 macro
68 L[_0] = (expt + 0x3fff + 63) << 16;
74 L[_0] = 0x7fff << 16;
85 L[_0] |= 0x80000000L;
strtopdd.c 74 u->L[_0] = (bits[2] >> 21) | ((bits[3] << 11) & 0xfffff)
112 u->L[2+_0] = (bits[1] & 0xfffff) | (expt << 20);
125 u->L[_0] = bits[1];
131 u->L[_0] = ((bits[3] << i | bits[2] >> j) & 0xfffff)
134 u->L[2+_0] = bits[1] & ((1L << j) - 1);
143 u->L[_0] = (bits[2] >> j & 0xfffff) | (33 + j) << 20;
145 u->L[2+_0] = bits[1] & ((1L << j) - 1);
150 u->L[_0] = (bits[2] & 0xfffff) | (33 << 20);
152 u->L[2+_0] = 0;
157 u->L[_0] = (((bits[2] << i) | (bits[1] >> j)) & 0xfffff
    [all...]
qnan.c 58 #define _0 1 macro
63 #define _0 0 macro
89 a.L[_0] = b.L[_0] = 0x7ff00000;
strtord.c 51 L[_0] = bits[1];
57 L[_0] = (bits[1] & ~0x100000) | ((expt + 0x3ff + 52) << 20);
61 L[_0] = 0x7ff00000;
72 L[_0] |= 0x80000000L;
g_xfmt.c 36 #undef _0
42 #define _0 0 macro
49 #define _0 4 macro
80 sign = L[_0] & 0x8000;
83 if ( (ex = L[_0] & 0x7fff) !=0) {
strtodI.c 47 if (!(L[_1] | (L[_0] & 0xfffff))
48 && (L[_0] & 0x7ff00000) > 0x00100000)
107 if ((u->L[_0] & 0x7ff00000) < 0x3500000) {
  /src/lib/libc/gdtoa/test/
ddtest.c 74 printf("%s = %s = #%lx %lx\n", what, buf, U u.L[_0], U u.L[_1]);
103 LL[0] = u.L[_0];
105 LL[2] = u.L[2+_0];
109 u.L[_0] = LL[0];
111 u.L[2+_0] = LL[2];
152 U ((ULong*)ddI)[_0],
154 U ((ULong*)ddI)[2+_0],
160 U ((ULong*)ddI)[_0], U ((ULong*)ddI)[_1],
161 U ((ULong*)ddI)[2+_0], U ((ULong*)ddI)[2+_1],
164 U ((ULong*)ddI)[4+_0], U ((ULong*)ddI)[4+_1]
    [all...]
dtest.c 87 LL[0] = u.L[_0];
90 u.L[_0] = LL[0];
93 printf("--> f = #%lx %lx\n", (long)u.L[_0], (long)u.L[_1]);
106 (int)(se-ibuf), i, u.f, U u.L[_0], U u.L[_1]);
120 U ((ULong*)fI)[_0], U ((ULong*)fI)[_1],
125 U ((ULong*)fI)[_0], U ((ULong*)fI)[_1], fI[0]);
127 U ((ULong*)&fI[1])[_0], U ((ULong*)&fI[1])[_1],
Qtest.c 60 #undef _0
66 #define _0 0 macro
72 #define _0 3 macro
109 /* sscanf(s+1, "%lx %lx %lx %lx", &u.bits[_0], */
111 u.bits[_0] = (ULong)strtoul(s1 = s+1, &se, 16);
121 printf(" --> f = #%lx %lx %lx %lx\n", U u.bits[_0],
134 U u.bits[_0], U u.bits[_1], U u.bits[_2], U u.bits[_3]);
151 U v[0].bits[_0], U v[0].bits[_1],
159 U v[0].bits[_0], U v[0].bits[_1],
164 U v[1].bits[_0], U v[1].bits[_1]
    [all...]
xLtest.c 63 #undef _0
69 #define _0 0 macro
74 #define _0 2 macro
103 /* sscanf(s+1, "%lx %lx %lx", &u.bits[_0], */
105 u.bits[_0] = (ULong)strtoul(s1 = s+1, &se, 16);
112 printf(" --> f = #%lx %lx %lx\n", U u.bits[_0],
125 U u.bits[_0], U u.bits[_1], U u.bits[_2]);
142 U v[0].bits[_0], U v[0].bits[_1],
150 U v[0].bits[_0], U v[0].bits[_1],
155 U v[1].bits[_0], U v[1].bits[_1]
    [all...]
xtest.c 61 #undef _0
67 #define _0 0 macro
74 #define _0 4 macro
105 sscanf(s+1, "%hx %hx %hx %hx %hx", &u.bits[_0],
109 printf(" --> f = #%x %x %x %x %x\n", u.bits[_0],
122 u.bits[_0], u.bits[_1], u.bits[_2],
140 v[0].bits[_0], v[0].bits[_1],
149 v[0].bits[_0], v[0].bits[_1],
155 v[1].bits[_0], v[1].bits[_1],
dItest.c 50 U ((ULong*)&d)[_0], U ((ULong*)&d)[_1], buf);
  /src/sys/kern/
genlintstub.awk 179 /^[\/ ]\* LINTSTUB: Empty($|[^_0-9A-Za-z])/ {
184 /^[\/ ]\* LINTSTUB: Ignore($|[^_0-9A-Za-z])/ {
  /src/usr.bin/sed/TEST/
math.sed 149 s//_0/
151 s/9_/_0/

Completed in 75 milliseconds

1 2