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