| /libcore/luni/src/test/java/libcore/java/util/zip/ |
| OldAndroidChecksumTest.java | 56 CRC32 crc = new CRC32(); local
59 crc.update(values);
60 assertEquals(crc.getValue(), expected);
63 crc.reset();
65 crc.update(values[i]);
67 assertEquals(crc.getValue(), expected);
|
| /device/google/contexthub/util/nanotool/ |
| nanopacket.cpp | 23 // CRC constants.
32 // Computes the CRC of one word.
33 uint32_t Crc32Word(uint32_t crc, uint32_t data, int cnt) {
34 crc = crc ^ data;
37 crc = (crc << 4) ^ kCrcTable[crc >> 28];
40 return crc;
43 // Computes the CRC32 of a buffer given a starting CRC
46 uint32_t crc = kInitialCrc; local
104 uint32_t crc = Crc32(packet_buffer_.data(), required_buffer_size - 4); local
[all...] |
| /external/e2fsprogs/lib/ext2fs/ |
| csum.c | 63 __u32 crc; local
68 crc = ext2fs_mmp_csum(fs, mmp);
69 mmp->mmp_checksum = ext2fs_cpu_to_le32(crc);
112 __u32 flag, crc; local
122 crc = ext2fs_superblock_csum(fs, sb);
123 sb->s_checksum = ext2fs_cpu_to_le32(crc);
132 __u32 *crc)
139 *crc = ext2fs_crc32c_le(fs->csum_seed, (unsigned char *)&block,
141 *crc = ext2fs_crc32c_le(*crc, (unsigned char *)buf, fs->blocksize)
169 __u32 crc; local
344 __u32 crc; local
422 __u32 crc; local
536 __u32 crc; local
576 __u32 crc; local
614 __u32 crc; local
706 __u32 crc; local
729 __u16 crc = 0; local
[all...] |
| /external/lzma/CS/7zip/Common/ |
| CRC.cs | 1 // Common/CRC.cs
5 class CRC
9 static CRC()
44 CRC crc = new CRC();
45 // crc.Init();
46 crc.Update(data, offset, size);
47 return crc.GetDigest();
|
| /prebuilts/go/darwin-x86/src/hash/crc64/ |
| crc64_test.go | 22 {0x0, 0x0, "", "crc\x02s\xba\x84\x84\xbb\xcd]\xef\x00\x00\x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee\x00\x00\x00\x00\x00\x00\x00\x00"},
23 {0x3420000000000000, 0x330284772e652b05, "a", "crc\x02s\xba\x84\x84\xbb\xcd]\xef\x00\x00\x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee\x00\x00\x00\x00\x00\x00\x00\x00"},
24 {0x36c4200000000000, 0xbc6573200e84b046, "ab", "crc\x02s\xba\x84\x84\xbb\xcd]\xef4 \x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee3\x02\x84w.e+\x05"},
25 {0x3776c42000000000, 0x2cd8094a1a277627, "abc", "crc\x02s\xba\x84\x84\xbb\xcd]\xef4 \x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee3\x02\x84w.e+\x05"},
26 {0x336776c420000000, 0x3c9d28596e5960ba, "abcd", "crc\x02s\xba\x84\x84\xbb\xcd]\xef6\xc4 \x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee\xbces \x0e\x84\xb0F"}
[all...] |
| /prebuilts/go/linux-x86/src/hash/crc64/ |
| crc64_test.go | 22 {0x0, 0x0, "", "crc\x02s\xba\x84\x84\xbb\xcd]\xef\x00\x00\x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee\x00\x00\x00\x00\x00\x00\x00\x00"},
23 {0x3420000000000000, 0x330284772e652b05, "a", "crc\x02s\xba\x84\x84\xbb\xcd]\xef\x00\x00\x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee\x00\x00\x00\x00\x00\x00\x00\x00"},
24 {0x36c4200000000000, 0xbc6573200e84b046, "ab", "crc\x02s\xba\x84\x84\xbb\xcd]\xef4 \x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee3\x02\x84w.e+\x05"},
25 {0x3776c42000000000, 0x2cd8094a1a277627, "abc", "crc\x02s\xba\x84\x84\xbb\xcd]\xef4 \x00\x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee3\x02\x84w.e+\x05"},
26 {0x336776c420000000, 0x3c9d28596e5960ba, "abcd", "crc\x02s\xba\x84\x84\xbb\xcd]\xef6\xc4 \x00\x00\x00\x00\x00", "crc\x02`&\x9aR\xe1\xb7\xfee\xbces \x0e\x84\xb0F"}
[all...] |
| /libcore/ojluni/src/main/java/java/util/zip/ |
| ZipInputStream.java | 49 private CRC32 crc = new CRC32(); field in class:ZipInputStream
122 crc.reset();
208 crc.update(b, off, len);
227 crc.update(b, off, len);
229 if (remaining == 0 && entry.crc != crc.getValue()) {
231 "invalid entry CRC (expected 0x" + Long.toHexString(entry.crc) +
232 " but got 0x" + Long.toHexString(crc.getValue()) + ")");
325 e.crc = get32(tmpbuf, LOCCRC)
[all...] |
| /bionic/libc/kernel/uapi/linux/ |
| bcm933xx_hcs.h | 33 __u32 crc; member in struct:bcm_hcs
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
6 * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
17 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
54 /* Definitions for doing the crc four data bytes at a time. */
67 /* Local functions for crc concatenation */
81 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
89 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
100 The first table is simply the CRC of all possible eight bit values. This is
102 combinations of CRC register values and incoming bytes. The remaining tables
103 allow for word-at-a-time CRC calculation for both big-endian and little-
[all...] |
| /external/elfutils/libdwelf/ |
| libdwelf.h | 48 extern const char *dwelf_elf_gnu_debuglink (Elf *elf, GElf_Word *crc);
|
| /external/kernel-headers/original/uapi/linux/ |
| bcm933xx_hcs.h | 22 __u32 crc; member in struct:bcm_hcs
|
| /external/stressapptest/src/ |
| pattern.h | 34 // Pattern and CRC data structure
53 // Fill pattern data and calculate CRC.
68 const AdlerChecksum *crc() {return crc_;} function in class:Pattern
78 AdlerChecksum *crc_; // CRC of this pattern.
91 // Initialize pointers to global data patterns, and calculate CRC.
111 // value into a running CRC. This function should be fast, and
114 // This CRC formula may not be optimal, but it does work.
116 static inline uint32 CrcIncrement(uint32 crc, uint32 expected, int index) {
118 uint32 carry = (addition & crc) >> 31;
120 return crc + addition + carry
[all...] |
| /system/bt/embdrv/sbc/decoder/srce/ |
| framing.c | 49 * CRC-8 table for X^8 + X^4 + X^3 + X^2 + 1; byte-wise lookup
157 OI_UINT crc; local
160 crc = crc8_wide[idx >> 1];
162 crc &= 0xff;
164 crc >>= 8;
167 return crc;
171 OI_UINT crc; local
174 crc = crc8_wide[idx >> 1];
176 crc &= 0xff;
178 crc >>= 8
210 uint8_t crc = 0x0f; local
[all...] |
| /device/linaro/bootloader/edk2/EmbeddedPkg/Library/ZLib/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
6 * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
17 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
33 /* Definitions for doing the crc four data bytes at a time. */
47 /* Local functions for crc concatenation */
63 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
71 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
82 The first table is simply the CRC of all possible eight bit values. This is
84 combinations of CRC register values and incoming bytes. The remaining tables
85 allow for word-at-a-time CRC calculation for both big-endian and little
[all...] |
| /external/python/cpython3/Modules/zlib/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
6 * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
17 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
33 /* Definitions for doing the crc four data bytes at a time. */
47 /* Local functions for crc concatenation */
63 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
71 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
82 The first table is simply the CRC of all possible eight bit values. This is
84 combinations of CRC register values and incoming bytes. The remaining tables
85 allow for word-at-a-time CRC calculation for both big-endian and little
[all...] |
| /external/zlib/src/ |
| crc32.c | 1 /* crc32.c -- compute the CRC-32 of a data stream
6 * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
17 of the crc tables. Therefore, if you #define DYNAMIC_CRC_TABLE, you should
33 /* Definitions for doing the crc four data bytes at a time. */
47 /* Local functions for crc concatenation */
63 Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
71 byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
82 The first table is simply the CRC of all possible eight bit values. This is
84 combinations of CRC register values and incoming bytes. The remaining tables
85 allow for word-at-a-time CRC calculation for both big-endian and little
[all...] |
| /external/fio/t/ |
| verify-state.c | 15 #include "../crc/crc32c.h"
69 uint32_t crc; local
73 hdr->crc = le64_to_cpu(hdr->crc);
77 printf("CRC:\t\t0x%x\n", (unsigned int) hdr->crc);
86 crc = fio_crc32c((unsigned char *) s, hdr->size);
87 if (crc != hdr->crc) {
88 log_err("crc mismatch %x != %x\n", crc, (unsigned int) hdr->crc)
[all...] |
| /external/aac/libFDK/src/ |
| FDK_crc.cpp | 99 Description: CRC calculation
108 * \brief This table defines precalculated lookup tables for crc polynom x^16
143 * \brief This table defines precalculated lookup tables for crc polynom x^16
178 * \brief This table defines precalculated lookup tables for crc polynom x^16
230 /* crc polynom example:
322 * \brief Calculate crc bits.
324 * Calculate crc starting at current bitstream postion over nBits.
326 * \param pCrc Pointer to an outlying allocated crc info
329 * \param crcPoly Crc polynom in use.
339 USHORT crc = *pCrc; /* get crc value * local
379 USHORT crc = *pCrc; \/* get crc value *\/ local
428 USHORT crc = hCrcInfo->crcValue; local
[all...] |
| /prebuilts/go/darwin-x86/src/hash/crc32/ |
| crc32_amd64.go | 17 // and IEEE CRC.
22 func castagnoliSSE42(crc uint32, p []byte) uint32
36 func ieeeCLMUL(crc uint32, p []byte) uint32
57 // t[0][i] = CRC(i000, O)
58 // t[1][i] = CRC(0i00, O)
59 // t[2][i] = CRC(00i0, O)
60 // t[3][i] = CRC(000i, O)
73 // table given) with the given initial crc value. This corresponds to
74 // CRC(crc, O) in the description in updateCastagnoli
[all...] |
| crc32.go | 5 // Package crc32 implements the 32-bit cyclic redundancy check, or CRC-32,
21 // The size of a CRC-32 checksum in bytes.
26 // IEEE is by far and away the most common CRC-32 polynomial.
57 // archUpdateIEEE(crc uint32, p []byte) uint32
70 // archUpdateCastagnoli(crc uint32, p []byte) uint32
79 var updateCastagnoli func(crc uint32, p []byte) uint32
92 updateCastagnoli = func(crc uint32, p []byte) uint32 {
93 return slicingUpdate(crc, castagnoliTable8, p)
104 var updateIEEE func(crc uint32, p []byte) uint32
116 updateIEEE = func(crc uint32, p []byte) uint32
[all...] |
| crc32_amd64p32.go | 10 // CRC.
15 func castagnoliSSE42(crc uint32, p []byte) uint32
28 func archUpdateCastagnoli(crc uint32, p []byte) uint32 {
32 return castagnoliSSE42(crc, p)
37 func archUpdateIEEE(crc uint32, p []byte) uint32 { panic("not available") }
|
| /prebuilts/go/linux-x86/src/hash/crc32/ |
| crc32_amd64.go | 17 // and IEEE CRC.
22 func castagnoliSSE42(crc uint32, p []byte) uint32
36 func ieeeCLMUL(crc uint32, p []byte) uint32
57 // t[0][i] = CRC(i000, O)
58 // t[1][i] = CRC(0i00, O)
59 // t[2][i] = CRC(00i0, O)
60 // t[3][i] = CRC(000i, O)
73 // table given) with the given initial crc value. This corresponds to
74 // CRC(crc, O) in the description in updateCastagnoli
[all...] |
| crc32.go | 5 // Package crc32 implements the 32-bit cyclic redundancy check, or CRC-32,
21 // The size of a CRC-32 checksum in bytes.
26 // IEEE is by far and away the most common CRC-32 polynomial.
57 // archUpdateIEEE(crc uint32, p []byte) uint32
70 // archUpdateCastagnoli(crc uint32, p []byte) uint32
79 var updateCastagnoli func(crc uint32, p []byte) uint32
92 updateCastagnoli = func(crc uint32, p []byte) uint32 {
93 return slicingUpdate(crc, castagnoliTable8, p)
104 var updateIEEE func(crc uint32, p []byte) uint32
116 updateIEEE = func(crc uint32, p []byte) uint32
[all...] |
| crc32_amd64p32.go | 10 // CRC.
15 func castagnoliSSE42(crc uint32, p []byte) uint32
28 func archUpdateCastagnoli(crc uint32, p []byte) uint32 {
32 return castagnoliSSE42(crc, p)
37 func archUpdateIEEE(crc uint32, p []byte) uint32 { panic("not available") }
|
| /system/core/libsparse/ |
| output_file.h | 29 int gz, int sparse, int chunks, int crc);
32 int chunks, int crc);
|
