flint-sys 0.9.0

Bindings to the FLINT C library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164

/*
    Copyright (C) 2025 Fredrik Johansson

    This file is part of FLINT.

    FLINT is free software: you can redistribute it and/or modify it under
    the terms of the GNU Lesser General Public License (LGPL) as published
    by the Free Software Foundation; either version 3 of the License, or
    (at your option) any later version.  See <https://www.gnu.org/licenses/>.
*/

/* mpn_divrem_1 -- mpn by limb division.

Copyright 1991, 1993, 1994, 1996, 1998-2000, 2002, 2003 Free Software
Foundation, Inc.

This file is part of the GNU MP Library.

The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of either:

  * the GNU Lesser General Public License as published by the Free
    Software Foundation; either version 3 of the License, or (at your
    option) any later version.

or

  * the GNU General Public License as published by the Free Software
    Foundation; either version 2 of the License, or (at your option) any
    later version.

or both in parallel, as here.

The GNU MP Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received copies of the GNU General Public License and the
GNU Lesser General Public License along with the GNU MP Library.  If not,
see https://www.gnu.org/licenses/.  */


#include "ulong_extras.h"
#include "mpn_extras.h"

mp_limb_t
flint_mpn_divrem_2_1_preinv_norm(mp_ptr qp, mp_srcptr up, mp_limb_t d, mp_limb_t dinv)
{
    mp_limb_t r;
    r = n_divrem_norm(&qp[1], up[1], d);
    udiv_qrnnd_preinv(qp[0], r, r, up[0], d, dinv);
    return r;
}

mp_limb_t
flint_mpn_divrem_3_1_preinv_norm(mp_ptr qp, mp_srcptr up, mp_limb_t d, mp_limb_t dinv)
{
    mp_limb_t r;
    r = n_divrem_norm(&qp[2], up[2], d);
    udiv_qrnnd_preinv(qp[1], r, r, up[1], d, dinv);
    udiv_qrnnd_preinv(qp[0], r, r, up[0], d, dinv);
    return r;
}

mp_limb_t
flint_mpn_divrem_2_1_preinv_unnorm(mp_ptr qp, mp_srcptr up, mp_limb_t d, mp_limb_t dinv, unsigned int norm)
{
    mp_limb_t u0, u1, r;

    FLINT_ASSERT(norm >= 1);

    u1 = up[1];
    u0 = up[0];
    if (u1 < d)
    {
        d <<= norm;
        qp[1] = 0;
        r = (u1 << norm) | (u0 >> (FLINT_BITS - norm));
    }
    else
    {
        d <<= norm;
        r = (u1 >> (FLINT_BITS - norm));
        udiv_qrnnd_preinv(qp[1], r, r, (u1 << norm) | (u0 >> (FLINT_BITS - norm)), d, dinv);
    }

    udiv_qrnnd_preinv(qp[0], r, r, u0 << norm, d, dinv);
    return r >> norm;
}

mp_limb_t
flint_mpn_divrem_3_1_preinv_unnorm(mp_ptr qp, mp_srcptr up, mp_limb_t d, mp_limb_t dinv, unsigned int norm)
{
    mp_limb_t u0, u1, u2, r;

    FLINT_ASSERT(norm >= 1);

    u2 = up[2];
    u1 = up[1];
    if (u2 < d)
    {
        d <<= norm;
        qp[2] = 0;
        r = (u2 << norm) | (u1 >> (FLINT_BITS - norm));
    }
    else
    {
        d <<= norm;
        r = (u2 >> (FLINT_BITS - norm));
        udiv_qrnnd_preinv(qp[2], r, r, (u2 << norm) | (u1 >> (FLINT_BITS - norm)), d, dinv);
    }

    u0 = up[0];
    udiv_qrnnd_preinv(qp[1], r, r, (u1 << norm) | (u0 >> (FLINT_BITS - norm)), d, dinv);
    udiv_qrnnd_preinv(qp[0], r, r, u0 << norm, d, dinv);
    return r >> norm;
}

mp_limb_t
flint_mpn_divrem_1_preinv(mp_ptr qp, mp_srcptr up, mp_size_t n, mp_limb_t d, mp_limb_t dinv, unsigned int norm)
{
    mp_limb_t u2, u3, r;
    slong i;

    if (norm == 0)
    {
        r = n_divrem_norm(&qp[n - 1], up[n - 1], d);
        for (i = n - 2; i >= 0; i--)
            udiv_qrnnd_preinv(qp[i], r, r, up[i], d, dinv);
        return r;
    }
    else
    {
        if (n == 1)
            return n_divrem_preinv_unnorm(qp, up[0], d, dinv, norm);

        u3 = up[n - 1];
        u2 = up[n - 2];
        if (u3 < d)
        {
            d <<= norm;
            qp[n - 1] = 0;
            r = (u3 << norm) | (u2 >> (FLINT_BITS - norm));
        }
        else
        {
            d <<= norm;
            r = (u3 >> (FLINT_BITS - norm));
            udiv_qrnnd_preinv(qp[n - 1], r, r, (u3 << norm) | (u2 >> (FLINT_BITS - norm)), d, dinv);
        }

        for (i = n - 2; i >= 1; i--)
        {
            u3 = up[i - 1];
            udiv_qrnnd_preinv(qp[i], r, r, (u2 << norm) | (u3 >> (FLINT_BITS - norm)), d, dinv);
            u2 = u3;
        }

        udiv_qrnnd_preinv(qp[0], r, r, u2 << norm, d, dinv);
        return r >> norm;
    }
}