1 /*
2 * Copyright (c) 2007, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSOOPCLOSURES_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSOOPCLOSURES_INLINE_HPP
27
28 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.hpp"
29 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.hpp"
30 #include "oops/oop.inline.hpp"
31 #include "utilities/taskqueue.inline.hpp"
32
33 // Trim our work_queue so its length is below max at return
34 inline void Par_MarkRefsIntoAndScanClosure::trim_queue(uint max) {
35 while (_work_queue->size() > max) {
36 oop newOop;
37 if (_work_queue->pop_local(newOop)) {
38 assert(newOop->is_oop(), "Expected an oop");
39 assert(_bit_map->isMarked((HeapWord*)newOop),
40 "only grey objects on this stack");
41 // iterate over the oops in this oop, marking and pushing
42 // the ones in CMS heap (i.e. in _span).
43 newOop->oop_iterate(&_par_pushAndMarkClosure);
44 }
45 }
46 }
47
48 // MetadataAwareOopClosure and MetadataAwareOopsInGenClosure are duplicated,
49 // until we get rid of OopsInGenClosure.
50
51 inline void MetadataAwareOopsInGenClosure::do_klass_nv(Klass* k) {
52 ClassLoaderData* cld = k->class_loader_data();
53 do_class_loader_data(cld);
54 }
55 inline void MetadataAwareOopsInGenClosure::do_klass(Klass* k) { do_klass_nv(k); }
56
57 inline void MetadataAwareOopsInGenClosure::do_class_loader_data(ClassLoaderData* cld) {
58 assert(_klass_closure._oop_closure == this, "Must be");
59
60 bool claim = true; // Must claim the class loader data before processing.
61 cld->oops_do(_klass_closure._oop_closure, &_klass_closure, claim);
62 }
63
64 #endif // SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSOOPCLOSURES_INLINE_HPP
|
1 /*
2 * Copyright (c) 2007, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_GC_CMS_CMSOOPCLOSURES_INLINE_HPP
26 #define SHARE_VM_GC_CMS_CMSOOPCLOSURES_INLINE_HPP
27
28 #include "gc/cms/cmsOopClosures.hpp"
29 #include "gc/cms/concurrentMarkSweepGeneration.hpp"
30 #include "gc/shared/taskqueue.inline.hpp"
31 #include "oops/oop.inline.hpp"
32
33 // Trim our work_queue so its length is below max at return
34 inline void Par_MarkRefsIntoAndScanClosure::trim_queue(uint max) {
35 while (_work_queue->size() > max) {
36 oop newOop;
37 if (_work_queue->pop_local(newOop)) {
38 assert(newOop->is_oop(), "Expected an oop");
39 assert(_bit_map->isMarked((HeapWord*)newOop),
40 "only grey objects on this stack");
41 // iterate over the oops in this oop, marking and pushing
42 // the ones in CMS heap (i.e. in _span).
43 newOop->oop_iterate(&_par_pushAndMarkClosure);
44 }
45 }
46 }
47
48 // MetadataAwareOopClosure and MetadataAwareOopsInGenClosure are duplicated,
49 // until we get rid of OopsInGenClosure.
50
51 inline void MetadataAwareOopsInGenClosure::do_klass_nv(Klass* k) {
52 ClassLoaderData* cld = k->class_loader_data();
53 do_class_loader_data(cld);
54 }
55 inline void MetadataAwareOopsInGenClosure::do_klass(Klass* k) { do_klass_nv(k); }
56
57 inline void MetadataAwareOopsInGenClosure::do_class_loader_data(ClassLoaderData* cld) {
58 assert(_klass_closure._oop_closure == this, "Must be");
59
60 bool claim = true; // Must claim the class loader data before processing.
61 cld->oops_do(_klass_closure._oop_closure, &_klass_closure, claim);
62 }
63
64 #endif // SHARE_VM_GC_CMS_CMSOOPCLOSURES_INLINE_HPP
|