1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/memory/genRemSet.cpp Wed Apr 27 01:25:04 2016 +0800
1.3 @@ -0,0 +1,77 @@
1.4 +/*
1.5 + * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.23 + * or visit www.oracle.com if you need additional information or have any
1.24 + * questions.
1.25 + *
1.26 + */
1.27 +
1.28 +#include "precompiled.hpp"
1.29 +#include "classfile/classLoaderData.hpp"
1.30 +#include "memory/cardTableRS.hpp"
1.31 +#include "memory/genRemSet.hpp"
1.32 +
1.33 +// This kind of "BarrierSet" allows a "CollectedHeap" to detect and
1.34 +// enumerate ref fields that have been modified (since the last
1.35 +// enumeration.)
1.36 +
1.37 +uintx GenRemSet::max_alignment_constraint(Name nm) {
1.38 + assert(nm == GenRemSet::CardTable, "Unrecognized GenRemSet type.");
1.39 + return CardTableRS::ct_max_alignment_constraint();
1.40 +}
1.41 +
1.42 +class HasAccumulatedModifiedOopsClosure : public KlassClosure {
1.43 + bool _found;
1.44 + public:
1.45 + HasAccumulatedModifiedOopsClosure() : _found(false) {}
1.46 + void do_klass(Klass* klass) {
1.47 + if (_found) {
1.48 + return;
1.49 + }
1.50 +
1.51 + if (klass->has_accumulated_modified_oops()) {
1.52 + _found = true;
1.53 + }
1.54 + }
1.55 + bool found() {
1.56 + return _found;
1.57 + }
1.58 +};
1.59 +
1.60 +bool KlassRemSet::mod_union_is_clear() {
1.61 + HasAccumulatedModifiedOopsClosure closure;
1.62 + ClassLoaderDataGraph::classes_do(&closure);
1.63 +
1.64 + return !closure.found();
1.65 +}
1.66 +
1.67 +
1.68 +class ClearKlassModUnionClosure : public KlassClosure {
1.69 + public:
1.70 + void do_klass(Klass* klass) {
1.71 + if (klass->has_accumulated_modified_oops()) {
1.72 + klass->clear_accumulated_modified_oops();
1.73 + }
1.74 + }
1.75 +};
1.76 +
1.77 +void KlassRemSet::clear_mod_union() {
1.78 + ClearKlassModUnionClosure closure;
1.79 + ClassLoaderDataGraph::classes_do(&closure);
1.80 +}
