| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_crc32.h | 44 crc32(unsigned long crc, const void *_p, size_t len)
68 crc = crc ^ 0xffffffffUL;
72 crc = crc_tbl[(crc ^ *p++) & 0xff] ^ (crc >> 8);
73 crc = crc_tbl[(crc ^ *p++) & 0xff] ^ (crc >> 8);
74 crc = crc_tbl[(crc ^ *p++) & 0xff] ^ (crc >> 8)
[all...] |
| /src/external/gpl2/lvm2/dist/lib/misc/ |
| crc.c | 1 /* $NetBSD: crc.c,v 1.1.1.1 2008/12/22 00:18:12 haad Exp $ */
20 #include "crc.h"
22 /* Calculate an endian-independent CRC of supplied buffer */
31 uint32_t i, crc = initial; local
35 crc ^= *data++;
36 crc = (crc >> 4) ^ crctab[crc & 0xf];
37 crc = (crc >> 4) ^ crctab[crc & 0xf]
[all...] |
| /src/external/public-domain/xz/dist/src/liblzma/check/ |
| crc32_fast.c | 41 const uint8_t *buf, size_t size, uint32_t crc);
44 lzma_crc32_generic(const uint8_t *buf, size_t size, uint32_t crc)
46 crc = ~crc;
49 crc = byteswap32(crc);
56 crc = lzma_crc32_table[0][*buf++ ^ A(crc)] ^ S8(crc);
69 crc ^= aligned_read32ne(buf)
[all...] |
| crc32_loongarch.h | 22 int32_t crc = (int32_t)~crc_unsigned; local
28 crc = __crc_w_b_w((int8_t)*buf++, crc);
31 crc = __crc_w_h_w((int16_t)aligned_read16le(buf), crc);
36 crc = __crc_w_w_w((int32_t)aligned_read32le(buf), crc);
44 crc = __crc_w_d_w((int64_t)aligned_read64le(buf), crc);
50 crc = __crc_w_w_w((int32_t)aligned_read32le(buf), crc)
[all...] |
| crc32_small.c | 56 lzma_crc32(const uint8_t *buf, size_t size, uint32_t crc)
62 crc = ~crc;
65 crc = lzma_crc32_table[0][*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
69 return ~crc;
|
| crc64_small.c | 43 lzma_crc64(const uint8_t *buf, size_t size, uint64_t crc)
49 crc = ~crc;
52 crc = crc64_table[*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
56 return ~crc;
|
| crc64_fast.c | 37 const uint8_t *buf, size_t size, uint64_t crc);
49 lzma_crc64_generic(const uint8_t *buf, size_t size, uint64_t crc)
51 crc = ~crc;
54 crc = byteswap64(crc);
59 crc = lzma_crc64_table[0][*buf++ ^ A1(crc)] ^ S8(crc);
68 const uint32_t tmp = (uint32_t)(crc >> 32
[all...] |
| crc32_arm64.h | 17 // MSVC always has the CRC intrinsics available when building for ARM64
41 # define crc_attr_target __attribute__((__target__("+crc")))
49 crc32_arch_optimized(const uint8_t *buf, size_t size, uint32_t crc)
51 crc = ~crc;
59 crc = __crc32b(crc, *buf++);
62 crc = __crc32h(crc, aligned_read16le(buf));
67 crc = __crc32w(crc, aligned_read32le(buf))
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_debugfs_crc.c | 48 * DOC: CRC ABI
50 * DRM device drivers can provide to userspace CRC information of each frame as
51 * it reached a given hardware component (a CRC sampling "source").
54 * file dri/0/crtc-N/crc/control in debugfs, with N being the index of the CRTC.
59 * Once frame CRC generation is enabled, userspace can capture them by reading
60 * the dri/0/crtc-N/crc/data file. Each line in that file contains the frame
62 * containing the CRC data. Fields are separated by a single space and the number
63 * of CRC fields is source-specific.
65 * Note that though in some cases the CRC is computed in a specified way and on
66 * the frame contents as supplied by userspace (eDP 1.3), in general the CRC
130 struct drm_crtc_crc *crc = &crtc->crc; local
201 struct drm_crtc_crc *crc = &crtc->crc; local
264 struct drm_crtc_crc *crc = &crtc->crc; local
291 struct drm_crtc_crc *crc = &crtc->crc; local
350 struct drm_crtc_crc *crc = &crtc->crc; local
399 struct drm_crtc_crc *crc = &crtc->crc; local
[all...] |
| /src/sys/dev/nand/ |
| nand_crc.c | 34 /* Implements CRC-16 as required by the ONFI 2.3 specification */
47 uint16_t crc = init; local
52 crc ^= data[i] << 8;
55 if ((crc & highbit) != 0x00)
56 crc = (crc << 1) ^ polynom;
58 crc <<= 1;
62 return crc;
|
| /src/crypto/external/bsd/heimdal/dist/lib/krb5/ |
| crc.c | 1 /* $NetBSD: crc.c,v 1.2 2017/01/28 21:31:49 christos Exp $ */
46 unsigned long crc, poly; local
52 crc = i;
54 if (crc & 1) {
55 crc = (crc >> 1) ^ poly;
57 crc >>= 1;
60 table[i] = crc;
|
| /src/external/mpl/bind/dist/lib/isc/include/isc/ |
| crc64.h | 30 isc_crc64_init(uint64_t *crc);
32 * Initialize a new CRC.
35 * * 'crc' is not NULL.
39 isc_crc64_update(uint64_t *crc, const void *data, size_t len);
41 * Add data to the CRC.
44 * * 'crc' is not NULL.
49 isc_crc64_final(uint64_t *crc);
51 * Finalize the CRC.
54 * * 'crc' is not NULL.
|
| /src/common/dist/zlib/contrib/crc32vx/ |
| crc32_vx_hooks.h | 5 * CRC HOOKS
7 ZLIB_INTERNAL extern unsigned long (*crc32_z_hook)(unsigned long crc, const unsigned char FAR *buf, z_size_t len);
|
| /src/external/mpl/dhcp/bind/dist/lib/isc/include/isc/ |
| crc64.h | 31 isc_crc64_init(uint64_t *crc);
33 * Initialize a new CRC.
36 * * 'crc' is not NULL.
40 isc_crc64_update(uint64_t *crc, const void *data, size_t len);
42 * Add data to the CRC.
45 * * 'crc' is not NULL.
50 isc_crc64_final(uint64_t *crc);
52 * Finalize the CRC.
55 * * 'crc' is not NULL.
|
| /src/distrib/utils/sparkcrc/ |
| sparkcrc.c | 42 * Trivial progarm to generate a crc suitable for use in a sparkive file
87 int crc = 0; local
97 crc = (crc >> 8) ^ crclookup[(crc & 0xff) ^ buf[i]];
100 printf("%d\n", (int)crc);
|
| /src/external/mpl/bind/dist/tests/isc/ |
| crc64_test.c | 38 uint64_t crc; local
40 isc_crc64_init(&crc);
41 assert_int_equal(crc, 0xffffffffffffffffUL);
46 uint64_t crc; local
48 isc_crc64_init(&crc);
49 assert_int_equal(crc, 0xffffffffffffffffUL);
52 isc_crc64_update(&crc, buf, buflen);
55 isc_crc64_final(&crc);
58 snprintf(hex, sizeof(hex), "%016" PRIX64, crc);
|
| /src/usr.bin/cksum/ |
| crc_extern.h | 35 int crc(int, uint32_t *, off_t *);
|
| /src/common/dist/zlib/ |
| crc32.c | 3 /* crc32.c -- compute the CRC-32 of a data stream
7 * This interleaved implementation of a CRC makes use of pipelined multiple
9 * Kadatch and Jenkins (2010). See doc/crc-doc.1.0.pdf in this distribution.
17 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
42 A CRC of a message is computed on N braids of words in the message, where
48 into a single CRC at the end. For this code, N must be in the range 1..6 and
146 * Table of powers of x for combining CRC-32s, filled in by make_crc_table()
152 * Tables for byte-wise and braided CRC-32 calculations, and a table of powers
153 * of x for combining CRC-32s, all made by make_crc_table().
158 /* CRC polynomial. *
[all...] |
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/digest/ |
| crc.d | 10 $(TR $(TDNW Template API) $(TD $(MYREF CRC) $(MYREF CRC32) $(MYREF CRC64ECMA) $(MYREF CRC64ISO)
39 * $(LINK2 http://en.wikipedia.org/wiki/Cyclic_redundancy_check, Wikipedia on CRC)
41 * Source: $(PHOBOSSRC std/digest/crc.d)
59 module std.digest.crc;
67 import std.digest.crc;
74 CRC32 crc;
75 crc.put(data[]);
76 crc.start(); //Start again
77 crc.put(data[]);
78 hash = crc.finish()
[all...] |
| /src/external/gpl3/binutils/dist/zlib/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
5 * This interleaved implementation of a CRC makes use of pipelined multiple
7 * Kadatch and Jenkins (2010). See doc/crc-doc.1.0.pdf in this distribution.
15 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
33 A CRC of a message is computed on N braids of words in the message, where
39 into a single CRC at the end. For this code, N must be in the range 1..6 and
136 * Table of powers of x for combining CRC-32s, filled in by make_crc_table()
142 * Tables for byte-wise and braided CRC-32 calculations, and a table of powers
143 * of x for combining CRC-32s, all made by make_crc_table().
148 /* CRC polynomial. *
[all...] |
| /src/external/gpl3/gdb/dist/zlib/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
5 * This interleaved implementation of a CRC makes use of pipelined multiple
7 * Kadatch and Jenkins (2010). See doc/crc-doc.1.0.pdf in this distribution.
15 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
33 A CRC of a message is computed on N braids of words in the message, where
39 into a single CRC at the end. For this code, N must be in the range 1..6 and
136 * Table of powers of x for combining CRC-32s, filled in by make_crc_table()
142 * Tables for byte-wise and braided CRC-32 calculations, and a table of powers
143 * of x for combining CRC-32s, all made by make_crc_table().
148 /* CRC polynomial. *
[all...] |
| /src/sys/ufs/chfs/ |
| ebh_media.h | 55 /* sizeof(crc) + sizeof(lid) */
83 * @crc: CRC32 sum
93 * Invalidated eraseblock header means that the @crc and @lid is set to 0.
96 le32 crc; member in struct:chfs_nor_eb_hdr
102 * @crc: CRC32 sum
111 le32 crc; member in struct:chfs_nand_eb_hdr
|
| /src/external/mpl/bind/dist/lib/isc/ |
| crc64.c | 117 isc_crc64_init(uint64_t *crc) {
118 REQUIRE(crc != NULL);
120 *crc = 0xffffffffffffffffULL;
124 isc_crc64_update(uint64_t *crc, const void *data, size_t len) {
128 REQUIRE(crc != NULL);
132 i = ((int)(*crc >> 56) ^ *p++) & 0xff;
133 *crc = crc64_table[i] ^ (*crc << 8);
138 isc_crc64_final(uint64_t *crc) {
139 REQUIRE(crc != NULL)
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| crc64.c | 117 isc_crc64_init(uint64_t *crc) {
118 REQUIRE(crc != NULL);
120 *crc = 0xffffffffffffffffULL;
124 isc_crc64_update(uint64_t *crc, const void *data, size_t len) {
128 REQUIRE(crc != NULL);
132 i = ((int)(*crc >> 56) ^ *p++) & 0xff;
133 *crc = crc64_table[i] ^ (*crc << 8);
138 isc_crc64_final(uint64_t *crc) {
139 REQUIRE(crc != NULL)
[all...] |
| /src/external/gpl3/binutils.old/dist/zlib/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
5 * This interleaved implementation of a CRC makes use of pipelined multiple
7 * Kadatch and Jenkins (2010). See doc/crc-doc.1.0.pdf in this distribution.
15 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
33 A CRC of a message is computed on N braids of words in the message, where
39 into a single CRC at the end. For this code, N must be in the range 1..6 and
140 /* CRC polynomial. */
249 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
257 byte 0xb1 is the polynomial x^7+x^3+x^2+1), then the CRC is (q*x^32) mod p,
268 The table is simply the CRC of all possible eight bit values. This is all th
[all...] |
