Coverage Report

Created: 2026-02-14 06:49

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/gmp/mpz/import.c
Line
Count
Source
1
/* mpz_import -- set mpz from word data.
2
3
Copyright 2002, 2012, 2021, 2022 Free Software Foundation, Inc.
4
5
This file is part of the GNU MP Library.
6
7
The GNU MP Library is free software; you can redistribute it and/or modify
8
it under the terms of either:
9
10
  * the GNU Lesser General Public License as published by the Free
11
    Software Foundation; either version 3 of the License, or (at your
12
    option) any later version.
13
14
or
15
16
  * the GNU General Public License as published by the Free Software
17
    Foundation; either version 2 of the License, or (at your option) any
18
    later version.
19
20
or both in parallel, as here.
21
22
The GNU MP Library is distributed in the hope that it will be useful, but
23
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
24
or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
25
for more details.
26
27
You should have received copies of the GNU General Public License and the
28
GNU Lesser General Public License along with the GNU MP Library.  If not,
29
see https://www.gnu.org/licenses/.  */
30
31
#include <stdio.h>
32
#include "gmp-impl.h"
33
34
35
36
#if HAVE_LIMB_BIG_ENDIAN
37
#define HOST_ENDIAN     1
38
#endif
39
#if HAVE_LIMB_LITTLE_ENDIAN
40
577k
#define HOST_ENDIAN     (-1)
41
#endif
42
#ifndef HOST_ENDIAN
43
static const mp_limb_t  endian_test = (CNST_LIMB(1) << (GMP_LIMB_BITS-7)) - 1;
44
#define HOST_ENDIAN     (* (signed char *) &endian_test)
45
#endif
46
47
48
void
49
mpz_import (mpz_ptr z, size_t count, int order,
50
      size_t size, int endian, size_t nail, const void *data)
51
577k
{
52
577k
  mp_size_t  zsize;
53
577k
  mp_ptr     zp;
54
55
577k
  ASSERT (order == 1 || order == -1);
56
577k
  ASSERT (endian == 1 || endian == 0 || endian == -1);
57
577k
  ASSERT (nail <= 8*size);
58
59
577k
  zsize = BITS_TO_LIMBS (count * (8*size - nail));
60
577k
  zp = MPZ_NEWALLOC (z, zsize);
61
62
577k
  if (endian == 0)
63
577k
    endian = HOST_ENDIAN;
64
65
  /* Can't use these special cases with nails currently, since they don't
66
     mask out the nail bits in the input data.  */
67
577k
  if (nail == 0 && GMP_NAIL_BITS == 0
68
577k
      && size == sizeof (mp_limb_t)
69
0
      && (((char *) data - (char *) NULL) % sizeof (mp_limb_t)) == 0 /* align */)
70
0
    {
71
0
      if (order == -1)
72
0
  {
73
0
    if (endian == HOST_ENDIAN)
74
0
      MPN_COPY (zp, (mp_srcptr) data, (mp_size_t) count);
75
0
    else /* if (endian == - HOST_ENDIAN) */
76
0
      MPN_BSWAP (zp, (mp_srcptr) data, (mp_size_t) count);
77
0
  }
78
0
      else /* if (order == 1) */
79
0
  {
80
0
    if (endian == HOST_ENDIAN)
81
0
      MPN_REVERSE (zp, (mp_srcptr) data, (mp_size_t) count);
82
0
    else /* if (endian == - HOST_ENDIAN) */
83
0
      MPN_BSWAP_REVERSE (zp, (mp_srcptr) data, (mp_size_t) count);
84
0
  }
85
0
    }
86
577k
  else
87
577k
  {
88
577k
    mp_limb_t      limb, byte, wbitsmask;
89
577k
    size_t         i, j, numb, wbytes;
90
577k
    mp_size_t      woffset;
91
577k
    unsigned char  *dp;
92
577k
    int            lbits, wbits;
93
94
577k
    numb = size * 8 - nail;
95
96
    /* whole bytes to process */
97
577k
    wbytes = numb / 8;
98
99
    /* partial byte to process */
100
577k
    wbits = numb % 8;
101
577k
    wbitsmask = (CNST_LIMB(1) << wbits) - 1;
102
103
    /* offset to get to the next word after processing wbytes and wbits */
104
577k
    woffset = (numb + 7) / 8;
105
577k
    woffset = (endian >= 0 ? woffset : -woffset)
106
577k
      + (order < 0 ? size : - (mp_size_t) size);
107
108
    /* least significant byte */
109
577k
    dp = (unsigned char *) data
110
577k
      + (order >= 0 ? (count-1)*size : 0) + (endian >= 0 ? size-1 : 0);
111
112
577k
#define ACCUMULATE(N)                                   \
113
76.5M
    do {                                                \
114
76.5M
      ASSERT (lbits < GMP_NUMB_BITS);                   \
115
76.5M
      ASSERT (limb <= (CNST_LIMB(1) << lbits) - 1);     \
116
76.5M
                                                        \
117
76.5M
      limb |= (mp_limb_t) byte << lbits;                \
118
76.5M
      lbits += (N);                                     \
119
76.5M
      if (lbits >= GMP_NUMB_BITS)                       \
120
76.5M
        {                                               \
121
9.48M
          *zp++ = limb & GMP_NUMB_MASK;                 \
122
9.48M
          lbits -= GMP_NUMB_BITS;                       \
123
9.48M
          ASSERT (lbits < (N));                         \
124
9.48M
          limb = byte >> ((N) - lbits);                 \
125
9.48M
        }                                               \
126
76.5M
    } while (0)
127
128
577k
    limb = 0;
129
577k
    lbits = 0;
130
77.1M
    for (i = 0; i < count; i++)
131
76.5M
      {
132
153M
  for (j = 0; j < wbytes; j++)
133
76.5M
    {
134
76.5M
      byte = *dp;
135
76.5M
      dp -= endian;
136
76.5M
      ACCUMULATE (8);
137
76.5M
    }
138
76.5M
  if (wbits != 0)
139
0
    {
140
0
      byte = *dp & wbitsmask;
141
0
      dp -= endian;
142
0
      ACCUMULATE (wbits);
143
0
    }
144
76.5M
  dp += woffset;
145
76.5M
      }
146
147
577k
    if (lbits != 0)
148
361k
      {
149
361k
  ASSERT (lbits <= GMP_NUMB_BITS);
150
361k
  ASSERT_LIMB (limb);
151
361k
  *zp++ = limb;
152
361k
      }
153
154
577k
    ASSERT (zp == PTR(z) + zsize);
155
156
    /* low byte of word after most significant */
157
577k
    ASSERT (dp == (unsigned char *) data
158
577k
      + (order < 0 ? count*size : - (mp_size_t) size)
159
577k
      + (endian >= 0 ? (mp_size_t) size - 1 : 0));
160
161
577k
  }
162
163
577k
  zp = PTR(z);
164
577k
  MPN_NORMALIZE (zp, zsize);
165
577k
  SIZ(z) = zsize;
166
577k
}