Lines Matching defs:topIndex
81 size_t topIndex = segment_state_.parts.topIndex;
90 if (topIndex == alloc_entries_) {
92 if (topIndex == max_entries_) {
127 DCHECK_GT(topIndex, 1U);
129 const mirror::Object** pScan = &table_[topIndex - 1];
132 DCHECK_GE(pScan, table_ + prevState.parts.topIndex);
140 UpdateSlotAdd(obj, topIndex);
141 result = ToIndirectRef(obj, topIndex);
142 table_[topIndex++] = obj;
143 segment_state_.parts.topIndex = topIndex;
146 LOG(INFO) << "+++ added at " << ExtractIndex(result) << " top=" << segment_state_.parts.topIndex
175 int topIndex = segment_state_.parts.topIndex;
177 if (UNLIKELY(idx >= topIndex)) {
179 << iref << " (index " << idx << " in a table of size " << topIndex << ")";
197 static int Find(mirror::Object* direct_pointer, int bottomIndex, int topIndex, const mirror::Object** table) {
198 for (int i = bottomIndex; i < topIndex; ++i) {
207 return Find(direct_pointer, 0, segment_state_.parts.topIndex, table_) != -1;
221 int topIndex = segment_state_.parts.topIndex;
222 int bottomIndex = prevState.parts.topIndex;
238 idx = Find(direct_pointer, bottomIndex, topIndex, table_);
248 << " vs " << bottomIndex << "-" << topIndex << ")";
251 if (idx >= topIndex) {
254 << " (bottom=" << bottomIndex << " top=" << topIndex << ")";
258 if (idx == topIndex-1) {
268 while (--topIndex > bottomIndex && numHoles != 0) {
270 LOG(INFO) << "+++ checking for hole at " << topIndex-1
271 << " (cookie=" << cookie << ") val=" << table_[topIndex - 1];
273 if (table_[topIndex-1] != NULL) {
277 LOG(INFO) << "+++ ate hole at " << (topIndex - 1);
282 segment_state_.parts.topIndex = topIndex;
284 segment_state_.parts.topIndex = topIndex-1;
286 LOG(INFO) << "+++ ate last entry " << topIndex - 1;
