Lines Matching defs:M1
43 computing M1, and hgcd_matrix_adjust and hgcd_matrix_mul calls that use M1
44 (after this, the storage needed for M1 can be recycled).
46 Let S(r) denote the required storage. For M1 we need 4 * (ceil(n1/2) + 1)
126 struct hgcd_matrix M1;
132 mpn_hgcd_matrix_init(&M1, n - p, tp);
137 nn = mpn_hgcd (ap + p, bp + p, n - p, &M1, tp + scratch);
140 /* We always have max(M) > 2^{-(GMP_NUMB_BITS + 1)} max(M1) */
141 ASSERT (M->n + 2 >= M1.n);
144 then either q or q + 1 is a correct quotient, and M1 will
146 rules out the case that the size of M * M1 is much
147 smaller than the expected M->n + M1->n. */
149 ASSERT (M->n + M1.n < M->alloc);
153 n = mpn_hgcd_matrix_adjust (&M1, p + nn, ap, bp, p, tp + scratch);
155 /* We need a bound for of M->n + M1.n. Let n be the original
158 ceil(n/2) - 1 >= size of product >= M.n + M1.n - 2
162 M.n + M1.n <= ceil(n/2) + 1
164 Then 3*(M.n + M1.n) + 5 <= 3 * ceil(n/2) + 8 is the
166 mpn_hgcd_matrix_mul (M, &M1, tp + scratch);
Indexes created Sat Jun 27 00:24:51 UTC 2026