Coverage Report

Created: 2024-11-21 07:03

/src/libgmp/mpz/divexact.c
Line
Count
Source (jump to first uncovered line)
1
/* mpz_divexact -- finds quotient when known that quot * den == num && den != 0.
2
3
Contributed to the GNU project by Niels Möller.
4
5
Copyright 1991, 1993-1998, 2000-2002, 2005-2007, 2009, 2012 Free Software
6
Foundation, Inc.
7
8
This file is part of the GNU MP Library.
9
10
The GNU MP Library is free software; you can redistribute it and/or modify
11
it under the terms of either:
12
13
  * the GNU Lesser General Public License as published by the Free
14
    Software Foundation; either version 3 of the License, or (at your
15
    option) any later version.
16
17
or
18
19
  * the GNU General Public License as published by the Free Software
20
    Foundation; either version 2 of the License, or (at your option) any
21
    later version.
22
23
or both in parallel, as here.
24
25
The GNU MP Library is distributed in the hope that it will be useful, but
26
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
27
or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
28
for more details.
29
30
You should have received copies of the GNU General Public License and the
31
GNU Lesser General Public License along with the GNU MP Library.  If not,
32
see https://www.gnu.org/licenses/.  */
33
34
35
#include "gmp-impl.h"
36
37
void
38
mpz_divexact (mpz_ptr quot, mpz_srcptr num, mpz_srcptr den)
39
1.55k
{
40
1.55k
  mp_ptr qp;
41
1.55k
  mp_size_t qn;
42
1.55k
  mp_srcptr np, dp;
43
1.55k
  mp_size_t nn, dn;
44
1.55k
  TMP_DECL;
45
46
1.55k
#if WANT_ASSERT
47
1.55k
  {
48
1.55k
    mpz_t  rem;
49
1.55k
    mpz_init (rem);
50
1.55k
    mpz_tdiv_r (rem, num, den);
51
1.55k
    ASSERT (SIZ(rem) == 0);
52
1.55k
    mpz_clear (rem);
53
1.55k
  }
54
0
#endif
55
56
1.55k
  nn = ABSIZ (num);
57
1.55k
  dn = ABSIZ (den);
58
59
1.55k
  if (nn < dn)
60
1
    {
61
      /* This special case avoids segfaults below when the function is
62
   incorrectly called with |N| < |D|, N != 0.  It also handles the
63
   well-defined case N = 0.  */
64
1
      SIZ(quot) = 0;
65
1
      return;
66
1
    }
67
68
1.54k
  qn = nn - dn + 1;
69
70
1.54k
  TMP_MARK;
71
72
1.54k
  if (quot == num || quot == den)
73
194
    qp = TMP_ALLOC_LIMBS (qn);
74
1.35k
  else
75
1.35k
    qp = MPZ_NEWALLOC (quot, qn);
76
77
1.54k
  np = PTR(num);
78
1.54k
  dp = PTR(den);
79
80
1.54k
  mpn_divexact (qp, np, nn, dp, dn);
81
1.54k
  MPN_NORMALIZE (qp, qn);
82
83
1.54k
  if (qp != PTR(quot))
84
194
    MPN_COPY (MPZ_NEWALLOC (quot, qn), qp, qn);
85
86
1.54k
  SIZ(quot) = (SIZ(num) ^ SIZ(den)) >= 0 ? qn : -qn;
87
88
1.54k
  TMP_FREE;
89
1.54k
}