| /netbsd/src/lib/libm/src/ |
| D | e_sqrtf.c | 31 int32_t ix,s,q,m,t,i; in __ieee754_sqrtf() local 34 GET_FLOAT_WORD(ix,x); in __ieee754_sqrtf() 37 if((ix&0x7f800000)==0x7f800000) { in __ieee754_sqrtf() 42 if(ix<=0) { in __ieee754_sqrtf() 43 if((ix&(~sign))==0) return x;/* sqrt(+-0) = +-0 */ in __ieee754_sqrtf() 44 else if(ix<0) in __ieee754_sqrtf() 48 m = (ix>>23); in __ieee754_sqrtf() 50 for(i=0;(ix&0x00800000)==0;i++) ix<<=1; in __ieee754_sqrtf() 54 ix = (ix&0x007fffff)|0x00800000; in __ieee754_sqrtf() 56 ix += ix; in __ieee754_sqrtf() [all …]
|
| D | s_cospif.c | 51 uint32_t ix, jj0; in cospif() local 53 GET_FLOAT_WORD(ix, x); in cospif() 54 ix = ix & 0x7fffffff; in cospif() 55 SET_FLOAT_WORD(ax, ix); in cospif() 57 if (ix < 0x3f800000) { /* |x| < 1 */ in cospif() 58 if (ix < 0x3e800000) { /* |x| < 0.25 */ in cospif() 59 if (ix < 0x38800000) { /* |x| < 0x1p-14 */ in cospif() 67 if (ix < 0x3f000000) /* |x| < 0.5 */ in cospif() 69 else if (ix < 0x3f400000) { /* |x| < 0.75 */ in cospif() 70 if (ix == 0x3f000000) in cospif() [all …]
|
| D | s_cospi.c | 85 uint32_t hx, ix, jj0, lx; in cospi() local 88 ix = hx & 0x7fffffff; in cospi() 89 INSERT_WORDS(ax, ix, lx); in cospi() 91 if (ix < 0x3ff00000) { /* |x| < 1 */ in cospi() 92 if (ix < 0x3fd00000) { /* |x| < 0.25 */ in cospi() 93 if (ix < 0x3e200000) { /* |x| < 0x1p-29 */ in cospi() 100 if (ix < 0x3fe00000) /* |x| < 0.5 */ in cospi() 102 else if (ix < 0x3fe80000){ /* |x| < 0.75 */ in cospi() 111 if (ix < 0x43300000) { /* 1 <= |x| < 0x1p52 */ in cospi() 112 FFLOOR(x, jj0, ix, lx); /* Integer part of ax. */ in cospi() [all …]
|
| D | e_j0f.c | 48 int32_t hx,ix; in __ieee754_j0f() local 51 ix = hx&0x7fffffff; in __ieee754_j0f() 52 if(ix>=0x7f800000) return one/(x*x); in __ieee754_j0f() 54 if(ix >= 0x40000000) { /* |x| >= 2.0 */ in __ieee754_j0f() 59 if(ix<0x7f000000) { /* make sure x+x not overflow */ in __ieee754_j0f() 69 if(ix>0x80000000) z = (invsqrtpi*cc)/sqrtf(x); in __ieee754_j0f() 78 if(ix<0x39000000) { /* |x| < 2**-13 */ in __ieee754_j0f() 80 if(ix<0x32000000) return one; /* |x|<2**-27 */ in __ieee754_j0f() 87 if(ix < 0x3F800000) { /* |x| < 1.00 */ in __ieee754_j0f() 112 int32_t hx,ix; in __ieee754_y0f() local [all …]
|
| D | e_j0.c | 90 int32_t hx,ix; in __ieee754_j0() local 93 ix = hx&0x7fffffff; in __ieee754_j0() 94 if(ix>=0x7ff00000) return one/(x*x); in __ieee754_j0() 96 if(ix >= 0x40000000) { /* |x| >= 2.0 */ in __ieee754_j0() 101 if(ix<0x7fe00000) { /* make sure x+x not overflow */ in __ieee754_j0() 110 if(ix>0x48000000) z = (invsqrtpi*cc)/sqrt(x); in __ieee754_j0() 117 if(ix<0x3f200000) { /* |x| < 2**-13 */ in __ieee754_j0() 119 if(ix<0x3e400000) return one; /* |x|<2**-27 */ in __ieee754_j0() 126 if(ix < 0x3FF00000) { /* |x| < 1.00 */ in __ieee754_j0() 151 int32_t hx,ix,lx; in __ieee754_y0() local [all …]
|
| D | s_tanpif.c | 66 uint32_t hx, ix, jj0; in tanpif() local 69 ix = hx & 0x7fffffff; in tanpif() 70 SET_FLOAT_WORD(ax, ix); in tanpif() 72 if (ix < 0x3f800000) { /* |x| < 1 */ in tanpif() 73 if (ix < 0x3f000000) { /* |x| < 0.5 */ in tanpif() 74 if (ix < 0x38800000) { /* |x| < 0x1p-14 */ in tanpif() 75 if (ix == 0) in tanpif() 85 } else if (ix == 0x3f000000) in tanpif() 92 if (ix < 0x4b000000) { /* 1 <= |x| < 0x1p23 */ in tanpif() 93 FFLOORF(x, jj0, ix); /* Integer part of ax. */ in tanpif() [all …]
|
| D | e_j1.c | 91 int32_t hx,ix; in __ieee754_j1() local 94 ix = hx&0x7fffffff; in __ieee754_j1() 95 if(ix>=0x7ff00000) return one/x; in __ieee754_j1() 97 if(ix >= 0x40000000) { /* |x| >= 2.0 */ in __ieee754_j1() 102 if(ix<0x7fe00000) { /* make sure y+y not overflow */ in __ieee754_j1() 111 if(ix>0x48000000) z = (invsqrtpi*cc)/sqrt(y); in __ieee754_j1() 119 if(ix<0x3e400000) { /* |x|<2**-27 */ in __ieee754_j1() 148 int32_t hx,ix,lx; in __ieee754_y1() local 151 ix = 0x7fffffff&hx; in __ieee754_y1() 153 if(ix>=0x7ff00000) return one/(x+x*x); in __ieee754_y1() [all …]
|
| D | e_j1f.c | 49 int32_t hx,ix; in __ieee754_j1f() local 52 ix = hx&0x7fffffff; in __ieee754_j1f() 53 if(ix>=0x7f800000) return one/x; in __ieee754_j1f() 55 if(ix >= 0x40000000) { /* |x| >= 2.0 */ in __ieee754_j1f() 60 if(ix<0x7f000000) { /* make sure y+y not overflow */ in __ieee754_j1f() 70 if(ix>0x80000000) z = (invsqrtpi*cc)/sqrtf(y); in __ieee754_j1f() 80 if(ix<0x32000000) { /* |x|<2**-27 */ in __ieee754_j1f() 109 int32_t hx,ix; in __ieee754_y1f() local 112 ix = 0x7fffffff&hx; in __ieee754_y1f() 114 if(ix>=0x7f800000) return one/(x+x*x); in __ieee754_y1f() [all …]
|
| D | s_sinpif.c | 57 uint32_t hx, ix, j0; in sinpif() local 60 ix = hx & 0x7fffffff; in sinpif() 61 SET_FLOAT_WORD(ax, ix); in sinpif() 63 if (ix < 0x3f800000) { /* |x| < 1 */ in sinpif() 64 if (ix < 0x3e800000) { /* |x| < 0.25 */ in sinpif() 65 if (ix < 0x38800000) { /* |x| < 0x1p-14 */ in sinpif() 80 if (ix < 0x3f000000) /* |x| < 0.5 */ in sinpif() 82 else if (ix < 0x3f400000) /* |x| < 0.75 */ in sinpif() 89 if (ix < 0x4b000000) { /* 1 <= |x| < 0x1p23 */ in sinpif() 90 FFLOORF(x, j0, ix); /* Integer part of ax. */ in sinpif() [all …]
|
| D | s_sinpi.c | 87 uint32_t hx, ix, j0, lx; in sinpi() local 90 ix = hx & 0x7fffffff; in sinpi() 91 INSERT_WORDS(ax, ix, lx); in sinpi() 93 if (ix < 0x3ff00000) { /* |x| < 1 */ in sinpi() 94 if (ix < 0x3fd00000) { /* |x| < 0.25 */ in sinpi() 95 if (ix < 0x3e200000) { /* |x| < 0x1p-29 */ in sinpi() 115 if (ix < 0x3fe00000) /* |x| < 0.5 */ in sinpi() 117 else if (ix < 0x3fe80000) /* |x| < 0.75 */ in sinpi() 124 if (ix < 0x43300000) { /* 1 <= |x| < 0x1p52 */ in sinpi() 125 FFLOOR(x, j0, ix, lx); /* Integer part of ax. */ in sinpi() [all …]
|
| D | e_log2f.c | 41 int32_t k,ix,i,j; in __ieee754_log2f() local 43 GET_FLOAT_WORD(ix,x); in __ieee754_log2f() 46 if (ix < 0x00800000) { /* x < 2**-126 */ in __ieee754_log2f() 47 if ((ix&0x7fffffff)==0) in __ieee754_log2f() 49 if (ix<0) return (x-x)/zero; /* log(-#) = NaN */ in __ieee754_log2f() 51 GET_FLOAT_WORD(ix,x); in __ieee754_log2f() 53 if (ix >= 0x7f800000) return x+x; in __ieee754_log2f() 54 k += (ix>>23)-127; in __ieee754_log2f() 55 ix &= 0x007fffff; in __ieee754_log2f() 56 i = (ix+(0x95f64<<3))&0x800000; in __ieee754_log2f() [all …]
|
| D | e_logf.c | 42 int32_t k,ix,i,j; in __ieee754_logf() local 44 GET_FLOAT_WORD(ix,x); in __ieee754_logf() 47 if (ix < 0x00800000) { /* x < 2**-126 */ in __ieee754_logf() 48 if ((ix&0x7fffffff)==0) in __ieee754_logf() 50 if (ix<0) return (x-x)/zero; /* log(-#) = NaN */ in __ieee754_logf() 52 GET_FLOAT_WORD(ix,x); in __ieee754_logf() 54 if (ix >= 0x7f800000) return x+x; in __ieee754_logf() 55 k += (ix>>23)-127; in __ieee754_logf() 56 ix &= 0x007fffff; in __ieee754_logf() 57 i = (ix+(0x95f64<<3))&0x800000; in __ieee754_logf() [all …]
|
| D | e_lgamma_r.c | 162 int n,ix; in sin_pi() local 164 GET_HIGH_WORD(ix,x); in sin_pi() 165 ix &= 0x7fffffff; in sin_pi() 167 if(ix<0x3fd00000) return __kernel_sin(pi*x,zero,0); in sin_pi() 180 if(ix>=0x43400000) { in sin_pi() 183 if(ix<0x43300000) z = y+two52; /* exact */ in sin_pi() 208 int i,hx,lx,ix; in __ieee754_lgamma_r() local 215 ix = hx&0x7fffffff; in __ieee754_lgamma_r() 216 if(ix>=0x7ff00000) return x*x; in __ieee754_lgamma_r() 217 if((ix|lx)==0) return one/zero; in __ieee754_lgamma_r() [all …]
|
| D | e_lgammaf_r.c | 98 int n,ix; in sin_pif() local 100 GET_FLOAT_WORD(ix,x); in sin_pif() 101 ix &= 0x7fffffff; in sin_pif() 103 if(ix<0x3e800000) return __kernel_sinf(pi*x,zero,0); in sin_pif() 116 if(ix>=0x4b800000) { in sin_pif() 119 if(ix<0x4b000000) z = y+two23; /* exact */ in sin_pif() 144 int i,hx,ix; in __ieee754_lgammaf_r() local 151 ix = hx&0x7fffffff; in __ieee754_lgammaf_r() 152 if(ix>=0x7f800000) return x*x; in __ieee754_lgammaf_r() 153 if(ix==0) return one/zero; in __ieee754_lgammaf_r() [all …]
|
| D | s_erff.c | 102 int32_t hx,ix,i; in erff() local 105 ix = hx&0x7fffffff; in erff() 106 if(ix>=0x7f800000) { /* erf(nan)=nan */ in erff() 111 if(ix < 0x3f580000) { /* |x|<0.84375 */ in erff() 112 if(ix < 0x31800000) { /* |x|<2**-28 */ in erff() 113 if (ix < 0x04000000) in erff() 124 if(ix < 0x3fa00000) { /* 0.84375 <= |x| < 1.25 */ in erff() 130 if (ix >= 0x40c00000) { /* inf>|x|>=6 */ in erff() 135 if(ix< 0x4036DB6E) { /* |x| < 1/0.35 */ in erff() 146 GET_FLOAT_WORD(ix,x); in erff() [all …]
|
| D | s_tanpi.c | 118 uint32_t hx, ix, j0, lx; in tanpi() local 121 ix = hx & 0x7fffffff; in tanpi() 122 INSERT_WORDS(ax, ix, lx); in tanpi() 124 if (ix < 0x3ff00000) { /* |x| < 1 */ in tanpi() 125 if (ix < 0x3fe00000) { /* |x| < 0.5 */ in tanpi() 126 if (ix < 0x3e200000) { /* |x| < 0x1p-29 */ in tanpi() 149 if (ix < 0x43300000) { /* 1 <= |x| < 0x1p52 */ in tanpi() 150 FFLOOR(x, j0, ix, lx); /* Integer part of ax. */ in tanpi() 153 EXTRACT_WORDS(ix, lx, ax); in tanpi() 155 if (ix < 0x3fe00000) /* |x| < 0.5 */ in tanpi() [all …]
|
| /netbsd/src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/ |
| D | bn_fast_mp_montgomery_reduce.c | 30 int ix, res, olduse; in fast_mp_montgomery_reduce() local 57 for (ix = 0; ix < x->used; ix++) { in fast_mp_montgomery_reduce() 62 for (; ix < n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce() 70 for (ix = 0; ix < n->used; ix++) { in fast_mp_montgomery_reduce() 78 mu = (mp_digit) (((W[ix] & MP_MASK) * rho) & MP_MASK); in fast_mp_montgomery_reduce() 103 _W = W + ix; in fast_mp_montgomery_reduce() 112 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT); in fast_mp_montgomery_reduce() 126 _W1 = W + ix; in fast_mp_montgomery_reduce() 129 _W = W + ++ix; in fast_mp_montgomery_reduce() 131 for (; ix <= n->used * 2 + 1; ix++) { in fast_mp_montgomery_reduce() [all …]
|
| D | bn_fast_s_mp_sqr.c | 32 int olduse, res, pa, ix, iz; in fast_s_mp_sqr() local 46 for (ix = 0; ix < pa; ix++) { in fast_s_mp_sqr() 55 ty = MIN(a->used-1, ix); in fast_s_mp_sqr() 56 tx = ix - ty; in fast_s_mp_sqr() 82 if ((ix&1) == 0) { in fast_s_mp_sqr() 83 _W += ((mp_word)a->dp[ix>>1])*((mp_word)a->dp[ix>>1]); in fast_s_mp_sqr() 87 W[ix] = (mp_digit)(_W & MP_MASK); in fast_s_mp_sqr() 100 for (ix = 0; ix < pa; ix++) { in fast_s_mp_sqr() 101 *tmpb++ = W[ix] & MP_MASK; in fast_s_mp_sqr() 105 for (; ix < olduse; ix++) { in fast_s_mp_sqr()
|
| D | bn_fast_s_mp_mul_digs.c | 38 int olduse, res, pa, ix, iz; in fast_s_mp_mul_digs() local 54 for (ix = 0; ix < pa; ix++) { in fast_s_mp_mul_digs() 60 ty = MIN(b->used-1, ix); in fast_s_mp_mul_digs() 61 tx = ix - ty; in fast_s_mp_mul_digs() 79 W[ix] = ((mp_digit)_W) & MP_MASK; in fast_s_mp_mul_digs() 92 for (ix = 0; ix < pa+1; ix++) { in fast_s_mp_mul_digs() 94 *tmpc++ = W[ix]; in fast_s_mp_mul_digs() 98 for (; ix < olduse; ix++) { in fast_s_mp_mul_digs()
|
| D | bn_fast_s_mp_mul_high_digs.c | 31 int olduse, res, pa, ix, iz; in fast_s_mp_mul_high_digs() local 46 for (ix = digs; ix < pa; ix++) { in fast_s_mp_mul_high_digs() 51 ty = MIN(b->used-1, ix); in fast_s_mp_mul_high_digs() 52 tx = ix - ty; in fast_s_mp_mul_high_digs() 69 W[ix] = ((mp_digit)_W) & MP_MASK; in fast_s_mp_mul_high_digs() 83 for (ix = digs; ix < pa; ix++) { in fast_s_mp_mul_high_digs() 85 *tmpc++ = W[ix]; in fast_s_mp_mul_high_digs() 89 for (; ix < olduse; ix++) { in fast_s_mp_mul_high_digs()
|
| /netbsd/src/external/gpl3/gdb/dist/opcodes/ |
| D | s390-mkopc.c | 93 int ix, k; in insertOpcode() local 103 for (ix = 0; ix < 16; ix++) in insertOpcode() 117 sort_value <<= 4*(16 - ix); in insertOpcode() 119 no_nibbles = ix; in insertOpcode() 120 for (ix = 0; ix < no_ops; ix++) in insertOpcode() 121 if (sort_value > op_array[ix].sort_value) in insertOpcode() 123 for (k = no_ops; k > ix; k--) in insertOpcode() 125 strncpy (op_array[ix].opcode, opcode, MAX_OPCODE_LEN); in insertOpcode() 126 op_array[ix].opcode[MAX_OPCODE_LEN] = '\0'; in insertOpcode() 127 strncpy (op_array[ix].mnemonic, mnemonic, MAX_MNEMONIC_LEN); in insertOpcode() [all …]
|
| /netbsd/src/external/gpl3/binutils/dist/opcodes/ |
| D | s390-mkopc.c | 93 int ix, k; in insertOpcode() local 103 for (ix = 0; ix < 16; ix++) in insertOpcode() 117 sort_value <<= 4*(16 - ix); in insertOpcode() 119 no_nibbles = ix; in insertOpcode() 120 for (ix = 0; ix < no_ops; ix++) in insertOpcode() 121 if (sort_value > op_array[ix].sort_value) in insertOpcode() 123 for (k = no_ops; k > ix; k--) in insertOpcode() 125 strncpy (op_array[ix].opcode, opcode, MAX_OPCODE_LEN); in insertOpcode() 126 op_array[ix].opcode[MAX_OPCODE_LEN] = '\0'; in insertOpcode() 127 strncpy (op_array[ix].mnemonic, mnemonic, MAX_MNEMONIC_LEN); in insertOpcode() [all …]
|
| /netbsd/src/external/gpl3/gcc/dist/gcc/ |
| D | bitmap.cc | 649 unsigned ix; in bitmap_tree_listify_from() local 650 FOR_EACH_VEC_ELT (sorted_elements, ix, n) in bitmap_tree_listify_from() 1117 for (unsigned ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) in bitmap_count_bits_in_word() local 1122 count += __builtin_popcountl (bits[ix]); in bitmap_count_bits_in_word() 1124 count += bitmap_popcount (bits[ix]); in bitmap_count_bits_in_word() 1171 for (unsigned ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) in bitmap_count_unique_bits() local 1172 bits[ix] = elt_a->bits[ix] | elt_b->bits[ix]; in bitmap_count_unique_bits() 1189 unsigned ix; in bitmap_single_bit_set_p() local 1202 for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++) in bitmap_single_bit_set_p() 1207 count += __builtin_popcountl (elt->bits[ix]); in bitmap_single_bit_set_p() [all …]
|
| D | tree-streamer.cc | 107 unsigned ix, tree t, hashval_t hash) in streamer_tree_cache_add_to_node_array() argument 112 if (cache->nodes.length () == ix) in streamer_tree_cache_add_to_node_array() 115 cache->nodes[ix] = t; in streamer_tree_cache_add_to_node_array() 119 if (cache->hashes.length () == ix) in streamer_tree_cache_add_to_node_array() 122 cache->hashes[ix] = hash; in streamer_tree_cache_add_to_node_array() 146 unsigned int &ix = cache->node_map->get_or_insert (t, &existed_p); in streamer_tree_cache_insert_1() local 151 ix = cache->next_idx++; in streamer_tree_cache_insert_1() 153 ix = *ix_p; in streamer_tree_cache_insert_1() 155 streamer_tree_cache_add_to_node_array (cache, ix, t, hash); in streamer_tree_cache_insert_1() 159 if (!insert_at_next_slot_p && ix != *ix_p) in streamer_tree_cache_insert_1() [all …]
|
| /netbsd/src/games/trek/ |
| D | visual.c | 73 int ix, iy; in visual() local 82 ix = Ship.sectx + v->x; in visual() 84 if (ix < 0 || ix >= NSECTS || iy < 0 || iy >= NSECTS) in visual() 87 co = Sect[ix][iy]; in visual() 88 printf("%d,%d %c ", ix, iy, co); in visual() 90 ix = Ship.sectx + v->x; in visual() 92 if (ix < 0 || ix >= NSECTS || iy < 0 || iy >= NSECTS) in visual() 95 co = Sect[ix][iy]; in visual() 98 ix = Ship.sectx + v->x; in visual() 100 if (ix < 0 || ix >= NSECTS || iy < 0 || iy >= NSECTS) in visual() [all …]
|