186   if (last_known_previous_state_.top_index >= segment_state_.top_index ||  in RecoverHoles()
187       last_known_previous_state_.top_index < prev_state.top_index) {  in RecoverHoles()
188     const size_t top_index = segment_state_.top_index;  in RecoverHoles()  local
189     size_t count = CountNullEntries(table_, prev_state.top_index, top_index);  in RecoverHoles()
193                 << " Current prev=" << prev_state.top_index  in RecoverHoles()
194                 << " Current top_index=" << top_index  in RecoverHoles()
212     size_t count = CountNullEntries(table, prev_state.top_index, cur_state.top_index);  in CheckHoleCount()
213     CHECK_EQ(exp_num_holes, count) << "prevState=" << prev_state.top_index  in CheckHoleCount()
214                                    << " topIndex=" << cur_state.top_index;  in CheckHoleCount()
252     LOG(INFO) << "+++ Add: previous_state=" << previous_state.top_index  in Add()
253               << " top_index=" << segment_state_.top_index  in Add()
254               << " last_known_prev_top_index=" << last_known_previous_state_.top_index  in Add()
258   size_t top_index = segment_state_.top_index;  in Add()  local
264   if (top_index == max_entries_) {  in Add()
306     DCHECK_GT(top_index, 1U);  in Add()
308     IrtEntry* p_scan = &table_[top_index - 1];  in Add()
312       DCHECK_GE(p_scan, table_ + previous_state.top_index);  in Add()
319     index = top_index++;  in Add()
320     segment_state_.top_index = top_index;  in Add()
325     LOG(INFO) << "+++ added at " << ExtractIndex(result) << " top=" << segment_state_.top_index  in Add()
353     LOG(INFO) << "+++ Remove: previous_state=" << previous_state.top_index  in Remove()
354               << " top_index=" << segment_state_.top_index  in Remove()
355               << " last_known_prev_top_index=" << last_known_previous_state_.top_index  in Remove()
359   const uint32_t top_index = segment_state_.top_index;  in Remove()  local
360   const uint32_t bottom_index = previous_state.top_index;  in Remove()
387                  << " vs " << bottom_index << "-" << top_index << ")";  in Remove()
390   if (idx >= top_index) {  in Remove()
393                  << " (bottom=" << bottom_index << " top=" << top_index << ")";  in Remove()
400   if (idx == top_index - 1) {  in Remove()
409       uint32_t collapse_top_index = top_index;  in Remove()
425       segment_state_.top_index = collapse_top_index;  in Remove()
429       segment_state_.top_index = top_index - 1;  in Remove()
431         LOG(INFO) << "+++ ate last entry " << top_index - 1;  in Remove()
458   const size_t top_index = Capacity();  in Trim()  local
459   uint8_t* release_start = AlignUp(reinterpret_cast<uint8_t*>(&table_[top_index]), kPageSize);  in Trim()
493               << segment_state_.top_index  in SetSegmentState()
495               << new_state.top_index;  in SetSegmentState()
501   size_t top_index = segment_state_.top_index;  in EnsureFreeCapacity()  local
502   if (top_index < max_entries_ && top_index + free_capacity <= max_entries_) {  in EnsureFreeCapacity()
515   if (std::numeric_limits<size_t>::max() - free_capacity < top_index) {  in EnsureFreeCapacity()
520   if (!Resize(top_index + free_capacity, error_msg)) {  in EnsureFreeCapacity()
531   return max_entries_ - segment_state_.top_index;  in FreeCapacity()