Lines Matching refs:_mark_stack

6742   _mark_stack(mark_stack),
6764 assert(_mark_stack->isEmpty(), "pre-condition (eager drainage)");
6774 bool res = _mark_stack->push(obj);
6777 oop new_oop = _mark_stack->pop();
6787 } while (!_mark_stack->isEmpty() ||
6792 assert(_mark_stack->isEmpty(), "post-condition (eager drainage)");
7046 while (!_mark_stack->isEmpty()) {
7047 oop new_oop = _mark_stack->pop();
7106 assert(_mark_stack->isEmpty(), "pre-condition (eager drainage)");
7133 assert(_mark_stack->isEmpty(), "post-condition (eager drainage)");
7480 _mark_stack(mark_stack),
7484 assert(_mark_stack->isEmpty(), "stack should be empty");
7491 assert(_mark_stack->isEmpty(), "would cause duplicates on stack");
7506 assert(_mark_stack->isEmpty(),
7517 bool res = _mark_stack->push(obj);
7519 while (!_mark_stack->isEmpty()) {
7520 oop new_oop = _mark_stack->pop();
7525 assert(_mark_stack->isEmpty(), "tautology, emphasizing post-condition");
7538 _mark_stack(mark_stack)
7549 HeapWord* ra = (HeapWord*)_mark_stack->least_value(lost);
7551 _mark_stack->reset(); // discard stack contents
7552 _mark_stack->expand(); // expand the stack if possible
7568 if (!_mark_stack->push(obj)) { // stack overflow
7571 SIZE_FORMAT, _mark_stack->capacity());
7573 assert(_mark_stack->isFull(), "Else push should have succeeded");
7764 _mark_stack(mark_stack),
7795 if (simulate_overflow || !_mark_stack->push(obj)) {
8655 _mark_stack(mark_stack),
8675 if (simulate_overflow || !_mark_stack->push(obj)) {
8804 const size_t num = _mark_stack->capacity()/4;
8807 while (!_mark_stack->isEmpty() ||
8809 _collector->take_from_overflow_list(num, _mark_stack)) {
8810 oop obj = _mark_stack->pop();
9367 size_t num = MIN2((size_t)(_mark_stack->capacity() - _mark_stack->length())/4,
9370 bool res = _collector->take_from_overflow_list(num, _mark_stack);
9373 assert(!res || !_mark_stack->isEmpty(),