src/share/vm/oops/cpCacheKlass.cpp

Tue, 23 Nov 2010 13:22:55 -0800

author
stefank
date
Tue, 23 Nov 2010 13:22:55 -0800
changeset 2314
f95d63e2154a
parent 2068
7fcd5f39bd7a
child 2533
c5a923563727
permissions
-rw-r--r--

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 /*
stefank@2314 2 * Copyright (c) 1998, 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.hpp"
stefank@2314 29 #include "interpreter/bytecodes.hpp"
stefank@2314 30 #include "memory/genOopClosures.inline.hpp"
stefank@2314 31 #include "memory/permGen.hpp"
stefank@2314 32 #include "oops/constantPoolOop.hpp"
stefank@2314 33 #include "oops/cpCacheKlass.hpp"
stefank@2314 34 #include "oops/oop.inline.hpp"
stefank@2314 35 #include "runtime/handles.inline.hpp"
stefank@2314 36 #ifndef SERIALGC
stefank@2314 37 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
stefank@2314 38 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
stefank@2314 39 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
stefank@2314 40 #include "memory/cardTableRS.hpp"
stefank@2314 41 #include "oops/oop.pcgc.inline.hpp"
stefank@2314 42 #endif
duke@435 43
duke@435 44
duke@435 45 int constantPoolCacheKlass::oop_size(oop obj) const {
duke@435 46 assert(obj->is_constantPoolCache(), "must be constantPool");
duke@435 47 return constantPoolCacheOop(obj)->object_size();
duke@435 48 }
duke@435 49
duke@435 50
jmasa@977 51 constantPoolCacheOop constantPoolCacheKlass::allocate(int length,
jmasa@977 52 bool is_conc_safe,
jmasa@977 53 TRAPS) {
duke@435 54 // allocate memory
duke@435 55 int size = constantPoolCacheOopDesc::object_size(length);
jmasa@977 56
duke@435 57 KlassHandle klass (THREAD, as_klassOop());
jmasa@977 58
jmasa@977 59 // This is the original code. The code from permanent_obj_allocate()
jmasa@977 60 // was in-lined to allow the setting of is_conc_safe before the klass
jmasa@977 61 // is installed.
jmasa@977 62 // constantPoolCacheOop cache = (constantPoolCacheOop)
jmasa@977 63 // CollectedHeap::permanent_obj_allocate(klass, size, CHECK_NULL);
jmasa@977 64
jmasa@977 65 oop obj = CollectedHeap::permanent_obj_allocate_no_klass_install(klass, size, CHECK_NULL);
jmasa@977 66 constantPoolCacheOop cache = (constantPoolCacheOop) obj;
jmasa@977 67 cache->set_is_conc_safe(is_conc_safe);
jmasa@977 68 // The store to is_conc_safe must be visible before the klass
jmasa@977 69 // is set. This should be done safely because _is_conc_safe has
jmasa@977 70 // been declared volatile. If there are any problems, consider adding
jmasa@977 71 // OrderAccess::storestore();
jmasa@977 72 CollectedHeap::post_allocation_install_obj_klass(klass, obj, size);
jmasa@977 73 NOT_PRODUCT(Universe::heap()->check_for_bad_heap_word_value((HeapWord*) obj,
jmasa@977 74 size));
jmasa@977 75
jmasa@977 76 // The length field affects the size of the object. The allocation
jmasa@977 77 // above allocates the correct size (see calculation of "size") but
jmasa@977 78 // the size() method of the constant pool cache oop will not reflect
jmasa@977 79 // that size until the correct length is set.
coleenp@548 80 cache->set_length(length);
jmasa@977 81
jmasa@977 82 // The store of the length must be visible before is_conc_safe is
jmasa@977 83 // set to a safe state.
jmasa@977 84 // This should be done safely because _is_conc_safe has
jmasa@977 85 // been declared volatile. If there are any problems, consider adding
jmasa@977 86 // OrderAccess::storestore();
jmasa@977 87 cache->set_is_conc_safe(methodOopDesc::IsSafeConc);
duke@435 88 cache->set_constant_pool(NULL);
duke@435 89 return cache;
duke@435 90 }
duke@435 91
duke@435 92 klassOop constantPoolCacheKlass::create_klass(TRAPS) {
duke@435 93 constantPoolCacheKlass o;
coleenp@548 94 KlassHandle h_this_klass(THREAD, Universe::klassKlassObj());
coleenp@548 95 KlassHandle k = base_create_klass(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL);
coleenp@548 96 // Make sure size calculation is right
coleenp@548 97 assert(k()->size() == align_object_size(header_size()), "wrong size for object");
coleenp@548 98 java_lang_Class::create_mirror(k, CHECK_NULL); // Allocate mirror
duke@435 99 return k();
duke@435 100 }
duke@435 101
duke@435 102
duke@435 103 void constantPoolCacheKlass::oop_follow_contents(oop obj) {
duke@435 104 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 105 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 106 // Performance tweak: We skip iterating over the klass pointer since we
duke@435 107 // know that Universe::constantPoolCacheKlassObj never moves.
duke@435 108 // gc of constant pool cache instance variables
duke@435 109 MarkSweep::mark_and_push((oop*)cache->constant_pool_addr());
duke@435 110 // gc of constant pool cache entries
duke@435 111 int i = cache->length();
duke@435 112 while (i-- > 0) cache->entry_at(i)->follow_contents();
duke@435 113 }
duke@435 114
duke@435 115 #ifndef SERIALGC
duke@435 116 void constantPoolCacheKlass::oop_follow_contents(ParCompactionManager* cm,
duke@435 117 oop obj) {
duke@435 118 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 119 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 120 // Performance tweak: We skip iterating over the klass pointer since we
duke@435 121 // know that Universe::constantPoolCacheKlassObj never moves.
duke@435 122 // gc of constant pool cache instance variables
duke@435 123 PSParallelCompact::mark_and_push(cm, (oop*)cache->constant_pool_addr());
duke@435 124 // gc of constant pool cache entries
duke@435 125 int i = cache->length();
duke@435 126 while (i-- > 0) cache->entry_at(i)->follow_contents(cm);
duke@435 127 }
duke@435 128 #endif // SERIALGC
duke@435 129
duke@435 130
duke@435 131 int constantPoolCacheKlass::oop_oop_iterate(oop obj, OopClosure* blk) {
duke@435 132 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 133 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 134 // Get size before changing pointers.
duke@435 135 // Don't call size() or oop_size() since that is a virtual call.
duke@435 136 int size = cache->object_size();
duke@435 137 // Performance tweak: We skip iterating over the klass pointer since we
duke@435 138 // know that Universe::constantPoolCacheKlassObj never moves.
duke@435 139 // iteration over constant pool cache instance variables
duke@435 140 blk->do_oop((oop*)cache->constant_pool_addr());
duke@435 141 // iteration over constant pool cache entries
duke@435 142 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->oop_iterate(blk);
duke@435 143 return size;
duke@435 144 }
duke@435 145
duke@435 146
duke@435 147 int constantPoolCacheKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) {
duke@435 148 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 149 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 150 // Get size before changing pointers.
duke@435 151 // Don't call size() or oop_size() since that is a virtual call.
duke@435 152 int size = cache->object_size();
duke@435 153 // Performance tweak: We skip iterating over the klass pointer since we
duke@435 154 // know that Universe::constantPoolCacheKlassObj never moves.
duke@435 155 // iteration over constant pool cache instance variables
duke@435 156 oop* addr = (oop*)cache->constant_pool_addr();
duke@435 157 if (mr.contains(addr)) blk->do_oop(addr);
duke@435 158 // iteration over constant pool cache entries
duke@435 159 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->oop_iterate_m(blk, mr);
duke@435 160 return size;
duke@435 161 }
duke@435 162
duke@435 163 int constantPoolCacheKlass::oop_adjust_pointers(oop obj) {
duke@435 164 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 165 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 166 // Get size before changing pointers.
duke@435 167 // Don't call size() or oop_size() since that is a virtual call.
duke@435 168 int size = cache->object_size();
duke@435 169 // Performance tweak: We skip iterating over the klass pointer since we
duke@435 170 // know that Universe::constantPoolCacheKlassObj never moves.
duke@435 171 // Iteration over constant pool cache instance variables
duke@435 172 MarkSweep::adjust_pointer((oop*)cache->constant_pool_addr());
duke@435 173 // iteration over constant pool cache entries
duke@435 174 for (int i = 0; i < cache->length(); i++)
duke@435 175 cache->entry_at(i)->adjust_pointers();
duke@435 176 return size;
duke@435 177 }
duke@435 178
jmasa@977 179 bool constantPoolCacheKlass::oop_is_conc_safe(oop obj) const {
jmasa@981 180 assert(obj->is_constantPoolCache(), "should be constant pool");
jmasa@977 181 return constantPoolCacheOop(obj)->is_conc_safe();
jmasa@977 182 }
jmasa@977 183
duke@435 184 #ifndef SERIALGC
duke@435 185 void constantPoolCacheKlass::oop_push_contents(PSPromotionManager* pm,
duke@435 186 oop obj) {
duke@435 187 assert(obj->is_constantPoolCache(), "should be constant pool");
jrose@1161 188 if (EnableInvokeDynamic) {
jrose@1161 189 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
jrose@1161 190 // during a scavenge, it is safe to inspect my pool, since it is perm
jrose@1161 191 constantPoolOop pool = cache->constant_pool();
jrose@1161 192 assert(pool->is_constantPool(), "should be constant pool");
jrose@1161 193 if (pool->has_invokedynamic()) {
jrose@1161 194 for (int i = 0; i < cache->length(); i++) {
jrose@1161 195 ConstantPoolCacheEntry* e = cache->entry_at(i);
jrose@1161 196 oop* p = (oop*)&e->_f1;
jrose@1161 197 if (e->is_secondary_entry()) {
jrose@1161 198 if (PSScavenge::should_scavenge(p))
jrose@1161 199 pm->claim_or_forward_depth(p);
jrose@1161 200 assert(!(e->is_vfinal() && PSScavenge::should_scavenge((oop*)&e->_f2)),
jrose@1161 201 "no live oops here");
jrose@1161 202 }
jrose@1161 203 }
jrose@1161 204 }
jrose@1161 205 }
duke@435 206 }
duke@435 207
duke@435 208 int
duke@435 209 constantPoolCacheKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
duke@435 210 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 211 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 212
duke@435 213 // Iteration over constant pool cache instance variables
duke@435 214 PSParallelCompact::adjust_pointer((oop*)cache->constant_pool_addr());
duke@435 215
duke@435 216 // iteration over constant pool cache entries
duke@435 217 for (int i = 0; i < cache->length(); ++i) {
duke@435 218 cache->entry_at(i)->update_pointers();
duke@435 219 }
duke@435 220
duke@435 221 return cache->object_size();
duke@435 222 }
duke@435 223
duke@435 224 int
duke@435 225 constantPoolCacheKlass::oop_update_pointers(ParCompactionManager* cm, oop obj,
duke@435 226 HeapWord* beg_addr,
duke@435 227 HeapWord* end_addr) {
duke@435 228 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 229 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 230
duke@435 231 // Iteration over constant pool cache instance variables
duke@435 232 oop* p;
duke@435 233 p = (oop*)cache->constant_pool_addr();
duke@435 234 PSParallelCompact::adjust_pointer(p, beg_addr, end_addr);
duke@435 235
duke@435 236 // Iteration over constant pool cache entries
duke@435 237 for (int i = 0; i < cache->length(); ++i) {
duke@435 238 cache->entry_at(i)->update_pointers(beg_addr, end_addr);
duke@435 239 }
duke@435 240 return cache->object_size();
duke@435 241 }
duke@435 242 #endif // SERIALGC
duke@435 243
duke@435 244 void constantPoolCacheKlass::oop_print_on(oop obj, outputStream* st) {
duke@435 245 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 246 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 247 // super print
coleenp@548 248 Klass::oop_print_on(obj, st);
duke@435 249 // print constant pool cache entries
duke@435 250 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->print(st, i);
duke@435 251 }
duke@435 252
jrose@1590 253 void constantPoolCacheKlass::oop_print_value_on(oop obj, outputStream* st) {
jrose@1590 254 assert(obj->is_constantPoolCache(), "obj must be constant pool cache");
jrose@1590 255 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
jrose@1590 256 st->print("cache [%d]", cache->length());
jrose@1590 257 cache->print_address_on(st);
jrose@1590 258 st->print(" for ");
jrose@1590 259 cache->constant_pool()->print_value_on(st);
jrose@1590 260 }
jrose@1590 261
duke@435 262 void constantPoolCacheKlass::oop_verify_on(oop obj, outputStream* st) {
duke@435 263 guarantee(obj->is_constantPoolCache(), "obj must be constant pool cache");
duke@435 264 constantPoolCacheOop cache = (constantPoolCacheOop)obj;
duke@435 265 // super verify
coleenp@548 266 Klass::oop_verify_on(obj, st);
duke@435 267 // print constant pool cache entries
duke@435 268 for (int i = 0; i < cache->length(); i++) cache->entry_at(i)->verify(st);
duke@435 269 }
duke@435 270
duke@435 271
duke@435 272 const char* constantPoolCacheKlass::internal_name() const {
duke@435 273 return "{constant pool cache}";
duke@435 274 }

mercurial