Searched refs:n_len (Results 1 – 16 of 16) sorted by relevance
/PHP-7.3/ext/bcmath/libbcmath/src/ |
H A D | doaddsub.c | 59 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 D | recmul.c | 63 temp->n_len = length; 112 count = val->n_len; in _bc_shift_addsub() 115 assert (accum->n_len+accum->n_scale >= shift+count); in _bc_shift_addsub() 119 accum->n_len + accum->n_scale - shift - 1); in _bc_shift_addsub() 219 d1len = d1->n_len; in _bc_rec_mul() 221 d2len = d2->n_len; in _bc_rec_mul() 228 _bc_rec_mul (u1, u1->n_len, v1, v1->n_len, &m1, 0); in _bc_rec_mul() 238 _bc_rec_mul (u0, u0->n_len, v0, v0->n_len, &m3, 0); in _bc_rec_mul() 276 len1 = n1->n_len + n1->n_scale; in bc_multiply() 277 len2 = n2->n_len + n2->n_scale; in bc_multiply() [all …]
|
H A D | compare.c | 65 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 D | div.c | 106 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() 131 memset (num1, 0, n1->n_len+n1->n_scale+extra+2); in bc_divide() 132 memcpy (num1+1, n1->n_value, n1->n_len+n1->n_scale); in bc_divide() 134 len2 = n2->n_len + scale2; in bc_divide()
|
H A D | rmzero.c | 50 while (*num->n_value == 0 && num->n_len > 1) { 52 num->n_len--;
|
H A D | num2str.c | 56 str = zend_string_alloc(num->n_len + scale + signch + 1, 0); 58 str = zend_string_alloc(num->n_len + signch, 0); 67 for (index=num->n_len; index>0; index--)
|
H A D | output.c | 111 if (num->n_len > 1 || *nptr != 0) in bc_out_num() 112 for (index=num->n_len; index>0; index--) in bc_out_num() 173 bc_out_long (temp->digit, max_o_digit->n_len, 1, out_char); in bc_out_num() 184 while (t_num->n_len <= num->n_scale) { in bc_out_num() 192 bc_out_long (fdigit, max_o_digit->n_len, pre_space, out_char); in bc_out_num()
|
H A D | raisemod.c | 51 temp = bc_new_num ((*num)->n_len, 0); in _bc_truncate() 53 memcpy (temp->n_value, (*num)->n_value, (*num)->n_len); in _bc_truncate()
|
H A D | zero.c | 53 count = num->n_len + num->n_scale; in bc_is_zero()
|
H A D | nearzero.c | 58 count = num->n_len + scale;
|
H A D | num2long.c | 57 for (index = num->n_len; index > 0; index--) {
|
H A D | init.c | 55 temp->n_len = length;
|
H A D | raise.c | 60 if (exponent == 0 && (num2->n_len > 1 || num2->n_value[0] != 0)) in bc_raise()
|
H A D | sqrt.c | 93 bc_int2num (&guess1,(*num)->n_len); in bc_sqrt()
|
H A D | bcmath.h | 42 int n_len; /* The number of digits before the decimal point. */ member
|
/PHP-7.3/ext/sodium/ |
H A D | libsodium.c | 2813 size_t n_len; in PHP_FUNCTION() local 2817 &n, &n_len, &p, &p_len) == FAILURE) { in PHP_FUNCTION() 2821 if (n_len != crypto_scalarmult_SCALARBYTES || in PHP_FUNCTION()
|
Completed in 36 milliseconds