- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 82 for cSrc (0.04 sec)
-
android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
} private static int referenceCrc(byte[] bytes) { int crc = ~0; for (byte b : bytes) { crc = (crc >>> 8) ^ Crc32cHashFunction.Crc32cHasher.BYTE_TABLE[(crc ^ b) & 0xFF]; } return ~crc; } /** * Verifies that the crc of an array of byte data matches the expected value. * * @param expectedCrc the expected crc value. * @param data the data to run the checksum on. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Dec 23 18:30:33 UTC 2020 - 6.5K bytes - Viewed (0) -
cmd/xl-storage-format-utils.go
// Seed (random) crc := uint64(0xc2b40bbac11a7295) // Xor each value to make order independent for k, v := range m { // Separate key and value with an individual xor with a random number. // Add values of each, so they cannot be trivially collided. crc ^= (xxh3.HashString(k) ^ 0x4ee3bbaf7ab2506b) + (xxh3.HashString(v) ^ 0x8da4c8da66194257) } return crc }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Jun 07 22:18:44 UTC 2024 - 5.5K bytes - Viewed (0) -
src/hash/crc32/crc32_amd64.s
// license that can be found in the LICENSE file. #include "textflag.h" // castagnoliSSE42 updates the (non-inverted) crc with the given buffer. // // func castagnoliSSE42(crc uint32, p []byte) uint32 TEXT ·castagnoliSSE42(SB),NOSPLIT,$0 MOVL crc+0(FP), AX // CRC value MOVQ p+8(FP), SI // data pointer MOVQ p_len+16(FP), CX // len(p) // If there are fewer than 8 bytes to process, skip alignment.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 01 21:52:00 UTC 2018 - 5.4K bytes - Viewed (0) -
src/compress/bzip2/bzip2.go
for i := range crctab { crc := uint32(i) << 24 for j := 0; j < 8; j++ { if crc&0x80000000 != 0 { crc = (crc << 1) ^ poly } else { crc <<= 1 } } crctab[i] = crc } } // updateCRC updates the crc value to incorporate the data in b. // The initial value is 0. func updateCRC(val uint32, b []byte) uint32 { crc := ^val for _, v := range b {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
src/hash/crc32/crc32_otherarch.go
func archInitIEEE() { panic("not available") } func archUpdateIEEE(crc uint32, p []byte) uint32 { panic("not available") } func archAvailableCastagnoli() bool { return false } func archInitCastagnoli() { panic("not available") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 681 bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Crc32cHashFunction.java
/* * The striding algorithm works roughly as follows: it is universally the case that * CRC(x ^ y) == CRC(x) ^ CRC(y). The approach we take is to break the message as follows, * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...) * and then to XOR them together. The STRIDE_TABLE enables us to hash an int followed by 12
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/Crc32cHashFunction.java
/* * The striding algorithm works roughly as follows: it is universally the case that * CRC(x ^ y) == CRC(x) ^ CRC(y). The approach we take is to break the message as follows, * with each letter representing a 4-byte word: ABCDABCDABCDABCD... and to calculate * CRC(A000A000A000...), CRC(0B000B000B...), CRC(00C000C000C...), CRC(000D000D000D...) * and then to XOR them together. The STRIDE_TABLE enables us to hash an int followed by 12
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 21.3K bytes - Viewed (0) -
cmd/xl-storage-format-v1.go
// Zero unimportant fields c.Erasure.Index = 0 c.Minio.Release = "" crc := hashDeterministicString(c.Meta) c.Meta = nil if bts, err := c.MarshalMsg(metaDataPoolGet()); err == nil { crc ^= xxhash.Sum64(bts) metaDataPoolPut(bts) } // Combine upper and lower part var tmp [4]byte binary.LittleEndian.PutUint32(tmp[:], uint32(crc^(crc>>32))) return tmp } // XL metadata constants. const (
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Apr 04 12:04:40 UTC 2024 - 8.2K bytes - Viewed (0) -
internal/grid/msg.go
} if m.Flags&FlagCRCxxh3 != 0 { const hashLen = 4 if len(h) < hashLen { return nil, nil, fmt.Errorf("want crc len 4, got %v", len(h)) } got := uint32(xxh3.Hash(b[:len(b)-hashLen])) want := binary.LittleEndian.Uint32(h[len(h)-hashLen:]) if got != want { return nil, nil, fmt.Errorf("crc mismatch: 0x%08x (given) != 0x%08x (bytes)", want, got) } h = h[:len(h)-hashLen] } // Extract subroute if any.
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Nov 28 19:22:29 UTC 2023 - 7.3K bytes - Viewed (0) -
src/image/png/reader.go
if string(d.tmp[4:8]) != "IDAT" { return 0, FormatError("not enough pixel data") } d.crc.Reset() d.crc.Write(d.tmp[4:8]) } if int(d.idatLength) < 0 { return 0, UnsupportedError("IDAT chunk length overflow") } n, err := d.r.Read(p[:min(len(p), int(d.idatLength))]) d.crc.Write(p[:n]) d.idatLength -= uint32(n) return n, err } // decode decodes the IDAT data into an image.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 26K bytes - Viewed (0)