Home
last modified time | relevance | path

Searched refs:n_len (Results 1 – 14 of 14) sorted by relevance

/PHP-5.6/ext/bcmath/libbcmath/src/
H A Ddoaddsub.c59 sum_digits = MAX (n1->n_len, n2->n_len) + 1;
73 n1ptr = (char *) (n1->n_value + n1->n_len + n1bytes - 1);
74 n2ptr = (char *) (n2->n_value + n2->n_len + n2bytes - 1);
89 n1bytes += n1->n_len;
90 n2bytes += n2->n_len;
150 diff_len = MAX (n1->n_len, n2->n_len);
152 min_len = MIN (n1->n_len, n2->n_len);
165 n1ptr = (char *) (n1->n_value + n1->n_len + n1->n_scale -1);
166 n2ptr = (char *) (n2->n_value + n2->n_len + n2->n_scale -1);
H A Drecmul.c72 temp->n_len = length;
121 count = val->n_len; in _bc_shift_addsub()
124 assert (accum->n_len+accum->n_scale >= shift+count); in _bc_shift_addsub()
128 accum->n_len + accum->n_scale - shift - 1); in _bc_shift_addsub()
228 d1len = d1->n_len; in _bc_rec_mul()
230 d2len = d2->n_len; in _bc_rec_mul()
237 _bc_rec_mul (u1, u1->n_len, v1, v1->n_len, &m1, 0 TSRMLS_CC); in _bc_rec_mul()
247 _bc_rec_mul (u0, u0->n_len, v0, v0->n_len, &m3, 0 TSRMLS_CC); in _bc_rec_mul()
285 len1 = n1->n_len + n1->n_scale; in bc_multiply()
286 len2 = n2->n_len + n2->n_scale; in bc_multiply()
[all …]
H A Dcompare.c65 if (n1->n_len != n2->n_len)
67 if (n1->n_len > n2->n_len)
87 count = n1->n_len + MIN (n1->n_scale, n2->n_scale);
H A Ddiv.c106 if (n2->n_len == 1 && *n2->n_value == 1) in bc_divide()
108 qval = bc_new_num (n1->n_len, scale); in bc_divide()
110 memset (&qval->n_value[n1->n_len],0,scale); in bc_divide()
112 n1->n_len + MIN(n1->n_scale,scale)); in bc_divide()
121 n2ptr = (unsigned char *) n2->n_value+n2->n_len+scale2-1; in bc_divide()
124 len1 = n1->n_len + scale2; in bc_divide()
130 num1 = (unsigned char *) safe_emalloc (1, n1->n_len+n1->n_scale, extra+2); in bc_divide()
132 memset (num1, 0, n1->n_len+n1->n_scale+extra+2); in bc_divide()
133 memcpy (num1+1, n1->n_value, n1->n_len+n1->n_scale); in bc_divide()
135 len2 = n2->n_len + scale2; in bc_divide()
H A Dnum2str.c54 str = (char *) safe_emalloc (1, num->n_len + num->n_scale, 2 + signch);
56 str = (char *) safe_emalloc (1, num->n_len, 1 + signch);
65 for (index=num->n_len; index>0; index--)
H A Drmzero.c50 while (*num->n_value == 0 && num->n_len > 1) {
52 num->n_len--;
H A Doutput.c111 if (num->n_len > 1 || *nptr != 0) in bc_out_num()
112 for (index=num->n_len; index>0; index--) in bc_out_num()
174 bc_out_long (temp->digit, max_o_digit->n_len, 1, out_char); in bc_out_num()
185 while (t_num->n_len <= num->n_scale) { in bc_out_num()
193 bc_out_long (fdigit, max_o_digit->n_len, pre_space, out_char); in bc_out_num()
H A Dzero.c53 count = num->n_len + num->n_scale; in bc_is_zero()
H A Dnearzero.c58 count = num->n_len + scale;
H A Dnum2long.c57 for (index=num->n_len; (index>0) && (val<=(LONG_MAX/BASE)); index--)
H A Draise.c60 if (exponent == 0 && (num2->n_len > 1 || num2->n_value[0] != 0)) in bc_raise()
H A Dinit.c68 temp->n_len = length;
H A Dsqrt.c93 bc_int2num (&guess1,(*num)->n_len); in bc_sqrt()
H A Dbcmath.h42 int n_len; /* The number of digits before the decimal point. */ member

Completed in 24 milliseconds