Lines Matching refs:n_scale
77 temp->n_scale = scale; in bc_new_num()
191 count = n1->n_len + MIN (n1->n_scale, n2->n_scale); in _bc_do_compare()
201 if (ignore_last && count == 1 && n1->n_scale == n2->n_scale) in _bc_do_compare()
224 if (n1->n_scale != n2->n_scale) in _bc_do_compare()
226 if (n1->n_scale > n2->n_scale) in _bc_do_compare()
228 for (count = n1->n_scale-n2->n_scale; count>0; count--) in _bc_do_compare()
240 for (count = n2->n_scale-n1->n_scale; count>0; count--) in _bc_do_compare()
285 count = num->n_len + num->n_scale; in bc_is_zero()
308 if (scale > num->n_scale) in bc_is_near_zero()
309 scale = num->n_scale; in bc_is_near_zero()
339 sum_scale = MAX (n1->n_scale, n2->n_scale); in _bc_do_add()
352 n1bytes = n1->n_scale; in _bc_do_add()
353 n2bytes = n2->n_scale; in _bc_do_add()
430 diff_scale = MAX (n1->n_scale, n2->n_scale); in _bc_do_sub()
432 min_scale = MIN (n1->n_scale, n2->n_scale); in _bc_do_sub()
444 n1ptr = (char *) (n1->n_value + n1->n_len + n1->n_scale -1); in _bc_do_sub()
445 n2ptr = (char *) (n2->n_value + n2->n_len + n2->n_scale -1); in _bc_do_sub()
452 if (n1->n_scale != min_scale) in _bc_do_sub()
455 for (count = n1->n_scale - min_scale; count > 0; count--) in _bc_do_sub()
461 for (count = n2->n_scale - min_scale; count > 0; count--) in _bc_do_sub()
543 res_scale = MAX (scale_min, MAX(n1->n_scale, n2->n_scale)); in bc_sub()
590 res_scale = MAX (scale_min, MAX(n1->n_scale, n2->n_scale)); in bc_add()
632 temp->n_scale = scale; in new_sub_num()
682 assert (accum->n_len+accum->n_scale >= shift+count); in _bc_shift_addsub()
686 accum->n_len + accum->n_scale - shift - 1); in _bc_shift_addsub()
842 len1 = n1->n_len + n1->n_scale; in bc_multiply()
843 len2 = n2->n_len + n2->n_scale; in bc_multiply()
844 full_scale = n1->n_scale + n2->n_scale; in bc_multiply()
845 prod_scale = MIN(full_scale,MAX(scale,MAX(n1->n_scale,n2->n_scale))); in bc_multiply()
854 pval->n_scale = prod_scale; in bc_multiply()
921 if (n2->n_scale == 0) in bc_divide()
929 n1->n_len + MIN(n1->n_scale,scale)); in bc_divide()
937 scale2 = n2->n_scale; in bc_divide()
942 scale1 = n1->n_scale - scale2; in bc_divide()
947 num1 = (unsigned char *) malloc (n1->n_len+n1->n_scale+extra+2); in bc_divide()
949 memset (num1, 0, n1->n_len+n1->n_scale+extra+2); in bc_divide()
950 memcpy (num1+1, n1->n_value, n1->n_len+n1->n_scale); in bc_divide()
1109 rscale = MAX (num1->n_scale, num2->n_scale+scale); in bc_divmod()
1160 if (base->n_scale != 0) in bc_raisemod()
1164 if (exponent->n_scale != 0) in bc_raisemod()
1171 if (mod->n_scale != 0) in bc_raisemod()
1175 rscale = MAX(scale, base->n_scale); in bc_raisemod()
1213 if (num2->n_scale != 0) in bc_raise()
1238 rscale = MIN (num1->n_scale*uexponent, in bc_raise()
1239 (unsigned long) MAX(scale, num1->n_scale)); in bc_raise()
1244 pwrscale = num1->n_scale; in bc_raise()
1277 if ((*result)->n_scale > rscale) in bc_raise()
1278 (*result)->n_scale = rscale; in bc_raise()
1315 rscale = MAX (scale, (*num)->n_scale); in bc_sqrt()
1328 cscale = (*num)->n_scale; in bc_sqrt()
1337 guess1->n_scale = 0; in bc_sqrt()
1441 if (num->n_scale > 0) in bc_out_num()
1444 for (ix=0; ix<num->n_scale; ix++) in bc_out_num()
1499 if (num->n_scale > 0) in bc_out_num()
1504 while (t_num->n_len <= num->n_scale) { in bc_out_num()
1505 bc_multiply (frac_part, base, &frac_part, num->n_scale); in bc_out_num()
1610 if (num->n_scale > 0) in bc_num2str()
1611 str = (char *) malloc (num->n_len + num->n_scale + 2 + signch); in bc_num2str()
1626 if (num->n_scale > 0) in bc_num2str()
1629 for (i=0; i<num->n_scale; i++) in bc_num2str()