181   if (last_known_previous_state_.top_index >= segment_state_.top_index ||  in RecoverHoles()
182       last_known_previous_state_.top_index < prev_state.top_index) {  in RecoverHoles()
183     const size_t top_index = segment_state_.top_index;  in RecoverHoles()  local
184     size_t count = CountNullEntries(table_, prev_state.top_index, top_index);  in RecoverHoles()
188                 << " Current prev=" << prev_state.top_index  in RecoverHoles()
189                 << " Current top_index=" << top_index  in RecoverHoles()
207     size_t count = CountNullEntries(table, prev_state.top_index, cur_state.top_index);  in CheckHoleCount()
208     CHECK_EQ(exp_num_holes, count) << "prevState=" << prev_state.top_index  in CheckHoleCount()
209                                    << " topIndex=" << cur_state.top_index;  in CheckHoleCount()
245     LOG(INFO) << "+++ Add: previous_state=" << previous_state.top_index  in Add()
246               << " top_index=" << segment_state_.top_index  in Add()
247               << " last_known_prev_top_index=" << last_known_previous_state_.top_index  in Add()
251   size_t top_index = segment_state_.top_index;  in Add()  local
257   if (top_index == max_entries_) {  in Add()
299     DCHECK_GT(top_index, 1U);  in Add()
301     IrtEntry* p_scan = &table_[top_index - 1];  in Add()
305       DCHECK_GE(p_scan, table_ + previous_state.top_index);  in Add()
312     index = top_index++;  in Add()
313     segment_state_.top_index = top_index;  in Add()
318     LOG(INFO) << "+++ added at " << ExtractIndex(result) << " top=" << segment_state_.top_index  in Add()
346     LOG(INFO) << "+++ Remove: previous_state=" << previous_state.top_index  in Remove()
347               << " top_index=" << segment_state_.top_index  in Remove()
348               << " last_known_prev_top_index=" << last_known_previous_state_.top_index  in Remove()
352   const uint32_t top_index = segment_state_.top_index;  in Remove()  local
353   const uint32_t bottom_index = previous_state.top_index;  in Remove()
376                  << " vs " << bottom_index << "-" << top_index << ")";  in Remove()
379   if (idx >= top_index) {  in Remove()
382                  << " (bottom=" << bottom_index << " top=" << top_index << ")";  in Remove()
389   if (idx == top_index - 1) {  in Remove()
398       uint32_t collapse_top_index = top_index;  in Remove()
414       segment_state_.top_index = collapse_top_index;  in Remove()
418       segment_state_.top_index = top_index - 1;  in Remove()
420         LOG(INFO) << "+++ ate last entry " << top_index - 1;  in Remove()
447   const size_t top_index = Capacity();  in Trim()  local
448   auto* release_start = AlignUp(reinterpret_cast<uint8_t*>(&table_[top_index]), kPageSize);  in Trim()
479               << segment_state_.top_index  in SetSegmentState()
481               << new_state.top_index;  in SetSegmentState()
487   size_t top_index = segment_state_.top_index;  in EnsureFreeCapacity()  local
488   if (top_index < max_entries_ && top_index + free_capacity <= max_entries_) {  in EnsureFreeCapacity()
501   if (std::numeric_limits<size_t>::max() - free_capacity < top_index) {  in EnsureFreeCapacity()
506   if (!Resize(top_index + free_capacity, error_msg)) {  in EnsureFreeCapacity()
517   return max_entries_ - segment_state_.top_index;  in FreeCapacity()