1 /* 2 * Copyright (c) 2007, 2010, 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 31 // Trim our work_queue so its length is below max at return 32 inline void Par_MarkRefsIntoAndScanClosure::trim_queue(uint max) { 33 while (_work_queue->size() > max) { 34 oop newOop; 35 if (_work_queue->pop_local(newOop)) { 36 assert(newOop->is_oop(), "Expected an oop"); 37 assert(_bit_map->isMarked((HeapWord*)newOop), 38 "only grey objects on this stack"); 39 // iterate over the oops in this oop, marking and pushing 40 // the ones in CMS heap (i.e. in _span). 41 newOop->oop_iterate(&_par_pushAndMarkClosure); 42 } 43 } 44 } 45 46 #ifndef PRODUCT 47 void KlassRememberingOopClosure::check_remember_klasses() const { 48 assert(_should_remember_klasses == must_remember_klasses(), 49 "Should remember klasses in this context."); 50 } 51 #endif 52 53 void KlassRememberingOopClosure::remember_klass(Klass* k) { 54 if (!_revisit_stack->push(oop(k))) { 55 fatal("Revisit stack overflow in PushOrMarkClosure"); 56 } 57 check_remember_klasses(); 58 } 59 60 inline void PushOrMarkClosure::remember_mdo(DataLayout* v) { 61 // TBD 62 } 63 64 65 void Par_KlassRememberingOopClosure::remember_klass(Klass* k) { 66 if (!_revisit_stack->par_push(oop(k))) { 67 fatal("Revisit stack overflow in Par_KlassRememberingOopClosure"); 68 } 69 check_remember_klasses(); 70 } 71 72 inline void Par_PushOrMarkClosure::remember_mdo(DataLayout* v) { 73 // TBD 74 } 75 76 inline void PushOrMarkClosure::do_yield_check() { 77 _parent->do_yield_check(); 78 } 79 80 inline void Par_PushOrMarkClosure::do_yield_check() { 81 _parent->do_yield_check(); 82 } 83 84 #endif // SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CMSOOPCLOSURES_INLINE_HPP