Lines Matching refs:size_a
1341 Py_ssize_t size, strlen, size_a, i, j;
1351 size_a = ABS(Py_SIZE(a));
1359 But log2(a) < size_a * PyLong_SHIFT, and
1363 if (size_a > PY_SSIZE_T_MAX / PyLong_SHIFT) {
1368 /* the expression size_a * PyLong_SHIFT is now safe from overflow */
1369 size = 1 + size_a * PyLong_SHIFT / (3 * _PyLong_DECIMAL_SHIFT);
1380 for (i = size_a; --i >= 0; ) {
1460 Py_ssize_t size_a;
1473 size_a = ABS(Py_SIZE(a));
1484 if (size_a > (PY_SSIZE_T_MAX - i) / PyLong_SHIFT) {
1489 sz = i + 1 + (size_a * PyLong_SHIFT - 1) / bits;
1513 for (i = 0; i < size_a; ++i) {
1524 } while (i < size_a-1 ? accumbits >= basebits : accum > 0);
1531 Py_ssize_t size = size_a;
1595 if (size_a != 0)
2027 Py_ssize_t size_a = ABS(Py_SIZE(a)), size_b = ABS(Py_SIZE(b));
2035 if (size_a < size_b ||
2036 (size_a == size_b &&
2037 a->ob_digit[size_a-1] < b->ob_digit[size_b-1])) {
2433 Py_ssize_t size_a = ABS(Py_SIZE(a)), size_b = ABS(Py_SIZE(b));
2439 if (size_a < size_b) {
2441 { Py_ssize_t size_temp = size_a;
2442 size_a = size_b;
2445 z = _PyLong_New(size_a+1);
2453 for (; i < size_a; ++i) {
2467 Py_ssize_t size_a = ABS(Py_SIZE(a)), size_b = ABS(Py_SIZE(b));
2474 if (size_a < size_b) {
2477 { Py_ssize_t size_temp = size_a;
2478 size_a = size_b;
2481 else if (size_a == size_b) {
2483 i = size_a;
2492 size_a = size_b = i+1;
2494 z = _PyLong_New(size_a);
2505 for (; i < size_a; ++i) {
2577 Py_ssize_t size_a = ABS(Py_SIZE(a));
2581 z = _PyLong_New(size_a + size_b);
2591 * pyramid appears twice (except for the size_a squares).
2593 for (i = 0; i < size_a; ++i) {
2598 digit *paend = a->ob_digit + size_a;
2631 for (i = 0; i < size_a; ++i) {
3781 Py_ssize_t size_a, size_b, size_z, i;
3790 size_a = ABS(Py_SIZE(a));
3793 z = _PyLong_New(size_a);
3796 v_complement(z->ob_digit, a->ob_digit, size_a);
3818 /* Swap a and b if necessary to ensure size_a >= size_b. */
3819 if (size_a < size_b) {
3821 size_z = size_a; size_a = size_b; size_b = size_z;
3835 size_z = size_a;
3839 size_z = negb ? size_a : size_b;
3843 size_z = negb ? size_b : size_a;