| /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/public-domain/xz/dist/src/liblzma/check/ |
| crc64_fast.c | 30 lzma_crc64(const uint8_t *buf, size_t size, uint64_t crc)
32 crc = ~crc;
35 crc = bswap64(crc);
40 crc = lzma_crc64_table[0][*buf++ ^ A1(crc)] ^ S8(crc);
49 const uint32_t tmp = (crc >> 32)
52 const uint32_t tmp = crc ^ *(const uint32_t *)(buf)
[all...] |
| crc32_fast.c | 27 lzma_crc32(const uint8_t *buf, size_t size, uint32_t crc)
29 crc = ~crc;
32 crc = bswap32(crc);
39 crc = lzma_crc32_table[0][*buf++ ^ A(crc)] ^ S8(crc);
52 crc ^= *(const uint32_t *)(buf);
55 crc = lzma_crc32_table[7][A(crc)
[all...] |
| crc32_small.c | 49 lzma_crc32(const uint8_t *buf, size_t size, uint32_t crc)
53 crc = ~crc;
56 crc = lzma_crc32_table[0][*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
60 return ~crc;
|
| crc64_small.c | 41 lzma_crc64(const uint8_t *buf, size_t size, uint64_t crc)
45 crc = ~crc;
48 crc = crc64_table[*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
52 return ~crc;
|
| /src/external/public-domain/xz/dist/tests/ |
| test_check.c | 28 uint32_t crc = lzma_crc32(test_string, sizeof(test_string), 0); local
29 if (crc != test_vector)
33 crc = lzma_crc32(test_unaligned + 3, sizeof(test_string), 0);
34 if (crc != test_vector)
38 crc = 0;
40 crc = lzma_crc32(test_string + i, 1, crc);
41 if (crc != test_vector)
54 uint64_t crc = lzma_crc64(test_string, sizeof(test_string), 0); local
55 if (crc != test_vector
[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/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/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/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/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
35 A CRC of a message is computed on N braids of words in the message, where
41 into a single CRC at the end. For this code, N must be in the range 1..6 and
138 * Table of powers of x for combining CRC-32s, filled in by make_crc_table()
144 * Tables for byte-wise and braided CRC-32 calculations, and a table of powers
145 * of x for combining CRC-32s, all made by make_crc_table().
150 /* CRC polynomial. *
[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/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...] |
| /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
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...] |
| /src/external/gpl3/gdb.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...] |
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| crc32.c | 6 /* crc32.c -- compute the CRC-32 of a data stream
11 * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
22 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
59 /* Definitions for doing the crc four data bytes at a time. */
72 /* Local functions for crc concatenation */
86 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
94 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
105 The first table is simply the CRC of all possible eight bit values. This is
107 combinations of CRC register values and incoming bytes. The remaining tables
108 allow for word-at-a-time CRC calculation for both big-endian and little
[all...] |
