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