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