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