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