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
|
/*=============================================================================
Copyright (C) 2007, 2008 David Harvey (zn_poly)
Copyright (C) 2013 William Hart
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
=============================================================================*/
#include <stdlib.h>
#include <gmp.h>
#include "flint.h"
#include "nmod_vec.h"
#include "nmod_poly.h"
/*
Same as _nmod_poly_KS2_pack(), but requires b <= FLINT_BITS.
*/
void
_nmod_poly_KS2_pack1(mp_ptr res, mp_srcptr op, slong n, slong s,
ulong b, ulong k, slong r)
{
/* where to write the next limb */
mp_ptr dest = res;
/* limb currently being filled */
mp_limb_t buf;
/* number of bits used in buf; always in [0, FLINT_BITS) */
ulong buf_b, buf_b_old;
/* write leading zero-padding */
while (k >= FLINT_BITS)
{
*dest++ = 0;
k -= FLINT_BITS;
}
buf = 0;
buf_b = k;
for (; n > 0; n--, op += s)
{
/* put low bits of current input into buffer */
buf += *op << buf_b;
buf_b_old = buf_b;
buf_b += b;
if (buf_b >= FLINT_BITS)
{
/* buffer is full; flush it */
*dest++ = buf;
buf_b -= FLINT_BITS;
/* put remaining bits of current input into buffer */
buf = buf_b_old ? (*op >> (FLINT_BITS - buf_b_old)) : 0;
}
}
/* write last limb if it's non-empty */
if (buf_b)
*dest++ = buf;
/* zero-pad up to requested length */
if (r)
{
slong written = dest - res;
for (; written < r; written++)
*dest++ = 0;
}
}
void
_nmod_poly_KS2_pack(mp_ptr res, mp_srcptr op, slong n, slong s,
ulong b, ulong k, slong r)
{
/* where to write the next limb */
mp_ptr dest = res;
/* limb currently being filled */
mp_limb_t buf;
/* number of bits used in buf; always in [0, FLINT_BITS) */
ulong buf_b, buf_b_old;
if (b <= FLINT_BITS)
{
/* use specialised version if b is small enough */
_nmod_poly_KS2_pack1(res, op, n, s, b, k, r);
return;
}
/* write leading zero-padding */
while (k >= FLINT_BITS)
{
*dest++ = 0;
k -= FLINT_BITS;
}
buf = 0;
buf_b = k;
for (; n > 0; n--, op += s)
{
/* put low bits of current input into buffer */
buf += *op << buf_b;
buf_b_old = buf_b;
buf_b += b;
if (buf_b >= FLINT_BITS)
{
/* buffer is full; flush it */
*dest++ = buf;
buf_b -= FLINT_BITS;
/* put remaining bits of current input into buffer */
buf = buf_b_old ? (*op >> (FLINT_BITS - buf_b_old)) : 0;
/* write as many extra zeroes as necessary */
if (buf_b >= FLINT_BITS)
{
*dest++ = buf;
buf = 0;
buf_b -= FLINT_BITS;
if (buf_b >= FLINT_BITS)
{
*dest++ = 0;
buf_b -= FLINT_BITS;
}
}
}
}
/* write last limb if it's non-empty */
if (buf_b)
*dest++ = buf;
/* zero-pad up to requested length */
if (r)
{
slong written = dest - res;
for (; written < r; written++)
*dest++ = 0;
}
}
|
