1 /*
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "code/debugInfoRec.hpp"
28 #include "gc_interface/collectedHeap.inline.hpp"
29 #include "interpreter/bytecodeStream.hpp"
30 #include "interpreter/bytecodeTracer.hpp"
31 #include "interpreter/bytecodes.hpp"
32 #include "interpreter/interpreter.hpp"
33 #include "interpreter/oopMapCache.hpp"
34 #include "memory/gcLocker.hpp"
35 #include "memory/generation.hpp"
36 #include "memory/oopFactory.hpp"
37 #include "oops/klassOop.hpp"
38 #include "oops/methodDataOop.hpp"
39 #include "oops/methodOop.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "oops/symbol.hpp"
42 #include "prims/jvmtiExport.hpp"
43 #include "prims/methodHandleWalk.hpp"
44 #include "prims/nativeLookup.hpp"
45 #include "runtime/arguments.hpp"
46 #include "runtime/compilationPolicy.hpp"
47 #include "runtime/frame.inline.hpp"
48 #include "runtime/handles.inline.hpp"
49 #include "runtime/relocator.hpp"
50 #include "runtime/sharedRuntime.hpp"
51 #include "runtime/signature.hpp"
52 #include "utilities/quickSort.hpp"
53 #include "utilities/xmlstream.hpp"
54
55
56 // Implementation of methodOopDesc
57
58 address methodOopDesc::get_i2c_entry() {
59 assert(_adapter != NULL, "must have");
60 return _adapter->get_i2c_entry();
61 }
62
63 address methodOopDesc::get_c2i_entry() {
64 assert(_adapter != NULL, "must have");
65 return _adapter->get_c2i_entry();
66 }
67
68 address methodOopDesc::get_c2i_unverified_entry() {
69 assert(_adapter != NULL, "must have");
70 return _adapter->get_c2i_unverified_entry();
71 }
72
73 char* methodOopDesc::name_and_sig_as_C_string() {
74 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature());
75 }
76
77 char* methodOopDesc::name_and_sig_as_C_string(char* buf, int size) {
78 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature(), buf, size);
79 }
80
81 char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) {
82 const char* klass_name = klass->external_name();
83 int klass_name_len = (int)strlen(klass_name);
84 int method_name_len = method_name->utf8_length();
85 int len = klass_name_len + 1 + method_name_len + signature->utf8_length();
86 char* dest = NEW_RESOURCE_ARRAY(char, len + 1);
87 strcpy(dest, klass_name);
88 dest[klass_name_len] = '.';
89 strcpy(&dest[klass_name_len + 1], method_name->as_C_string());
90 strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string());
91 dest[len] = 0;
92 return dest;
93 }
94
95 char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) {
96 Symbol* klass_name = klass->name();
97 klass_name->as_klass_external_name(buf, size);
98 int len = (int)strlen(buf);
99
100 if (len < size - 1) {
101 buf[len++] = '.';
102
103 method_name->as_C_string(&(buf[len]), size - len);
104 len = (int)strlen(buf);
105
106 signature->as_C_string(&(buf[len]), size - len);
107 }
108
109 return buf;
110 }
111
112 int methodOopDesc::fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS) {
113 // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index)
114 // access exception table
115 ExceptionTable table(this);
116 int length = table.length();
117 // iterate through all entries sequentially
118 constantPoolHandle pool(THREAD, constants());
119 for (int i = 0; i < length; i ++) {
120 //reacquire the table in case a GC happened
121 ExceptionTable table(this);
122 int beg_bci = table.start_pc(i);
123 int end_bci = table.end_pc(i);
124 assert(beg_bci <= end_bci, "inconsistent exception table");
125 if (beg_bci <= throw_bci && throw_bci < end_bci) {
126 // exception handler bci range covers throw_bci => investigate further
127 int handler_bci = table.handler_pc(i);
128 int klass_index = table.catch_type_index(i);
129 if (klass_index == 0) {
130 return handler_bci;
131 } else if (ex_klass.is_null()) {
132 return handler_bci;
133 } else {
134 // we know the exception class => get the constraint class
135 // this may require loading of the constraint class; if verification
136 // fails or some other exception occurs, return handler_bci
137 klassOop k = pool->klass_at(klass_index, CHECK_(handler_bci));
138 KlassHandle klass = KlassHandle(THREAD, k);
139 assert(klass.not_null(), "klass not loaded");
140 if (ex_klass->is_subtype_of(klass())) {
141 return handler_bci;
142 }
143 }
144 }
145 }
146
147 return -1;
148 }
149
150 void methodOopDesc::mask_for(int bci, InterpreterOopMap* mask) {
151
152 Thread* myThread = Thread::current();
153 methodHandle h_this(myThread, this);
154 #ifdef ASSERT
155 bool has_capability = myThread->is_VM_thread() ||
156 myThread->is_ConcurrentGC_thread() ||
157 myThread->is_GC_task_thread();
158
159 if (!has_capability) {
160 if (!VerifyStack && !VerifyLastFrame) {
161 // verify stack calls this outside VM thread
162 warning("oopmap should only be accessed by the "
163 "VM, GC task or CMS threads (or during debugging)");
164 InterpreterOopMap local_mask;
165 instanceKlass::cast(method_holder())->mask_for(h_this, bci, &local_mask);
166 local_mask.print();
167 }
168 }
169 #endif
170 instanceKlass::cast(method_holder())->mask_for(h_this, bci, mask);
171 return;
172 }
173
174
175 int methodOopDesc::bci_from(address bcp) const {
176 assert(is_native() && bcp == code_base() || contains(bcp) || is_error_reported(), "bcp doesn't belong to this method");
177 return bcp - code_base();
178 }
179
180
181 // Return (int)bcx if it appears to be a valid BCI.
182 // Return bci_from((address)bcx) if it appears to be a valid BCP.
183 // Return -1 otherwise.
184 // Used by profiling code, when invalid data is a possibility.
185 // The caller is responsible for validating the methodOop itself.
186 int methodOopDesc::validate_bci_from_bcx(intptr_t bcx) const {
187 // keep bci as -1 if not a valid bci
188 int bci = -1;
189 if (bcx == 0 || (address)bcx == code_base()) {
190 // code_size() may return 0 and we allow 0 here
191 // the method may be native
192 bci = 0;
193 } else if (frame::is_bci(bcx)) {
194 if (bcx < code_size()) {
195 bci = (int)bcx;
196 }
197 } else if (contains((address)bcx)) {
198 bci = (address)bcx - code_base();
199 }
200 // Assert that if we have dodged any asserts, bci is negative.
201 assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0");
202 return bci;
203 }
204
205 address methodOopDesc::bcp_from(int bci) const {
206 assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), "illegal bci");
207 address bcp = code_base() + bci;
208 assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method");
209 return bcp;
210 }
211
212
213 int methodOopDesc::object_size(bool is_native) {
214 // If native, then include pointers for native_function and signature_handler
215 int extra_bytes = (is_native) ? 2*sizeof(address*) : 0;
216 int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord;
217 return align_object_size(header_size() + extra_words);
218 }
219
220
221 Symbol* methodOopDesc::klass_name() const {
222 klassOop k = method_holder();
223 assert(k->is_klass(), "must be klass");
224 instanceKlass* ik = (instanceKlass*) k->klass_part();
225 return ik->name();
226 }
227
228
229 void methodOopDesc::set_interpreter_kind() {
230 int kind = Interpreter::method_kind(methodOop(this));
231 assert(kind != Interpreter::invalid,
232 "interpreter entry must be valid");
233 set_interpreter_kind(kind);
234 }
235
236
237 // Attempt to return method oop to original state. Clear any pointers
238 // (to objects outside the shared spaces). We won't be able to predict
239 // where they should point in a new JVM. Further initialize some
240 // entries now in order allow them to be write protected later.
241
242 void methodOopDesc::remove_unshareable_info() {
243 unlink_method();
244 set_interpreter_kind();
245 }
246
247
248 bool methodOopDesc::was_executed_more_than(int n) {
249 // Invocation counter is reset when the methodOop is compiled.
250 // If the method has compiled code we therefore assume it has
251 // be excuted more than n times.
252 if (is_accessor() || is_empty_method() || (code() != NULL)) {
253 // interpreter doesn't bump invocation counter of trivial methods
254 // compiler does not bump invocation counter of compiled methods
255 return true;
256 }
257 else if (_invocation_counter.carry() || (method_data() != NULL && method_data()->invocation_counter()->carry())) {
258 // The carry bit is set when the counter overflows and causes
259 // a compilation to occur. We don't know how many times
260 // the counter has been reset, so we simply assume it has
261 // been executed more than n times.
262 return true;
263 } else {
264 return invocation_count() > n;
265 }
266 }
267
268 #ifndef PRODUCT
269 void methodOopDesc::print_invocation_count() {
270 if (is_static()) tty->print("static ");
271 if (is_final()) tty->print("final ");
272 if (is_synchronized()) tty->print("synchronized ");
273 if (is_native()) tty->print("native ");
274 method_holder()->klass_part()->name()->print_symbol_on(tty);
275 tty->print(".");
276 name()->print_symbol_on(tty);
277 signature()->print_symbol_on(tty);
278
279 if (WizardMode) {
280 // dump the size of the byte codes
281 tty->print(" {%d}", code_size());
282 }
283 tty->cr();
284
285 tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count());
286 tty->print_cr (" invocation_counter: %8d ", invocation_count());
287 tty->print_cr (" backedge_counter: %8d ", backedge_count());
288 if (CountCompiledCalls) {
289 tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count());
290 }
291
292 }
293 #endif
294
295 // Build a methodDataOop object to hold information about this method
296 // collected in the interpreter.
297 void methodOopDesc::build_interpreter_method_data(methodHandle method, TRAPS) {
298 // Do not profile method if current thread holds the pending list lock,
299 // which avoids deadlock for acquiring the MethodData_lock.
300 if (instanceRefKlass::owns_pending_list_lock((JavaThread*)THREAD)) {
301 return;
302 }
303
304 // Grab a lock here to prevent multiple
305 // methodDataOops from being created.
306 MutexLocker ml(MethodData_lock, THREAD);
307 if (method->method_data() == NULL) {
308 methodDataOop method_data = oopFactory::new_methodData(method, CHECK);
309 method->set_method_data(method_data);
310 if (PrintMethodData && (Verbose || WizardMode)) {
311 ResourceMark rm(THREAD);
312 tty->print("build_interpreter_method_data for ");
313 method->print_name(tty);
314 tty->cr();
315 // At the end of the run, the MDO, full of data, will be dumped.
316 }
317 }
318 }
319
320 void methodOopDesc::cleanup_inline_caches() {
321 // The current system doesn't use inline caches in the interpreter
322 // => nothing to do (keep this method around for future use)
323 }
324
325
326 int methodOopDesc::extra_stack_words() {
327 // not an inline function, to avoid a header dependency on Interpreter
328 return extra_stack_entries() * Interpreter::stackElementSize;
329 }
330
331
332 void methodOopDesc::compute_size_of_parameters(Thread *thread) {
333 ArgumentSizeComputer asc(signature());
334 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1));
335 }
336
337 #ifdef CC_INTERP
338 void methodOopDesc::set_result_index(BasicType type) {
339 _result_index = Interpreter::BasicType_as_index(type);
340 }
341 #endif
342
343 BasicType methodOopDesc::result_type() const {
344 ResultTypeFinder rtf(signature());
345 return rtf.type();
346 }
347
348
349 bool methodOopDesc::is_empty_method() const {
350 return code_size() == 1
351 && *code_base() == Bytecodes::_return;
352 }
353
354
355 bool methodOopDesc::is_vanilla_constructor() const {
356 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method
357 // which only calls the superclass vanilla constructor and possibly does stores of
358 // zero constants to local fields:
359 //
360 // aload_0
361 // invokespecial
362 // indexbyte1
363 // indexbyte2
364 //
365 // followed by an (optional) sequence of:
366 //
367 // aload_0
368 // aconst_null / iconst_0 / fconst_0 / dconst_0
369 // putfield
370 // indexbyte1
371 // indexbyte2
372 //
373 // followed by:
374 //
375 // return
376
377 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors");
378 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors");
379 int size = code_size();
380 // Check if size match
381 if (size == 0 || size % 5 != 0) return false;
382 address cb = code_base();
383 int last = size - 1;
384 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) {
385 // Does not call superclass default constructor
386 return false;
387 }
388 // Check optional sequence
389 for (int i = 4; i < last; i += 5) {
390 if (cb[i] != Bytecodes::_aload_0) return false;
391 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false;
392 if (cb[i+2] != Bytecodes::_putfield) return false;
393 }
394 return true;
395 }
396
397
398 bool methodOopDesc::compute_has_loops_flag() {
399 BytecodeStream bcs(methodOop(this));
400 Bytecodes::Code bc;
401
402 while ((bc = bcs.next()) >= 0) {
403 switch( bc ) {
404 case Bytecodes::_ifeq:
405 case Bytecodes::_ifnull:
406 case Bytecodes::_iflt:
407 case Bytecodes::_ifle:
408 case Bytecodes::_ifne:
409 case Bytecodes::_ifnonnull:
410 case Bytecodes::_ifgt:
411 case Bytecodes::_ifge:
412 case Bytecodes::_if_icmpeq:
413 case Bytecodes::_if_icmpne:
414 case Bytecodes::_if_icmplt:
415 case Bytecodes::_if_icmpgt:
416 case Bytecodes::_if_icmple:
417 case Bytecodes::_if_icmpge:
418 case Bytecodes::_if_acmpeq:
419 case Bytecodes::_if_acmpne:
420 case Bytecodes::_goto:
421 case Bytecodes::_jsr:
422 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops();
423 break;
424
425 case Bytecodes::_goto_w:
426 case Bytecodes::_jsr_w:
427 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops();
428 break;
429 }
430 }
431 _access_flags.set_loops_flag_init();
432 return _access_flags.has_loops();
433 }
434
435
436 bool methodOopDesc::is_final_method() const {
437 // %%% Should return true for private methods also,
438 // since there is no way to override them.
439 return is_final() || Klass::cast(method_holder())->is_final();
440 }
441
442
443 bool methodOopDesc::is_strict_method() const {
444 return is_strict();
445 }
446
447
448 bool methodOopDesc::can_be_statically_bound() const {
449 if (is_final_method()) return true;
450 return vtable_index() == nonvirtual_vtable_index;
451 }
452
453
454 bool methodOopDesc::is_accessor() const {
455 if (code_size() != 5) return false;
456 if (size_of_parameters() != 1) return false;
457 if (java_code_at(0) != Bytecodes::_aload_0 ) return false;
458 if (java_code_at(1) != Bytecodes::_getfield) return false;
459 if (java_code_at(4) != Bytecodes::_areturn &&
460 java_code_at(4) != Bytecodes::_ireturn ) return false;
461 return true;
462 }
463
464
465 bool methodOopDesc::is_initializer() const {
466 return name() == vmSymbols::object_initializer_name() || is_static_initializer();
467 }
468
469 bool methodOopDesc::has_valid_initializer_flags() const {
470 return (is_static() ||
471 instanceKlass::cast(method_holder())->major_version() < 51);
472 }
473
474 bool methodOopDesc::is_static_initializer() const {
475 // For classfiles version 51 or greater, ensure that the clinit method is
476 // static. Non-static methods with the name "<clinit>" are not static
477 // initializers. (older classfiles exempted for backward compatibility)
478 return name() == vmSymbols::class_initializer_name() &&
479 has_valid_initializer_flags();
480 }
481
482
483 objArrayHandle methodOopDesc::resolved_checked_exceptions_impl(methodOop this_oop, TRAPS) {
484 int length = this_oop->checked_exceptions_length();
485 if (length == 0) { // common case
486 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array());
487 } else {
488 methodHandle h_this(THREAD, this_oop);
489 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle()));
490 objArrayHandle mirrors (THREAD, m_oop);
491 for (int i = 0; i < length; i++) {
492 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe
493 klassOop k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle()));
494 assert(Klass::cast(k)->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class");
495 mirrors->obj_at_put(i, Klass::cast(k)->java_mirror());
496 }
497 return mirrors;
498 }
499 };
500
501
502 int methodOopDesc::line_number_from_bci(int bci) const {
503 if (bci == SynchronizationEntryBCI) bci = 0;
504 assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci");
505 int best_bci = 0;
506 int best_line = -1;
507
508 if (has_linenumber_table()) {
509 // The line numbers are a short array of 2-tuples [start_pc, line_number].
510 // Not necessarily sorted and not necessarily one-to-one.
511 CompressedLineNumberReadStream stream(compressed_linenumber_table());
512 while (stream.read_pair()) {
513 if (stream.bci() == bci) {
514 // perfect match
515 return stream.line();
516 } else {
517 // update best_bci/line
518 if (stream.bci() < bci && stream.bci() >= best_bci) {
519 best_bci = stream.bci();
520 best_line = stream.line();
521 }
522 }
523 }
524 }
525 return best_line;
526 }
527
528
529 bool methodOopDesc::is_klass_loaded_by_klass_index(int klass_index) const {
530 if( _constants->tag_at(klass_index).is_unresolved_klass() ) {
531 Thread *thread = Thread::current();
532 Symbol* klass_name = _constants->klass_name_at(klass_index);
533 Handle loader(thread, instanceKlass::cast(method_holder())->class_loader());
534 Handle prot (thread, Klass::cast(method_holder())->protection_domain());
535 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
536 } else {
537 return true;
538 }
539 }
540
541
542 bool methodOopDesc::is_klass_loaded(int refinfo_index, bool must_be_resolved) const {
543 int klass_index = _constants->klass_ref_index_at(refinfo_index);
544 if (must_be_resolved) {
545 // Make sure klass is resolved in constantpool.
546 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false;
547 }
548 return is_klass_loaded_by_klass_index(klass_index);
549 }
550
551
552 void methodOopDesc::set_native_function(address function, bool post_event_flag) {
553 assert(function != NULL, "use clear_native_function to unregister natives");
554 address* native_function = native_function_addr();
555
556 // We can see racers trying to place the same native function into place. Once
557 // is plenty.
558 address current = *native_function;
559 if (current == function) return;
560 if (post_event_flag && JvmtiExport::should_post_native_method_bind() &&
561 function != NULL) {
562 // native_method_throw_unsatisfied_link_error_entry() should only
563 // be passed when post_event_flag is false.
564 assert(function !=
565 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
566 "post_event_flag mis-match");
567
568 // post the bind event, and possible change the bind function
569 JvmtiExport::post_native_method_bind(this, &function);
570 }
571 *native_function = function;
572 // This function can be called more than once. We must make sure that we always
573 // use the latest registered method -> check if a stub already has been generated.
574 // If so, we have to make it not_entrant.
575 nmethod* nm = code(); // Put it into local variable to guard against concurrent updates
576 if (nm != NULL) {
577 nm->make_not_entrant();
578 }
579 }
580
581
582 bool methodOopDesc::has_native_function() const {
583 address func = native_function();
584 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
585 }
586
587
588 void methodOopDesc::clear_native_function() {
589 set_native_function(
590 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
591 !native_bind_event_is_interesting);
592 clear_code();
593 }
594
595 address methodOopDesc::critical_native_function() {
596 methodHandle mh(this);
597 return NativeLookup::lookup_critical_entry(mh);
598 }
599
600
601 void methodOopDesc::set_signature_handler(address handler) {
602 address* signature_handler = signature_handler_addr();
603 *signature_handler = handler;
604 }
605
606
607 bool methodOopDesc::is_not_compilable(int comp_level) const {
608 if (is_method_handle_invoke()) {
609 // compilers must recognize this method specially, or not at all
610 return true;
611 }
612 if (number_of_breakpoints() > 0) {
613 return true;
614 }
615 if (comp_level == CompLevel_any) {
616 return is_not_c1_compilable() || is_not_c2_compilable();
617 }
618 if (is_c1_compile(comp_level)) {
619 return is_not_c1_compilable();
620 }
621 if (is_c2_compile(comp_level)) {
622 return is_not_c2_compilable();
623 }
624 return false;
625 }
626
627 // call this when compiler finds that this method is not compilable
628 void methodOopDesc::set_not_compilable(int comp_level, bool report) {
629 if (PrintCompilation && report) {
630 ttyLocker ttyl;
631 tty->print("made not compilable ");
632 this->print_short_name(tty);
633 int size = this->code_size();
634 if (size > 0)
635 tty->print(" (%d bytes)", size);
636 tty->cr();
637 }
638 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) {
639 ttyLocker ttyl;
640 xtty->begin_elem("make_not_compilable thread='%d'", (int) os::current_thread_id());
641 xtty->method(methodOop(this));
642 xtty->stamp();
643 xtty->end_elem();
644 }
645 if (comp_level == CompLevel_all) {
646 set_not_c1_compilable();
647 set_not_c2_compilable();
648 } else {
649 if (is_c1_compile(comp_level)) {
650 set_not_c1_compilable();
651 } else
652 if (is_c2_compile(comp_level)) {
653 set_not_c2_compilable();
654 }
655 }
656 CompilationPolicy::policy()->disable_compilation(this);
657 }
658
659 // Revert to using the interpreter and clear out the nmethod
660 void methodOopDesc::clear_code() {
661
662 // this may be NULL if c2i adapters have not been made yet
663 // Only should happen at allocate time.
664 if (_adapter == NULL) {
665 _from_compiled_entry = NULL;
666 } else {
667 _from_compiled_entry = _adapter->get_c2i_entry();
668 }
669 OrderAccess::storestore();
670 _from_interpreted_entry = _i2i_entry;
671 OrderAccess::storestore();
672 _code = NULL;
673 }
674
675 // Called by class data sharing to remove any entry points (which are not shared)
676 void methodOopDesc::unlink_method() {
677 _code = NULL;
678 _i2i_entry = NULL;
679 _from_interpreted_entry = NULL;
680 if (is_native()) {
681 *native_function_addr() = NULL;
682 set_signature_handler(NULL);
683 }
684 NOT_PRODUCT(set_compiled_invocation_count(0);)
685 invocation_counter()->reset();
686 backedge_counter()->reset();
687 _adapter = NULL;
688 _from_compiled_entry = NULL;
689 assert(_method_data == NULL, "unexpected method data?");
690 set_method_data(NULL);
691 set_interpreter_throwout_count(0);
692 set_interpreter_invocation_count(0);
693 }
694
695 // Called when the method_holder is getting linked. Setup entrypoints so the method
696 // is ready to be called from interpreter, compiler, and vtables.
697 void methodOopDesc::link_method(methodHandle h_method, TRAPS) {
698 // If the code cache is full, we may reenter this function for the
699 // leftover methods that weren't linked.
700 if (_i2i_entry != NULL) return;
701
702 assert(_adapter == NULL, "init'd to NULL" );
703 assert( _code == NULL, "nothing compiled yet" );
704
705 // Setup interpreter entrypoint
706 assert(this == h_method(), "wrong h_method()" );
707 address entry = Interpreter::entry_for_method(h_method);
708 assert(entry != NULL, "interpreter entry must be non-null");
709 // Sets both _i2i_entry and _from_interpreted_entry
710 set_interpreter_entry(entry);
711 if (is_native() && !is_method_handle_invoke()) {
712 set_native_function(
713 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
714 !native_bind_event_is_interesting);
715 }
716
717 // Setup compiler entrypoint. This is made eagerly, so we do not need
718 // special handling of vtables. An alternative is to make adapters more
719 // lazily by calling make_adapter() from from_compiled_entry() for the
720 // normal calls. For vtable calls life gets more complicated. When a
721 // call-site goes mega-morphic we need adapters in all methods which can be
722 // called from the vtable. We need adapters on such methods that get loaded
723 // later. Ditto for mega-morphic itable calls. If this proves to be a
724 // problem we'll make these lazily later.
725 (void) make_adapters(h_method, CHECK);
726
727 // ONLY USE the h_method now as make_adapter may have blocked
728
729 }
730
731 address methodOopDesc::make_adapters(methodHandle mh, TRAPS) {
732 // Adapters for compiled code are made eagerly here. They are fairly
733 // small (generally < 100 bytes) and quick to make (and cached and shared)
734 // so making them eagerly shouldn't be too expensive.
735 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh);
736 if (adapter == NULL ) {
737 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters");
738 }
739
740 mh->set_adapter_entry(adapter);
741 mh->_from_compiled_entry = adapter->get_c2i_entry();
742 return adapter->get_c2i_entry();
743 }
744
745 // The verified_code_entry() must be called when a invoke is resolved
746 // on this method.
747
748 // It returns the compiled code entry point, after asserting not null.
749 // This function is called after potential safepoints so that nmethod
750 // or adapter that it points to is still live and valid.
751 // This function must not hit a safepoint!
752 address methodOopDesc::verified_code_entry() {
753 debug_only(No_Safepoint_Verifier nsv;)
754 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
755 if (code == NULL && UseCodeCacheFlushing) {
756 nmethod *saved_code = CodeCache::find_and_remove_saved_code(this);
757 if (saved_code != NULL) {
758 methodHandle method(this);
759 assert( ! saved_code->is_osr_method(), "should not get here for osr" );
760 set_code( method, saved_code );
761 }
762 }
763
764 assert(_from_compiled_entry != NULL, "must be set");
765 return _from_compiled_entry;
766 }
767
768 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all
769 // (could be racing a deopt).
770 // Not inline to avoid circular ref.
771 bool methodOopDesc::check_code() const {
772 // cached in a register or local. There's a race on the value of the field.
773 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
774 return code == NULL || (code->method() == NULL) || (code->method() == (methodOop)this && !code->is_osr_method());
775 }
776
777 // Install compiled code. Instantly it can execute.
778 void methodOopDesc::set_code(methodHandle mh, nmethod *code) {
779 assert( code, "use clear_code to remove code" );
780 assert( mh->check_code(), "" );
781
782 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!");
783
784 // These writes must happen in this order, because the interpreter will
785 // directly jump to from_interpreted_entry which jumps to an i2c adapter
786 // which jumps to _from_compiled_entry.
787 mh->_code = code; // Assign before allowing compiled code to exec
788
789 int comp_level = code->comp_level();
790 // In theory there could be a race here. In practice it is unlikely
791 // and not worth worrying about.
792 if (comp_level > mh->highest_comp_level()) {
793 mh->set_highest_comp_level(comp_level);
794 }
795
796 OrderAccess::storestore();
797 #ifdef SHARK
798 mh->_from_interpreted_entry = code->insts_begin();
799 #else
800 mh->_from_compiled_entry = code->verified_entry_point();
801 OrderAccess::storestore();
802 // Instantly compiled code can execute.
803 mh->_from_interpreted_entry = mh->get_i2c_entry();
804 #endif // SHARK
805
806 }
807
808
809 bool methodOopDesc::is_overridden_in(klassOop k) const {
810 instanceKlass* ik = instanceKlass::cast(k);
811
812 if (ik->is_interface()) return false;
813
814 // If method is an interface, we skip it - except if it
815 // is a miranda method
816 if (instanceKlass::cast(method_holder())->is_interface()) {
817 // Check that method is not a miranda method
818 if (ik->lookup_method(name(), signature()) == NULL) {
819 // No implementation exist - so miranda method
820 return false;
821 }
822 return true;
823 }
824
825 assert(ik->is_subclass_of(method_holder()), "should be subklass");
826 assert(ik->vtable() != NULL, "vtable should exist");
827 if (vtable_index() == nonvirtual_vtable_index) {
828 return false;
829 } else {
830 methodOop vt_m = ik->method_at_vtable(vtable_index());
831 return vt_m != methodOop(this);
832 }
833 }
834
835
836 // give advice about whether this methodOop should be cached or not
837 bool methodOopDesc::should_not_be_cached() const {
838 if (is_old()) {
839 // This method has been redefined. It is either EMCP or obsolete
840 // and we don't want to cache it because that would pin the method
841 // down and prevent it from being collectible if and when it
842 // finishes executing.
843 return true;
844 }
845
846 if (mark()->should_not_be_cached()) {
847 // It is either not safe or not a good idea to cache this
848 // method at this time because of the state of the embedded
849 // markOop. See markOop.cpp for the gory details.
850 return true;
851 }
852
853 // caching this method should be just fine
854 return false;
855 }
856
857 bool methodOopDesc::is_method_handle_invoke_name(vmSymbols::SID name_sid) {
858 switch (name_sid) {
859 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeExact_name):
860 case vmSymbols::VM_SYMBOL_ENUM_NAME(invoke_name):
861 return true;
862 }
863 if (AllowInvokeGeneric
864 && name_sid == vmSymbols::VM_SYMBOL_ENUM_NAME(invokeGeneric_name))
865 return true;
866 return false;
867 }
868
869 // Constant pool structure for invoke methods:
870 enum {
871 _imcp_invoke_name = 1, // utf8: 'invokeExact' or 'invokeGeneric'
872 _imcp_invoke_signature, // utf8: (variable Symbol*)
873 _imcp_method_type_value, // string: (variable java/lang/invoke/MethodType, sic)
874 _imcp_limit
875 };
876
877 oop methodOopDesc::method_handle_type() const {
878 if (!is_method_handle_invoke()) { assert(false, "caller resp."); return NULL; }
879 oop mt = constants()->resolved_string_at(_imcp_method_type_value);
880 assert(mt->klass() == SystemDictionary::MethodType_klass(), "");
881 return mt;
882 }
883
884 jint* methodOopDesc::method_type_offsets_chain() {
885 static jint pchase[] = { -1, -1, -1 };
886 if (pchase[0] == -1) {
887 jint step0 = in_bytes(constants_offset());
888 jint step1 = (constantPoolOopDesc::header_size() + _imcp_method_type_value) * HeapWordSize;
889 // do this in reverse to avoid races:
890 OrderAccess::release_store(&pchase[1], step1);
891 OrderAccess::release_store(&pchase[0], step0);
892 }
893 return pchase;
894 }
895
896 //------------------------------------------------------------------------------
897 // methodOopDesc::is_method_handle_adapter
898 //
899 // Tests if this method is an internal adapter frame from the
900 // MethodHandleCompiler.
901 // Must be consistent with MethodHandleCompiler::get_method_oop().
902 bool methodOopDesc::is_method_handle_adapter() const {
903 if (is_synthetic() &&
904 !is_native() && // has code from MethodHandleCompiler
905 is_method_handle_invoke_name(name()) &&
906 MethodHandleCompiler::klass_is_method_handle_adapter_holder(method_holder())) {
907 assert(!is_method_handle_invoke(), "disjoint");
908 return true;
909 } else {
910 return false;
911 }
912 }
913
914 methodHandle methodOopDesc::make_invoke_method(KlassHandle holder,
915 Symbol* name,
916 Symbol* signature,
917 Handle method_type, TRAPS) {
918 ResourceMark rm;
919 methodHandle empty;
920
921 assert(holder() == SystemDictionary::MethodHandle_klass(),
922 "must be a JSR 292 magic type");
923
924 if (TraceMethodHandles) {
925 tty->print("Creating invoke method for ");
926 signature->print_value();
927 tty->cr();
928 }
929
930 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup)
931 name->increment_refcount();
932 signature->increment_refcount();
933
934 // record non-BCP method types in the constant pool
935 GrowableArray<KlassHandle>* extra_klasses = NULL;
936 for (int i = -1, len = java_lang_invoke_MethodType::ptype_count(method_type()); i < len; i++) {
937 oop ptype = (i == -1
938 ? java_lang_invoke_MethodType::rtype(method_type())
939 : java_lang_invoke_MethodType::ptype(method_type(), i));
940 klassOop klass = check_non_bcp_klass(java_lang_Class::as_klassOop(ptype));
941 if (klass != NULL) {
942 if (extra_klasses == NULL)
943 extra_klasses = new GrowableArray<KlassHandle>(len+1);
944 bool dup = false;
945 for (int j = 0; j < extra_klasses->length(); j++) {
946 if (extra_klasses->at(j) == klass) { dup = true; break; }
947 }
948 if (!dup)
949 extra_klasses->append(KlassHandle(THREAD, klass));
950 }
951 }
952
953 int extra_klass_count = (extra_klasses == NULL ? 0 : extra_klasses->length());
954 int cp_length = _imcp_limit + extra_klass_count;
955 constantPoolHandle cp;
956 {
957 constantPoolOop cp_oop = oopFactory::new_constantPool(cp_length, IsSafeConc, CHECK_(empty));
958 cp = constantPoolHandle(THREAD, cp_oop);
959 }
960 cp->symbol_at_put(_imcp_invoke_name, name);
961 cp->symbol_at_put(_imcp_invoke_signature, signature);
962 cp->string_at_put(_imcp_method_type_value, Universe::the_null_string());
963 for (int j = 0; j < extra_klass_count; j++) {
964 KlassHandle klass = extra_klasses->at(j);
965 cp->klass_at_put(_imcp_limit + j, klass());
966 }
967 cp->set_preresolution();
968 cp->set_pool_holder(holder());
969
970 // set up the fancy stuff:
971 cp->pseudo_string_at_put(_imcp_method_type_value, method_type());
972 methodHandle m;
973 {
974 int flags_bits = (JVM_MH_INVOKE_BITS | JVM_ACC_PUBLIC | JVM_ACC_FINAL);
975 methodOop m_oop = oopFactory::new_method(0, accessFlags_from(flags_bits),
976 0, 0, 0, 0, IsSafeConc, CHECK_(empty));
977 m = methodHandle(THREAD, m_oop);
978 }
979 m->set_constants(cp());
980 m->set_name_index(_imcp_invoke_name);
981 m->set_signature_index(_imcp_invoke_signature);
982 assert(is_method_handle_invoke_name(m->name()), "");
983 assert(m->signature() == signature, "");
984 assert(m->is_method_handle_invoke(), "");
985 #ifdef CC_INTERP
986 ResultTypeFinder rtf(signature);
987 m->set_result_index(rtf.type());
988 #endif
989 m->compute_size_of_parameters(THREAD);
990 m->init_intrinsic_id();
991 assert(m->intrinsic_id() == vmIntrinsics::_invokeExact ||
992 m->intrinsic_id() == vmIntrinsics::_invokeGeneric, "must be an invoker");
993
994 // Finally, set up its entry points.
995 assert(m->method_handle_type() == method_type(), "");
996 assert(m->can_be_statically_bound(), "");
997 m->set_vtable_index(methodOopDesc::nonvirtual_vtable_index);
998 m->link_method(m, CHECK_(empty));
999
1000 #ifdef ASSERT
1001 // Make sure the pointer chase works.
1002 address p = (address) m();
1003 for (jint* pchase = method_type_offsets_chain(); (*pchase) != -1; pchase++) {
1004 p = *(address*)(p + (*pchase));
1005 }
1006 assert((oop)p == method_type(), "pointer chase is correct");
1007 #endif
1008
1009 if (TraceMethodHandles && (Verbose || WizardMode))
1010 m->print_on(tty);
1011
1012 return m;
1013 }
1014
1015 klassOop methodOopDesc::check_non_bcp_klass(klassOop klass) {
1016 if (klass != NULL && Klass::cast(klass)->class_loader() != NULL) {
1017 if (Klass::cast(klass)->oop_is_objArray())
1018 klass = objArrayKlass::cast(klass)->bottom_klass();
1019 return klass;
1020 }
1021 return NULL;
1022 }
1023
1024
1025 methodHandle methodOopDesc:: clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length,
1026 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) {
1027 // Code below does not work for native methods - they should never get rewritten anyway
1028 assert(!m->is_native(), "cannot rewrite native methods");
1029 // Allocate new methodOop
1030 AccessFlags flags = m->access_flags();
1031 int checked_exceptions_len = m->checked_exceptions_length();
1032 int localvariable_len = m->localvariable_table_length();
1033 int exception_table_len = m->exception_table_length();
1034 // Allocate newm_oop with the is_conc_safe parameter set
1035 // to IsUnsafeConc to indicate that newm_oop is not yet
1036 // safe for concurrent processing by a GC.
1037 methodOop newm_oop = oopFactory::new_method(new_code_length,
1038 flags,
1039 new_compressed_linenumber_size,
1040 localvariable_len,
1041 exception_table_len,
1042 checked_exceptions_len,
1043 IsUnsafeConc,
1044 CHECK_(methodHandle()));
1045 methodHandle newm (THREAD, newm_oop);
1046 NOT_PRODUCT(int nmsz = newm->is_parsable() ? newm->size() : -1;)
1047 int new_method_size = newm->method_size();
1048 // Create a shallow copy of methodOopDesc part, but be careful to preserve the new constMethodOop
1049 constMethodOop newcm = newm->constMethod();
1050 NOT_PRODUCT(int ncmsz = newcm->is_parsable() ? newcm->size() : -1;)
1051 int new_const_method_size = newm->constMethod()->object_size();
1052
1053 memcpy(newm(), m(), sizeof(methodOopDesc));
1054 // Create shallow copy of constMethodOopDesc, but be careful to preserve the methodOop
1055 // is_conc_safe is set to false because that is the value of
1056 // is_conc_safe initialzied into newcm and the copy should
1057 // not overwrite that value. During the window during which it is
1058 // tagged as unsafe, some extra work could be needed during precleaning
1059 // or concurrent marking but those phases will be correct. Setting and
1060 // resetting is done in preference to a careful copying into newcm to
1061 // avoid having to know the precise layout of a constMethodOop.
1062 m->constMethod()->set_is_conc_safe(oopDesc::IsUnsafeConc);
1063 assert(m->constMethod()->is_parsable(), "Should remain parsable");
1064
1065 // NOTE: this is a reachable object that transiently signals "conc_unsafe"
1066 // However, no allocations are done during this window
1067 // during which it is tagged conc_unsafe, so we are assured that any concurrent
1068 // thread will not wait forever for the object to revert to "conc_safe".
1069 // Further, any such conc_unsafe object will indicate a stable size
1070 // through the transition.
1071 memcpy(newcm, m->constMethod(), sizeof(constMethodOopDesc));
1072 m->constMethod()->set_is_conc_safe(oopDesc::IsSafeConc);
1073 assert(m->constMethod()->is_parsable(), "Should remain parsable");
1074
1075 // Reset correct method/const method, method size, and parameter info
1076 newcm->set_method(newm());
1077 newm->set_constMethod(newcm);
1078 assert(newcm->method() == newm(), "check");
1079 newm->constMethod()->set_code_size(new_code_length);
1080 newm->constMethod()->set_constMethod_size(new_const_method_size);
1081 newm->set_method_size(new_method_size);
1082 assert(newm->code_size() == new_code_length, "check");
1083 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check");
1084 assert(newm->localvariable_table_length() == localvariable_len, "check");
1085 // Copy new byte codes
1086 memcpy(newm->code_base(), new_code, new_code_length);
1087 // Copy line number table
1088 if (new_compressed_linenumber_size > 0) {
1089 memcpy(newm->compressed_linenumber_table(),
1090 new_compressed_linenumber_table,
1091 new_compressed_linenumber_size);
1092 }
1093 // Copy checked_exceptions
1094 if (checked_exceptions_len > 0) {
1095 memcpy(newm->checked_exceptions_start(),
1096 m->checked_exceptions_start(),
1097 checked_exceptions_len * sizeof(CheckedExceptionElement));
1098 }
1099 // Copy local variable number table
1100 if (localvariable_len > 0) {
1101 memcpy(newm->localvariable_table_start(),
1102 m->localvariable_table_start(),
1103 localvariable_len * sizeof(LocalVariableTableElement));
1104 }
1105
1106 // Only set is_conc_safe to true when changes to newcm are
1107 // complete.
1108 assert(!newm->is_parsable() || nmsz < 0 || newm->size() == nmsz, "newm->size() inconsistency");
1109 assert(!newcm->is_parsable() || ncmsz < 0 || newcm->size() == ncmsz, "newcm->size() inconsistency");
1110 newcm->set_is_conc_safe(true);
1111 return newm;
1112 }
1113
1114 vmSymbols::SID methodOopDesc::klass_id_for_intrinsics(klassOop holder) {
1115 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics
1116 // because we are not loading from core libraries
1117 if (instanceKlass::cast(holder)->class_loader() != NULL)
1118 return vmSymbols::NO_SID; // regardless of name, no intrinsics here
1119
1120 // see if the klass name is well-known:
1121 Symbol* klass_name = instanceKlass::cast(holder)->name();
1122 return vmSymbols::find_sid(klass_name);
1123 }
1124
1125 void methodOopDesc::init_intrinsic_id() {
1126 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once");
1127 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte));
1128 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size");
1129 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), "");
1130
1131 // the klass name is well-known:
1132 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder());
1133 assert(klass_id != vmSymbols::NO_SID, "caller responsibility");
1134
1135 // ditto for method and signature:
1136 vmSymbols::SID name_id = vmSymbols::find_sid(name());
1137 if (name_id == vmSymbols::NO_SID) return;
1138 vmSymbols::SID sig_id = vmSymbols::find_sid(signature());
1139 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1140 && sig_id == vmSymbols::NO_SID) return;
1141 jshort flags = access_flags().as_short();
1142
1143 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1144 if (id != vmIntrinsics::_none) {
1145 set_intrinsic_id(id);
1146 return;
1147 }
1148
1149 // A few slightly irregular cases:
1150 switch (klass_id) {
1151 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath):
1152 // Second chance: check in regular Math.
1153 switch (name_id) {
1154 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name):
1155 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name):
1156 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name):
1157 // pretend it is the corresponding method in the non-strict class:
1158 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math);
1159 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1160 break;
1161 }
1162 break;
1163
1164 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*.
1165 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle):
1166 if (is_static() || !is_native()) break;
1167 switch (name_id) {
1168 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeGeneric_name):
1169 if (!AllowInvokeGeneric) break;
1170 case vmSymbols::VM_SYMBOL_ENUM_NAME(invoke_name):
1171 id = vmIntrinsics::_invokeGeneric;
1172 break;
1173 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeExact_name):
1174 id = vmIntrinsics::_invokeExact;
1175 break;
1176 }
1177 break;
1178 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_InvokeDynamic):
1179 if (!is_static() || !is_native()) break;
1180 id = vmIntrinsics::_invokeDynamic;
1181 break;
1182 }
1183
1184 if (id != vmIntrinsics::_none) {
1185 // Set up its iid. It is an alias method.
1186 set_intrinsic_id(id);
1187 return;
1188 }
1189 }
1190
1191 // These two methods are static since a GC may move the methodOopDesc
1192 bool methodOopDesc::load_signature_classes(methodHandle m, TRAPS) {
1193 bool sig_is_loaded = true;
1194 Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader());
1195 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1196 ResourceMark rm(THREAD);
1197 Symbol* signature = m->signature();
1198 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1199 if (ss.is_object()) {
1200 Symbol* sym = ss.as_symbol(CHECK_(false));
1201 Symbol* name = sym;
1202 klassOop klass = SystemDictionary::resolve_or_null(name, class_loader,
1203 protection_domain, THREAD);
1204 // We are loading classes eagerly. If a ClassNotFoundException or
1205 // a LinkageError was generated, be sure to ignore it.
1206 if (HAS_PENDING_EXCEPTION) {
1207 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) ||
1208 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) {
1209 CLEAR_PENDING_EXCEPTION;
1210 } else {
1211 return false;
1212 }
1213 }
1214 if( klass == NULL) { sig_is_loaded = false; }
1215 }
1216 }
1217 return sig_is_loaded;
1218 }
1219
1220 bool methodOopDesc::has_unloaded_classes_in_signature(methodHandle m, TRAPS) {
1221 Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader());
1222 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1223 ResourceMark rm(THREAD);
1224 Symbol* signature = m->signature();
1225 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1226 if (ss.type() == T_OBJECT) {
1227 Symbol* name = ss.as_symbol_or_null();
1228 if (name == NULL) return true;
1229 klassOop klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD);
1230 if (klass == NULL) return true;
1231 }
1232 }
1233 return false;
1234 }
1235
1236 // Exposed so field engineers can debug VM
1237 void methodOopDesc::print_short_name(outputStream* st) {
1238 ResourceMark rm;
1239 #ifdef PRODUCT
1240 st->print(" %s::", method_holder()->klass_part()->external_name());
1241 #else
1242 st->print(" %s::", method_holder()->klass_part()->internal_name());
1243 #endif
1244 name()->print_symbol_on(st);
1245 if (WizardMode) signature()->print_symbol_on(st);
1246 }
1247
1248 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1249 static void reorder_based_on_method_index(objArrayOop methods,
1250 objArrayOop annotations,
1251 GrowableArray<oop>* temp_array) {
1252 if (annotations == NULL) {
1253 return;
1254 }
1255
1256 int length = methods->length();
1257 int i;
1258 // Copy to temp array
1259 temp_array->clear();
1260 for (i = 0; i < length; i++) {
1261 temp_array->append(annotations->obj_at(i));
1262 }
1263
1264 // Copy back using old method indices
1265 for (i = 0; i < length; i++) {
1266 methodOop m = (methodOop) methods->obj_at(i);
1267 annotations->obj_at_put(i, temp_array->at(m->method_idnum()));
1268 }
1269 }
1270
1271 // Comparer for sorting an object array containing
1272 // methodOops.
1273 // Used non-template method_comparator methods since
1274 // Visual Studio 2003 compiler generates incorrect
1275 // optimized code for it.
1276 static int method_comparator_narrowOop(narrowOop a, narrowOop b) {
1277 methodOop m = (methodOop)oopDesc::decode_heap_oop_not_null(a);
1278 methodOop n = (methodOop)oopDesc::decode_heap_oop_not_null(b);
1279 return m->name()->fast_compare(n->name());
1280 }
1281 static int method_comparator_oop(oop a, oop b) {
1282 methodOop m = (methodOop)a;
1283 methodOop n = (methodOop)b;
1284 return m->name()->fast_compare(n->name());
1285 }
1286
1287 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1288 void methodOopDesc::sort_methods(objArrayOop methods,
1289 objArrayOop methods_annotations,
1290 objArrayOop methods_parameter_annotations,
1291 objArrayOop methods_default_annotations,
1292 bool idempotent) {
1293 int length = methods->length();
1294 if (length > 1) {
1295 bool do_annotations = false;
1296 if (methods_annotations != NULL ||
1297 methods_parameter_annotations != NULL ||
1298 methods_default_annotations != NULL) {
1299 do_annotations = true;
1300 }
1301 if (do_annotations) {
1302 // Remember current method ordering so we can reorder annotations
1303 for (int i = 0; i < length; i++) {
1304 methodOop m = (methodOop) methods->obj_at(i);
1305 m->set_method_idnum(i);
1306 }
1307 }
1308 {
1309 No_Safepoint_Verifier nsv;
1310 if (UseCompressedOops) {
1311 QuickSort::sort<narrowOop>((narrowOop*)(methods->base()), length, method_comparator_narrowOop, idempotent);
1312 } else {
1313 QuickSort::sort<oop>((oop*)(methods->base()), length, method_comparator_oop, idempotent);
1314 }
1315 if (UseConcMarkSweepGC) {
1316 // For CMS we need to dirty the cards for the array
1317 BarrierSet* bs = Universe::heap()->barrier_set();
1318 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
1319 bs->write_ref_array(methods->base(), length);
1320 }
1321 }
1322
1323 // Sort annotations if necessary
1324 assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), "");
1325 assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), "");
1326 assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), "");
1327 if (do_annotations) {
1328 ResourceMark rm;
1329 // Allocate temporary storage
1330 GrowableArray<oop>* temp_array = new GrowableArray<oop>(length);
1331 reorder_based_on_method_index(methods, methods_annotations, temp_array);
1332 reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array);
1333 reorder_based_on_method_index(methods, methods_default_annotations, temp_array);
1334 }
1335
1336 // Reset method ordering
1337 for (int i = 0; i < length; i++) {
1338 methodOop m = (methodOop) methods->obj_at(i);
1339 m->set_method_idnum(i);
1340 }
1341 }
1342 }
1343
1344
1345 //-----------------------------------------------------------------------------------
1346 // Non-product code
1347
1348 #ifndef PRODUCT
1349 class SignatureTypePrinter : public SignatureTypeNames {
1350 private:
1351 outputStream* _st;
1352 bool _use_separator;
1353
1354 void type_name(const char* name) {
1355 if (_use_separator) _st->print(", ");
1356 _st->print(name);
1357 _use_separator = true;
1358 }
1359
1360 public:
1361 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) {
1362 _st = st;
1363 _use_separator = false;
1364 }
1365
1366 void print_parameters() { _use_separator = false; iterate_parameters(); }
1367 void print_returntype() { _use_separator = false; iterate_returntype(); }
1368 };
1369
1370
1371 void methodOopDesc::print_name(outputStream* st) {
1372 Thread *thread = Thread::current();
1373 ResourceMark rm(thread);
1374 SignatureTypePrinter sig(signature(), st);
1375 st->print("%s ", is_static() ? "static" : "virtual");
1376 sig.print_returntype();
1377 st->print(" %s.", method_holder()->klass_part()->internal_name());
1378 name()->print_symbol_on(st);
1379 st->print("(");
1380 sig.print_parameters();
1381 st->print(")");
1382 }
1383
1384
1385 void methodOopDesc::print_codes_on(outputStream* st) const {
1386 print_codes_on(0, code_size(), st);
1387 }
1388
1389 void methodOopDesc::print_codes_on(int from, int to, outputStream* st) const {
1390 Thread *thread = Thread::current();
1391 ResourceMark rm(thread);
1392 methodHandle mh (thread, (methodOop)this);
1393 BytecodeStream s(mh);
1394 s.set_interval(from, to);
1395 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
1396 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1397 }
1398 #endif // not PRODUCT
1399
1400
1401 // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas
1402 // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned)
1403 // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used
1404 // as end-of-stream terminator.
1405
1406 void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) {
1407 // bci and line number does not compress into single byte.
1408 // Write out escape character and use regular compression for bci and line number.
1409 write_byte((jubyte)0xFF);
1410 write_signed_int(bci_delta);
1411 write_signed_int(line_delta);
1412 }
1413
1414 // See comment in methodOop.hpp which explains why this exists.
1415 #if defined(_M_AMD64) && _MSC_VER >= 1400
1416 #pragma optimize("", off)
1417 void CompressedLineNumberWriteStream::write_pair(int bci, int line) {
1418 write_pair_inline(bci, line);
1419 }
1420 #pragma optimize("", on)
1421 #endif
1422
1423 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) {
1424 _bci = 0;
1425 _line = 0;
1426 };
1427
1428
1429 bool CompressedLineNumberReadStream::read_pair() {
1430 jubyte next = read_byte();
1431 // Check for terminator
1432 if (next == 0) return false;
1433 if (next == 0xFF) {
1434 // Escape character, regular compression used
1435 _bci += read_signed_int();
1436 _line += read_signed_int();
1437 } else {
1438 // Single byte compression used
1439 _bci += next >> 3;
1440 _line += next & 0x7;
1441 }
1442 return true;
1443 }
1444
1445
1446 Bytecodes::Code methodOopDesc::orig_bytecode_at(int bci) const {
1447 BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints();
1448 for (; bp != NULL; bp = bp->next()) {
1449 if (bp->match(this, bci)) {
1450 return bp->orig_bytecode();
1451 }
1452 }
1453 ShouldNotReachHere();
1454 return Bytecodes::_shouldnotreachhere;
1455 }
1456
1457 void methodOopDesc::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
1458 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
1459 BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints();
1460 for (; bp != NULL; bp = bp->next()) {
1461 if (bp->match(this, bci)) {
1462 bp->set_orig_bytecode(code);
1463 // and continue, in case there is more than one
1464 }
1465 }
1466 }
1467
1468 void methodOopDesc::set_breakpoint(int bci) {
1469 instanceKlass* ik = instanceKlass::cast(method_holder());
1470 BreakpointInfo *bp = new BreakpointInfo(this, bci);
1471 bp->set_next(ik->breakpoints());
1472 ik->set_breakpoints(bp);
1473 // do this last:
1474 bp->set(this);
1475 }
1476
1477 static void clear_matches(methodOop m, int bci) {
1478 instanceKlass* ik = instanceKlass::cast(m->method_holder());
1479 BreakpointInfo* prev_bp = NULL;
1480 BreakpointInfo* next_bp;
1481 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
1482 next_bp = bp->next();
1483 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint).
1484 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) {
1485 // do this first:
1486 bp->clear(m);
1487 // unhook it
1488 if (prev_bp != NULL)
1489 prev_bp->set_next(next_bp);
1490 else
1491 ik->set_breakpoints(next_bp);
1492 delete bp;
1493 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods
1494 // at same location. So we have multiple matching (method_index and bci)
1495 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one
1496 // breakpoint for clear_breakpoint request and keep all other method versions
1497 // BreakpointInfo for future clear_breakpoint request.
1498 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints)
1499 // which is being called when class is unloaded. We delete all the Breakpoint
1500 // information for all versions of method. We may not correctly restore the original
1501 // bytecode in all method versions, but that is ok. Because the class is being unloaded
1502 // so these methods won't be used anymore.
1503 if (bci >= 0) {
1504 break;
1505 }
1506 } else {
1507 // This one is a keeper.
1508 prev_bp = bp;
1509 }
1510 }
1511 }
1512
1513 void methodOopDesc::clear_breakpoint(int bci) {
1514 assert(bci >= 0, "");
1515 clear_matches(this, bci);
1516 }
1517
1518 void methodOopDesc::clear_all_breakpoints() {
1519 clear_matches(this, -1);
1520 }
1521
1522
1523 int methodOopDesc::invocation_count() {
1524 if (TieredCompilation) {
1525 const methodDataOop mdo = method_data();
1526 if (invocation_counter()->carry() || ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) {
1527 return InvocationCounter::count_limit;
1528 } else {
1529 return invocation_counter()->count() + ((mdo != NULL) ? mdo->invocation_counter()->count() : 0);
1530 }
1531 } else {
1532 return invocation_counter()->count();
1533 }
1534 }
1535
1536 int methodOopDesc::backedge_count() {
1537 if (TieredCompilation) {
1538 const methodDataOop mdo = method_data();
1539 if (backedge_counter()->carry() || ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) {
1540 return InvocationCounter::count_limit;
1541 } else {
1542 return backedge_counter()->count() + ((mdo != NULL) ? mdo->backedge_counter()->count() : 0);
1543 }
1544 } else {
1545 return backedge_counter()->count();
1546 }
1547 }
1548
1549 int methodOopDesc::highest_comp_level() const {
1550 methodDataOop mdo = method_data();
1551 if (mdo != NULL) {
1552 return mdo->highest_comp_level();
1553 } else {
1554 return CompLevel_none;
1555 }
1556 }
1557
1558 int methodOopDesc::highest_osr_comp_level() const {
1559 methodDataOop mdo = method_data();
1560 if (mdo != NULL) {
1561 return mdo->highest_osr_comp_level();
1562 } else {
1563 return CompLevel_none;
1564 }
1565 }
1566
1567 void methodOopDesc::set_highest_comp_level(int level) {
1568 methodDataOop mdo = method_data();
1569 if (mdo != NULL) {
1570 mdo->set_highest_comp_level(level);
1571 }
1572 }
1573
1574 void methodOopDesc::set_highest_osr_comp_level(int level) {
1575 methodDataOop mdo = method_data();
1576 if (mdo != NULL) {
1577 mdo->set_highest_osr_comp_level(level);
1578 }
1579 }
1580
1581 BreakpointInfo::BreakpointInfo(methodOop m, int bci) {
1582 _bci = bci;
1583 _name_index = m->name_index();
1584 _signature_index = m->signature_index();
1585 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci);
1586 if (_orig_bytecode == Bytecodes::_breakpoint)
1587 _orig_bytecode = m->orig_bytecode_at(_bci);
1588 _next = NULL;
1589 }
1590
1591 void BreakpointInfo::set(methodOop method) {
1592 #ifdef ASSERT
1593 {
1594 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci);
1595 if (code == Bytecodes::_breakpoint)
1596 code = method->orig_bytecode_at(_bci);
1597 assert(orig_bytecode() == code, "original bytecode must be the same");
1598 }
1599 #endif
1600 *method->bcp_from(_bci) = Bytecodes::_breakpoint;
1601 method->incr_number_of_breakpoints();
1602 SystemDictionary::notice_modification();
1603 {
1604 // Deoptimize all dependents on this method
1605 Thread *thread = Thread::current();
1606 HandleMark hm(thread);
1607 methodHandle mh(thread, method);
1608 Universe::flush_dependents_on_method(mh);
1609 }
1610 }
1611
1612 void BreakpointInfo::clear(methodOop method) {
1613 *method->bcp_from(_bci) = orig_bytecode();
1614 assert(method->number_of_breakpoints() > 0, "must not go negative");
1615 method->decr_number_of_breakpoints();
1616 }