1 /* cksum -- calculate and print POSIX checksums and sizes of files
2 Copyright (C) 1992-2023 Free Software Foundation, Inc.
4 This program is free software: you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation, either version 3 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see <https://www.gnu.org/licenses/>. */
17 /* Written by Q. Frank Xia, qx@math.columbia.edu.
18 Cosmetic changes and reorganization by David MacKenzie, djm@gnu.ai.mit.edu.
20 Usage: cksum [file...]
22 The code segment between "#ifdef CRCTAB" and "#else" is the code
23 which calculates the "crctab". It is included for those who want
24 verify the correctness of the "crctab". To recreate the "crctab",
25 do something like the following:
27 cc -I../lib -DCRCTAB -o crctab cksum.c
30 This software is compatible with neither the System V nor the BSD
31 'sum' program. It is supposed to conform to POSIX, except perhaps
32 for foreign language support. Any inconsistency with the standard
33 (other than foreign language support) is a bug. */
38 #include <sys/types.h>
43 #ifdef WORDS_BIGENDIAN
46 # define SWAP(n) bswap_32 (n)
51 # define BIT(x) ((uint_fast32_t) 1 << (x))
52 # define SBIT BIT (31)
54 /* The generating polynomial is
56 32 26 23 22 16 12 11 10 8 7 5 4 2 1
57 G(X)=X + X + X + X + X + X + X + X + X + X + X + X + X + X + 1
59 The i bit in GEN is set if X^i is a summand of G(X) except X^32. */
61 # define GEN (BIT (26) | BIT (23) | BIT (22) | BIT (16) | BIT (12) \
62 | BIT (11) | BIT (10) | BIT (8) | BIT (7) | BIT (5) \
63 | BIT (4) | BIT (2) | BIT (1) | BIT (0))
65 static uint_fast32_t r
[8];
71 for (int i
= 1; i
< 8; i
++)
72 r
[i
] = (r
[i
- 1] << 1) ^ ((r
[i
- 1] & SBIT
) ? GEN
: 0);
78 uint_fast32_t rem
= 0;
80 for (int i
= 0; i
< 8; i
++)
84 return rem
& 0xFFFFFFFF; /* Make it run on 64-bit machine. */
91 static uint_fast32_t crctab
[8][256];
95 for (i
= 0; i
< 256; i
++)
97 crctab
[0][i
] = crc_remainder (i
);
100 /* CRC(0x11 0x22 0x33 0x44)
102 CRC(0x11 0x00 0x00 0x00) XOR CRC(0x22 0x00 0x00) XOR
103 CRC(0x33 0x00) XOR CRC(0x44)
104 We precompute the CRC values for the offset values into
105 separate CRC tables. We can then use them to speed up
106 CRC calculation by processing multiple bytes at the time. */
107 for (i
= 0; i
< 256; i
++)
111 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ (i
& 0xFF)) & 0xFF];
112 for (idx_t offset
= 1; offset
< 8; offset
++)
114 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ 0x00) & 0xFF];
115 crctab
[offset
][i
] = crc
;
119 printf ("#include <config.h>\n");
120 printf ("#include <stdint.h>\n");
121 printf ("\nuint_fast32_t const crctab[8][256] = {\n");
122 for (int y
= 0; y
< 8; y
++)
124 printf ("{\n 0x%08x", crctab
[y
][0]);
125 for (i
= 0; i
< 51; i
++)
127 printf (",\n 0x%08x, 0x%08x, 0x%08x, 0x%08x, 0x%08x",
128 crctab
[y
][i
* 5 + 1], crctab
[y
][i
* 5 + 2],
129 crctab
[y
][i
* 5 + 3], crctab
[y
][i
* 5 + 4],
130 crctab
[y
][i
* 5 + 5]);
142 /* Number of bytes to read at once. */
143 # define BUFLEN (1 << 16)
145 # if USE_PCLMUL_CRC32
147 pclmul_supported (void)
149 bool pclmul_enabled
= (0 < __builtin_cpu_supports ("pclmul")
150 && 0 < __builtin_cpu_supports ("avx"));
155 ? _("using pclmul hardware support")
156 : _("pclmul support not detected")));
158 return pclmul_enabled
;
160 # endif /* USE_PCLMUL_CRC32 */
163 cksum_slice8 (FILE *fp
, uint_fast32_t *crc_out
, uintmax_t *length_out
)
165 uint32_t buf
[BUFLEN
/ sizeof (uint32_t)];
166 uint_fast32_t crc
= 0;
167 uintmax_t length
= 0;
170 if (!fp
|| !crc_out
|| !length_out
)
173 while ((bytes_read
= fread (buf
, 1, BUFLEN
, fp
)) > 0)
177 if (length
+ bytes_read
< length
)
182 length
+= bytes_read
;
184 /* Process multiples of 8 bytes */
185 datap
= (uint32_t *)buf
;
186 while (bytes_read
>= 8)
188 uint32_t first
= *datap
++, second
= *datap
++;
190 second
= SWAP (second
);
191 crc
= (crctab
[7][(crc
>> 24) & 0xFF]
192 ^ crctab
[6][(crc
>> 16) & 0xFF]
193 ^ crctab
[5][(crc
>> 8) & 0xFF]
194 ^ crctab
[4][(crc
) & 0xFF]
195 ^ crctab
[3][(second
>> 24) & 0xFF]
196 ^ crctab
[2][(second
>> 16) & 0xFF]
197 ^ crctab
[1][(second
>> 8) & 0xFF]
198 ^ crctab
[0][(second
) & 0xFF]);
202 /* And finish up last 0-7 bytes in a byte by byte fashion */
203 unsigned char *cp
= (unsigned char *)datap
;
205 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ *cp
++) & 0xFF];
211 *length_out
= length
;
216 /* Calculate the checksum and length in bytes of stream STREAM.
217 Return -1 on error, 0 on success. */
220 crc_sum_stream (FILE *stream
, void *resstream
, uintmax_t *length
)
222 uintmax_t total_bytes
= 0;
223 uint_fast32_t crc
= 0;
225 # if USE_PCLMUL_CRC32
226 static bool (*cksum_fp
) (FILE *, uint_fast32_t *, uintmax_t *);
228 cksum_fp
= pclmul_supported () ? cksum_pclmul
: cksum_slice8
;
230 bool (*cksum_fp
) (FILE *, uint_fast32_t *, uintmax_t *) = cksum_slice8
;
233 if (! cksum_fp (stream
, &crc
, &total_bytes
))
236 *length
= total_bytes
;
238 for (; total_bytes
; total_bytes
>>= 8)
239 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ total_bytes
) & 0xFF];
240 crc
= ~crc
& 0xFFFFFFFF;
242 unsigned int crc_out
= crc
;
243 memcpy (resstream
, &crc_out
, sizeof crc_out
);
248 /* Print the checksum and size to stdout.
249 If ARGS is true, also print the FILE name. */
252 output_crc (char const *file
, int binary_file
, void const *digest
, bool raw
,
253 bool tagged
, unsigned char delim
, bool args
, uintmax_t length
)
257 /* Output in network byte order (big endian). */
258 uint32_t out_int
= SWAP (*(uint32_t *)digest
);
259 fwrite (&out_int
, 1, 32/8, stdout
);
263 char length_buf
[INT_BUFSIZE_BOUND (uintmax_t)];
264 printf ("%u %s", *(unsigned int *)digest
, umaxtostr (length
, length_buf
));
266 printf (" %s", file
);