diff options
Diffstat (limited to 'mpn/generic')
| -rw-r--r-- | mpn/generic/gcd_subdiv_step.c | 2 | ||||
| -rw-r--r-- | mpn/generic/hgcd_appr.c | 6 | ||||
| -rw-r--r-- | mpn/generic/hgcd_jacobi.c | 4 | ||||
| -rw-r--r-- | mpn/generic/hgcd_reduce.c | 14 | ||||
| -rw-r--r-- | mpn/generic/hgcd_step.c | 2 |
5 files changed, 14 insertions, 14 deletions
diff --git a/mpn/generic/gcd_subdiv_step.c b/mpn/generic/gcd_subdiv_step.c index 11c00bb6a..3db34073c 100644 --- a/mpn/generic/gcd_subdiv_step.c +++ b/mpn/generic/gcd_subdiv_step.c @@ -185,7 +185,7 @@ mpn_gcd_subdiv_step (mp_ptr ap, mp_ptr bp, mp_size_t n, mp_size_t s, } else MPN_COPY (bp, ap, an); - + MPN_DECR_U (tp, qn, 1); } diff --git a/mpn/generic/hgcd_appr.c b/mpn/generic/hgcd_appr.c index 8454f9da5..f7c7eb2c9 100644 --- a/mpn/generic/hgcd_appr.c +++ b/mpn/generic/hgcd_appr.c @@ -72,7 +72,7 @@ mpn_hgcd_appr (mp_ptr ap, mp_ptr bp, mp_size_t n, we discard some of the least significant limbs, we must keep one additional bit to account for the truncation error. We maintain the GMP_NUMB_BITS * s - extra_bits as the current target size. */ - + s = n/2 + 1; if (BELOW_THRESHOLD (n, HGCD_APPR_THRESHOLD)) { @@ -155,7 +155,7 @@ mpn_hgcd_appr (mp_ptr ap, mp_ptr bp, mp_size_t n, ASSERT (n <= 2*s); nn = mpn_hgcd_step (n, ap, bp, s, M, tp); - + if (!nn) return 1; @@ -249,7 +249,7 @@ mpn_hgcd_appr (mp_ptr ap, mp_ptr bp, mp_size_t n, ASSERT (n <= 2*s); nn = mpn_hgcd_step (n, ap, bp, s, M, tp); - + if (!nn) return success; diff --git a/mpn/generic/hgcd_jacobi.c b/mpn/generic/hgcd_jacobi.c index 2dce43b99..0d4cb021c 100644 --- a/mpn/generic/hgcd_jacobi.c +++ b/mpn/generic/hgcd_jacobi.c @@ -26,7 +26,7 @@ along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. */ #include "longlong.h" /* This file is almost a copy of hgcd.c, with some added calls to - mpn_jacobi_update */ + mpn_jacobi_update */ struct hgcd_jacobi_ctx { @@ -127,7 +127,7 @@ hgcd_jacobi_step (mp_size_t n, mp_ptr ap, mp_ptr bp, mp_size_t s, struct hgcd_jacobi_ctx ctx; ctx.M = M; ctx.bitsp = bitsp; - + return mpn_gcd_subdiv_step (ap, bp, n, s, hgcd_jacobi_hook, &ctx, tp); } } diff --git a/mpn/generic/hgcd_reduce.c b/mpn/generic/hgcd_reduce.c index 142d44a30..89240af4d 100644 --- a/mpn/generic/hgcd_reduce.c +++ b/mpn/generic/hgcd_reduce.c @@ -38,7 +38,7 @@ submul (mp_ptr rp, mp_size_t rn, ASSERT (an >= bn); ASSERT (rn >= an); ASSERT (an + bn <= rn + 1); - + TMP_MARK; tp = TMP_ALLOC_LIMBS (an + bn); @@ -61,7 +61,7 @@ submul (mp_ptr rp, mp_size_t rn, /* FIXME: x Take scratch parameter, and figure out scratch need. - x Use some fallback for small M->n? + x Use some fallback for small M->n? */ static mp_size_t hgcd_matrix_apply (const struct hgcd_matrix *M, @@ -83,7 +83,7 @@ hgcd_matrix_apply (const struct hgcd_matrix *M, MPN_NORMALIZE (ap, an); bn = n; MPN_NORMALIZE (bp, bn); - + for (i = 0; i < 2; i++) for (j = 0; j < 2; j++) { @@ -102,7 +102,7 @@ hgcd_matrix_apply (const struct hgcd_matrix *M, if (mn[0][1] == 0) { mp_size_t qn; - + /* A unchanged, M = (1, 0; q, 1) */ ASSERT (mn[0][0] == 1); ASSERT (M->p[0][0][0] == 1); @@ -121,7 +121,7 @@ hgcd_matrix_apply (const struct hgcd_matrix *M, ASSERT (M->p[1][1][0] == 1); /* Put A <-- A - q * B */ - nn = submul (ap, an, bp, bn, M->p[0][1], mn[0][1]); + nn = submul (ap, an, bp, bn, M->p[0][1], mn[0][1]); } else { @@ -159,7 +159,7 @@ hgcd_matrix_apply (const struct hgcd_matrix *M, MPN_ZERO (tp + n + mn[1][1], modn - n - mn[1][1]); if (n + mn[0][1] < modn) MPN_ZERO (sp + n + mn[0][1], modn - n - mn[0][1]); - + cy = mpn_sub_n (tp, tp, sp, modn); MPN_DECR_U (tp, modn, cy); @@ -209,7 +209,7 @@ mpn_hgcd_reduce_itch (mp_size_t n, mp_size_t p) itch = 2*(n-p) + mpn_hgcd_itch (n-p); /* Currently, hgcd_matrix_apply allocates its own storage. */ } - return itch; + return itch; } /* FIXME: Document storage need. */ diff --git a/mpn/generic/hgcd_step.c b/mpn/generic/hgcd_step.c index 0e56be39e..dbc757935 100644 --- a/mpn/generic/hgcd_step.c +++ b/mpn/generic/hgcd_step.c @@ -112,7 +112,7 @@ mpn_hgcd_step (mp_size_t n, mp_ptr ap, mp_ptr bp, mp_size_t s, /* Multiply M1^{-1} (a;b) */ return mpn_matrix22_mul1_inverse_vector (&M1, ap, tp, bp, n); } - + subtract: return mpn_gcd_subdiv_step (ap, bp, n, s, hgcd_hook, M, tp); |