1 /*
2 * Copyright (c) 1997, 2025, 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 "cds/heapShared.hpp"
26 #include "classfile/classPrinter.hpp"
27 #include "classfile/javaClasses.inline.hpp"
28 #include "interpreter/bytecodeHistogram.hpp"
29 #include "interpreter/bytecodeStream.hpp"
30 #include "interpreter/bytecodeTracer.hpp"
31 #include "interpreter/bytecodes.hpp"
32 #include "interpreter/interpreter.hpp"
33 #include "interpreter/interpreterRuntime.hpp"
34 #include "memory/resourceArea.hpp"
35 #include "oops/constantPool.inline.hpp"
36 #include "oops/methodData.hpp"
37 #include "oops/method.hpp"
38 #include "oops/resolvedFieldEntry.hpp"
39 #include "oops/resolvedIndyEntry.hpp"
40 #include "oops/resolvedMethodEntry.hpp"
41 #include "runtime/handles.inline.hpp"
42 #include "runtime/mutexLocker.hpp"
43 #include "runtime/osThread.hpp"
44 #include "runtime/timer.hpp"
45 #include "utilities/align.hpp"
46
47 // Prints the current bytecode and its attributes using bytecode-specific information.
48
49 class BytecodePrinter {
50 private:
51 // %%% This field is not GC-ed, and so can contain garbage
52 // between critical sections. Use only pointer-comparison
53 // operations on the pointer, except within a critical section.
54 // (Also, ensure that occasional false positives are benign.)
55 Method* _current_method;
56 bool _is_wide;
57 Bytecodes::Code _code;
58 address _next_pc; // current decoding position
59 int _flags;
60 bool _is_linked;
61
62 bool is_linked() const { return _is_linked; }
63 void align() { _next_pc = align_up(_next_pc, sizeof(jint)); }
64 int get_byte() { return *(jbyte*) _next_pc++; } // signed
65 int get_index_u1() { return *(address)_next_pc++; } // returns 0x00 - 0xff as an int
66 short get_short() { short i = Bytes::get_Java_u2 (_next_pc); _next_pc += 2; return i; }
67 int get_int() { int i = Bytes::get_Java_u4 (_next_pc); _next_pc += 4; return i; }
68 int get_native_index_u2() { int i = Bytes::get_native_u2(_next_pc); _next_pc += 2; return i; }
69 int get_native_index_u4() { int i = Bytes::get_native_u4(_next_pc); _next_pc += 4; return i; }
70 int get_Java_index_u2() { int i = Bytes::get_Java_u2 (_next_pc); _next_pc += 2; return i; }
71 int get_Java_index_u4() { int i = Bytes::get_Java_u4 (_next_pc); _next_pc += 4; return i; }
72 int get_index_special() { return (is_wide()) ? get_Java_index_u2() : get_index_u1(); }
73 Method* method() const { return _current_method; }
74 bool is_wide() const { return _is_wide; }
75 Bytecodes::Code raw_code() const { return Bytecodes::Code(_code); }
76 ConstantPool* constants() const { return method()->constants(); }
77 ConstantPoolCache* cpcache() const { assert(is_linked(), "must be"); return constants()->cache(); }
78
79 void print_constant(int i, outputStream* st);
80 void print_cpcache_entry(int cpc_index, outputStream* st);
81 void print_invokedynamic(int indy_index, int cp_index, outputStream* st);
82 void print_bsm(int cp_index, outputStream* st);
83 void print_field_or_method(int cp_index, outputStream* st);
84 void print_dynamic(int cp_index, outputStream* st);
85 void print_attributes(int bci, outputStream* st);
86 void bytecode_epilog(int bci, outputStream* st);
87
88 public:
89 BytecodePrinter(int flags = 0) {
90 _is_wide = false;
91 _code = Bytecodes::_illegal;
92 _flags = flags;
93 }
94
95 // This method is called while executing the raw bytecodes, so none of
96 // the adjustments that BytecodeStream performs applies.
97 void trace(const methodHandle& method, address bcp, uintptr_t tos, uintptr_t tos2, outputStream* st) {
98 ResourceMark rm;
99 bool method_changed = _current_method != method();
100 if (method_changed) {
101 // Note 1: This code will not work as expected with true MT/MP.
102 // Need an explicit lock or a different solution.
103 // It is possible for this block to be skipped, if a garbage
104 // _current_method pointer happens to have the same bits as
105 // the incoming method. We could lose a line of trace output.
106 // This is acceptable in a debug-only feature.
107 st->cr();
108 st->print("[%zu] ", Thread::current()->osthread()->thread_id_for_printing());
109 method->print_name(st);
110 st->cr();
111 _current_method = method();
112 _is_linked = method->method_holder()->is_linked();
113 assert(_is_linked, "this function must be called on methods that are already executing");
114 }
115 Bytecodes::Code code;
116 if (is_wide()) {
117 // bcp wasn't advanced if previous bytecode was _wide.
118 code = Bytecodes::code_at(method(), bcp+1);
119 } else {
120 code = Bytecodes::code_at(method(), bcp);
121 }
122 _code = code;
123 _next_pc = is_wide() ? bcp+2 : bcp+1;
124 // Trace each bytecode unless we're truncating the tracing output, then only print the first
125 // bytecode in every method as well as returns/throws that pop control flow
126 if (!TraceBytecodesTruncated || method_changed ||
127 code == Bytecodes::_athrow ||
128 code == Bytecodes::_return_register_finalizer ||
129 (code >= Bytecodes::_ireturn && code <= Bytecodes::_return)) {
130 int bci = (int)(bcp - method->code_base());
131 st->print("[%zu] ", Thread::current()->osthread()->thread_id_for_printing());
132 if (Verbose) {
133 st->print("%8zu %4d " INTPTR_FORMAT " " INTPTR_FORMAT " %s",
134 BytecodeCounter::counter_value(), bci, tos, tos2, Bytecodes::name(code));
135 } else {
136 st->print("%8zu %4d %s",
137 BytecodeCounter::counter_value(), bci, Bytecodes::name(code));
138 }
139 print_attributes(bci, st);
140 }
141 // Set is_wide for the next one, since the caller of this doesn't skip
142 // the next bytecode.
143 _is_wide = (code == Bytecodes::_wide);
144 _code = Bytecodes::_illegal;
145
146 #ifndef PRODUCT
147 if (TraceBytecodesStopAt != 0 && BytecodeCounter::counter_value() >= TraceBytecodesStopAt) {
148 TraceBytecodes = false;
149 }
150 #endif
151 }
152
153 // Used for Method*::print_codes(). The input bcp comes from
154 // BytecodeStream, which will skip wide bytecodes.
155 void trace(const methodHandle& method, address bcp, outputStream* st) {
156 _current_method = method();
157 _is_linked = method->method_holder()->is_linked();
158 ResourceMark rm;
159 Bytecodes::Code code = Bytecodes::code_at(method(), bcp);
160 // Set is_wide
161 _is_wide = (code == Bytecodes::_wide);
162 if (is_wide()) {
163 code = Bytecodes::code_at(method(), bcp+1);
164 }
165 _code = code;
166 int bci = (int)(bcp - method->code_base());
167 // Print bytecode index and name
168 if (ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_BYTECODE_ADDR)) {
169 st->print(INTPTR_FORMAT " ", p2i(bcp));
170 }
171 if (is_wide()) {
172 st->print("%4d %s_w", bci, Bytecodes::name(code));
173 } else {
174 st->print("%4d %s", bci, Bytecodes::name(code));
175 }
176 _next_pc = is_wide() ? bcp+2 : bcp+1;
177 print_attributes(bci, st);
178 if (ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_PROFILE)) {
179 bytecode_epilog(bci, st);
180 }
181 }
182 };
183
184 // We need a global instance to keep track of the states when the bytecodes
185 // are executed. Access by multiple threads are controlled by ttyLocker.
186 static BytecodePrinter _interpreter_printer;
187
188 void BytecodeTracer::trace_interpreter(const methodHandle& method, address bcp, uintptr_t tos, uintptr_t tos2, outputStream* st) {
189 if (TraceBytecodes && BytecodeCounter::counter_value() >= TraceBytecodesAt) {
190 ttyLocker ttyl; // 5065316: keep the following output coherent
191 // The ttyLocker also prevents races between two threads
192 // trying to use the single instance of BytecodePrinter.
193 //
194 // There used to be a leaf mutex here, but the ttyLocker will
195 // work just as well, as long as the printing operations never block.
196 _interpreter_printer.trace(method, bcp, tos, tos2, st);
197 }
198 }
199
200 void BytecodeTracer::print_method_codes(const methodHandle& method, int from, int to, outputStream* st, int flags) {
201 BytecodePrinter method_printer(flags);
202 BytecodeStream s(method);
203 s.set_interval(from, to);
204
205 // Keep output to st coherent: collect all lines and print at once.
206 ResourceMark rm;
207 stringStream ss;
208 while (s.next() >= 0) {
209 method_printer.trace(method, s.bcp(), &ss);
210 }
211 st->print("%s", ss.as_string());
212 }
213
214 void BytecodePrinter::print_constant(int cp_index, outputStream* st) {
215 ConstantPool* constants = method()->constants();
216 constantTag tag = constants->tag_at(cp_index);
217
218 if (tag.is_int()) {
219 st->print_cr(" " INT32_FORMAT, constants->int_at(cp_index));
220 } else if (tag.is_long()) {
221 st->print_cr(" " INT64_FORMAT, (int64_t)(constants->long_at(cp_index)));
222 } else if (tag.is_float()) {
223 st->print_cr(" %f", constants->float_at(cp_index));
224 } else if (tag.is_double()) {
225 st->print_cr(" %f", constants->double_at(cp_index));
226 } else if (tag.is_string()) {
227 const char* string = constants->unresolved_string_at(cp_index)->as_quoted_ascii();
228 st->print_cr(" \"%s\"", string);
229 } else if (tag.is_klass()) {
230 st->print_cr(" %s", constants->resolved_klass_at(cp_index)->external_name());
231 } else if (tag.is_unresolved_klass()) {
232 st->print_cr(" %s", constants->klass_at_noresolve(cp_index)->as_quoted_ascii());
233 } else if (tag.is_method_type()) {
234 int i2 = constants->method_type_index_at(cp_index);
235 st->print(" <MethodType> %d", i2);
236 st->print_cr(" %s", constants->symbol_at(i2)->as_quoted_ascii());
237 } else if (tag.is_method_handle()) {
238 int kind = constants->method_handle_ref_kind_at(cp_index);
239 int i2 = constants->method_handle_index_at(cp_index);
240 st->print(" <MethodHandle of kind %d index at %d>", kind, i2);
241 print_field_or_method(i2, st);
242 } else if (tag.is_dynamic_constant()) {
243 print_dynamic(cp_index, st);
244 if (ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_DYNAMIC)) {
245 print_bsm(cp_index, st);
246 }
247 } else {
248 st->print_cr(" bad tag=%d at %d", tag.value(), cp_index);
249 }
250 }
251
252 // Fieldref, Methodref, or InterfaceMethodref
253 void BytecodePrinter::print_field_or_method(int cp_index, outputStream* st) {
254 ConstantPool* constants = method()->constants();
255 constantTag tag = constants->tag_at(cp_index);
256
257 switch (tag.value()) {
258 case JVM_CONSTANT_Fieldref:
259 case JVM_CONSTANT_Methodref:
260 case JVM_CONSTANT_InterfaceMethodref:
261 break;
262 default:
263 st->print_cr(" bad tag=%d at %d", tag.value(), cp_index);
264 return;
265 }
266
267 Symbol* name = constants->uncached_name_ref_at(cp_index);
268 Symbol* signature = constants->uncached_signature_ref_at(cp_index);
269 Symbol* klass = constants->klass_name_at(constants->uncached_klass_ref_index_at(cp_index));
270 const char* sep = (tag.is_field() ? ":" : "");
271 st->print_cr(" %d <%s.%s%s%s> ", cp_index, klass->as_C_string(), name->as_C_string(), sep, signature->as_C_string());
272 }
273
274 // JVM_CONSTANT_Dynamic or JVM_CONSTANT_InvokeDynamic
275 void BytecodePrinter::print_dynamic(int cp_index, outputStream* st) {
276 ConstantPool* constants = method()->constants();
277 constantTag tag = constants->tag_at(cp_index);
278
279 switch (tag.value()) {
280 case JVM_CONSTANT_Dynamic:
281 case JVM_CONSTANT_InvokeDynamic:
282 break;
283 default:
284 st->print_cr(" bad tag=%d at %d", tag.value(), cp_index);
285 return;
286 }
287
288 int bsm = constants->bootstrap_method_ref_index_at(cp_index);
289 st->print(" bsm=%d", bsm);
290
291 Symbol* name = constants->uncached_name_ref_at(cp_index);
292 Symbol* signature = constants->uncached_signature_ref_at(cp_index);
293 const char* sep = tag.is_dynamic_constant() ? ":" : "";
294 st->print_cr(" %d <%s%s%s>", cp_index, name->as_C_string(), sep, signature->as_C_string());
295 }
296
297 void BytecodePrinter::print_invokedynamic(int indy_index, int cp_index, outputStream* st) {
298 print_dynamic(cp_index, st);
299
300 if (ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_DYNAMIC)) {
301 print_bsm(cp_index, st);
302
303 if (is_linked()) {
304 ResolvedIndyEntry* indy_entry = constants()->resolved_indy_entry_at(indy_index);
305 st->print(" ResolvedIndyEntry: ");
306 indy_entry->print_on(st);
307 if (indy_entry->has_appendix()) {
308 oop apx = constants()->resolved_reference_from_indy(indy_index);
309 st->print_cr(" - appendix = " INTPTR_FORMAT, p2i(apx));
310 }
311 }
312 }
313 }
314
315 // cp_index: must be the cp_index of a JVM_CONSTANT_{Dynamic, DynamicInError, InvokeDynamic}
316 void BytecodePrinter::print_bsm(int cp_index, outputStream* st) {
317 assert(constants()->tag_at(cp_index).has_bootstrap(), "must be");
318 int bsm = constants()->bootstrap_method_ref_index_at(cp_index);
319 const char* ref_kind = "";
320 switch (constants()->method_handle_ref_kind_at(bsm)) {
321 case JVM_REF_getField : ref_kind = "REF_getField"; break;
322 case JVM_REF_getStatic : ref_kind = "REF_getStatic"; break;
323 case JVM_REF_putField : ref_kind = "REF_putField"; break;
324 case JVM_REF_putStatic : ref_kind = "REF_putStatic"; break;
325 case JVM_REF_invokeVirtual : ref_kind = "REF_invokeVirtual"; break;
326 case JVM_REF_invokeStatic : ref_kind = "REF_invokeStatic"; break;
327 case JVM_REF_invokeSpecial : ref_kind = "REF_invokeSpecial"; break;
328 case JVM_REF_newInvokeSpecial : ref_kind = "REF_newInvokeSpecial"; break;
329 case JVM_REF_invokeInterface : ref_kind = "REF_invokeInterface"; break;
330 default : ShouldNotReachHere();
331 }
332 st->print(" BSM: %s", ref_kind);
333 print_field_or_method(constants()->method_handle_index_at(bsm), st);
334 int argc = constants()->bootstrap_argument_count_at(cp_index);
335 st->print(" arguments[%d] = {", argc);
336 if (argc > 0) {
337 st->cr();
338 for (int arg_i = 0; arg_i < argc; arg_i++) {
339 int arg = constants()->bootstrap_argument_index_at(cp_index, arg_i);
340 st->print(" ");
341 print_constant(arg, st);
342 }
343 }
344 st->print_cr(" }");
345 }
346
347 void BytecodePrinter::print_attributes(int bci, outputStream* st) {
348 // Show attributes of pre-rewritten codes
349 Bytecodes::Code code = Bytecodes::java_code(raw_code());
350 // If the code doesn't have any fields there's nothing to print.
351 // note this is ==1 because the tableswitch and lookupswitch are
352 // zero size (for some reason) and we want to print stuff out for them.
353 // Also skip this if we're truncating bytecode output
354 if (TraceBytecodesTruncated || Bytecodes::length_for(code) == 1) {
355 st->cr();
356 return;
357 }
358
359 switch(code) {
360 // Java specific bytecodes only matter.
361 case Bytecodes::_bipush:
362 st->print_cr(" " INT32_FORMAT, get_byte());
363 break;
364 case Bytecodes::_sipush:
365 st->print_cr(" " INT32_FORMAT, get_short());
366 break;
367 case Bytecodes::_ldc:
368 {
369 int cp_index;
370 if (Bytecodes::uses_cp_cache(raw_code())) {
371 assert(is_linked(), "fast ldc bytecode must be in linked classes");
372 int obj_index = get_index_u1();
373 cp_index = constants()->object_to_cp_index(obj_index);
374 } else {
375 cp_index = get_index_u1();
376 }
377 print_constant(cp_index, st);
378 }
379 break;
380
381 case Bytecodes::_ldc_w:
382 case Bytecodes::_ldc2_w:
383 {
384 int cp_index;
385 if (Bytecodes::uses_cp_cache(raw_code())) {
386 assert(is_linked(), "fast ldc bytecode must be in linked classes");
387 int obj_index = get_native_index_u2();
388 cp_index = constants()->object_to_cp_index(obj_index);
389 } else {
390 cp_index = get_Java_index_u2();
391 }
392 print_constant(cp_index, st);
393 }
394 break;
395
396 case Bytecodes::_iload:
397 case Bytecodes::_lload:
398 case Bytecodes::_fload:
399 case Bytecodes::_dload:
400 case Bytecodes::_aload:
401 case Bytecodes::_istore:
402 case Bytecodes::_lstore:
403 case Bytecodes::_fstore:
404 case Bytecodes::_dstore:
405 case Bytecodes::_astore:
406 st->print_cr(" #%d", get_index_special());
407 break;
408
409 case Bytecodes::_iinc:
410 { int index = get_index_special();
411 jint offset = is_wide() ? get_short(): get_byte();
412 st->print_cr(" #%d " INT32_FORMAT, index, offset);
413 }
414 break;
415
416 case Bytecodes::_newarray: {
417 BasicType atype = (BasicType)get_index_u1();
418 const char* str = type2name(atype);
419 if (str == nullptr || is_reference_type(atype)) {
420 assert(false, "Unidentified basic type");
421 }
422 st->print_cr(" %s", str);
423 }
424 break;
425 case Bytecodes::_anewarray: {
426 int klass_index = get_Java_index_u2();
427 ConstantPool* constants = method()->constants();
428 Symbol* name = constants->klass_name_at(klass_index);
429 st->print_cr(" %s ", name->as_C_string());
430 }
431 break;
432 case Bytecodes::_multianewarray: {
433 int klass_index = get_Java_index_u2();
434 int nof_dims = get_index_u1();
435 ConstantPool* constants = method()->constants();
436 Symbol* name = constants->klass_name_at(klass_index);
437 st->print_cr(" %s %d", name->as_C_string(), nof_dims);
438 }
439 break;
440
441 case Bytecodes::_ifeq:
442 case Bytecodes::_ifnull:
443 case Bytecodes::_iflt:
444 case Bytecodes::_ifle:
445 case Bytecodes::_ifne:
446 case Bytecodes::_ifnonnull:
447 case Bytecodes::_ifgt:
448 case Bytecodes::_ifge:
449 case Bytecodes::_if_icmpeq:
450 case Bytecodes::_if_icmpne:
451 case Bytecodes::_if_icmplt:
452 case Bytecodes::_if_icmpgt:
453 case Bytecodes::_if_icmple:
454 case Bytecodes::_if_icmpge:
455 case Bytecodes::_if_acmpeq:
456 case Bytecodes::_if_acmpne:
457 case Bytecodes::_goto:
458 case Bytecodes::_jsr:
459 st->print_cr(" %d", bci + get_short());
460 break;
461
462 case Bytecodes::_goto_w:
463 case Bytecodes::_jsr_w:
464 st->print_cr(" %d", bci + get_int());
465 break;
466
467 case Bytecodes::_ret: st->print_cr(" %d", get_index_special()); break;
468
469 case Bytecodes::_tableswitch:
470 { align();
471 int default_dest = bci + get_int();
472 int lo = get_int();
473 int hi = get_int();
474 int len = hi - lo + 1;
475 jint* dest = NEW_RESOURCE_ARRAY(jint, len);
476 for (int i = 0; i < len; i++) {
477 dest[i] = bci + get_int();
478 }
479 st->print(" %d " INT32_FORMAT " " INT32_FORMAT " ",
480 default_dest, lo, hi);
481 const char *comma = "";
482 for (int ll = lo; ll <= hi; ll++) {
483 int idx = ll - lo;
484 st->print("%s %d:" INT32_FORMAT " (delta: %d)", comma, ll, dest[idx], dest[idx]-bci);
485 comma = ",";
486 }
487 st->cr();
488 }
489 break;
490 case Bytecodes::_lookupswitch:
491 { align();
492 int default_dest = bci + get_int();
493 int len = get_int();
494 jint* key = NEW_RESOURCE_ARRAY(jint, len);
495 jint* dest = NEW_RESOURCE_ARRAY(jint, len);
496 for (int i = 0; i < len; i++) {
497 key [i] = get_int();
498 dest[i] = bci + get_int();
499 };
500 st->print(" %d %d ", default_dest, len);
501 const char *comma = "";
502 for (int ll = 0; ll < len; ll++) {
503 st->print("%s " INT32_FORMAT ":" INT32_FORMAT, comma, key[ll], dest[ll]);
504 comma = ",";
505 }
506 st->cr();
507 }
508 break;
509
510 case Bytecodes::_putstatic:
511 case Bytecodes::_getstatic:
512 case Bytecodes::_putfield:
513 case Bytecodes::_getfield:
514 {
515 int cp_index;
516 if (is_linked()) {
517 int field_index = get_native_index_u2();
518 cp_index = cpcache()->resolved_field_entry_at(field_index)->constant_pool_index();
519 } else {
520 cp_index = get_Java_index_u2();
521 }
522 print_field_or_method(cp_index, st);
523 }
524 break;
525
526 case Bytecodes::_invokevirtual:
527 case Bytecodes::_invokespecial:
528 case Bytecodes::_invokestatic:
529 {
530 int cp_index;
531 if (is_linked()) {
532 int method_index = get_native_index_u2();
533 ResolvedMethodEntry* method_entry = cpcache()->resolved_method_entry_at(method_index);
534 cp_index = method_entry->constant_pool_index();
535 print_field_or_method(cp_index, st);
536
537 if (raw_code() == Bytecodes::_invokehandle &&
538 ClassPrinter::has_mode(_flags, ClassPrinter::PRINT_METHOD_HANDLE)) {
539 assert(is_linked(), "invokehandle is only in rewritten methods");
540 method_entry->print_on(st);
541 if (method_entry->has_appendix()) {
542 st->print(" appendix: ");
543 constants()->resolved_reference_from_method(method_index)->print_on(st);
544 }
545 }
546 } else {
547 cp_index = get_Java_index_u2();
548 print_field_or_method(cp_index, st);
549 }
550 }
551 break;
552
553 case Bytecodes::_invokeinterface:
554 {
555 int cp_index;
556 if (is_linked()) {
557 int method_index = get_native_index_u2();
558 cp_index = cpcache()->resolved_method_entry_at(method_index)->constant_pool_index();
559 } else {
560 cp_index = get_Java_index_u2();
561 }
562 int count = get_index_u1(); // TODO: this is not printed.
563 get_byte(); // ignore zero byte
564 print_field_or_method(cp_index, st);
565 }
566 break;
567
568 case Bytecodes::_invokedynamic:
569 {
570 int indy_index;
571 int cp_index;
572 if (is_linked()) {
573 indy_index = get_native_index_u4();
574 cp_index = constants()->resolved_indy_entry_at(indy_index)->constant_pool_index();
575 } else {
576 indy_index = -1;
577 cp_index = get_Java_index_u2();
578 get_byte(); // ignore zero byte
579 get_byte(); // ignore zero byte
580 }
581 print_invokedynamic(indy_index, cp_index, st);
582 }
583 break;
584
585 case Bytecodes::_new:
586 case Bytecodes::_checkcast:
587 case Bytecodes::_instanceof:
588 { int i = get_Java_index_u2();
589 ConstantPool* constants = method()->constants();
590 Symbol* name = constants->klass_name_at(i);
591 st->print_cr(" %d <%s>", i, name->as_C_string());
592 }
593 break;
594
595 case Bytecodes::_wide:
596 // length is zero not one, but printed with no more info.
597 break;
598
599 default:
600 ShouldNotReachHere();
601 break;
602 }
603 }
604
605
606 void BytecodePrinter::bytecode_epilog(int bci, outputStream* st) {
607 MethodData* mdo = method()->method_data();
608 if (mdo != nullptr) {
609
610 // Lock to read ProfileData, and ensure lock is not broken by a safepoint
611 MutexLocker ml(mdo->extra_data_lock(), Mutex::_no_safepoint_check_flag);
612
613 ProfileData* data = mdo->bci_to_data(bci);
614 if (data != nullptr) {
615 st->print(" %d ", mdo->dp_to_di(data->dp()));
616 st->fill_to(7);
617 data->print_data_on(st, mdo);
618 }
619 }
620 }