Tue, 23 Nov 2010 13:22:55 -0800
6989984: Use standard include model for Hospot
Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg
duke@435 | 1 | /* |
jrose@2268 | 2 | * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/javaClasses.hpp" |
stefank@2314 | 27 | #include "gc_implementation/shared/markSweep.inline.hpp" |
stefank@2314 | 28 | #include "gc_interface/collectedHeap.inline.hpp" |
stefank@2314 | 29 | #include "memory/oopFactory.hpp" |
stefank@2314 | 30 | #include "memory/permGen.hpp" |
stefank@2314 | 31 | #include "memory/universe.inline.hpp" |
stefank@2314 | 32 | #include "oops/constantPoolKlass.hpp" |
stefank@2314 | 33 | #include "oops/constantPoolOop.hpp" |
stefank@2314 | 34 | #include "oops/oop.inline.hpp" |
stefank@2314 | 35 | #include "oops/oop.inline2.hpp" |
stefank@2314 | 36 | #include "oops/symbolOop.hpp" |
stefank@2314 | 37 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 38 | #ifdef TARGET_OS_FAMILY_linux |
stefank@2314 | 39 | # include "thread_linux.inline.hpp" |
stefank@2314 | 40 | #endif |
stefank@2314 | 41 | #ifdef TARGET_OS_FAMILY_solaris |
stefank@2314 | 42 | # include "thread_solaris.inline.hpp" |
stefank@2314 | 43 | #endif |
stefank@2314 | 44 | #ifdef TARGET_OS_FAMILY_windows |
stefank@2314 | 45 | # include "thread_windows.inline.hpp" |
stefank@2314 | 46 | #endif |
stefank@2314 | 47 | #ifndef SERIALGC |
stefank@2314 | 48 | #include "gc_implementation/parNew/parOopClosures.inline.hpp" |
stefank@2314 | 49 | #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp" |
stefank@2314 | 50 | #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp" |
stefank@2314 | 51 | #include "memory/cardTableRS.hpp" |
stefank@2314 | 52 | #include "oops/oop.pcgc.inline.hpp" |
stefank@2314 | 53 | #endif |
duke@435 | 54 | |
jmasa@953 | 55 | constantPoolOop constantPoolKlass::allocate(int length, bool is_conc_safe, TRAPS) { |
duke@435 | 56 | int size = constantPoolOopDesc::object_size(length); |
duke@435 | 57 | KlassHandle klass (THREAD, as_klassOop()); |
duke@435 | 58 | constantPoolOop c = |
coleenp@548 | 59 | (constantPoolOop)CollectedHeap::permanent_obj_allocate(klass, size, CHECK_NULL); |
duke@435 | 60 | |
coleenp@548 | 61 | c->set_length(length); |
duke@435 | 62 | c->set_tags(NULL); |
duke@435 | 63 | c->set_cache(NULL); |
jrose@2268 | 64 | c->set_operands(NULL); |
duke@435 | 65 | c->set_pool_holder(NULL); |
jrose@866 | 66 | c->set_flags(0); |
duke@435 | 67 | // only set to non-zero if constant pool is merged by RedefineClasses |
duke@435 | 68 | c->set_orig_length(0); |
jmasa@953 | 69 | // if constant pool may change during RedefineClasses, it is created |
jmasa@953 | 70 | // unsafe for GC concurrent processing. |
jmasa@953 | 71 | c->set_is_conc_safe(is_conc_safe); |
duke@435 | 72 | // all fields are initialized; needed for GC |
duke@435 | 73 | |
duke@435 | 74 | // initialize tag array |
duke@435 | 75 | // Note: cannot introduce constant pool handle before since it is not |
duke@435 | 76 | // completely initialized (no class) -> would cause assertion failure |
duke@435 | 77 | constantPoolHandle pool (THREAD, c); |
duke@435 | 78 | typeArrayOop t_oop = oopFactory::new_permanent_byteArray(length, CHECK_NULL); |
duke@435 | 79 | typeArrayHandle tags (THREAD, t_oop); |
duke@435 | 80 | for (int index = 0; index < length; index++) { |
duke@435 | 81 | tags()->byte_at_put(index, JVM_CONSTANT_Invalid); |
duke@435 | 82 | } |
duke@435 | 83 | pool->set_tags(tags()); |
duke@435 | 84 | |
duke@435 | 85 | return pool(); |
duke@435 | 86 | } |
duke@435 | 87 | |
duke@435 | 88 | klassOop constantPoolKlass::create_klass(TRAPS) { |
duke@435 | 89 | constantPoolKlass o; |
coleenp@548 | 90 | KlassHandle h_this_klass(THREAD, Universe::klassKlassObj()); |
coleenp@548 | 91 | KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL); |
coleenp@548 | 92 | // Make sure size calculation is right |
coleenp@548 | 93 | assert(k()->size() == align_object_size(header_size()), "wrong size for object"); |
coleenp@548 | 94 | java_lang_Class::create_mirror(k, CHECK_NULL); // Allocate mirror |
duke@435 | 95 | return k(); |
duke@435 | 96 | } |
duke@435 | 97 | |
duke@435 | 98 | int constantPoolKlass::oop_size(oop obj) const { |
duke@435 | 99 | assert(obj->is_constantPool(), "must be constantPool"); |
duke@435 | 100 | return constantPoolOop(obj)->object_size(); |
duke@435 | 101 | } |
duke@435 | 102 | |
duke@435 | 103 | |
duke@435 | 104 | void constantPoolKlass::oop_follow_contents(oop obj) { |
duke@435 | 105 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 106 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 107 | // Performance tweak: We skip iterating over the klass pointer since we |
duke@435 | 108 | // know that Universe::constantPoolKlassObj never moves. |
duke@435 | 109 | |
duke@435 | 110 | // If the tags array is null we are in the middle of allocating this constant pool |
duke@435 | 111 | if (cp->tags() != NULL) { |
duke@435 | 112 | // gc of constant pool contents |
duke@435 | 113 | oop* base = (oop*)cp->base(); |
duke@435 | 114 | for (int i = 0; i < cp->length(); i++) { |
duke@435 | 115 | if (cp->is_pointer_entry(i)) { |
duke@435 | 116 | if (*base != NULL) MarkSweep::mark_and_push(base); |
duke@435 | 117 | } |
duke@435 | 118 | base++; |
duke@435 | 119 | } |
duke@435 | 120 | // gc of constant pool instance variables |
duke@435 | 121 | MarkSweep::mark_and_push(cp->tags_addr()); |
duke@435 | 122 | MarkSweep::mark_and_push(cp->cache_addr()); |
jrose@2268 | 123 | MarkSweep::mark_and_push(cp->operands_addr()); |
duke@435 | 124 | MarkSweep::mark_and_push(cp->pool_holder_addr()); |
duke@435 | 125 | } |
duke@435 | 126 | } |
duke@435 | 127 | |
duke@435 | 128 | #ifndef SERIALGC |
duke@435 | 129 | void constantPoolKlass::oop_follow_contents(ParCompactionManager* cm, |
duke@435 | 130 | oop obj) { |
duke@435 | 131 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 132 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 133 | // Performance tweak: We skip iterating over the klass pointer since we |
duke@435 | 134 | // know that Universe::constantPoolKlassObj never moves. |
duke@435 | 135 | |
duke@435 | 136 | // If the tags array is null we are in the middle of allocating this constant |
duke@435 | 137 | // pool. |
duke@435 | 138 | if (cp->tags() != NULL) { |
duke@435 | 139 | // gc of constant pool contents |
duke@435 | 140 | oop* base = (oop*)cp->base(); |
duke@435 | 141 | for (int i = 0; i < cp->length(); i++) { |
duke@435 | 142 | if (cp->is_pointer_entry(i)) { |
duke@435 | 143 | if (*base != NULL) PSParallelCompact::mark_and_push(cm, base); |
duke@435 | 144 | } |
duke@435 | 145 | base++; |
duke@435 | 146 | } |
duke@435 | 147 | // gc of constant pool instance variables |
duke@435 | 148 | PSParallelCompact::mark_and_push(cm, cp->tags_addr()); |
duke@435 | 149 | PSParallelCompact::mark_and_push(cm, cp->cache_addr()); |
jrose@2268 | 150 | PSParallelCompact::mark_and_push(cm, cp->operands_addr()); |
duke@435 | 151 | PSParallelCompact::mark_and_push(cm, cp->pool_holder_addr()); |
duke@435 | 152 | } |
duke@435 | 153 | } |
duke@435 | 154 | #endif // SERIALGC |
duke@435 | 155 | |
duke@435 | 156 | |
duke@435 | 157 | int constantPoolKlass::oop_adjust_pointers(oop obj) { |
duke@435 | 158 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 159 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 160 | // Get size before changing pointers. |
duke@435 | 161 | // Don't call size() or oop_size() since that is a virtual call. |
duke@435 | 162 | int size = cp->object_size(); |
duke@435 | 163 | // Performance tweak: We skip iterating over the klass pointer since we |
duke@435 | 164 | // know that Universe::constantPoolKlassObj never moves. |
duke@435 | 165 | |
duke@435 | 166 | // If the tags array is null we are in the middle of allocating this constant |
duke@435 | 167 | // pool. |
duke@435 | 168 | if (cp->tags() != NULL) { |
duke@435 | 169 | oop* base = (oop*)cp->base(); |
duke@435 | 170 | for (int i = 0; i< cp->length(); i++) { |
duke@435 | 171 | if (cp->is_pointer_entry(i)) { |
duke@435 | 172 | MarkSweep::adjust_pointer(base); |
duke@435 | 173 | } |
duke@435 | 174 | base++; |
duke@435 | 175 | } |
duke@435 | 176 | } |
duke@435 | 177 | MarkSweep::adjust_pointer(cp->tags_addr()); |
duke@435 | 178 | MarkSweep::adjust_pointer(cp->cache_addr()); |
jrose@2268 | 179 | MarkSweep::adjust_pointer(cp->operands_addr()); |
duke@435 | 180 | MarkSweep::adjust_pointer(cp->pool_holder_addr()); |
duke@435 | 181 | return size; |
duke@435 | 182 | } |
duke@435 | 183 | |
duke@435 | 184 | |
duke@435 | 185 | int constantPoolKlass::oop_oop_iterate(oop obj, OopClosure* blk) { |
duke@435 | 186 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 187 | // Performance tweak: We skip iterating over the klass pointer since we |
duke@435 | 188 | // know that Universe::constantPoolKlassObj never moves. |
duke@435 | 189 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 190 | // Get size before changing pointers. |
duke@435 | 191 | // Don't call size() or oop_size() since that is a virtual call. |
duke@435 | 192 | int size = cp->object_size(); |
duke@435 | 193 | |
duke@435 | 194 | // If the tags array is null we are in the middle of allocating this constant |
duke@435 | 195 | // pool. |
duke@435 | 196 | if (cp->tags() != NULL) { |
duke@435 | 197 | oop* base = (oop*)cp->base(); |
duke@435 | 198 | for (int i = 0; i < cp->length(); i++) { |
duke@435 | 199 | if (cp->is_pointer_entry(i)) { |
duke@435 | 200 | blk->do_oop(base); |
duke@435 | 201 | } |
duke@435 | 202 | base++; |
duke@435 | 203 | } |
duke@435 | 204 | } |
duke@435 | 205 | blk->do_oop(cp->tags_addr()); |
duke@435 | 206 | blk->do_oop(cp->cache_addr()); |
jrose@2268 | 207 | blk->do_oop(cp->operands_addr()); |
duke@435 | 208 | blk->do_oop(cp->pool_holder_addr()); |
duke@435 | 209 | return size; |
duke@435 | 210 | } |
duke@435 | 211 | |
duke@435 | 212 | |
duke@435 | 213 | int constantPoolKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { |
duke@435 | 214 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 215 | // Performance tweak: We skip iterating over the klass pointer since we |
duke@435 | 216 | // know that Universe::constantPoolKlassObj never moves. |
duke@435 | 217 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 218 | // Get size before changing pointers. |
duke@435 | 219 | // Don't call size() or oop_size() since that is a virtual call. |
duke@435 | 220 | int size = cp->object_size(); |
duke@435 | 221 | |
duke@435 | 222 | // If the tags array is null we are in the middle of allocating this constant |
duke@435 | 223 | // pool. |
duke@435 | 224 | if (cp->tags() != NULL) { |
duke@435 | 225 | oop* base = (oop*)cp->base(); |
duke@435 | 226 | for (int i = 0; i < cp->length(); i++) { |
duke@435 | 227 | if (mr.contains(base)) { |
duke@435 | 228 | if (cp->is_pointer_entry(i)) { |
duke@435 | 229 | blk->do_oop(base); |
duke@435 | 230 | } |
duke@435 | 231 | } |
duke@435 | 232 | base++; |
duke@435 | 233 | } |
duke@435 | 234 | } |
duke@435 | 235 | oop* addr; |
duke@435 | 236 | addr = cp->tags_addr(); |
duke@435 | 237 | blk->do_oop(addr); |
duke@435 | 238 | addr = cp->cache_addr(); |
duke@435 | 239 | blk->do_oop(addr); |
jrose@2268 | 240 | addr = cp->operands_addr(); |
jrose@2268 | 241 | blk->do_oop(addr); |
duke@435 | 242 | addr = cp->pool_holder_addr(); |
duke@435 | 243 | blk->do_oop(addr); |
duke@435 | 244 | return size; |
duke@435 | 245 | } |
duke@435 | 246 | |
jmasa@953 | 247 | bool constantPoolKlass::oop_is_conc_safe(oop obj) const { |
jmasa@953 | 248 | assert(obj->is_constantPool(), "must be constantPool"); |
jmasa@953 | 249 | return constantPoolOop(obj)->is_conc_safe(); |
jmasa@953 | 250 | } |
jmasa@953 | 251 | |
duke@435 | 252 | #ifndef SERIALGC |
duke@435 | 253 | int constantPoolKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { |
duke@435 | 254 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 255 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 256 | |
duke@435 | 257 | // If the tags array is null we are in the middle of allocating this constant |
duke@435 | 258 | // pool. |
duke@435 | 259 | if (cp->tags() != NULL) { |
duke@435 | 260 | oop* base = (oop*)cp->base(); |
duke@435 | 261 | for (int i = 0; i < cp->length(); ++i, ++base) { |
duke@435 | 262 | if (cp->is_pointer_entry(i)) { |
duke@435 | 263 | PSParallelCompact::adjust_pointer(base); |
duke@435 | 264 | } |
duke@435 | 265 | } |
duke@435 | 266 | } |
duke@435 | 267 | PSParallelCompact::adjust_pointer(cp->tags_addr()); |
duke@435 | 268 | PSParallelCompact::adjust_pointer(cp->cache_addr()); |
jrose@2268 | 269 | PSParallelCompact::adjust_pointer(cp->operands_addr()); |
duke@435 | 270 | PSParallelCompact::adjust_pointer(cp->pool_holder_addr()); |
duke@435 | 271 | return cp->object_size(); |
duke@435 | 272 | } |
duke@435 | 273 | |
duke@435 | 274 | int |
duke@435 | 275 | constantPoolKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, |
duke@435 | 276 | HeapWord* beg_addr, HeapWord* end_addr) { |
duke@435 | 277 | assert (obj->is_constantPool(), "obj must be constant pool"); |
duke@435 | 278 | constantPoolOop cp = (constantPoolOop) obj; |
duke@435 | 279 | |
duke@435 | 280 | // If the tags array is null we are in the middle of allocating this constant |
duke@435 | 281 | // pool. |
duke@435 | 282 | if (cp->tags() != NULL) { |
duke@435 | 283 | oop* base = (oop*)cp->base(); |
duke@435 | 284 | oop* const beg_oop = MAX2((oop*)beg_addr, base); |
duke@435 | 285 | oop* const end_oop = MIN2((oop*)end_addr, base + cp->length()); |
duke@435 | 286 | const size_t beg_idx = pointer_delta(beg_oop, base, sizeof(oop*)); |
duke@435 | 287 | const size_t end_idx = pointer_delta(end_oop, base, sizeof(oop*)); |
duke@435 | 288 | for (size_t cur_idx = beg_idx; cur_idx < end_idx; ++cur_idx, ++base) { |
duke@435 | 289 | if (cp->is_pointer_entry(int(cur_idx))) { |
duke@435 | 290 | PSParallelCompact::adjust_pointer(base); |
duke@435 | 291 | } |
duke@435 | 292 | } |
duke@435 | 293 | } |
duke@435 | 294 | |
duke@435 | 295 | oop* p; |
duke@435 | 296 | p = cp->tags_addr(); |
duke@435 | 297 | PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
duke@435 | 298 | p = cp->cache_addr(); |
duke@435 | 299 | PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
jrose@2268 | 300 | p = cp->operands_addr(); |
jrose@2268 | 301 | PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
duke@435 | 302 | p = cp->pool_holder_addr(); |
duke@435 | 303 | PSParallelCompact::adjust_pointer(p, beg_addr, end_addr); |
duke@435 | 304 | |
duke@435 | 305 | return cp->object_size(); |
duke@435 | 306 | } |
duke@435 | 307 | |
duke@435 | 308 | void constantPoolKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { |
duke@435 | 309 | assert(obj->is_constantPool(), "should be constant pool"); |
jrose@866 | 310 | constantPoolOop cp = (constantPoolOop) obj; |
jrose@866 | 311 | if (AnonymousClasses && cp->has_pseudo_string() && cp->tags() != NULL) { |
jrose@866 | 312 | oop* base = (oop*)cp->base(); |
jrose@866 | 313 | for (int i = 0; i < cp->length(); ++i, ++base) { |
jrose@866 | 314 | if (cp->tag_at(i).is_string()) { |
jrose@866 | 315 | if (PSScavenge::should_scavenge(base)) { |
jrose@866 | 316 | pm->claim_or_forward_depth(base); |
jrose@866 | 317 | } |
jrose@866 | 318 | } |
jrose@866 | 319 | } |
jrose@866 | 320 | } |
duke@435 | 321 | } |
duke@435 | 322 | #endif // SERIALGC |
duke@435 | 323 | |
duke@435 | 324 | // Printing |
duke@435 | 325 | |
duke@435 | 326 | void constantPoolKlass::oop_print_on(oop obj, outputStream* st) { |
duke@435 | 327 | EXCEPTION_MARK; |
duke@435 | 328 | oop anObj; |
duke@435 | 329 | assert(obj->is_constantPool(), "must be constantPool"); |
coleenp@548 | 330 | Klass::oop_print_on(obj, st); |
duke@435 | 331 | constantPoolOop cp = constantPoolOop(obj); |
jrose@866 | 332 | if (cp->flags() != 0) { |
jrose@1928 | 333 | st->print(" - flags: 0x%x", cp->flags()); |
jrose@866 | 334 | if (cp->has_pseudo_string()) st->print(" has_pseudo_string"); |
jrose@1161 | 335 | if (cp->has_invokedynamic()) st->print(" has_invokedynamic"); |
jrose@866 | 336 | st->cr(); |
jrose@866 | 337 | } |
jrose@1928 | 338 | st->print_cr(" - cache: " INTPTR_FORMAT, cp->cache()); |
duke@435 | 339 | |
duke@435 | 340 | for (int index = 1; index < cp->length(); index++) { // Index 0 is unused |
duke@435 | 341 | st->print(" - %3d : ", index); |
duke@435 | 342 | cp->tag_at(index).print_on(st); |
duke@435 | 343 | st->print(" : "); |
duke@435 | 344 | switch (cp->tag_at(index).value()) { |
duke@435 | 345 | case JVM_CONSTANT_Class : |
duke@435 | 346 | { anObj = cp->klass_at(index, CATCH); |
duke@435 | 347 | anObj->print_value_on(st); |
duke@435 | 348 | st->print(" {0x%lx}", (address)anObj); |
duke@435 | 349 | } |
duke@435 | 350 | break; |
duke@435 | 351 | case JVM_CONSTANT_Fieldref : |
duke@435 | 352 | case JVM_CONSTANT_Methodref : |
duke@435 | 353 | case JVM_CONSTANT_InterfaceMethodref : |
jrose@1928 | 354 | st->print("klass_index=%d", cp->uncached_klass_ref_index_at(index)); |
jrose@1928 | 355 | st->print(" name_and_type_index=%d", cp->uncached_name_and_type_ref_index_at(index)); |
duke@435 | 356 | break; |
duke@435 | 357 | case JVM_CONSTANT_UnresolvedString : |
duke@435 | 358 | case JVM_CONSTANT_String : |
jrose@866 | 359 | if (cp->is_pseudo_string_at(index)) { |
jrose@866 | 360 | anObj = cp->pseudo_string_at(index); |
jrose@866 | 361 | } else { |
jrose@866 | 362 | anObj = cp->string_at(index, CATCH); |
jrose@866 | 363 | } |
duke@435 | 364 | anObj->print_value_on(st); |
duke@435 | 365 | st->print(" {0x%lx}", (address)anObj); |
duke@435 | 366 | break; |
duke@435 | 367 | case JVM_CONSTANT_Integer : |
duke@435 | 368 | st->print("%d", cp->int_at(index)); |
duke@435 | 369 | break; |
duke@435 | 370 | case JVM_CONSTANT_Float : |
duke@435 | 371 | st->print("%f", cp->float_at(index)); |
duke@435 | 372 | break; |
duke@435 | 373 | case JVM_CONSTANT_Long : |
duke@435 | 374 | st->print_jlong(cp->long_at(index)); |
duke@435 | 375 | index++; // Skip entry following eigth-byte constant |
duke@435 | 376 | break; |
duke@435 | 377 | case JVM_CONSTANT_Double : |
duke@435 | 378 | st->print("%lf", cp->double_at(index)); |
duke@435 | 379 | index++; // Skip entry following eigth-byte constant |
duke@435 | 380 | break; |
duke@435 | 381 | case JVM_CONSTANT_NameAndType : |
duke@435 | 382 | st->print("name_index=%d", cp->name_ref_index_at(index)); |
duke@435 | 383 | st->print(" signature_index=%d", cp->signature_ref_index_at(index)); |
duke@435 | 384 | break; |
duke@435 | 385 | case JVM_CONSTANT_Utf8 : |
duke@435 | 386 | cp->symbol_at(index)->print_value_on(st); |
duke@435 | 387 | break; |
duke@435 | 388 | case JVM_CONSTANT_UnresolvedClass : // fall-through |
duke@435 | 389 | case JVM_CONSTANT_UnresolvedClassInError: { |
duke@435 | 390 | // unresolved_klass_at requires lock or safe world. |
duke@435 | 391 | oop entry = *cp->obj_at_addr(index); |
duke@435 | 392 | entry->print_value_on(st); |
duke@435 | 393 | } |
duke@435 | 394 | break; |
jrose@1957 | 395 | case JVM_CONSTANT_MethodHandle : |
jrose@1957 | 396 | st->print("ref_kind=%d", cp->method_handle_ref_kind_at(index)); |
jrose@1957 | 397 | st->print(" ref_index=%d", cp->method_handle_index_at(index)); |
jrose@1957 | 398 | break; |
jrose@1957 | 399 | case JVM_CONSTANT_MethodType : |
jrose@1957 | 400 | st->print("signature_index=%d", cp->method_type_index_at(index)); |
jrose@1957 | 401 | break; |
jrose@2015 | 402 | case JVM_CONSTANT_InvokeDynamic : |
jrose@2268 | 403 | { |
jrose@2268 | 404 | st->print("bootstrap_method_index=%d", cp->invoke_dynamic_bootstrap_method_ref_index_at(index)); |
jrose@2268 | 405 | st->print(" name_and_type_index=%d", cp->invoke_dynamic_name_and_type_ref_index_at(index)); |
jrose@2268 | 406 | int argc = cp->invoke_dynamic_argument_count_at(index); |
jrose@2268 | 407 | if (argc > 0) { |
jrose@2268 | 408 | for (int arg_i = 0; arg_i < argc; arg_i++) { |
jrose@2268 | 409 | int arg = cp->invoke_dynamic_argument_index_at(index, arg_i); |
jrose@2268 | 410 | st->print((arg_i == 0 ? " arguments={%d" : ", %d"), arg); |
jrose@2268 | 411 | } |
jrose@2268 | 412 | st->print("}"); |
jrose@2268 | 413 | } |
jrose@2268 | 414 | } |
jrose@2015 | 415 | break; |
duke@435 | 416 | default: |
duke@435 | 417 | ShouldNotReachHere(); |
duke@435 | 418 | break; |
duke@435 | 419 | } |
duke@435 | 420 | st->cr(); |
duke@435 | 421 | } |
duke@435 | 422 | st->cr(); |
duke@435 | 423 | } |
duke@435 | 424 | |
jrose@1590 | 425 | void constantPoolKlass::oop_print_value_on(oop obj, outputStream* st) { |
jrose@1590 | 426 | assert(obj->is_constantPool(), "must be constantPool"); |
jrose@1590 | 427 | constantPoolOop cp = constantPoolOop(obj); |
jrose@1590 | 428 | st->print("constant pool [%d]", cp->length()); |
jrose@1590 | 429 | if (cp->has_pseudo_string()) st->print("/pseudo_string"); |
jrose@1590 | 430 | if (cp->has_invokedynamic()) st->print("/invokedynamic"); |
jrose@2268 | 431 | if (cp->operands() != NULL) st->print("/operands[%d]", cp->operands()->length()); |
jrose@1590 | 432 | cp->print_address_on(st); |
jrose@1590 | 433 | st->print(" for "); |
jrose@1590 | 434 | cp->pool_holder()->print_value_on(st); |
jrose@1928 | 435 | if (cp->cache() != NULL) { |
jrose@1928 | 436 | st->print(" cache=" PTR_FORMAT, cp->cache()); |
jrose@1928 | 437 | } |
jrose@1590 | 438 | } |
duke@435 | 439 | |
duke@435 | 440 | const char* constantPoolKlass::internal_name() const { |
duke@435 | 441 | return "{constant pool}"; |
duke@435 | 442 | } |
duke@435 | 443 | |
duke@435 | 444 | // Verification |
duke@435 | 445 | |
duke@435 | 446 | void constantPoolKlass::oop_verify_on(oop obj, outputStream* st) { |
duke@435 | 447 | Klass::oop_verify_on(obj, st); |
duke@435 | 448 | guarantee(obj->is_constantPool(), "object must be constant pool"); |
duke@435 | 449 | constantPoolOop cp = constantPoolOop(obj); |
duke@435 | 450 | guarantee(cp->is_perm(), "should be in permspace"); |
duke@435 | 451 | if (!cp->partially_loaded()) { |
duke@435 | 452 | oop* base = (oop*)cp->base(); |
duke@435 | 453 | for (int i = 0; i< cp->length(); i++) { |
duke@435 | 454 | if (cp->tag_at(i).is_klass()) { |
duke@435 | 455 | guarantee((*base)->is_perm(), "should be in permspace"); |
duke@435 | 456 | guarantee((*base)->is_klass(), "should be klass"); |
duke@435 | 457 | } |
duke@435 | 458 | if (cp->tag_at(i).is_unresolved_klass()) { |
duke@435 | 459 | guarantee((*base)->is_perm(), "should be in permspace"); |
duke@435 | 460 | guarantee((*base)->is_symbol() || (*base)->is_klass(), |
duke@435 | 461 | "should be symbol or klass"); |
duke@435 | 462 | } |
duke@435 | 463 | if (cp->tag_at(i).is_symbol()) { |
duke@435 | 464 | guarantee((*base)->is_perm(), "should be in permspace"); |
duke@435 | 465 | guarantee((*base)->is_symbol(), "should be symbol"); |
duke@435 | 466 | } |
duke@435 | 467 | if (cp->tag_at(i).is_unresolved_string()) { |
duke@435 | 468 | guarantee((*base)->is_perm(), "should be in permspace"); |
duke@435 | 469 | guarantee((*base)->is_symbol() || (*base)->is_instance(), |
duke@435 | 470 | "should be symbol or instance"); |
duke@435 | 471 | } |
duke@435 | 472 | if (cp->tag_at(i).is_string()) { |
jrose@866 | 473 | if (!cp->has_pseudo_string()) { |
jrose@866 | 474 | guarantee((*base)->is_perm(), "should be in permspace"); |
jrose@866 | 475 | guarantee((*base)->is_instance(), "should be instance"); |
jrose@866 | 476 | } else { |
jrose@866 | 477 | // can be non-perm, can be non-instance (array) |
jrose@866 | 478 | } |
duke@435 | 479 | } |
jrose@1957 | 480 | // FIXME: verify JSR 292 tags JVM_CONSTANT_MethodHandle, etc. |
duke@435 | 481 | base++; |
duke@435 | 482 | } |
duke@435 | 483 | guarantee(cp->tags()->is_perm(), "should be in permspace"); |
duke@435 | 484 | guarantee(cp->tags()->is_typeArray(), "should be type array"); |
duke@435 | 485 | if (cp->cache() != NULL) { |
duke@435 | 486 | // Note: cache() can be NULL before a class is completely setup or |
duke@435 | 487 | // in temporary constant pools used during constant pool merging |
duke@435 | 488 | guarantee(cp->cache()->is_perm(), "should be in permspace"); |
duke@435 | 489 | guarantee(cp->cache()->is_constantPoolCache(), "should be constant pool cache"); |
duke@435 | 490 | } |
jrose@2268 | 491 | if (cp->operands() != NULL) { |
jrose@2268 | 492 | guarantee(cp->operands()->is_perm(), "should be in permspace"); |
jrose@2268 | 493 | guarantee(cp->operands()->is_typeArray(), "should be type array"); |
jrose@2268 | 494 | } |
duke@435 | 495 | if (cp->pool_holder() != NULL) { |
duke@435 | 496 | // Note: pool_holder() can be NULL in temporary constant pools |
duke@435 | 497 | // used during constant pool merging |
duke@435 | 498 | guarantee(cp->pool_holder()->is_perm(), "should be in permspace"); |
duke@435 | 499 | guarantee(cp->pool_holder()->is_klass(), "should be klass"); |
duke@435 | 500 | } |
duke@435 | 501 | } |
duke@435 | 502 | } |
duke@435 | 503 | |
duke@435 | 504 | bool constantPoolKlass::oop_partially_loaded(oop obj) const { |
duke@435 | 505 | assert(obj->is_constantPool(), "object must be constant pool"); |
duke@435 | 506 | constantPoolOop cp = constantPoolOop(obj); |
duke@435 | 507 | return cp->tags() == NULL || cp->pool_holder() == (klassOop) cp; // Check whether pool holder points to self |
duke@435 | 508 | } |
duke@435 | 509 | |
duke@435 | 510 | |
duke@435 | 511 | void constantPoolKlass::oop_set_partially_loaded(oop obj) { |
duke@435 | 512 | assert(obj->is_constantPool(), "object must be constant pool"); |
duke@435 | 513 | constantPoolOop cp = constantPoolOop(obj); |
duke@435 | 514 | assert(cp->pool_holder() == NULL, "just checking"); |
duke@435 | 515 | cp->set_pool_holder((klassOop) cp); // Temporarily set pool holder to point to self |
duke@435 | 516 | } |
duke@435 | 517 | |
duke@435 | 518 | #ifndef PRODUCT |
duke@435 | 519 | // CompileTheWorld support. Preload all classes loaded references in the passed in constantpool |
duke@435 | 520 | void constantPoolKlass::preload_and_initialize_all_classes(oop obj, TRAPS) { |
duke@435 | 521 | guarantee(obj->is_constantPool(), "object must be constant pool"); |
duke@435 | 522 | constantPoolHandle cp(THREAD, (constantPoolOop)obj); |
duke@435 | 523 | guarantee(!cp->partially_loaded(), "must be fully loaded"); |
duke@435 | 524 | |
duke@435 | 525 | for (int i = 0; i< cp->length(); i++) { |
duke@435 | 526 | if (cp->tag_at(i).is_unresolved_klass()) { |
duke@435 | 527 | // This will force loading of the class |
duke@435 | 528 | klassOop klass = cp->klass_at(i, CHECK); |
duke@435 | 529 | if (klass->is_instance()) { |
duke@435 | 530 | // Force initialization of class |
duke@435 | 531 | instanceKlass::cast(klass)->initialize(CHECK); |
duke@435 | 532 | } |
duke@435 | 533 | } |
duke@435 | 534 | } |
duke@435 | 535 | } |
duke@435 | 536 | |
duke@435 | 537 | #endif |