Lines Matching +full:32 +full:k
5 * produce the same thing and, for cases where a k-bit hash
26 /* 32-bit XORSHIFT generator. Seed must not be zero. */
71 int k; in test_int_hash() local
87 /* Test k = 1..32 bits */ in test_int_hash()
88 for (k = 1; k <= 32; k++) { in test_int_hash()
89 u32 const m = ((u32)2 << (k-1)) - 1; /* Low k bits set */ in test_int_hash()
92 hash_or[0][k] |= h1 = hash_32(h0, k); in test_int_hash()
94 pr_err("hash_32(%#x, %d) = %#x > %#x", h0, k, h1, m); in test_int_hash()
98 h2 = hash_32_generic(h0, k); in test_int_hash()
102 " = %#x", h0, k, h1, h2); in test_int_hash()
108 h0, k, h1, m); in test_int_hash()
114 hash_or[1][k] |= h1 = hash_64(h64, k); in test_int_hash()
116 pr_err("hash_64(%#llx, %d) = %#x > %#x", h64, k, h1, m); in test_int_hash()
120 h2 = hash_64_generic(h64, k); in test_int_hash()
124 "= %#x", h64, k, h1, h2); in test_int_hash()
130 h64, k, h1, m); in test_int_hash()
178 h64 = h64 << 32 | h0; /* For use with hash_64 */ in test_hash_init()
207 for (i = 1; i <= 32; i++) { in test_hash_init()