Method fullProbe

bolt/exec/HashTable.cpp:193–285

template <Operation op, typename Compare, typename Insert, typename Table>
char* ProbeState::fullProbe(
    Table& table,
    int32_t firstKey,
    Compare compare,
    Insert insert,
    int64_t& numTombstones,
    bool extraCheck,
    TableInsertPartitionInfo* partitionInfo) {
  BOLT_DCHECK(partitionInfo == nullptr || op == Operation::kInsert);

  // if firstProbe have load hited group
  if (group_ && compare(group_, row_)) {
    if (op == Operation::kErase) {
      eraseHit(table, numTombstones);
    }
    table.incrementHits();
    return group_;
  }

  auto* alreadyChecked = group_;
  if (extraCheck) {
    tagsInTable_ = table.loadTags(bucketOffset_);
    hits_ = simd::toBitMask(tagsInTable_ == wantedTags_);
  }

  const int64_t startBucketOffset = bucketOffset_;
  int64_t insertBucketOffset = -1;
  const auto kEmptyGroup = BaseHashTable::TagVector::broadcast(0);
  const auto kTombstoneGroup =
      BaseHashTable::TagVector::broadcast(kTombstoneTag);
  for (int64_t numProbedBuckets = 0; numProbedBuckets < table.numBuckets();
       ++numProbedBuckets) {
    if constexpr (op == Operation::kInsert) {
      if (partitionInfo != nullptr) {
        if (FOLLY_UNLIKELY(!partitionInfo->inRange(bucketOffset_))) {
          // If we have passed the partition boundary, then call insert to put
          // row in overflows.
          return insert(row_, bucketOffset_);
        }
        if (FOLLY_UNLIKELY(
                (bucketOffset_ <= startBucketOffset) &&
                (numProbedBuckets > 0))) {
          // If this is the last bucket and wrap around, then call insert to
          // put row in overflows.
          return insert(row_, partitionInfo->end);
        }
      }
    }

    while (hits_ > 0) {
      loadNextHit<op>(table, firstKey);
      if (!(extraCheck && group_ == alreadyChecked) && compare(group_, row_)) {
        if (op == Operation::kErase) {
          eraseHit(table, numTombstones);
        }
        table.incrementHits();
        return group_;
      }