Coverage Report

Created: 2024-02-25 06:16

/src/nettle-with-mini-gmp/gmp-glue.c
Line
Count
Source (jump to first uncovered line)
1
/* gmp-glue.c
2
3
   Copyright (C) 2013 Niels Möller
4
   Copyright (C) 2013 Red Hat
5
6
   This file is part of GNU Nettle.
7
8
   GNU Nettle is free software: you can redistribute it and/or
9
   modify it under the terms of either:
10
11
     * the GNU Lesser General Public License as published by the Free
12
       Software Foundation; either version 3 of the License, or (at your
13
       option) any later version.
14
15
   or
16
17
     * the GNU General Public License as published by the Free
18
       Software Foundation; either version 2 of the License, or (at your
19
       option) any later version.
20
21
   or both in parallel, as here.
22
23
   GNU Nettle is distributed in the hope that it will be useful,
24
   but WITHOUT ANY WARRANTY; without even the implied warranty of
25
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
26
   General Public License for more details.
27
28
   You should have received copies of the GNU General Public License and
29
   the GNU Lesser General Public License along with this program.  If
30
   not, see http://www.gnu.org/licenses/.
31
*/
32
33
#if HAVE_CONFIG_H
34
# include "config.h"
35
#endif
36
37
#include <assert.h>
38
#include <stdlib.h>
39
40
#include "gmp-glue.h"
41
42
#if NETTLE_USE_MINI_GMP
43
mp_limb_t
44
mpn_cnd_add_n (mp_limb_t cnd, mp_limb_t *rp,
45
         const mp_limb_t *ap, const mp_limb_t *bp, mp_size_t n)
46
4.09M
{
47
4.09M
  mp_limb_t cy, mask;
48
4.09M
  mp_size_t  i;
49
50
4.09M
  mask = -(mp_limb_t) (cnd != 0);
51
52
31.1M
  for (i = 0, cy = 0; i < n; i++)
53
27.0M
    {
54
27.0M
      mp_limb_t rl = ap[i] + cy;
55
27.0M
      mp_limb_t bl = bp[i] & mask;
56
27.0M
      cy = (rl < cy);
57
27.0M
      rl += bl;
58
27.0M
      cy += (rl < bl);
59
27.0M
      rp[i] = rl;
60
27.0M
    }
61
4.09M
  return cy;
62
4.09M
}
63
64
mp_limb_t
65
mpn_cnd_sub_n (mp_limb_t cnd, mp_limb_t *rp,
66
         const mp_limb_t *ap, const mp_limb_t *bp, mp_size_t n)
67
5.08M
{
68
5.08M
  mp_limb_t cy, mask;
69
5.08M
  mp_size_t  i;
70
71
5.08M
  mask = -(mp_limb_t) (cnd != 0);
72
73
37.5M
  for (i = 0, cy = 0; i < n; i++)
74
32.5M
    {
75
32.5M
      mp_limb_t al = ap[i];
76
32.5M
      mp_limb_t bl = bp[i] & mask;
77
32.5M
      mp_limb_t sl;
78
32.5M
      sl = al - cy;
79
32.5M
      cy = (al < cy) + (sl < bl);
80
32.5M
      sl -= bl;
81
32.5M
      rp[i] = sl;
82
32.5M
    }
83
5.08M
  return cy;
84
5.08M
}
85
86
void
87
mpn_cnd_swap (mp_limb_t cnd, volatile mp_limb_t *ap, volatile mp_limb_t *bp, mp_size_t n)
88
766k
{
89
766k
  volatile mp_limb_t mask = - (mp_limb_t) (cnd != 0);
90
766k
  mp_size_t i;
91
6.10M
  for (i = 0; i < n; i++)
92
5.34M
    {
93
5.34M
      mp_limb_t a, b, t;
94
5.34M
      a = ap[i];
95
5.34M
      b = bp[i];
96
5.34M
      t = (a ^ b) & mask;
97
5.34M
      ap[i] = a ^ t;
98
5.34M
      bp[i] = b ^ t;
99
5.34M
    }
100
766k
}
101
102
/* Copy the k'th element of the table out tn elements, each of size
103
   rn. Always read complete table. Similar to gmp's mpn_tabselect. */
104
void
105
mpn_sec_tabselect (volatile mp_limb_t *rp, volatile const mp_limb_t *table,
106
       mp_size_t rn, unsigned tn, unsigned k)
107
131k
{
108
131k
  volatile const mp_limb_t *end = table + tn * rn;
109
131k
  volatile const mp_limb_t *p;
110
131k
  mp_size_t i;
111
112
131k
  assert (k < tn);
113
7.29M
  for (p = table; p < end; p += rn, k--)
114
7.15M
    {
115
7.15M
      mp_limb_t mask = - (mp_limb_t) (k == 0);
116
94.7M
      for (i = 0; i < rn; i++)
117
87.5M
  rp[i] = (~mask & rp[i]) | (mask & p[i]);
118
7.15M
    }
119
131k
}
120
121
122
#endif /* NETTLE_USE_MINI_GMP */
123
124
int
125
sec_zero_p (const mp_limb_t *ap, mp_size_t n)
126
858
{
127
858
  volatile mp_limb_t w;
128
858
  mp_size_t i;
129
130
4.74k
  for (i = 0, w = 0; i < n; i++)
131
3.88k
    w |= ap[i];
132
133
858
  return is_zero_limb (w);
134
858
}
135
136
/* Additional convenience functions. */
137
138
void
139
mpz_limbs_copy (mp_limb_t *xp, mpz_srcptr x, mp_size_t n)
140
3.28k
{
141
3.28k
  mp_size_t xn = mpz_size (x);
142
143
3.28k
  assert (xn <= n);
144
3.28k
  mpn_copyi (xp, mpz_limbs_read (x), xn);
145
3.28k
  if (xn < n)
146
714
    mpn_zero (xp + xn, n - xn);
147
3.28k
}
148
149
void
150
mpz_set_n (mpz_t r, const mp_limb_t *xp, mp_size_t xn)
151
2.55k
{
152
2.55k
  mpn_copyi (mpz_limbs_write (r, xn), xp, xn);
153
2.55k
  mpz_limbs_finish (r, xn);
154
2.55k
}
155
156
void
157
mpn_set_base256 (mp_limb_t *rp, mp_size_t rn,
158
     const uint8_t *xp, size_t xn)
159
1.56k
{
160
1.56k
  size_t xi;
161
1.56k
  mp_limb_t out;
162
1.56k
  unsigned bits;
163
42.2k
  for (xi = xn, out = bits = 0; xi > 0 && rn > 0; )
164
40.7k
    {
165
40.7k
      mp_limb_t in = xp[--xi];
166
40.7k
      out |= (in << bits) & GMP_NUMB_MASK;
167
40.7k
      bits += 8;
168
40.7k
      if (bits >= GMP_NUMB_BITS)
169
4.83k
  {
170
4.83k
    *rp++ = out;
171
4.83k
    rn--;
172
173
4.83k
    bits -= GMP_NUMB_BITS;
174
4.83k
    out = in >> (8 - bits);
175
4.83k
  }
176
40.7k
    }
177
1.56k
  if (rn > 0)
178
878
    {
179
878
      *rp++ = out;
180
878
      if (--rn > 0)
181
596
  mpn_zero (rp, rn);
182
878
    }
183
1.56k
}
184
185
void
186
mpn_set_base256_le (mp_limb_t *rp, mp_size_t rn,
187
        const uint8_t *xp, size_t xn)
188
229
{
189
229
  size_t xi;
190
229
  mp_limb_t out;
191
229
  unsigned bits;
192
8.68k
  for (xi = 0, out = bits = 0; xi < xn && rn > 0; )
193
8.45k
    {
194
8.45k
      mp_limb_t in = xp[xi++];
195
8.45k
      out |= (in << bits) & GMP_NUMB_MASK;
196
8.45k
      bits += 8;
197
8.45k
      if (bits >= GMP_NUMB_BITS)
198
1.05k
  {
199
1.05k
    *rp++ = out;
200
1.05k
    rn--;
201
202
1.05k
    bits -= GMP_NUMB_BITS;
203
1.05k
    out = in >> (8 - bits);
204
1.05k
  }
205
8.45k
    }
206
229
  if (rn > 0)
207
0
    {
208
0
      *rp++ = out;
209
0
      if (--rn > 0)
210
0
  mpn_zero (rp, rn);
211
0
    }
212
229
}
213
214
void
215
mpn_get_base256 (uint8_t *rp, size_t rn,
216
     const mp_limb_t *xp, mp_size_t xn)
217
0
{
218
0
  unsigned bits;
219
0
  mp_limb_t in;
220
0
  for (bits = in = 0; xn > 0 && rn > 0; )
221
0
    {
222
0
      if (bits >= 8)
223
0
  {
224
0
    rp[--rn] = in;
225
0
    in >>= 8;
226
0
    bits -= 8;
227
0
  }
228
0
      else
229
0
  {
230
0
    uint8_t old = in;
231
0
    in = *xp++;
232
0
    xn--;
233
0
    rp[--rn] = old | (in << bits);
234
0
    in >>= (8 - bits);
235
0
    bits += GMP_NUMB_BITS - 8;
236
0
  }
237
0
    }
238
0
  while (rn > 0)
239
0
    {
240
0
      rp[--rn] = in;
241
0
      in >>= 8;
242
0
    }
243
0
}
244
245
void
246
mpn_get_base256_le (uint8_t *rp, size_t rn,
247
        const mp_limb_t *xp, mp_size_t xn)
248
229
{
249
229
  unsigned bits;
250
229
  mp_limb_t in;
251
7.08k
  for (bits = in = 0; xn > 0 && rn > 0; )
252
6.85k
    {
253
6.85k
      if (bits >= 8)
254
5.79k
  {
255
5.79k
    *rp++ = in;
256
5.79k
    rn--;
257
5.79k
    in >>= 8;
258
5.79k
    bits -= 8;
259
5.79k
  }
260
1.05k
      else
261
1.05k
  {
262
1.05k
    uint8_t old = in;
263
1.05k
    in = *xp++;
264
1.05k
    xn--;
265
1.05k
    *rp++ = old | (in << bits);
266
1.05k
    rn--;
267
1.05k
    in >>= (8 - bits);
268
1.05k
    bits += GMP_NUMB_BITS - 8;
269
1.05k
  }
270
6.85k
    }
271
1.83k
  while (rn > 0)
272
1.60k
    {
273
1.60k
      *rp++ = in;
274
1.60k
      rn--;
275
1.60k
      in >>= 8;
276
1.60k
    }
277
229
}
278
279
mp_limb_t *
280
gmp_alloc_limbs (mp_size_t n)
281
5.43k
{
282
283
5.43k
  void *(*alloc_func)(size_t);
284
285
5.43k
  assert (n > 0);
286
287
5.43k
  mp_get_memory_functions (&alloc_func, NULL, NULL);
288
5.43k
  return (mp_limb_t *) alloc_func ( (size_t) n * sizeof(mp_limb_t));
289
5.43k
}
290
291
void
292
gmp_free_limbs (mp_limb_t *p, mp_size_t n)
293
5.43k
{
294
5.43k
  void (*free_func)(void *, size_t);
295
5.43k
  assert (n > 0);
296
5.43k
  assert (p != 0);
297
5.43k
  mp_get_memory_functions (NULL, NULL, &free_func);
298
299
5.43k
  free_func (p, (size_t) n * sizeof(mp_limb_t));
300
5.43k
}
301
302
void *
303
gmp_alloc(size_t n)
304
0
{
305
0
  void *(*alloc_func)(size_t);
306
0
  assert (n > 0);
307
308
0
  mp_get_memory_functions(&alloc_func, NULL, NULL);
309
310
0
  return alloc_func (n);
311
0
}
312
313
void
314
gmp_free(void *p, size_t n)
315
0
{
316
0
  void (*free_func)(void *, size_t);
317
0
  assert (n > 0);
318
0
  assert (p != 0);
319
0
  mp_get_memory_functions (NULL, NULL, &free_func);
320
321
0
  free_func (p, (size_t) n);
322
0
}