Thu, 13 Jan 2011 22:15:41 -0800
4926272: methodOopDesc::method_from_bcp is unsafe
Reviewed-by: coleenp, jrose, kvn, dcubed
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 */
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/symbolOop.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"
55 // Implementation of methodOopDesc
57 address methodOopDesc::get_i2c_entry() {
58 assert(_adapter != NULL, "must have");
59 return _adapter->get_i2c_entry();
60 }
62 address methodOopDesc::get_c2i_entry() {
63 assert(_adapter != NULL, "must have");
64 return _adapter->get_c2i_entry();
65 }
67 address methodOopDesc::get_c2i_unverified_entry() {
68 assert(_adapter != NULL, "must have");
69 return _adapter->get_c2i_unverified_entry();
70 }
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 }
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 }
80 char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, symbolOop method_name, symbolOop 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 }
94 char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, symbolOop method_name, symbolOop signature, char* buf, int size) {
95 symbolOop klass_name = klass->name();
96 klass_name->as_klass_external_name(buf, size);
97 int len = (int)strlen(buf);
99 if (len < size - 1) {
100 buf[len++] = '.';
102 method_name->as_C_string(&(buf[len]), size - len);
103 len = (int)strlen(buf);
105 signature->as_C_string(&(buf[len]), size - len);
106 }
108 return buf;
109 }
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 }
150 return -1;
151 }
153 void methodOopDesc::mask_for(int bci, InterpreterOopMap* mask) {
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();
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 }
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 }
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 }
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 }
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 }
224 symbolOop 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 }
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 }
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.
245 void methodOopDesc::remove_unshareable_info() {
246 unlink_method();
247 set_interpreter_kind();
248 }
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 }
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);
282 if (WizardMode) {
283 // dump the size of the byte codes
284 tty->print(" {%d}", code_size());
285 }
286 tty->cr();
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 }
295 }
296 #endif
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 }
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 }
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 }
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 }
335 void methodOopDesc::compute_size_of_parameters(Thread *thread) {
336 symbolHandle h_signature(thread, signature());
337 ArgumentSizeComputer asc(h_signature);
338 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1));
339 }
341 #ifdef CC_INTERP
342 void methodOopDesc::set_result_index(BasicType type) {
343 _result_index = Interpreter::BasicType_as_index(type);
344 }
345 #endif
347 BasicType methodOopDesc::result_type() const {
348 ResultTypeFinder rtf(signature());
349 return rtf.type();
350 }
353 bool methodOopDesc::is_empty_method() const {
354 return code_size() == 1
355 && *code_base() == Bytecodes::_return;
356 }
359 bool methodOopDesc::is_vanilla_constructor() const {
360 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method
361 // which only calls the superclass vanilla constructor and possibly does stores of
362 // zero constants to local fields:
363 //
364 // aload_0
365 // invokespecial
366 // indexbyte1
367 // indexbyte2
368 //
369 // followed by an (optional) sequence of:
370 //
371 // aload_0
372 // aconst_null / iconst_0 / fconst_0 / dconst_0
373 // putfield
374 // indexbyte1
375 // indexbyte2
376 //
377 // followed by:
378 //
379 // return
381 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors");
382 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors");
383 int size = code_size();
384 // Check if size match
385 if (size == 0 || size % 5 != 0) return false;
386 address cb = code_base();
387 int last = size - 1;
388 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) {
389 // Does not call superclass default constructor
390 return false;
391 }
392 // Check optional sequence
393 for (int i = 4; i < last; i += 5) {
394 if (cb[i] != Bytecodes::_aload_0) return false;
395 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false;
396 if (cb[i+2] != Bytecodes::_putfield) return false;
397 }
398 return true;
399 }
402 bool methodOopDesc::compute_has_loops_flag() {
403 BytecodeStream bcs(methodOop(this));
404 Bytecodes::Code bc;
406 while ((bc = bcs.next()) >= 0) {
407 switch( bc ) {
408 case Bytecodes::_ifeq:
409 case Bytecodes::_ifnull:
410 case Bytecodes::_iflt:
411 case Bytecodes::_ifle:
412 case Bytecodes::_ifne:
413 case Bytecodes::_ifnonnull:
414 case Bytecodes::_ifgt:
415 case Bytecodes::_ifge:
416 case Bytecodes::_if_icmpeq:
417 case Bytecodes::_if_icmpne:
418 case Bytecodes::_if_icmplt:
419 case Bytecodes::_if_icmpgt:
420 case Bytecodes::_if_icmple:
421 case Bytecodes::_if_icmpge:
422 case Bytecodes::_if_acmpeq:
423 case Bytecodes::_if_acmpne:
424 case Bytecodes::_goto:
425 case Bytecodes::_jsr:
426 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops();
427 break;
429 case Bytecodes::_goto_w:
430 case Bytecodes::_jsr_w:
431 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops();
432 break;
433 }
434 }
435 _access_flags.set_loops_flag_init();
436 return _access_flags.has_loops();
437 }
440 bool methodOopDesc::is_final_method() const {
441 // %%% Should return true for private methods also,
442 // since there is no way to override them.
443 return is_final() || Klass::cast(method_holder())->is_final();
444 }
447 bool methodOopDesc::is_strict_method() const {
448 return is_strict();
449 }
452 bool methodOopDesc::can_be_statically_bound() const {
453 if (is_final_method()) return true;
454 return vtable_index() == nonvirtual_vtable_index;
455 }
458 bool methodOopDesc::is_accessor() const {
459 if (code_size() != 5) return false;
460 if (size_of_parameters() != 1) return false;
461 if (java_code_at(0) != Bytecodes::_aload_0 ) return false;
462 if (java_code_at(1) != Bytecodes::_getfield) return false;
463 if (java_code_at(4) != Bytecodes::_areturn &&
464 java_code_at(4) != Bytecodes::_ireturn ) return false;
465 return true;
466 }
469 bool methodOopDesc::is_initializer() const {
470 return name() == vmSymbols::object_initializer_name() || name() == vmSymbols::class_initializer_name();
471 }
474 objArrayHandle methodOopDesc::resolved_checked_exceptions_impl(methodOop this_oop, TRAPS) {
475 int length = this_oop->checked_exceptions_length();
476 if (length == 0) { // common case
477 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array());
478 } else {
479 methodHandle h_this(THREAD, this_oop);
480 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle()));
481 objArrayHandle mirrors (THREAD, m_oop);
482 for (int i = 0; i < length; i++) {
483 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe
484 klassOop k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle()));
485 assert(Klass::cast(k)->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class");
486 mirrors->obj_at_put(i, Klass::cast(k)->java_mirror());
487 }
488 return mirrors;
489 }
490 };
493 int methodOopDesc::line_number_from_bci(int bci) const {
494 if (bci == SynchronizationEntryBCI) bci = 0;
495 assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci");
496 int best_bci = 0;
497 int best_line = -1;
499 if (has_linenumber_table()) {
500 // The line numbers are a short array of 2-tuples [start_pc, line_number].
501 // Not necessarily sorted and not necessarily one-to-one.
502 CompressedLineNumberReadStream stream(compressed_linenumber_table());
503 while (stream.read_pair()) {
504 if (stream.bci() == bci) {
505 // perfect match
506 return stream.line();
507 } else {
508 // update best_bci/line
509 if (stream.bci() < bci && stream.bci() >= best_bci) {
510 best_bci = stream.bci();
511 best_line = stream.line();
512 }
513 }
514 }
515 }
516 return best_line;
517 }
520 bool methodOopDesc::is_klass_loaded_by_klass_index(int klass_index) const {
521 if( _constants->tag_at(klass_index).is_unresolved_klass() ) {
522 Thread *thread = Thread::current();
523 symbolHandle klass_name(thread, _constants->klass_name_at(klass_index));
524 Handle loader(thread, instanceKlass::cast(method_holder())->class_loader());
525 Handle prot (thread, Klass::cast(method_holder())->protection_domain());
526 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
527 } else {
528 return true;
529 }
530 }
533 bool methodOopDesc::is_klass_loaded(int refinfo_index, bool must_be_resolved) const {
534 int klass_index = _constants->klass_ref_index_at(refinfo_index);
535 if (must_be_resolved) {
536 // Make sure klass is resolved in constantpool.
537 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false;
538 }
539 return is_klass_loaded_by_klass_index(klass_index);
540 }
543 void methodOopDesc::set_native_function(address function, bool post_event_flag) {
544 assert(function != NULL, "use clear_native_function to unregister natives");
545 address* native_function = native_function_addr();
547 // We can see racers trying to place the same native function into place. Once
548 // is plenty.
549 address current = *native_function;
550 if (current == function) return;
551 if (post_event_flag && JvmtiExport::should_post_native_method_bind() &&
552 function != NULL) {
553 // native_method_throw_unsatisfied_link_error_entry() should only
554 // be passed when post_event_flag is false.
555 assert(function !=
556 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
557 "post_event_flag mis-match");
559 // post the bind event, and possible change the bind function
560 JvmtiExport::post_native_method_bind(this, &function);
561 }
562 *native_function = function;
563 // This function can be called more than once. We must make sure that we always
564 // use the latest registered method -> check if a stub already has been generated.
565 // If so, we have to make it not_entrant.
566 nmethod* nm = code(); // Put it into local variable to guard against concurrent updates
567 if (nm != NULL) {
568 nm->make_not_entrant();
569 }
570 }
573 bool methodOopDesc::has_native_function() const {
574 address func = native_function();
575 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
576 }
579 void methodOopDesc::clear_native_function() {
580 set_native_function(
581 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
582 !native_bind_event_is_interesting);
583 clear_code();
584 }
587 void methodOopDesc::set_signature_handler(address handler) {
588 address* signature_handler = signature_handler_addr();
589 *signature_handler = handler;
590 }
593 bool methodOopDesc::is_not_compilable(int comp_level) const {
594 if (is_method_handle_invoke()) {
595 // compilers must recognize this method specially, or not at all
596 return true;
597 }
598 if (number_of_breakpoints() > 0) {
599 return true;
600 }
601 if (comp_level == CompLevel_any) {
602 return is_not_c1_compilable() || is_not_c2_compilable();
603 }
604 if (is_c1_compile(comp_level)) {
605 return is_not_c1_compilable();
606 }
607 if (is_c2_compile(comp_level)) {
608 return is_not_c2_compilable();
609 }
610 return false;
611 }
613 // call this when compiler finds that this method is not compilable
614 void methodOopDesc::set_not_compilable(int comp_level, bool report) {
615 if (PrintCompilation && report) {
616 ttyLocker ttyl;
617 tty->print("made not compilable ");
618 this->print_short_name(tty);
619 int size = this->code_size();
620 if (size > 0)
621 tty->print(" (%d bytes)", size);
622 tty->cr();
623 }
624 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) {
625 ttyLocker ttyl;
626 xtty->begin_elem("make_not_compilable thread='%d'", (int) os::current_thread_id());
627 xtty->method(methodOop(this));
628 xtty->stamp();
629 xtty->end_elem();
630 }
631 if (comp_level == CompLevel_all) {
632 set_not_c1_compilable();
633 set_not_c2_compilable();
634 } else {
635 if (is_c1_compile(comp_level)) {
636 set_not_c1_compilable();
637 } else
638 if (is_c2_compile(comp_level)) {
639 set_not_c2_compilable();
640 }
641 }
642 CompilationPolicy::policy()->disable_compilation(this);
643 }
645 // Revert to using the interpreter and clear out the nmethod
646 void methodOopDesc::clear_code() {
648 // this may be NULL if c2i adapters have not been made yet
649 // Only should happen at allocate time.
650 if (_adapter == NULL) {
651 _from_compiled_entry = NULL;
652 } else {
653 _from_compiled_entry = _adapter->get_c2i_entry();
654 }
655 OrderAccess::storestore();
656 _from_interpreted_entry = _i2i_entry;
657 OrderAccess::storestore();
658 _code = NULL;
659 }
661 // Called by class data sharing to remove any entry points (which are not shared)
662 void methodOopDesc::unlink_method() {
663 _code = NULL;
664 _i2i_entry = NULL;
665 _from_interpreted_entry = NULL;
666 if (is_native()) {
667 *native_function_addr() = NULL;
668 set_signature_handler(NULL);
669 }
670 NOT_PRODUCT(set_compiled_invocation_count(0);)
671 invocation_counter()->reset();
672 backedge_counter()->reset();
673 _adapter = NULL;
674 _from_compiled_entry = NULL;
675 assert(_method_data == NULL, "unexpected method data?");
676 set_method_data(NULL);
677 set_interpreter_throwout_count(0);
678 set_interpreter_invocation_count(0);
679 }
681 // Called when the method_holder is getting linked. Setup entrypoints so the method
682 // is ready to be called from interpreter, compiler, and vtables.
683 void methodOopDesc::link_method(methodHandle h_method, TRAPS) {
684 assert(_i2i_entry == NULL, "should only be called once");
685 assert(_adapter == NULL, "init'd to NULL" );
686 assert( _code == NULL, "nothing compiled yet" );
688 // Setup interpreter entrypoint
689 assert(this == h_method(), "wrong h_method()" );
690 address entry = Interpreter::entry_for_method(h_method);
691 assert(entry != NULL, "interpreter entry must be non-null");
692 // Sets both _i2i_entry and _from_interpreted_entry
693 set_interpreter_entry(entry);
694 if (is_native() && !is_method_handle_invoke()) {
695 set_native_function(
696 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
697 !native_bind_event_is_interesting);
698 }
700 // Setup compiler entrypoint. This is made eagerly, so we do not need
701 // special handling of vtables. An alternative is to make adapters more
702 // lazily by calling make_adapter() from from_compiled_entry() for the
703 // normal calls. For vtable calls life gets more complicated. When a
704 // call-site goes mega-morphic we need adapters in all methods which can be
705 // called from the vtable. We need adapters on such methods that get loaded
706 // later. Ditto for mega-morphic itable calls. If this proves to be a
707 // problem we'll make these lazily later.
708 (void) make_adapters(h_method, CHECK);
710 // ONLY USE the h_method now as make_adapter may have blocked
712 }
714 address methodOopDesc::make_adapters(methodHandle mh, TRAPS) {
715 // Adapters for compiled code are made eagerly here. They are fairly
716 // small (generally < 100 bytes) and quick to make (and cached and shared)
717 // so making them eagerly shouldn't be too expensive.
718 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh);
719 if (adapter == NULL ) {
720 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters");
721 }
723 mh->set_adapter_entry(adapter);
724 mh->_from_compiled_entry = adapter->get_c2i_entry();
725 return adapter->get_c2i_entry();
726 }
728 // The verified_code_entry() must be called when a invoke is resolved
729 // on this method.
731 // It returns the compiled code entry point, after asserting not null.
732 // This function is called after potential safepoints so that nmethod
733 // or adapter that it points to is still live and valid.
734 // This function must not hit a safepoint!
735 address methodOopDesc::verified_code_entry() {
736 debug_only(No_Safepoint_Verifier nsv;)
737 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
738 if (code == NULL && UseCodeCacheFlushing) {
739 nmethod *saved_code = CodeCache::find_and_remove_saved_code(this);
740 if (saved_code != NULL) {
741 methodHandle method(this);
742 assert( ! saved_code->is_osr_method(), "should not get here for osr" );
743 set_code( method, saved_code );
744 }
745 }
747 assert(_from_compiled_entry != NULL, "must be set");
748 return _from_compiled_entry;
749 }
751 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all
752 // (could be racing a deopt).
753 // Not inline to avoid circular ref.
754 bool methodOopDesc::check_code() const {
755 // cached in a register or local. There's a race on the value of the field.
756 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
757 return code == NULL || (code->method() == NULL) || (code->method() == (methodOop)this && !code->is_osr_method());
758 }
760 // Install compiled code. Instantly it can execute.
761 void methodOopDesc::set_code(methodHandle mh, nmethod *code) {
762 assert( code, "use clear_code to remove code" );
763 assert( mh->check_code(), "" );
765 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!");
767 // These writes must happen in this order, because the interpreter will
768 // directly jump to from_interpreted_entry which jumps to an i2c adapter
769 // which jumps to _from_compiled_entry.
770 mh->_code = code; // Assign before allowing compiled code to exec
772 int comp_level = code->comp_level();
773 // In theory there could be a race here. In practice it is unlikely
774 // and not worth worrying about.
775 if (comp_level > mh->highest_comp_level()) {
776 mh->set_highest_comp_level(comp_level);
777 }
779 OrderAccess::storestore();
780 #ifdef SHARK
781 mh->_from_interpreted_entry = code->insts_begin();
782 #else
783 mh->_from_compiled_entry = code->verified_entry_point();
784 OrderAccess::storestore();
785 // Instantly compiled code can execute.
786 mh->_from_interpreted_entry = mh->get_i2c_entry();
787 #endif // SHARK
789 }
792 bool methodOopDesc::is_overridden_in(klassOop k) const {
793 instanceKlass* ik = instanceKlass::cast(k);
795 if (ik->is_interface()) return false;
797 // If method is an interface, we skip it - except if it
798 // is a miranda method
799 if (instanceKlass::cast(method_holder())->is_interface()) {
800 // Check that method is not a miranda method
801 if (ik->lookup_method(name(), signature()) == NULL) {
802 // No implementation exist - so miranda method
803 return false;
804 }
805 return true;
806 }
808 assert(ik->is_subclass_of(method_holder()), "should be subklass");
809 assert(ik->vtable() != NULL, "vtable should exist");
810 if (vtable_index() == nonvirtual_vtable_index) {
811 return false;
812 } else {
813 methodOop vt_m = ik->method_at_vtable(vtable_index());
814 return vt_m != methodOop(this);
815 }
816 }
819 // give advice about whether this methodOop should be cached or not
820 bool methodOopDesc::should_not_be_cached() const {
821 if (is_old()) {
822 // This method has been redefined. It is either EMCP or obsolete
823 // and we don't want to cache it because that would pin the method
824 // down and prevent it from being collectible if and when it
825 // finishes executing.
826 return true;
827 }
829 if (mark()->should_not_be_cached()) {
830 // It is either not safe or not a good idea to cache this
831 // method at this time because of the state of the embedded
832 // markOop. See markOop.cpp for the gory details.
833 return true;
834 }
836 // caching this method should be just fine
837 return false;
838 }
840 bool methodOopDesc::is_method_handle_invoke_name(vmSymbols::SID name_sid) {
841 switch (name_sid) {
842 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeExact_name):
843 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeGeneric_name):
844 return true;
845 }
846 if (AllowTransitionalJSR292
847 && name_sid == vmSymbols::VM_SYMBOL_ENUM_NAME(invoke_name))
848 return true;
849 return false;
850 }
852 // Constant pool structure for invoke methods:
853 enum {
854 _imcp_invoke_name = 1, // utf8: 'invokeExact' or 'invokeGeneric'
855 _imcp_invoke_signature, // utf8: (variable symbolOop)
856 _imcp_method_type_value, // string: (variable java/dyn/MethodType, sic)
857 _imcp_limit
858 };
860 oop methodOopDesc::method_handle_type() const {
861 if (!is_method_handle_invoke()) { assert(false, "caller resp."); return NULL; }
862 oop mt = constants()->resolved_string_at(_imcp_method_type_value);
863 assert(mt->klass() == SystemDictionary::MethodType_klass(), "");
864 return mt;
865 }
867 jint* methodOopDesc::method_type_offsets_chain() {
868 static jint pchase[] = { -1, -1, -1 };
869 if (pchase[0] == -1) {
870 jint step0 = in_bytes(constants_offset());
871 jint step1 = (constantPoolOopDesc::header_size() + _imcp_method_type_value) * HeapWordSize;
872 // do this in reverse to avoid races:
873 OrderAccess::release_store(&pchase[1], step1);
874 OrderAccess::release_store(&pchase[0], step0);
875 }
876 return pchase;
877 }
879 //------------------------------------------------------------------------------
880 // methodOopDesc::is_method_handle_adapter
881 //
882 // Tests if this method is an internal adapter frame from the
883 // MethodHandleCompiler.
884 // Must be consistent with MethodHandleCompiler::get_method_oop().
885 bool methodOopDesc::is_method_handle_adapter() const {
886 if (is_synthetic() &&
887 !is_native() && // has code from MethodHandleCompiler
888 is_method_handle_invoke_name(name()) &&
889 MethodHandleCompiler::klass_is_method_handle_adapter_holder(method_holder())) {
890 assert(!is_method_handle_invoke(), "disjoint");
891 return true;
892 } else {
893 return false;
894 }
895 }
897 methodHandle methodOopDesc::make_invoke_method(KlassHandle holder,
898 symbolHandle name,
899 symbolHandle signature,
900 Handle method_type, TRAPS) {
901 methodHandle empty;
903 assert(holder() == SystemDictionary::MethodHandle_klass(),
904 "must be a JSR 292 magic type");
906 if (TraceMethodHandles) {
907 tty->print("Creating invoke method for ");
908 signature->print_value();
909 tty->cr();
910 }
912 constantPoolHandle cp;
913 {
914 constantPoolOop cp_oop = oopFactory::new_constantPool(_imcp_limit, IsSafeConc, CHECK_(empty));
915 cp = constantPoolHandle(THREAD, cp_oop);
916 }
917 cp->symbol_at_put(_imcp_invoke_name, name());
918 cp->symbol_at_put(_imcp_invoke_signature, signature());
919 cp->string_at_put(_imcp_method_type_value, vmSymbols::void_signature());
920 cp->set_pool_holder(holder());
922 // set up the fancy stuff:
923 cp->pseudo_string_at_put(_imcp_method_type_value, method_type());
924 methodHandle m;
925 {
926 int flags_bits = (JVM_MH_INVOKE_BITS | JVM_ACC_PUBLIC | JVM_ACC_FINAL);
927 methodOop m_oop = oopFactory::new_method(0, accessFlags_from(flags_bits),
928 0, 0, 0, IsSafeConc, CHECK_(empty));
929 m = methodHandle(THREAD, m_oop);
930 }
931 m->set_constants(cp());
932 m->set_name_index(_imcp_invoke_name);
933 m->set_signature_index(_imcp_invoke_signature);
934 assert(is_method_handle_invoke_name(m->name()), "");
935 assert(m->signature() == signature(), "");
936 assert(m->is_method_handle_invoke(), "");
937 #ifdef CC_INTERP
938 ResultTypeFinder rtf(signature());
939 m->set_result_index(rtf.type());
940 #endif
941 m->compute_size_of_parameters(THREAD);
942 m->set_exception_table(Universe::the_empty_int_array());
943 m->init_intrinsic_id();
944 assert(m->intrinsic_id() == vmIntrinsics::_invokeExact ||
945 m->intrinsic_id() == vmIntrinsics::_invokeGeneric, "must be an invoker");
947 // Finally, set up its entry points.
948 assert(m->method_handle_type() == method_type(), "");
949 assert(m->can_be_statically_bound(), "");
950 m->set_vtable_index(methodOopDesc::nonvirtual_vtable_index);
951 m->link_method(m, CHECK_(empty));
953 #ifdef ASSERT
954 // Make sure the pointer chase works.
955 address p = (address) m();
956 for (jint* pchase = method_type_offsets_chain(); (*pchase) != -1; pchase++) {
957 p = *(address*)(p + (*pchase));
958 }
959 assert((oop)p == method_type(), "pointer chase is correct");
960 #endif
962 if (TraceMethodHandles && (Verbose || WizardMode))
963 m->print_on(tty);
965 return m;
966 }
970 methodHandle methodOopDesc:: clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length,
971 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) {
972 // Code below does not work for native methods - they should never get rewritten anyway
973 assert(!m->is_native(), "cannot rewrite native methods");
974 // Allocate new methodOop
975 AccessFlags flags = m->access_flags();
976 int checked_exceptions_len = m->checked_exceptions_length();
977 int localvariable_len = m->localvariable_table_length();
978 // Allocate newm_oop with the is_conc_safe parameter set
979 // to IsUnsafeConc to indicate that newm_oop is not yet
980 // safe for concurrent processing by a GC.
981 methodOop newm_oop = oopFactory::new_method(new_code_length,
982 flags,
983 new_compressed_linenumber_size,
984 localvariable_len,
985 checked_exceptions_len,
986 IsUnsafeConc,
987 CHECK_(methodHandle()));
988 methodHandle newm (THREAD, newm_oop);
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 int new_const_method_size = newm->constMethod()->object_size();
994 memcpy(newm(), m(), sizeof(methodOopDesc));
995 // Create shallow copy of constMethodOopDesc, but be careful to preserve the methodOop
996 // is_conc_safe is set to false because that is the value of
997 // is_conc_safe initialzied into newcm and the copy should
998 // not overwrite that value. During the window during which it is
999 // tagged as unsafe, some extra work could be needed during precleaning
1000 // or concurrent marking but those phases will be correct. Setting and
1001 // resetting is done in preference to a careful copying into newcm to
1002 // avoid having to know the precise layout of a constMethodOop.
1003 m->constMethod()->set_is_conc_safe(false);
1004 memcpy(newcm, m->constMethod(), sizeof(constMethodOopDesc));
1005 m->constMethod()->set_is_conc_safe(true);
1006 // Reset correct method/const method, method size, and parameter info
1007 newcm->set_method(newm());
1008 newm->set_constMethod(newcm);
1009 assert(newcm->method() == newm(), "check");
1010 newm->constMethod()->set_code_size(new_code_length);
1011 newm->constMethod()->set_constMethod_size(new_const_method_size);
1012 newm->set_method_size(new_method_size);
1013 assert(newm->code_size() == new_code_length, "check");
1014 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check");
1015 assert(newm->localvariable_table_length() == localvariable_len, "check");
1016 // Copy new byte codes
1017 memcpy(newm->code_base(), new_code, new_code_length);
1018 // Copy line number table
1019 if (new_compressed_linenumber_size > 0) {
1020 memcpy(newm->compressed_linenumber_table(),
1021 new_compressed_linenumber_table,
1022 new_compressed_linenumber_size);
1023 }
1024 // Copy checked_exceptions
1025 if (checked_exceptions_len > 0) {
1026 memcpy(newm->checked_exceptions_start(),
1027 m->checked_exceptions_start(),
1028 checked_exceptions_len * sizeof(CheckedExceptionElement));
1029 }
1030 // Copy local variable number table
1031 if (localvariable_len > 0) {
1032 memcpy(newm->localvariable_table_start(),
1033 m->localvariable_table_start(),
1034 localvariable_len * sizeof(LocalVariableTableElement));
1035 }
1037 // Only set is_conc_safe to true when changes to newcm are
1038 // complete.
1039 newcm->set_is_conc_safe(true);
1040 return newm;
1041 }
1043 vmSymbols::SID methodOopDesc::klass_id_for_intrinsics(klassOop holder) {
1044 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics
1045 // because we are not loading from core libraries
1046 if (instanceKlass::cast(holder)->class_loader() != NULL)
1047 return vmSymbols::NO_SID; // regardless of name, no intrinsics here
1049 // see if the klass name is well-known:
1050 symbolOop klass_name = instanceKlass::cast(holder)->name();
1051 return vmSymbols::find_sid(klass_name);
1052 }
1054 void methodOopDesc::init_intrinsic_id() {
1055 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once");
1056 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte));
1057 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size");
1058 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), "");
1060 // the klass name is well-known:
1061 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder());
1062 assert(klass_id != vmSymbols::NO_SID, "caller responsibility");
1064 // ditto for method and signature:
1065 vmSymbols::SID name_id = vmSymbols::find_sid(name());
1066 if (name_id == vmSymbols::NO_SID) return;
1067 vmSymbols::SID sig_id = vmSymbols::find_sid(signature());
1068 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_dyn_MethodHandle)
1069 && sig_id == vmSymbols::NO_SID) return;
1070 jshort flags = access_flags().as_short();
1072 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1073 if (id != vmIntrinsics::_none) {
1074 set_intrinsic_id(id);
1075 return;
1076 }
1078 // A few slightly irregular cases:
1079 switch (klass_id) {
1080 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath):
1081 // Second chance: check in regular Math.
1082 switch (name_id) {
1083 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name):
1084 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name):
1085 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name):
1086 // pretend it is the corresponding method in the non-strict class:
1087 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math);
1088 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1089 break;
1090 }
1091 break;
1093 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*.
1094 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_dyn_MethodHandle):
1095 if (is_static() || !is_native()) break;
1096 switch (name_id) {
1097 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeGeneric_name):
1098 id = vmIntrinsics::_invokeGeneric;
1099 break;
1100 case vmSymbols::VM_SYMBOL_ENUM_NAME(invokeExact_name):
1101 id = vmIntrinsics::_invokeExact;
1102 break;
1103 case vmSymbols::VM_SYMBOL_ENUM_NAME(invoke_name):
1104 if (AllowTransitionalJSR292) id = vmIntrinsics::_invokeExact;
1105 break;
1106 }
1107 break;
1108 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_dyn_InvokeDynamic):
1109 if (!is_static() || !is_native()) break;
1110 id = vmIntrinsics::_invokeDynamic;
1111 break;
1112 }
1114 if (id != vmIntrinsics::_none) {
1115 // Set up its iid. It is an alias method.
1116 set_intrinsic_id(id);
1117 return;
1118 }
1119 }
1121 // These two methods are static since a GC may move the methodOopDesc
1122 bool methodOopDesc::load_signature_classes(methodHandle m, TRAPS) {
1123 bool sig_is_loaded = true;
1124 Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader());
1125 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1126 symbolHandle signature(THREAD, m->signature());
1127 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1128 if (ss.is_object()) {
1129 symbolOop sym = ss.as_symbol(CHECK_(false));
1130 symbolHandle name (THREAD, sym);
1131 klassOop klass = SystemDictionary::resolve_or_null(name, class_loader,
1132 protection_domain, THREAD);
1133 // We are loading classes eagerly. If a ClassNotFoundException or
1134 // a LinkageError was generated, be sure to ignore it.
1135 if (HAS_PENDING_EXCEPTION) {
1136 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) ||
1137 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) {
1138 CLEAR_PENDING_EXCEPTION;
1139 } else {
1140 return false;
1141 }
1142 }
1143 if( klass == NULL) { sig_is_loaded = false; }
1144 }
1145 }
1146 return sig_is_loaded;
1147 }
1149 bool methodOopDesc::has_unloaded_classes_in_signature(methodHandle m, TRAPS) {
1150 Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader());
1151 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1152 symbolHandle signature(THREAD, m->signature());
1153 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1154 if (ss.type() == T_OBJECT) {
1155 symbolHandle name(THREAD, ss.as_symbol_or_null());
1156 if (name() == NULL) return true;
1157 klassOop klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD);
1158 if (klass == NULL) return true;
1159 }
1160 }
1161 return false;
1162 }
1164 // Exposed so field engineers can debug VM
1165 void methodOopDesc::print_short_name(outputStream* st) {
1166 ResourceMark rm;
1167 #ifdef PRODUCT
1168 st->print(" %s::", method_holder()->klass_part()->external_name());
1169 #else
1170 st->print(" %s::", method_holder()->klass_part()->internal_name());
1171 #endif
1172 name()->print_symbol_on(st);
1173 if (WizardMode) signature()->print_symbol_on(st);
1174 }
1177 extern "C" {
1178 static int method_compare(methodOop* a, methodOop* b) {
1179 return (*a)->name()->fast_compare((*b)->name());
1180 }
1182 // Prevent qsort from reordering a previous valid sort by
1183 // considering the address of the methodOops if two methods
1184 // would otherwise compare as equal. Required to preserve
1185 // optimal access order in the shared archive. Slower than
1186 // method_compare, only used for shared archive creation.
1187 static int method_compare_idempotent(methodOop* a, methodOop* b) {
1188 int i = method_compare(a, b);
1189 if (i != 0) return i;
1190 return ( a < b ? -1 : (a == b ? 0 : 1));
1191 }
1193 // We implement special compare versions for narrow oops to avoid
1194 // testing for UseCompressedOops on every comparison.
1195 static int method_compare_narrow(narrowOop* a, narrowOop* b) {
1196 methodOop m = (methodOop)oopDesc::load_decode_heap_oop(a);
1197 methodOop n = (methodOop)oopDesc::load_decode_heap_oop(b);
1198 return m->name()->fast_compare(n->name());
1199 }
1201 static int method_compare_narrow_idempotent(narrowOop* a, narrowOop* b) {
1202 int i = method_compare_narrow(a, b);
1203 if (i != 0) return i;
1204 return ( a < b ? -1 : (a == b ? 0 : 1));
1205 }
1207 typedef int (*compareFn)(const void*, const void*);
1208 }
1211 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1212 static void reorder_based_on_method_index(objArrayOop methods,
1213 objArrayOop annotations,
1214 GrowableArray<oop>* temp_array) {
1215 if (annotations == NULL) {
1216 return;
1217 }
1219 int length = methods->length();
1220 int i;
1221 // Copy to temp array
1222 temp_array->clear();
1223 for (i = 0; i < length; i++) {
1224 temp_array->append(annotations->obj_at(i));
1225 }
1227 // Copy back using old method indices
1228 for (i = 0; i < length; i++) {
1229 methodOop m = (methodOop) methods->obj_at(i);
1230 annotations->obj_at_put(i, temp_array->at(m->method_idnum()));
1231 }
1232 }
1235 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1236 void methodOopDesc::sort_methods(objArrayOop methods,
1237 objArrayOop methods_annotations,
1238 objArrayOop methods_parameter_annotations,
1239 objArrayOop methods_default_annotations,
1240 bool idempotent) {
1241 int length = methods->length();
1242 if (length > 1) {
1243 bool do_annotations = false;
1244 if (methods_annotations != NULL ||
1245 methods_parameter_annotations != NULL ||
1246 methods_default_annotations != NULL) {
1247 do_annotations = true;
1248 }
1249 if (do_annotations) {
1250 // Remember current method ordering so we can reorder annotations
1251 for (int i = 0; i < length; i++) {
1252 methodOop m = (methodOop) methods->obj_at(i);
1253 m->set_method_idnum(i);
1254 }
1255 }
1257 // Use a simple bubble sort for small number of methods since
1258 // qsort requires a functional pointer call for each comparison.
1259 if (length < 8) {
1260 bool sorted = true;
1261 for (int i=length-1; i>0; i--) {
1262 for (int j=0; j<i; j++) {
1263 methodOop m1 = (methodOop)methods->obj_at(j);
1264 methodOop m2 = (methodOop)methods->obj_at(j+1);
1265 if ((uintptr_t)m1->name() > (uintptr_t)m2->name()) {
1266 methods->obj_at_put(j, m2);
1267 methods->obj_at_put(j+1, m1);
1268 sorted = false;
1269 }
1270 }
1271 if (sorted) break;
1272 sorted = true;
1273 }
1274 } else {
1275 compareFn compare =
1276 (UseCompressedOops ?
1277 (compareFn) (idempotent ? method_compare_narrow_idempotent : method_compare_narrow):
1278 (compareFn) (idempotent ? method_compare_idempotent : method_compare));
1279 qsort(methods->base(), length, heapOopSize, compare);
1280 }
1282 // Sort annotations if necessary
1283 assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), "");
1284 assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), "");
1285 assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), "");
1286 if (do_annotations) {
1287 ResourceMark rm;
1288 // Allocate temporary storage
1289 GrowableArray<oop>* temp_array = new GrowableArray<oop>(length);
1290 reorder_based_on_method_index(methods, methods_annotations, temp_array);
1291 reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array);
1292 reorder_based_on_method_index(methods, methods_default_annotations, temp_array);
1293 }
1295 // Reset method ordering
1296 for (int i = 0; i < length; i++) {
1297 methodOop m = (methodOop) methods->obj_at(i);
1298 m->set_method_idnum(i);
1299 }
1300 }
1301 }
1304 //-----------------------------------------------------------------------------------
1305 // Non-product code
1307 #ifndef PRODUCT
1308 class SignatureTypePrinter : public SignatureTypeNames {
1309 private:
1310 outputStream* _st;
1311 bool _use_separator;
1313 void type_name(const char* name) {
1314 if (_use_separator) _st->print(", ");
1315 _st->print(name);
1316 _use_separator = true;
1317 }
1319 public:
1320 SignatureTypePrinter(symbolHandle signature, outputStream* st) : SignatureTypeNames(signature) {
1321 _st = st;
1322 _use_separator = false;
1323 }
1325 void print_parameters() { _use_separator = false; iterate_parameters(); }
1326 void print_returntype() { _use_separator = false; iterate_returntype(); }
1327 };
1330 void methodOopDesc::print_name(outputStream* st) {
1331 Thread *thread = Thread::current();
1332 ResourceMark rm(thread);
1333 SignatureTypePrinter sig(signature(), st);
1334 st->print("%s ", is_static() ? "static" : "virtual");
1335 sig.print_returntype();
1336 st->print(" %s.", method_holder()->klass_part()->internal_name());
1337 name()->print_symbol_on(st);
1338 st->print("(");
1339 sig.print_parameters();
1340 st->print(")");
1341 }
1344 void methodOopDesc::print_codes_on(outputStream* st) const {
1345 print_codes_on(0, code_size(), st);
1346 }
1348 void methodOopDesc::print_codes_on(int from, int to, outputStream* st) const {
1349 Thread *thread = Thread::current();
1350 ResourceMark rm(thread);
1351 methodHandle mh (thread, (methodOop)this);
1352 BytecodeStream s(mh);
1353 s.set_interval(from, to);
1354 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
1355 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1356 }
1357 #endif // not PRODUCT
1360 // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas
1361 // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned)
1362 // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used
1363 // as end-of-stream terminator.
1365 void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) {
1366 // bci and line number does not compress into single byte.
1367 // Write out escape character and use regular compression for bci and line number.
1368 write_byte((jubyte)0xFF);
1369 write_signed_int(bci_delta);
1370 write_signed_int(line_delta);
1371 }
1373 // See comment in methodOop.hpp which explains why this exists.
1374 #if defined(_M_AMD64) && MSC_VER >= 1400
1375 #pragma optimize("", off)
1376 void CompressedLineNumberWriteStream::write_pair(int bci, int line) {
1377 write_pair_inline(bci, line);
1378 }
1379 #pragma optimize("", on)
1380 #endif
1382 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) {
1383 _bci = 0;
1384 _line = 0;
1385 };
1388 bool CompressedLineNumberReadStream::read_pair() {
1389 jubyte next = read_byte();
1390 // Check for terminator
1391 if (next == 0) return false;
1392 if (next == 0xFF) {
1393 // Escape character, regular compression used
1394 _bci += read_signed_int();
1395 _line += read_signed_int();
1396 } else {
1397 // Single byte compression used
1398 _bci += next >> 3;
1399 _line += next & 0x7;
1400 }
1401 return true;
1402 }
1405 Bytecodes::Code methodOopDesc::orig_bytecode_at(int bci) const {
1406 BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints();
1407 for (; bp != NULL; bp = bp->next()) {
1408 if (bp->match(this, bci)) {
1409 return bp->orig_bytecode();
1410 }
1411 }
1412 ShouldNotReachHere();
1413 return Bytecodes::_shouldnotreachhere;
1414 }
1416 void methodOopDesc::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
1417 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
1418 BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints();
1419 for (; bp != NULL; bp = bp->next()) {
1420 if (bp->match(this, bci)) {
1421 bp->set_orig_bytecode(code);
1422 // and continue, in case there is more than one
1423 }
1424 }
1425 }
1427 void methodOopDesc::set_breakpoint(int bci) {
1428 instanceKlass* ik = instanceKlass::cast(method_holder());
1429 BreakpointInfo *bp = new BreakpointInfo(this, bci);
1430 bp->set_next(ik->breakpoints());
1431 ik->set_breakpoints(bp);
1432 // do this last:
1433 bp->set(this);
1434 }
1436 static void clear_matches(methodOop m, int bci) {
1437 instanceKlass* ik = instanceKlass::cast(m->method_holder());
1438 BreakpointInfo* prev_bp = NULL;
1439 BreakpointInfo* next_bp;
1440 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
1441 next_bp = bp->next();
1442 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint).
1443 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) {
1444 // do this first:
1445 bp->clear(m);
1446 // unhook it
1447 if (prev_bp != NULL)
1448 prev_bp->set_next(next_bp);
1449 else
1450 ik->set_breakpoints(next_bp);
1451 delete bp;
1452 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods
1453 // at same location. So we have multiple matching (method_index and bci)
1454 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one
1455 // breakpoint for clear_breakpoint request and keep all other method versions
1456 // BreakpointInfo for future clear_breakpoint request.
1457 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints)
1458 // which is being called when class is unloaded. We delete all the Breakpoint
1459 // information for all versions of method. We may not correctly restore the original
1460 // bytecode in all method versions, but that is ok. Because the class is being unloaded
1461 // so these methods won't be used anymore.
1462 if (bci >= 0) {
1463 break;
1464 }
1465 } else {
1466 // This one is a keeper.
1467 prev_bp = bp;
1468 }
1469 }
1470 }
1472 void methodOopDesc::clear_breakpoint(int bci) {
1473 assert(bci >= 0, "");
1474 clear_matches(this, bci);
1475 }
1477 void methodOopDesc::clear_all_breakpoints() {
1478 clear_matches(this, -1);
1479 }
1482 int methodOopDesc::invocation_count() {
1483 if (TieredCompilation) {
1484 const methodDataOop mdo = method_data();
1485 if (invocation_counter()->carry() || ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) {
1486 return InvocationCounter::count_limit;
1487 } else {
1488 return invocation_counter()->count() + ((mdo != NULL) ? mdo->invocation_counter()->count() : 0);
1489 }
1490 } else {
1491 return invocation_counter()->count();
1492 }
1493 }
1495 int methodOopDesc::backedge_count() {
1496 if (TieredCompilation) {
1497 const methodDataOop mdo = method_data();
1498 if (backedge_counter()->carry() || ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) {
1499 return InvocationCounter::count_limit;
1500 } else {
1501 return backedge_counter()->count() + ((mdo != NULL) ? mdo->backedge_counter()->count() : 0);
1502 }
1503 } else {
1504 return backedge_counter()->count();
1505 }
1506 }
1508 int methodOopDesc::highest_comp_level() const {
1509 methodDataOop mdo = method_data();
1510 if (mdo != NULL) {
1511 return mdo->highest_comp_level();
1512 } else {
1513 return CompLevel_none;
1514 }
1515 }
1517 int methodOopDesc::highest_osr_comp_level() const {
1518 methodDataOop mdo = method_data();
1519 if (mdo != NULL) {
1520 return mdo->highest_osr_comp_level();
1521 } else {
1522 return CompLevel_none;
1523 }
1524 }
1526 void methodOopDesc::set_highest_comp_level(int level) {
1527 methodDataOop mdo = method_data();
1528 if (mdo != NULL) {
1529 mdo->set_highest_comp_level(level);
1530 }
1531 }
1533 void methodOopDesc::set_highest_osr_comp_level(int level) {
1534 methodDataOop mdo = method_data();
1535 if (mdo != NULL) {
1536 mdo->set_highest_osr_comp_level(level);
1537 }
1538 }
1540 BreakpointInfo::BreakpointInfo(methodOop m, int bci) {
1541 _bci = bci;
1542 _name_index = m->name_index();
1543 _signature_index = m->signature_index();
1544 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci);
1545 if (_orig_bytecode == Bytecodes::_breakpoint)
1546 _orig_bytecode = m->orig_bytecode_at(_bci);
1547 _next = NULL;
1548 }
1550 void BreakpointInfo::set(methodOop method) {
1551 #ifdef ASSERT
1552 {
1553 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci);
1554 if (code == Bytecodes::_breakpoint)
1555 code = method->orig_bytecode_at(_bci);
1556 assert(orig_bytecode() == code, "original bytecode must be the same");
1557 }
1558 #endif
1559 *method->bcp_from(_bci) = Bytecodes::_breakpoint;
1560 method->incr_number_of_breakpoints();
1561 SystemDictionary::notice_modification();
1562 {
1563 // Deoptimize all dependents on this method
1564 Thread *thread = Thread::current();
1565 HandleMark hm(thread);
1566 methodHandle mh(thread, method);
1567 Universe::flush_dependents_on_method(mh);
1568 }
1569 }
1571 void BreakpointInfo::clear(methodOop method) {
1572 *method->bcp_from(_bci) = orig_bytecode();
1573 assert(method->number_of_breakpoints() > 0, "must not go negative");
1574 method->decr_number_of_breakpoints();
1575 }