Lines Matching defs:kValuebits
44 // kKeybits - kHashbits, and the values are bit strings of length kValuebits.
65 // for a cache entry is (kKeybits - kHashbits) + kValuebits. Suppose
66 // kKeybits + kValuebits is 43. Then it probably makes sense to
69 // On the other hand, suppose kKeybits = kValuebits = 64. Then
126 // 2^kKeybits and the values to be less than 2^kValuebits. The size of
135 static const size_t kValuebits = 8;
139 COMPILE_ASSERT(kValuebits <= sizeof(V) * 8, value_size);
141 COMPILE_ASSERT(kKeybits - kHashbits + kValuebits <= kTbits,
186 // part of the key, and kValuebits determines where in the entry to put
189 const int shift = kHashbits - kValuebits;
190 // Assume kHashbits >= kValuebits. It would be easy to lift this assumption.
198 const int shift = kHashbits - kValuebits;
199 // Assume kHashbits >= kValuebits. It would be easy to lift this assumption.
219 static const T kUpperMask = N_ONES_(T, kUpperbits) << kValuebits;
222 static const V kValueMask = N_ONES_(V, kValuebits);
