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
130 // 2^kKeybits and the values to be less than 2^kValuebits. The size of
144 static const int kValuebits = 7;
145 static const bool kUseWholeKeys = kKeybits + kValuebits <= 8 * sizeof(T);
149 COMPILE_ASSERT(kValuebits <= sizeof(V) * 8, value_size);
151 COMPILE_ASSERT(kKeybits - kHashbits + kValuebits <= kTbits,
196 // part of the key, and kValuebits determines where in the entry to
200 return static_cast<T>(k) << kValuebits;
202 const int shift = kHashbits - kValuebits;
203 // Assume kHashbits >= kValuebits. It'd be easy to lift this assumption.
215 (entry >> kValuebits == key) :
226 static const T kUpperMask = N_ONES_(T, kUpperbits) << kValuebits;
229 static const V kValueMask = N_ONES_(V, kValuebits);
