1 /* cksum -- calculate and print POSIX checksums and sizes of files
2 Copyright (C) 1992-2024 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>
45 # define BIT(x) ((uint_fast32_t) 1 << (x))
46 # define SBIT BIT (31)
48 /* The generating polynomial is
50 32 26 23 22 16 12 11 10 8 7 5 4 2 1
51 G(X)=X + X + X + X + X + X + X + X + X + X + X + X + X + X + 1
53 The i bit in GEN is set if X^i is a summand of G(X) except X^32. */
55 # define GEN (BIT (26) | BIT (23) | BIT (22) | BIT (16) | BIT (12) \
56 | BIT (11) | BIT (10) | BIT (8) | BIT (7) | BIT (5) \
57 | BIT (4) | BIT (2) | BIT (1) | BIT (0))
59 static uint_fast32_t r
[8];
65 for (int i
= 1; i
< 8; i
++)
66 r
[i
] = (r
[i
- 1] << 1) ^ ((r
[i
- 1] & SBIT
) ? GEN
: 0);
72 uint_fast32_t rem
= 0;
74 for (int i
= 0; i
< 8; i
++)
78 return rem
& 0xFFFFFFFF; /* Make it run on 64-bit machine. */
85 static uint_fast32_t crctab
[8][256];
89 for (i
= 0; i
< 256; i
++)
91 crctab
[0][i
] = crc_remainder (i
);
94 /* CRC(0x11 0x22 0x33 0x44)
96 CRC(0x11 0x00 0x00 0x00) XOR CRC(0x22 0x00 0x00) XOR
97 CRC(0x33 0x00) XOR CRC(0x44)
98 We precompute the CRC values for the offset values into
99 separate CRC tables. We can then use them to speed up
100 CRC calculation by processing multiple bytes at the time. */
101 for (i
= 0; i
< 256; i
++)
105 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ (i
& 0xFF)) & 0xFF];
106 for (idx_t offset
= 1; offset
< 8; offset
++)
108 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ 0x00) & 0xFF];
109 crctab
[offset
][i
] = crc
;
113 printf ("#include <config.h>\n");
114 printf ("#include <stdint.h>\n");
115 printf ("#include <stdio.h>\n");
116 printf ("#include \"cksum.h\"\n");
118 printf ("uint_fast32_t const crctab[8][256] = {\n");
119 for (int y
= 0; y
< 8; y
++)
121 printf ("{\n 0x%08x", crctab
[y
][0]);
122 for (i
= 0; i
< 51; i
++)
124 printf (",\n 0x%08x, 0x%08x, 0x%08x, 0x%08x, 0x%08x",
125 crctab
[y
][i
* 5 + 1], crctab
[y
][i
* 5 + 2],
126 crctab
[y
][i
* 5 + 3], crctab
[y
][i
* 5 + 4],
127 crctab
[y
][i
* 5 + 5]);
139 /* Number of bytes to read at once. */
140 # define BUFLEN (1 << 16)
142 # if USE_PCLMUL_CRC32
144 pclmul_supported (void)
146 bool pclmul_enabled
= (0 < __builtin_cpu_supports ("pclmul")
147 && 0 < __builtin_cpu_supports ("avx"));
152 ? _("using pclmul hardware support")
153 : _("pclmul support not detected")));
155 return pclmul_enabled
;
157 # endif /* USE_PCLMUL_CRC32 */
160 cksum_slice8 (FILE *fp
, uint_fast32_t *crc_out
, uintmax_t *length_out
)
162 uint32_t buf
[BUFLEN
/ sizeof (uint32_t)];
163 uint_fast32_t crc
= 0;
164 uintmax_t length
= 0;
167 if (!fp
|| !crc_out
|| !length_out
)
170 while ((bytes_read
= fread (buf
, 1, BUFLEN
, fp
)) > 0)
174 if (length
+ bytes_read
< length
)
179 length
+= bytes_read
;
181 /* Process multiples of 8 bytes */
182 datap
= (uint32_t *)buf
;
183 while (bytes_read
>= 8)
185 uint32_t first
= *datap
++, second
= *datap
++;
186 crc
^= htobe32 (first
);
187 second
= htobe32 (second
);
188 crc
= (crctab
[7][(crc
>> 24) & 0xFF]
189 ^ crctab
[6][(crc
>> 16) & 0xFF]
190 ^ crctab
[5][(crc
>> 8) & 0xFF]
191 ^ crctab
[4][(crc
) & 0xFF]
192 ^ crctab
[3][(second
>> 24) & 0xFF]
193 ^ crctab
[2][(second
>> 16) & 0xFF]
194 ^ crctab
[1][(second
>> 8) & 0xFF]
195 ^ crctab
[0][(second
) & 0xFF]);
199 /* And finish up last 0-7 bytes in a byte by byte fashion */
200 unsigned char *cp
= (unsigned char *)datap
;
202 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ *cp
++) & 0xFF];
208 *length_out
= length
;
213 /* Calculate the checksum and length in bytes of stream STREAM.
214 Return -1 on error, 0 on success. */
217 crc_sum_stream (FILE *stream
, void *resstream
, uintmax_t *length
)
219 uintmax_t total_bytes
= 0;
220 uint_fast32_t crc
= 0;
222 # if USE_PCLMUL_CRC32
223 static bool (*cksum_fp
) (FILE *, uint_fast32_t *, uintmax_t *);
225 cksum_fp
= pclmul_supported () ? cksum_pclmul
: cksum_slice8
;
227 bool (*cksum_fp
) (FILE *, uint_fast32_t *, uintmax_t *) = cksum_slice8
;
230 if (! cksum_fp (stream
, &crc
, &total_bytes
))
233 *length
= total_bytes
;
235 for (; total_bytes
; total_bytes
>>= 8)
236 crc
= (crc
<< 8) ^ crctab
[0][((crc
>> 24) ^ total_bytes
) & 0xFF];
237 crc
= ~crc
& 0xFFFFFFFF;
239 unsigned int crc_out
= crc
;
240 memcpy (resstream
, &crc_out
, sizeof crc_out
);
245 /* Print the checksum and size to stdout.
246 If ARGS is true, also print the FILE name. */
249 output_crc (char const *file
, int binary_file
, void const *digest
, bool raw
,
250 bool tagged
, unsigned char delim
, bool args
, uintmax_t length
)
254 /* Output in network byte order (big endian). */
255 uint32_t out_int
= htobe32 (*(uint32_t *)digest
);
256 fwrite (&out_int
, 1, 32/8, stdout
);
260 printf ("%u %ju", *(unsigned int *)digest
, length
);
262 printf (" %s", file
);