Lines Matching refs:top
636 Top::MarkCompactPrologue(is_compacting);
644 Top::MarkCompactEpilogue(is_compacting);
694 ASSERT(reinterpret_cast<Address>(rear_) >= Heap::new_space()->top());
784 // We treat the top of the to space as a queue of addresses of
789 // There is guaranteed to be enough room at the top of the to space
791 // frees up its size in bytes from the top of the new space, and
821 ASSERT(new_space_front == new_space_.top());
824 new_space_.set_age_mark(new_space_.top());
877 ASSERT(new_space_front <= new_space_.top());
879 // The addresses new_space_front and new_space_.top() define a
882 while (new_space_front < new_space_.top()) {
912 } while (new_space_front < new_space_.top());
1112 // top of the to space to be swept and copied later. Write the
1137 // top of the to space to be swept and copied later. Write the
1939 Top::context()->mark_out_of_memory();
2042 Top::context()->mark_out_of_memory();
2063 Top::context()->mark_out_of_memory();
2329 Top::context()->global_context()->arguments_boilerplate();
3117 Top::PrintStack();
3378 Top::Iterate(v);
3379 v->Synchronize("top");
