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