1 /*
2 * Copyright (c) 1999, 2022, 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 "c1/c1_CFGPrinter.hpp"
27 #include "c1/c1_Compilation.hpp"
28 #include "c1/c1_IR.hpp"
29 #include "c1/c1_LIRAssembler.hpp"
30 #include "c1/c1_LinearScan.hpp"
31 #include "c1/c1_MacroAssembler.hpp"
32 #include "c1/c1_RangeCheckElimination.hpp"
33 #include "c1/c1_ValueMap.hpp"
34 #include "c1/c1_ValueStack.hpp"
35 #include "code/debugInfoRec.hpp"
36 #include "compiler/compileLog.hpp"
37 #include "compiler/compilerDirectives.hpp"
38 #include "memory/resourceArea.hpp"
39 #include "runtime/sharedRuntime.hpp"
40 #include "runtime/timerTrace.hpp"
41
42 typedef enum {
43 _t_compile,
44 _t_setup,
45 _t_buildIR,
46 _t_hir_parse,
47 _t_gvn,
48 _t_optimize_blocks,
49 _t_optimize_null_checks,
50 _t_rangeCheckElimination,
51 _t_emit_lir,
52 _t_linearScan,
53 _t_lirGeneration,
54 _t_codeemit,
55 _t_codeinstall,
56 max_phase_timers
57 } TimerName;
58
59 static const char * timer_name[] = {
60 "compile",
61 "setup",
62 "buildIR",
63 "parse_hir",
64 "gvn",
65 "optimize_blocks",
66 "optimize_null_checks",
67 "rangeCheckElimination",
68 "emit_lir",
69 "linearScan",
70 "lirGeneration",
71 "codeemit",
72 "codeinstall"
73 };
74
75 static elapsedTimer timers[max_phase_timers];
76 static int totalInstructionNodes = 0;
77
78 class PhaseTraceTime: public TraceTime {
79 private:
80 CompileLog* _log;
81 TimerName _timer;
82
83 public:
84 PhaseTraceTime(TimerName timer)
85 : TraceTime("", &timers[timer], CITime || CITimeEach, Verbose),
86 _log(NULL), _timer(timer)
87 {
88 if (Compilation::current() != NULL) {
89 _log = Compilation::current()->log();
90 }
91
92 if (_log != NULL) {
93 _log->begin_head("phase name='%s'", timer_name[_timer]);
94 _log->stamp();
95 _log->end_head();
96 }
97 }
98
99 ~PhaseTraceTime() {
100 if (_log != NULL)
101 _log->done("phase name='%s'", timer_name[_timer]);
102 }
103 };
104
105 // Implementation of Compilation
106
107
108 #ifndef PRODUCT
109
110 void Compilation::maybe_print_current_instruction() {
111 if (_current_instruction != NULL && _last_instruction_printed != _current_instruction) {
112 _last_instruction_printed = _current_instruction;
113 _current_instruction->print_line();
114 }
115 }
116 #endif // PRODUCT
117
118
119 DebugInformationRecorder* Compilation::debug_info_recorder() const {
120 return _env->debug_info();
121 }
122
123
124 Dependencies* Compilation::dependency_recorder() const {
125 return _env->dependencies();
126 }
127
128
129 void Compilation::initialize() {
130 // Use an oop recorder bound to the CI environment.
131 // (The default oop recorder is ignorant of the CI.)
132 OopRecorder* ooprec = new OopRecorder(_env->arena());
133 _env->set_oop_recorder(ooprec);
134 _env->set_debug_info(new DebugInformationRecorder(ooprec));
135 debug_info_recorder()->set_oopmaps(new OopMapSet());
136 _env->set_dependencies(new Dependencies(_env));
137 }
138
139
140 void Compilation::build_hir() {
141 CHECK_BAILOUT();
142
143 // setup ir
144 CompileLog* log = this->log();
145 if (log != NULL) {
146 log->begin_head("parse method='%d' ",
147 log->identify(_method));
148 log->stamp();
149 log->end_head();
150 }
151 {
152 PhaseTraceTime timeit(_t_hir_parse);
153 _hir = new IR(this, method(), osr_bci());
154 }
155 if (log) log->done("parse");
156 if (!_hir->is_valid()) {
157 bailout("invalid parsing");
158 return;
159 }
160
161 #ifndef PRODUCT
162 if (PrintCFGToFile) {
163 CFGPrinter::print_cfg(_hir, "After Generation of HIR", true, false);
164 }
165 #endif
166
167 #ifndef PRODUCT
168 if (PrintCFG || PrintCFG0) { tty->print_cr("CFG after parsing"); _hir->print(true); }
169 if (PrintIR || PrintIR0 ) { tty->print_cr("IR after parsing"); _hir->print(false); }
170 #endif
171
172 _hir->verify();
173
174 if (UseC1Optimizations) {
175 NEEDS_CLEANUP
176 // optimization
177 PhaseTraceTime timeit(_t_optimize_blocks);
178
179 _hir->optimize_blocks();
180 }
181
182 _hir->verify();
183
184 _hir->split_critical_edges();
185
186 #ifndef PRODUCT
187 if (PrintCFG || PrintCFG1) { tty->print_cr("CFG after optimizations"); _hir->print(true); }
188 if (PrintIR || PrintIR1 ) { tty->print_cr("IR after optimizations"); _hir->print(false); }
189 #endif
190
191 _hir->verify();
192
193 // compute block ordering for code generation
194 // the control flow must not be changed from here on
195 _hir->compute_code();
196
197 if (UseGlobalValueNumbering) {
198 // No resource mark here! LoopInvariantCodeMotion can allocate ValueStack objects.
199 PhaseTraceTime timeit(_t_gvn);
200 int instructions = Instruction::number_of_instructions();
201 GlobalValueNumbering gvn(_hir);
202 assert(instructions == Instruction::number_of_instructions(),
203 "shouldn't have created an instructions");
204 }
205
206 _hir->verify();
207
208 #ifndef PRODUCT
209 if (PrintCFGToFile) {
210 CFGPrinter::print_cfg(_hir, "Before RangeCheckElimination", true, false);
211 }
212 #endif
213
214 if (RangeCheckElimination) {
215 if (_hir->osr_entry() == NULL) {
216 PhaseTraceTime timeit(_t_rangeCheckElimination);
217 RangeCheckElimination::eliminate(_hir);
218 }
219 }
220
221 #ifndef PRODUCT
222 if (PrintCFGToFile) {
223 CFGPrinter::print_cfg(_hir, "After RangeCheckElimination", true, false);
224 }
225 #endif
226
227 if (UseC1Optimizations) {
228 // loop invariant code motion reorders instructions and range
229 // check elimination adds new instructions so do null check
230 // elimination after.
231 NEEDS_CLEANUP
232 // optimization
233 PhaseTraceTime timeit(_t_optimize_null_checks);
234
235 _hir->eliminate_null_checks();
236 }
237
238 _hir->verify();
239
240 // compute use counts after global value numbering
241 _hir->compute_use_counts();
242
243 #ifndef PRODUCT
244 if (PrintCFG || PrintCFG2) { tty->print_cr("CFG before code generation"); _hir->code()->print(true); }
245 if (PrintIR || PrintIR2 ) { tty->print_cr("IR before code generation"); _hir->code()->print(false, true); }
246 #endif
247
248 _hir->verify();
249 }
250
251
252 void Compilation::emit_lir() {
253 CHECK_BAILOUT();
254
255 LIRGenerator gen(this, method());
256 {
257 PhaseTraceTime timeit(_t_lirGeneration);
258 hir()->iterate_linear_scan_order(&gen);
259 }
260
261 CHECK_BAILOUT();
262
263 {
264 PhaseTraceTime timeit(_t_linearScan);
265
266 LinearScan* allocator = new LinearScan(hir(), &gen, frame_map());
267 set_allocator(allocator);
268 // Assign physical registers to LIR operands using a linear scan algorithm.
269 allocator->do_linear_scan();
270 CHECK_BAILOUT();
271
272 _max_spills = allocator->max_spills();
273 }
274
275 if (BailoutAfterLIR) {
276 if (PrintLIR && !bailed_out()) {
277 print_LIR(hir()->code());
278 }
279 bailout("Bailing out because of -XX:+BailoutAfterLIR");
280 }
281 }
282
283
284 void Compilation::emit_code_epilog(LIR_Assembler* assembler) {
285 CHECK_BAILOUT();
286
287 CodeOffsets* code_offsets = assembler->offsets();
288
289 // generate code or slow cases
290 assembler->emit_slow_case_stubs();
291 CHECK_BAILOUT();
292
293 // generate exception adapters
294 assembler->emit_exception_entries(exception_info_list());
295 CHECK_BAILOUT();
296
297 // Generate code for exception handler.
298 code_offsets->set_value(CodeOffsets::Exceptions, assembler->emit_exception_handler());
299 CHECK_BAILOUT();
300
301 // Generate code for deopt handler.
302 code_offsets->set_value(CodeOffsets::Deopt, assembler->emit_deopt_handler());
303 CHECK_BAILOUT();
304
305 // Emit the MethodHandle deopt handler code (if required).
306 if (has_method_handle_invokes()) {
307 // We can use the same code as for the normal deopt handler, we
308 // just need a different entry point address.
309 code_offsets->set_value(CodeOffsets::DeoptMH, assembler->emit_deopt_handler());
310 CHECK_BAILOUT();
311 }
312
313 // Emit the handler to remove the activation from the stack and
314 // dispatch to the caller.
315 offsets()->set_value(CodeOffsets::UnwindHandler, assembler->emit_unwind_handler());
316
317 // done
318 masm()->flush();
319 }
320
321
322 bool Compilation::setup_code_buffer(CodeBuffer* code, int call_stub_estimate) {
323 // Preinitialize the consts section to some large size:
324 int locs_buffer_size = 20 * (relocInfo::length_limit + sizeof(relocInfo));
325 char* locs_buffer = NEW_RESOURCE_ARRAY(char, locs_buffer_size);
326 code->insts()->initialize_shared_locs((relocInfo*)locs_buffer,
327 locs_buffer_size / sizeof(relocInfo));
328 code->initialize_consts_size(Compilation::desired_max_constant_size());
329 // Call stubs + two deopt handlers (regular and MH) + exception handler
330 int stub_size = (call_stub_estimate * LIR_Assembler::call_stub_size()) +
331 LIR_Assembler::exception_handler_size() +
332 (2 * LIR_Assembler::deopt_handler_size());
333 if (stub_size >= code->insts_capacity()) return false;
334 code->initialize_stubs_size(stub_size);
335 return true;
336 }
337
338
339 int Compilation::emit_code_body() {
340 // emit code
341 if (!setup_code_buffer(code(), allocator()->num_calls())) {
342 BAILOUT_("size requested greater than avail code buffer size", 0);
343 }
344 code()->initialize_oop_recorder(env()->oop_recorder());
345
346 _masm = new C1_MacroAssembler(code());
347 _masm->set_oop_recorder(env()->oop_recorder());
348
349 LIR_Assembler lir_asm(this);
350
351 lir_asm.emit_code(hir()->code());
352 CHECK_BAILOUT_(0);
353
354 emit_code_epilog(&lir_asm);
355 CHECK_BAILOUT_(0);
356
357 generate_exception_handler_table();
358
359 #ifndef PRODUCT
360 if (PrintExceptionHandlers && Verbose) {
361 exception_handler_table()->print();
362 }
363 #endif /* PRODUCT */
364
365 _immediate_oops_patched = lir_asm.nr_immediate_oops_patched();
366 return frame_map()->framesize();
367 }
368
369
370 int Compilation::compile_java_method() {
371 assert(!method()->is_native(), "should not reach here");
372
373 if (BailoutOnExceptionHandlers) {
374 if (method()->has_exception_handlers()) {
375 bailout("linear scan can't handle exception handlers");
376 }
377 }
378
379 CHECK_BAILOUT_(no_frame_size);
380
381 if (is_profiling() && !method()->ensure_method_data()) {
382 BAILOUT_("mdo allocation failed", no_frame_size);
383 }
384
385 if (method()->is_synchronized()) {
386 set_has_monitors(true);
387 push_monitor();
388 }
389
390 {
391 PhaseTraceTime timeit(_t_buildIR);
392 build_hir();
393 }
394 if (BailoutAfterHIR) {
395 BAILOUT_("Bailing out because of -XX:+BailoutAfterHIR", no_frame_size);
396 }
397
398
399 {
400 PhaseTraceTime timeit(_t_emit_lir);
401
402 _frame_map = new FrameMap(method(), hir()->number_of_locks(), MAX2(4, hir()->max_stack()));
403 emit_lir();
404 }
405 CHECK_BAILOUT_(no_frame_size);
406
407 // Dump compilation data to replay it.
408 if (_directive->DumpReplayOption) {
409 env()->dump_replay_data(env()->compile_id());
410 }
411
412 {
413 PhaseTraceTime timeit(_t_codeemit);
414 return emit_code_body();
415 }
416 }
417
418 void Compilation::install_code(int frame_size) {
419 // frame_size is in 32-bit words so adjust it intptr_t words
420 assert(frame_size == frame_map()->framesize(), "must match");
421 assert(in_bytes(frame_map()->framesize_in_bytes()) % sizeof(intptr_t) == 0, "must be at least pointer aligned");
422 _env->register_method(
423 method(),
424 osr_bci(),
425 &_offsets,
426 in_bytes(_frame_map->sp_offset_for_orig_pc()),
427 code(),
428 in_bytes(frame_map()->framesize_in_bytes()) / sizeof(intptr_t),
429 debug_info_recorder()->_oopmaps,
430 exception_handler_table(),
431 implicit_exception_table(),
432 compiler(),
433 has_unsafe_access(),
434 SharedRuntime::is_wide_vector(max_vector_size()),
435 has_monitors(),
436 _immediate_oops_patched
437 );
438 }
439
440
441 void Compilation::compile_method() {
442 {
443 PhaseTraceTime timeit(_t_setup);
444
445 // setup compilation
446 initialize();
447 }
448
449 if (!method()->can_be_compiled()) {
450 // Prevent race condition 6328518.
451 // This can happen if the method is obsolete or breakpointed.
452 bailout("Bailing out because method is not compilable");
453 return;
454 }
455
456 if (_env->jvmti_can_hotswap_or_post_breakpoint()) {
457 // We can assert evol_method because method->can_be_compiled is true.
458 dependency_recorder()->assert_evol_method(method());
459 }
460
461 if (env()->break_at_compile()) {
462 BREAKPOINT;
463 }
464
465 #ifndef PRODUCT
466 if (PrintCFGToFile) {
467 CFGPrinter::print_compilation(this);
468 }
469 #endif
470
471 // compile method
472 int frame_size = compile_java_method();
473
474 // bailout if method couldn't be compiled
475 // Note: make sure we mark the method as not compilable!
476 CHECK_BAILOUT();
477
478 if (should_install_code()) {
479 // install code
480 PhaseTraceTime timeit(_t_codeinstall);
481 install_code(frame_size);
482 }
483
484 if (log() != NULL) // Print code cache state into compiler log
485 log()->code_cache_state();
486
487 totalInstructionNodes += Instruction::number_of_instructions();
488 }
489
490
491 void Compilation::generate_exception_handler_table() {
492 // Generate an ExceptionHandlerTable from the exception handler
493 // information accumulated during the compilation.
494 ExceptionInfoList* info_list = exception_info_list();
495
496 if (info_list->length() == 0) {
497 return;
498 }
499
500 // allocate some arrays for use by the collection code.
501 const int num_handlers = 5;
502 GrowableArray<intptr_t>* bcis = new GrowableArray<intptr_t>(num_handlers);
503 GrowableArray<intptr_t>* scope_depths = new GrowableArray<intptr_t>(num_handlers);
504 GrowableArray<intptr_t>* pcos = new GrowableArray<intptr_t>(num_handlers);
505
506 for (int i = 0; i < info_list->length(); i++) {
507 ExceptionInfo* info = info_list->at(i);
508 XHandlers* handlers = info->exception_handlers();
509
510 // empty the arrays
511 bcis->trunc_to(0);
512 scope_depths->trunc_to(0);
513 pcos->trunc_to(0);
514
515 int prev_scope = 0;
516 for (int i = 0; i < handlers->length(); i++) {
517 XHandler* handler = handlers->handler_at(i);
518 assert(handler->entry_pco() != -1, "must have been generated");
519 assert(handler->scope_count() >= prev_scope, "handlers should be sorted by scope");
520
521 if (handler->scope_count() == prev_scope) {
522 int e = bcis->find_from_end(handler->handler_bci());
523 if (e >= 0 && scope_depths->at(e) == handler->scope_count()) {
524 // two different handlers are declared to dispatch to the same
525 // catch bci. During parsing we created edges for each
526 // handler but we really only need one. The exception handler
527 // table will also get unhappy if we try to declare both since
528 // it's nonsensical. Just skip this handler.
529 continue;
530 }
531 }
532
533 bcis->append(handler->handler_bci());
534 if (handler->handler_bci() == -1) {
535 // insert a wildcard handler at scope depth 0 so that the
536 // exception lookup logic with find it.
537 scope_depths->append(0);
538 } else {
539 scope_depths->append(handler->scope_count());
540 }
541 pcos->append(handler->entry_pco());
542
543 // stop processing once we hit a catch any
544 if (handler->is_catch_all()) {
545 assert(i == handlers->length() - 1, "catch all must be last handler");
546 }
547 prev_scope = handler->scope_count();
548 }
549 exception_handler_table()->add_subtable(info->pco(), bcis, scope_depths, pcos);
550 }
551 }
552
553 Compilation::Compilation(AbstractCompiler* compiler, ciEnv* env, ciMethod* method,
554 int osr_bci, BufferBlob* buffer_blob, bool install_code, DirectiveSet* directive)
555 : _next_id(0)
556 , _next_block_id(0)
557 , _compiler(compiler)
558 , _directive(directive)
559 , _env(env)
560 , _log(env->log())
561 , _method(method)
562 , _osr_bci(osr_bci)
563 , _hir(NULL)
564 , _max_spills(-1)
565 , _frame_map(NULL)
566 , _masm(NULL)
567 , _has_exception_handlers(false)
568 , _has_fpu_code(true) // pessimistic assumption
569 , _has_unsafe_access(false)
570 , _has_irreducible_loops(false)
571 , _would_profile(false)
572 , _has_method_handle_invokes(false)
573 , _has_reserved_stack_access(method->has_reserved_stack_access())
574 , _has_monitors(false)
575 , _max_monitors(0)
576 , _install_code(install_code)
577 , _bailout_msg(NULL)
578 , _exception_info_list(NULL)
579 , _allocator(NULL)
580 , _code(buffer_blob)
581 , _has_access_indexed(false)
582 , _interpreter_frame_size(0)
583 , _immediate_oops_patched(0)
584 , _current_instruction(NULL)
585 #ifndef PRODUCT
586 , _last_instruction_printed(NULL)
587 , _cfg_printer_output(NULL)
588 #endif // PRODUCT
589 {
590 PhaseTraceTime timeit(_t_compile);
591 _arena = Thread::current()->resource_area();
592 _env->set_compiler_data(this);
593 _exception_info_list = new ExceptionInfoList();
594 _implicit_exception_table.set_size(0);
595 #ifndef PRODUCT
596 if (PrintCFGToFile) {
597 _cfg_printer_output = new CFGPrinterOutput(this);
598 }
599 #endif
600 compile_method();
601 if (bailed_out()) {
602 _env->record_method_not_compilable(bailout_msg());
603 if (is_profiling()) {
604 // Compilation failed, create MDO, which would signal the interpreter
605 // to start profiling on its own.
606 _method->ensure_method_data();
607 }
608 } else if (is_profiling()) {
609 ciMethodData *md = method->method_data_or_null();
610 if (md != NULL) {
611 md->set_would_profile(_would_profile);
612 }
613 }
614 }
615
616 Compilation::~Compilation() {
617 // simulate crash during compilation
618 assert(CICrashAt < 0 || (uintx)_env->compile_id() != (uintx)CICrashAt, "just as planned");
619
620 _env->set_compiler_data(NULL);
621 }
622
623 void Compilation::add_exception_handlers_for_pco(int pco, XHandlers* exception_handlers) {
624 #ifndef PRODUCT
625 if (PrintExceptionHandlers && Verbose) {
626 tty->print_cr(" added exception scope for pco %d", pco);
627 }
628 #endif
629 // Note: we do not have program counters for these exception handlers yet
630 exception_info_list()->push(new ExceptionInfo(pco, exception_handlers));
631 }
632
633
634 void Compilation::notice_inlined_method(ciMethod* method) {
635 _env->notice_inlined_method(method);
636 }
637
638
639 void Compilation::bailout(const char* msg) {
640 assert(msg != NULL, "bailout message must exist");
641 if (!bailed_out()) {
642 // keep first bailout message
643 if (PrintCompilation || PrintBailouts) tty->print_cr("compilation bailout: %s", msg);
644 _bailout_msg = msg;
645 }
646 }
647
648 ciKlass* Compilation::cha_exact_type(ciType* type) {
649 if (type != NULL && type->is_loaded() && type->is_instance_klass()) {
650 ciInstanceKlass* ik = type->as_instance_klass();
651 assert(ik->exact_klass() == NULL, "no cha for final klass");
652 if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) {
653 dependency_recorder()->assert_leaf_type(ik);
654 return ik;
655 }
656 }
657 return NULL;
658 }
659
660 void Compilation::print_timers() {
661 tty->print_cr(" C1 Compile Time: %7.3f s", timers[_t_compile].seconds());
662 tty->print_cr(" Setup time: %7.3f s", timers[_t_setup].seconds());
663
664 {
665 tty->print_cr(" Build HIR: %7.3f s", timers[_t_buildIR].seconds());
666 tty->print_cr(" Parse: %7.3f s", timers[_t_hir_parse].seconds());
667 tty->print_cr(" Optimize blocks: %7.3f s", timers[_t_optimize_blocks].seconds());
668 tty->print_cr(" GVN: %7.3f s", timers[_t_gvn].seconds());
669 tty->print_cr(" Null checks elim: %7.3f s", timers[_t_optimize_null_checks].seconds());
670 tty->print_cr(" Range checks elim: %7.3f s", timers[_t_rangeCheckElimination].seconds());
671
672 double other = timers[_t_buildIR].seconds() -
673 (timers[_t_hir_parse].seconds() +
674 timers[_t_optimize_blocks].seconds() +
675 timers[_t_gvn].seconds() +
676 timers[_t_optimize_null_checks].seconds() +
677 timers[_t_rangeCheckElimination].seconds());
678 if (other > 0) {
679 tty->print_cr(" Other: %7.3f s", other);
680 }
681 }
682
683 {
684 tty->print_cr(" Emit LIR: %7.3f s", timers[_t_emit_lir].seconds());
685 tty->print_cr(" LIR Gen: %7.3f s", timers[_t_lirGeneration].seconds());
686 tty->print_cr(" Linear Scan: %7.3f s", timers[_t_linearScan].seconds());
687 NOT_PRODUCT(LinearScan::print_timers(timers[_t_linearScan].seconds()));
688
689 double other = timers[_t_emit_lir].seconds() -
690 (timers[_t_lirGeneration].seconds() +
691 timers[_t_linearScan].seconds());
692 if (other > 0) {
693 tty->print_cr(" Other: %7.3f s", other);
694 }
695 }
696
697 tty->print_cr(" Code Emission: %7.3f s", timers[_t_codeemit].seconds());
698 tty->print_cr(" Code Installation: %7.3f s", timers[_t_codeinstall].seconds());
699
700 double other = timers[_t_compile].seconds() -
701 (timers[_t_setup].seconds() +
702 timers[_t_buildIR].seconds() +
703 timers[_t_emit_lir].seconds() +
704 timers[_t_codeemit].seconds() +
705 timers[_t_codeinstall].seconds());
706 if (other > 0) {
707 tty->print_cr(" Other: %7.3f s", other);
708 }
709
710 NOT_PRODUCT(LinearScan::print_statistics());
711 }
712
713
714 #ifndef PRODUCT
715 void CompilationResourceObj::print() const { print_on(tty); }
716
717 void CompilationResourceObj::print_on(outputStream* st) const {
718 st->print_cr("CompilationResourceObj(" INTPTR_FORMAT ")", p2i(this));
719 }
720
721 // Called from debugger to get the interval with 'reg_num' during register allocation.
722 Interval* find_interval(int reg_num) {
723 return Compilation::current()->allocator()->find_interval_at(reg_num);
724 }
725
726 #endif // NOT PRODUCT