Lines Matching refs:old_top_
43 old_top_(NULL),
68 old_top_ = old_start_ =
114 old_start_ = old_top_ = old_limit_ = old_reserved_limit_ = NULL;
157 for (Address* read = old_start_; read < old_top_; read++) {
166 old_top_ = write;
171 while (old_limit_ - old_top_ < space_needed &&
180 if (old_limit_ - old_top_ >= space_needed) return;
201 if (old_limit_ - old_top_ > old_top_ - old_start_) return;
219 ASSERT(i != 0 || old_top_ == old_start_);
220 if (old_limit_ - old_top_ > old_top_ - old_start_) return;
236 for (Address* p = old_start_; p < old_top_; p += prime_sample_step) {
262 for (Address* p = old_start_; p < old_top_; p++) {
275 old_top_ = new_top;
287 old_top_ - old_start_,
288 sizeof(*old_top_),
345 for (Address* current = old_top_ - 1; current >= old_start_; current--) {
583 Address* limit = old_top_;
584 old_top_ = old_start_;
589 Address* saved_top = old_top_;
600 ASSERT(old_top_ == saved_top + 1 || old_top_ == saved_top);
707 *old_top_++ = reinterpret_cast<Address>(int_addr << kPointerSizeLog2);
708 ASSERT(old_top_ <= old_limit_);
