1 /*
2 * Copyright (c) 1999, 2026, 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/aotLinkedClassBulkLoader.hpp"
26 #include "cds/cdsConfig.hpp"
27 #include "classfile/javaClasses.inline.hpp"
28 #include "classfile/symbolTable.hpp"
29 #include "classfile/vmClasses.hpp"
30 #include "classfile/vmSymbols.hpp"
31 #include "code/aotCodeCache.hpp"
32 #include "code/codeCache.hpp"
33 #include "code/codeHeapState.hpp"
34 #include "code/dependencyContext.hpp"
35 #include "compiler/compilationLog.hpp"
36 #include "compiler/compilationMemoryStatistic.hpp"
37 #include "compiler/compilationPolicy.hpp"
38 #include "compiler/compileBroker.hpp"
39 #include "compiler/compileLog.hpp"
40 #include "compiler/compilerDefinitions.inline.hpp"
41 #include "compiler/compilerEvent.hpp"
42 #include "compiler/compilerOracle.hpp"
43 #include "compiler/directivesParser.hpp"
44 #include "compiler/recompilationPolicy.hpp"
45 #include "gc/shared/memAllocator.hpp"
46 #include "interpreter/linkResolver.hpp"
47 #include "jfr/jfrEvents.hpp"
48 #include "jvm.h"
49 #include "logging/log.hpp"
50 #include "logging/logStream.hpp"
51 #include "memory/allocation.inline.hpp"
52 #include "memory/resourceArea.hpp"
53 #include "memory/universe.hpp"
54 #include "oops/method.inline.hpp"
55 #include "oops/methodData.hpp"
56 #include "oops/oop.inline.hpp"
57 #include "prims/jvmtiExport.hpp"
58 #include "prims/nativeLookup.hpp"
59 #include "prims/whitebox.hpp"
60 #include "runtime/atomicAccess.hpp"
61 #include "runtime/escapeBarrier.hpp"
62 #include "runtime/globals_extension.hpp"
63 #include "runtime/handles.inline.hpp"
64 #include "runtime/init.hpp"
65 #include "runtime/interfaceSupport.inline.hpp"
66 #include "runtime/java.hpp"
67 #include "runtime/javaCalls.hpp"
68 #include "runtime/jniHandles.inline.hpp"
69 #include "runtime/os.hpp"
70 #include "runtime/perfData.hpp"
71 #include "runtime/safepointVerifiers.hpp"
72 #include "runtime/sharedRuntime.hpp"
73 #include "runtime/threads.hpp"
74 #include "runtime/threadSMR.inline.hpp"
75 #include "runtime/timerTrace.hpp"
76 #include "runtime/vframe.inline.hpp"
77 #include "services/management.hpp"
78 #include "utilities/debug.hpp"
79 #include "utilities/dtrace.hpp"
80 #include "utilities/events.hpp"
81 #include "utilities/formatBuffer.hpp"
82 #include "utilities/macros.hpp"
83 #include "utilities/nonblockingQueue.inline.hpp"
84 #ifdef COMPILER1
85 #include "c1/c1_Compiler.hpp"
86 #endif
87 #ifdef COMPILER2
88 #include "opto/c2compiler.hpp"
89 #endif
90 #if INCLUDE_JVMCI
91 #include "jvmci/jvmciEnv.hpp"
92 #include "jvmci/jvmciRuntime.hpp"
93 #endif
94
95 #ifdef DTRACE_ENABLED
96
97 // Only bother with this argument setup if dtrace is available
98
99 #define DTRACE_METHOD_COMPILE_BEGIN_PROBE(method, comp_name) \
100 { \
101 Symbol* klass_name = (method)->klass_name(); \
102 Symbol* name = (method)->name(); \
103 Symbol* signature = (method)->signature(); \
104 HOTSPOT_METHOD_COMPILE_BEGIN( \
105 (char *) comp_name, strlen(comp_name), \
106 (char *) klass_name->bytes(), klass_name->utf8_length(), \
107 (char *) name->bytes(), name->utf8_length(), \
108 (char *) signature->bytes(), signature->utf8_length()); \
109 }
110
111 #define DTRACE_METHOD_COMPILE_END_PROBE(method, comp_name, success) \
112 { \
113 Symbol* klass_name = (method)->klass_name(); \
114 Symbol* name = (method)->name(); \
115 Symbol* signature = (method)->signature(); \
116 HOTSPOT_METHOD_COMPILE_END( \
117 (char *) comp_name, strlen(comp_name), \
118 (char *) klass_name->bytes(), klass_name->utf8_length(), \
119 (char *) name->bytes(), name->utf8_length(), \
120 (char *) signature->bytes(), signature->utf8_length(), (success)); \
121 }
122
123 #else // ndef DTRACE_ENABLED
124
125 #define DTRACE_METHOD_COMPILE_BEGIN_PROBE(method, comp_name)
126 #define DTRACE_METHOD_COMPILE_END_PROBE(method, comp_name, success)
127
128 #endif // ndef DTRACE_ENABLED
129
130 bool CompileBroker::_initialized = false;
131 volatile bool CompileBroker::_should_block = false;
132 volatile int CompileBroker::_print_compilation_warning = 0;
133 volatile jint CompileBroker::_should_compile_new_jobs = run_compilation;
134
135 // The installed compiler(s)
136 AbstractCompiler* CompileBroker::_compilers[2];
137
138 // The maximum numbers of compiler threads to be determined during startup.
139 int CompileBroker::_c1_count = 0;
140 int CompileBroker::_c2_count = 0;
141 int CompileBroker::_ac_count = 0;
142
143 // An array of compiler names as Java String objects
144 jobject* CompileBroker::_compiler1_objects = nullptr;
145 jobject* CompileBroker::_compiler2_objects = nullptr;
146 jobject* CompileBroker::_ac_objects = nullptr;
147
148 CompileLog** CompileBroker::_compiler1_logs = nullptr;
149 CompileLog** CompileBroker::_compiler2_logs = nullptr;
150 CompileLog** CompileBroker::_ac_logs = nullptr;
151
152 // These counters are used to assign an unique ID to each compilation.
153 volatile jint CompileBroker::_compilation_id = 0;
154 volatile jint CompileBroker::_osr_compilation_id = 0;
155 volatile jint CompileBroker::_native_compilation_id = 0;
156
157 // Performance counters
158 PerfCounter* CompileBroker::_perf_total_compilation = nullptr;
159 PerfCounter* CompileBroker::_perf_osr_compilation = nullptr;
160 PerfCounter* CompileBroker::_perf_standard_compilation = nullptr;
161
162 PerfCounter* CompileBroker::_perf_total_bailout_count = nullptr;
163 PerfCounter* CompileBroker::_perf_total_invalidated_count = nullptr;
164 PerfCounter* CompileBroker::_perf_total_compile_count = nullptr;
165 PerfCounter* CompileBroker::_perf_total_osr_compile_count = nullptr;
166 PerfCounter* CompileBroker::_perf_total_standard_compile_count = nullptr;
167
168 PerfCounter* CompileBroker::_perf_sum_osr_bytes_compiled = nullptr;
169 PerfCounter* CompileBroker::_perf_sum_standard_bytes_compiled = nullptr;
170 PerfCounter* CompileBroker::_perf_sum_nmethod_size = nullptr;
171 PerfCounter* CompileBroker::_perf_sum_nmethod_code_size = nullptr;
172
173 PerfStringVariable* CompileBroker::_perf_last_method = nullptr;
174 PerfStringVariable* CompileBroker::_perf_last_failed_method = nullptr;
175 PerfStringVariable* CompileBroker::_perf_last_invalidated_method = nullptr;
176 PerfVariable* CompileBroker::_perf_last_compile_type = nullptr;
177 PerfVariable* CompileBroker::_perf_last_compile_size = nullptr;
178 PerfVariable* CompileBroker::_perf_last_failed_type = nullptr;
179 PerfVariable* CompileBroker::_perf_last_invalidated_type = nullptr;
180
181 // Timers and counters for generating statistics
182 elapsedTimer CompileBroker::_t_total_compilation;
183 elapsedTimer CompileBroker::_t_osr_compilation;
184 elapsedTimer CompileBroker::_t_standard_compilation;
185 elapsedTimer CompileBroker::_t_invalidated_compilation;
186 elapsedTimer CompileBroker::_t_bailedout_compilation;
187
188 uint CompileBroker::_total_bailout_count = 0;
189 uint CompileBroker::_total_invalidated_count = 0;
190 uint CompileBroker::_total_not_entrant_count = 0;
191 uint CompileBroker::_total_compile_count = 0;
192 uint CompileBroker::_total_osr_compile_count = 0;
193 uint CompileBroker::_total_standard_compile_count = 0;
194 uint CompileBroker::_total_compiler_stopped_count = 0;
195 uint CompileBroker::_total_compiler_restarted_count = 0;
196
197 uint CompileBroker::_sum_osr_bytes_compiled = 0;
198 uint CompileBroker::_sum_standard_bytes_compiled = 0;
199 uint CompileBroker::_sum_nmethod_size = 0;
200 uint CompileBroker::_sum_nmethod_code_size = 0;
201
202 jlong CompileBroker::_peak_compilation_time = 0;
203
204 CompilerStatistics CompileBroker::_stats_per_level[CompLevel_full_optimization];
205 CompilerStatistics CompileBroker::_aot_stats;
206 CompilerStatistics CompileBroker::_aot_stats_per_level[CompLevel_full_optimization + 1];
207
208 CompileQueue* CompileBroker::_c2_compile_queue = nullptr;
209 CompileQueue* CompileBroker::_c1_compile_queue = nullptr;
210 CompileQueue* CompileBroker::_ac1_compile_queue = nullptr;
211 CompileQueue* CompileBroker::_ac2_compile_queue = nullptr;
212
213 bool compileBroker_init() {
214 if (LogEvents) {
215 CompilationLog::init();
216 }
217
218 // init directives stack, adding default directive
219 DirectivesStack::init();
220
221 if (DirectivesParser::has_file()) {
222 return DirectivesParser::parse_from_flag();
223 } else if (CompilerDirectivesPrint) {
224 // Print default directive even when no other was added
225 DirectivesStack::print(tty);
226 }
227
228 return true;
229 }
230
231 CompileTaskWrapper::CompileTaskWrapper(CompileTask* task) {
232 CompilerThread* thread = CompilerThread::current();
233 thread->set_task(task);
234 CompileLog* log = thread->log();
235 thread->timeout()->arm();
236 if (log != nullptr && !task->is_unloaded()) task->log_task_start(log);
237 }
238
239 CompileTaskWrapper::~CompileTaskWrapper() {
240 CompilerThread* thread = CompilerThread::current();
241
242 // First, disarm the timeout. This still relies on the underlying task.
243 thread->timeout()->disarm();
244
245 CompileTask* task = thread->task();
246 CompileLog* log = thread->log();
247 AbstractCompiler* comp = thread->compiler();
248 if (log != nullptr && !task->is_unloaded()) task->log_task_done(log);
249 thread->set_task(nullptr);
250 thread->set_env(nullptr);
251 if (task->is_blocking()) {
252 bool free_task = false;
253 {
254 MutexLocker notifier(thread, CompileTaskWait_lock);
255 task->mark_complete();
256 #if INCLUDE_JVMCI
257 if (comp->is_jvmci()) {
258 if (!task->has_waiter()) {
259 // The waiting thread timed out and thus did not delete the task.
260 free_task = true;
261 }
262 task->set_blocking_jvmci_compile_state(nullptr);
263 }
264 #endif
265 if (!free_task) {
266 // Notify the waiting thread that the compilation has completed
267 // so that it can free the task.
268 CompileTaskWait_lock->notify_all();
269 }
270 }
271 if (free_task) {
272 // The task can only be deleted once the task lock is released.
273 delete task;
274 }
275 } else {
276 task->mark_complete();
277
278 // By convention, the compiling thread is responsible for deleting
279 // a non-blocking CompileTask.
280 delete task;
281 }
282 }
283
284 /**
285 * Check if a CompilerThread can be removed and update count if requested.
286 */
287 bool CompileBroker::can_remove(CompilerThread *ct, bool do_it) {
288 assert(UseDynamicNumberOfCompilerThreads, "or shouldn't be here");
289 if (!ReduceNumberOfCompilerThreads) return false;
290
291 if (RecompilationPolicy::have_recompilation_work()) return false;
292
293 AbstractCompiler *compiler = ct->compiler();
294 int compiler_count = compiler->num_compiler_threads();
295 bool c1 = compiler->is_c1();
296
297 // Keep at least 1 compiler thread of each type.
298 if (compiler_count < 2) return false;
299
300 // Keep thread alive for at least some time.
301 if (ct->idle_time_millis() < (c1 ? 500 : 100)) return false;
302
303 #if INCLUDE_JVMCI
304 if (compiler->is_jvmci() && !UseJVMCINativeLibrary) {
305 // Handles for JVMCI thread objects may get released concurrently.
306 if (do_it) {
307 assert(CompileThread_lock->owner() == ct, "must be holding lock");
308 } else {
309 // Skip check if it's the last thread and let caller check again.
310 return true;
311 }
312 }
313 #endif
314
315 // We only allow the last compiler thread of each type to get removed.
316 jobject last_compiler = c1 ? compiler1_object(compiler_count - 1)
317 : compiler2_object(compiler_count - 1);
318 if (ct->threadObj() == JNIHandles::resolve_non_null(last_compiler)) {
319 if (do_it) {
320 assert_locked_or_safepoint(CompileThread_lock); // Update must be consistent.
321 compiler->set_num_compiler_threads(compiler_count - 1);
322 #if INCLUDE_JVMCI
323 if (compiler->is_jvmci() && !UseJVMCINativeLibrary) {
324 // Old j.l.Thread object can die when no longer referenced elsewhere.
325 JNIHandles::destroy_global(compiler2_object(compiler_count - 1));
326 _compiler2_objects[compiler_count - 1] = nullptr;
327 }
328 #endif
329 }
330 return true;
331 }
332 return false;
333 }
334
335 /**
336 * Add a CompileTask to a CompileQueue.
337 */
338 void CompileQueue::add(CompileTask* task) {
339 assert(_lock->owned_by_self(), "must own lock");
340
341 task->set_next(nullptr);
342 task->set_prev(nullptr);
343
344 if (_last == nullptr) {
345 // The compile queue is empty.
346 assert(_first == nullptr, "queue is empty");
347 _first = task;
348 _last = task;
349 } else {
350 // Append the task to the queue.
351 assert(_last->next() == nullptr, "not last");
352 _last->set_next(task);
353 task->set_prev(_last);
354 _last = task;
355 }
356 ++_size;
357 ++_total_added;
358 if (_size > _peak_size) {
359 _peak_size = _size;
360 }
361
362 // Mark the method as being in the compile queue.
363 task->method()->set_queued_for_compilation();
364
365 task->mark_queued(os::elapsed_counter());
366
367 if (CIPrintCompileQueue) {
368 print_tty();
369 }
370
371 if (LogCompilation && xtty != nullptr) {
372 task->log_task_queued();
373 }
374
375 if (TrainingData::need_data() && !CDSConfig::is_dumping_final_static_archive()) {
376 CompileTrainingData* ctd = CompileTrainingData::make(task);
377 if (ctd != nullptr) {
378 task->set_training_data(ctd);
379 }
380 }
381
382 // Notify CompilerThreads that a task is available.
383 _lock->notify_all();
384 }
385
386 void CompileQueue::add_pending(CompileTask* task) {
387 assert(_lock->owned_by_self() == false, "must NOT own lock");
388 assert(UseLockFreeCompileQueues, "");
389 task->method()->set_queued_for_compilation();
390 _queue.push(*task);
391 // FIXME: additional coordination needed? e.g., is it possible for compiler thread to block w/o processing pending tasks?
392 if (is_empty()) {
393 MutexLocker ml(_lock);
394 _lock->notify_all();
395 }
396 }
397
398 static bool process_pending(CompileTask* task) {
399 // guarantee(task->method()->queued_for_compilation(), "");
400 if (task->is_unloaded()) {
401 return true; // unloaded
402 }
403 task->method()->set_queued_for_compilation(); // FIXME
404 if (task->method()->pending_queue_processed()) {
405 return true; // already queued
406 }
407 // Mark the method as being in the compile queue.
408 task->method()->set_pending_queue_processed();
409 if (CompileBroker::compilation_is_complete(task->method(), task->osr_bci(), task->comp_level(),
410 task->requires_online_compilation(), task->compile_reason())) {
411 return true; // already compiled
412 }
413 return false; // active
414 }
415
416 void CompileQueue::transfer_pending() {
417 assert(_lock->owned_by_self(), "must own lock");
418
419 CompileTask* task;
420 while ((task = _queue.pop()) != nullptr) {
421 bool is_stale = process_pending(task);
422 if (is_stale) {
423 task->set_next(_first_stale);
424 task->set_prev(nullptr);
425 _first_stale = task;
426 } else {
427 add(task);
428 }
429 }
430 }
431
432 /**
433 * Empties compilation queue by deleting all compilation tasks.
434 * Furthermore, the method wakes up all threads that are waiting
435 * on a compilation task to finish. This can happen if background
436 * compilation is disabled.
437 */
438 void CompileQueue::delete_all() {
439 MutexLocker mu(_lock);
440 transfer_pending();
441
442 CompileTask* current = _first;
443
444 // Iterate over all tasks in the compile queue
445 while (current != nullptr) {
446 CompileTask* next = current->next();
447 if (!current->is_blocking()) {
448 // Non-blocking task. No one is waiting for it, delete it now.
449 delete current;
450 } else {
451 // Blocking task. By convention, it is the waiters responsibility
452 // to delete the task. We cannot delete it here, because we do not
453 // coordinate with waiters. We will notify the waiters later.
454 }
455 current = next;
456 }
457 _first = nullptr;
458 _last = nullptr;
459
460 // Wake up all blocking task waiters to deal with remaining blocking
461 // tasks. This is not a performance sensitive path, so we do this
462 // unconditionally to simplify coding/testing.
463 {
464 MonitorLocker ml(Thread::current(), CompileTaskWait_lock);
465 ml.notify_all();
466 }
467
468 // Wake up all threads that block on the queue.
469 _lock->notify_all();
470 }
471
472 /**
473 * Get the next CompileTask from a CompileQueue
474 */
475 CompileTask* CompileQueue::get(CompilerThread* thread) {
476 // save methods from RedefineClasses across safepoint
477 // across compile queue lock below.
478 methodHandle save_method;
479
480 MonitorLocker locker(_lock);
481 transfer_pending();
482
483 RecompilationPolicy::sample_load_average();
484
485 // If _first is null we have no more compile jobs. There are two reasons for
486 // having no compile jobs: First, we compiled everything we wanted. Second,
487 // we ran out of code cache so compilation has been disabled. In the latter
488 // case we perform code cache sweeps to free memory such that we can re-enable
489 // compilation.
490 while (_first == nullptr) {
491 // Exit loop if compilation is disabled forever
492 if (CompileBroker::is_compilation_disabled_forever()) {
493 return nullptr;
494 }
495
496 AbstractCompiler* compiler = thread->compiler();
497 guarantee(compiler != nullptr, "Compiler object must exist");
498 compiler->on_empty_queue(this, thread);
499 if (_first != nullptr) {
500 // The call to on_empty_queue may have temporarily unlocked the MCQ lock
501 // so check again whether any tasks were added to the queue.
502 break;
503 }
504
505 // If we have added stale tasks, there might be waiters that want
506 // the notification these tasks have failed. Normally, this would
507 // be done by a compiler thread that would perform the purge at
508 // the end of some compilation. But, if compile queue is empty,
509 // there is no guarantee compilers would run and do the purge.
510 // Do the purge here and now to unblock the waiters.
511 // Perform this until we run out of stale tasks.
512 while (_first_stale != nullptr) {
513 purge_stale_tasks();
514 }
515 if (_first != nullptr) {
516 // Purge stale tasks may have transferred some new tasks,
517 // so check again.
518 break;
519 }
520
521 // If there are no compilation tasks and we can compile new jobs
522 // (i.e., there is enough free space in the code cache) there is
523 // no need to invoke the GC.
524 // We need a timed wait here, since compiler threads can exit if compilation
525 // is disabled forever. We use 5 seconds wait time; the exiting of compiler threads
526 // is not critical and we do not want idle compiler threads to wake up too often.
527 locker.wait(5*1000);
528
529 transfer_pending(); // reacquired lock
530
531 if (RecompilationPolicy::have_recompilation_work()) return nullptr;
532
533 if (UseDynamicNumberOfCompilerThreads && _first == nullptr) {
534 // Still nothing to compile. Give caller a chance to stop this thread.
535 if (CompileBroker::can_remove(CompilerThread::current(), false)) return nullptr;
536 }
537 }
538
539 if (CompileBroker::is_compilation_disabled_forever()) {
540 return nullptr;
541 }
542
543 CompileTask* task;
544 {
545 NoSafepointVerifier nsv;
546 task = CompilationPolicy::select_task(this, thread);
547 if (task != nullptr) {
548 task = task->select_for_compilation();
549 }
550 }
551
552 if (task != nullptr) {
553 // Save method pointers across unlock safepoint. The task is removed from
554 // the compilation queue, which is walked during RedefineClasses.
555 Thread* thread = Thread::current();
556 save_method = methodHandle(thread, task->method());
557
558 remove(task);
559 }
560 purge_stale_tasks(); // may temporarily release MCQ lock
561 return task;
562 }
563
564 // Clean & deallocate stale compile tasks.
565 // Temporarily releases MethodCompileQueue lock.
566 void CompileQueue::purge_stale_tasks() {
567 assert(_lock->owned_by_self(), "must own lock");
568 if (_first_stale != nullptr) {
569 // Stale tasks are purged when MCQ lock is released,
570 // but _first_stale updates are protected by MCQ lock.
571 // Once task processing starts and MCQ lock is released,
572 // other compiler threads can reuse _first_stale.
573 CompileTask* head = _first_stale;
574 _first_stale = nullptr;
575 {
576 MutexUnlocker ul(_lock);
577 for (CompileTask* task = head; task != nullptr; ) {
578 CompileTask* next_task = task->next();
579 task->set_next(nullptr);
580 CompileTaskWrapper ctw(task); // Frees the task
581 task->set_failure_reason("stale task");
582 task = next_task;
583 }
584 }
585 transfer_pending(); // transfer pending after reacquiring MCQ lock
586 }
587 }
588
589 void CompileQueue::remove(CompileTask* task) {
590 assert(_lock->owned_by_self(), "must own lock");
591 if (task->prev() != nullptr) {
592 task->prev()->set_next(task->next());
593 } else {
594 // max is the first element
595 assert(task == _first, "Sanity");
596 _first = task->next();
597 }
598
599 if (task->next() != nullptr) {
600 task->next()->set_prev(task->prev());
601 } else {
602 // max is the last element
603 assert(task == _last, "Sanity");
604 _last = task->prev();
605 }
606 task->set_next(nullptr);
607 task->set_prev(nullptr);
608 --_size;
609 ++_total_removed;
610 }
611
612 void CompileQueue::remove_and_mark_stale(CompileTask* task) {
613 assert(_lock->owned_by_self(), "must own lock");
614 remove(task);
615
616 // Enqueue the task for reclamation (should be done outside MCQ lock)
617 task->set_next(_first_stale);
618 task->set_prev(nullptr);
619 _first_stale = task;
620 }
621
622 // methods in the compile queue need to be marked as used on the stack
623 // so that they don't get reclaimed by Redefine Classes
624 void CompileQueue::mark_on_stack() {
625 for (CompileTask* task = _first; task != nullptr; task = task->next()) {
626 task->mark_on_stack();
627 }
628 for (CompileTask* task = _queue.first(); !_queue.is_end(task); task = task->next()) {
629 assert(task != nullptr, "");
630 task->mark_on_stack();
631 }
632 }
633
634
635 CompileQueue* CompileBroker::compile_queue(int comp_level, bool is_aot) {
636 if (is_c2_compile(comp_level)) return ((is_aot && (_ac_count > 0)) ? _ac2_compile_queue : _c2_compile_queue);
637 if (is_c1_compile(comp_level)) return ((is_aot && (_ac_count > 0)) ? _ac1_compile_queue : _c1_compile_queue);
638 return nullptr;
639 }
640
641 CompileQueue* CompileBroker::c1_compile_queue() {
642 return _c1_compile_queue;
643 }
644
645 CompileQueue* CompileBroker::c2_compile_queue() {
646 return _c2_compile_queue;
647 }
648
649 void CompileBroker::print_compile_queues(outputStream* st) {
650 st->print_cr("Current compiles: ");
651
652 char buf[2000];
653 int buflen = sizeof(buf);
654 Threads::print_threads_compiling(st, buf, buflen, /* short_form = */ true);
655
656 st->cr();
657 if (_c1_compile_queue != nullptr) {
658 _c1_compile_queue->print(st);
659 }
660 if (_c2_compile_queue != nullptr) {
661 _c2_compile_queue->print(st);
662 }
663 if (_ac1_compile_queue != nullptr) {
664 _ac1_compile_queue->print(st);
665 }
666 if (_ac2_compile_queue != nullptr) {
667 _ac2_compile_queue->print(st);
668 }
669 }
670
671 void CompileQueue::print(outputStream* st) {
672 assert_locked_or_safepoint(_lock);
673 st->print_cr("%s:", name());
674 CompileTask* task = _first;
675 if (task == nullptr) {
676 st->print_cr("Empty");
677 } else {
678 while (task != nullptr) {
679 task->print(st, nullptr, true, true);
680 task = task->next();
681 }
682 }
683 st->cr();
684 }
685
686 void CompileQueue::print_tty() {
687 stringStream ss;
688 // Dump the compile queue into a buffer before locking the tty
689 print(&ss);
690 {
691 ttyLocker ttyl;
692 tty->print("%s", ss.freeze());
693 }
694 }
695
696 CompilerCounters::CompilerCounters() {
697 _current_method[0] = '\0';
698 _compile_type = CompileBroker::no_compile;
699 }
700
701 #if INCLUDE_JFR && COMPILER2_OR_JVMCI
702 // It appends new compiler phase names to growable array phase_names(a new CompilerPhaseType mapping
703 // in compiler/compilerEvent.cpp) and registers it with its serializer.
704 //
705 // c2 uses explicit CompilerPhaseType idToPhase mapping in opto/phasetype.hpp,
706 // so if c2 is used, it should be always registered first.
707 // This function is called during vm initialization.
708 static void register_jfr_phasetype_serializer(CompilerType compiler_type) {
709 ResourceMark rm;
710 static bool first_registration = true;
711 if (compiler_type == compiler_jvmci) {
712 CompilerEvent::PhaseEvent::get_phase_id("NOT_A_PHASE_NAME", false, false, false);
713 first_registration = false;
714 #ifdef COMPILER2
715 } else if (compiler_type == compiler_c2) {
716 assert(first_registration, "invariant"); // c2 must be registered first.
717 for (int i = 0; i < PHASE_NUM_TYPES; i++) {
718 const char* phase_name = CompilerPhaseTypeHelper::to_description((CompilerPhaseType) i);
719 CompilerEvent::PhaseEvent::get_phase_id(phase_name, false, false, false);
720 }
721 first_registration = false;
722 #endif // COMPILER2
723 }
724 }
725 #endif // INCLUDE_JFR && COMPILER2_OR_JVMCI
726
727 // ------------------------------------------------------------------
728 // CompileBroker::compilation_init
729 //
730 // Initialize the Compilation object
731 void CompileBroker::compilation_init(JavaThread* THREAD) {
732 // No need to initialize compilation system if we do not use it.
733 if (!UseCompiler) {
734 return;
735 }
736 // Set the interface to the current compiler(s).
737 _c1_count = CompilationPolicy::c1_count();
738 _c2_count = CompilationPolicy::c2_count();
739 _ac_count = CompilationPolicy::ac_count();
740
741 #if INCLUDE_JVMCI
742 if (EnableJVMCI) {
743 // This is creating a JVMCICompiler singleton.
744 JVMCICompiler* jvmci = new JVMCICompiler();
745
746 if (UseJVMCICompiler) {
747 _compilers[1] = jvmci;
748 if (FLAG_IS_DEFAULT(JVMCIThreads)) {
749 if (BootstrapJVMCI) {
750 // JVMCI will bootstrap so give it more threads
751 _c2_count = MIN2(32, os::active_processor_count());
752 }
753 } else {
754 _c2_count = JVMCIThreads;
755 }
756 if (FLAG_IS_DEFAULT(JVMCIHostThreads)) {
757 } else {
758 #ifdef COMPILER1
759 _c1_count = JVMCIHostThreads;
760 #endif // COMPILER1
761 }
762 }
763 }
764 #endif // INCLUDE_JVMCI
765
766 #ifdef COMPILER1
767 if (_c1_count > 0) {
768 _compilers[0] = new Compiler();
769 }
770 #endif // COMPILER1
771
772 #ifdef COMPILER2
773 if (true JVMCI_ONLY( && !UseJVMCICompiler)) {
774 if (_c2_count > 0) {
775 _compilers[1] = new C2Compiler();
776 // Register c2 first as c2 CompilerPhaseType idToPhase mapping is explicit.
777 // idToPhase mapping for c2 is in opto/phasetype.hpp
778 JFR_ONLY(register_jfr_phasetype_serializer(compiler_c2);)
779 }
780 }
781 #endif // COMPILER2
782
783 #if INCLUDE_JVMCI
784 // Register after c2 registration.
785 // JVMCI CompilerPhaseType idToPhase mapping is dynamic.
786 if (EnableJVMCI) {
787 JFR_ONLY(register_jfr_phasetype_serializer(compiler_jvmci);)
788 }
789 #endif // INCLUDE_JVMCI
790
791 if (CompilerOracle::should_collect_memstat()) {
792 CompilationMemoryStatistic::initialize();
793 }
794
795 // Start the compiler thread(s)
796 init_compiler_threads();
797 // totalTime performance counter is always created as it is required
798 // by the implementation of java.lang.management.CompilationMXBean.
799 {
800 // Ensure OOM leads to vm_exit_during_initialization.
801 EXCEPTION_MARK;
802 _perf_total_compilation =
803 PerfDataManager::create_counter(JAVA_CI, "totalTime",
804 PerfData::U_Ticks, CHECK);
805 }
806
807 if (UsePerfData) {
808
809 EXCEPTION_MARK;
810
811 // create the jvmstat performance counters
812 _perf_osr_compilation =
813 PerfDataManager::create_counter(SUN_CI, "osrTime",
814 PerfData::U_Ticks, CHECK);
815
816 _perf_standard_compilation =
817 PerfDataManager::create_counter(SUN_CI, "standardTime",
818 PerfData::U_Ticks, CHECK);
819
820 _perf_total_bailout_count =
821 PerfDataManager::create_counter(SUN_CI, "totalBailouts",
822 PerfData::U_Events, CHECK);
823
824 _perf_total_invalidated_count =
825 PerfDataManager::create_counter(SUN_CI, "totalInvalidates",
826 PerfData::U_Events, CHECK);
827
828 _perf_total_compile_count =
829 PerfDataManager::create_counter(SUN_CI, "totalCompiles",
830 PerfData::U_Events, CHECK);
831 _perf_total_osr_compile_count =
832 PerfDataManager::create_counter(SUN_CI, "osrCompiles",
833 PerfData::U_Events, CHECK);
834
835 _perf_total_standard_compile_count =
836 PerfDataManager::create_counter(SUN_CI, "standardCompiles",
837 PerfData::U_Events, CHECK);
838
839 _perf_sum_osr_bytes_compiled =
840 PerfDataManager::create_counter(SUN_CI, "osrBytes",
841 PerfData::U_Bytes, CHECK);
842
843 _perf_sum_standard_bytes_compiled =
844 PerfDataManager::create_counter(SUN_CI, "standardBytes",
845 PerfData::U_Bytes, CHECK);
846
847 _perf_sum_nmethod_size =
848 PerfDataManager::create_counter(SUN_CI, "nmethodSize",
849 PerfData::U_Bytes, CHECK);
850
851 _perf_sum_nmethod_code_size =
852 PerfDataManager::create_counter(SUN_CI, "nmethodCodeSize",
853 PerfData::U_Bytes, CHECK);
854
855 _perf_last_method =
856 PerfDataManager::create_string_variable(SUN_CI, "lastMethod",
857 CompilerCounters::cmname_buffer_length,
858 "", CHECK);
859
860 _perf_last_failed_method =
861 PerfDataManager::create_string_variable(SUN_CI, "lastFailedMethod",
862 CompilerCounters::cmname_buffer_length,
863 "", CHECK);
864
865 _perf_last_invalidated_method =
866 PerfDataManager::create_string_variable(SUN_CI, "lastInvalidatedMethod",
867 CompilerCounters::cmname_buffer_length,
868 "", CHECK);
869
870 _perf_last_compile_type =
871 PerfDataManager::create_variable(SUN_CI, "lastType",
872 PerfData::U_None,
873 (jlong)CompileBroker::no_compile,
874 CHECK);
875
876 _perf_last_compile_size =
877 PerfDataManager::create_variable(SUN_CI, "lastSize",
878 PerfData::U_Bytes,
879 (jlong)CompileBroker::no_compile,
880 CHECK);
881
882
883 _perf_last_failed_type =
884 PerfDataManager::create_variable(SUN_CI, "lastFailedType",
885 PerfData::U_None,
886 (jlong)CompileBroker::no_compile,
887 CHECK);
888
889 _perf_last_invalidated_type =
890 PerfDataManager::create_variable(SUN_CI, "lastInvalidatedType",
891 PerfData::U_None,
892 (jlong)CompileBroker::no_compile,
893 CHECK);
894 }
895
896 log_info(aot, codecache, init)("CompileBroker is initialized");
897 _initialized = true;
898 }
899
900 Handle CompileBroker::create_thread_oop(const char* name, TRAPS) {
901 Handle thread_oop = JavaThread::create_system_thread_object(name, CHECK_NH);
902 return thread_oop;
903 }
904
905 void TrainingReplayThread::training_replay_thread_entry(JavaThread* thread, TRAPS) {
906 CompilationPolicy::replay_training_at_init_loop(thread);
907 }
908
909 #if defined(ASSERT) && COMPILER2_OR_JVMCI
910 // Entry for DeoptimizeObjectsALotThread. The threads are started in
911 // CompileBroker::init_compiler_threads() iff DeoptimizeObjectsALot is enabled
912 void DeoptimizeObjectsALotThread::deopt_objs_alot_thread_entry(JavaThread* thread, TRAPS) {
913 DeoptimizeObjectsALotThread* dt = ((DeoptimizeObjectsALotThread*) thread);
914 bool enter_single_loop;
915 {
916 MonitorLocker ml(dt, EscapeBarrier_lock, Mutex::_no_safepoint_check_flag);
917 static int single_thread_count = 0;
918 enter_single_loop = single_thread_count++ < DeoptimizeObjectsALotThreadCountSingle;
919 }
920 if (enter_single_loop) {
921 dt->deoptimize_objects_alot_loop_single();
922 } else {
923 dt->deoptimize_objects_alot_loop_all();
924 }
925 }
926
927 // Execute EscapeBarriers in an endless loop to revert optimizations based on escape analysis. Each
928 // barrier targets a single thread which is selected round robin.
929 void DeoptimizeObjectsALotThread::deoptimize_objects_alot_loop_single() {
930 HandleMark hm(this);
931 while (true) {
932 for (JavaThreadIteratorWithHandle jtiwh; JavaThread *deoptee_thread = jtiwh.next(); ) {
933 { // Begin new scope for escape barrier
934 HandleMarkCleaner hmc(this);
935 ResourceMark rm(this);
936 EscapeBarrier eb(true, this, deoptee_thread);
937 eb.deoptimize_objects(100);
938 }
939 // Now sleep after the escape barriers destructor resumed deoptee_thread.
940 sleep(DeoptimizeObjectsALotInterval);
941 }
942 }
943 }
944
945 // Execute EscapeBarriers in an endless loop to revert optimizations based on escape analysis. Each
946 // barrier targets all java threads in the vm at once.
947 void DeoptimizeObjectsALotThread::deoptimize_objects_alot_loop_all() {
948 HandleMark hm(this);
949 while (true) {
950 { // Begin new scope for escape barrier
951 HandleMarkCleaner hmc(this);
952 ResourceMark rm(this);
953 EscapeBarrier eb(true, this);
954 eb.deoptimize_objects_all_threads();
955 }
956 // Now sleep after the escape barriers destructor resumed the java threads.
957 sleep(DeoptimizeObjectsALotInterval);
958 }
959 }
960 #endif // defined(ASSERT) && COMPILER2_OR_JVMCI
961
962
963 JavaThread* CompileBroker::make_thread(ThreadType type, jobject thread_handle, CompileQueue* queue, AbstractCompiler* comp, JavaThread* THREAD) {
964 Handle thread_oop(THREAD, JNIHandles::resolve_non_null(thread_handle));
965
966 if (java_lang_Thread::thread(thread_oop()) != nullptr) {
967 assert(type == compiler_t, "should only happen with reused compiler threads");
968 // The compiler thread hasn't actually exited yet so don't try to reuse it
969 return nullptr;
970 }
971
972 JavaThread* new_thread = nullptr;
973 switch (type) {
974 case compiler_t:
975 assert(comp != nullptr, "Compiler instance missing.");
976 if (!InjectCompilerCreationFailure || comp->num_compiler_threads() == 0) {
977 CompilerCounters* counters = new CompilerCounters();
978 new_thread = new CompilerThread(queue, counters);
979 }
980 break;
981 #if defined(ASSERT) && COMPILER2_OR_JVMCI
982 case deoptimizer_t:
983 new_thread = new DeoptimizeObjectsALotThread();
984 break;
985 #endif // ASSERT
986 case training_replay_t:
987 new_thread = new TrainingReplayThread();
988 break;
989 default:
990 ShouldNotReachHere();
991 }
992
993 // At this point the new CompilerThread data-races with this startup
994 // thread (which is the main thread and NOT the VM thread).
995 // This means Java bytecodes being executed at startup can
996 // queue compile jobs which will run at whatever default priority the
997 // newly created CompilerThread runs at.
998
999
1000 // At this point it may be possible that no osthread was created for the
1001 // JavaThread due to lack of resources. We will handle that failure below.
1002 // Also check new_thread so that static analysis is happy.
1003 if (new_thread != nullptr && new_thread->osthread() != nullptr) {
1004
1005 if (type == compiler_t) {
1006 CompilerThread::cast(new_thread)->set_compiler(comp);
1007 }
1008
1009 // Note that we cannot call os::set_priority because it expects Java
1010 // priorities and we are *explicitly* using OS priorities so that it's
1011 // possible to set the compiler thread priority higher than any Java
1012 // thread.
1013
1014 int native_prio = CompilerThreadPriority;
1015 if (native_prio == -1) {
1016 if (UseCriticalCompilerThreadPriority) {
1017 native_prio = os::java_to_os_priority[CriticalPriority];
1018 } else {
1019 native_prio = os::java_to_os_priority[NearMaxPriority];
1020 }
1021 }
1022 os::set_native_priority(new_thread, native_prio);
1023
1024 // Note that this only sets the JavaThread _priority field, which by
1025 // definition is limited to Java priorities and not OS priorities.
1026 JavaThread::start_internal_daemon(THREAD, new_thread, thread_oop, NearMaxPriority);
1027
1028 } else { // osthread initialization failure
1029 if (UseDynamicNumberOfCompilerThreads && type == compiler_t
1030 && comp->num_compiler_threads() > 0) {
1031 // The new thread is not known to Thread-SMR yet so we can just delete.
1032 delete new_thread;
1033 return nullptr;
1034 } else {
1035 vm_exit_during_initialization("java.lang.OutOfMemoryError",
1036 os::native_thread_creation_failed_msg());
1037 }
1038 }
1039
1040 os::naked_yield(); // make sure that the compiler thread is started early (especially helpful on SOLARIS)
1041
1042 return new_thread;
1043 }
1044
1045 static bool trace_compiler_threads() {
1046 LogTarget(Debug, jit, thread) lt;
1047 return TraceCompilerThreads || lt.is_enabled();
1048 }
1049
1050 static jobject create_compiler_thread(AbstractCompiler* compiler, int i, TRAPS) {
1051 char name_buffer[256];
1052 os::snprintf_checked(name_buffer, sizeof(name_buffer), "%s CompilerThread%d", compiler->name(), i);
1053 Handle thread_oop = JavaThread::create_system_thread_object(name_buffer, CHECK_NULL);
1054 return JNIHandles::make_global(thread_oop);
1055 }
1056
1057 static void print_compiler_threads(stringStream& msg) {
1058 if (TraceCompilerThreads) {
1059 tty->print_cr("%7d %s", (int)tty->time_stamp().milliseconds(), msg.as_string());
1060 }
1061 LogTarget(Debug, jit, thread) lt;
1062 if (lt.is_enabled()) {
1063 LogStream ls(lt);
1064 ls.print_cr("%s", msg.as_string());
1065 }
1066 }
1067
1068 static void print_compiler_thread(JavaThread *ct) {
1069 if (trace_compiler_threads()) {
1070 ResourceMark rm;
1071 ThreadsListHandle tlh; // name() depends on the TLH.
1072 assert(tlh.includes(ct), "ct=" INTPTR_FORMAT " exited unexpectedly.", p2i(ct));
1073 stringStream msg;
1074 msg.print("Added initial compiler thread %s", ct->name());
1075 print_compiler_threads(msg);
1076 }
1077 }
1078
1079 void CompileBroker::init_compiler_threads() {
1080 // Ensure any exceptions lead to vm_exit_during_initialization.
1081 EXCEPTION_MARK;
1082 #if !defined(ZERO)
1083 assert(_c2_count > 0 || _c1_count > 0, "No compilers?");
1084 #endif // !ZERO
1085 // Initialize the compilation queue
1086 if (_c2_count > 0) {
1087 const char* name = JVMCI_ONLY(UseJVMCICompiler ? "JVMCI compile queue" :) "C2 compile queue";
1088 _c2_compile_queue = new CompileQueue(name, MethodCompileQueueC2_lock);
1089 _compiler2_objects = NEW_C_HEAP_ARRAY(jobject, _c2_count, mtCompiler);
1090 _compiler2_logs = NEW_C_HEAP_ARRAY(CompileLog*, _c2_count, mtCompiler);
1091 }
1092 if (_c1_count > 0) {
1093 _c1_compile_queue = new CompileQueue("C1 compile queue", MethodCompileQueueC1_lock);
1094 _compiler1_objects = NEW_C_HEAP_ARRAY(jobject, _c1_count, mtCompiler);
1095 _compiler1_logs = NEW_C_HEAP_ARRAY(CompileLog*, _c1_count, mtCompiler);
1096 }
1097
1098 if (_ac_count > 0) {
1099 if (_c1_count > 0) { // C1 is present
1100 _ac1_compile_queue = new CompileQueue("C1 AOT code compile queue", MethodCompileQueueAC1_lock);
1101 }
1102 if (_c2_count > 0) { // C2 is present
1103 _ac2_compile_queue = new CompileQueue("C2 AOT code compile queue", MethodCompileQueueAC2_lock);
1104 }
1105 _ac_objects = NEW_C_HEAP_ARRAY(jobject, _ac_count, mtCompiler);
1106 _ac_logs = NEW_C_HEAP_ARRAY(CompileLog*, _ac_count, mtCompiler);
1107 }
1108 char name_buffer[256];
1109
1110 for (int i = 0; i < _c2_count; i++) {
1111 // Create a name for our thread.
1112 jobject thread_handle = create_compiler_thread(_compilers[1], i, CHECK);
1113 _compiler2_objects[i] = thread_handle;
1114 _compiler2_logs[i] = nullptr;
1115
1116 if (!UseDynamicNumberOfCompilerThreads || i == 0) {
1117 JavaThread *ct = make_thread(compiler_t, thread_handle, _c2_compile_queue, _compilers[1], THREAD);
1118 assert(ct != nullptr, "should have been handled for initial thread");
1119 _compilers[1]->set_num_compiler_threads(i + 1);
1120 print_compiler_thread(ct);
1121 }
1122 }
1123
1124 for (int i = 0; i < _c1_count; i++) {
1125 // Create a name for our thread.
1126 jobject thread_handle = create_compiler_thread(_compilers[0], i, CHECK);
1127 _compiler1_objects[i] = thread_handle;
1128 _compiler1_logs[i] = nullptr;
1129
1130 if (!UseDynamicNumberOfCompilerThreads || i == 0) {
1131 JavaThread *ct = make_thread(compiler_t, thread_handle, _c1_compile_queue, _compilers[0], THREAD);
1132 assert(ct != nullptr, "should have been handled for initial thread");
1133 _compilers[0]->set_num_compiler_threads(i + 1);
1134 print_compiler_thread(ct);
1135 }
1136 }
1137
1138 if (_ac_count > 0) {
1139 int i = 0;
1140 if (_c1_count > 0) { // C1 is present
1141 os::snprintf_checked(name_buffer, sizeof(name_buffer), "C%d AOT code caching CompilerThread", 1);
1142 Handle thread_oop = create_thread_oop(name_buffer, CHECK);
1143 jobject thread_handle = JNIHandles::make_global(thread_oop);
1144 _ac_objects[i] = thread_handle;
1145 _ac_logs[i] = nullptr;
1146 i++;
1147
1148 JavaThread *ct = make_thread(compiler_t, thread_handle, _ac1_compile_queue, _compilers[0], THREAD);
1149 assert(ct != nullptr, "should have been handled for initial thread");
1150 print_compiler_thread(ct);
1151 }
1152 if (_c2_count > 0) { // C2 is present
1153 os::snprintf_checked(name_buffer, sizeof(name_buffer), "C%d AOT code caching CompilerThread", 2);
1154 Handle thread_oop = create_thread_oop(name_buffer, CHECK);
1155 jobject thread_handle = JNIHandles::make_global(thread_oop);
1156 _ac_objects[i] = thread_handle;
1157 _ac_logs[i] = nullptr;
1158
1159 JavaThread *ct = make_thread(compiler_t, thread_handle, _ac2_compile_queue, _compilers[1], THREAD);
1160 assert(ct != nullptr, "should have been handled for initial thread");
1161 print_compiler_thread(ct);
1162 }
1163 }
1164
1165 if (UsePerfData) {
1166 PerfDataManager::create_constant(SUN_CI, "threads", PerfData::U_Bytes, _c1_count + _c2_count, CHECK);
1167 }
1168
1169 #if defined(ASSERT) && COMPILER2_OR_JVMCI
1170 if (DeoptimizeObjectsALot) {
1171 // Initialize and start the object deoptimizer threads
1172 const int total_count = DeoptimizeObjectsALotThreadCountSingle + DeoptimizeObjectsALotThreadCountAll;
1173 for (int count = 0; count < total_count; count++) {
1174 Handle thread_oop = JavaThread::create_system_thread_object("Deoptimize objects a lot single mode", CHECK);
1175 jobject thread_handle = JNIHandles::make_local(THREAD, thread_oop());
1176 make_thread(deoptimizer_t, thread_handle, nullptr, nullptr, THREAD);
1177 }
1178 }
1179 #endif // defined(ASSERT) && COMPILER2_OR_JVMCI
1180 }
1181
1182 void CompileBroker::init_training_replay() {
1183 // Ensure any exceptions lead to vm_exit_during_initialization.
1184 EXCEPTION_MARK;
1185 if (TrainingData::have_data() && CDSConfig::is_using_aot_linked_classes()) {
1186 Handle thread_oop = create_thread_oop("Training replay thread", CHECK);
1187 jobject thread_handle = JNIHandles::make_local(THREAD, thread_oop());
1188 make_thread(training_replay_t, thread_handle, nullptr, nullptr, THREAD);
1189 }
1190 }
1191
1192 void CompileBroker::possibly_add_compiler_threads(JavaThread* THREAD) {
1193
1194 int old_c2_count = 0, new_c2_count = 0, old_c1_count = 0, new_c1_count = 0;
1195 const int c2_tasks_per_thread = 2, c1_tasks_per_thread = 4;
1196
1197 // Quick check if we already have enough compiler threads without taking the lock.
1198 // Numbers may change concurrently, so we read them again after we have the lock.
1199 if (_c2_compile_queue != nullptr) {
1200 old_c2_count = get_c2_thread_count();
1201 new_c2_count = MIN2(_c2_count, _c2_compile_queue->size() / c2_tasks_per_thread);
1202 }
1203 if (_c1_compile_queue != nullptr) {
1204 old_c1_count = get_c1_thread_count();
1205 new_c1_count = MIN2(_c1_count, _c1_compile_queue->size() / c1_tasks_per_thread);
1206 }
1207 if (new_c2_count <= old_c2_count && new_c1_count <= old_c1_count) return;
1208
1209 // Now, we do the more expensive operations.
1210 physical_memory_size_type free_memory = 0;
1211 // Return value ignored - defaulting to 0 on failure.
1212 (void)os::free_memory(free_memory);
1213 // If SegmentedCodeCache is off, both values refer to the single heap (with type CodeBlobType::All).
1214 size_t available_cc_np = CodeCache::unallocated_capacity(CodeBlobType::MethodNonProfiled),
1215 available_cc_p = CodeCache::unallocated_capacity(CodeBlobType::MethodProfiled);
1216
1217 // Only attempt to start additional threads if the lock is free.
1218 if (!CompileThread_lock->try_lock()) return;
1219
1220 if (_c2_compile_queue != nullptr) {
1221 old_c2_count = get_c2_thread_count();
1222 new_c2_count = MIN4(_c2_count,
1223 _c2_compile_queue->size() / c2_tasks_per_thread,
1224 (int)(free_memory / (200*M)),
1225 (int)(available_cc_np / (128*K)));
1226
1227 for (int i = old_c2_count; i < new_c2_count; i++) {
1228 #if INCLUDE_JVMCI
1229 if (UseJVMCICompiler && !UseJVMCINativeLibrary && _compiler2_objects[i] == nullptr) {
1230 // Native compiler threads as used in C1/C2 can reuse the j.l.Thread objects as their
1231 // existence is completely hidden from the rest of the VM (and those compiler threads can't
1232 // call Java code to do the creation anyway).
1233 //
1234 // For pure Java JVMCI we have to create new j.l.Thread objects as they are visible and we
1235 // can see unexpected thread lifecycle transitions if we bind them to new JavaThreads. For
1236 // native library JVMCI it's preferred to use the C1/C2 strategy as this avoids unnecessary
1237 // coupling with Java.
1238 if (!THREAD->can_call_java()) break;
1239 char name_buffer[256];
1240 os::snprintf_checked(name_buffer, sizeof(name_buffer), "%s CompilerThread%d", _compilers[1]->name(), i);
1241 Handle thread_oop;
1242 {
1243 // We have to give up the lock temporarily for the Java calls.
1244 MutexUnlocker mu(CompileThread_lock);
1245 thread_oop = JavaThread::create_system_thread_object(name_buffer, THREAD);
1246 }
1247 if (HAS_PENDING_EXCEPTION) {
1248 if (trace_compiler_threads()) {
1249 ResourceMark rm;
1250 stringStream msg;
1251 msg.print_cr("JVMCI compiler thread creation failed:");
1252 PENDING_EXCEPTION->print_on(&msg);
1253 print_compiler_threads(msg);
1254 }
1255 CLEAR_PENDING_EXCEPTION;
1256 break;
1257 }
1258 // Check if another thread has beaten us during the Java calls.
1259 if (get_c2_thread_count() != i) break;
1260 jobject thread_handle = JNIHandles::make_global(thread_oop);
1261 assert(compiler2_object(i) == nullptr, "Old one must be released!");
1262 _compiler2_objects[i] = thread_handle;
1263 }
1264 #endif
1265 guarantee(compiler2_object(i) != nullptr, "Thread oop must exist");
1266 JavaThread *ct = make_thread(compiler_t, compiler2_object(i), _c2_compile_queue, _compilers[1], THREAD);
1267 if (ct == nullptr) break;
1268 _compilers[1]->set_num_compiler_threads(i + 1);
1269 if (trace_compiler_threads()) {
1270 ResourceMark rm;
1271 ThreadsListHandle tlh; // name() depends on the TLH.
1272 assert(tlh.includes(ct), "ct=" INTPTR_FORMAT " exited unexpectedly.", p2i(ct));
1273 stringStream msg;
1274 msg.print("Added compiler thread %s (free memory: %dMB, available non-profiled code cache: %dMB)",
1275 ct->name(), (int)(free_memory/M), (int)(available_cc_np/M));
1276 print_compiler_threads(msg);
1277 }
1278 }
1279 }
1280
1281 if (_c1_compile_queue != nullptr) {
1282 old_c1_count = get_c1_thread_count();
1283 new_c1_count = MIN4(_c1_count,
1284 _c1_compile_queue->size() / c1_tasks_per_thread,
1285 (int)(free_memory / (100*M)),
1286 (int)(available_cc_p / (128*K)));
1287
1288 for (int i = old_c1_count; i < new_c1_count; i++) {
1289 JavaThread *ct = make_thread(compiler_t, compiler1_object(i), _c1_compile_queue, _compilers[0], THREAD);
1290 if (ct == nullptr) break;
1291 _compilers[0]->set_num_compiler_threads(i + 1);
1292 if (trace_compiler_threads()) {
1293 ResourceMark rm;
1294 ThreadsListHandle tlh; // name() depends on the TLH.
1295 assert(tlh.includes(ct), "ct=" INTPTR_FORMAT " exited unexpectedly.", p2i(ct));
1296 stringStream msg;
1297 msg.print("Added compiler thread %s (free memory: %dMB, available profiled code cache: %dMB)",
1298 ct->name(), (int)(free_memory/M), (int)(available_cc_p/M));
1299 print_compiler_threads(msg);
1300 }
1301 }
1302 }
1303
1304 CompileThread_lock->unlock();
1305 }
1306
1307
1308 /**
1309 * Set the methods on the stack as on_stack so that redefine classes doesn't
1310 * reclaim them. This method is executed at a safepoint.
1311 */
1312 void CompileBroker::mark_on_stack() {
1313 assert(SafepointSynchronize::is_at_safepoint(), "sanity check");
1314 // Since we are at a safepoint, we do not need a lock to access
1315 // the compile queues.
1316 if (_c2_compile_queue != nullptr) {
1317 _c2_compile_queue->mark_on_stack();
1318 }
1319 if (_c1_compile_queue != nullptr) {
1320 _c1_compile_queue->mark_on_stack();
1321 }
1322 if (_ac1_compile_queue != nullptr) {
1323 _ac1_compile_queue->mark_on_stack();
1324 }
1325 if (_ac2_compile_queue != nullptr) {
1326 _ac2_compile_queue->mark_on_stack();
1327 }
1328 }
1329
1330 // ------------------------------------------------------------------
1331 // CompileBroker::compile_method
1332 //
1333 // Request compilation of a method.
1334 void CompileBroker::compile_method_base(const methodHandle& method,
1335 AOTCodeEntry* aot_code_entry,
1336 int osr_bci,
1337 int comp_level,
1338 int hot_count,
1339 CompileTask::CompileReason compile_reason,
1340 bool requires_online_compilation,
1341 bool blocking,
1342 Thread* thread) {
1343 guarantee(!method->is_abstract(), "cannot compile abstract methods");
1344 assert(method->method_holder()->is_instance_klass(),
1345 "sanity check");
1346 assert(!method->method_holder()->is_not_initialized() ||
1347 compile_reason == CompileTask::Reason_Preload ||
1348 CompileTask::reason_is_aot_compile(compile_reason), "method holder must be initialized");
1349 assert(!method->is_method_handle_intrinsic(), "do not enqueue these guys");
1350
1351 if (CIPrintRequests) {
1352 tty->print("request: ");
1353 method->print_short_name(tty);
1354 if (osr_bci != InvocationEntryBci) {
1355 tty->print(" osr_bci: %d", osr_bci);
1356 }
1357 tty->print(" level: %d comment: %s count: %d", comp_level, CompileTask::reason_name(compile_reason), hot_count);
1358 if (hot_count > 0) {
1359 tty->print(" hot: yes");
1360 }
1361 tty->cr();
1362 }
1363 LogStreamHandle(Debug, aot, codecache, compilation) log;
1364 if (log.is_enabled()) {
1365 ResourceMark rm;
1366 MethodTrainingData* mtd = MethodTrainingData::have_data() ? MethodTrainingData::find_fast(method) : nullptr;
1367 MethodCounters* mc = method->method_counters();
1368 const char* name = method->name_and_sig_as_C_string();
1369 const char* aotn = (compile_reason == CompileTask::Reason_Preload) ? "AP" :
1370 (!requires_online_compilation ? " A" : " ");
1371 const char* osrn = (osr_bci != InvocationEntryBci) ? "% " : "";
1372 log.print("request: %s%d %16s %s%s", aotn, comp_level, CompileTask::reason_name(compile_reason), osrn, name);
1373 if (mtd != nullptr) {
1374 log.print(" (MTD invoke: %d, backedge: %d)", mtd->invocation_count(), mtd->backedge_count());
1375 }
1376 if (mc != nullptr) {
1377 log.print(" (MC invoke: %d, backedge: %d)", mc->invocation_counter()->count(),
1378 mc->backedge_counter()->count());
1379 #if INCLUDE_CDS
1380 log.print(" (MC aot_cnt: %d, aot_recomp: %s)", mc->aot_code_invocation_count(),
1381 (mc->aot_code_recompile_requested() ? "yes" : "no"));
1382 #endif
1383 }
1384 log.cr();
1385 }
1386 // A request has been made for compilation. Before we do any
1387 // real work, check to see if the method has been compiled
1388 // in the meantime with a definitive result.
1389 if (compilation_is_complete(method(), osr_bci, comp_level, requires_online_compilation, compile_reason)) {
1390 return;
1391 }
1392
1393 #ifndef PRODUCT
1394 if (osr_bci != -1 && !FLAG_IS_DEFAULT(OSROnlyBCI)) {
1395 if ((OSROnlyBCI > 0) ? (OSROnlyBCI != osr_bci) : (-OSROnlyBCI == osr_bci)) {
1396 // Positive OSROnlyBCI means only compile that bci. Negative means don't compile that BCI.
1397 return;
1398 }
1399 }
1400 #endif
1401
1402 // If this method is already in the compile queue, then
1403 // we do not block the current thread.
1404 if (compilation_is_in_queue(method)) {
1405 // We may want to decay our counter a bit here to prevent
1406 // multiple denied requests for compilation. This is an
1407 // open compilation policy issue. Note: The other possibility,
1408 // in the case that this is a blocking compile request, is to have
1409 // all subsequent blocking requesters wait for completion of
1410 // ongoing compiles. Note that in this case we'll need a protocol
1411 // for freeing the associated compile tasks. [Or we could have
1412 // a single static monitor on which all these waiters sleep.]
1413 return;
1414 }
1415
1416 // Tiered policy requires MethodCounters to exist before adding a method to
1417 // the queue. Create if we don't have them yet.
1418 method->get_method_counters(thread);
1419
1420 precond(compile_reason != CompileTask::Reason_Preload || aot_code_entry != nullptr);
1421 if (!requires_online_compilation && aot_code_entry == nullptr) {
1422 aot_code_entry = find_aot_code_entry(method, osr_bci, comp_level, compile_reason);
1423 }
1424 bool is_aot = (aot_code_entry != nullptr);
1425 requires_online_compilation = !is_aot; // Request JIT compilation
1426
1427 // Outputs from the following MutexLocker block:
1428 CompileTask* task = nullptr;
1429 CompileQueue* queue = compile_queue(comp_level, is_aot);
1430
1431 // Acquire our lock.
1432 {
1433 ConditionalMutexLocker locker(thread, queue->lock(), !UseLockFreeCompileQueues);
1434
1435 // Make sure the method has not slipped into the queues since
1436 // last we checked; note that those checks were "fast bail-outs".
1437 // Here we need to be more careful, see 14012000 below.
1438 if (compilation_is_in_queue(method)) {
1439 return;
1440 }
1441
1442 // We need to check again to see if the compilation has
1443 // completed. A previous compilation may have registered
1444 // some result.
1445 if (compilation_is_complete(method(), osr_bci, comp_level, requires_online_compilation, compile_reason)) {
1446 return;
1447 }
1448
1449 // We now know that this compilation is not pending, complete,
1450 // or prohibited. Assign a compile_id to this compilation
1451 // and check to see if it is in our [Start..Stop) range.
1452 int compile_id = assign_compile_id(method, osr_bci);
1453 if (compile_id == 0) {
1454 // The compilation falls outside the allowed range.
1455 return;
1456 }
1457
1458 #if INCLUDE_JVMCI
1459 if (UseJVMCICompiler && blocking) {
1460 // Don't allow blocking compiles for requests triggered by JVMCI.
1461 if (thread->is_Compiler_thread()) {
1462 blocking = false;
1463 }
1464
1465 // In libjvmci, JVMCI initialization should not deadlock with other threads
1466 if (!UseJVMCINativeLibrary) {
1467 // Don't allow blocking compiles if inside a class initializer or while performing class loading
1468 vframeStream vfst(JavaThread::cast(thread));
1469 for (; !vfst.at_end(); vfst.next()) {
1470 if (vfst.method()->is_static_initializer() ||
1471 (vfst.method()->method_holder()->is_subclass_of(vmClasses::ClassLoader_klass()) &&
1472 vfst.method()->name() == vmSymbols::loadClass_name())) {
1473 blocking = false;
1474 break;
1475 }
1476 }
1477
1478 // Don't allow blocking compilation requests to JVMCI
1479 // if JVMCI itself is not yet initialized
1480 if (!JVMCI::is_compiler_initialized() && compiler(comp_level)->is_jvmci()) {
1481 blocking = false;
1482 }
1483 }
1484
1485 // Don't allow blocking compilation requests if we are in JVMCIRuntime::shutdown
1486 // to avoid deadlock between compiler thread(s) and threads run at shutdown
1487 // such as the DestroyJavaVM thread.
1488 if (JVMCI::in_shutdown()) {
1489 blocking = false;
1490 }
1491 }
1492 #endif // INCLUDE_JVMCI
1493
1494 // We will enter the compilation in the queue.
1495 // 14012000: Note that this sets the queued_for_compile bits in
1496 // the target method. We can now reason that a method cannot be
1497 // queued for compilation more than once, as follows:
1498 // Before a thread queues a task for compilation, it first acquires
1499 // the compile queue lock, then checks if the method's queued bits
1500 // are set or it has already been compiled. Thus there can not be two
1501 // instances of a compilation task for the same method on the
1502 // compilation queue. Consider now the case where the compilation
1503 // thread has already removed a task for that method from the queue
1504 // and is in the midst of compiling it. In this case, the
1505 // queued_for_compile bits must be set in the method (and these
1506 // will be visible to the current thread, since the bits were set
1507 // under protection of the compile queue lock, which we hold now.
1508 // When the compilation completes, the compiler thread first sets
1509 // the compilation result and then clears the queued_for_compile
1510 // bits. Neither of these actions are protected by a barrier (or done
1511 // under the protection of a lock), so the only guarantee we have
1512 // (on machines with TSO (Total Store Order)) is that these values
1513 // will update in that order. As a result, the only combinations of
1514 // these bits that the current thread will see are, in temporal order:
1515 // <RESULT, QUEUE> :
1516 // <0, 1> : in compile queue, but not yet compiled
1517 // <1, 1> : compiled but queue bit not cleared
1518 // <1, 0> : compiled and queue bit cleared
1519 // Because we first check the queue bits then check the result bits,
1520 // we are assured that we cannot introduce a duplicate task.
1521 // Note that if we did the tests in the reverse order (i.e. check
1522 // result then check queued bit), we could get the result bit before
1523 // the compilation completed, and the queue bit after the compilation
1524 // completed, and end up introducing a "duplicate" (redundant) task.
1525 // In that case, the compiler thread should first check if a method
1526 // has already been compiled before trying to compile it.
1527 // NOTE: in the event that there are multiple compiler threads and
1528 // there is de-optimization/recompilation, things will get hairy,
1529 // and in that case it's best to protect both the testing (here) of
1530 // these bits, and their updating (here and elsewhere) under a
1531 // common lock.
1532 task = create_compile_task(queue,
1533 compile_id, method,
1534 osr_bci, comp_level,
1535 hot_count, aot_code_entry, compile_reason,
1536 requires_online_compilation, blocking);
1537
1538 if (UseLockFreeCompileQueues) {
1539 assert(queue->lock()->owned_by_self() == false, "");
1540 queue->add_pending(task);
1541 } else {
1542 queue->add(task);
1543 }
1544 }
1545
1546 if (blocking) {
1547 wait_for_completion(task);
1548 }
1549 }
1550
1551 AOTCodeEntry* CompileBroker::find_aot_code_entry(const methodHandle& method, int osr_bci, int comp_level,
1552 CompileTask::CompileReason compile_reason) {
1553 if (compile_reason == CompileTask::Reason_Whitebox) {
1554 return nullptr; // Need normal JIT compilation
1555 }
1556 AOTCodeEntry* aot_code_entry = nullptr;
1557 if (osr_bci == InvocationEntryBci && AOTCodeCache::is_using_code()) {
1558 // Check for AOT preload code first.
1559 precond(compile_reason != CompileTask::Reason_Preload); // should call it for AOT code preload.
1560 aot_code_entry = AOTCodeCache::find_code_entry(method, comp_level);
1561 }
1562 return aot_code_entry;
1563 }
1564
1565 void CompileBroker::preload_aot_method(const methodHandle& method, AOTCodeEntry* aot_code_entry, TRAPS) {
1566 // Don't need most of the checks for AOT code preloading.
1567 precond(_initialized);
1568 precond(aot_code_entry != nullptr && aot_code_entry->for_preload());
1569 // If the compiler is shut off due to code cache getting full
1570 // fail out now so blocking compiles dont hang the java thread
1571 if (should_compile_new_jobs()) {
1572 int osr_bci = InvocationEntryBci;
1573 int comp_level = CompLevel_full_optimization;
1574 int hot_count = 0;
1575 CompileTask::CompileReason compile_reason = CompileTask::Reason_Preload;
1576 bool requires_online_compilation = false;
1577
1578 AbstractCompiler *comp = CompileBroker::compiler(comp_level);
1579 assert(comp != nullptr, "Ensure we have a compiler");
1580
1581 nmethod* method_code = method->code();
1582 if (method_code != nullptr) {
1583 if (compilation_is_complete(method(), osr_bci, comp_level, requires_online_compilation, compile_reason)) {
1584 return;
1585 }
1586 }
1587 if (method->is_not_compilable(comp_level)) {
1588 return;
1589 }
1590
1591 // JVMTI -- post_compile_event requires jmethod_id() that may require
1592 // a lock the compiling thread can not acquire. Prefetch it here.
1593 if (JvmtiExport::should_post_compiled_method_load()) {
1594 method->jmethod_id();
1595 }
1596
1597 DirectiveSet* directive = DirectivesStack::getMatchingDirective(method, comp);
1598 bool is_blocking = ReplayCompiles ||
1599 !directive->BackgroundCompilationOption ||
1600 (PreloadBlocking && (compile_reason == CompileTask::Reason_Preload));
1601 // CompileBroker::compile_method can trap and can have pending async exception.
1602 compile_method_base(method, aot_code_entry, osr_bci, comp_level, hot_count, compile_reason,
1603 requires_online_compilation, is_blocking, THREAD);
1604 DirectivesStack::release(directive);
1605 }
1606 }
1607
1608 nmethod* CompileBroker::compile_method(const methodHandle& method, int osr_bci,
1609 int comp_level,
1610 int hot_count,
1611 bool requires_online_compilation,
1612 CompileTask::CompileReason compile_reason,
1613 TRAPS) {
1614 // Do nothing if compilebroker is not initialized or compiles are submitted on level none
1615 if (!_initialized || comp_level == CompLevel_none) {
1616 return nullptr;
1617 }
1618
1619 AbstractCompiler *comp = CompileBroker::compiler(comp_level);
1620 assert(comp != nullptr, "Ensure we have a compiler");
1621
1622 #if INCLUDE_JVMCI
1623 if (comp->is_jvmci() && !JVMCI::can_initialize_JVMCI()) {
1624 // JVMCI compilation is not yet initializable.
1625 return nullptr;
1626 }
1627 #endif
1628
1629 DirectiveSet* directive = DirectivesStack::getMatchingDirective(method, comp);
1630 // CompileBroker::compile_method can trap and can have pending async exception.
1631 nmethod* nm = CompileBroker::compile_method(method, osr_bci, comp_level, hot_count, requires_online_compilation, compile_reason, directive, THREAD);
1632 DirectivesStack::release(directive);
1633 return nm;
1634 }
1635
1636 nmethod* CompileBroker::compile_method(const methodHandle& method, int osr_bci,
1637 int comp_level,
1638 int hot_count,
1639 bool requires_online_compilation,
1640 CompileTask::CompileReason compile_reason,
1641 DirectiveSet* directive,
1642 TRAPS) {
1643
1644 // make sure arguments make sense
1645 assert(method->method_holder()->is_instance_klass(), "not an instance method");
1646 assert(osr_bci == InvocationEntryBci || (0 <= osr_bci && osr_bci < method->code_size()), "bci out of range");
1647 assert(!method->is_abstract() && (osr_bci == InvocationEntryBci || !method->is_native()), "cannot compile abstract/native methods");
1648 assert(!method->method_holder()->is_not_initialized() ||
1649 compile_reason == CompileTask::Reason_Preload ||
1650 CompileTask::reason_is_aot_compile(compile_reason), "method holder must be initialized");
1651 // return quickly if possible
1652 bool aot_compilation = (PrecompileCode && PrecompileOnlyAndExit) ||
1653 CDSConfig::is_dumping_aot_code();
1654 if (aot_compilation && !CompileTask::reason_is_aot_compile(compile_reason)) {
1655 // Skip normal compilations when compiling AOT code
1656 return nullptr;
1657 }
1658
1659 // lock, make sure that the compilation
1660 // isn't prohibited in a straightforward way.
1661 AbstractCompiler* comp = CompileBroker::compiler(comp_level);
1662 if (comp == nullptr || compilation_is_prohibited(method, osr_bci, comp_level, directive->ExcludeOption)) {
1663 return nullptr;
1664 }
1665
1666 if (osr_bci == InvocationEntryBci) {
1667 // standard compilation
1668 nmethod* method_code = method->code();
1669 if (method_code != nullptr) {
1670 if (compilation_is_complete(method(), osr_bci, comp_level, requires_online_compilation, compile_reason)) {
1671 return method_code;
1672 }
1673 }
1674 if (method->is_not_compilable(comp_level)) {
1675 return nullptr;
1676 }
1677 } else {
1678 // osr compilation
1679 // We accept a higher level osr method
1680 nmethod* nm = method->lookup_osr_nmethod_for(osr_bci, comp_level, false);
1681 if (nm != nullptr) return nm;
1682 if (method->is_not_osr_compilable(comp_level)) return nullptr;
1683 }
1684
1685 assert(!HAS_PENDING_EXCEPTION, "No exception should be present");
1686 // some prerequisites that are compiler specific
1687 if (compile_reason != CompileTask::Reason_Preload &&
1688 !CompileTask::reason_is_aot_compile(compile_reason) &&
1689 (comp->is_c2() || comp->is_jvmci())) {
1690 InternalOOMEMark iom(THREAD);
1691 method->constants()->resolve_string_constants(CHECK_AND_CLEAR_NONASYNC_NULL);
1692 // Resolve all classes seen in the signature of the method
1693 // we are compiling.
1694 Method::load_signature_classes(method, CHECK_AND_CLEAR_NONASYNC_NULL);
1695 }
1696
1697 // If the method is native, do the lookup in the thread requesting
1698 // the compilation. Native lookups can load code, which is not
1699 // permitted during compilation.
1700 //
1701 // Note: A native method implies non-osr compilation which is
1702 // checked with an assertion at the entry of this method.
1703 if (method->is_native() && !method->is_method_handle_intrinsic()) {
1704 address adr = NativeLookup::lookup(method, THREAD);
1705 if (HAS_PENDING_EXCEPTION) {
1706 // In case of an exception looking up the method, we just forget
1707 // about it. The interpreter will kick-in and throw the exception.
1708 method->set_not_compilable("NativeLookup::lookup failed"); // implies is_not_osr_compilable()
1709 CLEAR_PENDING_EXCEPTION;
1710 return nullptr;
1711 }
1712 assert(method->has_native_function(), "must have native code by now");
1713 }
1714
1715 // RedefineClasses() has replaced this method; just return
1716 if (method->is_old()) {
1717 return nullptr;
1718 }
1719
1720 // JVMTI -- post_compile_event requires jmethod_id() that may require
1721 // a lock the compiling thread can not acquire. Prefetch it here.
1722 if (JvmtiExport::should_post_compiled_method_load()) {
1723 method->jmethod_id();
1724 }
1725
1726 // do the compilation
1727 if (method->is_native()) {
1728 if (!PreferInterpreterNativeStubs || method->is_method_handle_intrinsic()) {
1729 // To properly handle the appendix argument for out-of-line calls we are using a small trampoline that
1730 // pops off the appendix argument and jumps to the target (see gen_special_dispatch in SharedRuntime).
1731 //
1732 // Since normal compiled-to-compiled calls are not able to handle such a thing we MUST generate an adapter
1733 // in this case. If we can't generate one and use it we can not execute the out-of-line method handle calls.
1734 AdapterHandlerLibrary::create_native_wrapper(method);
1735 } else {
1736 return nullptr;
1737 }
1738 } else {
1739 // If the compiler is shut off due to code cache getting full
1740 // fail out now so blocking compiles dont hang the java thread
1741 if (!should_compile_new_jobs()) {
1742 return nullptr;
1743 }
1744 bool is_blocking = ReplayCompiles ||
1745 !directive->BackgroundCompilationOption ||
1746 (PreloadBlocking && (compile_reason == CompileTask::Reason_Preload));
1747 compile_method_base(method, nullptr, osr_bci, comp_level, hot_count, compile_reason,
1748 requires_online_compilation, is_blocking, THREAD);
1749 }
1750
1751 // return requested nmethod
1752 // We accept a higher level osr method
1753 if (osr_bci == InvocationEntryBci) {
1754 return method->code();
1755 }
1756 return method->lookup_osr_nmethod_for(osr_bci, comp_level, false);
1757 }
1758
1759
1760 // ------------------------------------------------------------------
1761 // CompileBroker::compilation_is_complete
1762 //
1763 // See if compilation of this method is already complete.
1764 bool CompileBroker::compilation_is_complete(Method* method,
1765 int osr_bci,
1766 int comp_level,
1767 bool online_only,
1768 CompileTask::CompileReason compile_reason) {
1769 if (CompileTask::reason_is_aot_compile(compile_reason)) {
1770 return false; // FIXME: any restrictions?
1771 }
1772 bool is_osr = (osr_bci != standard_entry_bci);
1773 if (is_osr) {
1774 if (method->is_not_osr_compilable(comp_level)) {
1775 return true;
1776 } else {
1777 nmethod* result = method->lookup_osr_nmethod_for(osr_bci, comp_level, true);
1778 return (result != nullptr);
1779 }
1780 } else {
1781 if (method->is_not_compilable(comp_level)) {
1782 return true;
1783 } else {
1784 nmethod* result = method->code();
1785 if (result == nullptr) {
1786 return false;
1787 }
1788 if (online_only && result->is_aot()) {
1789 return false;
1790 }
1791 bool same_level = (comp_level == result->comp_level());
1792 if (result->preloaded()) {
1793 return !same_level; // Allow replace preloaded code with new code of the same level
1794 }
1795 return same_level;
1796 }
1797 }
1798 }
1799
1800
1801 /**
1802 * See if this compilation is already requested.
1803 *
1804 * Implementation note: there is only a single "is in queue" bit
1805 * for each method. This means that the check below is overly
1806 * conservative in the sense that an osr compilation in the queue
1807 * will block a normal compilation from entering the queue (and vice
1808 * versa). This can be remedied by a full queue search to disambiguate
1809 * cases. If it is deemed profitable, this may be done.
1810 */
1811 bool CompileBroker::compilation_is_in_queue(const methodHandle& method) {
1812 return method->queued_for_compilation();
1813 }
1814
1815 // ------------------------------------------------------------------
1816 // CompileBroker::compilation_is_prohibited
1817 //
1818 // See if this compilation is not allowed.
1819 bool CompileBroker::compilation_is_prohibited(const methodHandle& method, int osr_bci, int comp_level, bool excluded) {
1820 bool is_native = method->is_native();
1821 // Some compilers may not support the compilation of natives.
1822 AbstractCompiler *comp = compiler(comp_level);
1823 if (is_native && (!CICompileNatives || comp == nullptr)) {
1824 method->set_not_compilable_quietly("native methods not supported", comp_level);
1825 return true;
1826 }
1827
1828 bool is_osr = (osr_bci != standard_entry_bci);
1829 // Some compilers may not support on stack replacement.
1830 if (is_osr && (!CICompileOSR || comp == nullptr)) {
1831 method->set_not_osr_compilable("OSR not supported", comp_level);
1832 return true;
1833 }
1834
1835 // The method may be explicitly excluded by the user.
1836 double scale;
1837 if (excluded || (CompilerOracle::has_option_value(method, CompileCommandEnum::CompileThresholdScaling, scale) && scale == 0)) {
1838 bool quietly = CompilerOracle::be_quiet();
1839 if (PrintCompilation && !quietly) {
1840 // This does not happen quietly...
1841 ResourceMark rm;
1842 tty->print("### Excluding %s:%s",
1843 method->is_native() ? "generation of native wrapper" : "compile",
1844 (method->is_static() ? " static" : ""));
1845 method->print_short_name(tty);
1846 tty->cr();
1847 }
1848 method->set_not_compilable("excluded by CompileCommand", comp_level, !quietly);
1849 }
1850
1851 return false;
1852 }
1853
1854 /**
1855 * Generate serialized IDs for compilation requests. If certain debugging flags are used
1856 * and the ID is not within the specified range, the method is not compiled and 0 is returned.
1857 * The function also allows to generate separate compilation IDs for OSR compilations.
1858 */
1859 int CompileBroker::assign_compile_id(const methodHandle& method, int osr_bci) {
1860 #ifdef ASSERT
1861 bool is_osr = (osr_bci != standard_entry_bci);
1862 int id;
1863 if (method->is_native()) {
1864 assert(!is_osr, "can't be osr");
1865 // Adapters, native wrappers and method handle intrinsics
1866 // should be generated always.
1867 return AtomicAccess::add(CICountNative ? &_native_compilation_id : &_compilation_id, 1);
1868 } else if (CICountOSR && is_osr) {
1869 id = AtomicAccess::add(&_osr_compilation_id, 1);
1870 if (CIStartOSR <= id && id < CIStopOSR) {
1871 return id;
1872 }
1873 } else {
1874 id = AtomicAccess::add(&_compilation_id, 1);
1875 if (CIStart <= id && id < CIStop) {
1876 return id;
1877 }
1878 }
1879
1880 // Method was not in the appropriate compilation range.
1881 method->set_not_compilable_quietly("Not in requested compile id range");
1882 return 0;
1883 #else
1884 // CICountOSR is a develop flag and set to 'false' by default. In a product built,
1885 // only _compilation_id is incremented.
1886 return AtomicAccess::add(&_compilation_id, 1);
1887 #endif
1888 }
1889
1890 // ------------------------------------------------------------------
1891 // CompileBroker::assign_compile_id_unlocked
1892 //
1893 // Public wrapper for assign_compile_id that acquires the needed locks
1894 int CompileBroker::assign_compile_id_unlocked(Thread* thread, const methodHandle& method, int osr_bci) {
1895 MutexLocker locker(thread, MethodCompileQueue_lock);
1896 return assign_compile_id(method, osr_bci);
1897 }
1898
1899 // ------------------------------------------------------------------
1900 // CompileBroker::create_compile_task
1901 //
1902 // Create a CompileTask object representing the current request for
1903 // compilation. Add this task to the queue.
1904 CompileTask* CompileBroker::create_compile_task(CompileQueue* queue,
1905 int compile_id,
1906 const methodHandle& method,
1907 int osr_bci,
1908 int comp_level,
1909 int hot_count,
1910 AOTCodeEntry* aot_code_entry,
1911 CompileTask::CompileReason compile_reason,
1912 bool requires_online_compilation,
1913 bool blocking) {
1914 CompileTask* new_task = new CompileTask(compile_id, method, osr_bci, comp_level,
1915 hot_count, aot_code_entry, compile_reason, queue,
1916 requires_online_compilation, blocking);
1917 return new_task;
1918 }
1919
1920 #if INCLUDE_JVMCI
1921 // The number of milliseconds to wait before checking if
1922 // JVMCI compilation has made progress.
1923 static const long JVMCI_COMPILATION_PROGRESS_WAIT_TIMESLICE = 1000;
1924
1925 // The number of JVMCI compilation progress checks that must fail
1926 // before unblocking a thread waiting for a blocking compilation.
1927 static const int JVMCI_COMPILATION_PROGRESS_WAIT_ATTEMPTS = 10;
1928
1929 /**
1930 * Waits for a JVMCI compiler to complete a given task. This thread
1931 * waits until either the task completes or it sees no JVMCI compilation
1932 * progress for N consecutive milliseconds where N is
1933 * JVMCI_COMPILATION_PROGRESS_WAIT_TIMESLICE *
1934 * JVMCI_COMPILATION_PROGRESS_WAIT_ATTEMPTS.
1935 *
1936 * @return true if this thread needs to delete the task
1937 */
1938 bool CompileBroker::wait_for_jvmci_completion(JVMCICompiler* jvmci, CompileTask* task, JavaThread* thread) {
1939 assert(UseJVMCICompiler, "sanity");
1940 MonitorLocker ml(thread, CompileTaskWait_lock);
1941 int progress_wait_attempts = 0;
1942 jint thread_jvmci_compilation_ticks = 0;
1943 jint global_jvmci_compilation_ticks = jvmci->global_compilation_ticks();
1944 while (!task->is_complete() && !is_compilation_disabled_forever() &&
1945 ml.wait(JVMCI_COMPILATION_PROGRESS_WAIT_TIMESLICE)) {
1946 JVMCICompileState* jvmci_compile_state = task->blocking_jvmci_compile_state();
1947
1948 bool progress;
1949 if (jvmci_compile_state != nullptr) {
1950 jint ticks = jvmci_compile_state->compilation_ticks();
1951 progress = (ticks - thread_jvmci_compilation_ticks) != 0;
1952 JVMCI_event_1("waiting on compilation %d [ticks=%d]", task->compile_id(), ticks);
1953 thread_jvmci_compilation_ticks = ticks;
1954 } else {
1955 // Still waiting on JVMCI compiler queue. This thread may be holding a lock
1956 // that all JVMCI compiler threads are blocked on. We use the global JVMCI
1957 // compilation ticks to determine whether JVMCI compilation
1958 // is still making progress through the JVMCI compiler queue.
1959 jint ticks = jvmci->global_compilation_ticks();
1960 progress = (ticks - global_jvmci_compilation_ticks) != 0;
1961 JVMCI_event_1("waiting on compilation %d to be queued [ticks=%d]", task->compile_id(), ticks);
1962 global_jvmci_compilation_ticks = ticks;
1963 }
1964
1965 if (!progress) {
1966 if (++progress_wait_attempts == JVMCI_COMPILATION_PROGRESS_WAIT_ATTEMPTS) {
1967 if (PrintCompilation) {
1968 task->print(tty, "wait for blocking compilation timed out");
1969 }
1970 JVMCI_event_1("waiting on compilation %d timed out", task->compile_id());
1971 break;
1972 }
1973 } else {
1974 progress_wait_attempts = 0;
1975 }
1976 }
1977 task->clear_waiter();
1978 return task->is_complete();
1979 }
1980 #endif
1981
1982 /**
1983 * Wait for the compilation task to complete.
1984 */
1985 void CompileBroker::wait_for_completion(CompileTask* task) {
1986 if (CIPrintCompileQueue) {
1987 ttyLocker ttyl;
1988 tty->print_cr("BLOCKING FOR COMPILE");
1989 }
1990
1991 assert(task->is_blocking(), "can only wait on blocking task");
1992
1993 JavaThread* thread = JavaThread::current();
1994
1995 methodHandle method(thread, task->method());
1996 bool free_task;
1997 #if INCLUDE_JVMCI
1998 AbstractCompiler* comp = compiler(task->comp_level());
1999 if (!UseJVMCINativeLibrary && comp->is_jvmci() && !task->should_wait_for_compilation()) {
2000 // It may return before compilation is completed.
2001 // Note that libjvmci should not pre-emptively unblock
2002 // a thread waiting for a compilation as it does not call
2003 // Java code and so is not deadlock prone like jarjvmci.
2004 free_task = wait_for_jvmci_completion((JVMCICompiler*) comp, task, thread);
2005 } else
2006 #endif
2007 {
2008 free_task = true;
2009 // Wait until the task is complete or compilation is shut down.
2010 MonitorLocker ml(thread, CompileTaskWait_lock);
2011 while (!task->is_complete() && !is_compilation_disabled_forever()) {
2012 ml.wait();
2013 }
2014 }
2015
2016 // It is harmless to check this status without the lock, because
2017 // completion is a stable property.
2018 if (!task->is_complete()) {
2019 // Task is not complete, likely because we are exiting for compilation
2020 // shutdown. The task can still be reached through the queue, or executed
2021 // by some compiler thread. There is no coordination with either MCQ lock
2022 // holders or compilers, therefore we cannot delete the task.
2023 //
2024 // This will leave task allocated, which leaks it. At this (degraded) point,
2025 // it is less risky to abandon the task, rather than attempting a more
2026 // complicated deletion protocol.
2027 free_task = false;
2028 }
2029
2030 if (free_task) {
2031 assert(task->is_complete(), "Compilation should have completed");
2032 assert(task->next() == nullptr && task->prev() == nullptr,
2033 "Completed task should not be in the queue");
2034
2035 // By convention, the waiter is responsible for deleting a
2036 // blocking CompileTask. Since there is only one waiter ever
2037 // waiting on a CompileTask, we know that no one else will
2038 // be using this CompileTask; we can delete it.
2039 delete task;
2040 }
2041 }
2042
2043 void CompileBroker::wait_for_no_active_tasks() {
2044 CompileTask::wait_for_no_active_tasks();
2045 }
2046
2047 /**
2048 * Initialize compiler thread(s) + compiler object(s). The postcondition
2049 * of this function is that the compiler runtimes are initialized and that
2050 * compiler threads can start compiling.
2051 */
2052 bool CompileBroker::init_compiler_runtime() {
2053 CompilerThread* thread = CompilerThread::current();
2054 AbstractCompiler* comp = thread->compiler();
2055 // Final sanity check - the compiler object must exist
2056 guarantee(comp != nullptr, "Compiler object must exist");
2057
2058 {
2059 // Must switch to native to allocate ci_env
2060 ThreadToNativeFromVM ttn(thread);
2061 ciEnv ci_env((CompileTask*)nullptr);
2062 // Cache Jvmti state
2063 ci_env.cache_jvmti_state();
2064 // Cache DTrace flags
2065 ci_env.cache_dtrace_flags();
2066
2067 // Switch back to VM state to do compiler initialization
2068 ThreadInVMfromNative tv(thread);
2069
2070 comp->initialize();
2071 }
2072
2073 if (comp->is_failed()) {
2074 disable_compilation_forever();
2075 // If compiler initialization failed, no compiler thread that is specific to a
2076 // particular compiler runtime will ever start to compile methods.
2077 shutdown_compiler_runtime(comp, thread);
2078 return false;
2079 }
2080
2081 // C1 specific check
2082 if (comp->is_c1() && (thread->get_buffer_blob() == nullptr)) {
2083 warning("Initialization of %s thread failed (no space to run compilers)", thread->name());
2084 return false;
2085 }
2086
2087 return true;
2088 }
2089
2090 void CompileBroker::free_buffer_blob_if_allocated(CompilerThread* thread) {
2091 BufferBlob* blob = thread->get_buffer_blob();
2092 if (blob != nullptr) {
2093 blob->purge();
2094 MutexLocker mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2095 CodeCache::free(blob);
2096 }
2097 }
2098
2099 /**
2100 * If C1 and/or C2 initialization failed, we shut down all compilation.
2101 * We do this to keep things simple. This can be changed if it ever turns
2102 * out to be a problem.
2103 */
2104 void CompileBroker::shutdown_compiler_runtime(AbstractCompiler* comp, CompilerThread* thread) {
2105 free_buffer_blob_if_allocated(thread);
2106
2107 log_info(compilation)("shutdown_compiler_runtime: " INTPTR_FORMAT, p2i(thread));
2108
2109 if (comp->should_perform_shutdown()) {
2110 // There are two reasons for shutting down the compiler
2111 // 1) compiler runtime initialization failed
2112 // 2) The code cache is full and the following flag is set: -XX:-UseCodeCacheFlushing
2113 warning("%s initialization failed. Shutting down all compilers", comp->name());
2114
2115 // Only one thread per compiler runtime object enters here
2116 // Set state to shut down
2117 comp->set_shut_down();
2118
2119 // Delete all queued compilation tasks to make compiler threads exit faster.
2120 if (_c1_compile_queue != nullptr) {
2121 _c1_compile_queue->delete_all();
2122 }
2123
2124 if (_c2_compile_queue != nullptr) {
2125 _c2_compile_queue->delete_all();
2126 }
2127
2128 // Set flags so that we continue execution with using interpreter only.
2129 UseCompiler = false;
2130 UseInterpreter = true;
2131
2132 // We could delete compiler runtimes also. However, there are references to
2133 // the compiler runtime(s) (e.g., nmethod::is_compiled_by_c1()) which then
2134 // fail. This can be done later if necessary.
2135 }
2136 }
2137
2138 /**
2139 * Helper function to create new or reuse old CompileLog.
2140 */
2141 CompileLog* CompileBroker::get_log(CompilerThread* ct) {
2142 if (!LogCompilation) return nullptr;
2143
2144 AbstractCompiler *compiler = ct->compiler();
2145 bool c1 = compiler->is_c1();
2146 jobject* compiler_objects = c1 ? _compiler1_objects : _compiler2_objects;
2147 assert(compiler_objects != nullptr, "must be initialized at this point");
2148 CompileLog** logs = c1 ? _compiler1_logs : _compiler2_logs;
2149 assert(logs != nullptr, "must be initialized at this point");
2150 int count = c1 ? _c1_count : _c2_count;
2151
2152 if (ct->queue() == _ac1_compile_queue || ct->queue() == _ac2_compile_queue) {
2153 compiler_objects = _ac_objects;
2154 logs = _ac_logs;
2155 count = _ac_count;
2156 }
2157 // Find Compiler number by its threadObj.
2158 oop compiler_obj = ct->threadObj();
2159 int compiler_number = 0;
2160 bool found = false;
2161 for (; compiler_number < count; compiler_number++) {
2162 if (JNIHandles::resolve_non_null(compiler_objects[compiler_number]) == compiler_obj) {
2163 found = true;
2164 break;
2165 }
2166 }
2167 assert(found, "Compiler must exist at this point");
2168
2169 // Determine pointer for this thread's log.
2170 CompileLog** log_ptr = &logs[compiler_number];
2171
2172 // Return old one if it exists.
2173 CompileLog* log = *log_ptr;
2174 if (log != nullptr) {
2175 ct->init_log(log);
2176 return log;
2177 }
2178
2179 // Create a new one and remember it.
2180 init_compiler_thread_log();
2181 log = ct->log();
2182 *log_ptr = log;
2183 return log;
2184 }
2185
2186 // ------------------------------------------------------------------
2187 // CompileBroker::compiler_thread_loop
2188 //
2189 // The main loop run by a CompilerThread.
2190 void CompileBroker::compiler_thread_loop() {
2191 CompilerThread* thread = CompilerThread::current();
2192 CompileQueue* queue = thread->queue();
2193 // For the thread that initializes the ciObjectFactory
2194 // this resource mark holds all the shared objects
2195 ResourceMark rm;
2196
2197 // First thread to get here will initialize the compiler interface
2198
2199 {
2200 ASSERT_IN_VM;
2201 MutexLocker only_one (thread, CompileThread_lock);
2202 if (!ciObjectFactory::is_initialized()) {
2203 ciObjectFactory::initialize();
2204 }
2205 }
2206
2207 // Open a log.
2208 CompileLog* log = get_log(thread);
2209 if (log != nullptr) {
2210 log->begin_elem("start_compile_thread name='%s' thread='%zu' process='%d'",
2211 thread->name(),
2212 os::current_thread_id(),
2213 os::current_process_id());
2214 log->stamp();
2215 log->end_elem();
2216 }
2217
2218 if (!thread->init_compilation_timeout()) {
2219 return;
2220 }
2221
2222 // If compiler thread/runtime initialization fails, exit the compiler thread
2223 if (!init_compiler_runtime()) {
2224 return;
2225 }
2226
2227 thread->start_idle_timer();
2228
2229 // Poll for new compilation tasks as long as the JVM runs. Compilation
2230 // should only be disabled if something went wrong while initializing the
2231 // compiler runtimes. This, in turn, should not happen. The only known case
2232 // when compiler runtime initialization fails is if there is not enough free
2233 // space in the code cache to generate the necessary stubs, etc.
2234 while (!is_compilation_disabled_forever()) {
2235 // We need this HandleMark to avoid leaking VM handles.
2236 HandleMark hm(thread);
2237
2238 RecompilationPolicy::recompilation_step(AOTRecompilationWorkUnitSize, thread);
2239
2240 CompileTask* task = queue->get(thread);
2241 if (task == nullptr) {
2242 if (UseDynamicNumberOfCompilerThreads) {
2243 // Access compiler_count under lock to enforce consistency.
2244 MutexLocker only_one(CompileThread_lock);
2245 if (can_remove(thread, true)) {
2246 if (trace_compiler_threads()) {
2247 ResourceMark rm;
2248 stringStream msg;
2249 msg.print("Removing compiler thread %s after " JLONG_FORMAT " ms idle time",
2250 thread->name(), thread->idle_time_millis());
2251 print_compiler_threads(msg);
2252 }
2253
2254 // Notify compiler that the compiler thread is about to stop
2255 thread->compiler()->stopping_compiler_thread(thread);
2256
2257 free_buffer_blob_if_allocated(thread);
2258 return; // Stop this thread.
2259 }
2260 }
2261 } else {
2262 // Assign the task to the current thread. Mark this compilation
2263 // thread as active for the profiler.
2264 // CompileTaskWrapper also keeps the Method* from being deallocated if redefinition
2265 // occurs after fetching the compile task off the queue.
2266 CompileTaskWrapper ctw(task);
2267 methodHandle method(thread, task->method());
2268
2269 // Never compile a method if breakpoints are present in it
2270 if (method()->number_of_breakpoints() == 0) {
2271 // Compile the method.
2272 if ((UseCompiler || AlwaysCompileLoopMethods) && CompileBroker::should_compile_new_jobs()) {
2273 invoke_compiler_on_method(task);
2274 thread->start_idle_timer();
2275 } else {
2276 // After compilation is disabled, remove remaining methods from queue
2277 method->clear_queued_for_compilation();
2278 method->set_pending_queue_processed(false);
2279 task->set_failure_reason("compilation is disabled");
2280 }
2281 } else {
2282 task->set_failure_reason("breakpoints are present");
2283 }
2284
2285 // Don't use AOT compielr threads for dynamic C1 and C2 threads creation.
2286 if (UseDynamicNumberOfCompilerThreads &&
2287 (queue == _c1_compile_queue || queue == _c2_compile_queue)) {
2288 possibly_add_compiler_threads(thread);
2289 assert(!thread->has_pending_exception(), "should have been handled");
2290 }
2291 }
2292 }
2293
2294 // Shut down compiler runtime
2295 shutdown_compiler_runtime(thread->compiler(), thread);
2296 }
2297
2298 // ------------------------------------------------------------------
2299 // CompileBroker::init_compiler_thread_log
2300 //
2301 // Set up state required by +LogCompilation.
2302 void CompileBroker::init_compiler_thread_log() {
2303 CompilerThread* thread = CompilerThread::current();
2304 char file_name[4*K];
2305 FILE* fp = nullptr;
2306 intx thread_id = os::current_thread_id();
2307 for (int try_temp_dir = 1; try_temp_dir >= 0; try_temp_dir--) {
2308 const char* dir = (try_temp_dir ? os::get_temp_directory() : nullptr);
2309 if (dir == nullptr) {
2310 jio_snprintf(file_name, sizeof(file_name), "hs_c%zu_pid%u.log",
2311 thread_id, os::current_process_id());
2312 } else {
2313 jio_snprintf(file_name, sizeof(file_name),
2314 "%s%shs_c%zu_pid%u.log", dir,
2315 os::file_separator(), thread_id, os::current_process_id());
2316 }
2317
2318 fp = os::fopen(file_name, "wt");
2319 if (fp != nullptr) {
2320 if (LogCompilation && Verbose) {
2321 tty->print_cr("Opening compilation log %s", file_name);
2322 }
2323 CompileLog* log = new(mtCompiler) CompileLog(file_name, fp, thread_id);
2324 if (log == nullptr) {
2325 fclose(fp);
2326 return;
2327 }
2328 thread->init_log(log);
2329
2330 if (xtty != nullptr) {
2331 ttyLocker ttyl;
2332 // Record any per thread log files
2333 xtty->elem("thread_logfile thread='%zd' filename='%s'", thread_id, file_name);
2334 }
2335 return;
2336 }
2337 }
2338 warning("Cannot open log file: %s", file_name);
2339 }
2340
2341 void CompileBroker::log_metaspace_failure() {
2342 const char* message = "some methods may not be compiled because metaspace "
2343 "is out of memory";
2344 if (CompilationLog::log() != nullptr) {
2345 CompilationLog::log()->log_metaspace_failure(message);
2346 }
2347 if (PrintCompilation) {
2348 tty->print_cr("COMPILE PROFILING SKIPPED: %s", message);
2349 }
2350 }
2351
2352
2353 // ------------------------------------------------------------------
2354 // CompileBroker::set_should_block
2355 //
2356 // Set _should_block.
2357 // Call this from the VM, with Threads_lock held and a safepoint requested.
2358 void CompileBroker::set_should_block() {
2359 assert(Threads_lock->owner() == Thread::current(), "must have threads lock");
2360 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint already");
2361 #ifndef PRODUCT
2362 if (PrintCompilation && (Verbose || WizardMode))
2363 tty->print_cr("notifying compiler thread pool to block");
2364 #endif
2365 _should_block = true;
2366 }
2367
2368 // ------------------------------------------------------------------
2369 // CompileBroker::maybe_block
2370 //
2371 // Call this from the compiler at convenient points, to poll for _should_block.
2372 void CompileBroker::maybe_block() {
2373 if (_should_block) {
2374 #ifndef PRODUCT
2375 if (PrintCompilation && (Verbose || WizardMode))
2376 tty->print_cr("compiler thread " INTPTR_FORMAT " poll detects block request", p2i(Thread::current()));
2377 #endif
2378 // If we are executing a task during the request to block, report the task
2379 // before disappearing.
2380 CompilerThread* thread = CompilerThread::current();
2381 if (thread != nullptr) {
2382 CompileTask* task = thread->task();
2383 if (task != nullptr) {
2384 if (PrintCompilation) {
2385 task->print(tty, "blocked");
2386 }
2387 task->print_ul("blocked");
2388 }
2389 }
2390 // Go to VM state and block for final VM shutdown safepoint.
2391 ThreadInVMfromNative tivfn(JavaThread::current());
2392 assert(false, "Should never unblock from TIVNM entry");
2393 }
2394 }
2395
2396 // wrapper for CodeCache::print_summary()
2397 static void codecache_print(bool detailed)
2398 {
2399 stringStream s;
2400 // Dump code cache into a buffer before locking the tty,
2401 {
2402 MutexLocker mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2403 CodeCache::print_summary(&s, detailed);
2404 }
2405 ttyLocker ttyl;
2406 tty->print("%s", s.freeze());
2407 }
2408
2409 // wrapper for CodeCache::print_summary() using outputStream
2410 static void codecache_print(outputStream* out, bool detailed) {
2411 stringStream s;
2412
2413 // Dump code cache into a buffer
2414 {
2415 MutexLocker mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2416 CodeCache::print_summary(&s, detailed);
2417 }
2418
2419 char* remaining_log = s.as_string();
2420 while (*remaining_log != '\0') {
2421 char* eol = strchr(remaining_log, '\n');
2422 if (eol == nullptr) {
2423 out->print_cr("%s", remaining_log);
2424 remaining_log = remaining_log + strlen(remaining_log);
2425 } else {
2426 *eol = '\0';
2427 out->print_cr("%s", remaining_log);
2428 remaining_log = eol + 1;
2429 }
2430 }
2431 }
2432
2433 void CompileBroker::handle_compile_error(CompilerThread* thread, CompileTask* task, ciEnv* ci_env,
2434 int compilable, const char* failure_reason) {
2435 if (!AbortVMOnCompilationFailure) {
2436 return;
2437 }
2438 if (compilable == ciEnv::MethodCompilable_not_at_tier) {
2439 fatal("Not compilable at tier %d: %s", task->comp_level(), failure_reason);
2440 }
2441 if (compilable == ciEnv::MethodCompilable_never) {
2442 fatal("Never compilable: %s", failure_reason);
2443 }
2444 }
2445
2446 static void post_compilation_event(EventCompilation& event, CompileTask* task) {
2447 assert(task != nullptr, "invariant");
2448 CompilerEvent::CompilationEvent::post(event,
2449 task->compile_id(),
2450 task->compiler()->type(),
2451 task->method(),
2452 task->comp_level(),
2453 task->is_success(),
2454 task->osr_bci() != CompileBroker::standard_entry_bci,
2455 task->nm_total_size(),
2456 task->num_inlined_bytecodes(),
2457 task->arena_bytes());
2458 }
2459
2460 int DirectivesStack::_depth = 0;
2461 CompilerDirectives* DirectivesStack::_top = nullptr;
2462 CompilerDirectives* DirectivesStack::_bottom = nullptr;
2463
2464 // Acquires Compilation_lock and waits for it to be notified
2465 // as long as WhiteBox::compilation_locked is true.
2466 static void whitebox_lock_compilation() {
2467 MonitorLocker locker(Compilation_lock, Mutex::_no_safepoint_check_flag);
2468 while (WhiteBox::compilation_locked) {
2469 locker.wait();
2470 }
2471 }
2472
2473 // ------------------------------------------------------------------
2474 // CompileBroker::invoke_compiler_on_method
2475 //
2476 // Compile a method.
2477 //
2478 void CompileBroker::invoke_compiler_on_method(CompileTask* task) {
2479 task->print_ul();
2480 elapsedTimer time;
2481
2482 DirectiveSet* directive = task->directive();
2483 if (directive->PrintCompilationOption) {
2484 ResourceMark rm;
2485 task->print_tty();
2486 }
2487
2488 CompilerThread* thread = CompilerThread::current();
2489 ResourceMark rm(thread);
2490
2491 if (CompilationLog::log() != nullptr) {
2492 CompilationLog::log()->log_compile(thread, task);
2493 }
2494
2495 // Common flags.
2496 int compile_id = task->compile_id();
2497 int osr_bci = task->osr_bci();
2498 bool is_osr = (osr_bci != standard_entry_bci);
2499 bool should_log = (thread->log() != nullptr);
2500 bool should_break = false;
2501 const int task_level = task->comp_level();
2502 AbstractCompiler* comp = task->compiler();
2503 {
2504 // create the handle inside it's own block so it can't
2505 // accidentally be referenced once the thread transitions to
2506 // native. The NoHandleMark before the transition should catch
2507 // any cases where this occurs in the future.
2508 methodHandle method(thread, task->method());
2509
2510 assert(!method->is_native(), "no longer compile natives");
2511
2512 // Update compile information when using perfdata.
2513 if (UsePerfData) {
2514 update_compile_perf_data(thread, method, is_osr);
2515 }
2516
2517 DTRACE_METHOD_COMPILE_BEGIN_PROBE(method, compiler_name(task_level));
2518 }
2519
2520 should_break = directive->BreakAtCompileOption || task->check_break_at_flags();
2521 if (should_log && !directive->LogOption) {
2522 should_log = false;
2523 }
2524
2525 // Allocate a new set of JNI handles.
2526 JNIHandleMark jhm(thread);
2527 Method* target_handle = task->method();
2528 int compilable = ciEnv::MethodCompilable;
2529 const char* failure_reason = nullptr;
2530 bool failure_reason_on_C_heap = false;
2531 const char* retry_message = nullptr;
2532
2533 #if INCLUDE_JVMCI
2534 if (UseJVMCICompiler && comp != nullptr && comp->is_jvmci()) {
2535 JVMCICompiler* jvmci = (JVMCICompiler*) comp;
2536
2537 TraceTime t1("compilation", &time);
2538 EventCompilation event;
2539 JVMCICompileState compile_state(task, jvmci);
2540 JVMCIRuntime *runtime = nullptr;
2541
2542 if (JVMCI::in_shutdown()) {
2543 failure_reason = "in JVMCI shutdown";
2544 retry_message = "not retryable";
2545 compilable = ciEnv::MethodCompilable_never;
2546 } else if (compile_state.target_method_is_old()) {
2547 // Skip redefined methods
2548 failure_reason = "redefined method";
2549 retry_message = "not retryable";
2550 compilable = ciEnv::MethodCompilable_never;
2551 } else {
2552 JVMCIEnv env(thread, &compile_state, __FILE__, __LINE__);
2553 if (env.init_error() != JNI_OK) {
2554 const char* msg = env.init_error_msg();
2555 failure_reason = os::strdup(err_msg("Error attaching to libjvmci (err: %d, %s)",
2556 env.init_error(), msg == nullptr ? "unknown" : msg), mtJVMCI);
2557 bool reason_on_C_heap = true;
2558 // In case of JNI_ENOMEM, there's a good chance a subsequent attempt to create libjvmci or attach to it
2559 // might succeed. Other errors most likely indicate a non-recoverable error in the JVMCI runtime.
2560 bool retryable = env.init_error() == JNI_ENOMEM;
2561 compile_state.set_failure(retryable, failure_reason, reason_on_C_heap);
2562 }
2563 if (failure_reason == nullptr) {
2564 if (WhiteBoxAPI && WhiteBox::compilation_locked) {
2565 // Must switch to native to block
2566 ThreadToNativeFromVM ttn(thread);
2567 whitebox_lock_compilation();
2568 }
2569 methodHandle method(thread, target_handle);
2570 runtime = env.runtime();
2571 runtime->compile_method(&env, jvmci, method, osr_bci);
2572
2573 failure_reason = compile_state.failure_reason();
2574 failure_reason_on_C_heap = compile_state.failure_reason_on_C_heap();
2575 if (!compile_state.retryable()) {
2576 retry_message = "not retryable";
2577 compilable = ciEnv::MethodCompilable_not_at_tier;
2578 }
2579 if (!task->is_success()) {
2580 assert(failure_reason != nullptr, "must specify failure_reason");
2581 }
2582 }
2583 }
2584 if (!task->is_success() && !JVMCI::in_shutdown()) {
2585 handle_compile_error(thread, task, nullptr, compilable, failure_reason);
2586 }
2587 if (event.should_commit()) {
2588 post_compilation_event(event, task);
2589 }
2590
2591 if (runtime != nullptr) {
2592 runtime->post_compile(thread);
2593 }
2594 } else
2595 #endif // INCLUDE_JVMCI
2596 {
2597 NoHandleMark nhm;
2598 ThreadToNativeFromVM ttn(thread);
2599
2600 ciEnv ci_env(task);
2601 if (should_break) {
2602 ci_env.set_break_at_compile(true);
2603 }
2604 if (should_log) {
2605 ci_env.set_log(thread->log());
2606 }
2607 assert(thread->env() == &ci_env, "set by ci_env");
2608 // The thread-env() field is cleared in ~CompileTaskWrapper.
2609
2610 // Cache Jvmti state
2611 bool method_is_old = ci_env.cache_jvmti_state();
2612
2613 // Skip redefined methods
2614 if (method_is_old) {
2615 ci_env.record_method_not_compilable("redefined method", true);
2616 }
2617
2618 // Cache DTrace flags
2619 ci_env.cache_dtrace_flags();
2620
2621 ciMethod* target = ci_env.get_method_from_handle(target_handle);
2622
2623 TraceTime t1("compilation", &time);
2624 EventCompilation event;
2625
2626 if (comp == nullptr) {
2627 ci_env.record_method_not_compilable("no compiler");
2628 } else if (!ci_env.failing()) {
2629 if (WhiteBoxAPI && WhiteBox::compilation_locked) {
2630 whitebox_lock_compilation();
2631 }
2632 comp->compile_method(&ci_env, target, osr_bci, true, directive);
2633
2634 /* Repeat compilation without installing code for profiling purposes */
2635 int repeat_compilation_count = task->is_aot_load() ? 0 : directive->RepeatCompilationOption;
2636 if (repeat_compilation_count > 0) {
2637 CHeapStringHolder failure_reason;
2638 failure_reason.set(ci_env._failure_reason.get());
2639 while (repeat_compilation_count > 0) {
2640 ResourceMark rm(thread);
2641 task->print_ul("NO CODE INSTALLED");
2642 thread->timeout()->reset();
2643 ci_env._failure_reason.clear();
2644 comp->compile_method(&ci_env, target, osr_bci, false, directive);
2645 repeat_compilation_count--;
2646 }
2647 ci_env._failure_reason.set(failure_reason.get());
2648 }
2649 }
2650
2651
2652 if (!ci_env.failing() && !task->is_success() && !task->is_aot_compile()) {
2653 assert(ci_env.failure_reason() != nullptr, "expect failure reason");
2654 assert(false, "compiler should always document failure: %s", ci_env.failure_reason());
2655 // The compiler elected, without comment, not to register a result.
2656 // Do not attempt further compilations of this method.
2657 ci_env.record_method_not_compilable("compile failed");
2658 }
2659
2660 // Copy this bit to the enclosing block:
2661 compilable = ci_env.compilable();
2662
2663 if (ci_env.failing()) {
2664 // Duplicate the failure reason string, so that it outlives ciEnv
2665 failure_reason = os::strdup(ci_env.failure_reason(), mtCompiler);
2666 failure_reason_on_C_heap = true;
2667 retry_message = ci_env.retry_message();
2668 ci_env.report_failure(failure_reason);
2669 }
2670
2671 if (ci_env.failing()) {
2672 handle_compile_error(thread, task, &ci_env, compilable, failure_reason);
2673 }
2674 if (event.should_commit()) {
2675 post_compilation_event(event, task);
2676 }
2677 }
2678
2679 if (failure_reason != nullptr) {
2680 task->set_failure_reason(failure_reason, failure_reason_on_C_heap);
2681 if (CompilationLog::log() != nullptr) {
2682 CompilationLog::log()->log_failure(thread, task, failure_reason, retry_message);
2683 }
2684 if (PrintCompilation || directive->PrintCompilationOption) {
2685 FormatBufferResource msg = retry_message != nullptr ?
2686 FormatBufferResource("COMPILE SKIPPED: %s (%s)", failure_reason, retry_message) :
2687 FormatBufferResource("COMPILE SKIPPED: %s", failure_reason);
2688 task->print(tty, msg);
2689 }
2690 }
2691
2692 task->mark_finished(os::elapsed_counter());
2693 DirectivesStack::release(directive);
2694
2695 methodHandle method(thread, task->method());
2696
2697 DTRACE_METHOD_COMPILE_END_PROBE(method, compiler_name(task_level), task->is_success());
2698
2699 collect_statistics(thread, time, task);
2700
2701 if (PrintCompilation2) {
2702 ResourceMark rm;
2703 task->print_post(tty);
2704 }
2705
2706 Log(compilation, codecache) log;
2707 if (log.is_debug()) {
2708 LogStream ls(log.debug());
2709 codecache_print(&ls, /* detailed= */ false);
2710 }
2711 if (PrintCodeCacheOnCompilation) {
2712 codecache_print(/* detailed= */ false);
2713 }
2714 // Disable compilation, if required.
2715 switch (compilable) {
2716 case ciEnv::MethodCompilable_never:
2717 if (is_osr)
2718 method->set_not_osr_compilable_quietly("MethodCompilable_never");
2719 else
2720 method->set_not_compilable_quietly("MethodCompilable_never");
2721 break;
2722 case ciEnv::MethodCompilable_not_at_tier:
2723 if (is_osr)
2724 method->set_not_osr_compilable_quietly("MethodCompilable_not_at_tier", task_level);
2725 else
2726 method->set_not_compilable_quietly("MethodCompilable_not_at_tier", task_level);
2727 break;
2728 }
2729
2730 // Note that the queued_for_compilation bits are cleared without
2731 // protection of a mutex. [They were set by the requester thread,
2732 // when adding the task to the compile queue -- at which time the
2733 // compile queue lock was held. Subsequently, we acquired the compile
2734 // queue lock to get this task off the compile queue; thus (to belabour
2735 // the point somewhat) our clearing of the bits must be occurring
2736 // only after the setting of the bits. See also 14012000 above.
2737 method->clear_queued_for_compilation();
2738 method->set_pending_queue_processed(false);
2739 }
2740
2741 /**
2742 * The CodeCache is full. Print warning and disable compilation.
2743 * Schedule code cache cleaning so compilation can continue later.
2744 * This function needs to be called only from CodeCache::allocate(),
2745 * since we currently handle a full code cache uniformly.
2746 */
2747 void CompileBroker::handle_full_code_cache(CodeBlobType code_blob_type) {
2748 UseInterpreter = true;
2749 if (UseCompiler || AlwaysCompileLoopMethods ) {
2750 if (xtty != nullptr) {
2751 stringStream s;
2752 // Dump code cache state into a buffer before locking the tty,
2753 // because log_state() will use locks causing lock conflicts.
2754 CodeCache::log_state(&s);
2755 // Lock to prevent tearing
2756 ttyLocker ttyl;
2757 xtty->begin_elem("code_cache_full");
2758 xtty->print("%s", s.freeze());
2759 xtty->stamp();
2760 xtty->end_elem();
2761 }
2762
2763 #ifndef PRODUCT
2764 if (ExitOnFullCodeCache) {
2765 codecache_print(/* detailed= */ true);
2766 before_exit(JavaThread::current());
2767 exit_globals(); // will delete tty
2768 vm_direct_exit(1);
2769 }
2770 #endif
2771 if (UseCodeCacheFlushing) {
2772 // Since code cache is full, immediately stop new compiles
2773 if (CompileBroker::set_should_compile_new_jobs(CompileBroker::stop_compilation)) {
2774 log_info(codecache)("Code cache is full - disabling compilation");
2775 }
2776 } else {
2777 disable_compilation_forever();
2778 }
2779
2780 CodeCache::report_codemem_full(code_blob_type, should_print_compiler_warning());
2781 }
2782 }
2783
2784 // ------------------------------------------------------------------
2785 // CompileBroker::update_compile_perf_data
2786 //
2787 // Record this compilation for debugging purposes.
2788 void CompileBroker::update_compile_perf_data(CompilerThread* thread, const methodHandle& method, bool is_osr) {
2789 ResourceMark rm;
2790 char* method_name = method->name()->as_C_string();
2791 char current_method[CompilerCounters::cmname_buffer_length];
2792 size_t maxLen = CompilerCounters::cmname_buffer_length;
2793
2794 const char* class_name = method->method_holder()->name()->as_C_string();
2795
2796 size_t s1len = strlen(class_name);
2797 size_t s2len = strlen(method_name);
2798
2799 // check if we need to truncate the string
2800 if (s1len + s2len + 2 > maxLen) {
2801
2802 // the strategy is to lop off the leading characters of the
2803 // class name and the trailing characters of the method name.
2804
2805 if (s2len + 2 > maxLen) {
2806 // lop of the entire class name string, let snprintf handle
2807 // truncation of the method name.
2808 class_name += s1len; // null string
2809 }
2810 else {
2811 // lop off the extra characters from the front of the class name
2812 class_name += ((s1len + s2len + 2) - maxLen);
2813 }
2814 }
2815
2816 jio_snprintf(current_method, maxLen, "%s %s", class_name, method_name);
2817
2818 int last_compile_type = normal_compile;
2819 if (CICountOSR && is_osr) {
2820 last_compile_type = osr_compile;
2821 } else if (CICountNative && method->is_native()) {
2822 last_compile_type = native_compile;
2823 }
2824
2825 CompilerCounters* counters = thread->counters();
2826 counters->set_current_method(current_method);
2827 counters->set_compile_type((jlong) last_compile_type);
2828 }
2829
2830 // ------------------------------------------------------------------
2831 // CompileBroker::collect_statistics
2832 //
2833 // Collect statistics about the compilation.
2834
2835 void CompileBroker::collect_statistics(CompilerThread* thread, elapsedTimer time, CompileTask* task) {
2836 bool success = task->is_success();
2837 methodHandle method (thread, task->method());
2838 int compile_id = task->compile_id();
2839 bool is_osr = (task->osr_bci() != standard_entry_bci);
2840 const int comp_level = task->comp_level();
2841 CompilerCounters* counters = thread->counters();
2842
2843 MutexLocker locker(CompileStatistics_lock);
2844
2845 // _perf variables are production performance counters which are
2846 // updated regardless of the setting of the CITime and CITimeEach flags
2847 //
2848
2849 // account all time, including bailouts and failures in this counter;
2850 // C1 and C2 counters are counting both successful and unsuccessful compiles
2851 _t_total_compilation.add(&time);
2852
2853 // Update compilation times. Used by the implementation of JFR CompilerStatistics
2854 // and java.lang.management.CompilationMXBean.
2855 _perf_total_compilation->inc(time.ticks());
2856 _peak_compilation_time = MAX2(time.milliseconds(), _peak_compilation_time);
2857
2858 if (!success) {
2859 _total_bailout_count++;
2860 if (UsePerfData) {
2861 _perf_last_failed_method->set_value(counters->current_method());
2862 _perf_last_failed_type->set_value(counters->compile_type());
2863 _perf_total_bailout_count->inc();
2864 }
2865 _t_bailedout_compilation.add(&time);
2866
2867 if (CITime || log_is_enabled(Info, init)) {
2868 CompilerStatistics* stats = nullptr;
2869 if (task->is_aot_load()) {
2870 int level = task->preload() ? CompLevel_full_optimization : (comp_level - 1);
2871 stats = &_aot_stats_per_level[level];
2872 } else {
2873 stats = &_stats_per_level[comp_level-1];
2874 }
2875 stats->_bailout.update(time, 0);
2876 }
2877 } else if (!task->is_success()) {
2878 if (UsePerfData) {
2879 _perf_last_invalidated_method->set_value(counters->current_method());
2880 _perf_last_invalidated_type->set_value(counters->compile_type());
2881 _perf_total_invalidated_count->inc();
2882 }
2883 _total_invalidated_count++;
2884 _t_invalidated_compilation.add(&time);
2885
2886 if (CITime || log_is_enabled(Info, init)) {
2887 CompilerStatistics* stats = nullptr;
2888 if (task->is_aot_load()) {
2889 int level = task->preload() ? CompLevel_full_optimization : (comp_level - 1);
2890 stats = &_aot_stats_per_level[level];
2891 } else {
2892 stats = &_stats_per_level[comp_level-1];
2893 }
2894 stats->_invalidated.update(time, 0);
2895 }
2896 } else {
2897 // Compilation succeeded
2898 if (CITime || log_is_enabled(Info, init)) {
2899 int bytes_compiled = method->code_size() + task->num_inlined_bytecodes();
2900 if (is_osr) {
2901 _t_osr_compilation.add(&time);
2902 _sum_osr_bytes_compiled += bytes_compiled;
2903 } else {
2904 _t_standard_compilation.add(&time);
2905 _sum_standard_bytes_compiled += method->code_size() + task->num_inlined_bytecodes();
2906 }
2907
2908 // Collect statistic per compilation level
2909 if (task->is_aot_load()) {
2910 _aot_stats._standard.update(time, bytes_compiled);
2911 _aot_stats._nmethods_size += task->nm_total_size();
2912 _aot_stats._nmethods_code_size += task->nm_insts_size();
2913 int level = task->preload() ? CompLevel_full_optimization : (comp_level - 1);
2914 CompilerStatistics* stats = &_aot_stats_per_level[level];
2915 stats->_standard.update(time, bytes_compiled);
2916 stats->_nmethods_size += task->nm_total_size();
2917 stats->_nmethods_code_size += task->nm_insts_size();
2918 } else if (comp_level > CompLevel_none && comp_level <= CompLevel_full_optimization) {
2919 CompilerStatistics* stats = &_stats_per_level[comp_level-1];
2920 if (is_osr) {
2921 stats->_osr.update(time, bytes_compiled);
2922 } else {
2923 stats->_standard.update(time, bytes_compiled);
2924 }
2925 stats->_nmethods_size += task->nm_total_size();
2926 stats->_nmethods_code_size += task->nm_insts_size();
2927 } else {
2928 assert(false, "CompilerStatistics object does not exist for compilation level %d", comp_level);
2929 }
2930
2931 // Collect statistic per compiler
2932 AbstractCompiler* comp = task->compiler();
2933 if (comp && !task->is_aot_load()) {
2934 CompilerStatistics* stats = comp->stats();
2935 if (is_osr) {
2936 stats->_osr.update(time, bytes_compiled);
2937 } else {
2938 stats->_standard.update(time, bytes_compiled);
2939 }
2940 stats->_nmethods_size += task->nm_total_size();
2941 stats->_nmethods_code_size += task->nm_insts_size();
2942 } else if (!task->is_aot_load()) { // if (!comp)
2943 assert(false, "Compiler object must exist");
2944 }
2945 }
2946
2947 if (UsePerfData) {
2948 // save the name of the last method compiled
2949 _perf_last_method->set_value(counters->current_method());
2950 _perf_last_compile_type->set_value(counters->compile_type());
2951 _perf_last_compile_size->set_value(method->code_size() +
2952 task->num_inlined_bytecodes());
2953 if (is_osr) {
2954 _perf_osr_compilation->inc(time.ticks());
2955 _perf_sum_osr_bytes_compiled->inc(method->code_size() + task->num_inlined_bytecodes());
2956 } else {
2957 _perf_standard_compilation->inc(time.ticks());
2958 _perf_sum_standard_bytes_compiled->inc(method->code_size() + task->num_inlined_bytecodes());
2959 }
2960 }
2961
2962 if (CITimeEach) {
2963 double compile_time = time.seconds();
2964 double bytes_per_sec = compile_time == 0.0 ? 0.0 : (double)(method->code_size() + task->num_inlined_bytecodes()) / compile_time;
2965 tty->print_cr("%3d seconds: %6.3f bytes/sec : %f (bytes %d + %d inlined)",
2966 compile_id, compile_time, bytes_per_sec, method->code_size(), task->num_inlined_bytecodes());
2967 }
2968
2969 // Collect counts of successful compilations
2970 _sum_nmethod_size += task->nm_total_size();
2971 _sum_nmethod_code_size += task->nm_insts_size();
2972 _total_compile_count++;
2973
2974 if (UsePerfData) {
2975 _perf_sum_nmethod_size->inc( task->nm_total_size());
2976 _perf_sum_nmethod_code_size->inc(task->nm_insts_size());
2977 _perf_total_compile_count->inc();
2978 }
2979
2980 if (is_osr) {
2981 if (UsePerfData) _perf_total_osr_compile_count->inc();
2982 _total_osr_compile_count++;
2983 } else {
2984 if (UsePerfData) _perf_total_standard_compile_count->inc();
2985 _total_standard_compile_count++;
2986 }
2987 }
2988 // set the current method for the thread to null
2989 if (UsePerfData) counters->set_current_method("");
2990 }
2991
2992 const char* CompileBroker::compiler_name(int comp_level) {
2993 AbstractCompiler *comp = CompileBroker::compiler(comp_level);
2994 if (comp == nullptr) {
2995 return "no compiler";
2996 } else {
2997 return (comp->name());
2998 }
2999 }
3000
3001 jlong CompileBroker::total_compilation_ticks() {
3002 return _perf_total_compilation != nullptr ? _perf_total_compilation->get_value() : 0;
3003 }
3004
3005 void CompileBroker::log_not_entrant(nmethod* nm) {
3006 _total_not_entrant_count++;
3007 if (CITime || log_is_enabled(Info, init)) {
3008 CompilerStatistics* stats = nullptr;
3009 int level = nm->comp_level();
3010 if (nm->is_aot()) {
3011 if (nm->preloaded()) {
3012 assert(level == CompLevel_full_optimization, "%d", level);
3013 level = CompLevel_full_optimization + 1;
3014 }
3015 stats = &_aot_stats_per_level[level - 1];
3016 } else {
3017 stats = &_stats_per_level[level - 1];
3018 }
3019 stats->_made_not_entrant._count++;
3020 }
3021 }
3022
3023 void CompileBroker::print_times(const char* name, CompilerStatistics* stats) {
3024 tty->print_cr(" %s {speed: %6.3f bytes/s; standard: %6.3f s, %u bytes, %u methods; osr: %6.3f s, %u bytes, %u methods; nmethods_size: %u bytes; nmethods_code_size: %u bytes}",
3025 name, stats->bytes_per_second(),
3026 stats->_standard._time.seconds(), stats->_standard._bytes, stats->_standard._count,
3027 stats->_osr._time.seconds(), stats->_osr._bytes, stats->_osr._count,
3028 stats->_nmethods_size, stats->_nmethods_code_size);
3029 }
3030
3031 static void print_helper(outputStream* st, const char* name, CompilerStatistics::Data data, bool print_time = true) {
3032 if (data._count > 0) {
3033 st->print("; %s: %4u methods", name, data._count);
3034 if (print_time) {
3035 st->print(" (in %.3fs)", data._time.seconds());
3036 }
3037 }
3038 }
3039
3040 static void print_tier_helper(outputStream* st, const char* prefix, int tier, CompilerStatistics* stats) {
3041 st->print(" %s%d: %5u methods", prefix, tier, stats->_standard._count);
3042 if (stats->_standard._count > 0) {
3043 st->print(" (in %.3fs)", stats->_standard._time.seconds());
3044 }
3045 print_helper(st, "osr", stats->_osr);
3046 print_helper(st, "bailout", stats->_bailout);
3047 print_helper(st, "invalid", stats->_invalidated);
3048 print_helper(st, "not_entrant", stats->_made_not_entrant, false);
3049 st->cr();
3050 }
3051
3052 static void print_queue_info(outputStream* st, CompileQueue* queue) {
3053 if (queue != nullptr) {
3054 MutexLocker ml(queue->lock());
3055
3056 uint total_cnt = 0;
3057 uint active_cnt = 0;
3058 for (JavaThread* jt : *ThreadsSMRSupport::get_java_thread_list()) {
3059 guarantee(jt != nullptr, "");
3060 if (jt->is_Compiler_thread()) {
3061 CompilerThread* ct = (CompilerThread*)jt;
3062
3063 guarantee(ct != nullptr, "");
3064 if (ct->queue() == queue) {
3065 ++total_cnt;
3066 CompileTask* task = ct->task();
3067 if (task != nullptr) {
3068 ++active_cnt;
3069 }
3070 }
3071 }
3072 }
3073
3074 st->print(" %s (%d active / %d total threads): %u tasks",
3075 queue->name(), active_cnt, total_cnt, queue->size());
3076 if (queue->size() > 0) {
3077 uint counts[] = {0, 0, 0, 0, 0}; // T1 ... T5
3078 for (CompileTask* task = queue->first(); task != nullptr; task = task->next()) {
3079 int tier = task->comp_level();
3080 if (task->is_aot_load() && task->preload()) {
3081 assert(tier == CompLevel_full_optimization, "%d", tier);
3082 tier = CompLevel_full_optimization + 1;
3083 }
3084 counts[tier-1]++;
3085 }
3086 st->print(":");
3087 for (int tier = CompLevel_simple; tier <= CompilationPolicy::highest_compile_level() + 1; tier++) {
3088 uint cnt = counts[tier-1];
3089 if (cnt > 0) {
3090 st->print(" T%d: %u tasks;", tier, cnt);
3091 }
3092 }
3093 }
3094 st->cr();
3095 }
3096 }
3097 void CompileBroker::print_statistics_on(outputStream* st) {
3098 st->print_cr(" Total: %u methods; %u bailouts, %u invalidated, %u non_entrant",
3099 _total_compile_count, _total_bailout_count, _total_invalidated_count, _total_not_entrant_count);
3100 for (int tier = CompLevel_simple; tier <= CompilationPolicy::highest_compile_level(); tier++) {
3101 print_tier_helper(st, "Tier", tier, &_stats_per_level[tier-1]);
3102 }
3103 st->cr();
3104
3105 if (AOTCodeCaching) {
3106 for (int tier = CompLevel_simple; tier <= CompilationPolicy::highest_compile_level() + 1; tier++) {
3107 if (tier != CompLevel_full_profile) {
3108 print_tier_helper(st, "AOT Code T", tier, &_aot_stats_per_level[tier - 1]);
3109 }
3110 }
3111 st->cr();
3112 }
3113
3114 print_queue_info(st, _c1_compile_queue);
3115 print_queue_info(st, _c2_compile_queue);
3116 print_queue_info(st, _ac1_compile_queue);
3117 print_queue_info(st, _ac2_compile_queue);
3118 }
3119
3120 void CompileBroker::print_times(bool per_compiler, bool aggregate) {
3121 if (per_compiler) {
3122 if (aggregate) {
3123 tty->cr();
3124 tty->print_cr("[%dms] Individual compiler times (for compiled methods only)", (int)tty->time_stamp().milliseconds());
3125 tty->print_cr("------------------------------------------------");
3126 tty->cr();
3127 }
3128 for (unsigned int i = 0; i < sizeof(_compilers) / sizeof(AbstractCompiler*); i++) {
3129 AbstractCompiler* comp = _compilers[i];
3130 if (comp != nullptr) {
3131 print_times(comp->name(), comp->stats());
3132 }
3133 }
3134 if (_aot_stats._standard._count > 0) {
3135 print_times("AC", &_aot_stats);
3136 }
3137 if (aggregate) {
3138 tty->cr();
3139 tty->print_cr("Individual compilation Tier times (for compiled methods only)");
3140 tty->print_cr("------------------------------------------------");
3141 tty->cr();
3142 }
3143 char tier_name[256];
3144 for (int tier = CompLevel_simple; tier <= CompilationPolicy::highest_compile_level(); tier++) {
3145 CompilerStatistics* stats = &_stats_per_level[tier-1];
3146 os::snprintf_checked(tier_name, sizeof(tier_name), "Tier%d", tier);
3147 print_times(tier_name, stats);
3148 }
3149 for (int tier = CompLevel_simple; tier <= CompilationPolicy::highest_compile_level() + 1; tier++) {
3150 CompilerStatistics* stats = &_aot_stats_per_level[tier-1];
3151 if (stats->_standard._bytes > 0) {
3152 os::snprintf_checked(tier_name, sizeof(tier_name), "AOT Code T%d", tier);
3153 print_times(tier_name, stats);
3154 }
3155 }
3156 }
3157
3158 if (!aggregate) {
3159 return;
3160 }
3161
3162 elapsedTimer standard_compilation = CompileBroker::_t_standard_compilation;
3163 elapsedTimer osr_compilation = CompileBroker::_t_osr_compilation;
3164 elapsedTimer total_compilation = CompileBroker::_t_total_compilation;
3165
3166 uint standard_bytes_compiled = CompileBroker::_sum_standard_bytes_compiled;
3167 uint osr_bytes_compiled = CompileBroker::_sum_osr_bytes_compiled;
3168
3169 uint standard_compile_count = CompileBroker::_total_standard_compile_count;
3170 uint osr_compile_count = CompileBroker::_total_osr_compile_count;
3171 uint total_compile_count = CompileBroker::_total_compile_count;
3172 uint total_bailout_count = CompileBroker::_total_bailout_count;
3173 uint total_invalidated_count = CompileBroker::_total_invalidated_count;
3174
3175 uint nmethods_code_size = CompileBroker::_sum_nmethod_code_size;
3176 uint nmethods_size = CompileBroker::_sum_nmethod_size;
3177
3178 tty->cr();
3179 tty->print_cr("Accumulated compiler times");
3180 tty->print_cr("----------------------------------------------------------");
3181 //0000000000111111111122222222223333333333444444444455555555556666666666
3182 //0123456789012345678901234567890123456789012345678901234567890123456789
3183 tty->print_cr(" Total compilation time : %7.3f s", total_compilation.seconds());
3184 tty->print_cr(" Standard compilation : %7.3f s, Average : %2.3f s",
3185 standard_compilation.seconds(),
3186 standard_compile_count == 0 ? 0.0 : standard_compilation.seconds() / standard_compile_count);
3187 tty->print_cr(" Bailed out compilation : %7.3f s, Average : %2.3f s",
3188 CompileBroker::_t_bailedout_compilation.seconds(),
3189 total_bailout_count == 0 ? 0.0 : CompileBroker::_t_bailedout_compilation.seconds() / total_bailout_count);
3190 tty->print_cr(" On stack replacement : %7.3f s, Average : %2.3f s",
3191 osr_compilation.seconds(),
3192 osr_compile_count == 0 ? 0.0 : osr_compilation.seconds() / osr_compile_count);
3193 tty->print_cr(" Invalidated : %7.3f s, Average : %2.3f s",
3194 CompileBroker::_t_invalidated_compilation.seconds(),
3195 total_invalidated_count == 0 ? 0.0 : CompileBroker::_t_invalidated_compilation.seconds() / total_invalidated_count);
3196
3197 if (AOTCodeCaching) { // Check flags because AOT code cache could be closed already
3198 tty->cr();
3199 AOTCodeCache::print_timers_on(tty);
3200 }
3201 AbstractCompiler *comp = compiler(CompLevel_simple);
3202 if (comp != nullptr) {
3203 tty->cr();
3204 comp->print_timers();
3205 }
3206 comp = compiler(CompLevel_full_optimization);
3207 if (comp != nullptr) {
3208 tty->cr();
3209 comp->print_timers();
3210 }
3211 #if INCLUDE_JVMCI
3212 if (EnableJVMCI) {
3213 JVMCICompiler *jvmci_comp = JVMCICompiler::instance(false, JavaThread::current_or_null());
3214 if (jvmci_comp != nullptr && jvmci_comp != comp) {
3215 tty->cr();
3216 jvmci_comp->print_timers();
3217 }
3218 }
3219 #endif
3220
3221 tty->cr();
3222 tty->print_cr(" Total compiled methods : %8u methods", total_compile_count);
3223 tty->print_cr(" Standard compilation : %8u methods", standard_compile_count);
3224 tty->print_cr(" On stack replacement : %8u methods", osr_compile_count);
3225 uint tcb = osr_bytes_compiled + standard_bytes_compiled;
3226 tty->print_cr(" Total compiled bytecodes : %8u bytes", tcb);
3227 tty->print_cr(" Standard compilation : %8u bytes", standard_bytes_compiled);
3228 tty->print_cr(" On stack replacement : %8u bytes", osr_bytes_compiled);
3229 double tcs = total_compilation.seconds();
3230 uint bps = tcs == 0.0 ? 0 : (uint)(tcb / tcs);
3231 tty->print_cr(" Average compilation speed : %8u bytes/s", bps);
3232 tty->cr();
3233 tty->print_cr(" nmethod code size : %8u bytes", nmethods_code_size);
3234 tty->print_cr(" nmethod total size : %8u bytes", nmethods_size);
3235 }
3236
3237 // Print general/accumulated JIT information.
3238 void CompileBroker::print_info(outputStream *out) {
3239 if (out == nullptr) out = tty;
3240 out->cr();
3241 out->print_cr("======================");
3242 out->print_cr(" General JIT info ");
3243 out->print_cr("======================");
3244 out->cr();
3245 out->print_cr(" JIT is : %7s", should_compile_new_jobs() ? "on" : "off");
3246 out->print_cr(" Compiler threads : %7d", (int)CICompilerCount);
3247 out->cr();
3248 out->print_cr("CodeCache overview");
3249 out->print_cr("--------------------------------------------------------");
3250 out->cr();
3251 out->print_cr(" Reserved size : %7zu KB", CodeCache::max_capacity() / K);
3252 out->print_cr(" Committed size : %7zu KB", CodeCache::capacity() / K);
3253 out->print_cr(" Unallocated capacity : %7zu KB", CodeCache::unallocated_capacity() / K);
3254 out->cr();
3255 }
3256
3257 // Note: tty_lock must not be held upon entry to this function.
3258 // Print functions called from herein do "micro-locking" on tty_lock.
3259 // That's a tradeoff which keeps together important blocks of output.
3260 // At the same time, continuous tty_lock hold time is kept in check,
3261 // preventing concurrently printing threads from stalling a long time.
3262 void CompileBroker::print_heapinfo(outputStream* out, const char* function, size_t granularity) {
3263 TimeStamp ts_total;
3264 TimeStamp ts_global;
3265 TimeStamp ts;
3266
3267 bool allFun = !strcmp(function, "all");
3268 bool aggregate = !strcmp(function, "aggregate") || !strcmp(function, "analyze") || allFun;
3269 bool usedSpace = !strcmp(function, "UsedSpace") || allFun;
3270 bool freeSpace = !strcmp(function, "FreeSpace") || allFun;
3271 bool methodCount = !strcmp(function, "MethodCount") || allFun;
3272 bool methodSpace = !strcmp(function, "MethodSpace") || allFun;
3273 bool methodAge = !strcmp(function, "MethodAge") || allFun;
3274 bool methodNames = !strcmp(function, "MethodNames") || allFun;
3275 bool discard = !strcmp(function, "discard") || allFun;
3276
3277 if (out == nullptr) {
3278 out = tty;
3279 }
3280
3281 if (!(aggregate || usedSpace || freeSpace || methodCount || methodSpace || methodAge || methodNames || discard)) {
3282 out->print_cr("\n__ CodeHeapStateAnalytics: Function %s is not supported", function);
3283 out->cr();
3284 return;
3285 }
3286
3287 ts_total.update(); // record starting point
3288
3289 if (aggregate) {
3290 print_info(out);
3291 }
3292
3293 // We hold the CodeHeapStateAnalytics_lock all the time, from here until we leave this function.
3294 // That prevents other threads from destroying (making inconsistent) our view on the CodeHeap.
3295 // When we request individual parts of the analysis via the jcmd interface, it is possible
3296 // that in between another thread (another jcmd user or the vm running into CodeCache OOM)
3297 // updated the aggregated data. We will then see a modified, but again consistent, view
3298 // on the CodeHeap. That's a tolerable tradeoff we have to accept because we can't hold
3299 // a lock across user interaction.
3300
3301 // We should definitely acquire this lock before acquiring Compile_lock and CodeCache_lock.
3302 // CodeHeapStateAnalytics_lock may be held by a concurrent thread for a long time,
3303 // leading to an unnecessarily long hold time of the other locks we acquired before.
3304 ts.update(); // record starting point
3305 MutexLocker mu0(CodeHeapStateAnalytics_lock, Mutex::_safepoint_check_flag);
3306 out->print_cr("\n__ CodeHeapStateAnalytics lock wait took %10.3f seconds _________\n", ts.seconds());
3307
3308 // Holding the CodeCache_lock protects from concurrent alterations of the CodeCache.
3309 // Unfortunately, such protection is not sufficient:
3310 // When a new nmethod is created via ciEnv::register_method(), the
3311 // Compile_lock is taken first. After some initializations,
3312 // nmethod::new_nmethod() takes over, grabbing the CodeCache_lock
3313 // immediately (after finalizing the oop references). To lock out concurrent
3314 // modifiers, we have to grab both locks as well in the described sequence.
3315 //
3316 // If we serve an "allFun" call, it is beneficial to hold CodeCache_lock and Compile_lock
3317 // for the entire duration of aggregation and printing. That makes sure we see
3318 // a consistent picture and do not run into issues caused by concurrent alterations.
3319 bool should_take_Compile_lock = !SafepointSynchronize::is_at_safepoint() &&
3320 !Compile_lock->owned_by_self();
3321 bool should_take_CodeCache_lock = !SafepointSynchronize::is_at_safepoint() &&
3322 !CodeCache_lock->owned_by_self();
3323 bool take_global_lock_1 = allFun && should_take_Compile_lock;
3324 bool take_global_lock_2 = allFun && should_take_CodeCache_lock;
3325 bool take_function_lock_1 = !allFun && should_take_Compile_lock;
3326 bool take_function_lock_2 = !allFun && should_take_CodeCache_lock;
3327 bool take_global_locks = take_global_lock_1 || take_global_lock_2;
3328 bool take_function_locks = take_function_lock_1 || take_function_lock_2;
3329
3330 ts_global.update(); // record starting point
3331
3332 ConditionalMutexLocker mu1(Compile_lock, take_global_lock_1, Mutex::_safepoint_check_flag);
3333 ConditionalMutexLocker mu2(CodeCache_lock, take_global_lock_2, Mutex::_no_safepoint_check_flag);
3334 if (take_global_locks) {
3335 out->print_cr("\n__ Compile & CodeCache (global) lock wait took %10.3f seconds _________\n", ts_global.seconds());
3336 ts_global.update(); // record starting point
3337 }
3338
3339 if (aggregate) {
3340 ts.update(); // record starting point
3341 ConditionalMutexLocker mu11(Compile_lock, take_function_lock_1, Mutex::_safepoint_check_flag);
3342 ConditionalMutexLocker mu22(CodeCache_lock, take_function_lock_2, Mutex::_no_safepoint_check_flag);
3343 if (take_function_locks) {
3344 out->print_cr("\n__ Compile & CodeCache (function) lock wait took %10.3f seconds _________\n", ts.seconds());
3345 }
3346
3347 ts.update(); // record starting point
3348 CodeCache::aggregate(out, granularity);
3349 if (take_function_locks) {
3350 out->print_cr("\n__ Compile & CodeCache (function) lock hold took %10.3f seconds _________\n", ts.seconds());
3351 }
3352 }
3353
3354 if (usedSpace) CodeCache::print_usedSpace(out);
3355 if (freeSpace) CodeCache::print_freeSpace(out);
3356 if (methodCount) CodeCache::print_count(out);
3357 if (methodSpace) CodeCache::print_space(out);
3358 if (methodAge) CodeCache::print_age(out);
3359 if (methodNames) {
3360 if (allFun) {
3361 // print_names() can only be used safely if the locks have been continuously held
3362 // since aggregation begin. That is true only for function "all".
3363 CodeCache::print_names(out);
3364 } else {
3365 out->print_cr("\nCodeHeapStateAnalytics: Function 'MethodNames' is only available as part of function 'all'");
3366 }
3367 }
3368 if (discard) CodeCache::discard(out);
3369
3370 if (take_global_locks) {
3371 out->print_cr("\n__ Compile & CodeCache (global) lock hold took %10.3f seconds _________\n", ts_global.seconds());
3372 }
3373 out->print_cr("\n__ CodeHeapStateAnalytics total duration %10.3f seconds _________\n", ts_total.seconds());
3374 }