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