src/share/vm/oops/cpCache.hpp

Tue, 26 Nov 2013 14:35:38 +0100

author
sjohanss
date
Tue, 26 Nov 2013 14:35:38 +0100
changeset 6148
55a0da3d420b
parent 6081
41cb10cbfb3c
child 6493
3205e78d8193
permissions
-rw-r--r--

8027675: Full collections with Serial slower in JDK 8 compared to 7u40
Summary: Reduced the number of calls to follow_class_loader and instead marked and pushed the klass holder directly. Also removed unneeded calls to adjust_klass.
Reviewed-by: coleenp, jmasa, mgerdin, tschatzl

duke@435 1 /*
dcubed@4562 2 * Copyright (c) 1998, 2013, 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 #ifndef SHARE_VM_OOPS_CPCACHEOOP_HPP
stefank@2314 26 #define SHARE_VM_OOPS_CPCACHEOOP_HPP
stefank@2314 27
stefank@2314 28 #include "interpreter/bytecodes.hpp"
stefank@2314 29 #include "memory/allocation.hpp"
stefank@2314 30 #include "utilities/array.hpp"
stefank@2314 31
coleenp@4037 32 class PSPromotionManager;
coleenp@4037 33
coleenp@6081 34 // The ConstantPoolCache is not a cache! It is the resolution table that the
coleenp@6081 35 // interpreter uses to avoid going into the runtime and a way to access resolved
coleenp@6081 36 // values.
coleenp@6081 37
duke@435 38 // A ConstantPoolCacheEntry describes an individual entry of the constant
duke@435 39 // pool cache. There's 2 principal kinds of entries: field entries for in-
duke@435 40 // stance & static field access, and method entries for invokes. Some of
duke@435 41 // the entry layout is shared and looks as follows:
duke@435 42 //
duke@435 43 // bit number |31 0|
duke@435 44 // bit length |-8--|-8--|---16----|
duke@435 45 // --------------------------------
coleenp@4037 46 // _indices [ b2 | b1 | index ] index = constant_pool_index
coleenp@4037 47 // _f1 [ entry specific ] metadata ptr (method or klass)
coleenp@4037 48 // _f2 [ entry specific ] vtable or res_ref index, or vfinal method ptr
twisti@4133 49 // _flags [tos|0|F=1|0|0|0|f|v|0 |0000|field_index] (for field entries)
twisti@4133 50 // bit length [ 4 |1| 1 |1|1|1|1|1|1 |-4--|----16-----]
twisti@4133 51 // _flags [tos|0|F=0|M|A|I|f|0|vf|0000|00000|psize] (for method entries)
twisti@4133 52 // bit length [ 4 |1| 1 |1|1|1|1|1|1 |-4--|--8--|--8--]
duke@435 53
duke@435 54 // --------------------------------
duke@435 55 //
duke@435 56 // with:
duke@435 57 // index = original constant pool index
duke@435 58 // b1 = bytecode 1
duke@435 59 // b2 = bytecode 2
twisti@3969 60 // psize = parameters size (method entries only)
coleenp@4037 61 // field_index = index into field information in holder InstanceKlass
duke@435 62 // The index max is 0xffff (max number of fields in constant pool)
coleenp@4037 63 // and is multiplied by (InstanceKlass::next_offset) when accessing.
coleenp@4037 64 // tos = TosState
coleenp@4037 65 // F = the entry is for a field (or F=0 for a method)
coleenp@4037 66 // A = call site has an appendix argument (loaded from resolved references)
coleenp@4037 67 // I = interface call is forced virtual (must use a vtable index or vfinal)
coleenp@4037 68 // f = field or method is final
coleenp@4037 69 // v = field is volatile
coleenp@4037 70 // vf = virtual but final (method entries only: is_vfinal())
duke@435 71 //
duke@435 72 // The flags after TosState have the following interpretation:
twisti@3969 73 // bit 27: 0 for fields, 1 for methods
twisti@3969 74 // f flag true if field is marked final
twisti@3969 75 // v flag true if field is volatile (only for fields)
twisti@3969 76 // f2 flag true if f2 contains an oop (e.g., virtual final method)
twisti@3969 77 // fv flag true if invokeinterface used for method in class Object
duke@435 78 //
duke@435 79 // The flags 31, 30, 29, 28 together build a 4 bit number 0 to 8 with the
duke@435 80 // following mapping to the TosState states:
duke@435 81 //
duke@435 82 // btos: 0
duke@435 83 // ctos: 1
duke@435 84 // stos: 2
duke@435 85 // itos: 3
duke@435 86 // ltos: 4
duke@435 87 // ftos: 5
duke@435 88 // dtos: 6
duke@435 89 // atos: 7
duke@435 90 // vtos: 8
duke@435 91 //
duke@435 92 // Entry specific: field entries:
duke@435 93 // _indices = get (b1 section) and put (b2 section) bytecodes, original constant pool index
coleenp@4037 94 // _f1 = field holder (as a java.lang.Class, not a Klass*)
twisti@3969 95 // _f2 = field offset in bytes
twisti@3969 96 // _flags = field type information, original FieldInfo index in field holder
duke@435 97 // (field_index section)
duke@435 98 //
duke@435 99 // Entry specific: method entries:
duke@435 100 // _indices = invoke code for f1 (b1 section), invoke code for f2 (b2 section),
duke@435 101 // original constant pool index
coleenp@4037 102 // _f1 = Method* for non-virtual calls, unused by virtual calls.
twisti@3969 103 // for interface calls, which are essentially virtual but need a klass,
coleenp@4037 104 // contains Klass* for the corresponding interface.
twisti@3969 105 // for invokedynamic, f1 contains a site-specific CallSite object (as an appendix)
twisti@3969 106 // for invokehandle, f1 contains a site-specific MethodType object (as an appendix)
twisti@3969 107 // (upcoming metadata changes will move the appendix to a separate array)
coleenp@4037 108 // _f2 = vtable/itable index (or final Method*) for virtual calls only,
twisti@3969 109 // unused by non-virtual. The is_vfinal flag indicates this is a
twisti@3969 110 // method pointer for a final method, not an index.
twisti@3969 111 // _flags = method type info (t section),
twisti@3969 112 // virtual final bit (vfinal),
twisti@3969 113 // parameter size (psize section)
duke@435 114 //
duke@435 115 // Note: invokevirtual & invokespecial bytecodes can share the same constant
duke@435 116 // pool entry and thus the same constant pool cache entry. All invoke
duke@435 117 // bytecodes but invokevirtual use only _f1 and the corresponding b1
duke@435 118 // bytecode, while invokevirtual uses only _f2 and the corresponding
duke@435 119 // b2 bytecode. The value of _flags is shared for both types of entries.
duke@435 120 //
duke@435 121 // The fields are volatile so that they are stored in the order written in the
duke@435 122 // source code. The _indices field with the bytecode must be written last.
duke@435 123
twisti@4253 124 class CallInfo;
twisti@4253 125
duke@435 126 class ConstantPoolCacheEntry VALUE_OBJ_CLASS_SPEC {
duke@435 127 friend class VMStructs;
jrose@1161 128 friend class constantPoolCacheKlass;
coleenp@4037 129 friend class ConstantPool;
coleenp@4037 130 friend class InterpreterRuntime;
jrose@1161 131
duke@435 132 private:
duke@435 133 volatile intx _indices; // constant pool index & rewrite bytecodes
coleenp@4037 134 volatile Metadata* _f1; // entry specific metadata field
coleenp@4037 135 volatile intx _f2; // entry specific int/metadata field
duke@435 136 volatile intx _flags; // flags
duke@435 137
duke@435 138
duke@435 139 void set_bytecode_1(Bytecodes::Code code);
duke@435 140 void set_bytecode_2(Bytecodes::Code code);
coleenp@4037 141 void set_f1(Metadata* f1) {
coleenp@4037 142 Metadata* existing_f1 = (Metadata*)_f1; // read once
duke@435 143 assert(existing_f1 == NULL || existing_f1 == f1, "illegal field change");
coleenp@4037 144 _f1 = f1;
duke@435 145 }
coleenp@4037 146 void release_set_f1(Metadata* f1);
rbackman@5415 147 void set_f2(intx f2) {
rbackman@5415 148 intx existing_f2 = _f2; // read once
rbackman@5415 149 assert(existing_f2 == 0 || existing_f2 == f2, "illegal field change");
rbackman@5415 150 _f2 = f2;
rbackman@5415 151 }
rbackman@5415 152 void set_f2_as_vfinal_method(Method* f2) {
rbackman@5415 153 assert(is_vfinal(), "flags must be set");
rbackman@5415 154 set_f2((intx)f2);
rbackman@5415 155 }
twisti@3969 156 int make_flags(TosState state, int option_bits, int field_index_or_method_params);
duke@435 157 void set_flags(intx flags) { _flags = flags; }
twisti@3969 158 bool init_flags_atomic(intx flags);
twisti@3969 159 void set_field_flags(TosState field_type, int option_bits, int field_index) {
twisti@3969 160 assert((field_index & field_index_mask) == field_index, "field_index in range");
twisti@3969 161 set_flags(make_flags(field_type, option_bits | (1 << is_field_entry_shift), field_index));
twisti@3969 162 }
twisti@3969 163 void set_method_flags(TosState return_type, int option_bits, int method_params) {
twisti@3969 164 assert((method_params & parameter_size_mask) == method_params, "method_params in range");
twisti@3969 165 set_flags(make_flags(return_type, option_bits, method_params));
twisti@3969 166 }
twisti@3969 167 bool init_method_flags_atomic(TosState return_type, int option_bits, int method_params) {
twisti@3969 168 assert((method_params & parameter_size_mask) == method_params, "method_params in range");
twisti@3969 169 return init_flags_atomic(make_flags(return_type, option_bits, method_params));
twisti@3969 170 }
duke@435 171
duke@435 172 public:
twisti@3969 173 // specific bit definitions for the flags field:
twisti@3969 174 // (Note: the interpreter must use these definitions to access the CP cache.)
twisti@3969 175 enum {
twisti@3969 176 // high order bits are the TosState corresponding to field type or method return type
twisti@3969 177 tos_state_bits = 4,
twisti@3969 178 tos_state_mask = right_n_bits(tos_state_bits),
twisti@3969 179 tos_state_shift = BitsPerInt - tos_state_bits, // see verify_tos_state_shift below
twisti@3969 180 // misc. option bits; can be any bit position in [16..27]
coleenp@4037 181 is_field_entry_shift = 26, // (F) is it a field or a method?
twisti@4133 182 has_method_type_shift = 25, // (M) does the call site have a MethodType?
twisti@4133 183 has_appendix_shift = 24, // (A) does the call site have an appendix argument?
twisti@4133 184 is_forced_virtual_shift = 23, // (I) is the interface reference forced to virtual mode?
twisti@4133 185 is_final_shift = 22, // (f) is the field or method final?
twisti@4133 186 is_volatile_shift = 21, // (v) is the field volatile?
twisti@4133 187 is_vfinal_shift = 20, // (vf) did the call resolve to a final method?
twisti@3969 188 // low order bits give field index (for FieldInfo) or method parameter size:
twisti@3969 189 field_index_bits = 16,
twisti@3969 190 field_index_mask = right_n_bits(field_index_bits),
twisti@3969 191 parameter_size_bits = 8, // subset of field_index_mask, range is 0..255
twisti@3969 192 parameter_size_mask = right_n_bits(parameter_size_bits),
twisti@3969 193 option_bits_mask = ~(((-1) << tos_state_shift) | (field_index_mask | parameter_size_mask))
duke@435 194 };
duke@435 195
twisti@3969 196 // specific bit definitions for the indices field:
twisti@3969 197 enum {
coleenp@4037 198 cp_index_bits = 2*BitsPerByte,
coleenp@4037 199 cp_index_mask = right_n_bits(cp_index_bits),
coleenp@4037 200 bytecode_1_shift = cp_index_bits,
twisti@3969 201 bytecode_1_mask = right_n_bits(BitsPerByte), // == (u1)0xFF
coleenp@4037 202 bytecode_2_shift = cp_index_bits + BitsPerByte,
coleenp@4037 203 bytecode_2_mask = right_n_bits(BitsPerByte) // == (u1)0xFF
twisti@3969 204 };
duke@435 205
duke@435 206
duke@435 207 // Initialization
jrose@1494 208 void initialize_entry(int original_index); // initialize primary entry
coleenp@4037 209 void initialize_resolved_reference_index(int ref_index) {
coleenp@4037 210 assert(_f2 == 0, "set once"); // note: ref_index might be zero also
coleenp@4037 211 _f2 = ref_index;
coleenp@4037 212 }
duke@435 213
duke@435 214 void set_field( // sets entry to resolved field state
duke@435 215 Bytecodes::Code get_code, // the bytecode used for reading the field
duke@435 216 Bytecodes::Code put_code, // the bytecode used for writing the field
duke@435 217 KlassHandle field_holder, // the object/klass holding the field
duke@435 218 int orig_field_index, // the original field index in the field holder
duke@435 219 int field_offset, // the field offset in words in the field holder
duke@435 220 TosState field_type, // the (machine) field type
duke@435 221 bool is_final, // the field is final
coleenp@4037 222 bool is_volatile, // the field is volatile
coleenp@4037 223 Klass* root_klass // needed by the GC to dirty the klass
duke@435 224 );
duke@435 225
drchase@5732 226 private:
drchase@5732 227 void set_direct_or_vtable_call(
duke@435 228 Bytecodes::Code invoke_code, // the bytecode used for invoking the method
duke@435 229 methodHandle method, // the method/prototype if any (NULL, otherwise)
duke@435 230 int vtable_index // the vtable index if any, else negative
duke@435 231 );
duke@435 232
drchase@5732 233 public:
drchase@5732 234 void set_direct_call( // sets entry to exact concrete method entry
drchase@5732 235 Bytecodes::Code invoke_code, // the bytecode used for invoking the method
drchase@5732 236 methodHandle method // the method to call
drchase@5732 237 );
drchase@5732 238
drchase@5732 239 void set_vtable_call( // sets entry to vtable index
drchase@5732 240 Bytecodes::Code invoke_code, // the bytecode used for invoking the method
drchase@5732 241 methodHandle method, // resolved method which declares the vtable index
drchase@5732 242 int vtable_index // the vtable index
drchase@5732 243 );
drchase@5732 244
drchase@5732 245 void set_itable_call(
drchase@5732 246 Bytecodes::Code invoke_code, // the bytecode used; must be invokeinterface
drchase@5732 247 methodHandle method, // the resolved interface method
drchase@5732 248 int itable_index // index into itable for the method
duke@435 249 );
duke@435 250
twisti@3969 251 void set_method_handle(
twisti@4049 252 constantPoolHandle cpool, // holding constant pool (required for locking)
twisti@4253 253 const CallInfo &call_info // Call link information
jrose@1161 254 );
jrose@1161 255
twisti@3969 256 void set_dynamic_call(
twisti@4049 257 constantPoolHandle cpool, // holding constant pool (required for locking)
twisti@4253 258 const CallInfo &call_info // Call link information
twisti@3969 259 );
jrose@2982 260
twisti@3969 261 // Common code for invokedynamic and MH invocations.
jrose@2015 262
twisti@3969 263 // The "appendix" is an optional call-site-specific parameter which is
twisti@3969 264 // pushed by the JVM at the end of the argument list. This argument may
twisti@3969 265 // be a MethodType for the MH.invokes and a CallSite for an invokedynamic
twisti@3969 266 // instruction. However, its exact type and use depends on the Java upcall,
twisti@3969 267 // which simply returns a compiled LambdaForm along with any reference
twisti@3969 268 // that LambdaForm needs to complete the call. If the upcall returns a
twisti@3969 269 // null appendix, the argument is not passed at all.
twisti@3969 270 //
twisti@3969 271 // The appendix is *not* represented in the signature of the symbolic
twisti@3969 272 // reference for the call site, but (if present) it *is* represented in
coleenp@4037 273 // the Method* bound to the site. This means that static and dynamic
twisti@3969 274 // resolution logic needs to make slightly different assessments about the
twisti@3969 275 // number and types of arguments.
twisti@3969 276 void set_method_handle_common(
twisti@4049 277 constantPoolHandle cpool, // holding constant pool (required for locking)
twisti@3969 278 Bytecodes::Code invoke_code, // _invokehandle or _invokedynamic
twisti@4253 279 const CallInfo &call_info // Call link information
twisti@3969 280 );
twisti@3969 281
twisti@4133 282 // invokedynamic and invokehandle call sites have two entries in the
twisti@4133 283 // resolved references array:
twisti@4133 284 // appendix (at index+0)
twisti@4133 285 // MethodType (at index+1)
twisti@4133 286 enum {
twisti@4133 287 _indy_resolved_references_appendix_offset = 0,
twisti@4133 288 _indy_resolved_references_method_type_offset = 1,
twisti@4133 289 _indy_resolved_references_entries
twisti@4133 290 };
twisti@4133 291
twisti@4133 292 Method* method_if_resolved(constantPoolHandle cpool);
twisti@4133 293 oop appendix_if_resolved(constantPoolHandle cpool);
twisti@4133 294 oop method_type_if_resolved(constantPoolHandle cpool);
twisti@3969 295
twisti@3969 296 void set_parameter_size(int value);
duke@435 297
duke@435 298 // Which bytecode number (1 or 2) in the index field is valid for this bytecode?
duke@435 299 // Returns -1 if neither is valid.
duke@435 300 static int bytecode_number(Bytecodes::Code code) {
duke@435 301 switch (code) {
duke@435 302 case Bytecodes::_getstatic : // fall through
duke@435 303 case Bytecodes::_getfield : // fall through
duke@435 304 case Bytecodes::_invokespecial : // fall through
duke@435 305 case Bytecodes::_invokestatic : // fall through
twisti@4133 306 case Bytecodes::_invokehandle : // fall through
twisti@4133 307 case Bytecodes::_invokedynamic : // fall through
duke@435 308 case Bytecodes::_invokeinterface : return 1;
duke@435 309 case Bytecodes::_putstatic : // fall through
duke@435 310 case Bytecodes::_putfield : // fall through
duke@435 311 case Bytecodes::_invokevirtual : return 2;
duke@435 312 default : break;
duke@435 313 }
duke@435 314 return -1;
duke@435 315 }
duke@435 316
duke@435 317 // Has this bytecode been resolved? Only valid for invokes and get/put field/static.
duke@435 318 bool is_resolved(Bytecodes::Code code) const {
duke@435 319 switch (bytecode_number(code)) {
duke@435 320 case 1: return (bytecode_1() == code);
duke@435 321 case 2: return (bytecode_2() == code);
duke@435 322 }
duke@435 323 return false; // default: not resolved
duke@435 324 }
duke@435 325
duke@435 326 // Accessors
coleenp@4037 327 int indices() const { return _indices; }
coleenp@4037 328 int constant_pool_index() const { return (indices() & cp_index_mask); }
coleenp@4037 329 Bytecodes::Code bytecode_1() const { return Bytecodes::cast((indices() >> bytecode_1_shift) & bytecode_1_mask); }
coleenp@4037 330 Bytecodes::Code bytecode_2() const { return Bytecodes::cast((indices() >> bytecode_2_shift) & bytecode_2_mask); }
coleenp@4037 331 Method* f1_as_method() const { Metadata* f1 = (Metadata*)_f1; assert(f1 == NULL || f1->is_method(), ""); return (Method*)f1; }
coleenp@4037 332 Klass* f1_as_klass() const { Metadata* f1 = (Metadata*)_f1; assert(f1 == NULL || f1->is_klass(), ""); return (Klass*)f1; }
coleenp@4037 333 bool is_f1_null() const { Metadata* f1 = (Metadata*)_f1; return f1 == NULL; } // classifies a CPC entry as unbound
twisti@3969 334 int f2_as_index() const { assert(!is_vfinal(), ""); return (int) _f2; }
coleenp@4037 335 Method* f2_as_vfinal_method() const { assert(is_vfinal(), ""); return (Method*)_f2; }
twisti@3969 336 int field_index() const { assert(is_field_entry(), ""); return (_flags & field_index_mask); }
twisti@3969 337 int parameter_size() const { assert(is_method_entry(), ""); return (_flags & parameter_size_mask); }
twisti@3969 338 bool is_volatile() const { return (_flags & (1 << is_volatile_shift)) != 0; }
twisti@3969 339 bool is_final() const { return (_flags & (1 << is_final_shift)) != 0; }
twisti@3969 340 bool is_forced_virtual() const { return (_flags & (1 << is_forced_virtual_shift)) != 0; }
twisti@3969 341 bool is_vfinal() const { return (_flags & (1 << is_vfinal_shift)) != 0; }
coleenp@4037 342 bool has_appendix() const { return (_flags & (1 << has_appendix_shift)) != 0; }
twisti@4133 343 bool has_method_type() const { return (_flags & (1 << has_method_type_shift)) != 0; }
twisti@3969 344 bool is_method_entry() const { return (_flags & (1 << is_field_entry_shift)) == 0; }
twisti@3969 345 bool is_field_entry() const { return (_flags & (1 << is_field_entry_shift)) != 0; }
twisti@3969 346 bool is_byte() const { return flag_state() == btos; }
twisti@3969 347 bool is_char() const { return flag_state() == ctos; }
twisti@3969 348 bool is_short() const { return flag_state() == stos; }
twisti@3969 349 bool is_int() const { return flag_state() == itos; }
twisti@3969 350 bool is_long() const { return flag_state() == ltos; }
twisti@3969 351 bool is_float() const { return flag_state() == ftos; }
twisti@3969 352 bool is_double() const { return flag_state() == dtos; }
twisti@3969 353 bool is_object() const { return flag_state() == atos; }
twisti@3969 354 TosState flag_state() const { assert((uint)number_of_states <= (uint)tos_state_mask+1, "");
twisti@3969 355 return (TosState)((_flags >> tos_state_shift) & tos_state_mask); }
duke@435 356
duke@435 357 // Code generation support
duke@435 358 static WordSize size() { return in_WordSize(sizeof(ConstantPoolCacheEntry) / HeapWordSize); }
jrose@1494 359 static ByteSize size_in_bytes() { return in_ByteSize(sizeof(ConstantPoolCacheEntry)); }
duke@435 360 static ByteSize indices_offset() { return byte_offset_of(ConstantPoolCacheEntry, _indices); }
duke@435 361 static ByteSize f1_offset() { return byte_offset_of(ConstantPoolCacheEntry, _f1); }
duke@435 362 static ByteSize f2_offset() { return byte_offset_of(ConstantPoolCacheEntry, _f2); }
duke@435 363 static ByteSize flags_offset() { return byte_offset_of(ConstantPoolCacheEntry, _flags); }
duke@435 364
dcubed@4562 365 #if INCLUDE_JVMTI
duke@435 366 // RedefineClasses() API support:
dcubed@4562 367 // If this ConstantPoolCacheEntry refers to old_method then update it
duke@435 368 // to refer to new_method.
duke@435 369 // trace_name_printed is set to true if the current call has
duke@435 370 // printed the klass name so that other routines in the adjust_*
duke@435 371 // group don't print the klass name.
coleenp@4037 372 bool adjust_method_entry(Method* old_method, Method* new_method,
duke@435 373 bool * trace_name_printed);
dcubed@4562 374 bool check_no_old_or_obsolete_entries();
coleenp@4037 375 bool is_interesting_method_entry(Klass* k);
dcubed@4562 376 #endif // INCLUDE_JVMTI
duke@435 377
duke@435 378 // Debugging & Printing
duke@435 379 void print (outputStream* st, int index) const;
duke@435 380 void verify(outputStream* st) const;
duke@435 381
twisti@3969 382 static void verify_tos_state_shift() {
twisti@3969 383 // When shifting flags as a 32-bit int, make sure we don't need an extra mask for tos_state:
twisti@3969 384 assert((((u4)-1 >> tos_state_shift) & ~tos_state_mask) == 0, "no need for tos_state mask");
duke@435 385 }
duke@435 386 };
duke@435 387
duke@435 388
duke@435 389 // A constant pool cache is a runtime data structure set aside to a constant pool. The cache
duke@435 390 // holds interpreter runtime information for all field access and invoke bytecodes. The cache
duke@435 391 // is created and initialized before a class is actively used (i.e., initialized), the indivi-
duke@435 392 // dual cache entries are filled at resolution (i.e., "link") time (see also: rewriter.*).
duke@435 393
coleenp@4037 394 class ConstantPoolCache: public MetaspaceObj {
duke@435 395 friend class VMStructs;
coleenp@4037 396 friend class MetadataFactory;
duke@435 397 private:
coleenp@548 398 int _length;
coleenp@6081 399 ConstantPool* _constant_pool; // the corresponding constant pool
duke@435 400
duke@435 401 // Sizing
coleenp@548 402 debug_only(friend class ClassVerifier;)
coleenp@4037 403
coleenp@4037 404 // Constructor
coleenp@6081 405 ConstantPoolCache(int length,
coleenp@6081 406 const intStack& inverse_index_map,
coleenp@6081 407 const intStack& invokedynamic_inverse_index_map,
coleenp@4712 408 const intStack& invokedynamic_references_map) :
coleenp@6081 409 _length(length),
coleenp@6081 410 _constant_pool(NULL) {
coleenp@6081 411 initialize(inverse_index_map, invokedynamic_inverse_index_map,
coleenp@6081 412 invokedynamic_references_map);
coleenp@4037 413 for (int i = 0; i < length; i++) {
coleenp@4037 414 assert(entry_at(i)->is_f1_null(), "Failed to clear?");
coleenp@4037 415 }
coleenp@4037 416 }
coleenp@4037 417
coleenp@4712 418 // Initialization
coleenp@6081 419 void initialize(const intArray& inverse_index_map,
coleenp@6081 420 const intArray& invokedynamic_inverse_index_map,
coleenp@6081 421 const intArray& invokedynamic_references_map);
jrose@2268 422 public:
coleenp@6081 423 static ConstantPoolCache* allocate(ClassLoaderData* loader_data,
coleenp@6081 424 const intStack& cp_cache_map,
coleenp@6081 425 const intStack& invokedynamic_cp_cache_map,
coleenp@4712 426 const intStack& invokedynamic_references_map, TRAPS);
coleenp@4037 427 bool is_constantPoolCache() const { return true; }
coleenp@4037 428
coleenp@548 429 int length() const { return _length; }
jrose@2268 430 private:
coleenp@548 431 void set_length(int length) { _length = length; }
coleenp@548 432
coleenp@4037 433 static int header_size() { return sizeof(ConstantPoolCache) / HeapWordSize; }
coleenp@4037 434 static int size(int length) { return align_object_size(header_size() + length * in_words(ConstantPoolCacheEntry::size())); }
coleenp@4037 435 public:
coleenp@4037 436 int size() const { return size(length()); }
coleenp@4037 437 private:
duke@435 438
duke@435 439 // Helpers
coleenp@4037 440 ConstantPool** constant_pool_addr() { return &_constant_pool; }
duke@435 441 ConstantPoolCacheEntry* base() const { return (ConstantPoolCacheEntry*)((address)this + in_bytes(base_offset())); }
duke@435 442
duke@435 443 friend class constantPoolCacheKlass;
jrose@1494 444 friend class ConstantPoolCacheEntry;
duke@435 445
duke@435 446 public:
duke@435 447 // Accessors
coleenp@4037 448 void set_constant_pool(ConstantPool* pool) { _constant_pool = pool; }
coleenp@4037 449 ConstantPool* constant_pool() const { return _constant_pool; }
jrose@1494 450 // Fetches the entry at the given index.
jrose@1494 451 // In either case the index must not be encoded or byte-swapped in any way.
jrose@1494 452 ConstantPoolCacheEntry* entry_at(int i) const {
jrose@1494 453 assert(0 <= i && i < length(), "index out of bounds");
jrose@1494 454 return base() + i;
jrose@1494 455 }
duke@435 456
duke@435 457 // Code generation
coleenp@4037 458 static ByteSize base_offset() { return in_ByteSize(sizeof(ConstantPoolCache)); }
jrose@1494 459 static ByteSize entry_offset(int raw_index) {
jrose@1494 460 int index = raw_index;
jrose@1494 461 return (base_offset() + ConstantPoolCacheEntry::size_in_bytes() * index);
jrose@1494 462 }
duke@435 463
dcubed@4562 464 #if INCLUDE_JVMTI
duke@435 465 // RedefineClasses() API support:
dcubed@4562 466 // If any entry of this ConstantPoolCache points to any of
duke@435 467 // old_methods, replace it with the corresponding new_method.
duke@435 468 // trace_name_printed is set to true if the current call has
duke@435 469 // printed the klass name so that other routines in the adjust_*
duke@435 470 // group don't print the klass name.
coleenp@4037 471 void adjust_method_entries(Method** old_methods, Method** new_methods,
duke@435 472 int methods_length, bool * trace_name_printed);
dcubed@4562 473 bool check_no_old_or_obsolete_entries();
dcubed@4562 474 void dump_cache();
dcubed@4562 475 #endif // INCLUDE_JVMTI
coleenp@4037 476
coleenp@4037 477 // Deallocate - no fields to deallocate
coleenp@4037 478 DEBUG_ONLY(bool on_stack() { return false; })
coleenp@4037 479 void deallocate_contents(ClassLoaderData* data) {}
coleenp@4037 480 bool is_klass() const { return false; }
coleenp@4037 481
coleenp@4037 482 // Printing
coleenp@4037 483 void print_on(outputStream* st) const;
coleenp@4037 484 void print_value_on(outputStream* st) const;
coleenp@4037 485
coleenp@4037 486 const char* internal_name() const { return "{constant pool cache}"; }
coleenp@4037 487
coleenp@4037 488 // Verify
coleenp@4037 489 void verify_on(outputStream* st);
duke@435 490 };
stefank@2314 491
stefank@2314 492 #endif // SHARE_VM_OOPS_CPCACHEOOP_HPP

mercurial