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