| /src/lib/libm/src/ |
| s_copysignf.c | 33 u_int32_t ix,iy; local
35 GET_FLOAT_WORD(iy,y);
36 SET_FLOAT_WORD(x,(ix&0x7fffffff)|(iy&0x80000000));
|
| s_nextafterf.c | 27 int32_t hx,hy,ix,iy; local
32 iy = hy&0x7fffffff; /* |y| */
35 (iy>0x7f800000)) /* y is nan */
|
| s_nextafter.c | 37 int32_t hx,hy,ix,iy; local
43 iy = hy&0x7fffffff; /* |y| */
46 ((iy>=0x7ff00000)&&((iy-0x7ff00000)|ly)!=0)) /* y is nan */
|
| e_atan2f.c | 36 int32_t k,m,hx,hy,ix,iy; local
41 iy = hy&0x7fffffff;
43 (iy>0x7f800000)) /* x or y is NaN */
49 if(iy==0) {
62 if(iy==0x7f800000) {
79 if(iy==0x7f800000) return (hy<0)? -pi_o_2-tiny: pi_o_2+tiny;
82 k = (iy-ix)>>23;
|
| e_fmod.c | 36 int32_t n,hx,hy,hz,ix,iy,sx,i; local
64 /* determine iy = ilogb(y) */
67 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
69 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
71 } else iy = (hy>>20)-1023;
86 if(iy >= -1022)
89 n = -1022-iy;
100 n = ix - iy;
[all...] |
| e_fmodf.c | 35 int32_t n,hx,hy,hz,ix,iy,sx,i; local
56 /* determine iy = ilogb(y) */
58 for (iy = -126,i=(hy<<8); i>=0; i<<=1) iy -=1;
59 } else iy = (hy>>23)-127;
68 if(iy >= -126)
71 n = -126-iy;
76 n = ix - iy;
94 iy -= 1;
96 if(iy>= -126) { /* normalize output *
[all...] |
| s_remquo.c | 39 int32_t n,hx,hy,hz,ix,iy,sx,i; local
73 /* determine iy = ilogb(y) */
76 for (iy = -1043, i=ly; i>0; i<<=1) iy -=1;
78 for (iy = -1022,i=(hy<<11); i>0; i<<=1) iy -=1;
80 } else iy = (hy>>20)-1023;
95 if(iy >= -1022)
98 n = -1022-iy;
109 n = ix - iy;
[all...] |
| s_remquof.c | 37 int32_t n,hx,hy,hz,ix,iy,sx,i; local
63 /* determine iy = ilogb(y) */
65 for (iy = -126,i=(hy<<8); i>0; i<<=1) iy -=1;
66 } else iy = (hy>>23)-127;
75 if(iy >= -126)
78 n = -126-iy;
83 n = ix - iy;
101 iy -= 1;
103 if(iy>= -126) { /* normalize output *
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| bn_mp_reduce_is_2k_l.c | 23 int ix, iy; local
31 for (iy = ix = 0; ix < a->used; ix++) {
33 ++iy;
36 return (iy >= (a->used/2)) ? MP_YES : MP_NO;
|
| bn_reverse.c | 24 int ix, iy; local
28 iy = len - 1;
29 while (ix < iy) {
31 s[ix] = s[iy];
32 s[iy] = t;
34 --iy;
|
| bn_mp_reduce_is_2k.c | 23 int ix, iy, iw; local
31 iy = mp_count_bits(a);
36 for (ix = DIGIT_BIT; ix < iy; ix++) {
|
| bn_mp_montgomery_reduce.c | 61 register int iy; local
75 for (iy = 0; iy < n->used; iy++) {
|
| bn_s_mp_sqr.c | 24 int res, ix, iy, pa; local
48 /* left hand side of A[ix] * A[iy] */
54 for (iy = ix + 1; iy < pa; iy++) {
56 r = ((mp_word)tmpx) * ((mp_word)a->dp[iy]);
|
| bn_fast_mp_montgomery_reduce.c | 95 register int iy; local
106 for (iy = 0; iy < n->used; iy++) {
|
| bn_fast_s_mp_mul_digs.c | 56 int iy; local
70 iy = MIN(a->used-tx, ty+1);
73 for (iz = 0; iz < iy; ++iz) {
|
| bn_fast_s_mp_mul_high_digs.c | 47 int tx, ty, iy; local
61 iy = MIN(a->used-tx, ty+1);
64 for (iz = 0; iz < iy; iz++) {
|
| bn_fast_s_mp_sqr.c | 23 * So basically you set up iy like before then you min it with
47 int tx, ty, iy; local
65 iy = MIN(a->used-tx, ty+1);
71 iy = MIN(iy, (ty-tx+1)>>1);
74 for (iz = 0; iz < iy; iz++) {
|
| bn_s_mp_mul_digs.c | 27 int res, pa, pb, ix, iy; local
64 for (iy = 0; iy < pb; iy++) {
77 if (ix + iy < digs) {
|
| /src/games/trek/ |
| visual.c | 73 int ix, iy; local
83 iy = Ship.secty + v->y;
84 if (ix < 0 || ix >= NSECTS || iy < 0 || iy >= NSECTS)
87 co = Sect[ix][iy];
88 printf("%d,%d %c ", ix, iy, co);
91 iy = Ship.secty + v->y;
92 if (ix < 0 || ix >= NSECTS || iy < 0 || iy >= NSECTS)
95 co = Sect[ix][iy];
[all...] |
| snova.c | 49 ** otherwise, the current quadrant is taken, and (ix, iy) give
70 int ix, iy = 0; local
91 for (iy = 0; iy < NSECTS; iy++)
92 if (Sect[ix][iy] == STAR ||
93 Sect[ix][iy] == INHABIT)
103 iy = y;
111 printf("\a\nRED ALERT: supernova occurring at %d,%d\n", ix, iy);
113 dy = iy - Ship.secty
[all...] |
| events.c | 68 int ix, iy; local
152 for (iy = 0; iy < NQUADS; iy++) {
153 q = &Quad[ix][iy];
164 if (Ship.quadx == ix && Ship.quady == iy)
169 Ship.quady = iy;
193 iy = Now.base[i].y;
195 q = &Quad[ix][iy];
204 if (e->x == ix && e->y == iy)
[all...] |
| move.c | 86 int ix = 0, iy = 0; local
150 iy = (y += dy);
153 printf("ix = %d, x = %.2f, iy = %d, y = %.2f\n",
154 ix, x, iy, y);
165 iy = -1;
167 iy = dy + 0.5;
170 printf("New quad: ix = %d, iy = %d\n", ix, iy);
179 Ship.quady = iy / NSECTS;
181 Ship.secty = iy % NSECTS
[all...] |
| setup.c | 88 int ix, iy; local
257 iy = ranf(NQUADS);
258 q = &Quad[ix][iy];
265 Now.base[i].y = iy;
270 Ship.quady = iy;
281 iy = ranf(NQUADS);
282 q = &Quad[ix][iy];
|
| /src/external/gpl3/gcc/dist/libquadmath/math/ |
| nextafterq.c | 31 int64_t hx,hy,ix,iy; local
37 iy = hy&0x7fffffffffffffffLL; /* |y| */
40 ((iy>=0x7fff000000000000LL)&&((iy-0x7fff000000000000LL)|ly)!=0)) /* y is nan */
|
| /src/external/gpl3/gcc.old/dist/libquadmath/math/ |
| nextafterq.c | 31 int64_t hx,hy,ix,iy; local
37 iy = hy&0x7fffffffffffffffLL; /* |y| */
40 ((iy>=0x7fff000000000000LL)&&((iy-0x7fff000000000000LL)|ly)!=0)) /* y is nan */
|
