Searched refs:n_len (Results 1 – 15 of 15) sorted by relevance
/PHP-8.0/ext/bcmath/libbcmath/src/ |
H A D | doaddsub.c | 58 sum_digits = MAX (n1->n_len, n2->n_len) + 1; 72 n1ptr = (char *) (n1->n_value + n1->n_len + n1bytes - 1); 73 n2ptr = (char *) (n2->n_value + n2->n_len + n2bytes - 1); 88 n1bytes += n1->n_len; 89 n2bytes += n2->n_len; 149 diff_len = MAX (n1->n_len, n2->n_len); 151 min_len = MIN (n1->n_len, n2->n_len); 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);
|
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 | 64 if (n1->n_len != n2->n_len) 66 if (n1->n_len > n2->n_len) 86 count = n1->n_len + MIN (n1->n_scale, n2->n_scale);
|
H A D | div.c | 105 if (n2->n_len == 1 && *n2->n_value == 1) in bc_divide() 107 qval = bc_new_num (n1->n_len, scale); in bc_divide() 109 memset (&qval->n_value[n1->n_len],0,scale); in bc_divide() 111 n1->n_len + MIN(n1->n_scale,scale)); in bc_divide() 120 n2ptr = (unsigned char *) n2->n_value+n2->n_len+scale2-1; in bc_divide() 123 len1 = n1->n_len + scale2; in bc_divide() 129 num1 = (unsigned char *) safe_emalloc (1, n1->n_len+n1->n_scale, extra+2); in bc_divide() 130 memset (num1, 0, n1->n_len+n1->n_scale+extra+2); in bc_divide() 131 memcpy (num1+1, n1->n_value, n1->n_len+n1->n_scale); in bc_divide() 133 len2 = n2->n_len + scale2; in bc_divide()
|
H A D | rmzero.c | 49 while (*num->n_value == 0 && num->n_len > 1) { 51 num->n_len--;
|
H A D | num2str.c | 55 str = zend_string_alloc(num->n_len + scale + signch + 1, 0); 57 str = zend_string_alloc(num->n_len + signch, 0); 65 for (index=num->n_len; index>0; index--)
|
H A D | output.c | 110 if (num->n_len > 1 || *nptr != 0) in bc_out_num() 111 for (index=num->n_len; index>0; index--) in bc_out_num() 172 bc_out_long (temp->digit, max_o_digit->n_len, 1, out_char); in bc_out_num() 183 while (t_num->n_len <= num->n_scale) { in bc_out_num() 191 bc_out_long (fdigit, max_o_digit->n_len, pre_space, out_char); in bc_out_num()
|
H A D | nearzero.c | 57 count = num->n_len + scale;
|
H A D | zero.c | 52 count = num->n_len + scale; in bc_is_zero_for_scale()
|
H A D | num2long.c | 56 for (index = num->n_len; index > 0; index--) {
|
H A D | init.c | 50 temp->n_len = length;
|
H A D | raise.c | 62 if (exponent == 0 && (num2->n_len > 1 || num2->n_value[0] != 0)) { in bc_raise()
|
H A D | sqrt.c | 92 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-8.0/ext/sodium/ |
H A D | libsodium.c | 2422 size_t n_len; in PHP_FUNCTION() local 2426 &n, &n_len, &p, &p_len) == FAILURE) { in PHP_FUNCTION() 2430 if (n_len != crypto_scalarmult_SCALARBYTES) { in PHP_FUNCTION()
|
Completed in 36 milliseconds