Coverage Report

Created: 2024-11-21 07:03

/src/libgmp/mpn/sbpi1_div_qr.c
Line
Count
Source
1
/* mpn_sbpi1_div_qr -- Schoolbook division using the Möller-Granlund 3/2
2
   division algorithm.
3
4
   Contributed to the GNU project by Torbjorn Granlund.
5
6
   THE FUNCTION IN THIS FILE IS INTERNAL WITH A MUTABLE INTERFACE.  IT IS ONLY
7
   SAFE TO REACH IT THROUGH DOCUMENTED INTERFACES.  IN FACT, IT IS ALMOST
8
   GUARANTEED THAT IT WILL CHANGE OR DISAPPEAR IN A FUTURE GMP RELEASE.
9
10
Copyright 2007, 2009 Free Software Foundation, Inc.
11
12
This file is part of the GNU MP Library.
13
14
The GNU MP Library is free software; you can redistribute it and/or modify
15
it under the terms of either:
16
17
  * the GNU Lesser General Public License as published by the Free
18
    Software Foundation; either version 3 of the License, or (at your
19
    option) any later version.
20
21
or
22
23
  * the GNU General Public License as published by the Free Software
24
    Foundation; either version 2 of the License, or (at your option) any
25
    later version.
26
27
or both in parallel, as here.
28
29
The GNU MP Library is distributed in the hope that it will be useful, but
30
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
31
or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
32
for more details.
33
34
You should have received copies of the GNU General Public License and the
35
GNU Lesser General Public License along with the GNU MP Library.  If not,
36
see https://www.gnu.org/licenses/.  */
37
38
39
#include "gmp-impl.h"
40
#include "longlong.h"
41
42
mp_limb_t
43
mpn_sbpi1_div_qr (mp_ptr qp,
44
      mp_ptr np, mp_size_t nn,
45
      mp_srcptr dp, mp_size_t dn,
46
      mp_limb_t dinv)
47
1.14M
{
48
1.14M
  mp_limb_t qh;
49
1.14M
  mp_size_t i;
50
1.14M
  mp_limb_t n1, n0;
51
1.14M
  mp_limb_t d1, d0;
52
1.14M
  mp_limb_t cy, cy1;
53
1.14M
  mp_limb_t q;
54
55
1.14M
  ASSERT (dn > 2);
56
1.14M
  ASSERT (nn >= dn);
57
1.14M
  ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0);
58
59
1.14M
  np += nn;
60
61
1.14M
  qh = mpn_cmp (np - dn, dp, dn) >= 0;
62
1.14M
  if (qh != 0)
63
725
    mpn_sub_n (np - dn, np - dn, dp, dn);
64
65
1.14M
  qp += nn - dn;
66
67
1.14M
  dn -= 2;      /* offset dn by 2 for main division loops,
68
           saving two iterations in mpn_submul_1.  */
69
1.14M
  d1 = dp[dn + 1];
70
1.14M
  d0 = dp[dn + 0];
71
72
1.14M
  np -= 2;
73
74
1.14M
  n1 = np[1];
75
76
10.9M
  for (i = nn - (dn + 2); i > 0; i--)
77
9.83M
    {
78
9.83M
      np--;
79
9.83M
      if (UNLIKELY (n1 == d1) && np[1] == d0)
80
322
  {
81
322
    q = GMP_NUMB_MASK;
82
322
    mpn_submul_1 (np - dn, dp, dn + 2, q);
83
322
    n1 = np[1];   /* update n1, last loop's value will now be invalid */
84
322
  }
85
9.83M
      else
86
9.83M
  {
87
9.83M
    udiv_qr_3by2 (q, n1, n0, n1, np[1], np[0], d1, d0, dinv);
88
89
9.83M
    cy = mpn_submul_1 (np - dn, dp, dn, q);
90
91
9.83M
    cy1 = n0 < cy;
92
9.83M
    n0 = (n0 - cy) & GMP_NUMB_MASK;
93
9.83M
    cy = n1 < cy1;
94
9.83M
    n1 = (n1 - cy1) & GMP_NUMB_MASK;
95
9.83M
    np[0] = n0;
96
97
9.83M
    if (UNLIKELY (cy != 0))
98
1.22k
      {
99
1.22k
        n1 += d1 + mpn_add_n (np - dn, np - dn, dp, dn + 1);
100
1.22k
        q--;
101
1.22k
      }
102
9.83M
  }
103
104
9.83M
      *--qp = q;
105
9.83M
    }
106
1.14M
  np[1] = n1;
107
108
1.14M
  return qh;
109
1.14M
}