0N/A/*
2273N/A * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1472N/A * or visit www.oracle.com if you need additional information or have any
1472N/A * questions.
0N/A *
0N/A */
0N/A
1879N/A#include "precompiled.hpp"
1879N/A#include "compiler/compileBroker.hpp"
4141N/A#include "gc_implementation/shared/gcTimer.hpp"
4141N/A#include "gc_implementation/shared/gcTrace.hpp"
1879N/A#include "gc_implementation/shared/markSweep.inline.hpp"
1879N/A#include "gc_interface/collectedHeap.inline.hpp"
1879N/A#include "oops/methodDataOop.hpp"
1879N/A#include "oops/objArrayKlass.inline.hpp"
1879N/A#include "oops/oop.inline.hpp"
0N/A
3863N/AStack<oop, mtGC> MarkSweep::_marking_stack;
3863N/AStack<DataLayout*, mtGC> MarkSweep::_revisit_mdo_stack;
3863N/AStack<Klass*, mtGC> MarkSweep::_revisit_klass_stack;
3863N/AStack<ObjArrayTask, mtGC> MarkSweep::_objarray_stack;
0N/A
3863N/AStack<oop, mtGC> MarkSweep::_preserved_oop_stack;
3863N/AStack<markOop, mtGC> MarkSweep::_preserved_mark_stack;
0N/Asize_t MarkSweep::_preserved_count = 0;
0N/Asize_t MarkSweep::_preserved_count_max = 0;
0N/APreservedMark* MarkSweep::_preserved_marks = NULL;
0N/AReferenceProcessor* MarkSweep::_ref_processor = NULL;
4141N/ASTWGCTimer* MarkSweep::_gc_timer = NULL;
4141N/ASerialOldTracer* MarkSweep::_gc_tracer = NULL;
0N/A
0N/A#ifdef VALIDATE_MARK_SWEEP
113N/AGrowableArray<void*>* MarkSweep::_root_refs_stack = NULL;
0N/AGrowableArray<oop> * MarkSweep::_live_oops = NULL;
0N/AGrowableArray<oop> * MarkSweep::_live_oops_moved_to = NULL;
0N/AGrowableArray<size_t>* MarkSweep::_live_oops_size = NULL;
0N/Asize_t MarkSweep::_live_oops_index = 0;
0N/Asize_t MarkSweep::_live_oops_index_at_perm = 0;
113N/AGrowableArray<void*>* MarkSweep::_other_refs_stack = NULL;
113N/AGrowableArray<void*>* MarkSweep::_adjusted_pointers = NULL;
113N/Abool MarkSweep::_pointer_tracking = false;
113N/Abool MarkSweep::_root_tracking = true;
0N/A
0N/AGrowableArray<HeapWord*>* MarkSweep::_cur_gc_live_oops = NULL;
0N/AGrowableArray<HeapWord*>* MarkSweep::_cur_gc_live_oops_moved_to = NULL;
0N/AGrowableArray<size_t> * MarkSweep::_cur_gc_live_oops_size = NULL;
0N/AGrowableArray<HeapWord*>* MarkSweep::_last_gc_live_oops = NULL;
0N/AGrowableArray<HeapWord*>* MarkSweep::_last_gc_live_oops_moved_to = NULL;
0N/AGrowableArray<size_t> * MarkSweep::_last_gc_live_oops_size = NULL;
0N/A#endif
0N/A
0N/Avoid MarkSweep::revisit_weak_klass_link(Klass* k) {
1756N/A _revisit_klass_stack.push(k);
0N/A}
0N/A
0N/Avoid MarkSweep::follow_weak_klass_links() {
0N/A // All klasses on the revisit stack are marked at this point.
0N/A // Update and follow all subklass, sibling and implementor links.
941N/A if (PrintRevisitStats) {
1756N/A gclog_or_tty->print_cr("#classes in system dictionary = %d",
1756N/A SystemDictionary::number_of_classes());
1756N/A gclog_or_tty->print_cr("Revisit klass stack size = " SIZE_FORMAT,
1756N/A _revisit_klass_stack.size());
941N/A }
1756N/A while (!_revisit_klass_stack.is_empty()) {
1756N/A Klass* const k = _revisit_klass_stack.pop();
1756N/A k->follow_weak_klass_links(&is_alive, &keep_alive);
0N/A }
0N/A follow_stack();
0N/A}
0N/A
941N/Avoid MarkSweep::revisit_mdo(DataLayout* p) {
1756N/A _revisit_mdo_stack.push(p);
941N/A}
941N/A
941N/Avoid MarkSweep::follow_mdo_weak_refs() {
941N/A // All strongly reachable oops have been marked at this point;
941N/A // we can visit and clear any weak references from MDO's which
941N/A // we memoized during the strong marking phase.
1756N/A assert(_marking_stack.is_empty(), "Marking stack should be empty");
941N/A if (PrintRevisitStats) {
1756N/A gclog_or_tty->print_cr("#classes in system dictionary = %d",
1756N/A SystemDictionary::number_of_classes());
1756N/A gclog_or_tty->print_cr("Revisit MDO stack size = " SIZE_FORMAT,
1756N/A _revisit_mdo_stack.size());
941N/A }
1756N/A while (!_revisit_mdo_stack.is_empty()) {
1756N/A _revisit_mdo_stack.pop()->follow_weak_refs(&is_alive);
941N/A }
941N/A follow_stack();
941N/A}
941N/A
113N/AMarkSweep::FollowRootClosure MarkSweep::follow_root_closure;
989N/ACodeBlobToOopClosure MarkSweep::follow_code_root_closure(&MarkSweep::follow_root_closure, /*do_marking=*/ true);
0N/A
113N/Avoid MarkSweep::FollowRootClosure::do_oop(oop* p) { follow_root(p); }
113N/Avoid MarkSweep::FollowRootClosure::do_oop(narrowOop* p) { follow_root(p); }
0N/A
0N/AMarkSweep::MarkAndPushClosure MarkSweep::mark_and_push_closure;
0N/A
2062N/Avoid MarkSweep::MarkAndPushClosure::do_oop(oop* p) { assert(*p == NULL || (*p)->is_oop(), ""); mark_and_push(p); }
113N/Avoid MarkSweep::MarkAndPushClosure::do_oop(narrowOop* p) { mark_and_push(p); }
0N/A
0N/Avoid MarkSweep::follow_stack() {
1311N/A do {
1756N/A while (!_marking_stack.is_empty()) {
1756N/A oop obj = _marking_stack.pop();
1311N/A assert (obj->is_gc_marked(), "p must be marked");
1311N/A obj->follow_contents();
1311N/A }
1315N/A // Process ObjArrays one at a time to avoid marking stack bloat.
1756N/A if (!_objarray_stack.is_empty()) {
1756N/A ObjArrayTask task = _objarray_stack.pop();
1311N/A objArrayKlass* const k = (objArrayKlass*)task.obj()->blueprint();
1311N/A k->oop_follow_contents(task.obj(), task.index());
1311N/A }
1756N/A } while (!_marking_stack.is_empty() || !_objarray_stack.is_empty());
0N/A}
0N/A
0N/AMarkSweep::FollowStackClosure MarkSweep::follow_stack_closure;
0N/A
113N/Avoid MarkSweep::FollowStackClosure::do_void() { follow_stack(); }
0N/A
1756N/A// We preserve the mark which should be replaced at the end and the location
1756N/A// that it will go. Note that the object that this markOop belongs to isn't
1756N/A// currently at that address but it will be after phase4
0N/Avoid MarkSweep::preserve_mark(oop obj, markOop mark) {
1756N/A // We try to store preserved marks in the to space of the new generation since
1756N/A // this is storage which should be available. Most of the time this should be
1756N/A // sufficient space for the marks we need to preserve but if it isn't we fall
1756N/A // back to using Stacks to keep track of the overflow.
0N/A if (_preserved_count < _preserved_count_max) {
0N/A _preserved_marks[_preserved_count++].init(obj, mark);
0N/A } else {
1756N/A _preserved_mark_stack.push(mark);
1756N/A _preserved_oop_stack.push(obj);
0N/A }
0N/A}
0N/A
0N/AMarkSweep::AdjustPointerClosure MarkSweep::adjust_root_pointer_closure(true);
0N/AMarkSweep::AdjustPointerClosure MarkSweep::adjust_pointer_closure(false);
0N/A
113N/Avoid MarkSweep::AdjustPointerClosure::do_oop(oop* p) { adjust_pointer(p, _is_root); }
113N/Avoid MarkSweep::AdjustPointerClosure::do_oop(narrowOop* p) { adjust_pointer(p, _is_root); }
113N/A
0N/Avoid MarkSweep::adjust_marks() {
1756N/A assert( _preserved_oop_stack.size() == _preserved_mark_stack.size(),
0N/A "inconsistent preserved oop stacks");
0N/A
0N/A // adjust the oops we saved earlier
0N/A for (size_t i = 0; i < _preserved_count; i++) {
0N/A _preserved_marks[i].adjust_pointer();
0N/A }
0N/A
0N/A // deal with the overflow stack
3863N/A StackIterator<oop, mtGC> iter(_preserved_oop_stack);
1756N/A while (!iter.is_empty()) {
1756N/A oop* p = iter.next_addr();
1756N/A adjust_pointer(p);
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::restore_marks() {
1756N/A assert(_preserved_oop_stack.size() == _preserved_mark_stack.size(),
0N/A "inconsistent preserved oop stacks");
0N/A if (PrintGC && Verbose) {
1756N/A gclog_or_tty->print_cr("Restoring %d marks",
1756N/A _preserved_count + _preserved_oop_stack.size());
0N/A }
0N/A
0N/A // restore the marks we saved earlier
0N/A for (size_t i = 0; i < _preserved_count; i++) {
0N/A _preserved_marks[i].restore();
0N/A }
0N/A
0N/A // deal with the overflow
1756N/A while (!_preserved_oop_stack.is_empty()) {
1756N/A oop obj = _preserved_oop_stack.pop();
1756N/A markOop mark = _preserved_mark_stack.pop();
1756N/A obj->set_mark(mark);
0N/A }
0N/A}
0N/A
0N/A#ifdef VALIDATE_MARK_SWEEP
0N/A
113N/Avoid MarkSweep::track_adjusted_pointer(void* p, bool isroot) {
0N/A if (!ValidateMarkSweep)
0N/A return;
0N/A
0N/A if (!isroot) {
0N/A if (_pointer_tracking) {
0N/A guarantee(_adjusted_pointers->contains(p), "should have seen this pointer");
0N/A _adjusted_pointers->remove(p);
0N/A }
0N/A } else {
0N/A ptrdiff_t index = _root_refs_stack->find(p);
0N/A if (index != -1) {
0N/A int l = _root_refs_stack->length();
0N/A if (l > 0 && l - 1 != index) {
113N/A void* last = _root_refs_stack->pop();
0N/A assert(last != p, "should be different");
0N/A _root_refs_stack->at_put(index, last);
0N/A } else {
0N/A _root_refs_stack->remove(p);
0N/A }
0N/A }
0N/A }
0N/A}
0N/A
113N/Avoid MarkSweep::check_adjust_pointer(void* p) {
0N/A _adjusted_pointers->push(p);
0N/A}
0N/A
0N/Aclass AdjusterTracker: public OopClosure {
0N/A public:
113N/A AdjusterTracker() {}
113N/A void do_oop(oop* o) { MarkSweep::check_adjust_pointer(o); }
113N/A void do_oop(narrowOop* o) { MarkSweep::check_adjust_pointer(o); }
0N/A};
0N/A
0N/Avoid MarkSweep::track_interior_pointers(oop obj) {
0N/A if (ValidateMarkSweep) {
0N/A _adjusted_pointers->clear();
0N/A _pointer_tracking = true;
0N/A
0N/A AdjusterTracker checker;
0N/A obj->oop_iterate(&checker);
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::check_interior_pointers() {
0N/A if (ValidateMarkSweep) {
0N/A _pointer_tracking = false;
0N/A guarantee(_adjusted_pointers->length() == 0, "should have processed the same pointers");
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::reset_live_oop_tracking(bool at_perm) {
0N/A if (ValidateMarkSweep) {
0N/A guarantee((size_t)_live_oops->length() == _live_oops_index, "should be at end of live oops");
0N/A _live_oops_index = at_perm ? _live_oops_index_at_perm : 0;
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::register_live_oop(oop p, size_t size) {
0N/A if (ValidateMarkSweep) {
0N/A _live_oops->push(p);
0N/A _live_oops_size->push(size);
0N/A _live_oops_index++;
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::validate_live_oop(oop p, size_t size) {
0N/A if (ValidateMarkSweep) {
0N/A oop obj = _live_oops->at((int)_live_oops_index);
0N/A guarantee(obj == p, "should be the same object");
0N/A guarantee(_live_oops_size->at((int)_live_oops_index) == size, "should be the same size");
0N/A _live_oops_index++;
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::live_oop_moved_to(HeapWord* q, size_t size,
0N/A HeapWord* compaction_top) {
0N/A assert(oop(q)->forwardee() == NULL || oop(q)->forwardee() == oop(compaction_top),
0N/A "should be moved to forwarded location");
0N/A if (ValidateMarkSweep) {
0N/A MarkSweep::validate_live_oop(oop(q), size);
0N/A _live_oops_moved_to->push(oop(compaction_top));
0N/A }
0N/A if (RecordMarkSweepCompaction) {
0N/A _cur_gc_live_oops->push(q);
0N/A _cur_gc_live_oops_moved_to->push(compaction_top);
0N/A _cur_gc_live_oops_size->push(size);
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::compaction_complete() {
0N/A if (RecordMarkSweepCompaction) {
0N/A GrowableArray<HeapWord*>* _tmp_live_oops = _cur_gc_live_oops;
0N/A GrowableArray<HeapWord*>* _tmp_live_oops_moved_to = _cur_gc_live_oops_moved_to;
0N/A GrowableArray<size_t> * _tmp_live_oops_size = _cur_gc_live_oops_size;
0N/A
0N/A _cur_gc_live_oops = _last_gc_live_oops;
0N/A _cur_gc_live_oops_moved_to = _last_gc_live_oops_moved_to;
0N/A _cur_gc_live_oops_size = _last_gc_live_oops_size;
0N/A _last_gc_live_oops = _tmp_live_oops;
0N/A _last_gc_live_oops_moved_to = _tmp_live_oops_moved_to;
0N/A _last_gc_live_oops_size = _tmp_live_oops_size;
0N/A }
0N/A}
0N/A
0N/Avoid MarkSweep::print_new_location_of_heap_address(HeapWord* q) {
0N/A if (!RecordMarkSweepCompaction) {
0N/A tty->print_cr("Requires RecordMarkSweepCompaction to be enabled");
0N/A return;
0N/A }
0N/A
0N/A if (_last_gc_live_oops == NULL) {
0N/A tty->print_cr("No compaction information gathered yet");
0N/A return;
0N/A }
0N/A
0N/A for (int i = 0; i < _last_gc_live_oops->length(); i++) {
0N/A HeapWord* old_oop = _last_gc_live_oops->at(i);
0N/A size_t sz = _last_gc_live_oops_size->at(i);
0N/A if (old_oop <= q && q < (old_oop + sz)) {
0N/A HeapWord* new_oop = _last_gc_live_oops_moved_to->at(i);
0N/A size_t offset = (q - old_oop);
0N/A tty->print_cr("Address " PTR_FORMAT, q);
113N/A tty->print_cr(" Was in oop " PTR_FORMAT ", size " SIZE_FORMAT ", at offset " SIZE_FORMAT, old_oop, sz, offset);
0N/A tty->print_cr(" Now in oop " PTR_FORMAT ", actual address " PTR_FORMAT, new_oop, new_oop + offset);
0N/A return;
0N/A }
0N/A }
0N/A
0N/A tty->print_cr("Address " PTR_FORMAT " not found in live oop information from last GC", q);
0N/A}
0N/A#endif //VALIDATE_MARK_SWEEP
0N/A
113N/AMarkSweep::IsAliveClosure MarkSweep::is_alive;
0N/A
113N/Avoid MarkSweep::IsAliveClosure::do_object(oop p) { ShouldNotReachHere(); }
113N/Abool MarkSweep::IsAliveClosure::do_object_b(oop p) { return p->is_gc_marked(); }
0N/A
0N/AMarkSweep::KeepAliveClosure MarkSweep::keep_alive;
0N/A
113N/Avoid MarkSweep::KeepAliveClosure::do_oop(oop* p) { MarkSweep::KeepAliveClosure::do_oop_work(p); }
113N/Avoid MarkSweep::KeepAliveClosure::do_oop(narrowOop* p) { MarkSweep::KeepAliveClosure::do_oop_work(p); }
113N/A
4141N/Avoid marksweep_init() {
4141N/A MarkSweep::_gc_timer = new (ResourceObj::C_HEAP, mtGC) STWGCTimer();
4141N/A MarkSweep::_gc_tracer = new (ResourceObj::C_HEAP, mtGC) SerialOldTracer();
4141N/A}
0N/A
0N/A#ifndef PRODUCT
0N/A
0N/Avoid MarkSweep::trace(const char* msg) {
0N/A if (TraceMarkSweep)
0N/A gclog_or_tty->print("%s", msg);
0N/A}
0N/A
0N/A#endif