markSweep.cpp 6.4 KB
Newer Older
D
duke 已提交
1
/*
2
 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
D
duke 已提交
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
19 20 21
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
D
duke 已提交
22 23 24
 *
 */

25 26
#include "precompiled.hpp"
#include "compiler/compileBroker.hpp"
S
sla 已提交
27 28
#include "gc_implementation/shared/gcTimer.hpp"
#include "gc_implementation/shared/gcTrace.hpp"
29 30
#include "gc_implementation/shared/markSweep.inline.hpp"
#include "gc_interface/collectedHeap.inline.hpp"
31
#include "oops/methodData.hpp"
32 33
#include "oops/objArrayKlass.inline.hpp"
#include "oops/oop.inline.hpp"
D
duke 已提交
34

35 36
PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC

37
uint                    MarkSweep::_total_invocations = 0;
38

Z
zgu 已提交
39 40
Stack<oop, mtGC>              MarkSweep::_marking_stack;
Stack<ObjArrayTask, mtGC>     MarkSweep::_objarray_stack;
D
duke 已提交
41

Z
zgu 已提交
42 43
Stack<oop, mtGC>              MarkSweep::_preserved_oop_stack;
Stack<markOop, mtGC>          MarkSweep::_preserved_mark_stack;
D
duke 已提交
44 45 46 47
size_t                  MarkSweep::_preserved_count = 0;
size_t                  MarkSweep::_preserved_count_max = 0;
PreservedMark*          MarkSweep::_preserved_marks = NULL;
ReferenceProcessor*     MarkSweep::_ref_processor   = NULL;
S
sla 已提交
48 49
STWGCTimer*             MarkSweep::_gc_timer        = NULL;
SerialOldTracer*        MarkSweep::_gc_tracer       = NULL;
D
duke 已提交
50

51
MarkSweep::FollowRootClosure  MarkSweep::follow_root_closure;
D
duke 已提交
52

53 54
void MarkSweep::FollowRootClosure::do_oop(oop* p)       { follow_root(p); }
void MarkSweep::FollowRootClosure::do_oop(narrowOop* p) { follow_root(p); }
D
duke 已提交
55 56

MarkSweep::MarkAndPushClosure MarkSweep::mark_and_push_closure;
57 58
MarkSweep::FollowKlassClosure MarkSweep::follow_klass_closure;
MarkSweep::AdjustKlassClosure MarkSweep::adjust_klass_closure;
D
duke 已提交
59

60
void MarkSweep::MarkAndPushClosure::do_oop(oop* p)       { mark_and_push(p); }
61
void MarkSweep::MarkAndPushClosure::do_oop(narrowOop* p) { mark_and_push(p); }
D
duke 已提交
62

63 64 65 66 67 68 69 70 71 72 73
void MarkSweep::FollowKlassClosure::do_klass(Klass* klass) {
  klass->oops_do(&MarkSweep::mark_and_push_closure);
}
void MarkSweep::AdjustKlassClosure::do_klass(Klass* klass) {
  klass->oops_do(&MarkSweep::adjust_pointer_closure);
}

void MarkSweep::follow_class_loader(ClassLoaderData* cld) {
  cld->oops_do(&MarkSweep::mark_and_push_closure, &MarkSweep::follow_klass_closure, true);
}

D
duke 已提交
74
void MarkSweep::follow_stack() {
75
  do {
76 77
    while (!_marking_stack.is_empty()) {
      oop obj = _marking_stack.pop();
78 79 80
      assert (obj->is_gc_marked(), "p must be marked");
      obj->follow_contents();
    }
81
    // Process ObjArrays one at a time to avoid marking stack bloat.
82 83
    if (!_objarray_stack.is_empty()) {
      ObjArrayTask task = _objarray_stack.pop();
84
      ObjArrayKlass* k = (ObjArrayKlass*)task.obj()->klass();
85 86
      k->oop_follow_contents(task.obj(), task.index());
    }
87
  } while (!_marking_stack.is_empty() || !_objarray_stack.is_empty());
D
duke 已提交
88 89 90 91
}

MarkSweep::FollowStackClosure MarkSweep::follow_stack_closure;

92
void MarkSweep::FollowStackClosure::do_void() { follow_stack(); }
D
duke 已提交
93

94 95 96
// We preserve the mark which should be replaced at the end and the location
// that it will go.  Note that the object that this markOop belongs to isn't
// currently at that address but it will be after phase4
D
duke 已提交
97
void MarkSweep::preserve_mark(oop obj, markOop mark) {
98 99 100 101
  // We try to store preserved marks in the to space of the new generation since
  // this is storage which should be available.  Most of the time this should be
  // sufficient space for the marks we need to preserve but if it isn't we fall
  // back to using Stacks to keep track of the overflow.
D
duke 已提交
102 103 104
  if (_preserved_count < _preserved_count_max) {
    _preserved_marks[_preserved_count++].init(obj, mark);
  } else {
105 106
    _preserved_mark_stack.push(mark);
    _preserved_oop_stack.push(obj);
D
duke 已提交
107 108 109
  }
}

110
MarkSweep::AdjustPointerClosure MarkSweep::adjust_pointer_closure;
D
duke 已提交
111

112 113
void MarkSweep::AdjustPointerClosure::do_oop(oop* p)       { adjust_pointer(p); }
void MarkSweep::AdjustPointerClosure::do_oop(narrowOop* p) { adjust_pointer(p); }
114

D
duke 已提交
115
void MarkSweep::adjust_marks() {
116
  assert( _preserved_oop_stack.size() == _preserved_mark_stack.size(),
D
duke 已提交
117 118 119 120 121 122 123 124
         "inconsistent preserved oop stacks");

  // adjust the oops we saved earlier
  for (size_t i = 0; i < _preserved_count; i++) {
    _preserved_marks[i].adjust_pointer();
  }

  // deal with the overflow stack
Z
zgu 已提交
125
  StackIterator<oop, mtGC> iter(_preserved_oop_stack);
126 127 128
  while (!iter.is_empty()) {
    oop* p = iter.next_addr();
    adjust_pointer(p);
D
duke 已提交
129 130 131 132
  }
}

void MarkSweep::restore_marks() {
133
  assert(_preserved_oop_stack.size() == _preserved_mark_stack.size(),
D
duke 已提交
134 135
         "inconsistent preserved oop stacks");
  if (PrintGC && Verbose) {
136 137
    gclog_or_tty->print_cr("Restoring %d marks",
                           _preserved_count + _preserved_oop_stack.size());
D
duke 已提交
138 139 140 141 142 143 144 145
  }

  // restore the marks we saved earlier
  for (size_t i = 0; i < _preserved_count; i++) {
    _preserved_marks[i].restore();
  }

  // deal with the overflow
146 147 148 149
  while (!_preserved_oop_stack.is_empty()) {
    oop obj       = _preserved_oop_stack.pop();
    markOop mark  = _preserved_mark_stack.pop();
    obj->set_mark(mark);
D
duke 已提交
150 151 152
  }
}

153
MarkSweep::IsAliveClosure   MarkSweep::is_alive;
D
duke 已提交
154

155
bool MarkSweep::IsAliveClosure::do_object_b(oop p) { return p->is_gc_marked(); }
D
duke 已提交
156 157 158

MarkSweep::KeepAliveClosure MarkSweep::keep_alive;

159 160 161
void MarkSweep::KeepAliveClosure::do_oop(oop* p)       { MarkSweep::KeepAliveClosure::do_oop_work(p); }
void MarkSweep::KeepAliveClosure::do_oop(narrowOop* p) { MarkSweep::KeepAliveClosure::do_oop_work(p); }

S
sla 已提交
162 163 164 165
void marksweep_init() {
  MarkSweep::_gc_timer = new (ResourceObj::C_HEAP, mtGC) STWGCTimer();
  MarkSweep::_gc_tracer = new (ResourceObj::C_HEAP, mtGC) SerialOldTracer();
}
D
duke 已提交
166 167 168 169 170 171 172 173 174

#ifndef PRODUCT

void MarkSweep::trace(const char* msg) {
  if (TraceMarkSweep)
    gclog_or_tty->print("%s", msg);
}

#endif