Lines Matching refs:exp

111     if (unlikely(p->exp == 0)) {
121             p->exp = fmt->frac_shift - fmt->exp_bias
124     } else if (likely(p->exp < fmt->exp_max) || fmt->arm_althp) {
126         p->exp -= fmt->exp_bias;
155     int exp, flags = 0;
196     exp = p->exp + fmt->exp_bias;
197     if (likely(exp > 0)) {
203                 exp++;
210             if (unlikely(exp > exp_max)) {
213                 exp = exp_max;
217         } else if (unlikely(exp >= exp_max)) {
220                 exp -= fmt->exp_re_bias;
223                 exp = exp_max - 1;
229                 exp = exp_max;
236         exp += fmt->exp_re_bias;
242                 exp++;
250         exp = 0;
253         bool is_tiny = s->tininess_before_rounding || exp < 0;
260         frac_shrjam(p, !fmt->m68k_denormal - exp);
291         exp = (p->frac_hi & DECOMPOSED_IMPLICIT_BIT) && !fmt->m68k_denormal;
297         if (exp == 0 && frac_eqz(p)) {
301     p->exp = exp;
313             p->exp = 0;
318             p->exp = fmt->exp_max;
324             p->exp = fmt->exp_max;
432         a->exp += b->exp + 1;
435             a->exp -= 1;
543     p_widen.exp = a->exp + b->exp + 1;
547         p_widen.exp -= 1;
554         c_widen.exp = c->exp;
566     a->exp = p_widen.exp;
570         a->exp -= 1;
606         a->exp -= b->exp + frac_div(a, b);
739     exp_odd = a->exp & 1;
881     a->exp >>= 1;
885         a->exp += 1;
911     a->exp += scale;
913     if (a->exp < 0) {
920             if (a->exp == -1) {
929             one = a->exp == -1;
948         a->exp = 0;
957     if (a->exp >= frac_size) {
962     if (N > 64 && a->exp < N - 64) {
967         shift_adj = (N - 1) - (a->exp + 2);
972         frac_lsb = DECOMPOSED_IMPLICIT_BIT >> (a->exp & 63);
1012             a->exp++;
1021             a->exp++;
1091         if (p->exp <= DECOMPOSED_BINARY_POINT) {
1092             r = p->frac_hi >> (DECOMPOSED_BINARY_POINT - p->exp);
1165         } else if (p->exp > DECOMPOSED_BINARY_POINT) {
1169             r = p->frac_hi >> (DECOMPOSED_BINARY_POINT - p->exp);
1221         if (p->exp <= DECOMPOSED_BINARY_POINT) {
1223              * Because we rounded to integral, and exp < 64,
1226             r = p->frac_hi >> (DECOMPOSED_BINARY_POINT - p->exp);
1227             if (p->exp < bitsm1) {
1229             } else if (p->exp == bitsm1) {
1237             int shl = p->exp - DECOMPOSED_BINARY_POINT;
1291     p->exp = DECOMPOSED_BINARY_POINT - shift + scale;
1313         p->exp = DECOMPOSED_BINARY_POINT - shift + scale;
1361     a_exp = a->exp;
1362     b_exp = b->exp;
1433         if (a->exp == b->exp) {
1435         } else if (a->exp < b->exp) {
1495         a->exp += MIN(MAX(n, -0x10000), 0x10000);
1540     a_exp = a->exp;
1612     f.exp = f_exp - frac_normalize(&f);