< prev index next >

src/share/vm/gc/g1/g1ConcurrentMark.cpp

Print this page

        

*** 1916,1926 **** void operator()(G1TaskQueueEntry task_entry) const { if (task_entry.is_array_slice()) { guarantee(_g1h->is_in_reserved(task_entry.slice()), "Slice " PTR_FORMAT " must be in heap.", p2i(task_entry.slice())); return; } ! guarantee(task_entry.obj()->is_oop(), "Non-oop " PTR_FORMAT ", phase: %s, info: %d", p2i(task_entry.obj()), _phase, _info); guarantee(!_g1h->is_in_cset(task_entry.obj()), "obj: " PTR_FORMAT " in CSet, phase: %s, info: %d", p2i(task_entry.obj()), _phase, _info); --- 1916,1926 ---- void operator()(G1TaskQueueEntry task_entry) const { if (task_entry.is_array_slice()) { guarantee(_g1h->is_in_reserved(task_entry.slice()), "Slice " PTR_FORMAT " must be in heap.", p2i(task_entry.slice())); return; } ! guarantee(oopDesc::is_oop(task_entry.obj()), "Non-oop " PTR_FORMAT ", phase: %s, info: %d", p2i(task_entry.obj()), _phase, _info); guarantee(!_g1h->is_in_cset(task_entry.obj()), "obj: " PTR_FORMAT " in CSet, phase: %s, info: %d", p2i(task_entry.obj()), _phase, _info);
*** 2311,2321 **** for (size_t i = 0; i < G1CMMarkStack::EntriesPerChunk; ++i) { G1TaskQueueEntry task_entry = buffer[i]; if (task_entry.is_null()) { break; } ! assert(task_entry.is_array_slice() || task_entry.obj()->is_oop(), "Element " PTR_FORMAT " must be an array slice or oop", p2i(task_entry.obj())); bool success = _task_queue->push(task_entry); // We only call this when the local queue is empty or under a // given target limit. So, we do not expect this push to fail. assert(success, "invariant"); } --- 2311,2321 ---- for (size_t i = 0; i < G1CMMarkStack::EntriesPerChunk; ++i) { G1TaskQueueEntry task_entry = buffer[i]; if (task_entry.is_null()) { break; } ! assert(task_entry.is_array_slice() || oopDesc::is_oop(task_entry.obj()), "Element " PTR_FORMAT " must be an array slice or oop", p2i(task_entry.obj())); bool success = _task_queue->push(task_entry); // We only call this when the local queue is empty or under a // given target limit. So, we do not expect this push to fail. assert(success, "invariant"); }
< prev index next >