mpn/generic/fib2m.c

72 /* Store F[n] at fp and F[n-1] at f1p.  Both are computed modulo m.
73    fp and f1p should have room for mn*2+1 limbs.
92 mpn_fib2m (mp_ptr fp, mp_ptr f1p, mp_srcptr np, mp_size_t nn, mp_srcptr mp, mp_size_t mn)
100   ASSERT (! MPN_OVERLAP_P (fp, MAX(2*mn+1,5), f1p, MAX(2*mn+1,5)));
156   fn = mpn_fib2_ui (fp, f1p, nh);
158   MPN_ZERO (f1p + fn, mn - fn);
166 	  mpn_tdiv_qr (qp, f1p, 0, f1p, fn, mp, mn);
185 	  /* Here fp==F[k] and f1p==F[k-1], with k being the bits of n from
189 	     fp==F[2k],f1p==F[2k-1] or fp==F[2k+1],f1p==F[2k], according as
193 	  mpn_sqr (fp, f1p, mn);
196 	  f1p[2 * mn] = mpn_add_n (f1p, tp, fp, 2 * mn);
229 	  rp = pb ? f1p : fp;
233 	      rp[2 * mn] = f1p[2 * mn] + 1 - mpn_sub_n (rp, f1p, fp, 2 * mn);
240 	      neg = abs_sub_n (rp, fp, f1p, 2 * mn + 1) < 0;
244 	  mpn_tdiv_qr (tp, f1p, 0, f1p, 2 * mn + 1, mp, mn);