| /src/lib/libm/src/ |
| s_ceilf.c | 29 int32_t i0,jj0; local in function:ceilf
32 GET_FLOAT_WORD(i0,x);
33 jj0 = ((i0>>23)&0xff)-0x7f;
37 if(i0<0) {i0=0x80000000;}
38 else if(i0!=0) { i0=0x3f800000;}
42 if((i0&i)==0) return x; /* x is integral */
44 if(i0>0) i0 += (0x00800000)>>jj0
[all...] |
| s_floorf.c | 38 int32_t i0,jj0; local in function:floorf
40 GET_FLOAT_WORD(i0,x);
41 jj0 = ((i0>>23)&0xff)-0x7f;
45 if(i0>=0) {i0=0;}
46 else if((i0&0x7fffffff)!=0)
47 { i0=0xbf800000;}
51 if((i0&i)==0) return x; /* x is integral */
53 if(i0<0) i0 += (0x00800000)>>jj0
[all...] |
| s_trunc.c | 43 int32_t i0,i1,jj0; local in function:trunc
45 EXTRACT_WORDS(i0,i1,x);
46 jj0 = ((i0>>20)&0x7ff)-0x3ff;
50 i0 &= 0x80000000U;
55 if(((i0&i)|i1)==0) return x; /* x is integral */
57 i0 &= (~i); i1=0;
69 INSERT_WORDS(x,i0,i1);
|
| s_truncf.c | 38 int32_t i0,jj0; local in function:truncf
40 GET_FLOAT_WORD(i0,x);
41 jj0 = ((i0>>23)&0xff)-0x7f;
45 i0 &= 0x80000000;
48 if((i0&i)==0) return x; /* x is integral */
50 i0 &= (~i);
56 SET_FLOAT_WORD(x,i0);
|
| s_ceil.c | 40 int32_t i0,i1,jj0; local in function:__strong_alias
42 EXTRACT_WORDS(i0,i1,x);
43 jj0 = ((i0>>20)&0x7ff)-0x3ff;
47 if(i0<0) {i0=0x80000000;i1=0;}
48 else if((i0|i1)!=0) { i0=0x3ff00000;i1=0;}
52 if(((i0&i)|i1)==0) return x; /* x is integral */
54 if(i0>0) i0 += (0x00100000)>>jj0
[all...] |
| s_floor.c | 40 int32_t i0,i1,jj0; local in function:floor
42 EXTRACT_WORDS(i0,i1,x);
43 jj0 = ((i0>>20)&0x7ff)-0x3ff;
47 if(i0>=0) {i0=i1=0;}
48 else if(((i0&0x7fffffff)|i1)!=0)
49 { i0=0xbff00000;i1=0;}
53 if(((i0&i)|i1)==0) return x; /* x is integral */
55 if(i0<0) i0 += (0x00100000)>>jj0
[all...] |
| s_modf.c | 41 int32_t i0,i1,jj0; local in function:__strong_alias
43 EXTRACT_WORDS(i0,i1,x);
44 jj0 = (((uint32_t)i0>>20)&0x7ff)-0x3ff; /* exponent of x */
47 INSERT_WORDS(*iptr,i0&0x80000000,0); /* *iptr = +-0 */
51 if(((i0&i)|i1)==0) { /* x is integral */
58 INSERT_WORDS(*iptr,i0&(~i),0);
79 INSERT_WORDS(*iptr,i0,i1&(~i));
|
| s_modff.c | 29 int32_t i0,jj0; local in function:modff
31 GET_FLOAT_WORD(i0,x);
32 jj0 = ((i0>>23)&0xff)-0x7f; /* exponent of x */
35 SET_FLOAT_WORD(*iptr,i0&0x80000000); /* *iptr = +-0 */
39 if((i0&i)==0) { /* x is integral */
46 SET_FLOAT_WORD(*iptr,i0&(~i));
|
| s_rint.c | 40 int32_t i0,jj0,sx; local in function:rint
43 EXTRACT_WORDS(i0,i1,x);
44 sx = (i0>>31)&1;
45 jj0 = ((i0>>20)&0x7ff)-0x3ff;
48 if(((i0&0x7fffffff)|i1)==0) return x;
49 i1 |= (i0&0x0fffff);
50 i0 &= 0xfffe0000;
51 i0 |= ((i1|-i1)>>12)&0x80000;
52 SET_HIGH_WORD(x,i0);
55 GET_HIGH_WORD(i0,t)
[all...] |
| s_rintf.c | 33 int32_t i0,jj0,sx; local in function:rintf
40 GET_FLOAT_WORD(i0,x);
41 sx = (i0>>31)&1;
42 jj0 = ((i0>>23)&0xff)-0x7f;
45 if((i0&0x7fffffff)==0) return x;
46 i1 = (i0&0x07fffff);
47 i0 &= 0xfff00000;
48 i0 |= ((i1|-i1)>>9)&0x400000;
49 SET_FLOAT_WORD(x,i0);
52 GET_FLOAT_WORD(i0,t)
[all...] |
| s_exp2.c | 344 * by i0 = i + TBLSIZE/2.
357 int32_t i0; local in function:exp2
380 /* Reduce x, computing z, i0, and k. */
382 i0 = x_p_redux.parts.lsw;
384 i0 += TBLSIZE / 2;
385 k = i0 >> TBLBITS;
386 i0 &= TBLSIZE - 1;
389 /* Compute r = exp2(y) = exp2t[i0] * p(z - eps[i]). */
390 t = tbl[i0].exp2;
391 z -= tbl[i0].eps
[all...] |
| s_exp2f.c | 122 uint32_t hx, ix, i0; local in function:exp2f
143 /* Reduce x, computing z, i0, and k. */
145 GET_FLOAT_WORD(i0, t);
146 i0 += TBLSIZE / 2;
147 k = (i0 >> TBLBITS) << 20;
148 i0 &= TBLSIZE - 1;
153 /* Compute r = exp2(y) = exp2ft[i0] * p(z). */
154 tv = exp2ft[i0];
|
| /src/tests/usr.bin/indent/ |
| opt_cs.c | 12 int i0 = (int)3.0; variable in typeref:typename:int
18 int i0 = (int) 3.0; variable in typeref:typename:int
24 int i0 = (int)3.0; variable in typeref:typename:int
|
| /src/games/hack/ |
| hack.rip.c | 110 int i, i0; local in function:outrip
111 i0 = i1 = 0;
114 i0 = i, i1 = i + 1;
115 if (!i0)
116 i0 = i1 = 16;
118 buf[i0] = 0;
|
| hack.c | 566 int x, y, i, x0 = 0, y0 = 0, m0 = 0, i0 = 9; local in function:lookaround
612 if (i < i0) {
613 i0 = i;
643 if ((flags.run == 1 || flags.run == 3) && !noturn && !m0 && i0 &&
644 (corrct == 1 || (corrct == 2 && i0 == 1))) {
646 if (i0 == 2) {
|
| /src/lib/libm/noieee_src/ |
| n_exp2.c | 336 * by i0 = i + TBLSIZE/2. For cache efficiency, exp2t[] and eps[] are
348 uint32_t hx, ix, i0, temp; local in function:exp2
363 /* Reduce x, computing z, i0, and k. */
365 i0 = ((uint32_t*)&t)[1];
366 i0 += TBLSIZE / 2;
367 k = (i0 >> TBLBITS) << 20;
368 i0 = (i0 & (TBLSIZE - 1)) << 1;
372 /* Compute r = exp2(y) = exp2t[i0] * p(z - eps[i]). */
373 t = tbl[i0]; /* exp2t[i0] *
[all...] |
| n_exp2f.c | 102 uint32_t hx, ix, i0; local in function:exp2f
117 /* Reduce x, computing z, i0, and k. */
118 i0 = x + redux;
119 memcpy(&t, &i0, sizeof(t));
120 i0 += TBLSIZE / 2;
121 k = (i0 >> TBLBITS) << 20;
122 i0 &= TBLSIZE - 1;
129 /* Compute r = exp2(y) = exp2ft[i0] * p(z). */
130 tv = exp2ft[i0];
|
| /src/lib/libm/ld80/ |
| s_exp2l.c | 220 uint32_t hx, ix, i0; local in function:exp2l
244 * Reduce x, computing z, i0, and k. The low bits of x + redux
246 * TBLBITS fractional bits (i0). We use bit tricks to extract these
251 * We split this into k = 0xabc and i0 = 0x12 (adjusted to
258 i0 = u.extu_fracl + TBLSIZE / 2;
259 k = (int)i0 >> TBLBITS;
260 i0 = (i0 & (TBLSIZE - 1)) << 1;
272 /* Compute r = exp2l(y) = exp2lt[i0] * p(z). */
273 long double t_hi = tbl[i0];
[all...] |
| /src/lib/libm/ld128/ |
| s_exp2l.c | 346 * by i0 = i + TBLSIZE/2.
358 uint32_t hx, ix, i0; local in function:exp2l
384 * Reduce x, computing z, i0, and k. The low bits of x + redux
386 * TBLBITS fractional bits (i0). We use bit tricks to extract these
391 * We split this into k = 0xabc and i0 = 0x12 (adjusted to
398 i0 = (u.extu_fracl & 0xffffffff) + TBLSIZE / 2;
399 k = (int)i0 >> TBLBITS;
400 i0 = i0 & (TBLSIZE - 1);
413 /* Compute r = exp2(y) = exp2t[i0] * p(z - eps[i]). *
[all...] |
| /src/sys/dev/onewire/ |
| onewire.c | 401 int i, i0 = -1, lastd = -1; local in function:onewire_scan
436 for (i = 0,i0 = -1; i < 64; i++) {
447 i0 = i;
466 lastd = i0;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_bitvector.h | 129 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { local in function:__sanitizer::TwoLevelBitVector::setAll
130 l1_[i0].setAll();
132 l2_[i0][i1].setAll();
146 uptr i0 = idx0(idx); local in function:__sanitizer::TwoLevelBitVector::setBit
149 if (!l1_[i0].getBit(i1)) {
150 l1_[i0].setBit(i1);
151 l2_[i0][i1].clear();
153 bool res = l2_[i0][i1].setBit(i2)
161 uptr i0 = idx0(idx); local in function:__sanitizer::TwoLevelBitVector::clearBit
175 uptr i0 = idx0(idx); local in function:__sanitizer::TwoLevelBitVector::getBit
183 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { local in function:__sanitizer::TwoLevelBitVector::getAndClearFirstOne
200 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { local in function:__sanitizer::TwoLevelBitVector::setUnion
216 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { local in function:__sanitizer::TwoLevelBitVector::setIntersection
236 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { local in function:__sanitizer::TwoLevelBitVector::setDifference
257 for (uptr i0 = 0; i0 < kLevel1Size; i0++) { local in function:__sanitizer::TwoLevelBitVector::intersectsWith
[all...] |
| /src/lib/libcrypt/ |
| crypt.c | 149 * representation is "union"ed with 32 bit values "i0" and "i1", and, on
158 * first byte to be the LSB of i0. We cannot have both these things, so we
161 * 64-bit datatype since the relative order of i0 and i1 are unknown. It
232 int32_t i0; member in struct:__anonc87fd5ce010a::__anonc87fd5ce0208
250 rslt = (cvt.b32.i0 & 0x3f3f3f3fL) << 2; \
257 #define LOAD(d,d0,d1,bl) d0 = (bl).b32.i0, d1 = (bl).b32.i1
259 #define OR(d,d0,d1,bl) d0 |= (bl).b32.i0, d1 |= (bl).b32.i1
260 #define STORE(s,s0,s1,bl) (bl).b32.i0 = s0, (bl).b32.i1 = s1
813 B.b32.i0 = k ^ q0 ^ kp->b32.i0; \
[all...] |
| /src/tests/usr.bin/xlint/lint1/ |
| init_c99.c | 268 int i0; member in struct:ten
|
