Mercurial > hg > truffle

comparison src/share/vm/opto/bytecodeInfo.cpp @ 7421:ad5dd04754ee

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
8005031: Some cleanup in c2 to prepare for incremental inlining support Summary: collection of small changes to prepare for incremental inlining. Reviewed-by: twisti, kvn
author roland
date Tue, 18 Dec 2012 14:55:25 +0100
parents bd7a7ce2e264
children d092d1b31229
comparison
equal deleted inserted replaced
7420:18d56ca3e901 7421:ad5dd04754ee
401 } 401 }
402 402
403 //------------------------------print_inlining--------------------------------- 403 //------------------------------print_inlining---------------------------------
404 // Really, the failure_msg can be a success message also. 404 // Really, the failure_msg can be a success message also.
405 void InlineTree::print_inlining(ciMethod* callee_method, int caller_bci, const char* failure_msg) const { 405 void InlineTree::print_inlining(ciMethod* callee_method, int caller_bci, const char* failure_msg) const {
406 CompileTask::print_inlining(callee_method, inline_level(), caller_bci, failure_msg ? failure_msg : "inline"); 406 C->print_inlining(callee_method, inline_level(), caller_bci, failure_msg ? failure_msg : "inline");
407 if (callee_method == NULL) tty->print(" callee not monotonic or profiled"); 407 if (callee_method == NULL) tty->print(" callee not monotonic or profiled");
408 if (Verbose && callee_method) { 408 if (Verbose && callee_method) {
409 const InlineTree *top = this; 409 const InlineTree *top = this;
410 while( top->caller_tree() != NULL ) { top = top->caller_tree(); } 410 while( top->caller_tree() != NULL ) { top = top->caller_tree(); }
411 //tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count()); 411 //tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count());