Home
last modified time | relevance | path

Searched refs:n_scale (Results 1 – 16 of 16) sorted by relevance

/PHP-8.2/ext/bcmath/libbcmath/src/
H A Dcompare.c86 count = n1->n_len + MIN (n1->n_scale, n2->n_scale);
96 if (ignore_last && count == 1 && n1->n_scale == n2->n_scale)
119 if (n1->n_scale != n2->n_scale)
121 if (n1->n_scale > n2->n_scale)
123 for (count = n1->n_scale-n2->n_scale; count>0; count--)
135 for (count = n2->n_scale-n1->n_scale; count>0; count--)
H A Ddoaddsub.c57 sum_scale = MAX (n1->n_scale, n2->n_scale);
70 n1bytes = n1->n_scale;
71 n2bytes = n2->n_scale;
150 diff_scale = MAX (n1->n_scale, n2->n_scale);
152 min_scale = MIN (n1->n_scale, n2->n_scale);
164 n1ptr = (char *) (n1->n_value + n1->n_len + n1->n_scale -1);
165 n2ptr = (char *) (n2->n_value + n2->n_len + n2->n_scale -1);
172 if (n1->n_scale != min_scale)
175 for (count = n1->n_scale - min_scale; count > 0; count--)
181 for (count = n2->n_scale - min_scale; count > 0; count--)
H A Draise.c56 if (num2->n_scale != 0) { in bc_raise()
86 rscale = MIN (num1->n_scale*exponent, MAX(scale, num1->n_scale)); in bc_raise()
91 pwrscale = num1->n_scale; in bc_raise()
124 if ((*result)->n_scale > rscale) in bc_raise()
125 (*result)->n_scale = rscale; in bc_raise()
H A Draisemod.c48 if (base->n_scale != 0) { in bc_raisemod()
54 if (expo->n_scale != 0) { in bc_raisemod()
64 if (mod->n_scale != 0) { in bc_raisemod()
83 rscale = MAX(scale, power->n_scale); in bc_raisemod()
H A Drecmul.c61 temp->n_scale = scale; in new_sub_num()
112 assert (accum->n_len+accum->n_scale >= shift+count); in _bc_shift_addsub()
116 accum->n_len + accum->n_scale - shift - 1); in _bc_shift_addsub()
273 len1 = n1->n_len + n1->n_scale; in bc_multiply()
274 len2 = n2->n_len + n2->n_scale; in bc_multiply()
275 full_scale = n1->n_scale + n2->n_scale; in bc_multiply()
276 prod_scale = MIN(full_scale,MAX(scale,MAX(n1->n_scale,n2->n_scale))); in bc_multiply()
285 pval->n_scale = prod_scale; in bc_multiply()
H A Dnum2str.c53 …signch = num->n_sign != PLUS && !bc_is_zero_for_scale(num, MIN(num->n_scale, scale)); /* Number o…
72 for (index=0; index<scale && index<num->n_scale; index++)
74 for (index = num->n_scale; index<scale; index++)
H A Dnearzero.c53 if (scale > num->n_scale)
54 scale = num->n_scale;
H A Doutput.c108 if (num->n_scale > 0) in bc_out_num()
111 for (index=0; index<num->n_scale; index++) in bc_out_num()
166 if (num->n_scale > 0) in bc_out_num()
171 while (t_num->n_len <= num->n_scale) { in bc_out_num()
172 bc_multiply (frac_part, base, &frac_part, num->n_scale); in bc_out_num()
H A Ddiv.c99 if (n2->n_scale == 0) in bc_divide()
107 n1->n_len + MIN(n1->n_scale,scale)); in bc_divide()
115 scale2 = n2->n_scale; in bc_divide()
120 scale1 = n1->n_scale - scale2; in bc_divide()
125 num1 = (unsigned char *) safe_emalloc (1, n1->n_len+n1->n_scale, extra+2); in bc_divide()
126 memset (num1, 0, n1->n_len+n1->n_scale+extra+2); in bc_divide()
127 memcpy (num1+1, n1->n_value, n1->n_len+n1->n_scale); in bc_divide()
H A Dsqrt.c72 rscale = MAX (scale, (*num)->n_scale); in bc_sqrt()
84 cscale = (*num)->n_scale; in bc_sqrt()
94 guess1->n_scale = 0; in bc_sqrt()
H A Ddivmod.c57 rscale = MAX (num1->n_scale, num2->n_scale+scale); in bc_divmod()
H A Dadd.c72 res_scale = MAX (scale_min, MAX(n1->n_scale, n2->n_scale));
H A Dsub.c73 res_scale = MAX (scale_min, MAX(n1->n_scale, n2->n_scale));
H A Dzero.c67 return bc_is_zero_for_scale(num, num->n_scale); in bc_is_zero()
H A Dbcmath.h43 int n_scale; /* The number of digits after the decimal point. */ member
142 #define bc_num2str(num) bc_num2str_ex((num), (num->n_scale))
H A Dinit.c51 temp->n_scale = scale;

Completed in 24 milliseconds