Coverage Report

Created: 2024-11-21 06:47

/src/libgmp/mpn/binvert.c
Line
Count
Source (jump to first uncovered line)
1
/* Compute {up,n}^(-1) mod B^n.
2
3
   Contributed to the GNU project by Torbjorn Granlund.
4
5
   THE FUNCTIONS IN THIS FILE ARE INTERNAL WITH MUTABLE INTERFACES.  IT IS ONLY
6
   SAFE TO REACH THEM THROUGH DOCUMENTED INTERFACES.  IN FACT, IT IS ALMOST
7
   GUARANTEED THAT THEY WILL CHANGE OR DISAPPEAR IN A FUTURE GMP RELEASE.
8
9
Copyright (C) 2004-2007, 2009, 2012, 2017, 2021 Free Software Foundation, Inc.
10
11
This file is part of the GNU MP Library.
12
13
The GNU MP Library is free software; you can redistribute it and/or modify
14
it under the terms of either:
15
16
  * the GNU Lesser General Public License as published by the Free
17
    Software Foundation; either version 3 of the License, or (at your
18
    option) any later version.
19
20
or
21
22
  * the GNU General Public License as published by the Free Software
23
    Foundation; either version 2 of the License, or (at your option) any
24
    later version.
25
26
or both in parallel, as here.
27
28
The GNU MP Library is distributed in the hope that it will be useful, but
29
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
30
or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
31
for more details.
32
33
You should have received copies of the GNU General Public License and the
34
GNU Lesser General Public License along with the GNU MP Library.  If not,
35
see https://www.gnu.org/licenses/.  */
36
37
#include "gmp-impl.h"
38
39
40
/*
41
  r[k+1] = r[k] - r[k] * (u*r[k] - 1)
42
  r[k+1] = r[k] + r[k] - r[k]*(u*r[k])
43
*/
44
45
#if TUNE_PROGRAM_BUILD
46
#define NPOWS \
47
 ((sizeof(mp_size_t) > 6 ? 48 : 8*sizeof(mp_size_t)))
48
#else
49
#define NPOWS \
50
 ((sizeof(mp_size_t) > 6 ? 48 : 8*sizeof(mp_size_t)) - LOG2C (BINV_NEWTON_THRESHOLD))
51
#endif
52
53
mp_size_t
54
mpn_binvert_itch (mp_size_t n)
55
2.97k
{
56
2.97k
  mp_size_t itch_local = mpn_mulmod_bnm1_next_size (n);
57
2.97k
  mp_size_t itch_out = mpn_mulmod_bnm1_itch (itch_local, n, (n + 1) >> 1);
58
2.97k
  return itch_local + itch_out;
59
2.97k
}
60
61
void
62
mpn_binvert (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_ptr scratch)
63
4.14k
{
64
4.14k
  mp_ptr xp;
65
4.14k
  mp_size_t rn, newrn;
66
4.14k
  mp_size_t sizes[NPOWS], *sizp;
67
4.14k
  mp_limb_t di;
68
69
  /* Compute the computation precisions from highest to lowest, leaving the
70
     base case size in 'rn'.  */
71
4.14k
  sizp = sizes;
72
4.14k
  for (rn = n; ABOVE_THRESHOLD (rn, BINV_NEWTON_THRESHOLD); rn = (rn + 1) >> 1)
73
0
    *sizp++ = rn;
74
75
4.14k
  xp = scratch;
76
77
  /* Compute a base value of rn limbs.  */
78
4.14k
  MPN_ZERO (xp, rn);
79
4.14k
  xp[0] = 1;
80
4.14k
  binvert_limb (di, up[0]);
81
4.14k
  if (BELOW_THRESHOLD (rn, DC_BDIV_Q_THRESHOLD))
82
4.14k
    mpn_sbpi1_bdiv_q (rp, xp, rn, up, rn, -di);
83
0
  else
84
0
    mpn_dcpi1_bdiv_q (rp, xp, rn, up, rn, -di);
85
86
4.14k
  mpn_neg (rp, rp, rn);
87
88
  /* Use Newton iterations to get the desired precision.  */
89
4.14k
  for (; rn < n; rn = newrn)
90
0
    {
91
0
      mp_size_t m;
92
0
      newrn = *--sizp;
93
94
      /* X <- UR. */
95
0
      m = mpn_mulmod_bnm1_next_size (newrn);
96
0
      mpn_mulmod_bnm1 (xp, m, up, newrn, rp, rn, xp + m);
97
      /* Only the values in the range xp + rn .. xp + newrn - 1 are
98
   used by the _mullo_n below.
99
   Since m >= newrn, we do not need the following. */
100
      /* mpn_sub_1 (xp + m, xp, rn - (m - newrn), 1); */
101
102
      /* R = R(X/B^rn) */
103
0
      mpn_mullo_n (rp + rn, rp, xp + rn, newrn - rn);
104
0
      mpn_neg (rp + rn, rp + rn, newrn - rn);
105
0
    }
106
4.14k
}