/external/flac/libFLAC/include/private/ |
crc.h | 37 /* 8 bit CRC generator, MSB shifted first 42 #define FLAC__CRC8_UPDATE(data, crc) (crc) = FLAC__crc8_table[(crc) ^ (data)]; 43 void FLAC__crc8_update(const FLAC__byte data, FLAC__uint8 *crc); 44 void FLAC__crc8_update_block(const FLAC__byte *data, unsigned len, FLAC__uint8 *crc); 47 /* 16 bit CRC generator, MSB shifted first 53 #define FLAC__CRC16_UPDATE(data, crc) (((((crc)<<8) & 0xffff) ^ FLAC__crc16_table[((crc)>>8) ^ (data)]) [all...] |
/external/apache-harmony/archive/src/test/java/org/apache/harmony/archive/tests/java/util/zip/ |
CRC32Test.java | 28 CRC32 crc = new CRC32(); local 29 assertEquals("Constructor of CRC32 failed", 0, crc.getValue()); 37 CRC32 crc = new CRC32(); local 39 0, crc.getValue()); 41 crc.reset(); 42 crc.update(Integer.MAX_VALUE); 43 // System.out.print("value of crc " + crc.getValue()); 44 // Ran JDK and discovered that the value of the CRC should be 47 4278190080L, crc.getValue()) 75 CRC32 crc = new CRC32(); local 93 CRC32 crc = new CRC32(); local 124 CRC32 crc = new CRC32(); local 148 CRC32 crc = new CRC32(); local [all...] |
/frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
pvmp3_crc.cpp | 46 uint32 *crc, memory location holding calculated crc value 47 uint32 crc_enabled flag to enable/disable crc checking 56 uint32 length, number of element upon the crc will be calculated 57 uint32 *crc, memory location holding calculated crc value 125 uint32 *crc, 132 calculate_crc(bits, neededBits, crc); 143 uint32 *crc) 150 carry = *crc & 0x8000 [all...] |
pvmp3_decode_header.h | 91 uint32 *crc);
|
pvmp3_get_side_info.h | 92 uint32 *crc);
|
pvmp3_crc.h | 86 uint32 *crc, 92 uint32 *crc);
|
/libcore/luni/src/main/java/java/util/zip/ |
CRC32.java | 28 private long crc = 0L; field in class:CRC32 38 return crc; 45 tbytes = crc = 0; 56 crc = updateByteImpl((byte) val, crc); 76 crc = updateImpl(buf, offset, byteCount, crc);
|
/system/core/libsparse/ |
sparse_crc32.h | 19 uint32_t sparse_crc32(uint32_t crc, const void *buf, size_t size);
|
/external/e2fsprogs/lib/ext2fs/ |
crc16.h | 2 * crc16.h - CRC-16 routine 4 * Implements the standard CRC-16: 20 * unsigned int for holding the CRC value to avoid this. 24 extern crc16_t ext2fs_crc16(crc16_t crc, const void *buffer, unsigned int len);
|
/external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
crc.h | 12 * crc.h 26 * This function returns a 32 bit CRC checksum of a bit stream 33 * - crc : checksum 42 WebRtc_UWord32* crc);
|
/external/e2fsprogs/e2fsck/ |
crc32.c | 58 * @crc: seed value for computation. ~0 for Ethernet, sometimes 0 for 60 * @p: pointer to buffer over which CRC is run 63 __u32 crc32_le(__u32 crc, unsigned char const *p, size_t len); 71 __u32 crc32_le(__u32 crc, unsigned char const *p, size_t len) 75 crc ^= *p++; 77 crc = (crc >> 1) ^ ((crc & 1) ? CRCPOLY_LE : 0); 79 return crc; 83 __u32 crc32_le(__u32 crc, unsigned char const *p, size_t len [all...] |
gen_crc32table.c | 27 * crc is the crc of the byte i; other entries are filled in based on the 34 uint32_t crc = 1; local 39 crc = (crc >> 1) ^ ((crc & 1) ? CRCPOLY_LE : 0); 41 crc32table_le[i + j] = crc ^ crc32table_le[j]; 51 uint32_t crc = 0x80000000; local 56 crc = (crc << 1) ^ ((crc & 0x80000000) ? CRCPOLY_BE : 0) [all...] |
/external/webkit/Tools/DumpRenderTree/ |
CyclicRedundancyCheck.cpp | 59 unsigned crc = 0xffffffffL; local 61 crc = crcTable[(crc ^ buffer[i]) & 0xff] ^ ((crc >> 8) & 0x00ffffffL); 62 return crc ^ 0xffffffffL;
|
/external/valgrind/main/none/tests/amd64/ |
crc32.c | 15 UInt i, crc = (b & 0xFF) ^ crcIn; local 17 crc = (crc >> 1) ^ ((crc & 1) ? 0x82f63b78 : 0); 18 return crc; 23 UInt i, crc = (w & 0xFFFF) ^ crcIn; local 25 crc = (crc >> 1) ^ ((crc & 1) ? 0x82f63b78 : 0); 26 return crc; 31 UInt i, crc = l ^ crcIn; local 39 UInt crc = do_s_crc32l(crcIn, (UInt)q); local 151 UInt crc = 0xFFFFFFFF; local 158 UInt crc = 0xFFFFFFFF; local 165 UInt crc = 0xFFFFFFFF; local 172 UInt crc = 0xFFFFFFFF; local [all...] |
/external/elfutils/lib/ |
crc32_file.c | 59 uint32_t crc = 0; local 84 *resp = crc32 (crc, mapped, st.st_size); 88 crc = crc32 (crc, mapped, mapsize); 101 crc = crc32 (crc, buffer, count); 104 *resp = crc;
|
/external/srec/portable/include/ |
pcrc.h | 35 * Computes the CRC-encoding of the block of data. 37 * @param data The data on which to compute the CRC 39 * @return the CRC of the data. 45 * Computes the CRC-encoding of a string. 47 * @param str The string for which to compute the CRC 48 * @return the CRC of the string. 60 * Updates the CRC when adding a new byte. 62 * @param crc The initial crc value. 63 * @param data datum to append to the crc [all...] |
/libcore/benchmarks/src/benchmarks/regression/ |
ChecksumBenchmark.java | 41 CRC32 crc = new CRC32(); local 43 crc.update(bytes); 47 CRC32 crc = new CRC32(); local 49 crc.update(1);
|
/libcore/luni/src/main/native/ |
java_util_zip_Adler32.cpp | 26 static jlong Adler32_updateImpl(JNIEnv* env, jobject, jbyteArray byteArray, int off, int len, jlong crc) { 31 return adler32(crc, reinterpret_cast<const Bytef*>(bytes.get() + off), len); 34 static jlong Adler32_updateByteImpl(JNIEnv*, jobject, jint val, jlong crc) { 36 return adler32(crc, reinterpret_cast<const Bytef*>(&bytefVal), 1);
|
java_util_zip_CRC32.cpp | 26 static jlong CRC32_updateImpl(JNIEnv* env, jobject, jbyteArray byteArray, int off, int len, jlong crc) { 31 jlong result = crc32(crc, reinterpret_cast<const Bytef*>(bytes.get() + off), len); 35 static jlong CRC32_updateByteImpl(JNIEnv*, jobject, jbyte val, jlong crc) { 36 return crc32(crc, reinterpret_cast<const Bytef*>(&val), 1);
|
/system/core/libsparse/include/sparse/ |
sparse.h | 146 * @crc - append a crc chunk 152 * sparse files. If crc is true, the crc of the expanded data will be 153 * calculated and appended in a crc chunk. 158 bool crc); 165 * @crc - append a crc chunk 172 int64_t sparse_file_len(struct sparse_file *s, bool sparse, bool crc); 179 * @crc - append a crc chun [all...] |
/external/jsilver/src/com/google/clearsilver/jsilver/functions/string/ |
CrcFunction.java | 28 * Returns the CRC-32 of a string. 34 * @return CRC-32 of string as number value 38 // This function produces a 'standard' CRC-32 (IV -1, reflected polynomial, 39 // and final complement step). The CRC-32 of "123456789" is 0xCBF43926. 40 Checksum crc = new CRC32(); local 47 crc.update(b, 0, b.length); 49 // CRC fits into 32 bits by definition. 50 return literalConstant((int) crc.getValue(), args[0]);
|
/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);
|
/dalvik/vm/analysis/ |
DexPrepare.h | 94 u4 modWhen, u4 crc, bool isBootstrap, bool* pNewFile, bool createIfMissing); 109 u4 crc, bool expectVerify, bool expectOpt); 118 const char* fileName, u4 modWhen, u4 crc, bool isBootstrap); 124 const char* fileName, u4 modWhen, u4 crc, bool isBootstrap);
|
/external/qemu/distrib/zlib-1.2.3/ |
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/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...] |