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