1 /* 2 * Copyright (c) 1997, 2017, 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 #include "precompiled.hpp" 26 #include "gc/shared/modRefBarrierSet.inline.hpp" 27 #include "gc/shared/collectedHeap.hpp" 28 #include "memory/universe.hpp" 29 #include "oops/klass.hpp" 30 #include "oops/objArrayKlass.inline.hpp" 31 32 // count is number of array elements being written 33 void ModRefBarrierSet::static_write_ref_array_pre(HeapWord* start, size_t count) { 34 assert(count <= (size_t)max_intx, "count too large"); 35 ModRefBarrierSet *bs = barrier_set_cast<ModRefBarrierSet>(Universe::heap()->barrier_set()); 36 if (UseCompressedOops) { 37 bs->write_ref_array_pre((narrowOop*)start, (int)count, false); 38 } else { 39 bs->write_ref_array_pre( (oop*)start, (int)count, false); 40 } 41 } 42 43 // count is number of array elements being written 44 void ModRefBarrierSet::static_write_ref_array_post(HeapWord* start, size_t count) { 45 // simply delegate to instance method 46 ModRefBarrierSet *bs = barrier_set_cast<ModRefBarrierSet>(Universe::heap()->barrier_set()); 47 bs->write_ref_array(start, count); 48 } 49 50 void ModRefBarrierSet::klass_update_barrier_set(Klass* klass, oop* p, oop v) { 51 klass->record_modified_oops(); 52 } 53 54 Klass* ModRefBarrierSet::bound_for_array(oop obj) { 55 return ObjArrayKlass::cast(obj->klass())->element_klass(); 56 } 57 58 bool ModRefBarrierSet::is_bounded_by(oop obj, Klass* klass) { 59 return obj->klass()->is_subtype_of(klass); 60 }