Mercurial > hg > truffle
comparison src/share/vm/oops/methodOop.hpp @ 0:a61af66fc99e jdk7-b24
Initial load
author | duke |
---|---|
date | Sat, 01 Dec 2007 00:00:00 +0000 |
parents | |
children | d8b3ef7ee3e5 |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 0:a61af66fc99e |
---|---|
1 /* | |
2 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. | |
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 methodOop represents a Java method. | |
26 // | |
27 // Memory layout (each line represents a word). Note that most applications load thousands of methods, | |
28 // so keeping the size of this structure small has a big impact on footprint. | |
29 // | |
30 // We put all oops and method_size first for better gc cache locality. | |
31 // | |
32 // The actual bytecodes are inlined after the end of the methodOopDesc struct. | |
33 // | |
34 // There are bits in the access_flags telling whether inlined tables are present. | |
35 // Note that accessing the line number and local variable tables is not performance critical at all. | |
36 // Accessing the checked exceptions table is used by reflection, so we put that last to make access | |
37 // to it fast. | |
38 // | |
39 // The line number table is compressed and inlined following the byte codes. It is found as the first | |
40 // byte following the byte codes. The checked exceptions table and the local variable table are inlined | |
41 // after the line number table, and indexed from the end of the method. We do not compress the checked | |
42 // exceptions table since the average length is less than 2, and do not bother to compress the local | |
43 // variable table either since it is mostly absent. | |
44 // | |
45 // Note that native_function and signature_handler has to be at fixed offsets (required by the interpreter) | |
46 // | |
47 // |------------------------------------------------------| | |
48 // | header | | |
49 // | klass | | |
50 // |------------------------------------------------------| | |
51 // | constMethodOop (oop) | | |
52 // | constants (oop) | | |
53 // |------------------------------------------------------| | |
54 // | methodData (oop) | | |
55 // | interp_invocation_count | | |
56 // |------------------------------------------------------| | |
57 // | access_flags | | |
58 // | vtable_index | | |
59 // |------------------------------------------------------| | |
60 // | result_index (C++ interpreter only) | | |
61 // |------------------------------------------------------| | |
62 // | method_size | max_stack | | |
63 // | max_locals | size_of_parameters | | |
64 // |------------------------------------------------------| | |
65 // | intrinsic_id, highest_tier | (unused) | | |
66 // |------------------------------------------------------| | |
67 // | throwout_count | num_breakpoints | | |
68 // |------------------------------------------------------| | |
69 // | invocation_counter | | |
70 // | backedge_counter | | |
71 // |------------------------------------------------------| | |
72 // | code (pointer) | | |
73 // | i2i (pointer) | | |
74 // | adapter (pointer) | | |
75 // | from_compiled_entry (pointer) | | |
76 // | from_interpreted_entry (pointer) | | |
77 // |------------------------------------------------------| | |
78 // | native_function (present only if native) | | |
79 // | signature_handler (present only if native) | | |
80 // |------------------------------------------------------| | |
81 | |
82 | |
83 class CheckedExceptionElement; | |
84 class LocalVariableTableElement; | |
85 class AdapterHandlerEntry; | |
86 | |
87 class methodDataOopDesc; | |
88 | |
89 class methodOopDesc : public oopDesc { | |
90 friend class methodKlass; | |
91 friend class VMStructs; | |
92 private: | |
93 constMethodOop _constMethod; // Method read-only data. | |
94 constantPoolOop _constants; // Constant pool | |
95 methodDataOop _method_data; | |
96 int _interpreter_invocation_count; // Count of times invoked | |
97 AccessFlags _access_flags; // Access flags | |
98 int _vtable_index; // vtable index of this method (see VtableIndexFlag) | |
99 // note: can have vtables with >2**16 elements (because of inheritance) | |
100 #ifdef CC_INTERP | |
101 int _result_index; // C++ interpreter needs for converting results to/from stack | |
102 #endif | |
103 u2 _method_size; // size of this object | |
104 u2 _max_stack; // Maximum number of entries on the expression stack | |
105 u2 _max_locals; // Number of local variables used by this method | |
106 u2 _size_of_parameters; // size of the parameter block (receiver + arguments) in words | |
107 u1 _intrinsic_id_cache; // Cache for intrinsic_id; 0 or 1+vmInt::ID | |
108 u1 _highest_tier_compile; // Highest compile level this method has ever seen. | |
109 u2 _interpreter_throwout_count; // Count of times method was exited via exception while interpreting | |
110 u2 _number_of_breakpoints; // fullspeed debugging support | |
111 InvocationCounter _invocation_counter; // Incremented before each activation of the method - used to trigger frequency-based optimizations | |
112 InvocationCounter _backedge_counter; // Incremented before each backedge taken - used to trigger frequencey-based optimizations | |
113 #ifndef PRODUCT | |
114 int _compiled_invocation_count; // Number of nmethod invocations so far (for perf. debugging) | |
115 #endif | |
116 // Entry point for calling both from and to the interpreter. | |
117 address _i2i_entry; // All-args-on-stack calling convention | |
118 // Adapter blob (i2c/c2i) for this methodOop. Set once when method is linked. | |
119 AdapterHandlerEntry* _adapter; | |
120 // Entry point for calling from compiled code, to compiled code if it exists | |
121 // or else the interpreter. | |
122 volatile address _from_compiled_entry; // Cache of: _code ? _code->entry_point() : _adapter->c2i_entry() | |
123 // The entry point for calling both from and to compiled code is | |
124 // "_code->entry_point()". Because of tiered compilation and de-opt, this | |
125 // field can come and go. It can transition from NULL to not-null at any | |
126 // time (whenever a compile completes). It can transition from not-null to | |
127 // NULL only at safepoints (because of a de-opt). | |
128 nmethod* volatile _code; // Points to the corresponding piece of native code | |
129 volatile address _from_interpreted_entry; // Cache of _code ? _adapter->i2c_entry() : _i2i_entry | |
130 | |
131 public: | |
132 // accessors for instance variables | |
133 constMethodOop constMethod() const { return _constMethod; } | |
134 void set_constMethod(constMethodOop xconst) { oop_store_without_check((oop*)&_constMethod, (oop)xconst); } | |
135 | |
136 | |
137 static address make_adapters(methodHandle mh, TRAPS); | |
138 volatile address from_compiled_entry() const { return (address)OrderAccess::load_ptr_acquire(&_from_compiled_entry); } | |
139 volatile address from_interpreted_entry() const{ return (address)OrderAccess::load_ptr_acquire(&_from_interpreted_entry); } | |
140 | |
141 // access flag | |
142 AccessFlags access_flags() const { return _access_flags; } | |
143 void set_access_flags(AccessFlags flags) { _access_flags = flags; } | |
144 | |
145 // name | |
146 symbolOop name() const { return _constants->symbol_at(name_index()); } | |
147 int name_index() const { return constMethod()->name_index(); } | |
148 void set_name_index(int index) { constMethod()->set_name_index(index); } | |
149 | |
150 // signature | |
151 symbolOop signature() const { return _constants->symbol_at(signature_index()); } | |
152 int signature_index() const { return constMethod()->signature_index(); } | |
153 void set_signature_index(int index) { constMethod()->set_signature_index(index); } | |
154 | |
155 // generics support | |
156 symbolOop generic_signature() const { int idx = generic_signature_index(); return ((idx != 0) ? _constants->symbol_at(idx) : (symbolOop)NULL); } | |
157 int generic_signature_index() const { return constMethod()->generic_signature_index(); } | |
158 void set_generic_signature_index(int index) { constMethod()->set_generic_signature_index(index); } | |
159 | |
160 // annotations support | |
161 typeArrayOop annotations() const { return instanceKlass::cast(method_holder())->get_method_annotations_of(method_idnum()); } | |
162 typeArrayOop parameter_annotations() const { return instanceKlass::cast(method_holder())->get_method_parameter_annotations_of(method_idnum()); } | |
163 typeArrayOop annotation_default() const { return instanceKlass::cast(method_holder())->get_method_default_annotations_of(method_idnum()); } | |
164 | |
165 #ifdef CC_INTERP | |
166 void set_result_index(BasicType type); | |
167 int result_index() { return _result_index; } | |
168 #endif | |
169 | |
170 // Helper routine: get klass name + "." + method name + signature as | |
171 // C string, for the purpose of providing more useful NoSuchMethodErrors | |
172 // and fatal error handling. The string is allocated in resource | |
173 // area if a buffer is not provided by the caller. | |
174 char* name_and_sig_as_C_string(); | |
175 char* name_and_sig_as_C_string(char* buf, int size); | |
176 | |
177 // Static routine in the situations we don't have a methodOop | |
178 static char* name_and_sig_as_C_string(Klass* klass, symbolOop method_name, symbolOop signature); | |
179 static char* name_and_sig_as_C_string(Klass* klass, symbolOop method_name, symbolOop signature, char* buf, int size); | |
180 | |
181 // JVMTI breakpoints | |
182 Bytecodes::Code orig_bytecode_at(int bci); | |
183 void set_orig_bytecode_at(int bci, Bytecodes::Code code); | |
184 void set_breakpoint(int bci); | |
185 void clear_breakpoint(int bci); | |
186 void clear_all_breakpoints(); | |
187 // Tracking number of breakpoints, for fullspeed debugging. | |
188 // Only mutated by VM thread. | |
189 u2 number_of_breakpoints() const { return _number_of_breakpoints; } | |
190 void incr_number_of_breakpoints() { ++_number_of_breakpoints; } | |
191 void decr_number_of_breakpoints() { --_number_of_breakpoints; } | |
192 // Initialization only | |
193 void clear_number_of_breakpoints() { _number_of_breakpoints = 0; } | |
194 | |
195 // index into instanceKlass methods() array | |
196 u2 method_idnum() const { return constMethod()->method_idnum(); } | |
197 void set_method_idnum(u2 idnum) { constMethod()->set_method_idnum(idnum); } | |
198 | |
199 // code size | |
200 int code_size() const { return constMethod()->code_size(); } | |
201 | |
202 // method size | |
203 int method_size() const { return _method_size; } | |
204 void set_method_size(int size) { | |
205 assert(0 <= size && size < (1 << 16), "invalid method size"); | |
206 _method_size = size; | |
207 } | |
208 | |
209 // constant pool for klassOop holding this method | |
210 constantPoolOop constants() const { return _constants; } | |
211 void set_constants(constantPoolOop c) { oop_store_without_check((oop*)&_constants, c); } | |
212 | |
213 // max stack | |
214 int max_stack() const { return _max_stack; } | |
215 void set_max_stack(int size) { _max_stack = size; } | |
216 | |
217 // max locals | |
218 int max_locals() const { return _max_locals; } | |
219 void set_max_locals(int size) { _max_locals = size; } | |
220 int highest_tier_compile() { return _highest_tier_compile;} | |
221 void set_highest_tier_compile(int level) { _highest_tier_compile = level;} | |
222 | |
223 void clear_intrinsic_id_cache() { _intrinsic_id_cache = 0; } | |
224 | |
225 // Count of times method was exited via exception while interpreting | |
226 void interpreter_throwout_increment() { | |
227 if (_interpreter_throwout_count < 65534) { | |
228 _interpreter_throwout_count++; | |
229 } | |
230 } | |
231 | |
232 int interpreter_throwout_count() const { return _interpreter_throwout_count; } | |
233 void set_interpreter_throwout_count(int count) { _interpreter_throwout_count = count; } | |
234 | |
235 // size of parameters | |
236 int size_of_parameters() const { return _size_of_parameters; } | |
237 | |
238 bool has_stackmap_table() const { | |
239 return constMethod()->has_stackmap_table(); | |
240 } | |
241 | |
242 typeArrayOop stackmap_data() const { | |
243 return constMethod()->stackmap_data(); | |
244 } | |
245 | |
246 // exception handler table | |
247 typeArrayOop exception_table() const | |
248 { return constMethod()->exception_table(); } | |
249 void set_exception_table(typeArrayOop e) | |
250 { constMethod()->set_exception_table(e); } | |
251 bool has_exception_handler() const | |
252 { return constMethod()->has_exception_handler(); } | |
253 | |
254 // Finds the first entry point bci of an exception handler for an | |
255 // exception of klass ex_klass thrown at throw_bci. A value of NULL | |
256 // for ex_klass indicates that the exception klass is not known; in | |
257 // this case it matches any constraint class. Returns -1 if the | |
258 // exception cannot be handled in this method. The handler | |
259 // constraint classes are loaded if necessary. Note that this may | |
260 // throw an exception if loading of the constraint classes causes | |
261 // an IllegalAccessError (bugid 4307310) or an OutOfMemoryError. | |
262 // If an exception is thrown, returns the bci of the | |
263 // exception handler which caused the exception to be thrown, which | |
264 // is needed for proper retries. See, for example, | |
265 // InterpreterRuntime::exception_handler_for_exception. | |
266 int fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS); | |
267 | |
268 // method data access | |
269 methodDataOop method_data() const { | |
270 return _method_data; | |
271 } | |
272 void set_method_data(methodDataOop data) { | |
273 oop_store_without_check((oop*)&_method_data, (oop)data); | |
274 } | |
275 | |
276 // invocation counter | |
277 InvocationCounter* invocation_counter() { return &_invocation_counter; } | |
278 InvocationCounter* backedge_counter() { return &_backedge_counter; } | |
279 int invocation_count() const { return _invocation_counter.count(); } | |
280 int backedge_count() const { return _backedge_counter.count(); } | |
281 bool was_executed_more_than(int n) const; | |
282 bool was_never_executed() const { return !was_executed_more_than(0); } | |
283 | |
284 static void build_interpreter_method_data(methodHandle method, TRAPS); | |
285 | |
286 int interpreter_invocation_count() const { return _interpreter_invocation_count; } | |
287 void set_interpreter_invocation_count(int count) { _interpreter_invocation_count = count; } | |
288 int increment_interpreter_invocation_count() { return ++_interpreter_invocation_count; } | |
289 | |
290 #ifndef PRODUCT | |
291 int compiled_invocation_count() const { return _compiled_invocation_count; } | |
292 void set_compiled_invocation_count(int count) { _compiled_invocation_count = count; } | |
293 #endif // not PRODUCT | |
294 | |
295 // Clear (non-shared space) pointers which could not be relevent | |
296 // if this (shared) method were mapped into another JVM. | |
297 void remove_unshareable_info(); | |
298 | |
299 // nmethod/verified compiler entry | |
300 address verified_code_entry(); | |
301 bool check_code() const; // Not inline to avoid circular ref | |
302 nmethod* volatile code() const { assert( check_code(), "" ); return (nmethod *)OrderAccess::load_ptr_acquire(&_code); } | |
303 void clear_code(); // Clear out any compiled code | |
304 void set_code(methodHandle mh, nmethod* code); | |
305 void set_adapter_entry(AdapterHandlerEntry* adapter) { _adapter = adapter; } | |
306 address get_i2c_entry(); | |
307 address get_c2i_entry(); | |
308 address get_c2i_unverified_entry(); | |
309 AdapterHandlerEntry* adapter() { return _adapter; } | |
310 // setup entry points | |
311 void link_method(methodHandle method, TRAPS); | |
312 // clear entry points. Used by sharing code | |
313 void unlink_method(); | |
314 | |
315 // vtable index | |
316 enum VtableIndexFlag { | |
317 // Valid vtable indexes are non-negative (>= 0). | |
318 // These few negative values are used as sentinels. | |
319 invalid_vtable_index = -4, // distinct from any valid vtable index | |
320 garbage_vtable_index = -3, // not yet linked; no vtable layout yet | |
321 nonvirtual_vtable_index = -2 // there is no need for vtable dispatch | |
322 // 6330203 Note: Do not use -1, which was overloaded with many meanings. | |
323 }; | |
324 DEBUG_ONLY(bool valid_vtable_index() const { return _vtable_index >= nonvirtual_vtable_index; }) | |
325 int vtable_index() const { assert(valid_vtable_index(), ""); | |
326 return _vtable_index; } | |
327 void set_vtable_index(int index) { _vtable_index = index; } | |
328 | |
329 // interpreter entry | |
330 address interpreter_entry() const { return _i2i_entry; } | |
331 // Only used when first initialize so we can set _i2i_entry and _from_interpreted_entry | |
332 void set_interpreter_entry(address entry) { _i2i_entry = entry; _from_interpreted_entry = entry; } | |
333 int interpreter_kind(void) { | |
334 return constMethod()->interpreter_kind(); | |
335 } | |
336 void set_interpreter_kind(); | |
337 void set_interpreter_kind(int kind) { | |
338 constMethod()->set_interpreter_kind(kind); | |
339 } | |
340 | |
341 // native function (used for native methods only) | |
342 enum { | |
343 native_bind_event_is_interesting = true | |
344 }; | |
345 address native_function() const { return *(native_function_addr()); } | |
346 // Must specify a real function (not NULL). | |
347 // Use clear_native_function() to unregister. | |
348 void set_native_function(address function, bool post_event_flag); | |
349 bool has_native_function() const; | |
350 void clear_native_function(); | |
351 | |
352 // signature handler (used for native methods only) | |
353 address signature_handler() const { return *(signature_handler_addr()); } | |
354 void set_signature_handler(address handler); | |
355 | |
356 // Interpreter oopmap support | |
357 void mask_for(int bci, InterpreterOopMap* mask); | |
358 | |
359 #ifndef PRODUCT | |
360 // operations on invocation counter | |
361 void print_invocation_count() const; | |
362 #endif | |
363 | |
364 // byte codes | |
365 address code_base() const { return constMethod()->code_base(); } | |
366 bool contains(address bcp) const { return constMethod()->contains(bcp); } | |
367 | |
368 // prints byte codes | |
369 void print_codes() const { print_codes_on(tty); } | |
370 void print_codes_on(outputStream* st) const PRODUCT_RETURN; | |
371 void print_codes_on(int from, int to, outputStream* st) const PRODUCT_RETURN; | |
372 | |
373 // checked exceptions | |
374 int checked_exceptions_length() const | |
375 { return constMethod()->checked_exceptions_length(); } | |
376 CheckedExceptionElement* checked_exceptions_start() const | |
377 { return constMethod()->checked_exceptions_start(); } | |
378 | |
379 // localvariable table | |
380 bool has_localvariable_table() const | |
381 { return constMethod()->has_localvariable_table(); } | |
382 int localvariable_table_length() const | |
383 { return constMethod()->localvariable_table_length(); } | |
384 LocalVariableTableElement* localvariable_table_start() const | |
385 { return constMethod()->localvariable_table_start(); } | |
386 | |
387 bool has_linenumber_table() const | |
388 { return constMethod()->has_linenumber_table(); } | |
389 u_char* compressed_linenumber_table() const | |
390 { return constMethod()->compressed_linenumber_table(); } | |
391 | |
392 // method holder (the klassOop holding this method) | |
393 klassOop method_holder() const { return _constants->pool_holder(); } | |
394 | |
395 void compute_size_of_parameters(Thread *thread); // word size of parameters (receiver if any + arguments) | |
396 symbolOop klass_name() const; // returns the name of the method holder | |
397 BasicType result_type() const; // type of the method result | |
398 int result_type_index() const; // type index of the method result | |
399 bool is_returning_oop() const { BasicType r = result_type(); return (r == T_OBJECT || r == T_ARRAY); } | |
400 bool is_returning_fp() const { BasicType r = result_type(); return (r == T_FLOAT || r == T_DOUBLE); } | |
401 | |
402 // Checked exceptions thrown by this method (resolved to mirrors) | |
403 objArrayHandle resolved_checked_exceptions(TRAPS) { return resolved_checked_exceptions_impl(this, THREAD); } | |
404 | |
405 // Access flags | |
406 bool is_public() const { return access_flags().is_public(); } | |
407 bool is_private() const { return access_flags().is_private(); } | |
408 bool is_protected() const { return access_flags().is_protected(); } | |
409 bool is_package_private() const { return !is_public() && !is_private() && !is_protected(); } | |
410 bool is_static() const { return access_flags().is_static(); } | |
411 bool is_final() const { return access_flags().is_final(); } | |
412 bool is_synchronized() const { return access_flags().is_synchronized();} | |
413 bool is_native() const { return access_flags().is_native(); } | |
414 bool is_abstract() const { return access_flags().is_abstract(); } | |
415 bool is_strict() const { return access_flags().is_strict(); } | |
416 bool is_synthetic() const { return access_flags().is_synthetic(); } | |
417 | |
418 // returns true if contains only return operation | |
419 bool is_empty_method() const; | |
420 | |
421 // returns true if this is a vanilla constructor | |
422 bool is_vanilla_constructor() const; | |
423 | |
424 // checks method and its method holder | |
425 bool is_final_method() const; | |
426 bool is_strict_method() const; | |
427 | |
428 // true if method needs no dynamic dispatch (final and/or no vtable entry) | |
429 bool can_be_statically_bound() const; | |
430 | |
431 // returns true if the method has any backward branches. | |
432 bool has_loops() { | |
433 return access_flags().loops_flag_init() ? access_flags().has_loops() : compute_has_loops_flag(); | |
434 }; | |
435 | |
436 bool compute_has_loops_flag(); | |
437 | |
438 bool has_jsrs() { | |
439 return access_flags().has_jsrs(); | |
440 }; | |
441 void set_has_jsrs() { | |
442 _access_flags.set_has_jsrs(); | |
443 } | |
444 | |
445 // returns true if the method has any monitors. | |
446 bool has_monitors() const { return is_synchronized() || access_flags().has_monitor_bytecodes(); } | |
447 bool has_monitor_bytecodes() const { return access_flags().has_monitor_bytecodes(); } | |
448 | |
449 void set_has_monitor_bytecodes() { _access_flags.set_has_monitor_bytecodes(); } | |
450 | |
451 // monitor matching. This returns a conservative estimate of whether the monitorenter/monitorexit bytecodes | |
452 // propererly nest in the method. It might return false, even though they actually nest properly, since the info. | |
453 // has not been computed yet. | |
454 bool guaranteed_monitor_matching() const { return access_flags().is_monitor_matching(); } | |
455 void set_guaranteed_monitor_matching() { _access_flags.set_monitor_matching(); } | |
456 | |
457 // returns true if the method is an accessor function (setter/getter). | |
458 bool is_accessor() const; | |
459 | |
460 // returns true if the method is an initializer (<init> or <clinit>). | |
461 bool is_initializer() const; | |
462 | |
463 // compiled code support | |
464 // NOTE: code() is inherently racy as deopt can be clearing code | |
465 // simultaneously. Use with caution. | |
466 bool has_compiled_code() const { return code() != NULL; } | |
467 | |
468 // sizing | |
469 static int object_size(bool is_native); | |
470 static int header_size() { return sizeof(methodOopDesc)/HeapWordSize; } | |
471 int object_size() const { return method_size(); } | |
472 | |
473 bool object_is_parsable() const { return method_size() > 0; } | |
474 | |
475 // interpreter support | |
476 static ByteSize const_offset() { return byte_offset_of(methodOopDesc, _constMethod ); } | |
477 static ByteSize constants_offset() { return byte_offset_of(methodOopDesc, _constants ); } | |
478 static ByteSize access_flags_offset() { return byte_offset_of(methodOopDesc, _access_flags ); } | |
479 #ifdef CC_INTERP | |
480 static ByteSize result_index_offset() { return byte_offset_of(methodOopDesc, _result_index ); } | |
481 #endif /* CC_INTERP */ | |
482 static ByteSize size_of_locals_offset() { return byte_offset_of(methodOopDesc, _max_locals ); } | |
483 static ByteSize size_of_parameters_offset() { return byte_offset_of(methodOopDesc, _size_of_parameters); } | |
484 static ByteSize from_compiled_offset() { return byte_offset_of(methodOopDesc, _from_compiled_entry); } | |
485 static ByteSize code_offset() { return byte_offset_of(methodOopDesc, _code); } | |
486 static ByteSize invocation_counter_offset() { return byte_offset_of(methodOopDesc, _invocation_counter); } | |
487 static ByteSize backedge_counter_offset() { return byte_offset_of(methodOopDesc, _backedge_counter); } | |
488 static ByteSize method_data_offset() { | |
489 return byte_offset_of(methodOopDesc, _method_data); | |
490 } | |
491 static ByteSize interpreter_invocation_counter_offset() { return byte_offset_of(methodOopDesc, _interpreter_invocation_count); } | |
492 #ifndef PRODUCT | |
493 static ByteSize compiled_invocation_counter_offset() { return byte_offset_of(methodOopDesc, _compiled_invocation_count); } | |
494 #endif // not PRODUCT | |
495 static ByteSize native_function_offset() { return in_ByteSize(sizeof(methodOopDesc)); } | |
496 static ByteSize from_interpreted_offset() { return byte_offset_of(methodOopDesc, _from_interpreted_entry ); } | |
497 static ByteSize interpreter_entry_offset() { return byte_offset_of(methodOopDesc, _i2i_entry ); } | |
498 static ByteSize signature_handler_offset() { return in_ByteSize(sizeof(methodOopDesc) + wordSize); } | |
499 static ByteSize max_stack_offset() { return byte_offset_of(methodOopDesc, _max_stack ); } | |
500 | |
501 // for code generation | |
502 static int method_data_offset_in_bytes() { return offset_of(methodOopDesc, _method_data); } | |
503 static int interpreter_invocation_counter_offset_in_bytes() | |
504 { return offset_of(methodOopDesc, _interpreter_invocation_count); } | |
505 | |
506 // Static methods that are used to implement member methods where an exposed this pointer | |
507 // is needed due to possible GCs | |
508 static objArrayHandle resolved_checked_exceptions_impl(methodOop this_oop, TRAPS); | |
509 | |
510 // Returns the byte code index from the byte code pointer | |
511 int bci_from(address bcp) const; | |
512 address bcp_from(int bci) const; | |
513 int validate_bci_from_bcx(intptr_t bcx) const; | |
514 | |
515 // Returns the line number for a bci if debugging information for the method is prowided, | |
516 // -1 is returned otherwise. | |
517 int line_number_from_bci(int bci) const; | |
518 | |
519 // Reflection support | |
520 bool is_overridden_in(klassOop k) const; | |
521 | |
522 // RedefineClasses() support: | |
523 bool is_old() const { return access_flags().is_old(); } | |
524 void set_is_old() { _access_flags.set_is_old(); } | |
525 bool is_obsolete() const { return access_flags().is_obsolete(); } | |
526 void set_is_obsolete() { _access_flags.set_is_obsolete(); } | |
527 | |
528 // JVMTI Native method prefixing support: | |
529 bool is_prefixed_native() const { return access_flags().is_prefixed_native(); } | |
530 void set_is_prefixed_native() { _access_flags.set_is_prefixed_native(); } | |
531 | |
532 // Rewriting support | |
533 static methodHandle clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length, | |
534 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS); | |
535 | |
536 // Get this method's jmethodID -- allocate if it doesn't exist | |
537 jmethodID jmethod_id() { methodHandle this_h(this); | |
538 return instanceKlass::jmethod_id_for_impl(method_holder(), this_h); } | |
539 | |
540 // Lookup the jmethodID for this method. Return NULL if not found. | |
541 // NOTE that this function can be called from a signal handler | |
542 // (see AsyncGetCallTrace support for Forte Analyzer) and this | |
543 // needs to be async-safe. No allocation should be done and | |
544 // so handles are not used to avoid deadlock. | |
545 jmethodID find_jmethod_id_or_null() { return instanceKlass::cast(method_holder())->jmethod_id_or_null(this); } | |
546 | |
547 // JNI static invoke cached itable index accessors | |
548 int cached_itable_index() { return instanceKlass::cast(method_holder())->cached_itable_index(method_idnum()); } | |
549 void set_cached_itable_index(int index) { instanceKlass::cast(method_holder())->set_cached_itable_index(method_idnum(), index); } | |
550 | |
551 // Support for inlining of intrinsic methods | |
552 vmIntrinsics::ID intrinsic_id() const { // returns zero if not an intrinsic | |
553 const u1& cache = _intrinsic_id_cache; | |
554 if (cache != 0) { | |
555 return (vmIntrinsics::ID)(cache - 1); | |
556 } else { | |
557 vmIntrinsics::ID id = compute_intrinsic_id(); | |
558 *(u1*)&cache = ((u1) id) + 1; // force the cache to be non-const | |
559 vmIntrinsics::verify_method(id, (methodOop) this); | |
560 assert((vmIntrinsics::ID)(cache - 1) == id, "proper conversion"); | |
561 return id; | |
562 } | |
563 } | |
564 | |
565 // On-stack replacement support | |
566 bool has_osr_nmethod() { return instanceKlass::cast(method_holder())->lookup_osr_nmethod(this, InvocationEntryBci) != NULL; } | |
567 nmethod* lookup_osr_nmethod_for(int bci) { return instanceKlass::cast(method_holder())->lookup_osr_nmethod(this, bci); } | |
568 | |
569 // Inline cache support | |
570 void cleanup_inline_caches(); | |
571 | |
572 // Find if klass for method is loaded | |
573 bool is_klass_loaded_by_klass_index(int klass_index) const; | |
574 bool is_klass_loaded(int refinfo_index, bool must_be_resolved = false) const; | |
575 | |
576 // Indicates whether compilation failed earlier for this method, or | |
577 // whether it is not compilable for another reason like having a | |
578 // breakpoint set in it. | |
579 bool is_not_compilable(int comp_level = CompLevel_highest_tier) const; | |
580 void set_not_compilable(int comp_level = CompLevel_highest_tier); | |
581 | |
582 bool is_not_osr_compilable() const { return is_not_compilable() || access_flags().is_not_osr_compilable(); } | |
583 void set_not_osr_compilable() { _access_flags.set_not_osr_compilable(); } | |
584 | |
585 bool is_not_tier1_compilable() const { return access_flags().is_not_tier1_compilable(); } | |
586 void set_not_tier1_compilable() { _access_flags.set_not_tier1_compilable(); } | |
587 | |
588 // Background compilation support | |
589 bool queued_for_compilation() const { return access_flags().queued_for_compilation(); } | |
590 void set_queued_for_compilation() { _access_flags.set_queued_for_compilation(); } | |
591 void clear_queued_for_compilation() { _access_flags.clear_queued_for_compilation(); } | |
592 | |
593 static methodOop method_from_bcp(address bcp); | |
594 | |
595 // Resolve all classes in signature, return 'true' if successful | |
596 static bool load_signature_classes(methodHandle m, TRAPS); | |
597 | |
598 // Return if true if not all classes references in signature, including return type, has been loaded | |
599 static bool has_unloaded_classes_in_signature(methodHandle m, TRAPS); | |
600 | |
601 // Printing | |
602 void print_short_name(outputStream* st) /*PRODUCT_RETURN*/; // prints as klassname::methodname; Exposed so field engineers can debug VM | |
603 void print_name(outputStream* st) PRODUCT_RETURN; // prints as "virtual void foo(int)" | |
604 | |
605 // Helper routine used for method sorting | |
606 static void sort_methods(objArrayOop methods, | |
607 objArrayOop methods_annotations, | |
608 objArrayOop methods_parameter_annotations, | |
609 objArrayOop methods_default_annotations, | |
610 bool idempotent = false); | |
611 | |
612 // size of parameters | |
613 void set_size_of_parameters(int size) { _size_of_parameters = size; } | |
614 private: | |
615 | |
616 // Helper routine for intrinsic_id(). | |
617 vmIntrinsics::ID compute_intrinsic_id() const; | |
618 | |
619 // Inlined elements | |
620 address* native_function_addr() const { assert(is_native(), "must be native"); return (address*) (this+1); } | |
621 address* signature_handler_addr() const { return native_function_addr() + 1; } | |
622 | |
623 // Garbage collection support | |
624 oop* adr_constMethod() const { return (oop*)&_constMethod; } | |
625 oop* adr_constants() const { return (oop*)&_constants; } | |
626 oop* adr_method_data() const { return (oop*)&_method_data; } | |
627 }; | |
628 | |
629 | |
630 // Utility class for compressing line number tables | |
631 | |
632 class CompressedLineNumberWriteStream: public CompressedWriteStream { | |
633 private: | |
634 int _bci; | |
635 int _line; | |
636 public: | |
637 // Constructor | |
638 CompressedLineNumberWriteStream(int initial_size) : CompressedWriteStream(initial_size), _bci(0), _line(0) {} | |
639 CompressedLineNumberWriteStream(u_char* buffer, int initial_size) : CompressedWriteStream(buffer, initial_size), _bci(0), _line(0) {} | |
640 | |
641 // Write (bci, line number) pair to stream | |
642 void write_pair_regular(int bci_delta, int line_delta); | |
643 | |
644 inline void write_pair_inline(int bci, int line) { | |
645 int bci_delta = bci - _bci; | |
646 int line_delta = line - _line; | |
647 _bci = bci; | |
648 _line = line; | |
649 // Skip (0,0) deltas - they do not add information and conflict with terminator. | |
650 if (bci_delta == 0 && line_delta == 0) return; | |
651 // Check if bci is 5-bit and line number 3-bit unsigned. | |
652 if (((bci_delta & ~0x1F) == 0) && ((line_delta & ~0x7) == 0)) { | |
653 // Compress into single byte. | |
654 jubyte value = ((jubyte) bci_delta << 3) | (jubyte) line_delta; | |
655 // Check that value doesn't match escape character. | |
656 if (value != 0xFF) { | |
657 write_byte(value); | |
658 return; | |
659 } | |
660 } | |
661 write_pair_regular(bci_delta, line_delta); | |
662 } | |
663 | |
664 // Windows AMD64 + Apr 2005 PSDK with /O2 generates bad code for write_pair. | |
665 // Disabling optimization doesn't work for methods in header files | |
666 // so we force it to call through the non-optimized version in the .cpp. | |
667 // It's gross, but it's the only way we can ensure that all callers are | |
668 // fixed. MSC_VER is defined in build/windows/makefiles/compile.make. | |
669 #if defined(_M_AMD64) && MSC_VER >= 1400 | |
670 void write_pair(int bci, int line); | |
671 #else | |
672 void write_pair(int bci, int line) { write_pair_inline(bci, line); } | |
673 #endif | |
674 | |
675 // Write end-of-stream marker | |
676 void write_terminator() { write_byte(0); } | |
677 }; | |
678 | |
679 | |
680 // Utility class for decompressing line number tables | |
681 | |
682 class CompressedLineNumberReadStream: public CompressedReadStream { | |
683 private: | |
684 int _bci; | |
685 int _line; | |
686 public: | |
687 // Constructor | |
688 CompressedLineNumberReadStream(u_char* buffer); | |
689 // Read (bci, line number) pair from stream. Returns false at end-of-stream. | |
690 bool read_pair(); | |
691 // Accessing bci and line number (after calling read_pair) | |
692 int bci() const { return _bci; } | |
693 int line() const { return _line; } | |
694 }; | |
695 | |
696 | |
697 /// Fast Breakpoints. | |
698 | |
699 // If this structure gets more complicated (because bpts get numerous), | |
700 // move it into its own header. | |
701 | |
702 // There is presently no provision for concurrent access | |
703 // to breakpoint lists, which is only OK for JVMTI because | |
704 // breakpoints are written only at safepoints, and are read | |
705 // concurrently only outside of safepoints. | |
706 | |
707 class BreakpointInfo : public CHeapObj { | |
708 friend class VMStructs; | |
709 private: | |
710 Bytecodes::Code _orig_bytecode; | |
711 int _bci; | |
712 u2 _name_index; // of method | |
713 u2 _signature_index; // of method | |
714 BreakpointInfo* _next; // simple storage allocation | |
715 | |
716 public: | |
717 BreakpointInfo(methodOop m, int bci); | |
718 | |
719 // accessors | |
720 Bytecodes::Code orig_bytecode() { return _orig_bytecode; } | |
721 void set_orig_bytecode(Bytecodes::Code code) { _orig_bytecode = code; } | |
722 int bci() { return _bci; } | |
723 | |
724 BreakpointInfo* next() const { return _next; } | |
725 void set_next(BreakpointInfo* n) { _next = n; } | |
726 | |
727 // helps for searchers | |
728 bool match(methodOop m, int bci) { | |
729 return bci == _bci && match(m); | |
730 } | |
731 | |
732 bool match(methodOop m) { | |
733 return _name_index == m->name_index() && | |
734 _signature_index == m->signature_index(); | |
735 } | |
736 | |
737 void set(methodOop method); | |
738 void clear(methodOop method); | |
739 }; |