Wed, 06 Jan 2010 22:21:39 -0800
Merge
duke@435 | 1 | /* |
xdono@1014 | 2 | * Copyright 1998-2009 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // A ConstantPoolCacheEntry describes an individual entry of the constant |
duke@435 | 26 | // pool cache. There's 2 principal kinds of entries: field entries for in- |
duke@435 | 27 | // stance & static field access, and method entries for invokes. Some of |
duke@435 | 28 | // the entry layout is shared and looks as follows: |
duke@435 | 29 | // |
duke@435 | 30 | // bit number |31 0| |
duke@435 | 31 | // bit length |-8--|-8--|---16----| |
duke@435 | 32 | // -------------------------------- |
duke@435 | 33 | // _indices [ b2 | b1 | index ] |
duke@435 | 34 | // _f1 [ entry specific ] |
duke@435 | 35 | // _f2 [ entry specific ] |
duke@435 | 36 | // _flags [t|f|vf|v|m|h|unused|field_index] (for field entries) |
duke@435 | 37 | // bit length |4|1|1 |1|1|0|---7--|----16-----] |
duke@435 | 38 | // _flags [t|f|vf|v|m|h|unused|eidx|psze] (for method entries) |
duke@435 | 39 | // bit length |4|1|1 |1|1|1|---7--|-8--|-8--] |
duke@435 | 40 | |
duke@435 | 41 | // -------------------------------- |
duke@435 | 42 | // |
duke@435 | 43 | // with: |
duke@435 | 44 | // index = original constant pool index |
duke@435 | 45 | // b1 = bytecode 1 |
duke@435 | 46 | // b2 = bytecode 2 |
duke@435 | 47 | // psze = parameters size (method entries only) |
duke@435 | 48 | // eidx = interpreter entry index (method entries only) |
duke@435 | 49 | // field_index = index into field information in holder instanceKlass |
duke@435 | 50 | // The index max is 0xffff (max number of fields in constant pool) |
duke@435 | 51 | // and is multiplied by (instanceKlass::next_offset) when accessing. |
duke@435 | 52 | // t = TosState (see below) |
duke@435 | 53 | // f = field is marked final (see below) |
duke@435 | 54 | // vf = virtual, final (method entries only : is_vfinal()) |
duke@435 | 55 | // v = field is volatile (see below) |
duke@435 | 56 | // m = invokeinterface used for method in class Object (see below) |
duke@435 | 57 | // h = RedefineClasses/Hotswap bit (see below) |
duke@435 | 58 | // |
duke@435 | 59 | // The flags after TosState have the following interpretation: |
duke@435 | 60 | // bit 27: f flag true if field is marked final |
duke@435 | 61 | // bit 26: vf flag true if virtual final method |
duke@435 | 62 | // bit 25: v flag true if field is volatile (only for fields) |
duke@435 | 63 | // bit 24: m flag true if invokeinterface used for method in class Object |
duke@435 | 64 | // bit 23: 0 for fields, 1 for methods |
duke@435 | 65 | // |
duke@435 | 66 | // The flags 31, 30, 29, 28 together build a 4 bit number 0 to 8 with the |
duke@435 | 67 | // following mapping to the TosState states: |
duke@435 | 68 | // |
duke@435 | 69 | // btos: 0 |
duke@435 | 70 | // ctos: 1 |
duke@435 | 71 | // stos: 2 |
duke@435 | 72 | // itos: 3 |
duke@435 | 73 | // ltos: 4 |
duke@435 | 74 | // ftos: 5 |
duke@435 | 75 | // dtos: 6 |
duke@435 | 76 | // atos: 7 |
duke@435 | 77 | // vtos: 8 |
duke@435 | 78 | // |
duke@435 | 79 | // Entry specific: field entries: |
duke@435 | 80 | // _indices = get (b1 section) and put (b2 section) bytecodes, original constant pool index |
duke@435 | 81 | // _f1 = field holder |
duke@435 | 82 | // _f2 = field offset in words |
duke@435 | 83 | // _flags = field type information, original field index in field holder |
duke@435 | 84 | // (field_index section) |
duke@435 | 85 | // |
duke@435 | 86 | // Entry specific: method entries: |
duke@435 | 87 | // _indices = invoke code for f1 (b1 section), invoke code for f2 (b2 section), |
duke@435 | 88 | // original constant pool index |
duke@435 | 89 | // _f1 = method for all but virtual calls, unused by virtual calls |
duke@435 | 90 | // (note: for interface calls, which are essentially virtual, |
duke@435 | 91 | // contains klassOop for the corresponding interface. |
jrose@1161 | 92 | // for invokedynamic, f1 contains the CallSite object for the invocation |
duke@435 | 93 | // _f2 = method/vtable index for virtual calls only, unused by all other |
duke@435 | 94 | // calls. The vf flag indicates this is a method pointer not an |
duke@435 | 95 | // index. |
duke@435 | 96 | // _flags = field type info (f section), |
duke@435 | 97 | // virtual final entry (vf), |
duke@435 | 98 | // interpreter entry index (eidx section), |
duke@435 | 99 | // parameter size (psze section) |
duke@435 | 100 | // |
duke@435 | 101 | // Note: invokevirtual & invokespecial bytecodes can share the same constant |
duke@435 | 102 | // pool entry and thus the same constant pool cache entry. All invoke |
duke@435 | 103 | // bytecodes but invokevirtual use only _f1 and the corresponding b1 |
duke@435 | 104 | // bytecode, while invokevirtual uses only _f2 and the corresponding |
duke@435 | 105 | // b2 bytecode. The value of _flags is shared for both types of entries. |
duke@435 | 106 | // |
duke@435 | 107 | // The fields are volatile so that they are stored in the order written in the |
duke@435 | 108 | // source code. The _indices field with the bytecode must be written last. |
duke@435 | 109 | |
duke@435 | 110 | class ConstantPoolCacheEntry VALUE_OBJ_CLASS_SPEC { |
duke@435 | 111 | friend class VMStructs; |
jrose@1161 | 112 | friend class constantPoolCacheKlass; |
jrose@1161 | 113 | |
duke@435 | 114 | private: |
duke@435 | 115 | volatile intx _indices; // constant pool index & rewrite bytecodes |
duke@435 | 116 | volatile oop _f1; // entry specific oop field |
duke@435 | 117 | volatile intx _f2; // entry specific int/oop field |
duke@435 | 118 | volatile intx _flags; // flags |
duke@435 | 119 | |
duke@435 | 120 | |
duke@435 | 121 | #ifdef ASSERT |
duke@435 | 122 | bool same_methodOop(oop cur_f1, oop f1); |
duke@435 | 123 | #endif |
duke@435 | 124 | |
duke@435 | 125 | void set_bytecode_1(Bytecodes::Code code); |
duke@435 | 126 | void set_bytecode_2(Bytecodes::Code code); |
duke@435 | 127 | void set_f1(oop f1) { |
duke@435 | 128 | oop existing_f1 = _f1; // read once |
duke@435 | 129 | assert(existing_f1 == NULL || existing_f1 == f1, "illegal field change"); |
duke@435 | 130 | oop_store(&_f1, f1); |
duke@435 | 131 | } |
duke@435 | 132 | void set_f2(intx f2) { assert(_f2 == 0 || _f2 == f2, "illegal field change"); _f2 = f2; } |
duke@435 | 133 | int as_flags(TosState state, bool is_final, bool is_vfinal, bool is_volatile, |
duke@435 | 134 | bool is_method_interface, bool is_method); |
duke@435 | 135 | void set_flags(intx flags) { _flags = flags; } |
duke@435 | 136 | |
duke@435 | 137 | public: |
duke@435 | 138 | // specific bit values in flag field |
duke@435 | 139 | // Note: the interpreter knows this layout! |
duke@435 | 140 | enum FlagBitValues { |
duke@435 | 141 | hotSwapBit = 23, |
duke@435 | 142 | methodInterface = 24, |
duke@435 | 143 | volatileField = 25, |
duke@435 | 144 | vfinalMethod = 26, |
duke@435 | 145 | finalField = 27 |
duke@435 | 146 | }; |
duke@435 | 147 | |
duke@435 | 148 | enum { field_index_mask = 0xFFFF }; |
duke@435 | 149 | |
duke@435 | 150 | // start of type bits in flags |
duke@435 | 151 | // Note: the interpreter knows this layout! |
duke@435 | 152 | enum FlagValues { |
duke@435 | 153 | tosBits = 28 |
duke@435 | 154 | }; |
duke@435 | 155 | |
duke@435 | 156 | // Initialization |
jrose@1494 | 157 | void initialize_entry(int original_index); // initialize primary entry |
jrose@1494 | 158 | void initialize_secondary_entry(int main_index); // initialize secondary entry |
duke@435 | 159 | |
duke@435 | 160 | void set_field( // sets entry to resolved field state |
duke@435 | 161 | Bytecodes::Code get_code, // the bytecode used for reading the field |
duke@435 | 162 | Bytecodes::Code put_code, // the bytecode used for writing the field |
duke@435 | 163 | KlassHandle field_holder, // the object/klass holding the field |
duke@435 | 164 | int orig_field_index, // the original field index in the field holder |
duke@435 | 165 | int field_offset, // the field offset in words in the field holder |
duke@435 | 166 | TosState field_type, // the (machine) field type |
duke@435 | 167 | bool is_final, // the field is final |
duke@435 | 168 | bool is_volatile // the field is volatile |
duke@435 | 169 | ); |
duke@435 | 170 | |
duke@435 | 171 | void set_method( // sets entry to resolved method entry |
duke@435 | 172 | Bytecodes::Code invoke_code, // the bytecode used for invoking the method |
duke@435 | 173 | methodHandle method, // the method/prototype if any (NULL, otherwise) |
duke@435 | 174 | int vtable_index // the vtable index if any, else negative |
duke@435 | 175 | ); |
duke@435 | 176 | |
duke@435 | 177 | void set_interface_call( |
duke@435 | 178 | methodHandle method, // Resolved method |
duke@435 | 179 | int index // Method index into interface |
duke@435 | 180 | ); |
duke@435 | 181 | |
jrose@1161 | 182 | void set_dynamic_call( |
jrose@1161 | 183 | Handle call_site, // Resolved java.dyn.CallSite (f1) |
jrose@1161 | 184 | int extra_data // (f2) |
jrose@1161 | 185 | ); |
jrose@1161 | 186 | |
duke@435 | 187 | void set_parameter_size(int value) { |
duke@435 | 188 | assert(parameter_size() == 0 || parameter_size() == value, |
duke@435 | 189 | "size must not change"); |
duke@435 | 190 | // Setting the parameter size by itself is only safe if the |
duke@435 | 191 | // current value of _flags is 0, otherwise another thread may have |
duke@435 | 192 | // updated it and we don't want to overwrite that value. Don't |
duke@435 | 193 | // bother trying to update it once it's nonzero but always make |
duke@435 | 194 | // sure that the final parameter size agrees with what was passed. |
duke@435 | 195 | if (_flags == 0) { |
duke@435 | 196 | Atomic::cmpxchg_ptr((value & 0xFF), &_flags, 0); |
duke@435 | 197 | } |
duke@435 | 198 | guarantee(parameter_size() == value, "size must not change"); |
duke@435 | 199 | } |
duke@435 | 200 | |
duke@435 | 201 | // Which bytecode number (1 or 2) in the index field is valid for this bytecode? |
duke@435 | 202 | // Returns -1 if neither is valid. |
duke@435 | 203 | static int bytecode_number(Bytecodes::Code code) { |
duke@435 | 204 | switch (code) { |
duke@435 | 205 | case Bytecodes::_getstatic : // fall through |
duke@435 | 206 | case Bytecodes::_getfield : // fall through |
duke@435 | 207 | case Bytecodes::_invokespecial : // fall through |
duke@435 | 208 | case Bytecodes::_invokestatic : // fall through |
duke@435 | 209 | case Bytecodes::_invokeinterface : return 1; |
duke@435 | 210 | case Bytecodes::_putstatic : // fall through |
duke@435 | 211 | case Bytecodes::_putfield : // fall through |
duke@435 | 212 | case Bytecodes::_invokevirtual : return 2; |
duke@435 | 213 | default : break; |
duke@435 | 214 | } |
duke@435 | 215 | return -1; |
duke@435 | 216 | } |
duke@435 | 217 | |
duke@435 | 218 | // Has this bytecode been resolved? Only valid for invokes and get/put field/static. |
duke@435 | 219 | bool is_resolved(Bytecodes::Code code) const { |
duke@435 | 220 | switch (bytecode_number(code)) { |
duke@435 | 221 | case 1: return (bytecode_1() == code); |
duke@435 | 222 | case 2: return (bytecode_2() == code); |
duke@435 | 223 | } |
duke@435 | 224 | return false; // default: not resolved |
duke@435 | 225 | } |
duke@435 | 226 | |
duke@435 | 227 | // Accessors |
jrose@1161 | 228 | bool is_secondary_entry() const { return (_indices & 0xFFFF) == 0; } |
jrose@1161 | 229 | int constant_pool_index() const { assert((_indices & 0xFFFF) != 0, "must be main entry"); |
jrose@1161 | 230 | return (_indices & 0xFFFF); } |
jrose@1161 | 231 | int main_entry_index() const { assert((_indices & 0xFFFF) == 0, "must be secondary entry"); |
jrose@1161 | 232 | return ((uintx)_indices >> 16); } |
duke@435 | 233 | Bytecodes::Code bytecode_1() const { return Bytecodes::cast((_indices >> 16) & 0xFF); } |
duke@435 | 234 | Bytecodes::Code bytecode_2() const { return Bytecodes::cast((_indices >> 24) & 0xFF); } |
duke@435 | 235 | volatile oop f1() const { return _f1; } |
duke@435 | 236 | intx f2() const { return _f2; } |
duke@435 | 237 | int field_index() const; |
duke@435 | 238 | int parameter_size() const { return _flags & 0xFF; } |
duke@435 | 239 | bool is_vfinal() const { return ((_flags & (1 << vfinalMethod)) == (1 << vfinalMethod)); } |
duke@435 | 240 | bool is_volatile() const { return ((_flags & (1 << volatileField)) == (1 << volatileField)); } |
duke@435 | 241 | bool is_methodInterface() const { return ((_flags & (1 << methodInterface)) == (1 << methodInterface)); } |
duke@435 | 242 | bool is_byte() const { return (((uintx) _flags >> tosBits) == btos); } |
duke@435 | 243 | bool is_char() const { return (((uintx) _flags >> tosBits) == ctos); } |
duke@435 | 244 | bool is_short() const { return (((uintx) _flags >> tosBits) == stos); } |
duke@435 | 245 | bool is_int() const { return (((uintx) _flags >> tosBits) == itos); } |
duke@435 | 246 | bool is_long() const { return (((uintx) _flags >> tosBits) == ltos); } |
duke@435 | 247 | bool is_float() const { return (((uintx) _flags >> tosBits) == ftos); } |
duke@435 | 248 | bool is_double() const { return (((uintx) _flags >> tosBits) == dtos); } |
duke@435 | 249 | bool is_object() const { return (((uintx) _flags >> tosBits) == atos); } |
duke@435 | 250 | TosState flag_state() const { assert( ( (_flags >> tosBits) & 0x0F ) < number_of_states, "Invalid state in as_flags"); |
duke@435 | 251 | return (TosState)((_flags >> tosBits) & 0x0F); } |
duke@435 | 252 | |
duke@435 | 253 | // Code generation support |
duke@435 | 254 | static WordSize size() { return in_WordSize(sizeof(ConstantPoolCacheEntry) / HeapWordSize); } |
jrose@1494 | 255 | static ByteSize size_in_bytes() { return in_ByteSize(sizeof(ConstantPoolCacheEntry)); } |
duke@435 | 256 | static ByteSize indices_offset() { return byte_offset_of(ConstantPoolCacheEntry, _indices); } |
duke@435 | 257 | static ByteSize f1_offset() { return byte_offset_of(ConstantPoolCacheEntry, _f1); } |
duke@435 | 258 | static ByteSize f2_offset() { return byte_offset_of(ConstantPoolCacheEntry, _f2); } |
duke@435 | 259 | static ByteSize flags_offset() { return byte_offset_of(ConstantPoolCacheEntry, _flags); } |
duke@435 | 260 | |
duke@435 | 261 | // GC Support |
duke@435 | 262 | void oops_do(void f(oop*)); |
duke@435 | 263 | void oop_iterate(OopClosure* blk); |
duke@435 | 264 | void oop_iterate_m(OopClosure* blk, MemRegion mr); |
duke@435 | 265 | void follow_contents(); |
duke@435 | 266 | void adjust_pointers(); |
duke@435 | 267 | |
duke@435 | 268 | #ifndef SERIALGC |
duke@435 | 269 | // Parallel Old |
duke@435 | 270 | void follow_contents(ParCompactionManager* cm); |
duke@435 | 271 | #endif // SERIALGC |
duke@435 | 272 | |
duke@435 | 273 | void update_pointers(); |
duke@435 | 274 | void update_pointers(HeapWord* beg_addr, HeapWord* end_addr); |
duke@435 | 275 | |
duke@435 | 276 | // RedefineClasses() API support: |
duke@435 | 277 | // If this constantPoolCacheEntry refers to old_method then update it |
duke@435 | 278 | // to refer to new_method. |
duke@435 | 279 | // trace_name_printed is set to true if the current call has |
duke@435 | 280 | // printed the klass name so that other routines in the adjust_* |
duke@435 | 281 | // group don't print the klass name. |
duke@435 | 282 | bool adjust_method_entry(methodOop old_method, methodOop new_method, |
duke@435 | 283 | bool * trace_name_printed); |
duke@435 | 284 | bool is_interesting_method_entry(klassOop k); |
duke@435 | 285 | bool is_field_entry() const { return (_flags & (1 << hotSwapBit)) == 0; } |
duke@435 | 286 | bool is_method_entry() const { return (_flags & (1 << hotSwapBit)) != 0; } |
duke@435 | 287 | |
duke@435 | 288 | // Debugging & Printing |
duke@435 | 289 | void print (outputStream* st, int index) const; |
duke@435 | 290 | void verify(outputStream* st) const; |
duke@435 | 291 | |
duke@435 | 292 | static void verify_tosBits() { |
duke@435 | 293 | assert(tosBits == 28, "interpreter now assumes tosBits is 28"); |
duke@435 | 294 | } |
duke@435 | 295 | }; |
duke@435 | 296 | |
duke@435 | 297 | |
duke@435 | 298 | // A constant pool cache is a runtime data structure set aside to a constant pool. The cache |
duke@435 | 299 | // holds interpreter runtime information for all field access and invoke bytecodes. The cache |
duke@435 | 300 | // is created and initialized before a class is actively used (i.e., initialized), the indivi- |
duke@435 | 301 | // dual cache entries are filled at resolution (i.e., "link") time (see also: rewriter.*). |
duke@435 | 302 | |
coleenp@548 | 303 | class constantPoolCacheOopDesc: public oopDesc { |
duke@435 | 304 | friend class VMStructs; |
duke@435 | 305 | private: |
coleenp@548 | 306 | int _length; |
duke@435 | 307 | constantPoolOop _constant_pool; // the corresponding constant pool |
jmasa@977 | 308 | // If true, safe for concurrent GC processing, |
jmasa@977 | 309 | // Set unconditionally in constantPoolCacheKlass::allocate() |
jmasa@977 | 310 | volatile bool _is_conc_safe; |
duke@435 | 311 | |
duke@435 | 312 | // Sizing |
coleenp@548 | 313 | debug_only(friend class ClassVerifier;) |
coleenp@548 | 314 | int length() const { return _length; } |
coleenp@548 | 315 | void set_length(int length) { _length = length; } |
coleenp@548 | 316 | |
duke@435 | 317 | static int header_size() { return sizeof(constantPoolCacheOopDesc) / HeapWordSize; } |
duke@435 | 318 | static int object_size(int length) { return align_object_size(header_size() + length * in_words(ConstantPoolCacheEntry::size())); } |
duke@435 | 319 | int object_size() { return object_size(length()); } |
duke@435 | 320 | |
duke@435 | 321 | // Helpers |
duke@435 | 322 | constantPoolOop* constant_pool_addr() { return &_constant_pool; } |
duke@435 | 323 | ConstantPoolCacheEntry* base() const { return (ConstantPoolCacheEntry*)((address)this + in_bytes(base_offset())); } |
duke@435 | 324 | |
duke@435 | 325 | friend class constantPoolCacheKlass; |
jrose@1494 | 326 | friend class ConstantPoolCacheEntry; |
duke@435 | 327 | |
duke@435 | 328 | public: |
duke@435 | 329 | // Initialization |
duke@435 | 330 | void initialize(intArray& inverse_index_map); |
duke@435 | 331 | |
jrose@1161 | 332 | // Secondary indexes. |
jrose@1161 | 333 | // They must look completely different from normal indexes. |
jrose@1161 | 334 | // The main reason is that byte swapping is sometimes done on normal indexes. |
jrose@1494 | 335 | // Also, some of the CP accessors do different things for secondary indexes. |
jrose@1494 | 336 | // Finally, it is helpful for debugging to tell the two apart. |
jrose@1161 | 337 | static bool is_secondary_index(int i) { return (i < 0); } |
jrose@1161 | 338 | static int decode_secondary_index(int i) { assert(is_secondary_index(i), ""); return ~i; } |
jrose@1161 | 339 | static int encode_secondary_index(int i) { assert(!is_secondary_index(i), ""); return ~i; } |
jrose@1161 | 340 | |
duke@435 | 341 | // Accessors |
duke@435 | 342 | void set_constant_pool(constantPoolOop pool) { oop_store_without_check((oop*)&_constant_pool, (oop)pool); } |
duke@435 | 343 | constantPoolOop constant_pool() const { return _constant_pool; } |
jrose@1494 | 344 | // Fetches the entry at the given index. |
jrose@1494 | 345 | // The entry may be either primary or secondary. |
jrose@1494 | 346 | // In either case the index must not be encoded or byte-swapped in any way. |
jrose@1494 | 347 | ConstantPoolCacheEntry* entry_at(int i) const { |
jrose@1494 | 348 | assert(0 <= i && i < length(), "index out of bounds"); |
jrose@1494 | 349 | return base() + i; |
jrose@1494 | 350 | } |
jrose@1494 | 351 | // Fetches the secondary entry referred to by index. |
jrose@1494 | 352 | // The index may be a secondary index, and must not be byte-swapped. |
jrose@1494 | 353 | ConstantPoolCacheEntry* secondary_entry_at(int i) const { |
jrose@1494 | 354 | int raw_index = i; |
jrose@1494 | 355 | if (is_secondary_index(i)) { // correct these on the fly |
jrose@1494 | 356 | raw_index = decode_secondary_index(i); |
jrose@1494 | 357 | } |
jrose@1494 | 358 | assert(entry_at(raw_index)->is_secondary_entry(), "not a secondary entry"); |
jrose@1494 | 359 | return entry_at(raw_index); |
jrose@1494 | 360 | } |
jrose@1494 | 361 | // Given a primary or secondary index, fetch the corresponding primary entry. |
jrose@1494 | 362 | // Indirect through the secondary entry, if the index is encoded as a secondary index. |
jrose@1494 | 363 | // The index must not be byte-swapped. |
jrose@1161 | 364 | ConstantPoolCacheEntry* main_entry_at(int i) const { |
jrose@1494 | 365 | int primary_index = i; |
jrose@1161 | 366 | if (is_secondary_index(i)) { |
jrose@1161 | 367 | // run through an extra level of indirection: |
jrose@1494 | 368 | int raw_index = decode_secondary_index(i); |
jrose@1494 | 369 | primary_index = entry_at(raw_index)->main_entry_index(); |
jrose@1161 | 370 | } |
jrose@1494 | 371 | assert(!entry_at(primary_index)->is_secondary_entry(), "only one level of indirection"); |
jrose@1494 | 372 | return entry_at(primary_index); |
jrose@1161 | 373 | } |
duke@435 | 374 | |
jmasa@977 | 375 | // GC support |
jmasa@977 | 376 | // If the _length field has not been set, the size of the |
jmasa@977 | 377 | // constantPoolCache cannot be correctly calculated. |
jmasa@977 | 378 | bool is_conc_safe() { return _is_conc_safe; } |
jmasa@977 | 379 | void set_is_conc_safe(bool v) { _is_conc_safe = v; } |
jmasa@977 | 380 | |
duke@435 | 381 | // Code generation |
duke@435 | 382 | static ByteSize base_offset() { return in_ByteSize(sizeof(constantPoolCacheOopDesc)); } |
jrose@1494 | 383 | static ByteSize entry_offset(int raw_index) { |
jrose@1494 | 384 | int index = raw_index; |
jrose@1494 | 385 | if (is_secondary_index(raw_index)) |
jrose@1494 | 386 | index = decode_secondary_index(raw_index); |
jrose@1494 | 387 | return (base_offset() + ConstantPoolCacheEntry::size_in_bytes() * index); |
jrose@1494 | 388 | } |
duke@435 | 389 | |
duke@435 | 390 | // RedefineClasses() API support: |
duke@435 | 391 | // If any entry of this constantPoolCache points to any of |
duke@435 | 392 | // old_methods, replace it with the corresponding new_method. |
duke@435 | 393 | // trace_name_printed is set to true if the current call has |
duke@435 | 394 | // printed the klass name so that other routines in the adjust_* |
duke@435 | 395 | // group don't print the klass name. |
duke@435 | 396 | void adjust_method_entries(methodOop* old_methods, methodOop* new_methods, |
duke@435 | 397 | int methods_length, bool * trace_name_printed); |
duke@435 | 398 | }; |