Mercurial > hg > graal-jvmci-8
comparison src/share/vm/oops/method.cpp @ 6948:e522a00b91aa
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/ after NPG - C++ build works
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Mon, 12 Nov 2012 23:14:12 +0100 |
parents | src/share/vm/oops/methodOop.cpp@957c266d8bc5 src/share/vm/oops/methodOop.cpp@18fb7da42534 |
children | 41938af2b3d8 |
comparison
equal
deleted
inserted
replaced
6711:ae13cc658b80 | 6948:e522a00b91aa |
---|---|
1 /* | |
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA | |
20 * or visit www.oracle.com if you need additional information or have any | |
21 * questions. | |
22 * | |
23 */ | |
24 | |
25 #include "precompiled.hpp" | |
26 #include "classfile/systemDictionary.hpp" | |
27 #include "code/debugInfoRec.hpp" | |
28 #include "gc_interface/collectedHeap.inline.hpp" | |
29 #include "interpreter/bytecodeStream.hpp" | |
30 #include "interpreter/bytecodeTracer.hpp" | |
31 #include "interpreter/bytecodes.hpp" | |
32 #include "interpreter/interpreter.hpp" | |
33 #include "interpreter/oopMapCache.hpp" | |
34 #include "memory/gcLocker.hpp" | |
35 #include "memory/generation.hpp" | |
36 #include "memory/metadataFactory.hpp" | |
37 #include "memory/oopFactory.hpp" | |
38 #include "oops/constMethod.hpp" | |
39 #include "oops/methodData.hpp" | |
40 #include "oops/method.hpp" | |
41 #include "oops/oop.inline.hpp" | |
42 #include "oops/symbol.hpp" | |
43 #include "prims/jvmtiExport.hpp" | |
44 #include "prims/jvmtiRedefineClasses.hpp" | |
45 #include "prims/methodHandles.hpp" | |
46 #include "prims/nativeLookup.hpp" | |
47 #include "runtime/arguments.hpp" | |
48 #include "runtime/compilationPolicy.hpp" | |
49 #include "runtime/frame.inline.hpp" | |
50 #include "runtime/handles.inline.hpp" | |
51 #include "runtime/relocator.hpp" | |
52 #include "runtime/sharedRuntime.hpp" | |
53 #include "runtime/signature.hpp" | |
54 #include "utilities/quickSort.hpp" | |
55 #include "utilities/xmlstream.hpp" | |
56 #ifdef GRAAL | |
57 #include "graal/graalJavaAccess.hpp" | |
58 #endif | |
59 | |
60 | |
61 // Implementation of Method | |
62 | |
63 Method* Method::allocate(ClassLoaderData* loader_data, | |
64 int byte_code_size, | |
65 AccessFlags access_flags, | |
66 int compressed_line_number_size, | |
67 int localvariable_table_length, | |
68 int exception_table_length, | |
69 int checked_exceptions_length, | |
70 ConstMethod::MethodType method_type, | |
71 TRAPS) { | |
72 assert(!access_flags.is_native() || byte_code_size == 0, | |
73 "native methods should not contain byte codes"); | |
74 ConstMethod* cm = ConstMethod::allocate(loader_data, | |
75 byte_code_size, | |
76 compressed_line_number_size, | |
77 localvariable_table_length, | |
78 exception_table_length, | |
79 checked_exceptions_length, | |
80 method_type, | |
81 CHECK_NULL); | |
82 | |
83 int size = Method::size(access_flags.is_native()); | |
84 | |
85 return new (loader_data, size, false, THREAD) Method(cm, access_flags, size); | |
86 } | |
87 | |
88 Method::Method(ConstMethod* xconst, | |
89 AccessFlags access_flags, int size) { | |
90 No_Safepoint_Verifier no_safepoint; | |
91 set_constMethod(xconst); | |
92 set_access_flags(access_flags); | |
93 set_method_size(size); | |
94 set_name_index(0); | |
95 set_signature_index(0); | |
96 #ifdef CC_INTERP | |
97 set_result_index(T_VOID); | |
98 #endif | |
99 set_constants(NULL); | |
100 set_max_stack(0); | |
101 set_max_locals(0); | |
102 set_intrinsic_id(vmIntrinsics::_none); | |
103 set_jfr_towrite(false); | |
104 set_method_data(NULL); | |
105 set_interpreter_throwout_count(0); | |
106 set_vtable_index(Method::garbage_vtable_index); | |
107 | |
108 // Fix and bury in Method* | |
109 set_interpreter_entry(NULL); // sets i2i entry and from_int | |
110 set_adapter_entry(NULL); | |
111 clear_code(); // from_c/from_i get set to c2i/i2i | |
112 | |
113 if (access_flags.is_native()) { | |
114 clear_native_function(); | |
115 set_signature_handler(NULL); | |
116 } | |
117 | |
118 NOT_PRODUCT(set_compiled_invocation_count(0);) | |
119 set_interpreter_invocation_count(0); | |
120 invocation_counter()->init(); | |
121 backedge_counter()->init(); | |
122 clear_number_of_breakpoints(); | |
123 | |
124 #ifdef TIERED | |
125 set_rate(0); | |
126 set_prev_event_count(0); | |
127 set_prev_time(0); | |
128 #endif | |
129 } | |
130 | |
131 // Release Method*. The nmethod will be gone when we get here because | |
132 // we've walked the code cache. | |
133 void Method::deallocate_contents(ClassLoaderData* loader_data) { | |
134 MetadataFactory::free_metadata(loader_data, constMethod()); | |
135 set_constMethod(NULL); | |
136 MetadataFactory::free_metadata(loader_data, method_data()); | |
137 set_method_data(NULL); | |
138 // The nmethod will be gone when we get here. | |
139 if (code() != NULL) _code = NULL; | |
140 } | |
141 | |
142 address Method::get_i2c_entry() { | |
143 assert(_adapter != NULL, "must have"); | |
144 return _adapter->get_i2c_entry(); | |
145 } | |
146 | |
147 address Method::get_c2i_entry() { | |
148 assert(_adapter != NULL, "must have"); | |
149 return _adapter->get_c2i_entry(); | |
150 } | |
151 | |
152 address Method::get_c2i_unverified_entry() { | |
153 assert(_adapter != NULL, "must have"); | |
154 return _adapter->get_c2i_unverified_entry(); | |
155 } | |
156 | |
157 char* Method::name_and_sig_as_C_string() const { | |
158 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature()); | |
159 } | |
160 | |
161 char* Method::name_and_sig_as_C_string(char* buf, int size) const { | |
162 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature(), buf, size); | |
163 } | |
164 | |
165 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) { | |
166 const char* klass_name = klass->external_name(); | |
167 int klass_name_len = (int)strlen(klass_name); | |
168 int method_name_len = method_name->utf8_length(); | |
169 int len = klass_name_len + 1 + method_name_len + signature->utf8_length(); | |
170 char* dest = NEW_RESOURCE_ARRAY(char, len + 1); | |
171 strcpy(dest, klass_name); | |
172 dest[klass_name_len] = '.'; | |
173 strcpy(&dest[klass_name_len + 1], method_name->as_C_string()); | |
174 strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string()); | |
175 dest[len] = 0; | |
176 return dest; | |
177 } | |
178 | |
179 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) { | |
180 Symbol* klass_name = klass->name(); | |
181 klass_name->as_klass_external_name(buf, size); | |
182 int len = (int)strlen(buf); | |
183 | |
184 if (len < size - 1) { | |
185 buf[len++] = '.'; | |
186 | |
187 method_name->as_C_string(&(buf[len]), size - len); | |
188 len = (int)strlen(buf); | |
189 | |
190 signature->as_C_string(&(buf[len]), size - len); | |
191 } | |
192 | |
193 return buf; | |
194 } | |
195 | |
196 int Method::fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS) { | |
197 // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index) | |
198 // access exception table | |
199 ExceptionTable table(this); | |
200 int length = table.length(); | |
201 // iterate through all entries sequentially | |
202 constantPoolHandle pool(THREAD, constants()); | |
203 for (int i = 0; i < length; i ++) { | |
204 //reacquire the table in case a GC happened | |
205 ExceptionTable table(this); | |
206 int beg_bci = table.start_pc(i); | |
207 int end_bci = table.end_pc(i); | |
208 assert(beg_bci <= end_bci, "inconsistent exception table"); | |
209 if (beg_bci <= throw_bci && throw_bci < end_bci) { | |
210 // exception handler bci range covers throw_bci => investigate further | |
211 int handler_bci = table.handler_pc(i); | |
212 int klass_index = table.catch_type_index(i); | |
213 if (klass_index == 0) { | |
214 return handler_bci; | |
215 } else if (ex_klass.is_null()) { | |
216 return handler_bci; | |
217 } else { | |
218 // we know the exception class => get the constraint class | |
219 // this may require loading of the constraint class; if verification | |
220 // fails or some other exception occurs, return handler_bci | |
221 Klass* k = pool->klass_at(klass_index, CHECK_(handler_bci)); | |
222 KlassHandle klass = KlassHandle(THREAD, k); | |
223 assert(klass.not_null(), "klass not loaded"); | |
224 if (ex_klass->is_subtype_of(klass())) { | |
225 return handler_bci; | |
226 } | |
227 } | |
228 } | |
229 } | |
230 | |
231 return -1; | |
232 } | |
233 | |
234 void Method::mask_for(int bci, InterpreterOopMap* mask) { | |
235 | |
236 Thread* myThread = Thread::current(); | |
237 methodHandle h_this(myThread, this); | |
238 #ifdef ASSERT | |
239 bool has_capability = myThread->is_VM_thread() || | |
240 myThread->is_ConcurrentGC_thread() || | |
241 myThread->is_GC_task_thread(); | |
242 | |
243 if (!has_capability) { | |
244 if (!VerifyStack && !VerifyLastFrame) { | |
245 // verify stack calls this outside VM thread | |
246 warning("oopmap should only be accessed by the " | |
247 "VM, GC task or CMS threads (or during debugging)"); | |
248 InterpreterOopMap local_mask; | |
249 method_holder()->mask_for(h_this, bci, &local_mask); | |
250 local_mask.print(); | |
251 } | |
252 } | |
253 #endif | |
254 method_holder()->mask_for(h_this, bci, mask); | |
255 return; | |
256 } | |
257 | |
258 | |
259 int Method::bci_from(address bcp) const { | |
260 #ifdef ASSERT | |
261 { ResourceMark rm; | |
262 assert(is_native() && bcp == code_base() || contains(bcp) || is_error_reported(), | |
263 err_msg("bcp doesn't belong to this method: bcp: " INTPTR_FORMAT ", method: %s", bcp, name_and_sig_as_C_string())); | |
264 } | |
265 #endif | |
266 return bcp - code_base(); | |
267 } | |
268 | |
269 | |
270 // Return (int)bcx if it appears to be a valid BCI. | |
271 // Return bci_from((address)bcx) if it appears to be a valid BCP. | |
272 // Return -1 otherwise. | |
273 // Used by profiling code, when invalid data is a possibility. | |
274 // The caller is responsible for validating the Method* itself. | |
275 int Method::validate_bci_from_bcx(intptr_t bcx) const { | |
276 // keep bci as -1 if not a valid bci | |
277 int bci = -1; | |
278 if (bcx == 0 || (address)bcx == code_base()) { | |
279 // code_size() may return 0 and we allow 0 here | |
280 // the method may be native | |
281 bci = 0; | |
282 } else if (frame::is_bci(bcx)) { | |
283 if (bcx < code_size()) { | |
284 bci = (int)bcx; | |
285 } | |
286 } else if (contains((address)bcx)) { | |
287 bci = (address)bcx - code_base(); | |
288 } | |
289 // Assert that if we have dodged any asserts, bci is negative. | |
290 assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0"); | |
291 return bci; | |
292 } | |
293 | |
294 address Method::bcp_from(int bci) const { | |
295 assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), "illegal bci"); | |
296 address bcp = code_base() + bci; | |
297 assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method"); | |
298 return bcp; | |
299 } | |
300 | |
301 | |
302 int Method::size(bool is_native) { | |
303 // If native, then include pointers for native_function and signature_handler | |
304 int extra_bytes = (is_native) ? 2*sizeof(address*) : 0; | |
305 int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord; | |
306 return align_object_size(header_size() + extra_words); | |
307 } | |
308 | |
309 | |
310 Symbol* Method::klass_name() const { | |
311 Klass* k = method_holder(); | |
312 assert(k->is_klass(), "must be klass"); | |
313 InstanceKlass* ik = (InstanceKlass*) k; | |
314 return ik->name(); | |
315 } | |
316 | |
317 | |
318 void Method::set_interpreter_kind() { | |
319 int kind = Interpreter::method_kind(this); | |
320 assert(kind != Interpreter::invalid, | |
321 "interpreter entry must be valid"); | |
322 set_interpreter_kind(kind); | |
323 } | |
324 | |
325 | |
326 // Attempt to return method oop to original state. Clear any pointers | |
327 // (to objects outside the shared spaces). We won't be able to predict | |
328 // where they should point in a new JVM. Further initialize some | |
329 // entries now in order allow them to be write protected later. | |
330 | |
331 void Method::remove_unshareable_info() { | |
332 unlink_method(); | |
333 set_interpreter_kind(); | |
334 } | |
335 | |
336 | |
337 bool Method::was_executed_more_than(int n) { | |
338 // Invocation counter is reset when the Method* is compiled. | |
339 // If the method has compiled code we therefore assume it has | |
340 // be excuted more than n times. | |
341 if (is_accessor() || is_empty_method() || (code() != NULL)) { | |
342 // interpreter doesn't bump invocation counter of trivial methods | |
343 // compiler does not bump invocation counter of compiled methods | |
344 return true; | |
345 } | |
346 else if (_invocation_counter.carry() || (method_data() != NULL && method_data()->invocation_counter()->carry())) { | |
347 // The carry bit is set when the counter overflows and causes | |
348 // a compilation to occur. We don't know how many times | |
349 // the counter has been reset, so we simply assume it has | |
350 // been executed more than n times. | |
351 return true; | |
352 } else { | |
353 return invocation_count() > n; | |
354 } | |
355 } | |
356 | |
357 #ifndef PRODUCT | |
358 void Method::print_invocation_count() { | |
359 if (is_static()) tty->print("static "); | |
360 if (is_final()) tty->print("final "); | |
361 if (is_synchronized()) tty->print("synchronized "); | |
362 if (is_native()) tty->print("native "); | |
363 method_holder()->name()->print_symbol_on(tty); | |
364 tty->print("."); | |
365 name()->print_symbol_on(tty); | |
366 signature()->print_symbol_on(tty); | |
367 | |
368 if (WizardMode) { | |
369 // dump the size of the byte codes | |
370 tty->print(" {%d}", code_size()); | |
371 } | |
372 tty->cr(); | |
373 | |
374 tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count()); | |
375 tty->print_cr (" invocation_counter: %8d ", invocation_count()); | |
376 tty->print_cr (" backedge_counter: %8d ", backedge_count()); | |
377 if (CountCompiledCalls) { | |
378 tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count()); | |
379 } | |
380 | |
381 } | |
382 #endif | |
383 | |
384 // Build a MethodData* object to hold information about this method | |
385 // collected in the interpreter. | |
386 void Method::build_interpreter_method_data(methodHandle method, TRAPS) { | |
387 // Do not profile method if current thread holds the pending list lock, | |
388 // which avoids deadlock for acquiring the MethodData_lock. | |
389 if (InstanceRefKlass::owns_pending_list_lock((JavaThread*)THREAD)) { | |
390 return; | |
391 } | |
392 | |
393 // Grab a lock here to prevent multiple | |
394 // MethodData*s from being created. | |
395 MutexLocker ml(MethodData_lock, THREAD); | |
396 if (method->method_data() == NULL) { | |
397 ClassLoaderData* loader_data = method->method_holder()->class_loader_data(); | |
398 MethodData* method_data = MethodData::allocate(loader_data, method, CHECK); | |
399 method->set_method_data(method_data); | |
400 if (PrintMethodData && (Verbose || WizardMode)) { | |
401 ResourceMark rm(THREAD); | |
402 tty->print("build_interpreter_method_data for "); | |
403 method->print_name(tty); | |
404 tty->cr(); | |
405 // At the end of the run, the MDO, full of data, will be dumped. | |
406 } | |
407 } | |
408 } | |
409 | |
410 void Method::cleanup_inline_caches() { | |
411 // The current system doesn't use inline caches in the interpreter | |
412 // => nothing to do (keep this method around for future use) | |
413 } | |
414 | |
415 | |
416 int Method::extra_stack_words() { | |
417 // not an inline function, to avoid a header dependency on Interpreter | |
418 return extra_stack_entries() * Interpreter::stackElementSize; | |
419 } | |
420 | |
421 | |
422 void Method::compute_size_of_parameters(Thread *thread) { | |
423 ArgumentSizeComputer asc(signature()); | |
424 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1)); | |
425 } | |
426 | |
427 #ifdef CC_INTERP | |
428 void Method::set_result_index(BasicType type) { | |
429 _result_index = Interpreter::BasicType_as_index(type); | |
430 } | |
431 #endif | |
432 | |
433 BasicType Method::result_type() const { | |
434 ResultTypeFinder rtf(signature()); | |
435 return rtf.type(); | |
436 } | |
437 | |
438 | |
439 bool Method::is_empty_method() const { | |
440 return code_size() == 1 | |
441 && *code_base() == Bytecodes::_return; | |
442 } | |
443 | |
444 | |
445 bool Method::is_vanilla_constructor() const { | |
446 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method | |
447 // which only calls the superclass vanilla constructor and possibly does stores of | |
448 // zero constants to local fields: | |
449 // | |
450 // aload_0 | |
451 // invokespecial | |
452 // indexbyte1 | |
453 // indexbyte2 | |
454 // | |
455 // followed by an (optional) sequence of: | |
456 // | |
457 // aload_0 | |
458 // aconst_null / iconst_0 / fconst_0 / dconst_0 | |
459 // putfield | |
460 // indexbyte1 | |
461 // indexbyte2 | |
462 // | |
463 // followed by: | |
464 // | |
465 // return | |
466 | |
467 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors"); | |
468 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors"); | |
469 int size = code_size(); | |
470 // Check if size match | |
471 if (size == 0 || size % 5 != 0) return false; | |
472 address cb = code_base(); | |
473 int last = size - 1; | |
474 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) { | |
475 // Does not call superclass default constructor | |
476 return false; | |
477 } | |
478 // Check optional sequence | |
479 for (int i = 4; i < last; i += 5) { | |
480 if (cb[i] != Bytecodes::_aload_0) return false; | |
481 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false; | |
482 if (cb[i+2] != Bytecodes::_putfield) return false; | |
483 } | |
484 return true; | |
485 } | |
486 | |
487 | |
488 bool Method::compute_has_loops_flag() { | |
489 BytecodeStream bcs(this); | |
490 Bytecodes::Code bc; | |
491 | |
492 while ((bc = bcs.next()) >= 0) { | |
493 switch( bc ) { | |
494 case Bytecodes::_ifeq: | |
495 case Bytecodes::_ifnull: | |
496 case Bytecodes::_iflt: | |
497 case Bytecodes::_ifle: | |
498 case Bytecodes::_ifne: | |
499 case Bytecodes::_ifnonnull: | |
500 case Bytecodes::_ifgt: | |
501 case Bytecodes::_ifge: | |
502 case Bytecodes::_if_icmpeq: | |
503 case Bytecodes::_if_icmpne: | |
504 case Bytecodes::_if_icmplt: | |
505 case Bytecodes::_if_icmpgt: | |
506 case Bytecodes::_if_icmple: | |
507 case Bytecodes::_if_icmpge: | |
508 case Bytecodes::_if_acmpeq: | |
509 case Bytecodes::_if_acmpne: | |
510 case Bytecodes::_goto: | |
511 case Bytecodes::_jsr: | |
512 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops(); | |
513 break; | |
514 | |
515 case Bytecodes::_goto_w: | |
516 case Bytecodes::_jsr_w: | |
517 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops(); | |
518 break; | |
519 } | |
520 } | |
521 _access_flags.set_loops_flag_init(); | |
522 return _access_flags.has_loops(); | |
523 } | |
524 | |
525 | |
526 bool Method::is_final_method() const { | |
527 // %%% Should return true for private methods also, | |
528 // since there is no way to override them. | |
529 return is_final() || method_holder()->is_final(); | |
530 } | |
531 | |
532 | |
533 bool Method::is_strict_method() const { | |
534 return is_strict(); | |
535 } | |
536 | |
537 | |
538 bool Method::can_be_statically_bound() const { | |
539 if (is_final_method()) return true; | |
540 return vtable_index() == nonvirtual_vtable_index; | |
541 } | |
542 | |
543 | |
544 bool Method::is_accessor() const { | |
545 if (code_size() != 5) return false; | |
546 if (size_of_parameters() != 1) return false; | |
547 if (java_code_at(0) != Bytecodes::_aload_0 ) return false; | |
548 if (java_code_at(1) != Bytecodes::_getfield) return false; | |
549 if (java_code_at(4) != Bytecodes::_areturn && | |
550 java_code_at(4) != Bytecodes::_ireturn ) return false; | |
551 return true; | |
552 } | |
553 | |
554 | |
555 bool Method::is_initializer() const { | |
556 return name() == vmSymbols::object_initializer_name() || is_static_initializer(); | |
557 } | |
558 | |
559 bool Method::has_valid_initializer_flags() const { | |
560 return (is_static() || | |
561 method_holder()->major_version() < 51); | |
562 } | |
563 | |
564 bool Method::is_static_initializer() const { | |
565 // For classfiles version 51 or greater, ensure that the clinit method is | |
566 // static. Non-static methods with the name "<clinit>" are not static | |
567 // initializers. (older classfiles exempted for backward compatibility) | |
568 return name() == vmSymbols::class_initializer_name() && | |
569 has_valid_initializer_flags(); | |
570 } | |
571 | |
572 | |
573 objArrayHandle Method::resolved_checked_exceptions_impl(Method* this_oop, TRAPS) { | |
574 int length = this_oop->checked_exceptions_length(); | |
575 if (length == 0) { // common case | |
576 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array()); | |
577 } else { | |
578 methodHandle h_this(THREAD, this_oop); | |
579 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle())); | |
580 objArrayHandle mirrors (THREAD, m_oop); | |
581 for (int i = 0; i < length; i++) { | |
582 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe | |
583 Klass* k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle())); | |
584 assert(Klass::cast(k)->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class"); | |
585 mirrors->obj_at_put(i, Klass::cast(k)->java_mirror()); | |
586 } | |
587 return mirrors; | |
588 } | |
589 }; | |
590 | |
591 | |
592 int Method::line_number_from_bci(int bci) const { | |
593 if (bci == SynchronizationEntryBCI) bci = 0; | |
594 assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci"); | |
595 int best_bci = 0; | |
596 int best_line = -1; | |
597 | |
598 if (has_linenumber_table()) { | |
599 // The line numbers are a short array of 2-tuples [start_pc, line_number]. | |
600 // Not necessarily sorted and not necessarily one-to-one. | |
601 CompressedLineNumberReadStream stream(compressed_linenumber_table()); | |
602 while (stream.read_pair()) { | |
603 if (stream.bci() == bci) { | |
604 // perfect match | |
605 return stream.line(); | |
606 } else { | |
607 // update best_bci/line | |
608 if (stream.bci() < bci && stream.bci() >= best_bci) { | |
609 best_bci = stream.bci(); | |
610 best_line = stream.line(); | |
611 } | |
612 } | |
613 } | |
614 } | |
615 return best_line; | |
616 } | |
617 | |
618 | |
619 bool Method::is_klass_loaded_by_klass_index(int klass_index) const { | |
620 if( constants()->tag_at(klass_index).is_unresolved_klass() ) { | |
621 Thread *thread = Thread::current(); | |
622 Symbol* klass_name = constants()->klass_name_at(klass_index); | |
623 Handle loader(thread, method_holder()->class_loader()); | |
624 Handle prot (thread, Klass::cast(method_holder())->protection_domain()); | |
625 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL; | |
626 } else { | |
627 return true; | |
628 } | |
629 } | |
630 | |
631 | |
632 bool Method::is_klass_loaded(int refinfo_index, bool must_be_resolved) const { | |
633 int klass_index = constants()->klass_ref_index_at(refinfo_index); | |
634 if (must_be_resolved) { | |
635 // Make sure klass is resolved in constantpool. | |
636 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false; | |
637 } | |
638 return is_klass_loaded_by_klass_index(klass_index); | |
639 } | |
640 | |
641 | |
642 void Method::set_native_function(address function, bool post_event_flag) { | |
643 assert(function != NULL, "use clear_native_function to unregister natives"); | |
644 assert(!is_method_handle_intrinsic() || function == SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), ""); | |
645 address* native_function = native_function_addr(); | |
646 | |
647 // We can see racers trying to place the same native function into place. Once | |
648 // is plenty. | |
649 address current = *native_function; | |
650 if (current == function) return; | |
651 if (post_event_flag && JvmtiExport::should_post_native_method_bind() && | |
652 function != NULL) { | |
653 // native_method_throw_unsatisfied_link_error_entry() should only | |
654 // be passed when post_event_flag is false. | |
655 assert(function != | |
656 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), | |
657 "post_event_flag mis-match"); | |
658 | |
659 // post the bind event, and possible change the bind function | |
660 JvmtiExport::post_native_method_bind(this, &function); | |
661 } | |
662 *native_function = function; | |
663 // This function can be called more than once. We must make sure that we always | |
664 // use the latest registered method -> check if a stub already has been generated. | |
665 // If so, we have to make it not_entrant. | |
666 nmethod* nm = code(); // Put it into local variable to guard against concurrent updates | |
667 if (nm != NULL) { | |
668 nm->make_not_entrant(); | |
669 } | |
670 } | |
671 | |
672 | |
673 bool Method::has_native_function() const { | |
674 if (is_method_handle_intrinsic()) | |
675 return false; // special-cased in SharedRuntime::generate_native_wrapper | |
676 address func = native_function(); | |
677 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry()); | |
678 } | |
679 | |
680 | |
681 void Method::clear_native_function() { | |
682 // Note: is_method_handle_intrinsic() is allowed here. | |
683 set_native_function( | |
684 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), | |
685 !native_bind_event_is_interesting); | |
686 clear_code(); | |
687 } | |
688 | |
689 address Method::critical_native_function() { | |
690 methodHandle mh(this); | |
691 return NativeLookup::lookup_critical_entry(mh); | |
692 } | |
693 | |
694 | |
695 void Method::set_signature_handler(address handler) { | |
696 address* signature_handler = signature_handler_addr(); | |
697 *signature_handler = handler; | |
698 } | |
699 | |
700 | |
701 void Method::print_made_not_compilable(int comp_level, bool is_osr, bool report) { | |
702 if (PrintCompilation && report) { | |
703 ttyLocker ttyl; | |
704 tty->print("made not %scompilable on ", is_osr ? "OSR " : ""); | |
705 if (comp_level == CompLevel_all) { | |
706 tty->print("all levels "); | |
707 } else { | |
708 tty->print("levels "); | |
709 for (int i = (int)CompLevel_none; i <= comp_level; i++) { | |
710 tty->print("%d ", i); | |
711 } | |
712 } | |
713 this->print_short_name(tty); | |
714 int size = this->code_size(); | |
715 if (size > 0) | |
716 tty->print(" (%d bytes)", size); | |
717 tty->cr(); | |
718 } | |
719 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) { | |
720 ttyLocker ttyl; | |
721 xtty->begin_elem("make_not_%scompilable thread='" UINTX_FORMAT "'", | |
722 is_osr ? "osr_" : "", os::current_thread_id()); | |
723 xtty->method(this); | |
724 xtty->stamp(); | |
725 xtty->end_elem(); | |
726 } | |
727 } | |
728 | |
729 bool Method::is_not_compilable(int comp_level) const { | |
730 if (number_of_breakpoints() > 0) | |
731 return true; | |
732 if (is_method_handle_intrinsic()) | |
733 return !is_synthetic(); // the generated adapters must be compiled | |
734 if (comp_level == CompLevel_any) | |
735 return is_not_c1_compilable() || is_not_c2_compilable(); | |
736 if (is_c1_compile(comp_level)) | |
737 return is_not_c1_compilable(); | |
738 if (is_c2_compile(comp_level)) | |
739 return is_not_c2_compilable(); | |
740 return false; | |
741 } | |
742 | |
743 // call this when compiler finds that this method is not compilable | |
744 void Method::set_not_compilable(int comp_level, bool report) { | |
745 print_made_not_compilable(comp_level, /*is_osr*/ false, report); | |
746 if (comp_level == CompLevel_all) { | |
747 set_not_c1_compilable(); | |
748 set_not_c2_compilable(); | |
749 } else { | |
750 if (is_c1_compile(comp_level)) | |
751 set_not_c1_compilable(); | |
752 if (is_c2_compile(comp_level)) | |
753 set_not_c2_compilable(); | |
754 } | |
755 CompilationPolicy::policy()->disable_compilation(this); | |
756 } | |
757 | |
758 bool Method::is_not_osr_compilable(int comp_level) const { | |
759 if (is_not_compilable(comp_level)) | |
760 return true; | |
761 if (comp_level == CompLevel_any) | |
762 return is_not_c1_osr_compilable() || is_not_c2_osr_compilable(); | |
763 if (is_c1_compile(comp_level)) | |
764 return is_not_c1_osr_compilable(); | |
765 if (is_c2_compile(comp_level)) | |
766 return is_not_c2_osr_compilable(); | |
767 return false; | |
768 } | |
769 | |
770 void Method::set_not_osr_compilable(int comp_level, bool report) { | |
771 print_made_not_compilable(comp_level, /*is_osr*/ true, report); | |
772 if (comp_level == CompLevel_all) { | |
773 set_not_c1_osr_compilable(); | |
774 set_not_c2_osr_compilable(); | |
775 } else { | |
776 if (is_c1_compile(comp_level)) | |
777 set_not_c1_osr_compilable(); | |
778 if (is_c2_compile(comp_level)) | |
779 set_not_c2_osr_compilable(); | |
780 } | |
781 CompilationPolicy::policy()->disable_compilation(this); | |
782 | |
783 #ifdef GRAAL | |
784 oop graal_mirror = this->graal_mirror(); | |
785 if (graal_mirror != NULL) { | |
786 HotSpotResolvedJavaMethod::set_canBeInlined(graal_mirror, false); | |
787 } | |
788 #endif | |
789 } | |
790 | |
791 // Revert to using the interpreter and clear out the nmethod | |
792 void Method::clear_code() { | |
793 | |
794 // this may be NULL if c2i adapters have not been made yet | |
795 // Only should happen at allocate time. | |
796 if (_adapter == NULL) { | |
797 _from_compiled_entry = NULL; | |
798 } else { | |
799 _from_compiled_entry = _adapter->get_c2i_entry(); | |
800 } | |
801 OrderAccess::storestore(); | |
802 _from_interpreted_entry = _i2i_entry; | |
803 OrderAccess::storestore(); | |
804 _code = NULL; | |
805 } | |
806 | |
807 // Called by class data sharing to remove any entry points (which are not shared) | |
808 void Method::unlink_method() { | |
809 _code = NULL; | |
810 _i2i_entry = NULL; | |
811 _from_interpreted_entry = NULL; | |
812 if (is_native()) { | |
813 *native_function_addr() = NULL; | |
814 set_signature_handler(NULL); | |
815 } | |
816 NOT_PRODUCT(set_compiled_invocation_count(0);) | |
817 invocation_counter()->reset(); | |
818 backedge_counter()->reset(); | |
819 _adapter = NULL; | |
820 _from_compiled_entry = NULL; | |
821 assert(_method_data == NULL, "unexpected method data?"); | |
822 set_method_data(NULL); | |
823 set_interpreter_throwout_count(0); | |
824 set_interpreter_invocation_count(0); | |
825 } | |
826 | |
827 // Called when the method_holder is getting linked. Setup entrypoints so the method | |
828 // is ready to be called from interpreter, compiler, and vtables. | |
829 void Method::link_method(methodHandle h_method, TRAPS) { | |
830 // If the code cache is full, we may reenter this function for the | |
831 // leftover methods that weren't linked. | |
832 if (_i2i_entry != NULL) return; | |
833 | |
834 assert(_adapter == NULL, "init'd to NULL" ); | |
835 assert( _code == NULL, "nothing compiled yet" ); | |
836 | |
837 // Setup interpreter entrypoint | |
838 assert(this == h_method(), "wrong h_method()" ); | |
839 address entry = Interpreter::entry_for_method(h_method); | |
840 assert(entry != NULL, "interpreter entry must be non-null"); | |
841 // Sets both _i2i_entry and _from_interpreted_entry | |
842 set_interpreter_entry(entry); | |
843 if (is_native() && !is_method_handle_intrinsic()) { | |
844 set_native_function( | |
845 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), | |
846 !native_bind_event_is_interesting); | |
847 } | |
848 | |
849 // Setup compiler entrypoint. This is made eagerly, so we do not need | |
850 // special handling of vtables. An alternative is to make adapters more | |
851 // lazily by calling make_adapter() from from_compiled_entry() for the | |
852 // normal calls. For vtable calls life gets more complicated. When a | |
853 // call-site goes mega-morphic we need adapters in all methods which can be | |
854 // called from the vtable. We need adapters on such methods that get loaded | |
855 // later. Ditto for mega-morphic itable calls. If this proves to be a | |
856 // problem we'll make these lazily later. | |
857 (void) make_adapters(h_method, CHECK); | |
858 | |
859 // ONLY USE the h_method now as make_adapter may have blocked | |
860 | |
861 } | |
862 | |
863 address Method::make_adapters(methodHandle mh, TRAPS) { | |
864 // Adapters for compiled code are made eagerly here. They are fairly | |
865 // small (generally < 100 bytes) and quick to make (and cached and shared) | |
866 // so making them eagerly shouldn't be too expensive. | |
867 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh); | |
868 if (adapter == NULL ) { | |
869 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters"); | |
870 } | |
871 | |
872 mh->set_adapter_entry(adapter); | |
873 mh->_from_compiled_entry = adapter->get_c2i_entry(); | |
874 return adapter->get_c2i_entry(); | |
875 } | |
876 | |
877 // The verified_code_entry() must be called when a invoke is resolved | |
878 // on this method. | |
879 | |
880 // It returns the compiled code entry point, after asserting not null. | |
881 // This function is called after potential safepoints so that nmethod | |
882 // or adapter that it points to is still live and valid. | |
883 // This function must not hit a safepoint! | |
884 address Method::verified_code_entry() { | |
885 debug_only(No_Safepoint_Verifier nsv;) | |
886 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code); | |
887 if (code == NULL && UseCodeCacheFlushing) { | |
888 nmethod *saved_code = CodeCache::find_and_remove_saved_code(this); | |
889 if (saved_code != NULL) { | |
890 methodHandle method(this); | |
891 assert( ! saved_code->is_osr_method(), "should not get here for osr" ); | |
892 set_code( method, saved_code ); | |
893 } | |
894 } | |
895 | |
896 assert(_from_compiled_entry != NULL, "must be set"); | |
897 return _from_compiled_entry; | |
898 } | |
899 | |
900 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all | |
901 // (could be racing a deopt). | |
902 // Not inline to avoid circular ref. | |
903 bool Method::check_code() const { | |
904 // cached in a register or local. There's a race on the value of the field. | |
905 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code); | |
906 return code == NULL || (code->method() == NULL) || (code->method() == (Method*)this && !code->is_osr_method()); | |
907 } | |
908 | |
909 // Install compiled code. Instantly it can execute. | |
910 void Method::set_code(methodHandle mh, nmethod *code) { | |
911 assert( code, "use clear_code to remove code" ); | |
912 assert( mh->check_code(), "" ); | |
913 | |
914 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!"); | |
915 | |
916 // These writes must happen in this order, because the interpreter will | |
917 // directly jump to from_interpreted_entry which jumps to an i2c adapter | |
918 // which jumps to _from_compiled_entry. | |
919 mh->_code = code; // Assign before allowing compiled code to exec | |
920 | |
921 int comp_level = code->comp_level(); | |
922 // In theory there could be a race here. In practice it is unlikely | |
923 // and not worth worrying about. | |
924 if (comp_level > mh->highest_comp_level()) { | |
925 mh->set_highest_comp_level(comp_level); | |
926 } | |
927 | |
928 OrderAccess::storestore(); | |
929 #ifdef SHARK | |
930 mh->_from_interpreted_entry = code->insts_begin(); | |
931 #else //!SHARK | |
932 mh->_from_compiled_entry = code->verified_entry_point(); | |
933 OrderAccess::storestore(); | |
934 // Instantly compiled code can execute. | |
935 if (!mh->is_method_handle_intrinsic()) | |
936 mh->_from_interpreted_entry = mh->get_i2c_entry(); | |
937 #endif //!SHARK | |
938 } | |
939 | |
940 | |
941 bool Method::is_overridden_in(Klass* k) const { | |
942 InstanceKlass* ik = InstanceKlass::cast(k); | |
943 | |
944 if (ik->is_interface()) return false; | |
945 | |
946 // If method is an interface, we skip it - except if it | |
947 // is a miranda method | |
948 if (method_holder()->is_interface()) { | |
949 // Check that method is not a miranda method | |
950 if (ik->lookup_method(name(), signature()) == NULL) { | |
951 // No implementation exist - so miranda method | |
952 return false; | |
953 } | |
954 return true; | |
955 } | |
956 | |
957 assert(ik->is_subclass_of(method_holder()), "should be subklass"); | |
958 assert(ik->vtable() != NULL, "vtable should exist"); | |
959 if (vtable_index() == nonvirtual_vtable_index) { | |
960 return false; | |
961 } else { | |
962 Method* vt_m = ik->method_at_vtable(vtable_index()); | |
963 return vt_m != this; | |
964 } | |
965 } | |
966 | |
967 | |
968 // give advice about whether this Method* should be cached or not | |
969 bool Method::should_not_be_cached() const { | |
970 if (is_old()) { | |
971 // This method has been redefined. It is either EMCP or obsolete | |
972 // and we don't want to cache it because that would pin the method | |
973 // down and prevent it from being collectible if and when it | |
974 // finishes executing. | |
975 return true; | |
976 } | |
977 | |
978 // caching this method should be just fine | |
979 return false; | |
980 } | |
981 | |
982 // Constant pool structure for invoke methods: | |
983 enum { | |
984 _imcp_invoke_name = 1, // utf8: 'invokeExact', etc. | |
985 _imcp_invoke_signature, // utf8: (variable Symbol*) | |
986 _imcp_limit | |
987 }; | |
988 | |
989 // Test if this method is an MH adapter frame generated by Java code. | |
990 // Cf. java/lang/invoke/InvokerBytecodeGenerator | |
991 bool Method::is_compiled_lambda_form() const { | |
992 return intrinsic_id() == vmIntrinsics::_compiledLambdaForm; | |
993 } | |
994 | |
995 // Test if this method is an internal MH primitive method. | |
996 bool Method::is_method_handle_intrinsic() const { | |
997 vmIntrinsics::ID iid = intrinsic_id(); | |
998 return (MethodHandles::is_signature_polymorphic(iid) && | |
999 MethodHandles::is_signature_polymorphic_intrinsic(iid)); | |
1000 } | |
1001 | |
1002 bool Method::has_member_arg() const { | |
1003 vmIntrinsics::ID iid = intrinsic_id(); | |
1004 return (MethodHandles::is_signature_polymorphic(iid) && | |
1005 MethodHandles::has_member_arg(iid)); | |
1006 } | |
1007 | |
1008 // Make an instance of a signature-polymorphic internal MH primitive. | |
1009 methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid, | |
1010 Symbol* signature, | |
1011 TRAPS) { | |
1012 ResourceMark rm; | |
1013 methodHandle empty; | |
1014 | |
1015 KlassHandle holder = SystemDictionary::MethodHandle_klass(); | |
1016 Symbol* name = MethodHandles::signature_polymorphic_intrinsic_name(iid); | |
1017 assert(iid == MethodHandles::signature_polymorphic_name_id(name), ""); | |
1018 if (TraceMethodHandles) { | |
1019 tty->print_cr("make_method_handle_intrinsic MH.%s%s", name->as_C_string(), signature->as_C_string()); | |
1020 } | |
1021 | |
1022 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup) | |
1023 name->increment_refcount(); | |
1024 signature->increment_refcount(); | |
1025 | |
1026 int cp_length = _imcp_limit; | |
1027 ClassLoaderData* loader_data = holder->class_loader_data(); | |
1028 constantPoolHandle cp; | |
1029 { | |
1030 ConstantPool* cp_oop = ConstantPool::allocate(loader_data, cp_length, CHECK_(empty)); | |
1031 cp = constantPoolHandle(THREAD, cp_oop); | |
1032 } | |
1033 cp->set_pool_holder(InstanceKlass::cast(holder())); | |
1034 cp->symbol_at_put(_imcp_invoke_name, name); | |
1035 cp->symbol_at_put(_imcp_invoke_signature, signature); | |
1036 cp->set_preresolution(); | |
1037 | |
1038 // decide on access bits: public or not? | |
1039 int flags_bits = (JVM_ACC_NATIVE | JVM_ACC_SYNTHETIC | JVM_ACC_FINAL); | |
1040 bool must_be_static = MethodHandles::is_signature_polymorphic_static(iid); | |
1041 if (must_be_static) flags_bits |= JVM_ACC_STATIC; | |
1042 assert((flags_bits & JVM_ACC_PUBLIC) == 0, "do not expose these methods"); | |
1043 | |
1044 methodHandle m; | |
1045 { | |
1046 Method* m_oop = Method::allocate(loader_data, 0, accessFlags_from(flags_bits), | |
1047 0, 0, 0, 0, ConstMethod::NORMAL, CHECK_(empty)); | |
1048 m = methodHandle(THREAD, m_oop); | |
1049 } | |
1050 m->set_constants(cp()); | |
1051 m->set_name_index(_imcp_invoke_name); | |
1052 m->set_signature_index(_imcp_invoke_signature); | |
1053 assert(MethodHandles::is_signature_polymorphic_name(m->name()), ""); | |
1054 assert(m->signature() == signature, ""); | |
1055 #ifdef CC_INTERP | |
1056 ResultTypeFinder rtf(signature); | |
1057 m->set_result_index(rtf.type()); | |
1058 #endif | |
1059 m->compute_size_of_parameters(THREAD); | |
1060 m->init_intrinsic_id(); | |
1061 assert(m->is_method_handle_intrinsic(), ""); | |
1062 #ifdef ASSERT | |
1063 if (!MethodHandles::is_signature_polymorphic(m->intrinsic_id())) m->print(); | |
1064 assert(MethodHandles::is_signature_polymorphic(m->intrinsic_id()), "must be an invoker"); | |
1065 assert(m->intrinsic_id() == iid, "correctly predicted iid"); | |
1066 #endif //ASSERT | |
1067 | |
1068 // Finally, set up its entry points. | |
1069 assert(m->can_be_statically_bound(), ""); | |
1070 m->set_vtable_index(Method::nonvirtual_vtable_index); | |
1071 m->link_method(m, CHECK_(empty)); | |
1072 | |
1073 if (TraceMethodHandles && (Verbose || WizardMode)) | |
1074 m->print_on(tty); | |
1075 | |
1076 return m; | |
1077 } | |
1078 | |
1079 Klass* Method::check_non_bcp_klass(Klass* klass) { | |
1080 if (klass != NULL && Klass::cast(klass)->class_loader() != NULL) { | |
1081 if (Klass::cast(klass)->oop_is_objArray()) | |
1082 klass = ObjArrayKlass::cast(klass)->bottom_klass(); | |
1083 return klass; | |
1084 } | |
1085 return NULL; | |
1086 } | |
1087 | |
1088 | |
1089 methodHandle Method::clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length, | |
1090 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) { | |
1091 // Code below does not work for native methods - they should never get rewritten anyway | |
1092 assert(!m->is_native(), "cannot rewrite native methods"); | |
1093 // Allocate new Method* | |
1094 AccessFlags flags = m->access_flags(); | |
1095 int checked_exceptions_len = m->checked_exceptions_length(); | |
1096 int localvariable_len = m->localvariable_table_length(); | |
1097 int exception_table_len = m->exception_table_length(); | |
1098 | |
1099 ClassLoaderData* loader_data = m->method_holder()->class_loader_data(); | |
1100 Method* newm_oop = Method::allocate(loader_data, | |
1101 new_code_length, | |
1102 flags, | |
1103 new_compressed_linenumber_size, | |
1104 localvariable_len, | |
1105 exception_table_len, | |
1106 checked_exceptions_len, | |
1107 m->method_type(), | |
1108 CHECK_(methodHandle())); | |
1109 methodHandle newm (THREAD, newm_oop); | |
1110 int new_method_size = newm->method_size(); | |
1111 | |
1112 // Create a shallow copy of Method part, but be careful to preserve the new ConstMethod* | |
1113 ConstMethod* newcm = newm->constMethod(); | |
1114 int new_const_method_size = newm->constMethod()->size(); | |
1115 | |
1116 memcpy(newm(), m(), sizeof(Method)); | |
1117 | |
1118 // Create shallow copy of ConstMethod. | |
1119 memcpy(newcm, m->constMethod(), sizeof(ConstMethod)); | |
1120 | |
1121 // Reset correct method/const method, method size, and parameter info | |
1122 newm->set_constMethod(newcm); | |
1123 newm->constMethod()->set_code_size(new_code_length); | |
1124 newm->constMethod()->set_constMethod_size(new_const_method_size); | |
1125 newm->set_method_size(new_method_size); | |
1126 assert(newm->code_size() == new_code_length, "check"); | |
1127 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check"); | |
1128 assert(newm->exception_table_length() == exception_table_len, "check"); | |
1129 assert(newm->localvariable_table_length() == localvariable_len, "check"); | |
1130 // Copy new byte codes | |
1131 memcpy(newm->code_base(), new_code, new_code_length); | |
1132 // Copy line number table | |
1133 if (new_compressed_linenumber_size > 0) { | |
1134 memcpy(newm->compressed_linenumber_table(), | |
1135 new_compressed_linenumber_table, | |
1136 new_compressed_linenumber_size); | |
1137 } | |
1138 // Copy checked_exceptions | |
1139 if (checked_exceptions_len > 0) { | |
1140 memcpy(newm->checked_exceptions_start(), | |
1141 m->checked_exceptions_start(), | |
1142 checked_exceptions_len * sizeof(CheckedExceptionElement)); | |
1143 } | |
1144 // Copy exception table | |
1145 if (exception_table_len > 0) { | |
1146 memcpy(newm->exception_table_start(), | |
1147 m->exception_table_start(), | |
1148 exception_table_len * sizeof(ExceptionTableElement)); | |
1149 } | |
1150 // Copy local variable number table | |
1151 if (localvariable_len > 0) { | |
1152 memcpy(newm->localvariable_table_start(), | |
1153 m->localvariable_table_start(), | |
1154 localvariable_len * sizeof(LocalVariableTableElement)); | |
1155 } | |
1156 // Copy stackmap table | |
1157 if (m->has_stackmap_table()) { | |
1158 int code_attribute_length = m->stackmap_data()->length(); | |
1159 Array<u1>* stackmap_data = | |
1160 MetadataFactory::new_array<u1>(loader_data, code_attribute_length, 0, CHECK_NULL); | |
1161 memcpy((void*)stackmap_data->adr_at(0), | |
1162 (void*)m->stackmap_data()->adr_at(0), code_attribute_length); | |
1163 newm->set_stackmap_data(stackmap_data); | |
1164 } | |
1165 | |
1166 return newm; | |
1167 } | |
1168 | |
1169 vmSymbols::SID Method::klass_id_for_intrinsics(Klass* holder) { | |
1170 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics | |
1171 // because we are not loading from core libraries | |
1172 // exception: the AES intrinsics come from lib/ext/sunjce_provider.jar | |
1173 // which does not use the class default class loader so we check for its loader here | |
1174 if ((InstanceKlass::cast(holder)->class_loader() != NULL) && | |
1175 InstanceKlass::cast(holder)->class_loader()->klass()->name() != vmSymbols::sun_misc_Launcher_ExtClassLoader()) { | |
1176 return vmSymbols::NO_SID; // regardless of name, no intrinsics here | |
1177 } | |
1178 | |
1179 // see if the klass name is well-known: | |
1180 Symbol* klass_name = InstanceKlass::cast(holder)->name(); | |
1181 return vmSymbols::find_sid(klass_name); | |
1182 } | |
1183 | |
1184 void Method::init_intrinsic_id() { | |
1185 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once"); | |
1186 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte)); | |
1187 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size"); | |
1188 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), ""); | |
1189 | |
1190 // the klass name is well-known: | |
1191 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder()); | |
1192 assert(klass_id != vmSymbols::NO_SID, "caller responsibility"); | |
1193 | |
1194 // ditto for method and signature: | |
1195 vmSymbols::SID name_id = vmSymbols::find_sid(name()); | |
1196 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle) | |
1197 && name_id == vmSymbols::NO_SID) | |
1198 return; | |
1199 vmSymbols::SID sig_id = vmSymbols::find_sid(signature()); | |
1200 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle) | |
1201 && sig_id == vmSymbols::NO_SID) return; | |
1202 jshort flags = access_flags().as_short(); | |
1203 | |
1204 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); | |
1205 if (id != vmIntrinsics::_none) { | |
1206 set_intrinsic_id(id); | |
1207 return; | |
1208 } | |
1209 | |
1210 // A few slightly irregular cases: | |
1211 switch (klass_id) { | |
1212 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath): | |
1213 // Second chance: check in regular Math. | |
1214 switch (name_id) { | |
1215 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name): | |
1216 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name): | |
1217 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name): | |
1218 // pretend it is the corresponding method in the non-strict class: | |
1219 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math); | |
1220 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); | |
1221 break; | |
1222 } | |
1223 break; | |
1224 | |
1225 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*. | |
1226 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle): | |
1227 if (!is_native()) break; | |
1228 id = MethodHandles::signature_polymorphic_name_id(method_holder(), name()); | |
1229 if (is_static() != MethodHandles::is_signature_polymorphic_static(id)) | |
1230 id = vmIntrinsics::_none; | |
1231 break; | |
1232 } | |
1233 | |
1234 if (id != vmIntrinsics::_none) { | |
1235 // Set up its iid. It is an alias method. | |
1236 set_intrinsic_id(id); | |
1237 return; | |
1238 } | |
1239 } | |
1240 | |
1241 // These two methods are static since a GC may move the Method | |
1242 bool Method::load_signature_classes(methodHandle m, TRAPS) { | |
1243 if (THREAD->is_Compiler_thread()) { | |
1244 // There is nothing useful this routine can do from within the Compile thread. | |
1245 // Hopefully, the signature contains only well-known classes. | |
1246 // We could scan for this and return true/false, but the caller won't care. | |
1247 return false; | |
1248 } | |
1249 bool sig_is_loaded = true; | |
1250 Handle class_loader(THREAD, m->method_holder()->class_loader()); | |
1251 Handle protection_domain(THREAD, m->method_holder()->protection_domain()); | |
1252 ResourceMark rm(THREAD); | |
1253 Symbol* signature = m->signature(); | |
1254 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { | |
1255 if (ss.is_object()) { | |
1256 Symbol* sym = ss.as_symbol(CHECK_(false)); | |
1257 Symbol* name = sym; | |
1258 Klass* klass = SystemDictionary::resolve_or_null(name, class_loader, | |
1259 protection_domain, THREAD); | |
1260 // We are loading classes eagerly. If a ClassNotFoundException or | |
1261 // a LinkageError was generated, be sure to ignore it. | |
1262 if (HAS_PENDING_EXCEPTION) { | |
1263 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) || | |
1264 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) { | |
1265 CLEAR_PENDING_EXCEPTION; | |
1266 } else { | |
1267 return false; | |
1268 } | |
1269 } | |
1270 if( klass == NULL) { sig_is_loaded = false; } | |
1271 } | |
1272 } | |
1273 return sig_is_loaded; | |
1274 } | |
1275 | |
1276 bool Method::has_unloaded_classes_in_signature(methodHandle m, TRAPS) { | |
1277 Handle class_loader(THREAD, m->method_holder()->class_loader()); | |
1278 Handle protection_domain(THREAD, m->method_holder()->protection_domain()); | |
1279 ResourceMark rm(THREAD); | |
1280 Symbol* signature = m->signature(); | |
1281 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { | |
1282 if (ss.type() == T_OBJECT) { | |
1283 Symbol* name = ss.as_symbol_or_null(); | |
1284 if (name == NULL) return true; | |
1285 Klass* klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD); | |
1286 if (klass == NULL) return true; | |
1287 } | |
1288 } | |
1289 return false; | |
1290 } | |
1291 | |
1292 // Exposed so field engineers can debug VM | |
1293 void Method::print_short_name(outputStream* st) { | |
1294 ResourceMark rm; | |
1295 #ifdef PRODUCT | |
1296 st->print(" %s::", method_holder()->external_name()); | |
1297 #else | |
1298 st->print(" %s::", method_holder()->internal_name()); | |
1299 #endif | |
1300 name()->print_symbol_on(st); | |
1301 if (WizardMode) signature()->print_symbol_on(st); | |
1302 else if (MethodHandles::is_signature_polymorphic(intrinsic_id())) | |
1303 MethodHandles::print_as_basic_type_signature_on(st, signature(), true); | |
1304 } | |
1305 | |
1306 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array | |
1307 static void reorder_based_on_method_index(Array<Method*>* methods, | |
1308 Array<AnnotationArray*>* annotations, | |
1309 GrowableArray<AnnotationArray*>* temp_array) { | |
1310 if (annotations == NULL) { | |
1311 return; | |
1312 } | |
1313 | |
1314 int length = methods->length(); | |
1315 int i; | |
1316 // Copy to temp array | |
1317 temp_array->clear(); | |
1318 for (i = 0; i < length; i++) { | |
1319 temp_array->append(annotations->at(i)); | |
1320 } | |
1321 | |
1322 // Copy back using old method indices | |
1323 for (i = 0; i < length; i++) { | |
1324 Method* m = methods->at(i); | |
1325 annotations->at_put(i, temp_array->at(m->method_idnum())); | |
1326 } | |
1327 } | |
1328 | |
1329 // Comparer for sorting an object array containing | |
1330 // Method*s. | |
1331 static int method_comparator(Method* a, Method* b) { | |
1332 return a->name()->fast_compare(b->name()); | |
1333 } | |
1334 | |
1335 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array | |
1336 void Method::sort_methods(Array<Method*>* methods, | |
1337 Array<AnnotationArray*>* methods_annotations, | |
1338 Array<AnnotationArray*>* methods_parameter_annotations, | |
1339 Array<AnnotationArray*>* methods_default_annotations, | |
1340 bool idempotent) { | |
1341 int length = methods->length(); | |
1342 if (length > 1) { | |
1343 bool do_annotations = false; | |
1344 if (methods_annotations != NULL || | |
1345 methods_parameter_annotations != NULL || | |
1346 methods_default_annotations != NULL) { | |
1347 do_annotations = true; | |
1348 } | |
1349 if (do_annotations) { | |
1350 // Remember current method ordering so we can reorder annotations | |
1351 for (int i = 0; i < length; i++) { | |
1352 Method* m = methods->at(i); | |
1353 m->set_method_idnum(i); | |
1354 } | |
1355 } | |
1356 { | |
1357 No_Safepoint_Verifier nsv; | |
1358 QuickSort::sort<Method*>(methods->data(), length, method_comparator, idempotent); | |
1359 } | |
1360 | |
1361 // Sort annotations if necessary | |
1362 assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), ""); | |
1363 assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), ""); | |
1364 assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), ""); | |
1365 if (do_annotations) { | |
1366 ResourceMark rm; | |
1367 // Allocate temporary storage | |
1368 GrowableArray<AnnotationArray*>* temp_array = new GrowableArray<AnnotationArray*>(length); | |
1369 reorder_based_on_method_index(methods, methods_annotations, temp_array); | |
1370 reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array); | |
1371 reorder_based_on_method_index(methods, methods_default_annotations, temp_array); | |
1372 } | |
1373 | |
1374 // Reset method ordering | |
1375 for (int i = 0; i < length; i++) { | |
1376 Method* m = methods->at(i); | |
1377 m->set_method_idnum(i); | |
1378 } | |
1379 } | |
1380 } | |
1381 | |
1382 | |
1383 //----------------------------------------------------------------------------------- | |
1384 // Non-product code | |
1385 | |
1386 #ifndef PRODUCT | |
1387 class SignatureTypePrinter : public SignatureTypeNames { | |
1388 private: | |
1389 outputStream* _st; | |
1390 bool _use_separator; | |
1391 | |
1392 void type_name(const char* name) { | |
1393 if (_use_separator) _st->print(", "); | |
1394 _st->print(name); | |
1395 _use_separator = true; | |
1396 } | |
1397 | |
1398 public: | |
1399 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) { | |
1400 _st = st; | |
1401 _use_separator = false; | |
1402 } | |
1403 | |
1404 void print_parameters() { _use_separator = false; iterate_parameters(); } | |
1405 void print_returntype() { _use_separator = false; iterate_returntype(); } | |
1406 }; | |
1407 | |
1408 | |
1409 void Method::print_name(outputStream* st) { | |
1410 Thread *thread = Thread::current(); | |
1411 ResourceMark rm(thread); | |
1412 SignatureTypePrinter sig(signature(), st); | |
1413 st->print("%s ", is_static() ? "static" : "virtual"); | |
1414 sig.print_returntype(); | |
1415 st->print(" %s.", method_holder()->internal_name()); | |
1416 name()->print_symbol_on(st); | |
1417 st->print("("); | |
1418 sig.print_parameters(); | |
1419 st->print(")"); | |
1420 } | |
1421 | |
1422 | |
1423 void Method::print_codes_on(outputStream* st) const { | |
1424 print_codes_on(0, code_size(), st); | |
1425 } | |
1426 | |
1427 void Method::print_codes_on(int from, int to, outputStream* st) const { | |
1428 Thread *thread = Thread::current(); | |
1429 ResourceMark rm(thread); | |
1430 methodHandle mh (thread, (Method*)this); | |
1431 BytecodeStream s(mh); | |
1432 s.set_interval(from, to); | |
1433 BytecodeTracer::set_closure(BytecodeTracer::std_closure()); | |
1434 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st); | |
1435 } | |
1436 #endif // not PRODUCT | |
1437 | |
1438 | |
1439 // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas | |
1440 // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned) | |
1441 // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used | |
1442 // as end-of-stream terminator. | |
1443 | |
1444 void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) { | |
1445 // bci and line number does not compress into single byte. | |
1446 // Write out escape character and use regular compression for bci and line number. | |
1447 write_byte((jubyte)0xFF); | |
1448 write_signed_int(bci_delta); | |
1449 write_signed_int(line_delta); | |
1450 } | |
1451 | |
1452 // See comment in method.hpp which explains why this exists. | |
1453 #if defined(_M_AMD64) && _MSC_VER >= 1400 | |
1454 #pragma optimize("", off) | |
1455 void CompressedLineNumberWriteStream::write_pair(int bci, int line) { | |
1456 write_pair_inline(bci, line); | |
1457 } | |
1458 #pragma optimize("", on) | |
1459 #endif | |
1460 | |
1461 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) { | |
1462 _bci = 0; | |
1463 _line = 0; | |
1464 }; | |
1465 | |
1466 | |
1467 bool CompressedLineNumberReadStream::read_pair() { | |
1468 jubyte next = read_byte(); | |
1469 // Check for terminator | |
1470 if (next == 0) return false; | |
1471 if (next == 0xFF) { | |
1472 // Escape character, regular compression used | |
1473 _bci += read_signed_int(); | |
1474 _line += read_signed_int(); | |
1475 } else { | |
1476 // Single byte compression used | |
1477 _bci += next >> 3; | |
1478 _line += next & 0x7; | |
1479 } | |
1480 return true; | |
1481 } | |
1482 | |
1483 | |
1484 Bytecodes::Code Method::orig_bytecode_at(int bci) const { | |
1485 BreakpointInfo* bp = method_holder()->breakpoints(); | |
1486 for (; bp != NULL; bp = bp->next()) { | |
1487 if (bp->match(this, bci)) { | |
1488 return bp->orig_bytecode(); | |
1489 } | |
1490 } | |
1491 ShouldNotReachHere(); | |
1492 return Bytecodes::_shouldnotreachhere; | |
1493 } | |
1494 | |
1495 void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) { | |
1496 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way"); | |
1497 BreakpointInfo* bp = method_holder()->breakpoints(); | |
1498 for (; bp != NULL; bp = bp->next()) { | |
1499 if (bp->match(this, bci)) { | |
1500 bp->set_orig_bytecode(code); | |
1501 // and continue, in case there is more than one | |
1502 } | |
1503 } | |
1504 } | |
1505 | |
1506 void Method::set_breakpoint(int bci) { | |
1507 InstanceKlass* ik = method_holder(); | |
1508 BreakpointInfo *bp = new BreakpointInfo(this, bci); | |
1509 bp->set_next(ik->breakpoints()); | |
1510 ik->set_breakpoints(bp); | |
1511 // do this last: | |
1512 bp->set(this); | |
1513 } | |
1514 | |
1515 static void clear_matches(Method* m, int bci) { | |
1516 InstanceKlass* ik = m->method_holder(); | |
1517 BreakpointInfo* prev_bp = NULL; | |
1518 BreakpointInfo* next_bp; | |
1519 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) { | |
1520 next_bp = bp->next(); | |
1521 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint). | |
1522 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) { | |
1523 // do this first: | |
1524 bp->clear(m); | |
1525 // unhook it | |
1526 if (prev_bp != NULL) | |
1527 prev_bp->set_next(next_bp); | |
1528 else | |
1529 ik->set_breakpoints(next_bp); | |
1530 delete bp; | |
1531 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods | |
1532 // at same location. So we have multiple matching (method_index and bci) | |
1533 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one | |
1534 // breakpoint for clear_breakpoint request and keep all other method versions | |
1535 // BreakpointInfo for future clear_breakpoint request. | |
1536 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints) | |
1537 // which is being called when class is unloaded. We delete all the Breakpoint | |
1538 // information for all versions of method. We may not correctly restore the original | |
1539 // bytecode in all method versions, but that is ok. Because the class is being unloaded | |
1540 // so these methods won't be used anymore. | |
1541 if (bci >= 0) { | |
1542 break; | |
1543 } | |
1544 } else { | |
1545 // This one is a keeper. | |
1546 prev_bp = bp; | |
1547 } | |
1548 } | |
1549 } | |
1550 | |
1551 void Method::clear_breakpoint(int bci) { | |
1552 assert(bci >= 0, ""); | |
1553 clear_matches(this, bci); | |
1554 } | |
1555 | |
1556 void Method::clear_all_breakpoints() { | |
1557 clear_matches(this, -1); | |
1558 } | |
1559 | |
1560 | |
1561 int Method::invocation_count() { | |
1562 if (TieredCompilation) { | |
1563 MethodData* const mdo = method_data(); | |
1564 if (invocation_counter()->carry() || ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) { | |
1565 return InvocationCounter::count_limit; | |
1566 } else { | |
1567 return invocation_counter()->count() + ((mdo != NULL) ? mdo->invocation_counter()->count() : 0); | |
1568 } | |
1569 } else { | |
1570 return invocation_counter()->count(); | |
1571 } | |
1572 } | |
1573 | |
1574 int Method::backedge_count() { | |
1575 if (TieredCompilation) { | |
1576 MethodData* const mdo = method_data(); | |
1577 if (backedge_counter()->carry() || ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) { | |
1578 return InvocationCounter::count_limit; | |
1579 } else { | |
1580 return backedge_counter()->count() + ((mdo != NULL) ? mdo->backedge_counter()->count() : 0); | |
1581 } | |
1582 } else { | |
1583 return backedge_counter()->count(); | |
1584 } | |
1585 } | |
1586 | |
1587 int Method::highest_comp_level() const { | |
1588 MethodData* mdo = method_data(); | |
1589 if (mdo != NULL) { | |
1590 return mdo->highest_comp_level(); | |
1591 } else { | |
1592 return CompLevel_none; | |
1593 } | |
1594 } | |
1595 | |
1596 int Method::highest_osr_comp_level() const { | |
1597 MethodData* mdo = method_data(); | |
1598 if (mdo != NULL) { | |
1599 return mdo->highest_osr_comp_level(); | |
1600 } else { | |
1601 return CompLevel_none; | |
1602 } | |
1603 } | |
1604 | |
1605 void Method::set_highest_comp_level(int level) { | |
1606 MethodData* mdo = method_data(); | |
1607 if (mdo != NULL) { | |
1608 mdo->set_highest_comp_level(level); | |
1609 } | |
1610 } | |
1611 | |
1612 void Method::set_highest_osr_comp_level(int level) { | |
1613 MethodData* mdo = method_data(); | |
1614 if (mdo != NULL) { | |
1615 mdo->set_highest_osr_comp_level(level); | |
1616 } | |
1617 } | |
1618 | |
1619 BreakpointInfo::BreakpointInfo(Method* m, int bci) { | |
1620 _bci = bci; | |
1621 _name_index = m->name_index(); | |
1622 _signature_index = m->signature_index(); | |
1623 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci); | |
1624 if (_orig_bytecode == Bytecodes::_breakpoint) | |
1625 _orig_bytecode = m->orig_bytecode_at(_bci); | |
1626 _next = NULL; | |
1627 } | |
1628 | |
1629 void BreakpointInfo::set(Method* method) { | |
1630 #ifdef ASSERT | |
1631 { | |
1632 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci); | |
1633 if (code == Bytecodes::_breakpoint) | |
1634 code = method->orig_bytecode_at(_bci); | |
1635 assert(orig_bytecode() == code, "original bytecode must be the same"); | |
1636 } | |
1637 #endif | |
1638 *method->bcp_from(_bci) = Bytecodes::_breakpoint; | |
1639 method->incr_number_of_breakpoints(); | |
1640 SystemDictionary::notice_modification(); | |
1641 { | |
1642 // Deoptimize all dependents on this method | |
1643 Thread *thread = Thread::current(); | |
1644 HandleMark hm(thread); | |
1645 methodHandle mh(thread, method); | |
1646 Universe::flush_dependents_on_method(mh); | |
1647 } | |
1648 } | |
1649 | |
1650 void BreakpointInfo::clear(Method* method) { | |
1651 *method->bcp_from(_bci) = orig_bytecode(); | |
1652 assert(method->number_of_breakpoints() > 0, "must not go negative"); | |
1653 method->decr_number_of_breakpoints(); | |
1654 } | |
1655 | |
1656 // jmethodID handling | |
1657 | |
1658 // This is a block allocating object, sort of like JNIHandleBlock, only a | |
1659 // lot simpler. There aren't many of these, they aren't long, they are rarely | |
1660 // deleted and so we can do some suboptimal things. | |
1661 // It's allocated on the CHeap because once we allocate a jmethodID, we can | |
1662 // never get rid of it. | |
1663 // It would be nice to be able to parameterize the number of methods for | |
1664 // the null_class_loader but then we'd have to turn this and ClassLoaderData | |
1665 // into templates. | |
1666 | |
1667 // I feel like this brain dead class should exist somewhere in the STL | |
1668 | |
1669 class JNIMethodBlock : public CHeapObj<mtClass> { | |
1670 enum { number_of_methods = 8 }; | |
1671 | |
1672 Method* _methods[number_of_methods]; | |
1673 int _top; | |
1674 JNIMethodBlock* _next; | |
1675 public: | |
1676 static Method* const _free_method; | |
1677 | |
1678 JNIMethodBlock() : _next(NULL), _top(0) { | |
1679 for (int i = 0; i< number_of_methods; i++) _methods[i] = _free_method; | |
1680 } | |
1681 | |
1682 Method** add_method(Method* m) { | |
1683 if (_top < number_of_methods) { | |
1684 // top points to the next free entry. | |
1685 int i = _top; | |
1686 _methods[i] = m; | |
1687 _top++; | |
1688 return &_methods[i]; | |
1689 } else if (_top == number_of_methods) { | |
1690 // if the next free entry ran off the block see if there's a free entry | |
1691 for (int i = 0; i< number_of_methods; i++) { | |
1692 if (_methods[i] == _free_method) { | |
1693 _methods[i] = m; | |
1694 return &_methods[i]; | |
1695 } | |
1696 } | |
1697 // Only check each block once for frees. They're very unlikely. | |
1698 // Increment top past the end of the block. | |
1699 _top++; | |
1700 } | |
1701 // need to allocate a next block. | |
1702 if (_next == NULL) { | |
1703 _next = new JNIMethodBlock(); | |
1704 } | |
1705 return _next->add_method(m); | |
1706 } | |
1707 | |
1708 bool contains(Method** m) { | |
1709 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) { | |
1710 for (int i = 0; i< number_of_methods; i++) { | |
1711 if (&(b->_methods[i]) == m) { | |
1712 return true; | |
1713 } | |
1714 } | |
1715 } | |
1716 return false; // not found | |
1717 } | |
1718 | |
1719 // Doesn't really destroy it, just marks it as free so it can be reused. | |
1720 void destroy_method(Method** m) { | |
1721 #ifdef ASSERT | |
1722 assert(contains(m), "should be a methodID"); | |
1723 #endif // ASSERT | |
1724 *m = _free_method; | |
1725 } | |
1726 | |
1727 // During class unloading the methods are cleared, which is different | |
1728 // than freed. | |
1729 void clear_all_methods() { | |
1730 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) { | |
1731 for (int i = 0; i< number_of_methods; i++) { | |
1732 _methods[i] = NULL; | |
1733 } | |
1734 } | |
1735 } | |
1736 #ifndef PRODUCT | |
1737 int count_methods() { | |
1738 // count all allocated methods | |
1739 int count = 0; | |
1740 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) { | |
1741 for (int i = 0; i< number_of_methods; i++) { | |
1742 if (_methods[i] != _free_method) count++; | |
1743 } | |
1744 } | |
1745 return count; | |
1746 } | |
1747 #endif // PRODUCT | |
1748 }; | |
1749 | |
1750 // Something that can't be mistaken for an address or a markOop | |
1751 Method* const JNIMethodBlock::_free_method = (Method*)55; | |
1752 | |
1753 // Add a method id to the jmethod_ids | |
1754 jmethodID Method::make_jmethod_id(ClassLoaderData* loader_data, Method* m) { | |
1755 ClassLoaderData* cld = loader_data; | |
1756 | |
1757 if (!SafepointSynchronize::is_at_safepoint()) { | |
1758 // Have to add jmethod_ids() to class loader data thread-safely. | |
1759 // Also have to add the method to the list safely, which the cld lock | |
1760 // protects as well. | |
1761 MutexLockerEx ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag); | |
1762 if (cld->jmethod_ids() == NULL) { | |
1763 cld->set_jmethod_ids(new JNIMethodBlock()); | |
1764 } | |
1765 // jmethodID is a pointer to Method* | |
1766 return (jmethodID)cld->jmethod_ids()->add_method(m); | |
1767 } else { | |
1768 // At safepoint, we are single threaded and can set this. | |
1769 if (cld->jmethod_ids() == NULL) { | |
1770 cld->set_jmethod_ids(new JNIMethodBlock()); | |
1771 } | |
1772 // jmethodID is a pointer to Method* | |
1773 return (jmethodID)cld->jmethod_ids()->add_method(m); | |
1774 } | |
1775 } | |
1776 | |
1777 // Mark a jmethodID as free. This is called when there is a data race in | |
1778 // InstanceKlass while creating the jmethodID cache. | |
1779 void Method::destroy_jmethod_id(ClassLoaderData* loader_data, jmethodID m) { | |
1780 ClassLoaderData* cld = loader_data; | |
1781 Method** ptr = (Method**)m; | |
1782 assert(cld->jmethod_ids() != NULL, "should have method handles"); | |
1783 cld->jmethod_ids()->destroy_method(ptr); | |
1784 } | |
1785 | |
1786 void Method::change_method_associated_with_jmethod_id(jmethodID jmid, Method* new_method) { | |
1787 // Can't assert the method_holder is the same because the new method has the | |
1788 // scratch method holder. | |
1789 assert(resolve_jmethod_id(jmid)->method_holder()->class_loader() | |
1790 == new_method->method_holder()->class_loader(), | |
1791 "changing to a different class loader"); | |
1792 // Just change the method in place, jmethodID pointer doesn't change. | |
1793 *((Method**)jmid) = new_method; | |
1794 } | |
1795 | |
1796 bool Method::is_method_id(jmethodID mid) { | |
1797 Method* m = resolve_jmethod_id(mid); | |
1798 assert(m != NULL, "should be called with non-null method"); | |
1799 InstanceKlass* ik = m->method_holder(); | |
1800 ClassLoaderData* cld = ik->class_loader_data(); | |
1801 if (cld->jmethod_ids() == NULL) return false; | |
1802 return (cld->jmethod_ids()->contains((Method**)mid)); | |
1803 } | |
1804 | |
1805 Method* Method::checked_resolve_jmethod_id(jmethodID mid) { | |
1806 if (mid == NULL) return NULL; | |
1807 Method* o = resolve_jmethod_id(mid); | |
1808 if (o == NULL || o == JNIMethodBlock::_free_method || !((Metadata*)o)->is_method()) { | |
1809 return NULL; | |
1810 } | |
1811 return o; | |
1812 }; | |
1813 | |
1814 void Method::set_on_stack(const bool value) { | |
1815 // Set both the method itself and its constant pool. The constant pool | |
1816 // on stack means some method referring to it is also on the stack. | |
1817 _access_flags.set_on_stack(value); | |
1818 constants()->set_on_stack(value); | |
1819 if (value) MetadataOnStackMark::record(this); | |
1820 } | |
1821 | |
1822 // Called when the class loader is unloaded to make all methods weak. | |
1823 void Method::clear_jmethod_ids(ClassLoaderData* loader_data) { | |
1824 loader_data->jmethod_ids()->clear_all_methods(); | |
1825 } | |
1826 | |
1827 #ifndef PRODUCT | |
1828 void Method::print_jmethod_ids(ClassLoaderData* loader_data, outputStream* out) { | |
1829 out->print_cr("jni_method_id count = %d", loader_data->jmethod_ids()->count_methods()); | |
1830 } | |
1831 #endif // PRODUCT | |
1832 | |
1833 | |
1834 // Printing | |
1835 | |
1836 #ifndef PRODUCT | |
1837 | |
1838 void Method::print_on(outputStream* st) const { | |
1839 ResourceMark rm; | |
1840 assert(is_method(), "must be method"); | |
1841 st->print_cr(internal_name()); | |
1842 // get the effect of PrintOopAddress, always, for methods: | |
1843 st->print_cr(" - this oop: "INTPTR_FORMAT, (intptr_t)this); | |
1844 st->print (" - method holder: "); method_holder()->print_value_on(st); st->cr(); | |
1845 st->print (" - constants: "INTPTR_FORMAT" ", (address)constants()); | |
1846 constants()->print_value_on(st); st->cr(); | |
1847 st->print (" - access: 0x%x ", access_flags().as_int()); access_flags().print_on(st); st->cr(); | |
1848 st->print (" - name: "); name()->print_value_on(st); st->cr(); | |
1849 st->print (" - signature: "); signature()->print_value_on(st); st->cr(); | |
1850 st->print_cr(" - max stack: %d", max_stack()); | |
1851 st->print_cr(" - max locals: %d", max_locals()); | |
1852 st->print_cr(" - size of params: %d", size_of_parameters()); | |
1853 st->print_cr(" - method size: %d", method_size()); | |
1854 if (intrinsic_id() != vmIntrinsics::_none) | |
1855 st->print_cr(" - intrinsic id: %d %s", intrinsic_id(), vmIntrinsics::name_at(intrinsic_id())); | |
1856 if (highest_comp_level() != CompLevel_none) | |
1857 st->print_cr(" - highest level: %d", highest_comp_level()); | |
1858 st->print_cr(" - vtable index: %d", _vtable_index); | |
1859 st->print_cr(" - i2i entry: " INTPTR_FORMAT, interpreter_entry()); | |
1860 st->print( " - adapters: "); | |
1861 AdapterHandlerEntry* a = ((Method*)this)->adapter(); | |
1862 if (a == NULL) | |
1863 st->print_cr(INTPTR_FORMAT, a); | |
1864 else | |
1865 a->print_adapter_on(st); | |
1866 st->print_cr(" - compiled entry " INTPTR_FORMAT, from_compiled_entry()); | |
1867 st->print_cr(" - code size: %d", code_size()); | |
1868 if (code_size() != 0) { | |
1869 st->print_cr(" - code start: " INTPTR_FORMAT, code_base()); | |
1870 st->print_cr(" - code end (excl): " INTPTR_FORMAT, code_base() + code_size()); | |
1871 } | |
1872 if (method_data() != NULL) { | |
1873 st->print_cr(" - method data: " INTPTR_FORMAT, (address)method_data()); | |
1874 } | |
1875 st->print_cr(" - checked ex length: %d", checked_exceptions_length()); | |
1876 if (checked_exceptions_length() > 0) { | |
1877 CheckedExceptionElement* table = checked_exceptions_start(); | |
1878 st->print_cr(" - checked ex start: " INTPTR_FORMAT, table); | |
1879 if (Verbose) { | |
1880 for (int i = 0; i < checked_exceptions_length(); i++) { | |
1881 st->print_cr(" - throws %s", constants()->printable_name_at(table[i].class_cp_index)); | |
1882 } | |
1883 } | |
1884 } | |
1885 if (has_linenumber_table()) { | |
1886 u_char* table = compressed_linenumber_table(); | |
1887 st->print_cr(" - linenumber start: " INTPTR_FORMAT, table); | |
1888 if (Verbose) { | |
1889 CompressedLineNumberReadStream stream(table); | |
1890 while (stream.read_pair()) { | |
1891 st->print_cr(" - line %d: %d", stream.line(), stream.bci()); | |
1892 } | |
1893 } | |
1894 } | |
1895 st->print_cr(" - localvar length: %d", localvariable_table_length()); | |
1896 if (localvariable_table_length() > 0) { | |
1897 LocalVariableTableElement* table = localvariable_table_start(); | |
1898 st->print_cr(" - localvar start: " INTPTR_FORMAT, table); | |
1899 if (Verbose) { | |
1900 for (int i = 0; i < localvariable_table_length(); i++) { | |
1901 int bci = table[i].start_bci; | |
1902 int len = table[i].length; | |
1903 const char* name = constants()->printable_name_at(table[i].name_cp_index); | |
1904 const char* desc = constants()->printable_name_at(table[i].descriptor_cp_index); | |
1905 int slot = table[i].slot; | |
1906 st->print_cr(" - %s %s bci=%d len=%d slot=%d", desc, name, bci, len, slot); | |
1907 } | |
1908 } | |
1909 } | |
1910 if (code() != NULL) { | |
1911 st->print (" - compiled code: "); | |
1912 code()->print_value_on(st); | |
1913 } | |
1914 if (is_native()) { | |
1915 st->print_cr(" - native function: " INTPTR_FORMAT, native_function()); | |
1916 st->print_cr(" - signature handler: " INTPTR_FORMAT, signature_handler()); | |
1917 } | |
1918 } | |
1919 | |
1920 #endif //PRODUCT | |
1921 | |
1922 void Method::print_value_on(outputStream* st) const { | |
1923 assert(is_method(), "must be method"); | |
1924 st->print_cr(internal_name()); | |
1925 print_address_on(st); | |
1926 st->print(" "); | |
1927 name()->print_value_on(st); | |
1928 st->print(" "); | |
1929 signature()->print_value_on(st); | |
1930 st->print(" in "); | |
1931 method_holder()->print_value_on(st); | |
1932 if (WizardMode) st->print("[%d,%d]", size_of_parameters(), max_locals()); | |
1933 if (WizardMode && code() != NULL) st->print(" ((nmethod*)%p)", code()); | |
1934 } | |
1935 | |
1936 | |
1937 // Verification | |
1938 | |
1939 void Method::verify_on(outputStream* st) { | |
1940 guarantee(is_method(), "object must be method"); | |
1941 guarantee(is_metadata(), "should be metadata"); | |
1942 guarantee(constants()->is_constantPool(), "should be constant pool"); | |
1943 guarantee(constants()->is_metadata(), "should be metadata"); | |
1944 guarantee(constMethod()->is_constMethod(), "should be ConstMethod*"); | |
1945 guarantee(constMethod()->is_metadata(), "should be metadata"); | |
1946 MethodData* md = method_data(); | |
1947 guarantee(md == NULL || | |
1948 md->is_metadata(), "should be in permspace"); | |
1949 guarantee(md == NULL || | |
1950 md->is_methodData(), "should be method data"); | |
1951 } |