1 /*
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "code/codeCache.hpp"
27 #include "code/compiledIC.hpp"
28 #include "code/dependencies.hpp"
29 #include "code/nmethod.hpp"
30 #include "code/scopeDesc.hpp"
31 #include "compiler/abstractCompiler.hpp"
32 #include "compiler/compileBroker.hpp"
33 #include "compiler/compileLog.hpp"
34 #include "compiler/compilerOracle.hpp"
35 #include "compiler/disassembler.hpp"
36 #include "interpreter/bytecode.hpp"
37 #include "oops/methodDataOop.hpp"
38 #include "prims/jvmtiRedefineClassesTrace.hpp"
39 #include "prims/jvmtiImpl.hpp"
40 #include "runtime/sharedRuntime.hpp"
41 #include "runtime/sweeper.hpp"
42 #include "utilities/dtrace.hpp"
43 #include "utilities/events.hpp"
44 #include "utilities/xmlstream.hpp"
45 #ifdef SHARK
46 #include "shark/sharkCompiler.hpp"
47 #endif
48
49 #ifdef DTRACE_ENABLED
50
51 // Only bother with this argument setup if dtrace is available
52
53 #ifndef USDT2
54 HS_DTRACE_PROBE_DECL8(hotspot, compiled__method__load,
55 const char*, int, const char*, int, const char*, int, void*, size_t);
56
57 HS_DTRACE_PROBE_DECL6(hotspot, compiled__method__unload,
58 char*, int, char*, int, char*, int);
59
60 #define DTRACE_METHOD_UNLOAD_PROBE(method) \
61 { \
62 methodOop m = (method); \
63 if (m != NULL) { \
64 Symbol* klass_name = m->klass_name(); \
65 Symbol* name = m->name(); \
66 Symbol* signature = m->signature(); \
67 HS_DTRACE_PROBE6(hotspot, compiled__method__unload, \
68 klass_name->bytes(), klass_name->utf8_length(), \
69 name->bytes(), name->utf8_length(), \
70 signature->bytes(), signature->utf8_length()); \
71 } \
72 }
73 #else /* USDT2 */
74 #define DTRACE_METHOD_UNLOAD_PROBE(method) \
75 { \
76 methodOop m = (method); \
77 if (m != NULL) { \
78 Symbol* klass_name = m->klass_name(); \
79 Symbol* name = m->name(); \
80 Symbol* signature = m->signature(); \
81 HOTSPOT_COMPILED_METHOD_UNLOAD( \
82 (char *) klass_name->bytes(), klass_name->utf8_length(), \
83 (char *) name->bytes(), name->utf8_length(), \
84 (char *) signature->bytes(), signature->utf8_length()); \
85 } \
86 }
87 #endif /* USDT2 */
88
89 #else // ndef DTRACE_ENABLED
90
91 #define DTRACE_METHOD_UNLOAD_PROBE(method)
92
93 #endif
94
95 bool nmethod::is_compiled_by_c1() const {
96 if (compiler() == NULL || method() == NULL) return false; // can happen during debug printing
97 if (is_native_method()) return false;
98 return compiler()->is_c1();
99 }
100 bool nmethod::is_compiled_by_c2() const {
101 if (compiler() == NULL || method() == NULL) return false; // can happen during debug printing
102 if (is_native_method()) return false;
103 return compiler()->is_c2();
104 }
105 bool nmethod::is_compiled_by_shark() const {
106 if (is_native_method()) return false;
107 assert(compiler() != NULL, "must be");
108 return compiler()->is_shark();
109 }
110
111
112
113 //---------------------------------------------------------------------------------
114 // NMethod statistics
115 // They are printed under various flags, including:
116 // PrintC1Statistics, PrintOptoStatistics, LogVMOutput, and LogCompilation.
117 // (In the latter two cases, they like other stats are printed to the log only.)
118
119 #ifndef PRODUCT
120 // These variables are put into one block to reduce relocations
121 // and make it simpler to print from the debugger.
122 static
123 struct nmethod_stats_struct {
124 int nmethod_count;
125 int total_size;
126 int relocation_size;
127 int consts_size;
128 int insts_size;
129 int stub_size;
130 int scopes_data_size;
131 int scopes_pcs_size;
132 int dependencies_size;
133 int handler_table_size;
134 int nul_chk_table_size;
135 int oops_size;
136
137 void note_nmethod(nmethod* nm) {
138 nmethod_count += 1;
139 total_size += nm->size();
140 relocation_size += nm->relocation_size();
141 consts_size += nm->consts_size();
142 insts_size += nm->insts_size();
143 stub_size += nm->stub_size();
144 oops_size += nm->oops_size();
145 scopes_data_size += nm->scopes_data_size();
146 scopes_pcs_size += nm->scopes_pcs_size();
147 dependencies_size += nm->dependencies_size();
148 handler_table_size += nm->handler_table_size();
149 nul_chk_table_size += nm->nul_chk_table_size();
150 }
151 void print_nmethod_stats() {
152 if (nmethod_count == 0) return;
153 tty->print_cr("Statistics for %d bytecoded nmethods:", nmethod_count);
154 if (total_size != 0) tty->print_cr(" total in heap = %d", total_size);
155 if (relocation_size != 0) tty->print_cr(" relocation = %d", relocation_size);
156 if (consts_size != 0) tty->print_cr(" constants = %d", consts_size);
157 if (insts_size != 0) tty->print_cr(" main code = %d", insts_size);
158 if (stub_size != 0) tty->print_cr(" stub code = %d", stub_size);
159 if (oops_size != 0) tty->print_cr(" oops = %d", oops_size);
160 if (scopes_data_size != 0) tty->print_cr(" scopes data = %d", scopes_data_size);
161 if (scopes_pcs_size != 0) tty->print_cr(" scopes pcs = %d", scopes_pcs_size);
162 if (dependencies_size != 0) tty->print_cr(" dependencies = %d", dependencies_size);
163 if (handler_table_size != 0) tty->print_cr(" handler table = %d", handler_table_size);
164 if (nul_chk_table_size != 0) tty->print_cr(" nul chk table = %d", nul_chk_table_size);
165 }
166
167 int native_nmethod_count;
168 int native_total_size;
169 int native_relocation_size;
170 int native_insts_size;
171 int native_oops_size;
172 void note_native_nmethod(nmethod* nm) {
173 native_nmethod_count += 1;
174 native_total_size += nm->size();
175 native_relocation_size += nm->relocation_size();
176 native_insts_size += nm->insts_size();
177 native_oops_size += nm->oops_size();
178 }
179 void print_native_nmethod_stats() {
180 if (native_nmethod_count == 0) return;
181 tty->print_cr("Statistics for %d native nmethods:", native_nmethod_count);
182 if (native_total_size != 0) tty->print_cr(" N. total size = %d", native_total_size);
183 if (native_relocation_size != 0) tty->print_cr(" N. relocation = %d", native_relocation_size);
184 if (native_insts_size != 0) tty->print_cr(" N. main code = %d", native_insts_size);
185 if (native_oops_size != 0) tty->print_cr(" N. oops = %d", native_oops_size);
186 }
187
188 int pc_desc_resets; // number of resets (= number of caches)
189 int pc_desc_queries; // queries to nmethod::find_pc_desc
190 int pc_desc_approx; // number of those which have approximate true
191 int pc_desc_repeats; // number of _pc_descs[0] hits
192 int pc_desc_hits; // number of LRU cache hits
193 int pc_desc_tests; // total number of PcDesc examinations
194 int pc_desc_searches; // total number of quasi-binary search steps
195 int pc_desc_adds; // number of LUR cache insertions
196
197 void print_pc_stats() {
198 tty->print_cr("PcDesc Statistics: %d queries, %.2f comparisons per query",
199 pc_desc_queries,
200 (double)(pc_desc_tests + pc_desc_searches)
201 / pc_desc_queries);
202 tty->print_cr(" caches=%d queries=%d/%d, hits=%d+%d, tests=%d+%d, adds=%d",
203 pc_desc_resets,
204 pc_desc_queries, pc_desc_approx,
205 pc_desc_repeats, pc_desc_hits,
206 pc_desc_tests, pc_desc_searches, pc_desc_adds);
207 }
208 } nmethod_stats;
209 #endif //PRODUCT
210
211
212 //---------------------------------------------------------------------------------
213
214
215 ExceptionCache::ExceptionCache(Handle exception, address pc, address handler) {
216 assert(pc != NULL, "Must be non null");
217 assert(exception.not_null(), "Must be non null");
218 assert(handler != NULL, "Must be non null");
219
220 _count = 0;
221 _exception_type = exception->klass();
222 _next = NULL;
223
224 add_address_and_handler(pc,handler);
225 }
226
227
228 address ExceptionCache::match(Handle exception, address pc) {
229 assert(pc != NULL,"Must be non null");
230 assert(exception.not_null(),"Must be non null");
231 if (exception->klass() == exception_type()) {
232 return (test_address(pc));
233 }
234
235 return NULL;
236 }
237
238
239 bool ExceptionCache::match_exception_with_space(Handle exception) {
240 assert(exception.not_null(),"Must be non null");
241 if (exception->klass() == exception_type() && count() < cache_size) {
242 return true;
243 }
244 return false;
245 }
246
247
248 address ExceptionCache::test_address(address addr) {
249 for (int i=0; i<count(); i++) {
250 if (pc_at(i) == addr) {
251 return handler_at(i);
252 }
253 }
254 return NULL;
255 }
256
257
258 bool ExceptionCache::add_address_and_handler(address addr, address handler) {
259 if (test_address(addr) == handler) return true;
260 if (count() < cache_size) {
261 set_pc_at(count(),addr);
262 set_handler_at(count(), handler);
263 increment_count();
264 return true;
265 }
266 return false;
267 }
268
269
270 // private method for handling exception cache
271 // These methods are private, and used to manipulate the exception cache
272 // directly.
273 ExceptionCache* nmethod::exception_cache_entry_for_exception(Handle exception) {
274 ExceptionCache* ec = exception_cache();
275 while (ec != NULL) {
276 if (ec->match_exception_with_space(exception)) {
277 return ec;
278 }
279 ec = ec->next();
280 }
281 return NULL;
282 }
283
284
285 //-----------------------------------------------------------------------------
286
287
288 // Helper used by both find_pc_desc methods.
289 static inline bool match_desc(PcDesc* pc, int pc_offset, bool approximate) {
290 NOT_PRODUCT(++nmethod_stats.pc_desc_tests);
291 if (!approximate)
292 return pc->pc_offset() == pc_offset;
293 else
294 return (pc-1)->pc_offset() < pc_offset && pc_offset <= pc->pc_offset();
295 }
296
297 void PcDescCache::reset_to(PcDesc* initial_pc_desc) {
298 if (initial_pc_desc == NULL) {
299 _pc_descs[0] = NULL; // native method; no PcDescs at all
300 return;
301 }
302 NOT_PRODUCT(++nmethod_stats.pc_desc_resets);
303 // reset the cache by filling it with benign (non-null) values
304 assert(initial_pc_desc->pc_offset() < 0, "must be sentinel");
305 for (int i = 0; i < cache_size; i++)
306 _pc_descs[i] = initial_pc_desc;
307 }
308
309 PcDesc* PcDescCache::find_pc_desc(int pc_offset, bool approximate) {
310 NOT_PRODUCT(++nmethod_stats.pc_desc_queries);
311 NOT_PRODUCT(if (approximate) ++nmethod_stats.pc_desc_approx);
312
313 // Note: one might think that caching the most recently
314 // read value separately would be a win, but one would be
315 // wrong. When many threads are updating it, the cache
316 // line it's in would bounce between caches, negating
317 // any benefit.
318
319 // In order to prevent race conditions do not load cache elements
320 // repeatedly, but use a local copy:
321 PcDesc* res;
322
323 // Step one: Check the most recently added value.
324 res = _pc_descs[0];
325 if (res == NULL) return NULL; // native method; no PcDescs at all
326 if (match_desc(res, pc_offset, approximate)) {
327 NOT_PRODUCT(++nmethod_stats.pc_desc_repeats);
328 return res;
329 }
330
331 // Step two: Check the rest of the LRU cache.
332 for (int i = 1; i < cache_size; ++i) {
333 res = _pc_descs[i];
334 if (res->pc_offset() < 0) break; // optimization: skip empty cache
335 if (match_desc(res, pc_offset, approximate)) {
336 NOT_PRODUCT(++nmethod_stats.pc_desc_hits);
337 return res;
338 }
339 }
340
341 // Report failure.
342 return NULL;
343 }
344
345 void PcDescCache::add_pc_desc(PcDesc* pc_desc) {
346 NOT_PRODUCT(++nmethod_stats.pc_desc_adds);
347 // Update the LRU cache by shifting pc_desc forward.
348 for (int i = 0; i < cache_size; i++) {
349 PcDesc* next = _pc_descs[i];
350 _pc_descs[i] = pc_desc;
351 pc_desc = next;
352 }
353 }
354
355 // adjust pcs_size so that it is a multiple of both oopSize and
356 // sizeof(PcDesc) (assumes that if sizeof(PcDesc) is not a multiple
357 // of oopSize, then 2*sizeof(PcDesc) is)
358 static int adjust_pcs_size(int pcs_size) {
359 int nsize = round_to(pcs_size, oopSize);
360 if ((nsize % sizeof(PcDesc)) != 0) {
361 nsize = pcs_size + sizeof(PcDesc);
362 }
363 assert((nsize % oopSize) == 0, "correct alignment");
364 return nsize;
365 }
366
367 //-----------------------------------------------------------------------------
368
369
370 void nmethod::add_exception_cache_entry(ExceptionCache* new_entry) {
371 assert(ExceptionCache_lock->owned_by_self(),"Must hold the ExceptionCache_lock");
372 assert(new_entry != NULL,"Must be non null");
373 assert(new_entry->next() == NULL, "Must be null");
374
375 if (exception_cache() != NULL) {
376 new_entry->set_next(exception_cache());
377 }
378 set_exception_cache(new_entry);
379 }
380
381 void nmethod::remove_from_exception_cache(ExceptionCache* ec) {
382 ExceptionCache* prev = NULL;
383 ExceptionCache* curr = exception_cache();
384 assert(curr != NULL, "nothing to remove");
385 // find the previous and next entry of ec
386 while (curr != ec) {
387 prev = curr;
388 curr = curr->next();
389 assert(curr != NULL, "ExceptionCache not found");
390 }
391 // now: curr == ec
392 ExceptionCache* next = curr->next();
393 if (prev == NULL) {
394 set_exception_cache(next);
395 } else {
396 prev->set_next(next);
397 }
398 delete curr;
399 }
400
401
402 // public method for accessing the exception cache
403 // These are the public access methods.
404 address nmethod::handler_for_exception_and_pc(Handle exception, address pc) {
405 // We never grab a lock to read the exception cache, so we may
406 // have false negatives. This is okay, as it can only happen during
407 // the first few exception lookups for a given nmethod.
408 ExceptionCache* ec = exception_cache();
409 while (ec != NULL) {
410 address ret_val;
411 if ((ret_val = ec->match(exception,pc)) != NULL) {
412 return ret_val;
413 }
414 ec = ec->next();
415 }
416 return NULL;
417 }
418
419
420 void nmethod::add_handler_for_exception_and_pc(Handle exception, address pc, address handler) {
421 // There are potential race conditions during exception cache updates, so we
422 // must own the ExceptionCache_lock before doing ANY modifications. Because
423 // we don't lock during reads, it is possible to have several threads attempt
424 // to update the cache with the same data. We need to check for already inserted
425 // copies of the current data before adding it.
426
427 MutexLocker ml(ExceptionCache_lock);
428 ExceptionCache* target_entry = exception_cache_entry_for_exception(exception);
429
430 if (target_entry == NULL || !target_entry->add_address_and_handler(pc,handler)) {
431 target_entry = new ExceptionCache(exception,pc,handler);
432 add_exception_cache_entry(target_entry);
433 }
434 }
435
436
437 //-------------end of code for ExceptionCache--------------
438
439
440 int nmethod::total_size() const {
441 return
442 consts_size() +
443 insts_size() +
444 stub_size() +
445 scopes_data_size() +
446 scopes_pcs_size() +
447 handler_table_size() +
448 nul_chk_table_size();
449 }
450
451 const char* nmethod::compile_kind() const {
452 if (is_osr_method()) return "osr";
453 if (method() != NULL && is_native_method()) return "c2n";
454 return NULL;
455 }
456
457 // Fill in default values for various flag fields
458 void nmethod::init_defaults() {
459 _state = alive;
460 _marked_for_reclamation = 0;
461 _has_flushed_dependencies = 0;
462 _speculatively_disconnected = 0;
463 _has_unsafe_access = 0;
464 _has_method_handle_invokes = 0;
465 _lazy_critical_native = 0;
466 _marked_for_deoptimization = 0;
467 _lock_count = 0;
468 _stack_traversal_mark = 0;
469 _unload_reported = false; // jvmti state
470
471 #ifdef ASSERT
472 _oops_are_stale = false;
473 #endif
474
475 _oops_do_mark_link = NULL;
476 _jmethod_id = NULL;
477 _osr_link = NULL;
478 _scavenge_root_link = NULL;
479 _scavenge_root_state = 0;
480 _saved_nmethod_link = NULL;
481 _compiler = NULL;
482
483 #ifdef HAVE_DTRACE_H
484 _trap_offset = 0;
485 #endif // def HAVE_DTRACE_H
486 }
487
488
489 nmethod* nmethod::new_native_nmethod(methodHandle method,
490 int compile_id,
491 CodeBuffer *code_buffer,
492 int vep_offset,
493 int frame_complete,
494 int frame_size,
495 ByteSize basic_lock_owner_sp_offset,
496 ByteSize basic_lock_sp_offset,
497 OopMapSet* oop_maps) {
498 // create nmethod
499 nmethod* nm = NULL;
500 {
501 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
502 int native_nmethod_size = allocation_size(code_buffer, sizeof(nmethod));
503 CodeOffsets offsets;
504 offsets.set_value(CodeOffsets::Verified_Entry, vep_offset);
505 offsets.set_value(CodeOffsets::Frame_Complete, frame_complete);
506 nm = new (native_nmethod_size)
507 nmethod(method(), native_nmethod_size, compile_id, &offsets,
508 code_buffer, frame_size,
509 basic_lock_owner_sp_offset, basic_lock_sp_offset,
510 oop_maps);
511 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_native_nmethod(nm));
512 if (PrintAssembly && nm != NULL)
513 Disassembler::decode(nm);
514 }
515 // verify nmethod
516 debug_only(if (nm) nm->verify();) // might block
517
518 if (nm != NULL) {
519 nm->log_new_nmethod();
520 }
521
522 return nm;
523 }
524
525 #ifdef HAVE_DTRACE_H
526 nmethod* nmethod::new_dtrace_nmethod(methodHandle method,
527 CodeBuffer *code_buffer,
528 int vep_offset,
529 int trap_offset,
530 int frame_complete,
531 int frame_size) {
532 // create nmethod
533 nmethod* nm = NULL;
534 {
535 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
536 int nmethod_size = allocation_size(code_buffer, sizeof(nmethod));
537 CodeOffsets offsets;
538 offsets.set_value(CodeOffsets::Verified_Entry, vep_offset);
539 offsets.set_value(CodeOffsets::Dtrace_trap, trap_offset);
540 offsets.set_value(CodeOffsets::Frame_Complete, frame_complete);
541
542 nm = new (nmethod_size) nmethod(method(), nmethod_size, &offsets, code_buffer, frame_size);
543
544 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm));
545 if (PrintAssembly && nm != NULL)
546 Disassembler::decode(nm);
547 }
548 // verify nmethod
549 debug_only(if (nm) nm->verify();) // might block
550
551 if (nm != NULL) {
552 nm->log_new_nmethod();
553 }
554
555 return nm;
556 }
557
558 #endif // def HAVE_DTRACE_H
559
560 nmethod* nmethod::new_nmethod(methodHandle method,
561 int compile_id,
562 int entry_bci,
563 CodeOffsets* offsets,
564 int orig_pc_offset,
565 DebugInformationRecorder* debug_info,
566 Dependencies* dependencies,
567 CodeBuffer* code_buffer, int frame_size,
568 OopMapSet* oop_maps,
569 ExceptionHandlerTable* handler_table,
570 ImplicitExceptionTable* nul_chk_table,
571 AbstractCompiler* compiler,
572 int comp_level
573 )
574 {
575 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
576 // create nmethod
577 nmethod* nm = NULL;
578 { MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
579 int nmethod_size =
580 allocation_size(code_buffer, sizeof(nmethod))
581 + adjust_pcs_size(debug_info->pcs_size())
582 + round_to(dependencies->size_in_bytes() , oopSize)
583 + round_to(handler_table->size_in_bytes(), oopSize)
584 + round_to(nul_chk_table->size_in_bytes(), oopSize)
585 + round_to(debug_info->data_size() , oopSize);
586 nm = new (nmethod_size)
587 nmethod(method(), nmethod_size, compile_id, entry_bci, offsets,
588 orig_pc_offset, debug_info, dependencies, code_buffer, frame_size,
589 oop_maps,
590 handler_table,
591 nul_chk_table,
592 compiler,
593 comp_level);
594 if (nm != NULL) {
595 // To make dependency checking during class loading fast, record
596 // the nmethod dependencies in the classes it is dependent on.
597 // This allows the dependency checking code to simply walk the
598 // class hierarchy above the loaded class, checking only nmethods
599 // which are dependent on those classes. The slow way is to
600 // check every nmethod for dependencies which makes it linear in
601 // the number of methods compiled. For applications with a lot
602 // classes the slow way is too slow.
603 for (Dependencies::DepStream deps(nm); deps.next(); ) {
604 klassOop klass = deps.context_type();
605 if (klass == NULL) continue; // ignore things like evol_method
606
607 // record this nmethod as dependent on this klass
608 instanceKlass::cast(klass)->add_dependent_nmethod(nm);
609 }
610 }
611 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm));
612 if (PrintAssembly && nm != NULL)
613 Disassembler::decode(nm);
614 }
615
616 // verify nmethod
617 debug_only(if (nm) nm->verify();) // might block
618
619 if (nm != NULL) {
620 nm->log_new_nmethod();
621 }
622
623 // done
624 return nm;
625 }
626
627
628 // For native wrappers
629 nmethod::nmethod(
630 methodOop method,
631 int nmethod_size,
632 int compile_id,
633 CodeOffsets* offsets,
634 CodeBuffer* code_buffer,
635 int frame_size,
636 ByteSize basic_lock_owner_sp_offset,
637 ByteSize basic_lock_sp_offset,
638 OopMapSet* oop_maps )
639 : CodeBlob("native nmethod", code_buffer, sizeof(nmethod),
640 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
641 _native_receiver_sp_offset(basic_lock_owner_sp_offset),
642 _native_basic_lock_sp_offset(basic_lock_sp_offset)
643 {
644 {
645 debug_only(No_Safepoint_Verifier nsv;)
646 assert_locked_or_safepoint(CodeCache_lock);
647
648 init_defaults();
649 _method = method;
650 _entry_bci = InvocationEntryBci;
651 // We have no exception handler or deopt handler make the
652 // values something that will never match a pc like the nmethod vtable entry
653 _exception_offset = 0;
654 _deoptimize_offset = 0;
655 _deoptimize_mh_offset = 0;
656 _orig_pc_offset = 0;
657
658 _consts_offset = data_offset();
659 _stub_offset = data_offset();
660 _oops_offset = data_offset();
661 _scopes_data_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize);
662 _scopes_pcs_offset = _scopes_data_offset;
663 _dependencies_offset = _scopes_pcs_offset;
664 _handler_table_offset = _dependencies_offset;
665 _nul_chk_table_offset = _handler_table_offset;
666 _nmethod_end_offset = _nul_chk_table_offset;
667 _compile_id = compile_id;
668 _comp_level = CompLevel_none;
669 _entry_point = code_begin() + offsets->value(CodeOffsets::Entry);
670 _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry);
671 _osr_entry_point = NULL;
672 _exception_cache = NULL;
673 _pc_desc_cache.reset_to(NULL);
674
675 code_buffer->copy_oops_to(this);
676 if (ScavengeRootsInCode && detect_scavenge_root_oops()) {
677 CodeCache::add_scavenge_root_nmethod(this);
678 }
679 debug_only(verify_scavenge_root_oops());
680 CodeCache::commit(this);
681 }
682
683 if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
684 ttyLocker ttyl; // keep the following output all in one block
685 // This output goes directly to the tty, not the compiler log.
686 // To enable tools to match it up with the compilation activity,
687 // be sure to tag this tty output with the compile ID.
688 if (xtty != NULL) {
689 xtty->begin_head("print_native_nmethod");
690 xtty->method(_method);
691 xtty->stamp();
692 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
693 }
694 // print the header part first
695 print();
696 // then print the requested information
697 if (PrintNativeNMethods) {
698 print_code();
699 oop_maps->print();
700 }
701 if (PrintRelocations) {
702 print_relocations();
703 }
704 if (xtty != NULL) {
705 xtty->tail("print_native_nmethod");
706 }
707 }
708 }
709
710 // For dtrace wrappers
711 #ifdef HAVE_DTRACE_H
712 nmethod::nmethod(
713 methodOop method,
714 int nmethod_size,
715 CodeOffsets* offsets,
716 CodeBuffer* code_buffer,
717 int frame_size)
718 : CodeBlob("dtrace nmethod", code_buffer, sizeof(nmethod),
719 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, NULL),
720 _native_receiver_sp_offset(in_ByteSize(-1)),
721 _native_basic_lock_sp_offset(in_ByteSize(-1))
722 {
723 {
724 debug_only(No_Safepoint_Verifier nsv;)
725 assert_locked_or_safepoint(CodeCache_lock);
726
727 init_defaults();
728 _method = method;
729 _entry_bci = InvocationEntryBci;
730 // We have no exception handler or deopt handler make the
731 // values something that will never match a pc like the nmethod vtable entry
732 _exception_offset = 0;
733 _deoptimize_offset = 0;
734 _deoptimize_mh_offset = 0;
735 _unwind_handler_offset = -1;
736 _trap_offset = offsets->value(CodeOffsets::Dtrace_trap);
737 _orig_pc_offset = 0;
738 _consts_offset = data_offset();
739 _stub_offset = data_offset();
740 _oops_offset = data_offset();
741 _scopes_data_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize);
742 _scopes_pcs_offset = _scopes_data_offset;
743 _dependencies_offset = _scopes_pcs_offset;
744 _handler_table_offset = _dependencies_offset;
745 _nul_chk_table_offset = _handler_table_offset;
746 _nmethod_end_offset = _nul_chk_table_offset;
747 _compile_id = 0; // default
748 _comp_level = CompLevel_none;
749 _entry_point = code_begin() + offsets->value(CodeOffsets::Entry);
750 _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry);
751 _osr_entry_point = NULL;
752 _exception_cache = NULL;
753 _pc_desc_cache.reset_to(NULL);
754
755 code_buffer->copy_oops_to(this);
756 debug_only(verify_scavenge_root_oops());
757 CodeCache::commit(this);
758 }
759
760 if (PrintNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
761 ttyLocker ttyl; // keep the following output all in one block
762 // This output goes directly to the tty, not the compiler log.
763 // To enable tools to match it up with the compilation activity,
764 // be sure to tag this tty output with the compile ID.
765 if (xtty != NULL) {
766 xtty->begin_head("print_dtrace_nmethod");
767 xtty->method(_method);
768 xtty->stamp();
769 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
770 }
771 // print the header part first
772 print();
773 // then print the requested information
774 if (PrintNMethods) {
775 print_code();
776 }
777 if (PrintRelocations) {
778 print_relocations();
779 }
780 if (xtty != NULL) {
781 xtty->tail("print_dtrace_nmethod");
782 }
783 }
784 }
785 #endif // def HAVE_DTRACE_H
786
787 void* nmethod::operator new(size_t size, int nmethod_size) {
788 // Always leave some room in the CodeCache for I2C/C2I adapters
789 if (CodeCache::largest_free_block() < CodeCacheMinimumFreeSpace) return NULL;
790 return CodeCache::allocate(nmethod_size);
791 }
792
793
794 nmethod::nmethod(
795 methodOop method,
796 int nmethod_size,
797 int compile_id,
798 int entry_bci,
799 CodeOffsets* offsets,
800 int orig_pc_offset,
801 DebugInformationRecorder* debug_info,
802 Dependencies* dependencies,
803 CodeBuffer *code_buffer,
804 int frame_size,
805 OopMapSet* oop_maps,
806 ExceptionHandlerTable* handler_table,
807 ImplicitExceptionTable* nul_chk_table,
808 AbstractCompiler* compiler,
809 int comp_level
810 )
811 : CodeBlob("nmethod", code_buffer, sizeof(nmethod),
812 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
813 _native_receiver_sp_offset(in_ByteSize(-1)),
814 _native_basic_lock_sp_offset(in_ByteSize(-1))
815 {
816 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
817 {
818 debug_only(No_Safepoint_Verifier nsv;)
819 assert_locked_or_safepoint(CodeCache_lock);
820
821 init_defaults();
822 _method = method;
823 _entry_bci = entry_bci;
824 _compile_id = compile_id;
825 _comp_level = comp_level;
826 _compiler = compiler;
827 _orig_pc_offset = orig_pc_offset;
828
829 // Section offsets
830 _consts_offset = content_offset() + code_buffer->total_offset_of(code_buffer->consts());
831 _stub_offset = content_offset() + code_buffer->total_offset_of(code_buffer->stubs());
832
833 // Exception handler and deopt handler are in the stub section
834 assert(offsets->value(CodeOffsets::Exceptions) != -1, "must be set");
835 assert(offsets->value(CodeOffsets::Deopt ) != -1, "must be set");
836 _exception_offset = _stub_offset + offsets->value(CodeOffsets::Exceptions);
837 _deoptimize_offset = _stub_offset + offsets->value(CodeOffsets::Deopt);
838 if (offsets->value(CodeOffsets::DeoptMH) != -1) {
839 _deoptimize_mh_offset = _stub_offset + offsets->value(CodeOffsets::DeoptMH);
840 } else {
841 _deoptimize_mh_offset = -1;
842 }
843 if (offsets->value(CodeOffsets::UnwindHandler) != -1) {
844 _unwind_handler_offset = code_offset() + offsets->value(CodeOffsets::UnwindHandler);
845 } else {
846 _unwind_handler_offset = -1;
847 }
848
849 _oops_offset = data_offset();
850 _scopes_data_offset = _oops_offset + round_to(code_buffer->total_oop_size (), oopSize);
851 _scopes_pcs_offset = _scopes_data_offset + round_to(debug_info->data_size (), oopSize);
852 _dependencies_offset = _scopes_pcs_offset + adjust_pcs_size(debug_info->pcs_size());
853 _handler_table_offset = _dependencies_offset + round_to(dependencies->size_in_bytes (), oopSize);
854 _nul_chk_table_offset = _handler_table_offset + round_to(handler_table->size_in_bytes(), oopSize);
855 _nmethod_end_offset = _nul_chk_table_offset + round_to(nul_chk_table->size_in_bytes(), oopSize);
856
857 _entry_point = code_begin() + offsets->value(CodeOffsets::Entry);
858 _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry);
859 _osr_entry_point = code_begin() + offsets->value(CodeOffsets::OSR_Entry);
860 _exception_cache = NULL;
861 _pc_desc_cache.reset_to(scopes_pcs_begin());
862
863 // Copy contents of ScopeDescRecorder to nmethod
864 code_buffer->copy_oops_to(this);
865 debug_info->copy_to(this);
866 dependencies->copy_to(this);
867 if (ScavengeRootsInCode && detect_scavenge_root_oops()) {
868 CodeCache::add_scavenge_root_nmethod(this);
869 }
870 debug_only(verify_scavenge_root_oops());
871
872 CodeCache::commit(this);
873
874 // Copy contents of ExceptionHandlerTable to nmethod
875 handler_table->copy_to(this);
876 nul_chk_table->copy_to(this);
877
878 // we use the information of entry points to find out if a method is
879 // static or non static
880 assert(compiler->is_c2() ||
881 _method->is_static() == (entry_point() == _verified_entry_point),
882 " entry points must be same for static methods and vice versa");
883 }
884
885 bool printnmethods = PrintNMethods
886 || CompilerOracle::should_print(_method)
887 || CompilerOracle::has_option_string(_method, "PrintNMethods");
888 if (printnmethods || PrintDebugInfo || PrintRelocations || PrintDependencies || PrintExceptionHandlers) {
889 print_nmethod(printnmethods);
890 }
891 }
892
893
894 // Print a short set of xml attributes to identify this nmethod. The
895 // output should be embedded in some other element.
896 void nmethod::log_identity(xmlStream* log) const {
897 log->print(" compile_id='%d'", compile_id());
898 const char* nm_kind = compile_kind();
899 if (nm_kind != NULL) log->print(" compile_kind='%s'", nm_kind);
900 if (compiler() != NULL) {
901 log->print(" compiler='%s'", compiler()->name());
902 }
903 if (TieredCompilation) {
904 log->print(" level='%d'", comp_level());
905 }
906 }
907
908
909 #define LOG_OFFSET(log, name) \
910 if ((intptr_t)name##_end() - (intptr_t)name##_begin()) \
911 log->print(" " XSTR(name) "_offset='%d'" , \
912 (intptr_t)name##_begin() - (intptr_t)this)
913
914
915 void nmethod::log_new_nmethod() const {
916 if (LogCompilation && xtty != NULL) {
917 ttyLocker ttyl;
918 HandleMark hm;
919 xtty->begin_elem("nmethod");
920 log_identity(xtty);
921 xtty->print(" entry='" INTPTR_FORMAT "' size='%d'", code_begin(), size());
922 xtty->print(" address='" INTPTR_FORMAT "'", (intptr_t) this);
923
924 LOG_OFFSET(xtty, relocation);
925 LOG_OFFSET(xtty, consts);
926 LOG_OFFSET(xtty, insts);
927 LOG_OFFSET(xtty, stub);
928 LOG_OFFSET(xtty, scopes_data);
929 LOG_OFFSET(xtty, scopes_pcs);
930 LOG_OFFSET(xtty, dependencies);
931 LOG_OFFSET(xtty, handler_table);
932 LOG_OFFSET(xtty, nul_chk_table);
933 LOG_OFFSET(xtty, oops);
934
935 xtty->method(method());
936 xtty->stamp();
937 xtty->end_elem();
938 }
939 }
940
941 #undef LOG_OFFSET
942
943
944 // Print out more verbose output usually for a newly created nmethod.
945 void nmethod::print_on(outputStream* st, const char* msg) const {
946 if (st != NULL) {
947 ttyLocker ttyl;
948 CompileTask::print_compilation(st, this, msg);
949 if (WizardMode) st->print(" (" INTPTR_FORMAT ")", this);
950 }
951 }
952
953
954 void nmethod::print_nmethod(bool printmethod) {
955 ttyLocker ttyl; // keep the following output all in one block
956 if (xtty != NULL) {
957 xtty->begin_head("print_nmethod");
958 xtty->stamp();
959 xtty->end_head();
960 }
961 // print the header part first
962 print();
963 // then print the requested information
964 if (printmethod) {
965 print_code();
966 print_pcs();
967 oop_maps()->print();
968 }
969 if (PrintDebugInfo) {
970 print_scopes();
971 }
972 if (PrintRelocations) {
973 print_relocations();
974 }
975 if (PrintDependencies) {
976 print_dependencies();
977 }
978 if (PrintExceptionHandlers) {
979 print_handler_table();
980 print_nul_chk_table();
981 }
982 if (xtty != NULL) {
983 xtty->tail("print_nmethod");
984 }
985 }
986
987
988 // Promote one word from an assembly-time handle to a live embedded oop.
989 inline void nmethod::initialize_immediate_oop(oop* dest, jobject handle) {
990 if (handle == NULL ||
991 // As a special case, IC oops are initialized to 1 or -1.
992 handle == (jobject) Universe::non_oop_word()) {
993 (*dest) = (oop) handle;
994 } else {
995 (*dest) = JNIHandles::resolve_non_null(handle);
996 }
997 }
998
999
1000 void nmethod::copy_oops(GrowableArray<jobject>* array) {
1001 //assert(oops_size() == 0, "do this handshake just once, please");
1002 int length = array->length();
1003 assert((address)(oops_begin() + length) <= data_end(), "oops big enough");
1004 oop* dest = oops_begin();
1005 for (int index = 0 ; index < length; index++) {
1006 initialize_immediate_oop(&dest[index], array->at(index));
1007 }
1008
1009 // Now we can fix up all the oops in the code. We need to do this
1010 // in the code because the assembler uses jobjects as placeholders.
1011 // The code and relocations have already been initialized by the
1012 // CodeBlob constructor, so it is valid even at this early point to
1013 // iterate over relocations and patch the code.
1014 fix_oop_relocations(NULL, NULL, /*initialize_immediates=*/ true);
1015 }
1016
1017
1018 bool nmethod::is_at_poll_return(address pc) {
1019 RelocIterator iter(this, pc, pc+1);
1020 while (iter.next()) {
1021 if (iter.type() == relocInfo::poll_return_type)
1022 return true;
1023 }
1024 return false;
1025 }
1026
1027
1028 bool nmethod::is_at_poll_or_poll_return(address pc) {
1029 RelocIterator iter(this, pc, pc+1);
1030 while (iter.next()) {
1031 relocInfo::relocType t = iter.type();
1032 if (t == relocInfo::poll_return_type || t == relocInfo::poll_type)
1033 return true;
1034 }
1035 return false;
1036 }
1037
1038
1039 void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) {
1040 // re-patch all oop-bearing instructions, just in case some oops moved
1041 RelocIterator iter(this, begin, end);
1042 while (iter.next()) {
1043 if (iter.type() == relocInfo::oop_type) {
1044 oop_Relocation* reloc = iter.oop_reloc();
1045 if (initialize_immediates && reloc->oop_is_immediate()) {
1046 oop* dest = reloc->oop_addr();
1047 initialize_immediate_oop(dest, (jobject) *dest);
1048 }
1049 // Refresh the oop-related bits of this instruction.
1050 reloc->fix_oop_relocation();
1051 }
1052
1053 // There must not be any interfering patches or breakpoints.
1054 assert(!(iter.type() == relocInfo::breakpoint_type
1055 && iter.breakpoint_reloc()->active()),
1056 "no active breakpoint");
1057 }
1058 }
1059
1060
1061 void nmethod::verify_oop_relocations() {
1062 // Ensure sure that the code matches the current oop values
1063 RelocIterator iter(this, NULL, NULL);
1064 while (iter.next()) {
1065 if (iter.type() == relocInfo::oop_type) {
1066 oop_Relocation* reloc = iter.oop_reloc();
1067 if (!reloc->oop_is_immediate()) {
1068 reloc->verify_oop_relocation();
1069 }
1070 }
1071 }
1072 }
1073
1074
1075 ScopeDesc* nmethod::scope_desc_at(address pc) {
1076 PcDesc* pd = pc_desc_at(pc);
1077 guarantee(pd != NULL, "scope must be present");
1078 return new ScopeDesc(this, pd->scope_decode_offset(),
1079 pd->obj_decode_offset(), pd->should_reexecute(),
1080 pd->return_oop());
1081 }
1082
1083
1084 void nmethod::clear_inline_caches() {
1085 assert(SafepointSynchronize::is_at_safepoint(), "cleaning of IC's only allowed at safepoint");
1086 if (is_zombie()) {
1087 return;
1088 }
1089
1090 RelocIterator iter(this);
1091 while (iter.next()) {
1092 iter.reloc()->clear_inline_cache();
1093 }
1094 }
1095
1096
1097 void nmethod::cleanup_inline_caches() {
1098
1099 assert_locked_or_safepoint(CompiledIC_lock);
1100
1101 // If the method is not entrant or zombie then a JMP is plastered over the
1102 // first few bytes. If an oop in the old code was there, that oop
1103 // should not get GC'd. Skip the first few bytes of oops on
1104 // not-entrant methods.
1105 address low_boundary = verified_entry_point();
1106 if (!is_in_use()) {
1107 low_boundary += NativeJump::instruction_size;
1108 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1109 // This means that the low_boundary is going to be a little too high.
1110 // This shouldn't matter, since oops of non-entrant methods are never used.
1111 // In fact, why are we bothering to look at oops in a non-entrant method??
1112 }
1113
1114 // Find all calls in an nmethod, and clear the ones that points to zombie methods
1115 ResourceMark rm;
1116 RelocIterator iter(this, low_boundary);
1117 while(iter.next()) {
1118 switch(iter.type()) {
1119 case relocInfo::virtual_call_type:
1120 case relocInfo::opt_virtual_call_type: {
1121 CompiledIC *ic = CompiledIC_at(iter.reloc());
1122 // Ok, to lookup references to zombies here
1123 CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination());
1124 if( cb != NULL && cb->is_nmethod() ) {
1125 nmethod* nm = (nmethod*)cb;
1126 // Clean inline caches pointing to both zombie and not_entrant methods
1127 if (!nm->is_in_use() || (nm->method()->code() != nm)) ic->set_to_clean();
1128 }
1129 break;
1130 }
1131 case relocInfo::static_call_type: {
1132 CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc());
1133 CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination());
1134 if( cb != NULL && cb->is_nmethod() ) {
1135 nmethod* nm = (nmethod*)cb;
1136 // Clean inline caches pointing to both zombie and not_entrant methods
1137 if (!nm->is_in_use() || (nm->method()->code() != nm)) csc->set_to_clean();
1138 }
1139 break;
1140 }
1141 }
1142 }
1143 }
1144
1145 // This is a private interface with the sweeper.
1146 void nmethod::mark_as_seen_on_stack() {
1147 assert(is_not_entrant(), "must be a non-entrant method");
1148 // Set the traversal mark to ensure that the sweeper does 2
1149 // cleaning passes before moving to zombie.
1150 set_stack_traversal_mark(NMethodSweeper::traversal_count());
1151 }
1152
1153 // Tell if a non-entrant method can be converted to a zombie (i.e.,
1154 // there are no activations on the stack, not in use by the VM,
1155 // and not in use by the ServiceThread)
1156 bool nmethod::can_not_entrant_be_converted() {
1157 assert(is_not_entrant(), "must be a non-entrant method");
1158
1159 // Since the nmethod sweeper only does partial sweep the sweeper's traversal
1160 // count can be greater than the stack traversal count before it hits the
1161 // nmethod for the second time.
1162 return stack_traversal_mark()+1 < NMethodSweeper::traversal_count() &&
1163 !is_locked_by_vm();
1164 }
1165
1166 void nmethod::inc_decompile_count() {
1167 if (!is_compiled_by_c2()) return;
1168 // Could be gated by ProfileTraps, but do not bother...
1169 methodOop m = method();
1170 if (m == NULL) return;
1171 methodDataOop mdo = m->method_data();
1172 if (mdo == NULL) return;
1173 // There is a benign race here. See comments in methodDataOop.hpp.
1174 mdo->inc_decompile_count();
1175 }
1176
1177 void nmethod::make_unloaded(BoolObjectClosure* is_alive, oop cause) {
1178
1179 post_compiled_method_unload();
1180
1181 // Since this nmethod is being unloaded, make sure that dependencies
1182 // recorded in instanceKlasses get flushed and pass non-NULL closure to
1183 // indicate that this work is being done during a GC.
1184 assert(Universe::heap()->is_gc_active(), "should only be called during gc");
1185 assert(is_alive != NULL, "Should be non-NULL");
1186 // A non-NULL is_alive closure indicates that this is being called during GC.
1187 flush_dependencies(is_alive);
1188
1189 // Break cycle between nmethod & method
1190 if (TraceClassUnloading && WizardMode) {
1191 tty->print_cr("[Class unloading: Making nmethod " INTPTR_FORMAT
1192 " unloadable], methodOop(" INTPTR_FORMAT
1193 "), cause(" INTPTR_FORMAT ")",
1194 this, (address)_method, (address)cause);
1195 if (!Universe::heap()->is_gc_active())
1196 cause->klass()->print();
1197 }
1198 // Unlink the osr method, so we do not look this up again
1199 if (is_osr_method()) {
1200 invalidate_osr_method();
1201 }
1202 // If _method is already NULL the methodOop is about to be unloaded,
1203 // so we don't have to break the cycle. Note that it is possible to
1204 // have the methodOop live here, in case we unload the nmethod because
1205 // it is pointing to some oop (other than the methodOop) being unloaded.
1206 if (_method != NULL) {
1207 // OSR methods point to the methodOop, but the methodOop does not
1208 // point back!
1209 if (_method->code() == this) {
1210 _method->clear_code(); // Break a cycle
1211 }
1212 _method = NULL; // Clear the method of this dead nmethod
1213 }
1214 // Make the class unloaded - i.e., change state and notify sweeper
1215 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
1216 if (is_in_use()) {
1217 // Transitioning directly from live to unloaded -- so
1218 // we need to force a cache clean-up; remember this
1219 // for later on.
1220 CodeCache::set_needs_cache_clean(true);
1221 }
1222 _state = unloaded;
1223
1224 // Log the unloading.
1225 log_state_change();
1226
1227 // The methodOop is gone at this point
1228 assert(_method == NULL, "Tautology");
1229
1230 set_osr_link(NULL);
1231 //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods
1232 NMethodSweeper::notify(this);
1233 }
1234
1235 void nmethod::invalidate_osr_method() {
1236 assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod");
1237 // Remove from list of active nmethods
1238 if (method() != NULL)
1239 instanceKlass::cast(method()->method_holder())->remove_osr_nmethod(this);
1240 // Set entry as invalid
1241 _entry_bci = InvalidOSREntryBci;
1242 }
1243
1244 void nmethod::log_state_change() const {
1245 if (LogCompilation) {
1246 if (xtty != NULL) {
1247 ttyLocker ttyl; // keep the following output all in one block
1248 if (_state == unloaded) {
1249 xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'",
1250 os::current_thread_id());
1251 } else {
1252 xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s",
1253 os::current_thread_id(),
1254 (_state == zombie ? " zombie='1'" : ""));
1255 }
1256 log_identity(xtty);
1257 xtty->stamp();
1258 xtty->end_elem();
1259 }
1260 }
1261 if (PrintCompilation && _state != unloaded) {
1262 print_on(tty, _state == zombie ? "made zombie" : "made not entrant");
1263 }
1264 }
1265
1266 // Common functionality for both make_not_entrant and make_zombie
1267 bool nmethod::make_not_entrant_or_zombie(unsigned int state) {
1268 assert(state == zombie || state == not_entrant, "must be zombie or not_entrant");
1269 assert(!is_zombie(), "should not already be a zombie");
1270
1271 // Make sure neither the nmethod nor the method is flushed in case of a safepoint in code below.
1272 nmethodLocker nml(this);
1273 methodHandle the_method(method());
1274 No_Safepoint_Verifier nsv;
1275
1276 {
1277 // invalidate osr nmethod before acquiring the patching lock since
1278 // they both acquire leaf locks and we don't want a deadlock.
1279 // This logic is equivalent to the logic below for patching the
1280 // verified entry point of regular methods.
1281 if (is_osr_method()) {
1282 // this effectively makes the osr nmethod not entrant
1283 invalidate_osr_method();
1284 }
1285
1286 // Enter critical section. Does not block for safepoint.
1287 MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag);
1288
1289 if (_state == state) {
1290 // another thread already performed this transition so nothing
1291 // to do, but return false to indicate this.
1292 return false;
1293 }
1294
1295 // The caller can be calling the method statically or through an inline
1296 // cache call.
1297 if (!is_osr_method() && !is_not_entrant()) {
1298 NativeJump::patch_verified_entry(entry_point(), verified_entry_point(),
1299 SharedRuntime::get_handle_wrong_method_stub());
1300 }
1301
1302 if (is_in_use()) {
1303 // It's a true state change, so mark the method as decompiled.
1304 // Do it only for transition from alive.
1305 inc_decompile_count();
1306 }
1307
1308 // Change state
1309 _state = state;
1310
1311 // Log the transition once
1312 log_state_change();
1313
1314 // Remove nmethod from method.
1315 // We need to check if both the _code and _from_compiled_code_entry_point
1316 // refer to this nmethod because there is a race in setting these two fields
1317 // in methodOop as seen in bugid 4947125.
1318 // If the vep() points to the zombie nmethod, the memory for the nmethod
1319 // could be flushed and the compiler and vtable stubs could still call
1320 // through it.
1321 if (method() != NULL && (method()->code() == this ||
1322 method()->from_compiled_entry() == verified_entry_point())) {
1323 HandleMark hm;
1324 method()->clear_code();
1325 }
1326
1327 if (state == not_entrant) {
1328 mark_as_seen_on_stack();
1329 }
1330
1331 } // leave critical region under Patching_lock
1332
1333 // When the nmethod becomes zombie it is no longer alive so the
1334 // dependencies must be flushed. nmethods in the not_entrant
1335 // state will be flushed later when the transition to zombie
1336 // happens or they get unloaded.
1337 if (state == zombie) {
1338 {
1339 // Flushing dependecies must be done before any possible
1340 // safepoint can sneak in, otherwise the oops used by the
1341 // dependency logic could have become stale.
1342 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1343 flush_dependencies(NULL);
1344 }
1345
1346 // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload
1347 // event and it hasn't already been reported for this nmethod then
1348 // report it now. The event may have been reported earilier if the GC
1349 // marked it for unloading). JvmtiDeferredEventQueue support means
1350 // we no longer go to a safepoint here.
1351 post_compiled_method_unload();
1352
1353 #ifdef ASSERT
1354 // It's no longer safe to access the oops section since zombie
1355 // nmethods aren't scanned for GC.
1356 _oops_are_stale = true;
1357 #endif
1358 } else {
1359 assert(state == not_entrant, "other cases may need to be handled differently");
1360 }
1361
1362 if (TraceCreateZombies) {
1363 tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie");
1364 }
1365
1366 // Make sweeper aware that there is a zombie method that needs to be removed
1367 NMethodSweeper::notify(this);
1368
1369 return true;
1370 }
1371
1372 void nmethod::flush() {
1373 // Note that there are no valid oops in the nmethod anymore.
1374 assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method");
1375 assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation");
1376
1377 assert (!is_locked_by_vm(), "locked methods shouldn't be flushed");
1378 assert_locked_or_safepoint(CodeCache_lock);
1379
1380 // completely deallocate this method
1381 Events::log(JavaThread::current(), "flushing nmethod " INTPTR_FORMAT, this);
1382 if (PrintMethodFlushing) {
1383 tty->print_cr("*flushing nmethod %3d/" INTPTR_FORMAT ". Live blobs:" UINT32_FORMAT "/Free CodeCache:" SIZE_FORMAT "Kb",
1384 _compile_id, this, CodeCache::nof_blobs(), CodeCache::unallocated_capacity()/1024);
1385 }
1386
1387 // We need to deallocate any ExceptionCache data.
1388 // Note that we do not need to grab the nmethod lock for this, it
1389 // better be thread safe if we're disposing of it!
1390 ExceptionCache* ec = exception_cache();
1391 set_exception_cache(NULL);
1392 while(ec != NULL) {
1393 ExceptionCache* next = ec->next();
1394 delete ec;
1395 ec = next;
1396 }
1397
1398 if (on_scavenge_root_list()) {
1399 CodeCache::drop_scavenge_root_nmethod(this);
1400 }
1401
1402 if (is_speculatively_disconnected()) {
1403 CodeCache::remove_saved_code(this);
1404 }
1405
1406 #ifdef SHARK
1407 ((SharkCompiler *) compiler())->free_compiled_method(insts_begin());
1408 #endif // SHARK
1409
1410 ((CodeBlob*)(this))->flush();
1411
1412 CodeCache::free(this);
1413 }
1414
1415
1416 //
1417 // Notify all classes this nmethod is dependent on that it is no
1418 // longer dependent. This should only be called in two situations.
1419 // First, when a nmethod transitions to a zombie all dependents need
1420 // to be clear. Since zombification happens at a safepoint there's no
1421 // synchronization issues. The second place is a little more tricky.
1422 // During phase 1 of mark sweep class unloading may happen and as a
1423 // result some nmethods may get unloaded. In this case the flushing
1424 // of dependencies must happen during phase 1 since after GC any
1425 // dependencies in the unloaded nmethod won't be updated, so
1426 // traversing the dependency information in unsafe. In that case this
1427 // function is called with a non-NULL argument and this function only
1428 // notifies instanceKlasses that are reachable
1429
1430 void nmethod::flush_dependencies(BoolObjectClosure* is_alive) {
1431 assert_locked_or_safepoint(CodeCache_lock);
1432 assert(Universe::heap()->is_gc_active() == (is_alive != NULL),
1433 "is_alive is non-NULL if and only if we are called during GC");
1434 if (!has_flushed_dependencies()) {
1435 set_has_flushed_dependencies();
1436 for (Dependencies::DepStream deps(this); deps.next(); ) {
1437 klassOop klass = deps.context_type();
1438 if (klass == NULL) continue; // ignore things like evol_method
1439
1440 // During GC the is_alive closure is non-NULL, and is used to
1441 // determine liveness of dependees that need to be updated.
1442 if (is_alive == NULL || is_alive->do_object_b(klass)) {
1443 instanceKlass::cast(klass)->remove_dependent_nmethod(this);
1444 }
1445 }
1446 }
1447 }
1448
1449
1450 // If this oop is not live, the nmethod can be unloaded.
1451 bool nmethod::can_unload(BoolObjectClosure* is_alive,
1452 OopClosure* keep_alive,
1453 oop* root, bool unloading_occurred) {
1454 assert(root != NULL, "just checking");
1455 oop obj = *root;
1456 if (obj == NULL || is_alive->do_object_b(obj)) {
1457 return false;
1458 }
1459 if (obj->is_compiledICHolder()) {
1460 compiledICHolderOop cichk_oop = compiledICHolderOop(obj);
1461 if (is_alive->do_object_b(
1462 cichk_oop->holder_method()->method_holder()) &&
1463 is_alive->do_object_b(cichk_oop->holder_klass())) {
1464 // The oop should be kept alive
1465 keep_alive->do_oop(root);
1466 return false;
1467 }
1468 }
1469 // If ScavengeRootsInCode is true, an nmethod might be unloaded
1470 // simply because one of its constant oops has gone dead.
1471 // No actual classes need to be unloaded in order for this to occur.
1472 assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading");
1473 make_unloaded(is_alive, obj);
1474 return true;
1475 }
1476
1477 // ------------------------------------------------------------------
1478 // post_compiled_method_load_event
1479 // new method for install_code() path
1480 // Transfer information from compilation to jvmti
1481 void nmethod::post_compiled_method_load_event() {
1482
1483 methodOop moop = method();
1484 #ifndef USDT2
1485 HS_DTRACE_PROBE8(hotspot, compiled__method__load,
1486 moop->klass_name()->bytes(),
1487 moop->klass_name()->utf8_length(),
1488 moop->name()->bytes(),
1489 moop->name()->utf8_length(),
1490 moop->signature()->bytes(),
1491 moop->signature()->utf8_length(),
1492 insts_begin(), insts_size());
1493 #else /* USDT2 */
1494 HOTSPOT_COMPILED_METHOD_LOAD(
1495 (char *) moop->klass_name()->bytes(),
1496 moop->klass_name()->utf8_length(),
1497 (char *) moop->name()->bytes(),
1498 moop->name()->utf8_length(),
1499 (char *) moop->signature()->bytes(),
1500 moop->signature()->utf8_length(),
1501 insts_begin(), insts_size());
1502 #endif /* USDT2 */
1503
1504 if (JvmtiExport::should_post_compiled_method_load() ||
1505 JvmtiExport::should_post_compiled_method_unload()) {
1506 get_and_cache_jmethod_id();
1507 }
1508
1509 if (JvmtiExport::should_post_compiled_method_load()) {
1510 // Let the Service thread (which is a real Java thread) post the event
1511 MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag);
1512 JvmtiDeferredEventQueue::enqueue(
1513 JvmtiDeferredEvent::compiled_method_load_event(this));
1514 }
1515 }
1516
1517 jmethodID nmethod::get_and_cache_jmethod_id() {
1518 if (_jmethod_id == NULL) {
1519 // Cache the jmethod_id since it can no longer be looked up once the
1520 // method itself has been marked for unloading.
1521 _jmethod_id = method()->jmethod_id();
1522 }
1523 return _jmethod_id;
1524 }
1525
1526 void nmethod::post_compiled_method_unload() {
1527 if (unload_reported()) {
1528 // During unloading we transition to unloaded and then to zombie
1529 // and the unloading is reported during the first transition.
1530 return;
1531 }
1532
1533 assert(_method != NULL && !is_unloaded(), "just checking");
1534 DTRACE_METHOD_UNLOAD_PROBE(method());
1535
1536 // If a JVMTI agent has enabled the CompiledMethodUnload event then
1537 // post the event. Sometime later this nmethod will be made a zombie
1538 // by the sweeper but the methodOop will not be valid at that point.
1539 // If the _jmethod_id is null then no load event was ever requested
1540 // so don't bother posting the unload. The main reason for this is
1541 // that the jmethodID is a weak reference to the methodOop so if
1542 // it's being unloaded there's no way to look it up since the weak
1543 // ref will have been cleared.
1544 if (_jmethod_id != NULL && JvmtiExport::should_post_compiled_method_unload()) {
1545 assert(!unload_reported(), "already unloaded");
1546 JvmtiDeferredEvent event =
1547 JvmtiDeferredEvent::compiled_method_unload_event(this,
1548 _jmethod_id, insts_begin());
1549 if (SafepointSynchronize::is_at_safepoint()) {
1550 // Don't want to take the queueing lock. Add it as pending and
1551 // it will get enqueued later.
1552 JvmtiDeferredEventQueue::add_pending_event(event);
1553 } else {
1554 MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag);
1555 JvmtiDeferredEventQueue::enqueue(event);
1556 }
1557 }
1558
1559 // The JVMTI CompiledMethodUnload event can be enabled or disabled at
1560 // any time. As the nmethod is being unloaded now we mark it has
1561 // having the unload event reported - this will ensure that we don't
1562 // attempt to report the event in the unlikely scenario where the
1563 // event is enabled at the time the nmethod is made a zombie.
1564 set_unload_reported();
1565 }
1566
1567 // This is called at the end of the strong tracing/marking phase of a
1568 // GC to unload an nmethod if it contains otherwise unreachable
1569 // oops.
1570
1571 void nmethod::do_unloading(BoolObjectClosure* is_alive,
1572 OopClosure* keep_alive, bool unloading_occurred) {
1573 // Make sure the oop's ready to receive visitors
1574 assert(!is_zombie() && !is_unloaded(),
1575 "should not call follow on zombie or unloaded nmethod");
1576
1577 // If the method is not entrant then a JMP is plastered over the
1578 // first few bytes. If an oop in the old code was there, that oop
1579 // should not get GC'd. Skip the first few bytes of oops on
1580 // not-entrant methods.
1581 address low_boundary = verified_entry_point();
1582 if (is_not_entrant()) {
1583 low_boundary += NativeJump::instruction_size;
1584 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1585 // (See comment above.)
1586 }
1587
1588 // The RedefineClasses() API can cause the class unloading invariant
1589 // to no longer be true. See jvmtiExport.hpp for details.
1590 // Also, leave a debugging breadcrumb in local flag.
1591 bool a_class_was_redefined = JvmtiExport::has_redefined_a_class();
1592 if (a_class_was_redefined) {
1593 // This set of the unloading_occurred flag is done before the
1594 // call to post_compiled_method_unload() so that the unloading
1595 // of this nmethod is reported.
1596 unloading_occurred = true;
1597 }
1598
1599 // Follow methodOop
1600 if (can_unload(is_alive, keep_alive, (oop*)&_method, unloading_occurred)) {
1601 return;
1602 }
1603
1604 // Exception cache
1605 ExceptionCache* ec = exception_cache();
1606 while (ec != NULL) {
1607 oop* ex_addr = (oop*)ec->exception_type_addr();
1608 oop ex = *ex_addr;
1609 ExceptionCache* next_ec = ec->next();
1610 if (ex != NULL && !is_alive->do_object_b(ex)) {
1611 assert(!ex->is_compiledICHolder(), "Possible error here");
1612 remove_from_exception_cache(ec);
1613 }
1614 ec = next_ec;
1615 }
1616
1617 // If class unloading occurred we first iterate over all inline caches and
1618 // clear ICs where the cached oop is referring to an unloaded klass or method.
1619 // The remaining live cached oops will be traversed in the relocInfo::oop_type
1620 // iteration below.
1621 if (unloading_occurred) {
1622 RelocIterator iter(this, low_boundary);
1623 while(iter.next()) {
1624 if (iter.type() == relocInfo::virtual_call_type) {
1625 CompiledIC *ic = CompiledIC_at(iter.reloc());
1626 oop ic_oop = ic->cached_oop();
1627 if (ic_oop != NULL && !is_alive->do_object_b(ic_oop)) {
1628 // The only exception is compiledICHolder oops which may
1629 // yet be marked below. (We check this further below).
1630 if (ic_oop->is_compiledICHolder()) {
1631 compiledICHolderOop cichk_oop = compiledICHolderOop(ic_oop);
1632 if (is_alive->do_object_b(
1633 cichk_oop->holder_method()->method_holder()) &&
1634 is_alive->do_object_b(cichk_oop->holder_klass())) {
1635 continue;
1636 }
1637 }
1638 ic->set_to_clean();
1639 assert(ic->cached_oop() == NULL,
1640 "cached oop in IC should be cleared");
1641 }
1642 }
1643 }
1644 }
1645
1646 // Compiled code
1647 RelocIterator iter(this, low_boundary);
1648 while (iter.next()) {
1649 if (iter.type() == relocInfo::oop_type) {
1650 oop_Relocation* r = iter.oop_reloc();
1651 // In this loop, we must only traverse those oops directly embedded in
1652 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1653 assert(1 == (r->oop_is_immediate()) +
1654 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1655 "oop must be found in exactly one place");
1656 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1657 if (can_unload(is_alive, keep_alive, r->oop_addr(), unloading_occurred)) {
1658 return;
1659 }
1660 }
1661 }
1662 }
1663
1664
1665 // Scopes
1666 for (oop* p = oops_begin(); p < oops_end(); p++) {
1667 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1668 if (can_unload(is_alive, keep_alive, p, unloading_occurred)) {
1669 return;
1670 }
1671 }
1672
1673 #ifndef PRODUCT
1674 // This nmethod was not unloaded; check below that all CompiledICs
1675 // refer to marked oops.
1676 {
1677 RelocIterator iter(this, low_boundary);
1678 while (iter.next()) {
1679 if (iter.type() == relocInfo::virtual_call_type) {
1680 CompiledIC *ic = CompiledIC_at(iter.reloc());
1681 oop ic_oop = ic->cached_oop();
1682 assert(ic_oop == NULL || is_alive->do_object_b(ic_oop),
1683 "Found unmarked ic_oop in reachable nmethod");
1684 }
1685 }
1686 }
1687 #endif // !PRODUCT
1688 }
1689
1690 // This method is called twice during GC -- once while
1691 // tracing the "active" nmethods on thread stacks during
1692 // the (strong) marking phase, and then again when walking
1693 // the code cache contents during the weak roots processing
1694 // phase. The two uses are distinguished by means of the
1695 // 'do_strong_roots_only' flag, which is true in the first
1696 // case. We want to walk the weak roots in the nmethod
1697 // only in the second case. The weak roots in the nmethod
1698 // are the oops in the ExceptionCache and the InlineCache
1699 // oops.
1700 void nmethod::oops_do(OopClosure* f, bool do_strong_roots_only) {
1701 // make sure the oops ready to receive visitors
1702 assert(!is_zombie() && !is_unloaded(),
1703 "should not call follow on zombie or unloaded nmethod");
1704
1705 // If the method is not entrant or zombie then a JMP is plastered over the
1706 // first few bytes. If an oop in the old code was there, that oop
1707 // should not get GC'd. Skip the first few bytes of oops on
1708 // not-entrant methods.
1709 address low_boundary = verified_entry_point();
1710 if (is_not_entrant()) {
1711 low_boundary += NativeJump::instruction_size;
1712 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1713 // (See comment above.)
1714 }
1715
1716 // Compiled code
1717 f->do_oop((oop*) &_method);
1718 if (!do_strong_roots_only) {
1719 // weak roots processing phase -- update ExceptionCache oops
1720 ExceptionCache* ec = exception_cache();
1721 while(ec != NULL) {
1722 f->do_oop((oop*)ec->exception_type_addr());
1723 ec = ec->next();
1724 }
1725 } // Else strong roots phase -- skip oops in ExceptionCache
1726
1727 RelocIterator iter(this, low_boundary);
1728
1729 while (iter.next()) {
1730 if (iter.type() == relocInfo::oop_type ) {
1731 oop_Relocation* r = iter.oop_reloc();
1732 // In this loop, we must only follow those oops directly embedded in
1733 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1734 assert(1 == (r->oop_is_immediate()) +
1735 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1736 "oop must be found in exactly one place");
1737 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1738 f->do_oop(r->oop_addr());
1739 }
1740 }
1741 }
1742
1743 // Scopes
1744 // This includes oop constants not inlined in the code stream.
1745 for (oop* p = oops_begin(); p < oops_end(); p++) {
1746 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1747 f->do_oop(p);
1748 }
1749 }
1750
1751 #define NMETHOD_SENTINEL ((nmethod*)badAddress)
1752
1753 nmethod* volatile nmethod::_oops_do_mark_nmethods;
1754
1755 // An nmethod is "marked" if its _mark_link is set non-null.
1756 // Even if it is the end of the linked list, it will have a non-null link value,
1757 // as long as it is on the list.
1758 // This code must be MP safe, because it is used from parallel GC passes.
1759 bool nmethod::test_set_oops_do_mark() {
1760 assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called");
1761 nmethod* observed_mark_link = _oops_do_mark_link;
1762 if (observed_mark_link == NULL) {
1763 // Claim this nmethod for this thread to mark.
1764 observed_mark_link = (nmethod*)
1765 Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL);
1766 if (observed_mark_link == NULL) {
1767
1768 // Atomically append this nmethod (now claimed) to the head of the list:
1769 nmethod* observed_mark_nmethods = _oops_do_mark_nmethods;
1770 for (;;) {
1771 nmethod* required_mark_nmethods = observed_mark_nmethods;
1772 _oops_do_mark_link = required_mark_nmethods;
1773 observed_mark_nmethods = (nmethod*)
1774 Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods);
1775 if (observed_mark_nmethods == required_mark_nmethods)
1776 break;
1777 }
1778 // Mark was clear when we first saw this guy.
1779 NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark"));
1780 return false;
1781 }
1782 }
1783 // On fall through, another racing thread marked this nmethod before we did.
1784 return true;
1785 }
1786
1787 void nmethod::oops_do_marking_prologue() {
1788 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue"));
1789 assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row");
1790 // We use cmpxchg_ptr instead of regular assignment here because the user
1791 // may fork a bunch of threads, and we need them all to see the same state.
1792 void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL);
1793 guarantee(observed == NULL, "no races in this sequential code");
1794 }
1795
1796 void nmethod::oops_do_marking_epilogue() {
1797 assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row");
1798 nmethod* cur = _oops_do_mark_nmethods;
1799 while (cur != NMETHOD_SENTINEL) {
1800 assert(cur != NULL, "not NULL-terminated");
1801 nmethod* next = cur->_oops_do_mark_link;
1802 cur->_oops_do_mark_link = NULL;
1803 cur->fix_oop_relocations();
1804 NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark"));
1805 cur = next;
1806 }
1807 void* required = _oops_do_mark_nmethods;
1808 void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required);
1809 guarantee(observed == required, "no races in this sequential code");
1810 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]"));
1811 }
1812
1813 class DetectScavengeRoot: public OopClosure {
1814 bool _detected_scavenge_root;
1815 public:
1816 DetectScavengeRoot() : _detected_scavenge_root(false)
1817 { NOT_PRODUCT(_print_nm = NULL); }
1818 bool detected_scavenge_root() { return _detected_scavenge_root; }
1819 virtual void do_oop(oop* p) {
1820 if ((*p) != NULL && (*p)->is_scavengable()) {
1821 NOT_PRODUCT(maybe_print(p));
1822 _detected_scavenge_root = true;
1823 }
1824 }
1825 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
1826
1827 #ifndef PRODUCT
1828 nmethod* _print_nm;
1829 void maybe_print(oop* p) {
1830 if (_print_nm == NULL) return;
1831 if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root");
1832 tty->print_cr(""PTR_FORMAT"[offset=%d] detected scavengable oop "PTR_FORMAT" (found at "PTR_FORMAT")",
1833 _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm),
1834 (intptr_t)(*p), (intptr_t)p);
1835 (*p)->print();
1836 }
1837 #endif //PRODUCT
1838 };
1839
1840 bool nmethod::detect_scavenge_root_oops() {
1841 DetectScavengeRoot detect_scavenge_root;
1842 NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this);
1843 oops_do(&detect_scavenge_root);
1844 return detect_scavenge_root.detected_scavenge_root();
1845 }
1846
1847 // Method that knows how to preserve outgoing arguments at call. This method must be
1848 // called with a frame corresponding to a Java invoke
1849 void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) {
1850 #ifndef SHARK
1851 if (!method()->is_native()) {
1852 SimpleScopeDesc ssd(this, fr.pc());
1853 Bytecode_invoke call(ssd.method(), ssd.bci());
1854 // compiled invokedynamic call sites have an implicit receiver at
1855 // resolution time, so make sure it gets GC'ed.
1856 bool has_receiver = !call.is_invokestatic();
1857 Symbol* signature = call.signature();
1858 fr.oops_compiled_arguments_do(signature, has_receiver, reg_map, f);
1859 }
1860 #endif // !SHARK
1861 }
1862
1863
1864 oop nmethod::embeddedOop_at(u_char* p) {
1865 RelocIterator iter(this, p, p + 1);
1866 while (iter.next())
1867 if (iter.type() == relocInfo::oop_type) {
1868 return iter.oop_reloc()->oop_value();
1869 }
1870 return NULL;
1871 }
1872
1873
1874 inline bool includes(void* p, void* from, void* to) {
1875 return from <= p && p < to;
1876 }
1877
1878
1879 void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) {
1880 assert(count >= 2, "must be sentinel values, at least");
1881
1882 #ifdef ASSERT
1883 // must be sorted and unique; we do a binary search in find_pc_desc()
1884 int prev_offset = pcs[0].pc_offset();
1885 assert(prev_offset == PcDesc::lower_offset_limit,
1886 "must start with a sentinel");
1887 for (int i = 1; i < count; i++) {
1888 int this_offset = pcs[i].pc_offset();
1889 assert(this_offset > prev_offset, "offsets must be sorted");
1890 prev_offset = this_offset;
1891 }
1892 assert(prev_offset == PcDesc::upper_offset_limit,
1893 "must end with a sentinel");
1894 #endif //ASSERT
1895
1896 // Search for MethodHandle invokes and tag the nmethod.
1897 for (int i = 0; i < count; i++) {
1898 if (pcs[i].is_method_handle_invoke()) {
1899 set_has_method_handle_invokes(true);
1900 break;
1901 }
1902 }
1903 assert(has_method_handle_invokes() == (_deoptimize_mh_offset != -1), "must have deopt mh handler");
1904
1905 int size = count * sizeof(PcDesc);
1906 assert(scopes_pcs_size() >= size, "oob");
1907 memcpy(scopes_pcs_begin(), pcs, size);
1908
1909 // Adjust the final sentinel downward.
1910 PcDesc* last_pc = &scopes_pcs_begin()[count-1];
1911 assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity");
1912 last_pc->set_pc_offset(content_size() + 1);
1913 for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) {
1914 // Fill any rounding gaps with copies of the last record.
1915 last_pc[1] = last_pc[0];
1916 }
1917 // The following assert could fail if sizeof(PcDesc) is not
1918 // an integral multiple of oopSize (the rounding term).
1919 // If it fails, change the logic to always allocate a multiple
1920 // of sizeof(PcDesc), and fill unused words with copies of *last_pc.
1921 assert(last_pc + 1 == scopes_pcs_end(), "must match exactly");
1922 }
1923
1924 void nmethod::copy_scopes_data(u_char* buffer, int size) {
1925 assert(scopes_data_size() >= size, "oob");
1926 memcpy(scopes_data_begin(), buffer, size);
1927 }
1928
1929
1930 #ifdef ASSERT
1931 static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) {
1932 PcDesc* lower = nm->scopes_pcs_begin();
1933 PcDesc* upper = nm->scopes_pcs_end();
1934 lower += 1; // exclude initial sentinel
1935 PcDesc* res = NULL;
1936 for (PcDesc* p = lower; p < upper; p++) {
1937 NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc
1938 if (match_desc(p, pc_offset, approximate)) {
1939 if (res == NULL)
1940 res = p;
1941 else
1942 res = (PcDesc*) badAddress;
1943 }
1944 }
1945 return res;
1946 }
1947 #endif
1948
1949
1950 // Finds a PcDesc with real-pc equal to "pc"
1951 PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) {
1952 address base_address = code_begin();
1953 if ((pc < base_address) ||
1954 (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) {
1955 return NULL; // PC is wildly out of range
1956 }
1957 int pc_offset = (int) (pc - base_address);
1958
1959 // Check the PcDesc cache if it contains the desired PcDesc
1960 // (This as an almost 100% hit rate.)
1961 PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate);
1962 if (res != NULL) {
1963 assert(res == linear_search(this, pc_offset, approximate), "cache ok");
1964 return res;
1965 }
1966
1967 // Fallback algorithm: quasi-linear search for the PcDesc
1968 // Find the last pc_offset less than the given offset.
1969 // The successor must be the required match, if there is a match at all.
1970 // (Use a fixed radix to avoid expensive affine pointer arithmetic.)
1971 PcDesc* lower = scopes_pcs_begin();
1972 PcDesc* upper = scopes_pcs_end();
1973 upper -= 1; // exclude final sentinel
1974 if (lower >= upper) return NULL; // native method; no PcDescs at all
1975
1976 #define assert_LU_OK \
1977 /* invariant on lower..upper during the following search: */ \
1978 assert(lower->pc_offset() < pc_offset, "sanity"); \
1979 assert(upper->pc_offset() >= pc_offset, "sanity")
1980 assert_LU_OK;
1981
1982 // Use the last successful return as a split point.
1983 PcDesc* mid = _pc_desc_cache.last_pc_desc();
1984 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1985 if (mid->pc_offset() < pc_offset) {
1986 lower = mid;
1987 } else {
1988 upper = mid;
1989 }
1990
1991 // Take giant steps at first (4096, then 256, then 16, then 1)
1992 const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1);
1993 const int RADIX = (1 << LOG2_RADIX);
1994 for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) {
1995 while ((mid = lower + step) < upper) {
1996 assert_LU_OK;
1997 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1998 if (mid->pc_offset() < pc_offset) {
1999 lower = mid;
2000 } else {
2001 upper = mid;
2002 break;
2003 }
2004 }
2005 assert_LU_OK;
2006 }
2007
2008 // Sneak up on the value with a linear search of length ~16.
2009 while (true) {
2010 assert_LU_OK;
2011 mid = lower + 1;
2012 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
2013 if (mid->pc_offset() < pc_offset) {
2014 lower = mid;
2015 } else {
2016 upper = mid;
2017 break;
2018 }
2019 }
2020 #undef assert_LU_OK
2021
2022 if (match_desc(upper, pc_offset, approximate)) {
2023 assert(upper == linear_search(this, pc_offset, approximate), "search ok");
2024 _pc_desc_cache.add_pc_desc(upper);
2025 return upper;
2026 } else {
2027 assert(NULL == linear_search(this, pc_offset, approximate), "search ok");
2028 return NULL;
2029 }
2030 }
2031
2032
2033 bool nmethod::check_all_dependencies() {
2034 bool found_check = false;
2035 // wholesale check of all dependencies
2036 for (Dependencies::DepStream deps(this); deps.next(); ) {
2037 if (deps.check_dependency() != NULL) {
2038 found_check = true;
2039 NOT_DEBUG(break);
2040 }
2041 }
2042 return found_check; // tell caller if we found anything
2043 }
2044
2045 bool nmethod::check_dependency_on(DepChange& changes) {
2046 // What has happened:
2047 // 1) a new class dependee has been added
2048 // 2) dependee and all its super classes have been marked
2049 bool found_check = false; // set true if we are upset
2050 for (Dependencies::DepStream deps(this); deps.next(); ) {
2051 // Evaluate only relevant dependencies.
2052 if (deps.spot_check_dependency_at(changes) != NULL) {
2053 found_check = true;
2054 NOT_DEBUG(break);
2055 }
2056 }
2057 return found_check;
2058 }
2059
2060 bool nmethod::is_evol_dependent_on(klassOop dependee) {
2061 instanceKlass *dependee_ik = instanceKlass::cast(dependee);
2062 objArrayOop dependee_methods = dependee_ik->methods();
2063 for (Dependencies::DepStream deps(this); deps.next(); ) {
2064 if (deps.type() == Dependencies::evol_method) {
2065 methodOop method = deps.method_argument(0);
2066 for (int j = 0; j < dependee_methods->length(); j++) {
2067 if ((methodOop) dependee_methods->obj_at(j) == method) {
2068 // RC_TRACE macro has an embedded ResourceMark
2069 RC_TRACE(0x01000000,
2070 ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)",
2071 _method->method_holder()->klass_part()->external_name(),
2072 _method->name()->as_C_string(),
2073 _method->signature()->as_C_string(), compile_id(),
2074 method->method_holder()->klass_part()->external_name(),
2075 method->name()->as_C_string(),
2076 method->signature()->as_C_string()));
2077 if (TraceDependencies || LogCompilation)
2078 deps.log_dependency(dependee);
2079 return true;
2080 }
2081 }
2082 }
2083 }
2084 return false;
2085 }
2086
2087 // Called from mark_for_deoptimization, when dependee is invalidated.
2088 bool nmethod::is_dependent_on_method(methodOop dependee) {
2089 for (Dependencies::DepStream deps(this); deps.next(); ) {
2090 if (deps.type() != Dependencies::evol_method)
2091 continue;
2092 methodOop method = deps.method_argument(0);
2093 if (method == dependee) return true;
2094 }
2095 return false;
2096 }
2097
2098
2099 bool nmethod::is_patchable_at(address instr_addr) {
2100 assert(insts_contains(instr_addr), "wrong nmethod used");
2101 if (is_zombie()) {
2102 // a zombie may never be patched
2103 return false;
2104 }
2105 return true;
2106 }
2107
2108
2109 address nmethod::continuation_for_implicit_exception(address pc) {
2110 // Exception happened outside inline-cache check code => we are inside
2111 // an active nmethod => use cpc to determine a return address
2112 int exception_offset = pc - code_begin();
2113 int cont_offset = ImplicitExceptionTable(this).at( exception_offset );
2114 #ifdef ASSERT
2115 if (cont_offset == 0) {
2116 Thread* thread = ThreadLocalStorage::get_thread_slow();
2117 ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
2118 HandleMark hm(thread);
2119 ResourceMark rm(thread);
2120 CodeBlob* cb = CodeCache::find_blob(pc);
2121 assert(cb != NULL && cb == this, "");
2122 tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc);
2123 print();
2124 method()->print_codes();
2125 print_code();
2126 print_pcs();
2127 }
2128 #endif
2129 if (cont_offset == 0) {
2130 // Let the normal error handling report the exception
2131 return NULL;
2132 }
2133 return code_begin() + cont_offset;
2134 }
2135
2136
2137
2138 void nmethod_init() {
2139 // make sure you didn't forget to adjust the filler fields
2140 assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word");
2141 }
2142
2143
2144 //-------------------------------------------------------------------------------------------
2145
2146
2147 // QQQ might we make this work from a frame??
2148 nmethodLocker::nmethodLocker(address pc) {
2149 CodeBlob* cb = CodeCache::find_blob(pc);
2150 guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found");
2151 _nm = (nmethod*)cb;
2152 lock_nmethod(_nm);
2153 }
2154
2155 // Only JvmtiDeferredEvent::compiled_method_unload_event()
2156 // should pass zombie_ok == true.
2157 void nmethodLocker::lock_nmethod(nmethod* nm, bool zombie_ok) {
2158 if (nm == NULL) return;
2159 Atomic::inc(&nm->_lock_count);
2160 guarantee(zombie_ok || !nm->is_zombie(), "cannot lock a zombie method");
2161 }
2162
2163 void nmethodLocker::unlock_nmethod(nmethod* nm) {
2164 if (nm == NULL) return;
2165 Atomic::dec(&nm->_lock_count);
2166 guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock");
2167 }
2168
2169
2170 // -----------------------------------------------------------------------------
2171 // nmethod::get_deopt_original_pc
2172 //
2173 // Return the original PC for the given PC if:
2174 // (a) the given PC belongs to a nmethod and
2175 // (b) it is a deopt PC
2176 address nmethod::get_deopt_original_pc(const frame* fr) {
2177 if (fr->cb() == NULL) return NULL;
2178
2179 nmethod* nm = fr->cb()->as_nmethod_or_null();
2180 if (nm != NULL && nm->is_deopt_pc(fr->pc()))
2181 return nm->get_original_pc(fr);
2182
2183 return NULL;
2184 }
2185
2186
2187 // -----------------------------------------------------------------------------
2188 // MethodHandle
2189
2190 bool nmethod::is_method_handle_return(address return_pc) {
2191 if (!has_method_handle_invokes()) return false;
2192 PcDesc* pd = pc_desc_at(return_pc);
2193 if (pd == NULL)
2194 return false;
2195 return pd->is_method_handle_invoke();
2196 }
2197
2198
2199 // -----------------------------------------------------------------------------
2200 // Verification
2201
2202 class VerifyOopsClosure: public OopClosure {
2203 nmethod* _nm;
2204 bool _ok;
2205 public:
2206 VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { }
2207 bool ok() { return _ok; }
2208 virtual void do_oop(oop* p) {
2209 if ((*p) == NULL || (*p)->is_oop()) return;
2210 if (_ok) {
2211 _nm->print_nmethod(true);
2212 _ok = false;
2213 }
2214 tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2215 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2216 }
2217 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2218 };
2219
2220 void nmethod::verify() {
2221
2222 // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant
2223 // seems odd.
2224
2225 if( is_zombie() || is_not_entrant() )
2226 return;
2227
2228 // Make sure all the entry points are correctly aligned for patching.
2229 NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point());
2230
2231 assert(method()->is_oop(), "must be valid");
2232
2233 ResourceMark rm;
2234
2235 if (!CodeCache::contains(this)) {
2236 fatal(err_msg("nmethod at " INTPTR_FORMAT " not in zone", this));
2237 }
2238
2239 if(is_native_method() )
2240 return;
2241
2242 nmethod* nm = CodeCache::find_nmethod(verified_entry_point());
2243 if (nm != this) {
2244 fatal(err_msg("findNMethod did not find this nmethod (" INTPTR_FORMAT ")",
2245 this));
2246 }
2247
2248 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2249 if (! p->verify(this)) {
2250 tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this);
2251 }
2252 }
2253
2254 VerifyOopsClosure voc(this);
2255 oops_do(&voc);
2256 assert(voc.ok(), "embedded oops must be OK");
2257 verify_scavenge_root_oops();
2258
2259 verify_scopes();
2260 }
2261
2262
2263 void nmethod::verify_interrupt_point(address call_site) {
2264 // This code does not work in release mode since
2265 // owns_lock only is available in debug mode.
2266 CompiledIC* ic = NULL;
2267 Thread *cur = Thread::current();
2268 if (CompiledIC_lock->owner() == cur ||
2269 ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) &&
2270 SafepointSynchronize::is_at_safepoint())) {
2271 ic = CompiledIC_at(call_site);
2272 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
2273 } else {
2274 MutexLocker ml_verify (CompiledIC_lock);
2275 ic = CompiledIC_at(call_site);
2276 }
2277 PcDesc* pd = pc_desc_at(ic->end_of_call());
2278 assert(pd != NULL, "PcDesc must exist");
2279 for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(),
2280 pd->obj_decode_offset(), pd->should_reexecute(),
2281 pd->return_oop());
2282 !sd->is_top(); sd = sd->sender()) {
2283 sd->verify();
2284 }
2285 }
2286
2287 void nmethod::verify_scopes() {
2288 if( !method() ) return; // Runtime stubs have no scope
2289 if (method()->is_native()) return; // Ignore stub methods.
2290 // iterate through all interrupt point
2291 // and verify the debug information is valid.
2292 RelocIterator iter((nmethod*)this);
2293 while (iter.next()) {
2294 address stub = NULL;
2295 switch (iter.type()) {
2296 case relocInfo::virtual_call_type:
2297 verify_interrupt_point(iter.addr());
2298 break;
2299 case relocInfo::opt_virtual_call_type:
2300 stub = iter.opt_virtual_call_reloc()->static_stub();
2301 verify_interrupt_point(iter.addr());
2302 break;
2303 case relocInfo::static_call_type:
2304 stub = iter.static_call_reloc()->static_stub();
2305 //verify_interrupt_point(iter.addr());
2306 break;
2307 case relocInfo::runtime_call_type:
2308 address destination = iter.reloc()->value();
2309 // Right now there is no way to find out which entries support
2310 // an interrupt point. It would be nice if we had this
2311 // information in a table.
2312 break;
2313 }
2314 assert(stub == NULL || stub_contains(stub), "static call stub outside stub section");
2315 }
2316 }
2317
2318
2319 // -----------------------------------------------------------------------------
2320 // Non-product code
2321 #ifndef PRODUCT
2322
2323 class DebugScavengeRoot: public OopClosure {
2324 nmethod* _nm;
2325 bool _ok;
2326 public:
2327 DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { }
2328 bool ok() { return _ok; }
2329 virtual void do_oop(oop* p) {
2330 if ((*p) == NULL || !(*p)->is_scavengable()) return;
2331 if (_ok) {
2332 _nm->print_nmethod(true);
2333 _ok = false;
2334 }
2335 tty->print_cr("*** scavengable oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2336 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2337 (*p)->print();
2338 }
2339 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2340 };
2341
2342 void nmethod::verify_scavenge_root_oops() {
2343 if (!on_scavenge_root_list()) {
2344 // Actually look inside, to verify the claim that it's clean.
2345 DebugScavengeRoot debug_scavenge_root(this);
2346 oops_do(&debug_scavenge_root);
2347 if (!debug_scavenge_root.ok())
2348 fatal("found an unadvertised bad scavengable oop in the code cache");
2349 }
2350 assert(scavenge_root_not_marked(), "");
2351 }
2352
2353 #endif // PRODUCT
2354
2355 // Printing operations
2356
2357 void nmethod::print() const {
2358 ResourceMark rm;
2359 ttyLocker ttyl; // keep the following output all in one block
2360
2361 tty->print("Compiled method ");
2362
2363 if (is_compiled_by_c1()) {
2364 tty->print("(c1) ");
2365 } else if (is_compiled_by_c2()) {
2366 tty->print("(c2) ");
2367 } else if (is_compiled_by_shark()) {
2368 tty->print("(shark) ");
2369 } else {
2370 tty->print("(nm) ");
2371 }
2372
2373 print_on(tty, NULL);
2374
2375 if (WizardMode) {
2376 tty->print("((nmethod*) "INTPTR_FORMAT ") ", this);
2377 tty->print(" for method " INTPTR_FORMAT , (address)method());
2378 tty->print(" { ");
2379 if (is_in_use()) tty->print("in_use ");
2380 if (is_not_entrant()) tty->print("not_entrant ");
2381 if (is_zombie()) tty->print("zombie ");
2382 if (is_unloaded()) tty->print("unloaded ");
2383 if (on_scavenge_root_list()) tty->print("scavenge_root ");
2384 tty->print_cr("}:");
2385 }
2386 if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2387 (address)this,
2388 (address)this + size(),
2389 size());
2390 if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2391 relocation_begin(),
2392 relocation_end(),
2393 relocation_size());
2394 if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2395 consts_begin(),
2396 consts_end(),
2397 consts_size());
2398 if (insts_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2399 insts_begin(),
2400 insts_end(),
2401 insts_size());
2402 if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2403 stub_begin(),
2404 stub_end(),
2405 stub_size());
2406 if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2407 oops_begin(),
2408 oops_end(),
2409 oops_size());
2410 if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2411 scopes_data_begin(),
2412 scopes_data_end(),
2413 scopes_data_size());
2414 if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2415 scopes_pcs_begin(),
2416 scopes_pcs_end(),
2417 scopes_pcs_size());
2418 if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2419 dependencies_begin(),
2420 dependencies_end(),
2421 dependencies_size());
2422 if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2423 handler_table_begin(),
2424 handler_table_end(),
2425 handler_table_size());
2426 if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2427 nul_chk_table_begin(),
2428 nul_chk_table_end(),
2429 nul_chk_table_size());
2430 }
2431
2432 void nmethod::print_code() {
2433 HandleMark hm;
2434 ResourceMark m;
2435 Disassembler::decode(this);
2436 }
2437
2438
2439 #ifndef PRODUCT
2440
2441 void nmethod::print_scopes() {
2442 // Find the first pc desc for all scopes in the code and print it.
2443 ResourceMark rm;
2444 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2445 if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null)
2446 continue;
2447
2448 ScopeDesc* sd = scope_desc_at(p->real_pc(this));
2449 sd->print_on(tty, p);
2450 }
2451 }
2452
2453 void nmethod::print_dependencies() {
2454 ResourceMark rm;
2455 ttyLocker ttyl; // keep the following output all in one block
2456 tty->print_cr("Dependencies:");
2457 for (Dependencies::DepStream deps(this); deps.next(); ) {
2458 deps.print_dependency();
2459 klassOop ctxk = deps.context_type();
2460 if (ctxk != NULL) {
2461 Klass* k = Klass::cast(ctxk);
2462 if (k->oop_is_instance() && ((instanceKlass*)k)->is_dependent_nmethod(this)) {
2463 tty->print_cr(" [nmethod<=klass]%s", k->external_name());
2464 }
2465 }
2466 deps.log_dependency(); // put it into the xml log also
2467 }
2468 }
2469
2470
2471 void nmethod::print_relocations() {
2472 ResourceMark m; // in case methods get printed via the debugger
2473 tty->print_cr("relocations:");
2474 RelocIterator iter(this);
2475 iter.print();
2476 if (UseRelocIndex) {
2477 jint* index_end = (jint*)relocation_end() - 1;
2478 jint index_size = *index_end;
2479 jint* index_start = (jint*)( (address)index_end - index_size );
2480 tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size);
2481 if (index_size > 0) {
2482 jint* ip;
2483 for (ip = index_start; ip+2 <= index_end; ip += 2)
2484 tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT,
2485 ip[0],
2486 ip[1],
2487 header_end()+ip[0],
2488 relocation_begin()-1+ip[1]);
2489 for (; ip < index_end; ip++)
2490 tty->print_cr(" (%d ?)", ip[0]);
2491 tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip);
2492 ip++;
2493 tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip);
2494 }
2495 }
2496 }
2497
2498
2499 void nmethod::print_pcs() {
2500 ResourceMark m; // in case methods get printed via debugger
2501 tty->print_cr("pc-bytecode offsets:");
2502 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2503 p->print(this);
2504 }
2505 }
2506
2507 #endif // PRODUCT
2508
2509 const char* nmethod::reloc_string_for(u_char* begin, u_char* end) {
2510 RelocIterator iter(this, begin, end);
2511 bool have_one = false;
2512 while (iter.next()) {
2513 have_one = true;
2514 switch (iter.type()) {
2515 case relocInfo::none: return "no_reloc";
2516 case relocInfo::oop_type: {
2517 stringStream st;
2518 oop_Relocation* r = iter.oop_reloc();
2519 oop obj = r->oop_value();
2520 st.print("oop(");
2521 if (obj == NULL) st.print("NULL");
2522 else obj->print_value_on(&st);
2523 st.print(")");
2524 return st.as_string();
2525 }
2526 case relocInfo::virtual_call_type: return "virtual_call";
2527 case relocInfo::opt_virtual_call_type: return "optimized virtual_call";
2528 case relocInfo::static_call_type: return "static_call";
2529 case relocInfo::static_stub_type: return "static_stub";
2530 case relocInfo::runtime_call_type: return "runtime_call";
2531 case relocInfo::external_word_type: return "external_word";
2532 case relocInfo::internal_word_type: return "internal_word";
2533 case relocInfo::section_word_type: return "section_word";
2534 case relocInfo::poll_type: return "poll";
2535 case relocInfo::poll_return_type: return "poll_return";
2536 case relocInfo::type_mask: return "type_bit_mask";
2537 }
2538 }
2539 return have_one ? "other" : NULL;
2540 }
2541
2542 // Return a the last scope in (begin..end]
2543 ScopeDesc* nmethod::scope_desc_in(address begin, address end) {
2544 PcDesc* p = pc_desc_near(begin+1);
2545 if (p != NULL && p->real_pc(this) <= end) {
2546 return new ScopeDesc(this, p->scope_decode_offset(),
2547 p->obj_decode_offset(), p->should_reexecute(),
2548 p->return_oop());
2549 }
2550 return NULL;
2551 }
2552
2553 void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) {
2554 if (block_begin == entry_point()) stream->print_cr("[Entry Point]");
2555 if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]");
2556 if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]");
2557 if (block_begin == stub_begin()) stream->print_cr("[Stub Code]");
2558 if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]");
2559
2560 if (has_method_handle_invokes())
2561 if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]");
2562
2563 if (block_begin == consts_begin()) stream->print_cr("[Constants]");
2564
2565 if (block_begin == entry_point()) {
2566 methodHandle m = method();
2567 if (m.not_null()) {
2568 stream->print(" # ");
2569 m->print_value_on(stream);
2570 stream->cr();
2571 }
2572 if (m.not_null() && !is_osr_method()) {
2573 ResourceMark rm;
2574 int sizeargs = m->size_of_parameters();
2575 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs);
2576 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs);
2577 {
2578 int sig_index = 0;
2579 if (!m->is_static())
2580 sig_bt[sig_index++] = T_OBJECT; // 'this'
2581 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) {
2582 BasicType t = ss.type();
2583 sig_bt[sig_index++] = t;
2584 if (type2size[t] == 2) {
2585 sig_bt[sig_index++] = T_VOID;
2586 } else {
2587 assert(type2size[t] == 1, "size is 1 or 2");
2588 }
2589 }
2590 assert(sig_index == sizeargs, "");
2591 }
2592 const char* spname = "sp"; // make arch-specific?
2593 intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false);
2594 int stack_slot_offset = this->frame_size() * wordSize;
2595 int tab1 = 14, tab2 = 24;
2596 int sig_index = 0;
2597 int arg_index = (m->is_static() ? 0 : -1);
2598 bool did_old_sp = false;
2599 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) {
2600 bool at_this = (arg_index == -1);
2601 bool at_old_sp = false;
2602 BasicType t = (at_this ? T_OBJECT : ss.type());
2603 assert(t == sig_bt[sig_index], "sigs in sync");
2604 if (at_this)
2605 stream->print(" # this: ");
2606 else
2607 stream->print(" # parm%d: ", arg_index);
2608 stream->move_to(tab1);
2609 VMReg fst = regs[sig_index].first();
2610 VMReg snd = regs[sig_index].second();
2611 if (fst->is_reg()) {
2612 stream->print("%s", fst->name());
2613 if (snd->is_valid()) {
2614 stream->print(":%s", snd->name());
2615 }
2616 } else if (fst->is_stack()) {
2617 int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset;
2618 if (offset == stack_slot_offset) at_old_sp = true;
2619 stream->print("[%s+0x%x]", spname, offset);
2620 } else {
2621 stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd);
2622 }
2623 stream->print(" ");
2624 stream->move_to(tab2);
2625 stream->print("= ");
2626 if (at_this) {
2627 m->method_holder()->print_value_on(stream);
2628 } else {
2629 bool did_name = false;
2630 if (!at_this && ss.is_object()) {
2631 Symbol* name = ss.as_symbol_or_null();
2632 if (name != NULL) {
2633 name->print_value_on(stream);
2634 did_name = true;
2635 }
2636 }
2637 if (!did_name)
2638 stream->print("%s", type2name(t));
2639 }
2640 if (at_old_sp) {
2641 stream->print(" (%s of caller)", spname);
2642 did_old_sp = true;
2643 }
2644 stream->cr();
2645 sig_index += type2size[t];
2646 arg_index += 1;
2647 if (!at_this) ss.next();
2648 }
2649 if (!did_old_sp) {
2650 stream->print(" # ");
2651 stream->move_to(tab1);
2652 stream->print("[%s+0x%x]", spname, stack_slot_offset);
2653 stream->print(" (%s of caller)", spname);
2654 stream->cr();
2655 }
2656 }
2657 }
2658 }
2659
2660 void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) {
2661 // First, find an oopmap in (begin, end].
2662 // We use the odd half-closed interval so that oop maps and scope descs
2663 // which are tied to the byte after a call are printed with the call itself.
2664 address base = code_begin();
2665 OopMapSet* oms = oop_maps();
2666 if (oms != NULL) {
2667 for (int i = 0, imax = oms->size(); i < imax; i++) {
2668 OopMap* om = oms->at(i);
2669 address pc = base + om->offset();
2670 if (pc > begin) {
2671 if (pc <= end) {
2672 st->move_to(column);
2673 st->print("; ");
2674 om->print_on(st);
2675 }
2676 break;
2677 }
2678 }
2679 }
2680
2681 // Print any debug info present at this pc.
2682 ScopeDesc* sd = scope_desc_in(begin, end);
2683 if (sd != NULL) {
2684 st->move_to(column);
2685 if (sd->bci() == SynchronizationEntryBCI) {
2686 st->print(";*synchronization entry");
2687 } else {
2688 if (sd->method().is_null()) {
2689 st->print("method is NULL");
2690 } else if (sd->method()->is_native()) {
2691 st->print("method is native");
2692 } else {
2693 Bytecodes::Code bc = sd->method()->java_code_at(sd->bci());
2694 st->print(";*%s", Bytecodes::name(bc));
2695 switch (bc) {
2696 case Bytecodes::_invokevirtual:
2697 case Bytecodes::_invokespecial:
2698 case Bytecodes::_invokestatic:
2699 case Bytecodes::_invokeinterface:
2700 {
2701 Bytecode_invoke invoke(sd->method(), sd->bci());
2702 st->print(" ");
2703 if (invoke.name() != NULL)
2704 invoke.name()->print_symbol_on(st);
2705 else
2706 st->print("<UNKNOWN>");
2707 break;
2708 }
2709 case Bytecodes::_getfield:
2710 case Bytecodes::_putfield:
2711 case Bytecodes::_getstatic:
2712 case Bytecodes::_putstatic:
2713 {
2714 Bytecode_field field(sd->method(), sd->bci());
2715 st->print(" ");
2716 if (field.name() != NULL)
2717 field.name()->print_symbol_on(st);
2718 else
2719 st->print("<UNKNOWN>");
2720 }
2721 }
2722 }
2723 }
2724
2725 // Print all scopes
2726 for (;sd != NULL; sd = sd->sender()) {
2727 st->move_to(column);
2728 st->print("; -");
2729 if (sd->method().is_null()) {
2730 st->print("method is NULL");
2731 } else {
2732 sd->method()->print_short_name(st);
2733 }
2734 int lineno = sd->method()->line_number_from_bci(sd->bci());
2735 if (lineno != -1) {
2736 st->print("@%d (line %d)", sd->bci(), lineno);
2737 } else {
2738 st->print("@%d", sd->bci());
2739 }
2740 st->cr();
2741 }
2742 }
2743
2744 // Print relocation information
2745 const char* str = reloc_string_for(begin, end);
2746 if (str != NULL) {
2747 if (sd != NULL) st->cr();
2748 st->move_to(column);
2749 st->print("; {%s}", str);
2750 }
2751 int cont_offset = ImplicitExceptionTable(this).at(begin - code_begin());
2752 if (cont_offset != 0) {
2753 st->move_to(column);
2754 st->print("; implicit exception: dispatches to " INTPTR_FORMAT, code_begin() + cont_offset);
2755 }
2756
2757 }
2758
2759 #ifndef PRODUCT
2760
2761 void nmethod::print_value_on(outputStream* st) const {
2762 st->print("nmethod");
2763 print_on(st, NULL);
2764 }
2765
2766 void nmethod::print_calls(outputStream* st) {
2767 RelocIterator iter(this);
2768 while (iter.next()) {
2769 switch (iter.type()) {
2770 case relocInfo::virtual_call_type:
2771 case relocInfo::opt_virtual_call_type: {
2772 VerifyMutexLocker mc(CompiledIC_lock);
2773 CompiledIC_at(iter.reloc())->print();
2774 break;
2775 }
2776 case relocInfo::static_call_type:
2777 st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr());
2778 compiledStaticCall_at(iter.reloc())->print();
2779 break;
2780 }
2781 }
2782 }
2783
2784 void nmethod::print_handler_table() {
2785 ExceptionHandlerTable(this).print();
2786 }
2787
2788 void nmethod::print_nul_chk_table() {
2789 ImplicitExceptionTable(this).print(code_begin());
2790 }
2791
2792 void nmethod::print_statistics() {
2793 ttyLocker ttyl;
2794 if (xtty != NULL) xtty->head("statistics type='nmethod'");
2795 nmethod_stats.print_native_nmethod_stats();
2796 nmethod_stats.print_nmethod_stats();
2797 DebugInformationRecorder::print_statistics();
2798 nmethod_stats.print_pc_stats();
2799 Dependencies::print_statistics();
2800 if (xtty != NULL) xtty->tail("statistics");
2801 }
2802
2803 #endif // PRODUCT