Lines Matching refs:kWidth
239 static constexpr size_t kWidth = 16; // the number of slots per group
246 BitMask<uint32_t, kWidth> Match(h2_t hash) const {
248 return BitMask<uint32_t, kWidth>(
253 BitMask<uint32_t, kWidth> MatchEmpty() const {
256 return BitMask<uint32_t, kWidth>(
264 BitMask<uint32_t, kWidth> MatchEmptyOrDeleted() const {
266 return BitMask<uint32_t, kWidth>(
297 static constexpr size_t kWidth = 16; // the number of slots per group
299 explicit GroupSse2Polyfill(const ctrl_t* pos) { memcpy(ctrl_, pos, kWidth); }
302 BitMask<uint32_t, kWidth> Match(h2_t hash) const {
304 for (size_t i = 0; i < kWidth; i++) {
309 return BitMask<uint32_t, kWidth>(mask);
313 BitMask<uint32_t, kWidth> MatchEmpty() const {
318 BitMask<uint32_t, kWidth> MatchEmptyOrDeleted() const {
319 return BitMask<uint32_t, kWidth>(MatchEmptyOrDeletedMask());
328 for (size_t i = 0; i < kWidth; i++) {
340 for (size_t i = 0; i < kWidth; i++) {
348 ctrl_t ctrl_[kWidth];
352 static constexpr size_t kWidth = 8; // the number of slots per group
362 BitMask<uint64_t, kWidth, 3> Match(h2_t hash) const {
377 return BitMask<uint64_t, kWidth, 3>((x - kLsbs) & ~x & kMsbs);
381 BitMask<uint64_t, kWidth, 3> MatchEmpty() const {
382 return BitMask<uint64_t, kWidth, 3>((ctrl & (~ctrl << 6)) & kMsbs);
386 BitMask<uint64_t, kWidth, 3> MatchEmptyOrDeleted() const {
387 return BitMask<uint64_t, kWidth, 3>((ctrl & (~ctrl << 7)) & kMsbs);