Home
last modified time | relevance | path

Searched refs:n1 (Results 1 – 25 of 34) sorted by relevance

12

/php-src/ext/bcmath/libbcmath/src/
H A Dcompare.c47 if (use_sign && n1->n_sign != n2->n_sign) { in _bc_do_compare()
53 n1->n_len == 1 && n2->n_len == 1 && in _bc_do_compare()
60 if (n1->n_sign == PLUS) { in _bc_do_compare()
70 if (n1->n_len != n2->n_len) { in _bc_do_compare()
71 if (n1->n_len > n2->n_len) { in _bc_do_compare()
73 if (!use_sign || n1->n_sign == PLUS) { in _bc_do_compare()
80 if (!use_sign || n1->n_sign == PLUS) { in _bc_do_compare()
88 size_t n1_scale = MIN(n1->n_scale, scale); in _bc_do_compare()
94 n1ptr = n1->n_value; in _bc_do_compare()
106 if (!use_sign || n1->n_sign == PLUS) { in _bc_do_compare()
[all …]
H A Dadd.c42 bc_num bc_add(bc_num n1, bc_num n2, size_t scale_min) in bc_add() argument
46 if (n1->n_sign == n2->n_sign) { in bc_add()
47 sum = _bc_do_add(n1, n2); in bc_add()
48 sum->n_sign = n1->n_sign; in bc_add()
52 switch (_bc_do_compare(n1, n2, scale_min, false)) { in bc_add()
55 sum = _bc_do_sub(n2, n1); in bc_add()
60 sum = bc_new_num (1, MAX(scale_min, MAX(n1->n_scale, n2->n_scale))); in bc_add()
64 sum = _bc_do_sub(n1, n2); in bc_add()
65 sum->n_sign = n1->n_sign; in bc_add()
H A Dsub.c42 bc_num bc_sub(bc_num n1, bc_num n2, size_t scale_min) in bc_sub() argument
46 if (n1->n_sign != n2->n_sign) { in bc_sub()
47 diff = _bc_do_add(n1, n2); in bc_sub()
48 diff->n_sign = n1->n_sign; in bc_sub()
52 switch (_bc_do_compare(n1, n2, scale_min, false)) { in bc_sub()
55 diff = _bc_do_sub(n2, n1); in bc_sub()
60 size_t res_scale = MAX (scale_min, MAX(n1->n_scale, n2->n_scale)); in bc_sub()
66 diff = _bc_do_sub(n1, n2); in bc_sub()
67 diff->n_sign = n1->n_sign; in bc_sub()
H A Ddoaddsub.c41 bc_num _bc_do_add(bc_num n1, bc_num n2) in _bc_do_add() argument
46 size_t min_len = MIN (n1->n_len, n2->n_len); in _bc_do_add()
57 n1ptr = (char *) (n1->n_value + n1->n_len + n1->n_scale - 1); in _bc_do_add()
62 if (n1->n_scale != min_scale) { in _bc_do_add()
143 if (n1->n_len != n2->n_len) { in _bc_do_add()
144 if (n2->n_len > n1->n_len) { in _bc_do_add()
172 bc_num _bc_do_sub(bc_num n1, bc_num n2) in _bc_do_sub() argument
176 size_t diff_len = EXPECTED(n1->n_len >= n2->n_len) ? n1->n_len : n2->n_len; in _bc_do_sub()
179 size_t min_len = n1->n_len >= n2->n_len ? n2->n_len : n1->n_len; in _bc_do_sub()
191 n1ptr = (char *) (n1->n_value + n1->n_len + n1->n_scale - 1); in _bc_do_sub()
[all …]
H A Drecmul.c57 const char *n1end = n1->n_value + n1len - 1; in bc_fast_mul()
81 const char *n1end = n1->n_value + n1len - 1; in bc_fast_square()
144 const char *n1end = n1->n_value + n1len - 1; in bc_standard_mul()
198 const char *n1end = n1->n_value + n1len - 1; in bc_standard_square()
248 size_t len1 = n1->n_len + n1->n_scale; in bc_multiply()
255 bc_fast_mul(n1, len1, n2, len2, &prod); in bc_multiply()
271 bc_num bc_square(bc_num n1, size_t scale) in bc_square() argument
275 size_t len1 = n1->n_len + n1->n_scale; in bc_square()
276 size_t full_scale = n1->n_scale + n1->n_scale; in bc_square()
280 bc_fast_square(n1, len1, &prod); in bc_square()
[all …]
H A Dbcmath.h124 bc_num bc_add(bc_num n1, bc_num n2, size_t scale_min);
126 #define bc_add_ex(n1, n2, result, scale_min) do { \ argument
127 bc_num add_ex = bc_add(n1, n2, scale_min); \
132 bc_num bc_sub(bc_num n1, bc_num n2, size_t scale_min);
134 #define bc_sub_ex(n1, n2, result, scale_min) do { \ argument
135 bc_num sub_ex = bc_sub(n1, n2, scale_min); \
140 bc_num bc_multiply(bc_num n1, bc_num n2, size_t scale);
142 #define bc_multiply_ex(n1, n2, result, scale_min) do { \ argument
143 bc_num mul_ex = bc_multiply(n1, n2, scale_min); \
148 bc_num bc_square(bc_num n1, size_t scale);
[all …]
H A Dprivate.h72 bcmath_compare_result _bc_do_compare (bc_num n1, bc_num n2, size_t scale, bool use_sign);
73 bc_num _bc_do_add (bc_num n1, bc_num n2);
74 bc_num _bc_do_sub (bc_num n1, bc_num n2);
H A Draise.c37 void bc_square_ex(bc_num n1, bc_num *result, size_t scale_min) { in bc_square_ex() argument
38 bc_num square_ex = bc_square(n1, scale_min); in bc_square_ex()
/php-src/ext/standard/
H A Dversioning.c125 char *p1, *p2, *n1, *n2; in php_version_compare() local
146 p1 = n1 = ver1; in php_version_compare()
148 while (*p1 && *p2 && n1 && n2) { in php_version_compare()
149 if ((n1 = strchr(p1, '.')) != NULL) { in php_version_compare()
150 *n1 = '\0'; in php_version_compare()
174 if (n1 != NULL) { in php_version_compare()
175 p1 = n1 + 1; in php_version_compare()
182 if (n1 != NULL) { in php_version_compare()
/php-src/ext/ctype/tests/
H A D002.phpt12 $n1 = $n2 = $n3 = 0;
16 if($function($c)) $n1++;
20 print "$function $n1 $n2 $n3\n";
/php-src/ext/gmp/tests/
H A Dgmp_jacobi.phpt17 $n1 = "1231231";
19 var_dump(gmp_strval(gmp_jacobi($n, $n1)));
21 var_dump(gmp_strval(gmp_jacobi(3, $n1)));
H A Dgmp_legendre.phpt17 $n1 = "1231231";
19 var_dump(gmp_strval(gmp_legendre($n, $n1)));
21 var_dump(gmp_strval(gmp_legendre(3, $n1)));
H A Dgmp_invert.phpt31 $n1 = gmp_init("3498273496234234523451");
33 var_dump(gmp_strval(gmp_invert($n, $n1)));
34 var_dump(gmp_strval(gmp_invert($n1, $n)));
H A Dgmp_divexact.phpt37 $n1 = gmp_init("-100000000000000000000000000");
38 $r = gmp_divexact($n1, $n);
H A Dgmp_hamdist.phpt14 $n1 = gmp_init("987654445678");
17 var_dump(gmp_hamdist($n, $n1));
H A Dgmp_cmp.phpt27 $n1 = gmp_init("827278512385463739");
28 var_dump(gmp_cmp($n1,$n) === 0);
H A Dgmp_gcdext.phpt9 $n1 = gmp_init("23434293864345");
21 array($n, $n1),
H A Dgmp_and.phpt22 $n1 = gmp_init("987657878765436543456");
23 var_dump(gmp_strval(gmp_and($n, $n1)));
H A Dgmp_or.phpt22 $n1 = gmp_init("987657878765436543456");
23 var_dump(gmp_strval(gmp_or($n, $n1)));
H A Dgmp_xor.phpt22 $n1 = gmp_init("987657878765436543456");
23 var_dump(gmp_strval(gmp_xor($n, $n1)));
/php-src/ext/pcre/tests/
H A Dbug76909.phpt17 $n1 = preg_match($reg1, $data, $m1);
19 var_dump($n0, $n1, count($m0), count($m1));
/php-src/ext/standard/tests/general_functions/
H A Dget_defined_constants_basic.phpt14 $n1 = count(get_defined_constants());
19 if ($n2 == $n1 + 1 && array_key_exists("USER_CONSTANT", $arr2)) {
/php-src/ext/bcmath/
H A Dbcmath.c1022 bc_num n1, bc_num n2, bc_num *ret, in bcmath_number_add_internal() argument
1028 *ret = bc_add(n1, n2, *scale); in bcmath_number_add_internal()
1034 bc_num n1, bc_num n2, bc_num *ret, in bcmath_number_sub_internal() argument
1040 *ret = bc_sub(n1, n2, *scale); in bcmath_number_sub_internal()
1046 bc_num n1, bc_num n2, bc_num *ret, in bcmath_number_mul_internal() argument
1239 bc_num n1 = NULL; in bcmath_number_do_operation() local
1290 bc_free_num(&n1); in bcmath_number_do_operation()
1308 bc_free_num(&n1); in bcmath_number_do_operation()
1326 bc_num n1 = NULL; in bcmath_number_compare() local
1351 ret = bc_compare(n1, n2, MAX(n1->n_scale, n2->n_scale)); in bcmath_number_compare()
[all …]
/php-src/ext/mbstring/libmbfl/filters/
H A Dmbfilter_utf7imap.c533 unsigned char n1 = decode_base64(*p++); in mb_utf7imap_to_wchar() local
534 if (is_base64_end(n1)) { in mb_utf7imap_to_wchar()
535 out = handle_base64_end(n1, out, &base64, false, &surrogate1); in mb_utf7imap_to_wchar()
538 out = handle_base64_end(n1, out, &base64, true, &surrogate1); in mb_utf7imap_to_wchar()
551 out = handle_utf16_cp((n1 << 10) | (n2 << 4) | ((n3 & 0x3C) >> 2), out, &surrogate1); in mb_utf7imap_to_wchar()
759 unsigned char n1 = decode_base64(*p++); in mb_check_utf7imap() local
760 if (is_base64_end(n1)) { in mb_check_utf7imap()
761 if (!is_base64_end_valid(n1, false, is_surrogate)) { in mb_check_utf7imap()
777 uint16_t cp1 = (n1 << 10) | (n2 << 4) | ((n3 & 0x3C) >> 2); in mb_check_utf7imap()
H A Dmbfilter_utf7.c519 unsigned char n1 = decode_base64(*p++); in mb_utf7_to_wchar() local
520 if (is_base64_end(n1)) { in mb_utf7_to_wchar()
521 out = handle_base64_end(n1, &p, out, &base64, false, &surrogate1); in mb_utf7_to_wchar()
524 out = handle_base64_end(n1, &p, out, &base64, true, &surrogate1); in mb_utf7_to_wchar()
537 out = handle_utf16_cp((n1 << 10) | (n2 << 4) | ((n3 & 0x3C) >> 2), out, &surrogate1); in mb_utf7_to_wchar()
745 unsigned char n1 = decode_base64(*p++); in mb_check_utf7() local
746 if (is_base64_end(n1)) { in mb_check_utf7()
747 if (!is_base64_end_valid(n1, false, is_surrogate)) { in mb_check_utf7()
763 uint16_t cp1 = (n1 << 10) | (n2 << 4) | ((n3 & 0x3C) >> 2); in mb_check_utf7()

Completed in 46 milliseconds

12