Thu, 19 Mar 2009 09:13:24 -0700
Merge
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_bytecodeTracer.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | |
duke@435 | 29 | #ifndef PRODUCT |
duke@435 | 30 | |
duke@435 | 31 | // Standard closure for BytecodeTracer: prints the current bytecode |
duke@435 | 32 | // and its attributes using bytecode-specific information. |
duke@435 | 33 | |
duke@435 | 34 | class BytecodePrinter: public BytecodeClosure { |
duke@435 | 35 | private: |
duke@435 | 36 | // %%% This field is not GC-ed, and so can contain garbage |
duke@435 | 37 | // between critical sections. Use only pointer-comparison |
duke@435 | 38 | // operations on the pointer, except within a critical section. |
duke@435 | 39 | // (Also, ensure that occasional false positives are benign.) |
duke@435 | 40 | methodOop _current_method; |
duke@435 | 41 | bool _is_wide; |
duke@435 | 42 | address _next_pc; // current decoding position |
duke@435 | 43 | |
duke@435 | 44 | void align() { _next_pc = (address)round_to((intptr_t)_next_pc, sizeof(jint)); } |
duke@435 | 45 | int get_byte() { return *(jbyte*) _next_pc++; } // signed |
duke@435 | 46 | short get_short() { short i=Bytes::get_Java_u2(_next_pc); _next_pc+=2; return i; } |
duke@435 | 47 | int get_int() { int i=Bytes::get_Java_u4(_next_pc); _next_pc+=4; return i; } |
duke@435 | 48 | |
duke@435 | 49 | int get_index() { return *(address)_next_pc++; } |
duke@435 | 50 | int get_big_index() { int i=Bytes::get_Java_u2(_next_pc); _next_pc+=2; return i; } |
duke@435 | 51 | int get_index_special() { return (is_wide()) ? get_big_index() : get_index(); } |
duke@435 | 52 | methodOop method() { return _current_method; } |
duke@435 | 53 | bool is_wide() { return _is_wide; } |
duke@435 | 54 | |
duke@435 | 55 | |
duke@435 | 56 | void print_constant(int i, outputStream* st = tty); |
duke@435 | 57 | void print_attributes(Bytecodes::Code code, int bci, outputStream* st = tty); |
duke@435 | 58 | void bytecode_epilog(int bci, outputStream* st = tty); |
duke@435 | 59 | |
duke@435 | 60 | public: |
duke@435 | 61 | BytecodePrinter() { |
duke@435 | 62 | _is_wide = false; |
duke@435 | 63 | } |
duke@435 | 64 | |
duke@435 | 65 | // This method is called while executing the raw bytecodes, so none of |
duke@435 | 66 | // the adjustments that BytecodeStream performs applies. |
duke@435 | 67 | void trace(methodHandle method, address bcp, uintptr_t tos, uintptr_t tos2, outputStream* st) { |
duke@435 | 68 | ResourceMark rm; |
duke@435 | 69 | if (_current_method != method()) { |
duke@435 | 70 | // Note 1: This code will not work as expected with true MT/MP. |
duke@435 | 71 | // Need an explicit lock or a different solution. |
duke@435 | 72 | // It is possible for this block to be skipped, if a garbage |
duke@435 | 73 | // _current_method pointer happens to have the same bits as |
duke@435 | 74 | // the incoming method. We could lose a line of trace output. |
duke@435 | 75 | // This is acceptable in a debug-only feature. |
duke@435 | 76 | st->cr(); |
duke@435 | 77 | st->print("[%d] ", (int) Thread::current()->osthread()->thread_id()); |
duke@435 | 78 | method->print_name(st); |
duke@435 | 79 | st->cr(); |
duke@435 | 80 | _current_method = method(); |
duke@435 | 81 | } |
duke@435 | 82 | Bytecodes::Code code; |
duke@435 | 83 | if (is_wide()) { |
duke@435 | 84 | // bcp wasn't advanced if previous bytecode was _wide. |
duke@435 | 85 | code = Bytecodes::code_at(bcp+1); |
duke@435 | 86 | } else { |
duke@435 | 87 | code = Bytecodes::code_at(bcp); |
duke@435 | 88 | } |
duke@435 | 89 | int bci = bcp - method->code_base(); |
duke@435 | 90 | st->print("[%d] ", (int) Thread::current()->osthread()->thread_id()); |
duke@435 | 91 | if (Verbose) { |
duke@435 | 92 | st->print("%8d %4d " INTPTR_FORMAT " " INTPTR_FORMAT " %s", |
duke@435 | 93 | BytecodeCounter::counter_value(), bci, tos, tos2, Bytecodes::name(code)); |
duke@435 | 94 | } else { |
duke@435 | 95 | st->print("%8d %4d %s", |
duke@435 | 96 | BytecodeCounter::counter_value(), bci, Bytecodes::name(code)); |
duke@435 | 97 | } |
duke@435 | 98 | _next_pc = is_wide() ? bcp+2 : bcp+1; |
duke@435 | 99 | print_attributes(code, bci); |
duke@435 | 100 | // Set is_wide for the next one, since the caller of this doesn't skip |
duke@435 | 101 | // the next bytecode. |
duke@435 | 102 | _is_wide = (code == Bytecodes::_wide); |
duke@435 | 103 | } |
duke@435 | 104 | |
duke@435 | 105 | // Used for methodOop::print_codes(). The input bcp comes from |
duke@435 | 106 | // BytecodeStream, which will skip wide bytecodes. |
duke@435 | 107 | void trace(methodHandle method, address bcp, outputStream* st) { |
duke@435 | 108 | _current_method = method(); |
duke@435 | 109 | ResourceMark rm; |
duke@435 | 110 | Bytecodes::Code code = Bytecodes::code_at(bcp); |
duke@435 | 111 | // Set is_wide |
duke@435 | 112 | _is_wide = (code == Bytecodes::_wide); |
duke@435 | 113 | if (is_wide()) { |
duke@435 | 114 | code = Bytecodes::code_at(bcp+1); |
duke@435 | 115 | } |
duke@435 | 116 | int bci = bcp - method->code_base(); |
duke@435 | 117 | // Print bytecode index and name |
duke@435 | 118 | if (is_wide()) { |
duke@435 | 119 | st->print("%d %s_w", bci, Bytecodes::name(code)); |
duke@435 | 120 | } else { |
duke@435 | 121 | st->print("%d %s", bci, Bytecodes::name(code)); |
duke@435 | 122 | } |
duke@435 | 123 | _next_pc = is_wide() ? bcp+2 : bcp+1; |
duke@435 | 124 | print_attributes(code, bci, st); |
duke@435 | 125 | bytecode_epilog(bci, st); |
duke@435 | 126 | } |
duke@435 | 127 | }; |
duke@435 | 128 | |
duke@435 | 129 | |
duke@435 | 130 | // Implementation of BytecodeTracer |
duke@435 | 131 | |
duke@435 | 132 | // %%% This set_closure thing seems overly general, given that |
duke@435 | 133 | // nobody uses it. Also, if BytecodePrinter weren't hidden |
duke@435 | 134 | // then methodOop could use instances of it directly and it |
duke@435 | 135 | // would be easier to remove races on _current_method and bcp. |
duke@435 | 136 | // Since this is not product functionality, we can defer cleanup. |
duke@435 | 137 | |
duke@435 | 138 | BytecodeClosure* BytecodeTracer::_closure = NULL; |
duke@435 | 139 | |
duke@435 | 140 | static BytecodePrinter std_closure; |
duke@435 | 141 | BytecodeClosure* BytecodeTracer::std_closure() { |
duke@435 | 142 | return &::std_closure; |
duke@435 | 143 | } |
duke@435 | 144 | |
duke@435 | 145 | |
duke@435 | 146 | void BytecodeTracer::trace(methodHandle method, address bcp, uintptr_t tos, uintptr_t tos2, outputStream* st) { |
duke@435 | 147 | if (TraceBytecodes && BytecodeCounter::counter_value() >= TraceBytecodesAt) { |
duke@435 | 148 | ttyLocker ttyl; // 5065316: keep the following output coherent |
duke@435 | 149 | // The ttyLocker also prevents races between two threads |
duke@435 | 150 | // trying to use the single instance of BytecodePrinter. |
duke@435 | 151 | // Using the ttyLocker prevents the system from coming to |
duke@435 | 152 | // a safepoint within this code, which is sensitive to methodOop |
duke@435 | 153 | // movement. |
duke@435 | 154 | // |
duke@435 | 155 | // There used to be a leaf mutex here, but the ttyLocker will |
duke@435 | 156 | // work just as well, as long as the printing operations never block. |
duke@435 | 157 | // |
duke@435 | 158 | // We put the locker on the static trace method, not the |
duke@435 | 159 | // virtual one, because the clients of this module go through |
duke@435 | 160 | // the static method. |
duke@435 | 161 | _closure->trace(method, bcp, tos, tos2, st); |
duke@435 | 162 | } |
duke@435 | 163 | } |
duke@435 | 164 | |
duke@435 | 165 | void BytecodeTracer::trace(methodHandle method, address bcp, outputStream* st) { |
duke@435 | 166 | ttyLocker ttyl; // 5065316: keep the following output coherent |
duke@435 | 167 | _closure->trace(method, bcp, st); |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | void print_oop(oop value, outputStream* st) { |
duke@435 | 171 | if (value == NULL) { |
duke@435 | 172 | st->print_cr(" NULL"); |
duke@435 | 173 | } else { |
duke@435 | 174 | EXCEPTION_MARK; |
duke@435 | 175 | Handle h_value (THREAD, value); |
duke@435 | 176 | symbolHandle sym = java_lang_String::as_symbol(h_value, CATCH); |
duke@435 | 177 | if (sym->utf8_length() > 32) { |
duke@435 | 178 | st->print_cr(" ...."); |
duke@435 | 179 | } else { |
duke@435 | 180 | sym->print_on(st); st->cr(); |
duke@435 | 181 | } |
duke@435 | 182 | } |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | void BytecodePrinter::print_constant(int i, outputStream* st) { |
duke@435 | 186 | constantPoolOop constants = method()->constants(); |
duke@435 | 187 | constantTag tag = constants->tag_at(i); |
duke@435 | 188 | |
duke@435 | 189 | if (tag.is_int()) { |
duke@435 | 190 | st->print_cr(" " INT32_FORMAT, constants->int_at(i)); |
duke@435 | 191 | } else if (tag.is_long()) { |
duke@435 | 192 | st->print_cr(" " INT64_FORMAT, constants->long_at(i)); |
duke@435 | 193 | } else if (tag.is_float()) { |
duke@435 | 194 | st->print_cr(" %f", constants->float_at(i)); |
duke@435 | 195 | } else if (tag.is_double()) { |
duke@435 | 196 | st->print_cr(" %f", constants->double_at(i)); |
duke@435 | 197 | } else if (tag.is_string()) { |
duke@435 | 198 | oop string = constants->resolved_string_at(i); |
duke@435 | 199 | print_oop(string, st); |
duke@435 | 200 | } else if (tag.is_unresolved_string()) { |
duke@435 | 201 | st->print_cr(" <unresolved string at %d>", i); |
duke@435 | 202 | } else if (tag.is_klass()) { |
duke@435 | 203 | st->print_cr(" %s", constants->resolved_klass_at(i)->klass_part()->external_name()); |
duke@435 | 204 | } else if (tag.is_unresolved_klass()) { |
duke@435 | 205 | st->print_cr(" <unresolved klass at %d>", i); |
duke@435 | 206 | } else ShouldNotReachHere(); |
duke@435 | 207 | } |
duke@435 | 208 | |
duke@435 | 209 | |
duke@435 | 210 | void BytecodePrinter::print_attributes(Bytecodes::Code code, int bci, outputStream* st) { |
duke@435 | 211 | // Show attributes of pre-rewritten codes |
duke@435 | 212 | code = Bytecodes::java_code(code); |
duke@435 | 213 | // If the code doesn't have any fields there's nothing to print. |
duke@435 | 214 | // note this is ==1 because the tableswitch and lookupswitch are |
duke@435 | 215 | // zero size (for some reason) and we want to print stuff out for them. |
duke@435 | 216 | if (Bytecodes::length_for(code) == 1) { |
duke@435 | 217 | st->cr(); |
duke@435 | 218 | return; |
duke@435 | 219 | } |
duke@435 | 220 | |
duke@435 | 221 | switch(code) { |
duke@435 | 222 | // Java specific bytecodes only matter. |
duke@435 | 223 | case Bytecodes::_bipush: |
duke@435 | 224 | st->print_cr(" " INT32_FORMAT, get_byte()); |
duke@435 | 225 | break; |
duke@435 | 226 | case Bytecodes::_sipush: |
duke@435 | 227 | st->print_cr(" " INT32_FORMAT, get_short()); |
duke@435 | 228 | break; |
duke@435 | 229 | case Bytecodes::_ldc: |
duke@435 | 230 | print_constant(get_index(), st); |
duke@435 | 231 | break; |
duke@435 | 232 | |
duke@435 | 233 | case Bytecodes::_ldc_w: |
duke@435 | 234 | case Bytecodes::_ldc2_w: |
duke@435 | 235 | print_constant(get_big_index(), st); |
duke@435 | 236 | break; |
duke@435 | 237 | |
duke@435 | 238 | case Bytecodes::_iload: |
duke@435 | 239 | case Bytecodes::_lload: |
duke@435 | 240 | case Bytecodes::_fload: |
duke@435 | 241 | case Bytecodes::_dload: |
duke@435 | 242 | case Bytecodes::_aload: |
duke@435 | 243 | case Bytecodes::_istore: |
duke@435 | 244 | case Bytecodes::_lstore: |
duke@435 | 245 | case Bytecodes::_fstore: |
duke@435 | 246 | case Bytecodes::_dstore: |
duke@435 | 247 | case Bytecodes::_astore: |
duke@435 | 248 | st->print_cr(" #%d", get_index_special()); |
duke@435 | 249 | break; |
duke@435 | 250 | |
duke@435 | 251 | case Bytecodes::_iinc: |
duke@435 | 252 | { int index = get_index_special(); |
duke@435 | 253 | jint offset = is_wide() ? get_short(): get_byte(); |
duke@435 | 254 | st->print_cr(" #%d " INT32_FORMAT, index, offset); |
duke@435 | 255 | } |
duke@435 | 256 | break; |
duke@435 | 257 | |
duke@435 | 258 | case Bytecodes::_newarray: { |
duke@435 | 259 | BasicType atype = (BasicType)get_index(); |
duke@435 | 260 | const char* str = type2name(atype); |
duke@435 | 261 | if (str == NULL || atype == T_OBJECT || atype == T_ARRAY) { |
duke@435 | 262 | assert(false, "Unidentified basic type"); |
duke@435 | 263 | } |
duke@435 | 264 | st->print_cr(" %s", str); |
duke@435 | 265 | } |
duke@435 | 266 | break; |
duke@435 | 267 | case Bytecodes::_anewarray: { |
duke@435 | 268 | int klass_index = get_big_index(); |
duke@435 | 269 | constantPoolOop constants = method()->constants(); |
duke@435 | 270 | symbolOop name = constants->klass_name_at(klass_index); |
duke@435 | 271 | st->print_cr(" %s ", name->as_C_string()); |
duke@435 | 272 | } |
duke@435 | 273 | break; |
duke@435 | 274 | case Bytecodes::_multianewarray: { |
duke@435 | 275 | int klass_index = get_big_index(); |
duke@435 | 276 | int nof_dims = get_index(); |
duke@435 | 277 | constantPoolOop constants = method()->constants(); |
duke@435 | 278 | symbolOop name = constants->klass_name_at(klass_index); |
duke@435 | 279 | st->print_cr(" %s %d", name->as_C_string(), nof_dims); |
duke@435 | 280 | } |
duke@435 | 281 | break; |
duke@435 | 282 | |
duke@435 | 283 | case Bytecodes::_ifeq: |
duke@435 | 284 | case Bytecodes::_ifnull: |
duke@435 | 285 | case Bytecodes::_iflt: |
duke@435 | 286 | case Bytecodes::_ifle: |
duke@435 | 287 | case Bytecodes::_ifne: |
duke@435 | 288 | case Bytecodes::_ifnonnull: |
duke@435 | 289 | case Bytecodes::_ifgt: |
duke@435 | 290 | case Bytecodes::_ifge: |
duke@435 | 291 | case Bytecodes::_if_icmpeq: |
duke@435 | 292 | case Bytecodes::_if_icmpne: |
duke@435 | 293 | case Bytecodes::_if_icmplt: |
duke@435 | 294 | case Bytecodes::_if_icmpgt: |
duke@435 | 295 | case Bytecodes::_if_icmple: |
duke@435 | 296 | case Bytecodes::_if_icmpge: |
duke@435 | 297 | case Bytecodes::_if_acmpeq: |
duke@435 | 298 | case Bytecodes::_if_acmpne: |
duke@435 | 299 | case Bytecodes::_goto: |
duke@435 | 300 | case Bytecodes::_jsr: |
duke@435 | 301 | st->print_cr(" %d", bci + get_short()); |
duke@435 | 302 | break; |
duke@435 | 303 | |
duke@435 | 304 | case Bytecodes::_goto_w: |
duke@435 | 305 | case Bytecodes::_jsr_w: |
duke@435 | 306 | st->print_cr(" %d", bci + get_int()); |
duke@435 | 307 | break; |
duke@435 | 308 | |
duke@435 | 309 | case Bytecodes::_ret: st->print_cr(" %d", get_index_special()); break; |
duke@435 | 310 | |
duke@435 | 311 | case Bytecodes::_tableswitch: |
duke@435 | 312 | { align(); |
duke@435 | 313 | int default_dest = bci + get_int(); |
duke@435 | 314 | int lo = get_int(); |
duke@435 | 315 | int hi = get_int(); |
duke@435 | 316 | int len = hi - lo + 1; |
duke@435 | 317 | jint* dest = NEW_RESOURCE_ARRAY(jint, len); |
duke@435 | 318 | for (int i = 0; i < len; i++) { |
duke@435 | 319 | dest[i] = bci + get_int(); |
duke@435 | 320 | } |
duke@435 | 321 | st->print(" %d " INT32_FORMAT " " INT32_FORMAT " ", |
duke@435 | 322 | default_dest, lo, hi); |
duke@435 | 323 | int first = true; |
duke@435 | 324 | for (int ll = lo; ll <= hi; ll++, first = false) { |
duke@435 | 325 | int idx = ll - lo; |
duke@435 | 326 | const char *format = first ? " %d:" INT32_FORMAT " (delta: %d)" : |
duke@435 | 327 | ", %d:" INT32_FORMAT " (delta: %d)"; |
duke@435 | 328 | st->print(format, ll, dest[idx], dest[idx]-bci); |
duke@435 | 329 | } |
duke@435 | 330 | st->cr(); |
duke@435 | 331 | } |
duke@435 | 332 | break; |
duke@435 | 333 | case Bytecodes::_lookupswitch: |
duke@435 | 334 | { align(); |
duke@435 | 335 | int default_dest = bci + get_int(); |
duke@435 | 336 | int len = get_int(); |
duke@435 | 337 | jint* key = NEW_RESOURCE_ARRAY(jint, len); |
duke@435 | 338 | jint* dest = NEW_RESOURCE_ARRAY(jint, len); |
duke@435 | 339 | for (int i = 0; i < len; i++) { |
duke@435 | 340 | key [i] = get_int(); |
duke@435 | 341 | dest[i] = bci + get_int(); |
duke@435 | 342 | }; |
duke@435 | 343 | st->print(" %d %d ", default_dest, len); |
duke@435 | 344 | bool first = true; |
duke@435 | 345 | for (int ll = 0; ll < len; ll++, first = false) { |
duke@435 | 346 | const char *format = first ? " " INT32_FORMAT ":" INT32_FORMAT : |
duke@435 | 347 | ", " INT32_FORMAT ":" INT32_FORMAT ; |
duke@435 | 348 | st->print(format, key[ll], dest[ll]); |
duke@435 | 349 | } |
duke@435 | 350 | st->cr(); |
duke@435 | 351 | } |
duke@435 | 352 | break; |
duke@435 | 353 | |
duke@435 | 354 | case Bytecodes::_putstatic: |
duke@435 | 355 | case Bytecodes::_getstatic: |
duke@435 | 356 | case Bytecodes::_putfield: |
duke@435 | 357 | case Bytecodes::_getfield: { |
duke@435 | 358 | int i = get_big_index(); |
duke@435 | 359 | constantPoolOop constants = method()->constants(); |
duke@435 | 360 | symbolOop field = constants->name_ref_at(i); |
duke@435 | 361 | st->print_cr(" %d <%s>", i, field->as_C_string()); |
duke@435 | 362 | } |
duke@435 | 363 | break; |
duke@435 | 364 | |
duke@435 | 365 | case Bytecodes::_invokevirtual: |
duke@435 | 366 | case Bytecodes::_invokespecial: |
duke@435 | 367 | case Bytecodes::_invokestatic: |
duke@435 | 368 | { int i = get_big_index(); |
duke@435 | 369 | constantPoolOop constants = method()->constants(); |
duke@435 | 370 | symbolOop name = constants->name_ref_at(i); |
duke@435 | 371 | symbolOop signature = constants->signature_ref_at(i); |
duke@435 | 372 | st->print_cr(" %d <%s> <%s> ", i, name->as_C_string(), signature->as_C_string()); |
duke@435 | 373 | } |
duke@435 | 374 | break; |
duke@435 | 375 | |
duke@435 | 376 | case Bytecodes::_invokeinterface: |
duke@435 | 377 | { int i = get_big_index(); |
duke@435 | 378 | int n = get_index(); |
duke@435 | 379 | get_index(); |
duke@435 | 380 | constantPoolOop constants = method()->constants(); |
duke@435 | 381 | symbolOop name = constants->name_ref_at(i); |
duke@435 | 382 | symbolOop signature = constants->signature_ref_at(i); |
duke@435 | 383 | st->print_cr(" %d <%s> <%s> %d", i, name->as_C_string(), signature->as_C_string(), n); |
duke@435 | 384 | } |
duke@435 | 385 | break; |
duke@435 | 386 | |
duke@435 | 387 | case Bytecodes::_new: |
duke@435 | 388 | case Bytecodes::_checkcast: |
duke@435 | 389 | case Bytecodes::_instanceof: |
duke@435 | 390 | { int i = get_big_index(); |
duke@435 | 391 | constantPoolOop constants = method()->constants(); |
duke@435 | 392 | symbolOop name = constants->klass_name_at(i); |
duke@435 | 393 | st->print_cr(" %d <%s>", i, name->as_C_string()); |
duke@435 | 394 | } |
duke@435 | 395 | break; |
duke@435 | 396 | |
duke@435 | 397 | case Bytecodes::_wide: |
duke@435 | 398 | // length is zero not one, but printed with no more info. |
duke@435 | 399 | break; |
duke@435 | 400 | |
duke@435 | 401 | default: |
duke@435 | 402 | ShouldNotReachHere(); |
duke@435 | 403 | break; |
duke@435 | 404 | } |
duke@435 | 405 | } |
duke@435 | 406 | |
duke@435 | 407 | |
duke@435 | 408 | void BytecodePrinter::bytecode_epilog(int bci, outputStream* st) { |
duke@435 | 409 | methodDataOop mdo = method()->method_data(); |
duke@435 | 410 | if (mdo != NULL) { |
duke@435 | 411 | ProfileData* data = mdo->bci_to_data(bci); |
duke@435 | 412 | if (data != NULL) { |
duke@435 | 413 | st->print(" %d", mdo->dp_to_di(data->dp())); |
duke@435 | 414 | st->fill_to(6); |
duke@435 | 415 | data->print_data_on(st); |
duke@435 | 416 | } |
duke@435 | 417 | } |
duke@435 | 418 | } |
duke@435 | 419 | #endif // PRODUCT |