1 /* 2 * Copyright (c) 1997, 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 #include "precompiled.hpp" 26 #include "classfile/javaClasses.hpp" 27 #include "gc_implementation/shared/markSweep.inline.hpp" 28 #include "oops/arrayKlassKlass.hpp" 29 #include "oops/oop.inline.hpp" 30 #include "runtime/handles.inline.hpp" 31 32 33 klassOop arrayKlassKlass::create_klass(TRAPS) { 34 arrayKlassKlass o; 35 KlassHandle h_this_klass(THREAD, Universe::klassKlassObj()); 36 KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL); 37 // Make sure size calculation is right 38 assert(k()->size() == align_object_size(header_size()), "wrong size for object"); 39 java_lang_Class::create_mirror(k, CHECK_NULL); // Allocate mirror, make links 40 return k(); 41 } 42 43 bool arrayKlassKlass::oop_is_parsable(oop obj) const { 44 assert(obj->is_klass(), "must be klass"); 45 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 46 return (!ak->null_vtbl()) && ak->object_is_parsable(); 47 } 48 49 void arrayKlassKlass::oop_follow_contents(oop obj) { 50 assert(obj->is_klass(), "must be klass"); 51 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 52 MarkSweep::mark_and_push(ak->adr_component_mirror()); 53 MarkSweep::mark_and_push(ak->adr_lower_dimension()); 54 MarkSweep::mark_and_push(ak->adr_higher_dimension()); 55 { 56 HandleMark hm; 57 ak->vtable()->oop_follow_contents(); 58 } 59 klassKlass::oop_follow_contents(obj); 60 } 61 62 #ifndef SERIALGC 63 void arrayKlassKlass::oop_follow_contents(ParCompactionManager* cm, 64 oop obj) { 65 assert(obj->is_klass(), "must be klass"); 66 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 67 PSParallelCompact::mark_and_push(cm, ak->adr_component_mirror()); 68 PSParallelCompact::mark_and_push(cm, ak->adr_lower_dimension()); 69 PSParallelCompact::mark_and_push(cm, ak->adr_higher_dimension()); 70 { 71 HandleMark hm; 72 ak->vtable()->oop_follow_contents(cm); 73 } 74 klassKlass::oop_follow_contents(cm, obj); 75 } 76 #endif // SERIALGC 77 78 79 int arrayKlassKlass::oop_adjust_pointers(oop obj) { 80 assert(obj->is_klass(), "must be klass"); 81 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 82 MarkSweep::adjust_pointer(ak->adr_component_mirror()); 83 MarkSweep::adjust_pointer(ak->adr_lower_dimension()); 84 MarkSweep::adjust_pointer(ak->adr_higher_dimension()); 85 { 86 HandleMark hm; 87 ak->vtable()->oop_adjust_pointers(); 88 } 89 return klassKlass::oop_adjust_pointers(obj); 90 } 91 92 93 int arrayKlassKlass::oop_oop_iterate(oop obj, OopClosure* blk) { 94 assert(obj->is_klass(), "must be klass"); 95 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 96 blk->do_oop(ak->adr_component_mirror()); 97 blk->do_oop(ak->adr_lower_dimension()); 98 blk->do_oop(ak->adr_higher_dimension()); 99 ak->vtable()->oop_oop_iterate(blk); 100 return klassKlass::oop_oop_iterate(obj, blk); 101 } 102 103 104 int arrayKlassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { 105 assert(obj->is_klass(), "must be klass"); 106 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 107 blk->do_oop(ak->adr_component_mirror()); 108 blk->do_oop(ak->adr_lower_dimension()); 109 blk->do_oop(ak->adr_higher_dimension()); 110 ak->vtable()->oop_oop_iterate_m(blk, mr); 111 return klassKlass::oop_oop_iterate_m(obj, blk, mr); 112 } 113 114 #ifndef SERIALGC 115 void arrayKlassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { 116 assert(obj->blueprint()->oop_is_arrayKlass(),"must be an array klass"); 117 } 118 119 int arrayKlassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { 120 assert(obj->is_klass(), "must be klass"); 121 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 122 PSParallelCompact::adjust_pointer(ak->adr_component_mirror()); 123 PSParallelCompact::adjust_pointer(ak->adr_lower_dimension()); 124 PSParallelCompact::adjust_pointer(ak->adr_higher_dimension()); 125 { 126 HandleMark hm; 127 ak->vtable()->oop_update_pointers(cm); 128 } 129 return klassKlass::oop_update_pointers(cm, obj); 130 } 131 132 int 133 arrayKlassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, 134 HeapWord* beg_addr, HeapWord* end_addr) { 135 assert(obj->is_klass(), "must be klass"); 136 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 137 138 oop* p; 139 p = ak->adr_component_mirror(); 140 PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); 141 p = ak->adr_lower_dimension(); 142 PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); 143 p = ak->adr_higher_dimension(); 144 PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); 145 146 { 147 HandleMark hm; 148 ak->vtable()->oop_update_pointers(cm, beg_addr, end_addr); 149 } 150 return klassKlass::oop_update_pointers(cm, obj, beg_addr, end_addr); 151 } 152 #endif // SERIALGC 153 154 // Printing 155 156 void arrayKlassKlass::oop_print_on(oop obj, outputStream* st) { 157 assert(obj->is_klass(), "must be klass"); 158 klassKlass::oop_print_on(obj, st); 159 } 160 161 void arrayKlassKlass::oop_print_value_on(oop obj, outputStream* st) { 162 assert(obj->is_klass(), "must be klass"); 163 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 164 for(int index = 0; index < ak->dimension(); index++) { 165 st->print("[]"); 166 } 167 } 168 169 170 const char* arrayKlassKlass::internal_name() const { 171 return "{array class}"; 172 } 173 174 void arrayKlassKlass::oop_verify_on(oop obj, outputStream* st) { 175 klassKlass::oop_verify_on(obj, st); 176 177 arrayKlass* ak = arrayKlass::cast(klassOop(obj)); 178 if (!obj->partially_loaded()) { 179 if (ak->component_mirror() != NULL) 180 guarantee(ak->component_mirror()->klass(), "should have a class"); 181 if (ak->lower_dimension() != NULL) 182 guarantee(ak->lower_dimension()->klass(), "should have a class"); 183 if (ak->higher_dimension() != NULL) 184 guarantee(ak->higher_dimension()->klass(), "should have a class"); 185 } 186 }