1 /*
2 * Copyright (c) 1998, 2025, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "classfile/vmSymbols.hpp"
26 #include "gc/shared/oopStorage.hpp"
27 #include "gc/shared/oopStorageSet.hpp"
28 #include "jfr/jfrEvents.hpp"
29 #include "jfr/support/jfrThreadId.hpp"
30 #include "logging/log.hpp"
31 #include "logging/logStream.hpp"
32 #include "memory/allocation.inline.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "oops/markWord.hpp"
35 #include "oops/oop.inline.hpp"
36 #include "oops/oopHandle.inline.hpp"
37 #include "oops/weakHandle.inline.hpp"
38 #include "prims/jvmtiDeferredUpdates.hpp"
39 #include "prims/jvmtiExport.hpp"
40 #include "runtime/atomic.hpp"
41 #include "runtime/continuationWrapper.inline.hpp"
42 #include "runtime/globals.hpp"
43 #include "runtime/handles.inline.hpp"
44 #include "runtime/interfaceSupport.inline.hpp"
45 #include "runtime/javaThread.inline.hpp"
46 #include "runtime/lightweightSynchronizer.hpp"
47 #include "runtime/mutexLocker.hpp"
48 #include "runtime/objectMonitor.hpp"
49 #include "runtime/objectMonitor.inline.hpp"
50 #include "runtime/orderAccess.hpp"
51 #include "runtime/osThread.hpp"
52 #include "runtime/safefetch.hpp"
53 #include "runtime/safepointMechanism.inline.hpp"
54 #include "runtime/sharedRuntime.hpp"
55 #include "runtime/threads.hpp"
56 #include "services/threadService.hpp"
57 #include "utilities/debug.hpp"
58 #include "utilities/dtrace.hpp"
59 #include "utilities/globalCounter.inline.hpp"
60 #include "utilities/globalDefinitions.hpp"
61 #include "utilities/macros.hpp"
62 #include "utilities/preserveException.hpp"
63 #if INCLUDE_JFR
64 #include "jfr/support/jfrFlush.hpp"
65 #endif
66
67 #ifdef DTRACE_ENABLED
68
69 // Only bother with this argument setup if dtrace is available
70 // TODO-FIXME: probes should not fire when caller is _blocked. assert() accordingly.
71
72
73 #define DTRACE_MONITOR_PROBE_COMMON(obj, thread) \
74 char* bytes = nullptr; \
75 int len = 0; \
76 jlong jtid = SharedRuntime::get_java_tid(thread); \
77 Symbol* klassname = obj->klass()->name(); \
78 if (klassname != nullptr) { \
79 bytes = (char*)klassname->bytes(); \
80 len = klassname->utf8_length(); \
81 }
82
83 #define DTRACE_MONITOR_WAIT_PROBE(monitor, obj, thread, millis) \
84 { \
85 if (DTraceMonitorProbes) { \
86 DTRACE_MONITOR_PROBE_COMMON(obj, thread); \
87 HOTSPOT_MONITOR_WAIT(jtid, \
88 (monitor), bytes, len, (millis)); \
89 } \
90 }
91
92 #define HOTSPOT_MONITOR_contended__enter HOTSPOT_MONITOR_CONTENDED_ENTER
93 #define HOTSPOT_MONITOR_contended__entered HOTSPOT_MONITOR_CONTENDED_ENTERED
94 #define HOTSPOT_MONITOR_contended__exit HOTSPOT_MONITOR_CONTENDED_EXIT
95 #define HOTSPOT_MONITOR_notify HOTSPOT_MONITOR_NOTIFY
96 #define HOTSPOT_MONITOR_notifyAll HOTSPOT_MONITOR_NOTIFYALL
97
98 #define DTRACE_MONITOR_PROBE(probe, monitor, obj, thread) \
99 { \
100 if (DTraceMonitorProbes) { \
101 DTRACE_MONITOR_PROBE_COMMON(obj, thread); \
102 HOTSPOT_MONITOR_##probe(jtid, \
103 (uintptr_t)(monitor), bytes, len); \
104 } \
105 }
106
107 #else // ndef DTRACE_ENABLED
108
109 #define DTRACE_MONITOR_WAIT_PROBE(obj, thread, millis, mon) {;}
110 #define DTRACE_MONITOR_PROBE(probe, obj, thread, mon) {;}
111
112 #endif // ndef DTRACE_ENABLED
113
114 DEBUG_ONLY(static volatile bool InitDone = false;)
115
116 OopStorage* ObjectMonitor::_oop_storage = nullptr;
117
118 OopHandle ObjectMonitor::_vthread_list_head;
119 ParkEvent* ObjectMonitor::_vthread_unparker_ParkEvent = nullptr;
120
121 // -----------------------------------------------------------------------------
122 // Theory of operations -- Monitors lists, thread residency, etc:
123 //
124 // * A thread acquires ownership of a monitor by successfully
125 // CAS()ing the _owner field from NO_OWNER/DEFLATER_MARKER to
126 // its owner_id (return value from owner_id_from()).
127 //
128 // * Invariant: A thread appears on at most one monitor list --
129 // entry_list or wait_set -- at any one time.
130 //
131 // * Contending threads "push" themselves onto the entry_list with CAS
132 // and then spin/park.
133 // If the thread is a virtual thread it will first attempt to
134 // unmount itself. The virtual thread will first try to freeze
135 // all frames in the heap. If the operation fails it will just
136 // follow the regular path for platform threads. If the operation
137 // succeeds, it will push itself onto the entry_list with CAS and then
138 // return back to Java to continue the unmount logic.
139 //
140 // * After a contending thread eventually acquires the lock it must
141 // dequeue itself from the entry_list.
142 //
143 // * The exiting thread identifies and unparks an "heir presumptive"
144 // tentative successor thread on the entry_list. In case the successor
145 // is an unmounted virtual thread, the exiting thread will first try
146 // to add it to the list of vthreads waiting to be unblocked, and on
147 // success it will unpark the special unblocker thread instead, which
148 // will be in charge of submitting the vthread back to the scheduler
149 // queue. Critically, the exiting thread doesn't unlink the successor
150 // thread from the entry_list. After having been unparked/re-scheduled,
151 // the wakee will recontend for ownership of the monitor. The successor
152 // (wakee) will either acquire the lock or re-park/unmount itself.
153 //
154 // Succession is provided for by a policy of competitive handoff.
155 // The exiting thread does _not_ grant or pass ownership to the
156 // successor thread. (This is also referred to as "handoff succession").
157 // Instead the exiting thread releases ownership and possibly wakes
158 // a successor, so the successor can (re)compete for ownership of the lock.
159 //
160 // * The entry_list forms a queue of threads stalled trying to acquire
161 // the lock. Within the entry_list the next pointers always form a
162 // consistent singly linked list. At unlock-time when the unlocking
163 // thread notices that the tail of the entry_list is not known, we
164 // convert the singly linked entry_list into a doubly linked list by
165 // assigning the prev pointers and the entry_list_tail pointer.
166 //
167 // Example:
168 //
169 // The first contending thread that "pushed" itself onto entry_list,
170 // will be the last thread in the list. Each newly pushed thread in
171 // entry_list will be linked through its next pointer, and have its
172 // prev pointer set to null. Thus pushing six threads A-F (in that
173 // order) onto entry_list, will form a singly linked list, see 1)
174 // below.
175 //
176 // 1) entry_list ->F->E->D->C->B->A->null
177 // entry_list_tail ->null
178 //
179 // Since the successor is chosen in FIFO order, the exiting thread
180 // needs to find the tail of the entry_list. This is done by walking
181 // from the entry_list head. While walking the list we also assign
182 // the prev pointers of each thread, essentially forming a doubly
183 // linked list, see 2) below.
184 //
185 // 2) entry_list ->F<=>E<=>D<=>C<=>B<=>A->null
186 // entry_list_tail ----------------------^
187 //
188 // Once we have formed a doubly linked list it's easy to find the
189 // successor (A), wake it up, have it remove itself, and update the
190 // tail pointer, as seen in and 3) below.
191 //
192 // 3) entry_list ->F<=>E<=>D<=>C<=>B->null
193 // entry_list_tail ------------------^
194 //
195 // At any time new threads can add themselves to the entry_list, see
196 // 4) below.
197 //
198 // 4) entry_list ->I->H->G->F<=>E<=>D->null
199 // entry_list_tail -------------------^
200 //
201 // At some point in time the thread (F) that wants to remove itself
202 // from the end of the list, will not have any prev pointer, see 5)
203 // below.
204 //
205 // 5) entry_list ->I->H->G->F->null
206 // entry_list_tail -----------^
207 //
208 // To resolve this we just start walking from the entry_list head
209 // again, forming a new doubly linked list, before removing the
210 // thread (F), see 6) and 7) below.
211 //
212 // 6) entry_list ->I<=>H<=>G<=>F->null
213 // entry_list_tail --------------^
214 //
215 // 7) entry_list ->I<=>H<=>G->null
216 // entry_list_tail ----------^
217 //
218 // * The monitor itself protects all of the operations on the
219 // entry_list except for the CAS of a new arrival to the head. Only
220 // the monitor owner can read or write the prev links (e.g. to
221 // remove itself) or update the tail.
222 //
223 // * The monitor entry list operations avoid locks, but strictly speaking
224 // they're not lock-free. Enter is lock-free, exit is not.
225 // For a description of 'Methods and apparatus providing non-blocking access
226 // to a resource,' see U.S. Pat. No. 7844973.
227 //
228 // * The entry_list can have multiple concurrent "pushers" but only
229 // one concurrent detaching thread. There is no ABA-problem with
230 // this usage of CAS.
231 //
232 // * As long as the entry_list_tail is known the odds are good that we
233 // should be able to dequeue after acquisition (in the ::enter()
234 // epilogue) in constant-time. This is good since a key desideratum
235 // is to minimize queue & monitor metadata manipulation that occurs
236 // while holding the monitor lock -- that is, we want to minimize
237 // monitor lock holds times. Note that even a small amount of fixed
238 // spinning will greatly reduce the # of enqueue-dequeue operations
239 // on entry_list. That is, spinning relieves contention on the
240 // "inner" locks and monitor metadata.
241 //
242 // Insert and delete operations may not operate in constant-time if
243 // we have interference because some other thread is adding or
244 // removing the head element of entry_list or if we need to convert
245 // the singly linked entry_list into a doubly linked list to find the
246 // tail.
247 //
248 // * The monitor synchronization subsystem avoids the use of native
249 // synchronization primitives except for the narrow platform-specific
250 // park-unpark abstraction. See the comments in os_posix.cpp regarding
251 // the semantics of park-unpark. Put another way, this monitor implementation
252 // depends only on atomic operations and park-unpark.
253 //
254 // * Waiting threads reside on the wait_set list -- wait() puts
255 // the caller onto the wait_set.
256 //
257 // * notify() or notifyAll() simply transfers threads from the wait_set
258 // to the entry_list. Subsequent exit() operations will
259 // unpark/re-schedule the notifyee. Unparking/re-scheduling a
260 // notifyee in notify() is inefficient - it's likely the notifyee
261 // would simply impale itself on the lock held by the notifier.
262
263 // Check that object() and set_object() are called from the right context:
264 static void check_object_context() {
265 #ifdef ASSERT
266 Thread* self = Thread::current();
267 if (self->is_Java_thread()) {
268 // Mostly called from JavaThreads so sanity check the thread state.
269 JavaThread* jt = JavaThread::cast(self);
270 switch (jt->thread_state()) {
271 case _thread_in_vm: // the usual case
272 case _thread_in_Java: // during deopt
273 break;
274 default:
275 fatal("called from an unsafe thread state");
276 }
277 assert(jt->is_active_Java_thread(), "must be active JavaThread");
278 } else {
279 // However, ThreadService::get_current_contended_monitor()
280 // can call here via the VMThread so sanity check it.
281 assert(self->is_VM_thread(), "must be");
282 }
283 #endif // ASSERT
284 }
285
286 ObjectMonitor::ObjectMonitor(oop object) :
287 _metadata(0),
288 _object(_oop_storage, object),
289 _owner(NO_OWNER),
290 _previous_owner_tid(0),
291 _next_om(nullptr),
292 _recursions(0),
293 _entry_list(nullptr),
294 _entry_list_tail(nullptr),
295 _succ(NO_OWNER),
296 _SpinDuration(ObjectMonitor::Knob_SpinLimit),
297 _contentions(0),
298 _unmounted_vthreads(0),
299 _wait_set(nullptr),
300 _waiters(0),
301 _wait_set_lock(0),
302 _stack_locker(nullptr)
303 { }
304
305 ObjectMonitor::~ObjectMonitor() {
306 _object.release(_oop_storage);
307 }
308
309 oop ObjectMonitor::object() const {
310 check_object_context();
311 return _object.resolve();
312 }
313
314 void ObjectMonitor::ExitOnSuspend::operator()(JavaThread* current) {
315 if (current->is_suspended()) {
316 _om->_recursions = 0;
317 _om->clear_successor();
318 // Don't need a full fence after clearing successor here because of the call to exit().
319 _om->exit(current, false /* not_suspended */);
320 _om_exited = true;
321
322 current->set_current_pending_monitor(_om);
323 }
324 }
325
326 void ObjectMonitor::ClearSuccOnSuspend::operator()(JavaThread* current) {
327 if (current->is_suspended()) {
328 if (_om->has_successor(current)) {
329 _om->clear_successor();
330 OrderAccess::fence(); // always do a full fence when successor is cleared
331 }
332 }
333 }
334
335 #define assert_mark_word_consistency() \
336 assert(UseObjectMonitorTable || object()->mark() == markWord::encode(this), \
337 "object mark must match encoded this: mark=" INTPTR_FORMAT \
338 ", encoded this=" INTPTR_FORMAT, object()->mark().value(), \
339 markWord::encode(this).value());
340
341 // -----------------------------------------------------------------------------
342 // Enter support
343
344 bool ObjectMonitor::enter_is_async_deflating() {
345 if (is_being_async_deflated()) {
346 if (!UseObjectMonitorTable) {
347 const oop l_object = object();
348 if (l_object != nullptr) {
349 // Attempt to restore the header/dmw to the object's header so that
350 // we only retry once if the deflater thread happens to be slow.
351 install_displaced_markword_in_object(l_object);
352 }
353 }
354 return true;
355 }
356
357 return false;
358 }
359
360 bool ObjectMonitor::try_lock_with_contention_mark(JavaThread* locking_thread, ObjectMonitorContentionMark& contention_mark) {
361 assert(contention_mark._monitor == this, "must be");
362 assert(!is_being_async_deflated(), "must be");
363
364 int64_t prev_owner = try_set_owner_from(NO_OWNER, locking_thread);
365 bool success = false;
366
367 if (prev_owner == NO_OWNER) {
368 assert(_recursions == 0, "invariant");
369 success = true;
370 } else if (prev_owner == owner_id_from(locking_thread)) {
371 _recursions++;
372 success = true;
373 } else if (prev_owner == DEFLATER_MARKER) {
374 // Racing with deflation.
375 prev_owner = try_set_owner_from(DEFLATER_MARKER, locking_thread);
376 if (prev_owner == DEFLATER_MARKER) {
377 // We successfully cancelled the in-progress async deflation by
378 // changing owner from DEFLATER_MARKER to current. We now extend
379 // the lifetime of the contention_mark (e.g. contentions++) here
380 // to prevent the deflater thread from winning the last part of
381 // the 2-part async deflation protocol after the regular
382 // decrement occurs when the contention_mark goes out of
383 // scope. ObjectMonitor::deflate_monitor() which is called by
384 // the deflater thread will decrement contentions after it
385 // recognizes that the async deflation was cancelled.
386 contention_mark.extend();
387 success = true;
388 } else if (prev_owner == NO_OWNER) {
389 // At this point we cannot race with deflation as we have both incremented
390 // contentions, seen contention > 0 and seen a DEFLATER_MARKER.
391 // success will only be false if this races with something other than
392 // deflation.
393 prev_owner = try_set_owner_from(NO_OWNER, locking_thread);
394 success = prev_owner == NO_OWNER;
395 }
396 }
397 assert(!success || has_owner(locking_thread), "must be");
398
399 return success;
400 }
401
402 void ObjectMonitor::enter_for_with_contention_mark(JavaThread* locking_thread, ObjectMonitorContentionMark& contention_mark) {
403 // Used by LightweightSynchronizer::inflate_and_enter in deoptimization path to enter for another thread.
404 // The monitor is private to or already owned by locking_thread which must be suspended.
405 // So this code may only contend with deflation.
406 assert(locking_thread == Thread::current() || locking_thread->is_obj_deopt_suspend(), "must be");
407 bool success = try_lock_with_contention_mark(locking_thread, contention_mark);
408
409 assert(success, "Failed to enter_for: locking_thread=" INTPTR_FORMAT
410 ", this=" INTPTR_FORMAT "{owner=" INT64_FORMAT "}",
411 p2i(locking_thread), p2i(this), owner_raw());
412 }
413
414 bool ObjectMonitor::enter_for(JavaThread* locking_thread) {
415 // Used by ObjectSynchronizer::enter_for() to enter for another thread.
416 // The monitor is private to or already owned by locking_thread which must be suspended.
417 // So this code may only contend with deflation.
418 assert(locking_thread == Thread::current() || locking_thread->is_obj_deopt_suspend(), "must be");
419
420 // Block out deflation as soon as possible.
421 ObjectMonitorContentionMark contention_mark(this);
422
423 // Check for deflation.
424 if (enter_is_async_deflating()) {
425 return false;
426 }
427
428 bool success = try_lock_with_contention_mark(locking_thread, contention_mark);
429
430 assert(success, "Failed to enter_for: locking_thread=" INTPTR_FORMAT
431 ", this=" INTPTR_FORMAT "{owner=" INT64_FORMAT "}",
432 p2i(locking_thread), p2i(this), owner_raw());
433 assert(has_owner(locking_thread), "must be");
434 return true;
435 }
436
437 bool ObjectMonitor::try_enter(JavaThread* current, bool check_for_recursion) {
438 // TryLock avoids the CAS and handles deflation.
439 TryLockResult r = try_lock(current);
440 if (r == TryLockResult::Success) {
441 assert(_recursions == 0, "invariant");
442 return true;
443 }
444
445 // If called from SharedRuntime::monitor_exit_helper(), we know that
446 // this thread doesn't already own the lock.
447 if (!check_for_recursion) {
448 return false;
449 }
450
451 if (r == TryLockResult::HasOwner && has_owner(current)) {
452 _recursions++;
453 return true;
454 }
455
456 return false;
457 }
458
459 bool ObjectMonitor::spin_enter(JavaThread* current) {
460 assert(current == JavaThread::current(), "must be");
461
462 // Check for recursion.
463 if (try_enter(current)) {
464 return true;
465 }
466
467 // Check for deflation.
468 if (enter_is_async_deflating()) {
469 return false;
470 }
471
472 // We've encountered genuine contention.
473
474 // Do one round of spinning.
475 // Note that if we acquire the monitor from an initial spin
476 // we forgo posting JVMTI events and firing DTRACE probes.
477 if (try_spin(current)) {
478 assert(has_owner(current), "must be current: owner=" INT64_FORMAT, owner_raw());
479 assert(_recursions == 0, "must be 0: recursions=%zd", _recursions);
480 assert_mark_word_consistency();
481 return true;
482 }
483
484 return false;
485 }
486
487 bool ObjectMonitor::enter(JavaThread* current) {
488 assert(current == JavaThread::current(), "must be");
489
490 if (spin_enter(current)) {
491 return true;
492 }
493
494 assert(!has_owner(current), "invariant");
495 assert(!has_successor(current), "invariant");
496 assert(!SafepointSynchronize::is_at_safepoint(), "invariant");
497 assert(current->thread_state() != _thread_blocked, "invariant");
498
499 // Keep is_being_async_deflated stable across the rest of enter
500 ObjectMonitorContentionMark contention_mark(this);
501
502 // Check for deflation.
503 if (enter_is_async_deflating()) {
504 return false;
505 }
506
507 // At this point this ObjectMonitor cannot be deflated, finish contended enter
508 enter_with_contention_mark(current, contention_mark);
509 return true;
510 }
511
512 void ObjectMonitor::notify_contended_enter(JavaThread* current) {
513 current->set_current_pending_monitor(this);
514
515 DTRACE_MONITOR_PROBE(contended__enter, this, object(), current);
516 if (JvmtiExport::should_post_monitor_contended_enter()) {
517 JvmtiExport::post_monitor_contended_enter(current, this);
518
519 // The current thread does not yet own the monitor and does not
520 // yet appear on any queues that would get it made the successor.
521 // This means that the JVMTI_EVENT_MONITOR_CONTENDED_ENTER event
522 // handler cannot accidentally consume an unpark() meant for the
523 // ParkEvent associated with this ObjectMonitor.
524 }
525 }
526
527 void ObjectMonitor::enter_with_contention_mark(JavaThread* current, ObjectMonitorContentionMark &cm) {
528 assert(current == JavaThread::current(), "must be");
529 assert(!has_owner(current), "must be");
530 assert(cm._monitor == this, "must be");
531 assert(!is_being_async_deflated(), "must be");
532
533 JFR_ONLY(JfrConditionalFlush<EventJavaMonitorEnter> flush(current);)
534 EventJavaMonitorEnter enter_event;
535 if (enter_event.is_started()) {
536 enter_event.set_monitorClass(object()->klass());
537 // Set an address that is 'unique enough', such that events close in
538 // time and with the same address are likely (but not guaranteed) to
539 // belong to the same object.
540 enter_event.set_address((uintptr_t)this);
541 }
542 EventVirtualThreadPinned vthread_pinned_event;
543
544 freeze_result result;
545
546 assert(current->current_pending_monitor() == nullptr, "invariant");
547
548 ContinuationEntry* ce = current->last_continuation();
549 bool is_virtual = ce != nullptr && ce->is_virtual_thread();
550 if (is_virtual) {
551 notify_contended_enter(current);
552 result = Continuation::try_preempt(current, ce->cont_oop(current));
553 if (result == freeze_ok) {
554 bool acquired = vthread_monitor_enter(current);
555 if (acquired) {
556 // We actually acquired the monitor while trying to add the vthread to the
557 // _entry_list so cancel preemption. We will still go through the preempt stub
558 // but instead of unmounting we will call thaw to continue execution.
559 current->set_preemption_cancelled(true);
560 if (JvmtiExport::should_post_monitor_contended_entered()) {
561 // We are going to call thaw again after this and finish the VMTS
562 // transition so no need to do it here. We will post the event there.
563 current->set_contended_entered_monitor(this);
564 }
565 }
566 current->set_current_pending_monitor(nullptr);
567 DEBUG_ONLY(int state = java_lang_VirtualThread::state(current->vthread()));
568 assert((acquired && current->preemption_cancelled() && state == java_lang_VirtualThread::RUNNING) ||
569 (!acquired && !current->preemption_cancelled() && state == java_lang_VirtualThread::BLOCKING), "invariant");
570 return;
571 }
572 }
573
574 {
575 // Change java thread status to indicate blocked on monitor enter.
576 JavaThreadBlockedOnMonitorEnterState jtbmes(current, this);
577
578 if (!is_virtual) { // already notified contended_enter for virtual
579 notify_contended_enter(current);
580 }
581 OSThreadContendState osts(current->osthread());
582
583 assert(current->thread_state() == _thread_in_vm, "invariant");
584
585 for (;;) {
586 ExitOnSuspend eos(this);
587 {
588 ThreadBlockInVMPreprocess<ExitOnSuspend> tbivs(current, eos, true /* allow_suspend */);
589 enter_internal(current);
590 current->set_current_pending_monitor(nullptr);
591 // We can go to a safepoint at the end of this block. If we
592 // do a thread dump during that safepoint, then this thread will show
593 // as having "-locked" the monitor, but the OS and java.lang.Thread
594 // states will still report that the thread is blocked trying to
595 // acquire it.
596 // If there is a suspend request, ExitOnSuspend will exit the OM
597 // and set the OM as pending.
598 }
599 if (!eos.exited()) {
600 // ExitOnSuspend did not exit the OM
601 assert(has_owner(current), "invariant");
602 break;
603 }
604 }
605
606 // We've just gotten past the enter-check-for-suspend dance and we now own
607 // the monitor free and clear.
608 }
609
610 assert(contentions() >= 0, "must not be negative: contentions=%d", contentions());
611
612 // Must either set _recursions = 0 or ASSERT _recursions == 0.
613 assert(_recursions == 0, "invariant");
614 assert(has_owner(current), "invariant");
615 assert(!has_successor(current), "invariant");
616 assert_mark_word_consistency();
617
618 // The thread -- now the owner -- is back in vm mode.
619 // Report the glorious news via TI,DTrace and jvmstat.
620 // The probe effect is non-trivial. All the reportage occurs
621 // while we hold the monitor, increasing the length of the critical
622 // section. Amdahl's parallel speedup law comes vividly into play.
623 //
624 // Another option might be to aggregate the events (thread local or
625 // per-monitor aggregation) and defer reporting until a more opportune
626 // time -- such as next time some thread encounters contention but has
627 // yet to acquire the lock. While spinning that thread could
628 // spinning we could increment JVMStat counters, etc.
629
630 DTRACE_MONITOR_PROBE(contended__entered, this, object(), current);
631 if (JvmtiExport::should_post_monitor_contended_entered()) {
632 JvmtiExport::post_monitor_contended_entered(current, this);
633
634 // The current thread already owns the monitor and is not going to
635 // call park() for the remainder of the monitor enter protocol. So
636 // it doesn't matter if the JVMTI_EVENT_MONITOR_CONTENDED_ENTERED
637 // event handler consumed an unpark() issued by the thread that
638 // just exited the monitor.
639 }
640 if (enter_event.should_commit()) {
641 enter_event.set_previousOwner(_previous_owner_tid);
642 enter_event.commit();
643 }
644
645 if (current->current_waiting_monitor() == nullptr) {
646 ContinuationEntry* ce = current->last_continuation();
647 if (ce != nullptr && ce->is_virtual_thread()) {
648 current->post_vthread_pinned_event(&vthread_pinned_event, "Contended monitor enter", result);
649 }
650 }
651 }
652
653 // Caveat: try_lock() is not necessarily serializing if it returns failure.
654 // Callers must compensate as needed.
655
656 ObjectMonitor::TryLockResult ObjectMonitor::try_lock(JavaThread* current) {
657 int64_t own = owner_raw();
658 int64_t first_own = own;
659
660 for (;;) {
661 if (own == DEFLATER_MARKER) {
662 // Block out deflation as soon as possible.
663 ObjectMonitorContentionMark contention_mark(this);
664
665 // Check for deflation.
666 if (enter_is_async_deflating()) {
667 // Treat deflation as interference.
668 return TryLockResult::Interference;
669 }
670 if (try_lock_with_contention_mark(current, contention_mark)) {
671 assert(_recursions == 0, "invariant");
672 return TryLockResult::Success;
673 } else {
674 // Deflation won or change of owner; dont spin
675 break;
676 }
677 } else if (own == NO_OWNER) {
678 int64_t prev_own = try_set_owner_from(NO_OWNER, current);
679 if (prev_own == NO_OWNER) {
680 assert(_recursions == 0, "invariant");
681 return TryLockResult::Success;
682 } else {
683 // The lock had been free momentarily, but we lost the race to the lock.
684 own = prev_own;
685 }
686 } else {
687 // Retry doesn't make as much sense because the lock was just acquired.
688 break;
689 }
690 }
691 return first_own == own ? TryLockResult::HasOwner : TryLockResult::Interference;
692 }
693
694 // Push "current" onto the head of the _entry_list. Once on _entry_list,
695 // current stays on-queue until it acquires the lock.
696 void ObjectMonitor::add_to_entry_list(JavaThread* current, ObjectWaiter* node) {
697 node->_prev = nullptr;
698 node->TState = ObjectWaiter::TS_ENTER;
699
700 for (;;) {
701 ObjectWaiter* head = Atomic::load(&_entry_list);
702 node->_next = head;
703 if (Atomic::cmpxchg(&_entry_list, head, node) == head) {
704 return;
705 }
706 }
707 }
708
709 // Push "current" onto the head of the entry_list.
710 // If the _entry_list was changed during our push operation, we try to
711 // lock the monitor. Returns true if we locked the monitor, and false
712 // if we added current to _entry_list. Once on _entry_list, current
713 // stays on-queue until it acquires the lock.
714 bool ObjectMonitor::try_lock_or_add_to_entry_list(JavaThread* current, ObjectWaiter* node) {
715 node->_prev = nullptr;
716 node->TState = ObjectWaiter::TS_ENTER;
717
718 for (;;) {
719 ObjectWaiter* head = Atomic::load(&_entry_list);
720 node->_next = head;
721 if (Atomic::cmpxchg(&_entry_list, head, node) == head) {
722 return false;
723 }
724
725 // Interference - the CAS failed because _entry_list changed. Before
726 // retrying the CAS retry taking the lock as it may now be free.
727 if (try_lock(current) == TryLockResult::Success) {
728 assert(!has_successor(current), "invariant");
729 assert(has_owner(current), "invariant");
730 return true;
731 }
732 }
733 }
734
735 static void post_monitor_deflate_event(EventJavaMonitorDeflate* event,
736 const oop obj) {
737 assert(event != nullptr, "invariant");
738 if (obj == nullptr) {
739 // Accept the case when obj was already garbage-collected.
740 // Emit the event anyway, but without details.
741 event->set_monitorClass(nullptr);
742 event->set_address(0);
743 } else {
744 const Klass* monitor_klass = obj->klass();
745 if (ObjectMonitor::is_jfr_excluded(monitor_klass)) {
746 return;
747 }
748 event->set_monitorClass(monitor_klass);
749 event->set_address((uintptr_t)(void*)obj);
750 }
751 event->commit();
752 }
753
754 // Deflate the specified ObjectMonitor if not in-use. Returns true if it
755 // was deflated and false otherwise.
756 //
757 // The async deflation protocol sets owner to DEFLATER_MARKER and
758 // makes contentions negative as signals to contending threads that
759 // an async deflation is in progress. There are a number of checks
760 // as part of the protocol to make sure that the calling thread has
761 // not lost the race to a contending thread.
762 //
763 // The ObjectMonitor has been successfully async deflated when:
764 // (contentions < 0)
765 // Contending threads that see that condition know to retry their operation.
766 //
767 bool ObjectMonitor::deflate_monitor(Thread* current) {
768 if (is_busy()) {
769 // Easy checks are first - the ObjectMonitor is busy so no deflation.
770 return false;
771 }
772
773 EventJavaMonitorDeflate event;
774
775 const oop obj = object_peek();
776
777 if (obj == nullptr) {
778 // If the object died, we can recycle the monitor without racing with
779 // Java threads. The GC already broke the association with the object.
780 set_owner_from_raw(NO_OWNER, DEFLATER_MARKER);
781 assert(contentions() >= 0, "must be non-negative: contentions=%d", contentions());
782 _contentions = INT_MIN; // minimum negative int
783 } else {
784 // Attempt async deflation protocol.
785
786 // Set a null owner to DEFLATER_MARKER to force any contending thread
787 // through the slow path. This is just the first part of the async
788 // deflation dance.
789 if (try_set_owner_from_raw(NO_OWNER, DEFLATER_MARKER) != NO_OWNER) {
790 // The owner field is no longer null so we lost the race since the
791 // ObjectMonitor is now busy.
792 return false;
793 }
794
795 if (contentions() > 0 || _waiters != 0) {
796 // Another thread has raced to enter the ObjectMonitor after
797 // is_busy() above or has already entered and waited on
798 // it which makes it busy so no deflation. Restore owner to
799 // null if it is still DEFLATER_MARKER.
800 if (try_set_owner_from_raw(DEFLATER_MARKER, NO_OWNER) != DEFLATER_MARKER) {
801 // Deferred decrement for the JT enter_internal() that cancelled the async deflation.
802 add_to_contentions(-1);
803 }
804 return false;
805 }
806
807 // Make a zero contentions field negative to force any contending threads
808 // to retry. This is the second part of the async deflation dance.
809 if (Atomic::cmpxchg(&_contentions, 0, INT_MIN) != 0) {
810 // Contentions was no longer 0 so we lost the race since the
811 // ObjectMonitor is now busy. Restore owner to null if it is
812 // still DEFLATER_MARKER:
813 if (try_set_owner_from_raw(DEFLATER_MARKER, NO_OWNER) != DEFLATER_MARKER) {
814 // Deferred decrement for the JT enter_internal() that cancelled the async deflation.
815 add_to_contentions(-1);
816 }
817 return false;
818 }
819 }
820
821 // Sanity checks for the races:
822 guarantee(owner_is_DEFLATER_MARKER(), "must be deflater marker");
823 guarantee(contentions() < 0, "must be negative: contentions=%d",
824 contentions());
825 guarantee(_waiters == 0, "must be 0: waiters=%d", _waiters);
826 ObjectWaiter* w = Atomic::load(&_entry_list);
827 guarantee(w == nullptr,
828 "must be no entering threads: entry_list=" INTPTR_FORMAT,
829 p2i(w));
830
831 if (obj != nullptr) {
832 if (log_is_enabled(Trace, monitorinflation)) {
833 ResourceMark rm;
834 log_trace(monitorinflation)("deflate_monitor: object=" INTPTR_FORMAT
835 ", mark=" INTPTR_FORMAT ", type='%s'",
836 p2i(obj), obj->mark().value(),
837 obj->klass()->external_name());
838 }
839 }
840
841 if (UseObjectMonitorTable) {
842 LightweightSynchronizer::deflate_monitor(current, obj, this);
843 } else if (obj != nullptr) {
844 // Install the old mark word if nobody else has already done it.
845 install_displaced_markword_in_object(obj);
846 }
847
848 if (event.should_commit()) {
849 post_monitor_deflate_event(&event, obj);
850 }
851
852 // We leave owner == DEFLATER_MARKER and contentions < 0
853 // to force any racing threads to retry.
854 return true; // Success, ObjectMonitor has been deflated.
855 }
856
857 // Install the displaced mark word (dmw) of a deflating ObjectMonitor
858 // into the header of the object associated with the monitor. This
859 // idempotent method is called by a thread that is deflating a
860 // monitor and by other threads that have detected a race with the
861 // deflation process.
862 void ObjectMonitor::install_displaced_markword_in_object(const oop obj) {
863 assert(!UseObjectMonitorTable, "ObjectMonitorTable has no dmw");
864 // This function must only be called when (owner == DEFLATER_MARKER
865 // && contentions <= 0), but we can't guarantee that here because
866 // those values could change when the ObjectMonitor gets moved from
867 // the global free list to a per-thread free list.
868
869 guarantee(obj != nullptr, "must be non-null");
870
871 // Separate loads in is_being_async_deflated(), which is almost always
872 // called before this function, from the load of dmw/header below.
873
874 // _contentions and dmw/header may get written by different threads.
875 // Make sure to observe them in the same order when having several observers.
876 OrderAccess::loadload_for_IRIW();
877
878 const oop l_object = object_peek();
879 if (l_object == nullptr) {
880 // ObjectMonitor's object ref has already been cleared by async
881 // deflation or GC so we're done here.
882 return;
883 }
884 assert(l_object == obj, "object=" INTPTR_FORMAT " must equal obj="
885 INTPTR_FORMAT, p2i(l_object), p2i(obj));
886
887 markWord dmw = header();
888 // The dmw has to be neutral (not null, not locked and not marked).
889 assert(dmw.is_neutral(), "must be neutral: dmw=" INTPTR_FORMAT, dmw.value());
890
891 // Install displaced mark word if the object's header still points
892 // to this ObjectMonitor. More than one racing caller to this function
893 // can rarely reach this point, but only one can win.
894 markWord res = obj->cas_set_mark(dmw, markWord::encode(this));
895 if (res != markWord::encode(this)) {
896 // This should be rare so log at the Info level when it happens.
897 log_info(monitorinflation)("install_displaced_markword_in_object: "
898 "failed cas_set_mark: new_mark=" INTPTR_FORMAT
899 ", old_mark=" INTPTR_FORMAT ", res=" INTPTR_FORMAT,
900 dmw.value(), markWord::encode(this).value(),
901 res.value());
902 }
903
904 // Note: It does not matter which thread restored the header/dmw
905 // into the object's header. The thread deflating the monitor just
906 // wanted the object's header restored and it is. The threads that
907 // detected a race with the deflation process also wanted the
908 // object's header restored before they retry their operation and
909 // because it is restored they will only retry once.
910 }
911
912 // Convert the fields used by is_busy() to a string that can be
913 // used for diagnostic output.
914 const char* ObjectMonitor::is_busy_to_string(stringStream* ss) {
915 ss->print("is_busy: waiters=%d"
916 ", contentions=%d"
917 ", owner=" INT64_FORMAT
918 ", entry_list=" PTR_FORMAT,
919 _waiters,
920 (contentions() > 0 ? contentions() : 0),
921 owner_is_DEFLATER_MARKER()
922 // We report null instead of DEFLATER_MARKER here because is_busy()
923 // ignores DEFLATER_MARKER values.
924 ? NO_OWNER
925 : owner_raw(),
926 p2i(_entry_list));
927 return ss->base();
928 }
929
930 void ObjectMonitor::enter_internal(JavaThread* current) {
931 assert(current->thread_state() == _thread_blocked, "invariant");
932
933 // Try the lock - TATAS
934 if (try_lock(current) == TryLockResult::Success) {
935 assert(!has_successor(current), "invariant");
936 assert(has_owner(current), "invariant");
937 return;
938 }
939
940 assert(InitDone, "Unexpectedly not initialized");
941
942 // We try one round of spinning *before* enqueueing current.
943 //
944 // If the _owner is ready but OFFPROC we could use a YieldTo()
945 // operation to donate the remainder of this thread's quantum
946 // to the owner. This has subtle but beneficial affinity
947 // effects.
948
949 if (try_spin(current)) {
950 assert(has_owner(current), "invariant");
951 assert(!has_successor(current), "invariant");
952 return;
953 }
954
955 // The Spin failed -- Enqueue and park the thread ...
956 assert(!has_successor(current), "invariant");
957 assert(!has_owner(current), "invariant");
958
959 // Enqueue "current" on ObjectMonitor's _entry_list.
960 //
961 // Node acts as a proxy for current.
962 // As an aside, if were to ever rewrite the synchronization code mostly
963 // in Java, WaitNodes, ObjectMonitors, and Events would become 1st-class
964 // Java objects. This would avoid awkward lifecycle and liveness issues,
965 // as well as eliminate a subset of ABA issues.
966 // TODO: eliminate ObjectWaiter and enqueue either Threads or Events.
967
968 ObjectWaiter node(current);
969 current->_ParkEvent->reset();
970
971 if (try_lock_or_add_to_entry_list(current, &node)) {
972 return; // We got the lock.
973 }
974 // This thread is now added to the _entry_list.
975
976 // The lock might have been released while this thread was occupied queueing
977 // itself onto _entry_list. To close the race and avoid "stranding" and
978 // progress-liveness failure we must resample-retry _owner before parking.
979 // Note the Dekker/Lamport duality: ST _entry_list; MEMBAR; LD Owner.
980 // In this case the ST-MEMBAR is accomplished with CAS().
981 //
982 // TODO: Defer all thread state transitions until park-time.
983 // Since state transitions are heavy and inefficient we'd like
984 // to defer the state transitions until absolutely necessary,
985 // and in doing so avoid some transitions ...
986
987 // If there are unmounted virtual threads in the _entry_list do a timed-park
988 // instead to alleviate some deadlocks cases where one of them is picked as
989 // the successor but cannot run due to having run out of carriers. This can
990 // happen, for example, if this is a pinned virtual thread currently loading
991 // or initializining a class, and all other carriers have a pinned vthread
992 // waiting for said class to be loaded/initialized.
993 // Read counter *after* adding this thread to the _entry_list.
994 // Adding to _entry_list uses Atomic::cmpxchg() which already provides
995 // a fence that prevents this load from floating up previous store.
996 bool do_timed_parked = has_unmounted_vthreads();
997 static int MAX_RECHECK_INTERVAL = 1000;
998 int recheck_interval = 1;
999
1000 for (;;) {
1001
1002 if (try_lock(current) == TryLockResult::Success) {
1003 break;
1004 }
1005 assert(!has_owner(current), "invariant");
1006
1007 // park self
1008 if (do_timed_parked) {
1009 current->_ParkEvent->park((jlong) recheck_interval);
1010 // Increase the recheck_interval, but clamp the value.
1011 recheck_interval *= 8;
1012 if (recheck_interval > MAX_RECHECK_INTERVAL) {
1013 recheck_interval = MAX_RECHECK_INTERVAL;
1014 }
1015 } else {
1016 current->_ParkEvent->park();
1017 }
1018
1019 if (try_lock(current) == TryLockResult::Success) {
1020 break;
1021 }
1022
1023 // The lock is still contested.
1024
1025 // Assuming this is not a spurious wakeup we'll normally find _succ == current.
1026 // We can defer clearing _succ until after the spin completes
1027 // try_spin() must tolerate being called with _succ == current.
1028 // Try yet another round of adaptive spinning.
1029 if (try_spin(current)) {
1030 break;
1031 }
1032
1033 // We can find that we were unpark()ed and redesignated _succ while
1034 // we were spinning. That's harmless. If we iterate and call park(),
1035 // park() will consume the event and return immediately and we'll
1036 // just spin again. This pattern can repeat, leaving _succ to simply
1037 // spin on a CPU.
1038
1039 if (has_successor(current)) clear_successor();
1040
1041 // Invariant: after clearing _succ a thread *must* retry _owner before parking.
1042 OrderAccess::fence();
1043 }
1044
1045 // Egress :
1046 // Current has acquired the lock -- Unlink current from the _entry_list.
1047 unlink_after_acquire(current, &node);
1048 if (has_successor(current)) {
1049 clear_successor();
1050 // Note that we don't need to do OrderAccess::fence() after clearing
1051 // _succ here, since we own the lock.
1052 }
1053
1054 // We've acquired ownership with CAS().
1055 // CAS is serializing -- it has MEMBAR/FENCE-equivalent semantics.
1056 // But since the CAS() this thread may have also stored into _succ
1057 // or entry_list. These meta-data updates must be visible __before
1058 // this thread subsequently drops the lock.
1059 // Consider what could occur if we didn't enforce this constraint --
1060 // STs to monitor meta-data and user-data could reorder with (become
1061 // visible after) the ST in exit that drops ownership of the lock.
1062 // Some other thread could then acquire the lock, but observe inconsistent
1063 // or old monitor meta-data and heap data. That violates the JMM.
1064 // To that end, the exit() operation must have at least STST|LDST
1065 // "release" barrier semantics. Specifically, there must be at least a
1066 // STST|LDST barrier in exit() before the ST of null into _owner that drops
1067 // the lock. The barrier ensures that changes to monitor meta-data and data
1068 // protected by the lock will be visible before we release the lock, and
1069 // therefore before some other thread (CPU) has a chance to acquire the lock.
1070 // See also: http://gee.cs.oswego.edu/dl/jmm/cookbook.html.
1071 //
1072 // Critically, any prior STs to _succ or entry_list must be visible before
1073 // the ST of null into _owner in the *subsequent* (following) corresponding
1074 // monitorexit.
1075
1076 return;
1077 }
1078
1079 // reenter_internal() is a specialized inline form of the latter half of the
1080 // contended slow-path from enter_internal(). We use reenter_internal() only for
1081 // monitor reentry in wait().
1082 //
1083 // In the future we should reconcile enter_internal() and reenter_internal().
1084
1085 void ObjectMonitor::reenter_internal(JavaThread* current, ObjectWaiter* currentNode) {
1086 assert(current != nullptr, "invariant");
1087 assert(current->thread_state() != _thread_blocked, "invariant");
1088 assert(currentNode != nullptr, "invariant");
1089 assert(currentNode->_thread == current, "invariant");
1090 assert(_waiters > 0, "invariant");
1091 assert_mark_word_consistency();
1092
1093 // If there are unmounted virtual threads in the _entry_list do a timed-park
1094 // instead to alleviate some deadlocks cases where one of them is picked as
1095 // the successor but cannot run due to having run out of carriers. This can
1096 // happen, for example, if this is a pinned virtual thread (or plain carrier)
1097 // waiting for a class to be initialized.
1098 // In theory we only get here in the "notification" case where the thread has
1099 // already been added to the _entry_list. But if the thread happened to be interrupted
1100 // at the same time it was being notified, we could have read a state of TS_ENTER
1101 // that led us here but the thread hasn't been added yet to the queue. In that
1102 // case getting a false value from has_unmounted_vthreads() is not a guarantee
1103 // that vthreads weren't added before this thread to the _entry_list. We will live
1104 // with this corner case not only because it would be very rare, but also because
1105 // if there are several carriers blocked in this same situation, this would only
1106 // happen for the first one notified.
1107 bool do_timed_parked = has_unmounted_vthreads();
1108 static int MAX_RECHECK_INTERVAL = 1000;
1109 int recheck_interval = 1;
1110
1111 for (;;) {
1112 ObjectWaiter::TStates v = currentNode->TState;
1113 guarantee(v == ObjectWaiter::TS_ENTER, "invariant");
1114 assert(!has_owner(current), "invariant");
1115
1116 // This thread has been notified so try to reacquire the lock.
1117 if (try_lock(current) == TryLockResult::Success) {
1118 break;
1119 }
1120
1121 // If that fails, spin again. Note that spin count may be zero so the above TryLock
1122 // is necessary.
1123 if (try_spin(current)) {
1124 break;
1125 }
1126
1127 {
1128 OSThreadContendState osts(current->osthread());
1129
1130 assert(current->thread_state() == _thread_in_vm, "invariant");
1131
1132 {
1133 ClearSuccOnSuspend csos(this);
1134 ThreadBlockInVMPreprocess<ClearSuccOnSuspend> tbivs(current, csos, true /* allow_suspend */);
1135 if (do_timed_parked) {
1136 current->_ParkEvent->park((jlong) recheck_interval);
1137 // Increase the recheck_interval, but clamp the value.
1138 recheck_interval *= 8;
1139 if (recheck_interval > MAX_RECHECK_INTERVAL) {
1140 recheck_interval = MAX_RECHECK_INTERVAL;
1141 }
1142 } else {
1143 current->_ParkEvent->park();
1144 }
1145 }
1146 }
1147
1148 // Try again, but just so we distinguish between futile wakeups and
1149 // successful wakeups. The following test isn't algorithmically
1150 // necessary, but it helps us maintain sensible statistics.
1151 if (try_lock(current) == TryLockResult::Success) {
1152 break;
1153 }
1154
1155 // The lock is still contested.
1156
1157 // Assuming this is not a spurious wakeup we'll normally
1158 // find that _succ == current.
1159 if (has_successor(current)) clear_successor();
1160
1161 // Invariant: after clearing _succ a contending thread
1162 // *must* retry _owner before parking.
1163 OrderAccess::fence();
1164 }
1165
1166 // Current has acquired the lock -- Unlink current from the _entry_list.
1167 assert(has_owner(current), "invariant");
1168 assert_mark_word_consistency();
1169 unlink_after_acquire(current, currentNode);
1170 if (has_successor(current)) clear_successor();
1171 assert(!has_successor(current), "invariant");
1172 currentNode->TState = ObjectWaiter::TS_RUN;
1173 OrderAccess::fence(); // see comments at the end of enter_internal()
1174 }
1175
1176 // This method is called from two places:
1177 // - On monitorenter contention with a null waiter.
1178 // - After Object.wait() times out or the target is interrupted to reenter the
1179 // monitor, with the existing waiter.
1180 // For the Object.wait() case we do not delete the ObjectWaiter in case we
1181 // succesfully acquire the monitor since we are going to need it on return.
1182 bool ObjectMonitor::vthread_monitor_enter(JavaThread* current, ObjectWaiter* waiter) {
1183 if (try_lock(current) == TryLockResult::Success) {
1184 assert(has_owner(current), "invariant");
1185 assert(!has_successor(current), "invariant");
1186 return true;
1187 }
1188
1189 oop vthread = current->vthread();
1190 ObjectWaiter* node = waiter != nullptr ? waiter : new ObjectWaiter(vthread, this);
1191
1192 // Increment counter *before* adding the vthread to the _entry_list.
1193 // Adding to _entry_list uses Atomic::cmpxchg() which already provides
1194 // a fence that prevents reordering of the stores.
1195 inc_unmounted_vthreads();
1196
1197 if (try_lock_or_add_to_entry_list(current, node)) {
1198 // We got the lock.
1199 if (waiter == nullptr) delete node; // for Object.wait() don't delete yet
1200 dec_unmounted_vthreads();
1201 return true;
1202 }
1203 // This thread is now added to the entry_list.
1204
1205 // We have to try once more since owner could have exited monitor and checked
1206 // _entry_list before we added the node to the queue.
1207 if (try_lock(current) == TryLockResult::Success) {
1208 assert(has_owner(current), "invariant");
1209 unlink_after_acquire(current, node);
1210 if (has_successor(current)) clear_successor();
1211 if (waiter == nullptr) delete node; // for Object.wait() don't delete yet
1212 dec_unmounted_vthreads();
1213 return true;
1214 }
1215
1216 assert(java_lang_VirtualThread::state(vthread) == java_lang_VirtualThread::RUNNING, "wrong state for vthread");
1217 java_lang_VirtualThread::set_state(vthread, java_lang_VirtualThread::BLOCKING);
1218
1219 // We didn't succeed in acquiring the monitor so increment _contentions and
1220 // save ObjectWaiter* in the vthread since we will need it when resuming execution.
1221 add_to_contentions(1);
1222 java_lang_VirtualThread::set_objectWaiter(vthread, node);
1223 return false;
1224 }
1225
1226 // Called from thaw code to resume the monitor operation that caused the vthread
1227 // to be unmounted. Method returns true if the monitor is successfully acquired,
1228 // which marks the end of the monitor operation, otherwise it returns false.
1229 bool ObjectMonitor::resume_operation(JavaThread* current, ObjectWaiter* node, ContinuationWrapper& cont) {
1230 assert(java_lang_VirtualThread::state(current->vthread()) == java_lang_VirtualThread::RUNNING, "wrong state for vthread");
1231 assert(!has_owner(current), "");
1232
1233 if (node->is_wait() && !node->at_reenter()) {
1234 bool acquired_monitor = vthread_wait_reenter(current, node, cont);
1235 if (acquired_monitor) return true;
1236 }
1237
1238 // Retry acquiring monitor...
1239
1240 int state = node->TState;
1241 guarantee(state == ObjectWaiter::TS_ENTER, "invariant");
1242
1243 if (try_lock(current) == TryLockResult::Success) {
1244 vthread_epilog(current, node);
1245 return true;
1246 }
1247
1248 oop vthread = current->vthread();
1249 if (has_successor(current)) clear_successor();
1250
1251 // Invariant: after clearing _succ a thread *must* retry acquiring the monitor.
1252 OrderAccess::fence();
1253
1254 if (try_lock(current) == TryLockResult::Success) {
1255 vthread_epilog(current, node);
1256 return true;
1257 }
1258
1259 // We will return to Continuation.run() and unmount so set the right state.
1260 java_lang_VirtualThread::set_state(vthread, java_lang_VirtualThread::BLOCKING);
1261
1262 return false;
1263 }
1264
1265 void ObjectMonitor::vthread_epilog(JavaThread* current, ObjectWaiter* node) {
1266 assert(has_owner(current), "invariant");
1267 add_to_contentions(-1);
1268 dec_unmounted_vthreads();
1269
1270 if (has_successor(current)) clear_successor();
1271
1272 guarantee(_recursions == 0, "invariant");
1273
1274 if (node->is_wait()) {
1275 _recursions = node->_recursions; // restore the old recursion count
1276 _waiters--; // decrement the number of waiters
1277
1278 if (node->_interrupted) {
1279 // We will throw at thaw end after finishing the mount transition.
1280 current->set_pending_interrupted_exception(true);
1281 }
1282 }
1283
1284 unlink_after_acquire(current, node);
1285 delete node;
1286
1287 // Clear the ObjectWaiter* from the vthread.
1288 java_lang_VirtualThread::set_objectWaiter(current->vthread(), nullptr);
1289
1290 if (JvmtiExport::should_post_monitor_contended_entered()) {
1291 // We are going to call thaw again after this and finish the VMTS
1292 // transition so no need to do it here. We will post the event there.
1293 current->set_contended_entered_monitor(this);
1294 }
1295 }
1296
1297 // Convert entry_list into a doubly linked list by assigning the prev
1298 // pointers and the entry_list_tail pointer (if needed). Within the
1299 // entry_list the next pointers always form a consistent singly linked
1300 // list. When this function is called, the entry_list will be either
1301 // singly linked, or starting as singly linked (at the head), but
1302 // ending as doubly linked (at the tail).
1303 void ObjectMonitor::entry_list_build_dll(JavaThread* current) {
1304 assert(has_owner(current), "invariant");
1305 ObjectWaiter* prev = nullptr;
1306 // Need acquire here to match the implicit release of the cmpxchg
1307 // that updated entry_list, so we can access w->prev().
1308 ObjectWaiter* w = Atomic::load_acquire(&_entry_list);
1309 assert(w != nullptr, "should only be called when entry list is not empty");
1310 while (w != nullptr) {
1311 assert(w->TState == ObjectWaiter::TS_ENTER, "invariant");
1312 assert(w->prev() == nullptr || w->prev() == prev, "invariant");
1313 if (w->prev() != nullptr) {
1314 break;
1315 }
1316 w->_prev = prev;
1317 prev = w;
1318 w = w->next();
1319 }
1320 if (w == nullptr) {
1321 // We converted the entire entry_list from a singly linked list
1322 // into a doubly linked list. Now we just need to set the tail
1323 // pointer.
1324 assert(prev != nullptr && prev->next() == nullptr, "invariant");
1325 assert(_entry_list_tail == nullptr || _entry_list_tail == prev, "invariant");
1326 _entry_list_tail = prev;
1327 } else {
1328 #ifdef ASSERT
1329 // We stopped iterating through the _entry_list when we found a
1330 // node that had its prev pointer set. I.e. we converted the first
1331 // part of the entry_list from a singly linked list into a doubly
1332 // linked list. Now we just want to make sure the rest of the list
1333 // is doubly linked. But first we check that we have a tail
1334 // pointer, because if the end of the entry_list is doubly linked
1335 // and we don't have the tail pointer, something is broken.
1336 assert(_entry_list_tail != nullptr, "invariant");
1337 while (w != nullptr) {
1338 assert(w->TState == ObjectWaiter::TS_ENTER, "invariant");
1339 assert(w->prev() == prev, "invariant");
1340 prev = w;
1341 w = w->next();
1342 }
1343 assert(_entry_list_tail == prev, "invariant");
1344 #endif
1345 }
1346 }
1347
1348 // Return the tail of the _entry_list. If the tail is currently not
1349 // known, it can be found by first calling entry_list_build_dll().
1350 ObjectWaiter* ObjectMonitor::entry_list_tail(JavaThread* current) {
1351 assert(has_owner(current), "invariant");
1352 ObjectWaiter* w = _entry_list_tail;
1353 if (w != nullptr) {
1354 return w;
1355 }
1356 entry_list_build_dll(current);
1357 w = _entry_list_tail;
1358 assert(w != nullptr, "invariant");
1359 return w;
1360 }
1361
1362 // By convention we unlink a contending thread from _entry_list
1363 // immediately after the thread acquires the lock in ::enter().
1364 // The head of _entry_list is volatile but the interior is stable.
1365 // In addition, current.TState is stable.
1366
1367 void ObjectMonitor::unlink_after_acquire(JavaThread* current, ObjectWaiter* currentNode) {
1368 assert(has_owner(current), "invariant");
1369 assert((!currentNode->is_vthread() && currentNode->thread() == current) ||
1370 (currentNode->is_vthread() && currentNode->vthread() == current->vthread()), "invariant");
1371
1372 // Check if we are unlinking the last element in the _entry_list.
1373 // This is by far the most common case.
1374 if (currentNode->next() == nullptr) {
1375 assert(_entry_list_tail == nullptr || _entry_list_tail == currentNode, "invariant");
1376
1377 ObjectWaiter* w = Atomic::load(&_entry_list);
1378 if (w == currentNode) {
1379 // The currentNode is the only element in _entry_list.
1380 if (Atomic::cmpxchg(&_entry_list, w, (ObjectWaiter*)nullptr) == w) {
1381 _entry_list_tail = nullptr;
1382 currentNode->set_bad_pointers();
1383 return;
1384 }
1385 // The CAS above can fail from interference IFF a contending
1386 // thread "pushed" itself onto entry_list. So fall-through to
1387 // building the doubly linked list.
1388 assert(currentNode->prev() == nullptr, "invariant");
1389 }
1390 if (currentNode->prev() == nullptr) {
1391 // Build the doubly linked list to get hold of
1392 // currentNode->prev().
1393 entry_list_build_dll(current);
1394 assert(currentNode->prev() != nullptr, "must be");
1395 assert(_entry_list_tail == currentNode, "must be");
1396 }
1397 // The currentNode is the last element in _entry_list and we know
1398 // which element is the previous one.
1399 assert(_entry_list != currentNode, "invariant");
1400 _entry_list_tail = currentNode->prev();
1401 _entry_list_tail->_next = nullptr;
1402 currentNode->set_bad_pointers();
1403 return;
1404 }
1405
1406 // If we get here it means the current thread enqueued itself on the
1407 // _entry_list but was then able to "steal" the lock before the
1408 // chosen successor was able to. Consequently currentNode must be an
1409 // interior node in the _entry_list, or the head.
1410 assert(currentNode->next() != nullptr, "invariant");
1411 assert(currentNode != _entry_list_tail, "invariant");
1412
1413 // Check if we are in the singly linked portion of the
1414 // _entry_list. If we are the head then we try to remove ourselves,
1415 // else we convert to the doubly linked list.
1416 if (currentNode->prev() == nullptr) {
1417 ObjectWaiter* w = Atomic::load(&_entry_list);
1418
1419 assert(w != nullptr, "invariant");
1420 if (w == currentNode) {
1421 ObjectWaiter* next = currentNode->next();
1422 // currentNode is at the head of _entry_list.
1423 if (Atomic::cmpxchg(&_entry_list, w, next) == w) {
1424 // The CAS above sucsessfully unlinked currentNode from the
1425 // head of the _entry_list.
1426 assert(_entry_list != w, "invariant");
1427 next->_prev = nullptr;
1428 currentNode->set_bad_pointers();
1429 return;
1430 } else {
1431 // The CAS above can fail from interference IFF a contending
1432 // thread "pushed" itself onto _entry_list, in which case
1433 // currentNode must now be in the interior of the
1434 // list. Fall-through to building the doubly linked list.
1435 assert(_entry_list != currentNode, "invariant");
1436 }
1437 }
1438 // Build the doubly linked list to get hold of currentNode->prev().
1439 entry_list_build_dll(current);
1440 assert(currentNode->prev() != nullptr, "must be");
1441 }
1442
1443 // We now know we are unlinking currentNode from the interior of a
1444 // doubly linked list.
1445 assert(currentNode->next() != nullptr, "");
1446 assert(currentNode->prev() != nullptr, "");
1447 assert(currentNode != _entry_list, "");
1448 assert(currentNode != _entry_list_tail, "");
1449
1450 ObjectWaiter* nxt = currentNode->next();
1451 ObjectWaiter* prv = currentNode->prev();
1452 assert(nxt->TState == ObjectWaiter::TS_ENTER, "invariant");
1453 assert(prv->TState == ObjectWaiter::TS_ENTER, "invariant");
1454
1455 nxt->_prev = prv;
1456 prv->_next = nxt;
1457 currentNode->set_bad_pointers();
1458 }
1459
1460 // -----------------------------------------------------------------------------
1461 // Exit support
1462 //
1463 // exit()
1464 // ~~~~~~
1465 // Note that the collector can't reclaim the objectMonitor or deflate
1466 // the object out from underneath the thread calling ::exit() as the
1467 // thread calling ::exit() never transitions to a stable state.
1468 // This inhibits GC, which in turn inhibits asynchronous (and
1469 // inopportune) reclamation of "this".
1470 //
1471 // We'd like to assert that: (THREAD->thread_state() != _thread_blocked) ;
1472 // There's one exception to the claim above, however. enter_internal() can call
1473 // exit() to drop a lock if the acquirer has been externally suspended.
1474 // In that case exit() is called with _thread_state == _thread_blocked,
1475 // but the monitor's _contentions field is > 0, which inhibits reclamation.
1476 //
1477 // This is the exit part of the locking protocol, often implemented in
1478 // C2_MacroAssembler::fast_unlock()
1479 //
1480 // 1. A release barrier ensures that changes to monitor meta-data
1481 // (_succ, _entry_list) and data protected by the lock will be
1482 // visible before we release the lock.
1483 // 2. Release the lock by clearing the owner.
1484 // 3. A storeload MEMBAR is needed between releasing the owner and
1485 // subsequently reading meta-data to safely determine if the lock is
1486 // contended (step 4) without an elected successor (step 5).
1487 // 4. If _entry_list is null, we are done, since there is no
1488 // other thread waiting on the lock to wake up. I.e. there is no
1489 // contention.
1490 // 5. If there is a successor (_succ is non-null), we are done. The
1491 // responsibility for guaranteeing progress-liveness has now implicitly
1492 // been moved from the exiting thread to the successor.
1493 // 6. There are waiters in the entry list (_entry_list is non-null),
1494 // but there is no successor (_succ is null), so we need to
1495 // wake up (unpark) a waiting thread to avoid stranding.
1496 //
1497 // Note that since only the current lock owner can manipulate the
1498 // _entry_list (except for pushing new threads to the head), we need to
1499 // reacquire the lock before we can wake up (unpark) a waiting thread.
1500 //
1501 // The CAS() in enter provides for safety and exclusion, while the
1502 // MEMBAR in exit provides for progress and avoids stranding.
1503 //
1504 // There is also the risk of a futile wake-up. If we drop the lock
1505 // another thread can reacquire the lock immediately, and we can
1506 // then wake a thread unnecessarily. This is benign, and we've
1507 // structured the code so the windows are short and the frequency
1508 // of such futile wakups is low.
1509
1510 void ObjectMonitor::exit(JavaThread* current, bool not_suspended) {
1511 if (!has_owner(current)) {
1512 // Apparent unbalanced locking ...
1513 // Naively we'd like to throw IllegalMonitorStateException.
1514 // As a practical matter we can neither allocate nor throw an
1515 // exception as ::exit() can be called from leaf routines.
1516 // see x86_32.ad Fast_Unlock() and the I1 and I2 properties.
1517 // Upon deeper reflection, however, in a properly run JVM the only
1518 // way we should encounter this situation is in the presence of
1519 // unbalanced JNI locking. TODO: CheckJNICalls.
1520 // See also: CR4414101
1521 #ifdef ASSERT
1522 LogStreamHandle(Error, monitorinflation) lsh;
1523 lsh.print_cr("ERROR: ObjectMonitor::exit(): thread=" INTPTR_FORMAT
1524 " is exiting an ObjectMonitor it does not own.", p2i(current));
1525 lsh.print_cr("The imbalance is possibly caused by JNI locking.");
1526 print_debug_style_on(&lsh);
1527 assert(false, "Non-balanced monitor enter/exit!");
1528 #endif
1529 return;
1530 }
1531
1532 if (_recursions != 0) {
1533 _recursions--; // this is simple recursive enter
1534 return;
1535 }
1536
1537 #if INCLUDE_JFR
1538 // get the owner's thread id for the MonitorEnter event
1539 // if it is enabled and the thread isn't suspended
1540 if (not_suspended && EventJavaMonitorEnter::is_enabled()) {
1541 _previous_owner_tid = JFR_THREAD_ID(current);
1542 }
1543 #endif
1544
1545 for (;;) {
1546 // If there is a successor we should release the lock as soon as
1547 // possible, so that the successor can acquire the lock. If there is
1548 // no successor, we might need to wake up a waiting thread.
1549 if (!has_successor()) {
1550 ObjectWaiter* w = Atomic::load(&_entry_list);
1551 if (w != nullptr) {
1552 // Other threads are blocked trying to acquire the lock and
1553 // there is no successor, so it appears that an heir-
1554 // presumptive (successor) must be made ready. Since threads
1555 // are woken up in FIFO order, we need to find the tail of the
1556 // entry_list.
1557 w = entry_list_tail(current);
1558 // I'd like to write: guarantee (w->_thread != current).
1559 // But in practice an exiting thread may find itself on the entry_list.
1560 // Let's say thread T1 calls O.wait(). Wait() enqueues T1 on O's waitset and
1561 // then calls exit(). Exit release the lock by setting O._owner to null.
1562 // Let's say T1 then stalls. T2 acquires O and calls O.notify(). The
1563 // notify() operation moves T1 from O's waitset to O's entry_list. T2 then
1564 // release the lock "O". T1 resumes immediately after the ST of null into
1565 // _owner, above. T1 notices that the entry_list is populated, so it
1566 // reacquires the lock and then finds itself on the entry_list.
1567 // Given all that, we have to tolerate the circumstance where "w" is
1568 // associated with current.
1569 assert(w->TState == ObjectWaiter::TS_ENTER, "invariant");
1570 exit_epilog(current, w);
1571 return;
1572 }
1573 }
1574
1575 // Drop the lock.
1576 // release semantics: prior loads and stores from within the critical section
1577 // must not float (reorder) past the following store that drops the lock.
1578 // Uses a storeload to separate release_store(owner) from the
1579 // successor check. The try_set_owner_from() below uses cmpxchg() so
1580 // we get the fence down there.
1581 release_clear_owner(current);
1582 OrderAccess::storeload();
1583
1584 // Normally the exiting thread is responsible for ensuring succession,
1585 // but if this thread observes other successors are ready or other
1586 // entering threads are spinning after it has stored null into _owner
1587 // then it can exit without waking a successor. The existence of
1588 // spinners or ready successors guarantees proper succession (liveness).
1589 // Responsibility passes to the ready or running successors. The exiting
1590 // thread delegates the duty. More precisely, if a successor already
1591 // exists this thread is absolved of the responsibility of waking
1592 // (unparking) one.
1593
1594 // The _succ variable is critical to reducing futile wakeup frequency.
1595 // _succ identifies the "heir presumptive" thread that has been made
1596 // ready (unparked) but that has not yet run. We need only one such
1597 // successor thread to guarantee progress.
1598 // See http://www.usenix.org/events/jvm01/full_papers/dice/dice.pdf
1599 // section 3.3 "Futile Wakeup Throttling" for details.
1600 //
1601 // Note that spinners in Enter() also set _succ non-null.
1602 // In the current implementation spinners opportunistically set
1603 // _succ so that exiting threads might avoid waking a successor.
1604 // Which means that the exiting thread could exit immediately without
1605 // waking a successor, if it observes a successor after it has dropped
1606 // the lock. Note that the dropped lock needs to become visible to the
1607 // spinner.
1608
1609 if (_entry_list == nullptr || has_successor()) {
1610 return;
1611 }
1612
1613 // Only the current lock owner can manipulate the entry_list
1614 // (except for pushing new threads to the head), therefore we need
1615 // to reacquire the lock. If we fail to reacquire the lock the
1616 // responsibility for ensuring succession falls to the new owner.
1617
1618 if (try_lock(current) != TryLockResult::Success) {
1619 // Some other thread acquired the lock (or the monitor was
1620 // deflated). Either way we are done.
1621 return;
1622 }
1623
1624 guarantee(has_owner(current), "invariant");
1625 }
1626 }
1627
1628 void ObjectMonitor::exit_epilog(JavaThread* current, ObjectWaiter* Wakee) {
1629 assert(has_owner(current), "invariant");
1630
1631 // Exit protocol:
1632 // 1. ST _succ = wakee
1633 // 2. membar #loadstore|#storestore;
1634 // 2. ST _owner = nullptr
1635 // 3. unpark(wakee)
1636
1637 oop vthread = nullptr;
1638 ParkEvent * Trigger;
1639 if (!Wakee->is_vthread()) {
1640 JavaThread* t = Wakee->thread();
1641 assert(t != nullptr, "");
1642 Trigger = t->_ParkEvent;
1643 set_successor(t);
1644 } else {
1645 vthread = Wakee->vthread();
1646 assert(vthread != nullptr, "");
1647 Trigger = ObjectMonitor::vthread_unparker_ParkEvent();
1648 set_successor(vthread);
1649 }
1650
1651 // Hygiene -- once we've set _owner = nullptr we can't safely dereference Wakee again.
1652 // The thread associated with Wakee may have grabbed the lock and "Wakee" may be
1653 // out-of-scope (non-extant).
1654 Wakee = nullptr;
1655
1656 // Drop the lock.
1657 // Uses a fence to separate release_store(owner) from the LD in unpark().
1658 release_clear_owner(current);
1659 OrderAccess::fence();
1660
1661 DTRACE_MONITOR_PROBE(contended__exit, this, object(), current);
1662
1663 if (vthread == nullptr) {
1664 // Platform thread case.
1665 Trigger->unpark();
1666 } else if (java_lang_VirtualThread::set_onWaitingList(vthread, vthread_list_head())) {
1667 // Virtual thread case.
1668 Trigger->unpark();
1669 }
1670 }
1671
1672 // Exits the monitor returning recursion count. _owner should
1673 // be set to current's owner_id, i.e. no ANONYMOUS_OWNER allowed.
1674 intx ObjectMonitor::complete_exit(JavaThread* current) {
1675 assert(InitDone, "Unexpectedly not initialized");
1676 guarantee(has_owner(current), "complete_exit not owner");
1677
1678 intx save = _recursions; // record the old recursion count
1679 _recursions = 0; // set the recursion level to be 0
1680 exit(current); // exit the monitor
1681 guarantee(!has_owner(current), "invariant");
1682 return save;
1683 }
1684
1685 // Checks that the current THREAD owns this monitor and causes an
1686 // immediate return if it doesn't. We don't use the CHECK macro
1687 // because we want the IMSE to be the only exception that is thrown
1688 // from the call site when false is returned. Any other pending
1689 // exception is ignored.
1690 #define CHECK_OWNER() \
1691 do { \
1692 if (!check_owner(THREAD)) { \
1693 assert(HAS_PENDING_EXCEPTION, "expected a pending IMSE here."); \
1694 return; \
1695 } \
1696 } while (false)
1697
1698 // Returns true if the specified thread owns the ObjectMonitor.
1699 // Otherwise returns false and throws IllegalMonitorStateException
1700 // (IMSE). If there is a pending exception and the specified thread
1701 // is not the owner, that exception will be replaced by the IMSE.
1702 bool ObjectMonitor::check_owner(TRAPS) {
1703 JavaThread* current = THREAD;
1704 int64_t cur = owner_raw();
1705 if (cur == owner_id_from(current)) {
1706 return true;
1707 }
1708 THROW_MSG_(vmSymbols::java_lang_IllegalMonitorStateException(),
1709 "current thread is not owner", false);
1710 }
1711
1712 static void post_monitor_wait_event(EventJavaMonitorWait* event,
1713 ObjectMonitor* monitor,
1714 uint64_t notifier_tid,
1715 jlong timeout,
1716 bool timedout) {
1717 assert(event != nullptr, "invariant");
1718 assert(monitor != nullptr, "invariant");
1719 const Klass* monitor_klass = monitor->object()->klass();
1720 if (ObjectMonitor::is_jfr_excluded(monitor_klass)) {
1721 return;
1722 }
1723 event->set_monitorClass(monitor_klass);
1724 event->set_timeout(timeout);
1725 // Set an address that is 'unique enough', such that events close in
1726 // time and with the same address are likely (but not guaranteed) to
1727 // belong to the same object.
1728 event->set_address((uintptr_t)monitor);
1729 event->set_notifier(notifier_tid);
1730 event->set_timedOut(timedout);
1731 event->commit();
1732 }
1733
1734 static void vthread_monitor_waited_event(JavaThread* current, ObjectWaiter* node, ContinuationWrapper& cont, EventJavaMonitorWait* event, jboolean timed_out) {
1735 // Since we might safepoint set the anchor so that the stack can we walked.
1736 assert(current->last_continuation() != nullptr, "");
1737 JavaFrameAnchor* anchor = current->frame_anchor();
1738 anchor->set_last_Java_sp(current->last_continuation()->entry_sp());
1739 anchor->set_last_Java_pc(current->last_continuation()->entry_pc());
1740
1741 ContinuationWrapper::SafepointOp so(current, cont);
1742
1743 JRT_BLOCK
1744 if (event->should_commit()) {
1745 long timeout = java_lang_VirtualThread::timeout(current->vthread());
1746 post_monitor_wait_event(event, node->_monitor, node->_notifier_tid, timeout, timed_out);
1747 }
1748 if (JvmtiExport::should_post_monitor_waited()) {
1749 // We mark this call in case of an upcall to Java while posting the event.
1750 // If somebody walks the stack in that case, processing the enterSpecial
1751 // frame should not include processing callee arguments since there is no
1752 // actual callee (see nmethod::preserve_callee_argument_oops()).
1753 ThreadOnMonitorWaitedEvent tmwe(current);
1754 JvmtiExport::vthread_post_monitor_waited(current, node->_monitor, timed_out);
1755 }
1756 JRT_BLOCK_END
1757 current->frame_anchor()->clear();
1758 }
1759
1760 // -----------------------------------------------------------------------------
1761 // Wait/Notify/NotifyAll
1762 //
1763 // Note: a subset of changes to ObjectMonitor::wait()
1764 // will need to be replicated in complete_exit
1765 void ObjectMonitor::wait(jlong millis, bool interruptible, TRAPS) {
1766 JavaThread* current = THREAD;
1767
1768 assert(InitDone, "Unexpectedly not initialized");
1769
1770 CHECK_OWNER(); // Throws IMSE if not owner.
1771
1772 EventJavaMonitorWait wait_event;
1773 EventVirtualThreadPinned vthread_pinned_event;
1774
1775 // check for a pending interrupt
1776 if (interruptible && current->is_interrupted(true) && !HAS_PENDING_EXCEPTION) {
1777 JavaThreadInObjectWaitState jtiows(current, millis != 0, interruptible);
1778
1779 if (JvmtiExport::should_post_monitor_wait()) {
1780 JvmtiExport::post_monitor_wait(current, object(), millis);
1781 }
1782 // post monitor waited event. Note that this is past-tense, we are done waiting.
1783 if (JvmtiExport::should_post_monitor_waited()) {
1784 // Note: 'false' parameter is passed here because the
1785 // wait was not timed out due to thread interrupt.
1786 JvmtiExport::post_monitor_waited(current, this, false);
1787
1788 // In this short circuit of the monitor wait protocol, the
1789 // current thread never drops ownership of the monitor and
1790 // never gets added to the wait queue so the current thread
1791 // cannot be made the successor. This means that the
1792 // JVMTI_EVENT_MONITOR_WAITED event handler cannot accidentally
1793 // consume an unpark() meant for the ParkEvent associated with
1794 // this ObjectMonitor.
1795 }
1796 if (wait_event.should_commit()) {
1797 post_monitor_wait_event(&wait_event, this, 0, millis, false);
1798 }
1799 THROW(vmSymbols::java_lang_InterruptedException());
1800 return;
1801 }
1802
1803 freeze_result result;
1804 ContinuationEntry* ce = current->last_continuation();
1805 bool is_virtual = ce != nullptr && ce->is_virtual_thread();
1806 if (is_virtual) {
1807 if (interruptible && JvmtiExport::should_post_monitor_wait()) {
1808 JvmtiExport::post_monitor_wait(current, object(), millis);
1809 }
1810 current->set_current_waiting_monitor(this);
1811 result = Continuation::try_preempt(current, ce->cont_oop(current));
1812 if (result == freeze_ok) {
1813 vthread_wait(current, millis, interruptible);
1814 current->set_current_waiting_monitor(nullptr);
1815 return;
1816 }
1817 }
1818 // The jtiows does nothing for non-interruptible.
1819 JavaThreadInObjectWaitState jtiows(current, millis != 0, interruptible);
1820
1821 if (!is_virtual) { // it was already set for virtual thread
1822 if (interruptible && JvmtiExport::should_post_monitor_wait()) {
1823 JvmtiExport::post_monitor_wait(current, object(), millis);
1824
1825 // The current thread already owns the monitor and it has not yet
1826 // been added to the wait queue so the current thread cannot be
1827 // made the successor. This means that the JVMTI_EVENT_MONITOR_WAIT
1828 // event handler cannot accidentally consume an unpark() meant for
1829 // the ParkEvent associated with this ObjectMonitor.
1830 }
1831 current->set_current_waiting_monitor(this);
1832 }
1833 // create a node to be put into the queue
1834 // Critically, after we reset() the event but prior to park(), we must check
1835 // for a pending interrupt.
1836 ObjectWaiter node(current);
1837 node.TState = ObjectWaiter::TS_WAIT;
1838 current->_ParkEvent->reset();
1839 OrderAccess::fence(); // ST into Event; membar ; LD interrupted-flag
1840
1841 // Enter the waiting queue, which is a circular doubly linked list in this case
1842 // but it could be a priority queue or any data structure.
1843 // _wait_set_lock protects the wait queue. Normally the wait queue is accessed only
1844 // by the owner of the monitor *except* in the case where park()
1845 // returns because of a timeout of interrupt. Contention is exceptionally rare
1846 // so we use a simple spin-lock instead of a heavier-weight blocking lock.
1847
1848 Thread::SpinAcquire(&_wait_set_lock);
1849 add_waiter(&node);
1850 Thread::SpinRelease(&_wait_set_lock);
1851
1852 intx save = _recursions; // record the old recursion count
1853 _waiters++; // increment the number of waiters
1854 _recursions = 0; // set the recursion level to be 1
1855 exit(current); // exit the monitor
1856 guarantee(!has_owner(current), "invariant");
1857
1858 // The thread is on the wait_set list - now park() it.
1859 // On MP systems it's conceivable that a brief spin before we park
1860 // could be profitable.
1861 //
1862 // TODO-FIXME: change the following logic to a loop of the form
1863 // while (!timeout && !interrupted && _notified == 0) park()
1864
1865 int ret = OS_OK;
1866 int WasNotified = 0;
1867
1868 // Need to check interrupt state whilst still _thread_in_vm
1869 bool interrupted = interruptible && current->is_interrupted(false);
1870
1871 { // State transition wrappers
1872 OSThread* osthread = current->osthread();
1873 OSThreadWaitState osts(osthread, true);
1874
1875 assert(current->thread_state() == _thread_in_vm, "invariant");
1876
1877 {
1878 ClearSuccOnSuspend csos(this);
1879 ThreadBlockInVMPreprocess<ClearSuccOnSuspend> tbivs(current, csos, true /* allow_suspend */);
1880 if (interrupted || HAS_PENDING_EXCEPTION) {
1881 // Intentionally empty
1882 } else if (!node._notified) {
1883 if (millis <= 0) {
1884 current->_ParkEvent->park();
1885 } else {
1886 ret = current->_ParkEvent->park(millis);
1887 }
1888 }
1889 }
1890
1891 // Node may be on the wait_set, or on the entry_list, or in transition
1892 // from the wait_set to the entry_list.
1893 // See if we need to remove Node from the wait_set.
1894 // We use double-checked locking to avoid grabbing _wait_set_lock
1895 // if the thread is not on the wait queue.
1896 //
1897 // Note that we don't need a fence before the fetch of TState.
1898 // In the worst case we'll fetch a old-stale value of TS_WAIT previously
1899 // written by the is thread. (perhaps the fetch might even be satisfied
1900 // by a look-aside into the processor's own store buffer, although given
1901 // the length of the code path between the prior ST and this load that's
1902 // highly unlikely). If the following LD fetches a stale TS_WAIT value
1903 // then we'll acquire the lock and then re-fetch a fresh TState value.
1904 // That is, we fail toward safety.
1905
1906 if (node.TState == ObjectWaiter::TS_WAIT) {
1907 Thread::SpinAcquire(&_wait_set_lock);
1908 if (node.TState == ObjectWaiter::TS_WAIT) {
1909 dequeue_specific_waiter(&node); // unlink from wait_set
1910 assert(!node._notified, "invariant");
1911 node.TState = ObjectWaiter::TS_RUN;
1912 }
1913 Thread::SpinRelease(&_wait_set_lock);
1914 }
1915
1916 // The thread is now either on off-list (TS_RUN),
1917 // or on the entry_list (TS_ENTER).
1918 // The Node's TState variable is stable from the perspective of this thread.
1919 // No other threads will asynchronously modify TState.
1920 guarantee(node.TState != ObjectWaiter::TS_WAIT, "invariant");
1921 OrderAccess::loadload();
1922 if (has_successor(current)) clear_successor();
1923 WasNotified = node._notified;
1924
1925 // Reentry phase -- reacquire the monitor.
1926 // re-enter contended monitor after object.wait().
1927 // retain OBJECT_WAIT state until re-enter successfully completes
1928 // Thread state is thread_in_vm and oop access is again safe,
1929 // although the raw address of the object may have changed.
1930 // (Don't cache naked oops over safepoints, of course).
1931
1932 // post monitor waited event. Note that this is past-tense, we are done waiting.
1933 if (JvmtiExport::should_post_monitor_waited()) {
1934 JvmtiExport::post_monitor_waited(current, this, ret == OS_TIMEOUT);
1935
1936 if (node._notified && has_successor(current)) {
1937 // In this part of the monitor wait-notify-reenter protocol it
1938 // is possible (and normal) for another thread to do a fastpath
1939 // monitor enter-exit while this thread is still trying to get
1940 // to the reenter portion of the protocol.
1941 //
1942 // The ObjectMonitor was notified and the current thread is
1943 // the successor which also means that an unpark() has already
1944 // been done. The JVMTI_EVENT_MONITOR_WAITED event handler can
1945 // consume the unpark() that was done when the successor was
1946 // set because the same ParkEvent is shared between Java
1947 // monitors and JVM/TI RawMonitors (for now).
1948 //
1949 // We redo the unpark() to ensure forward progress, i.e., we
1950 // don't want all pending threads hanging (parked) with none
1951 // entering the unlocked monitor.
1952 current->_ParkEvent->unpark();
1953 }
1954 }
1955
1956 if (wait_event.should_commit()) {
1957 post_monitor_wait_event(&wait_event, this, node._notifier_tid, millis, ret == OS_TIMEOUT);
1958 }
1959
1960 OrderAccess::fence();
1961
1962 assert(!has_owner(current), "invariant");
1963 ObjectWaiter::TStates v = node.TState;
1964 if (v == ObjectWaiter::TS_RUN) {
1965 // We use the NoPreemptMark for the very rare case where the previous
1966 // preempt attempt failed due to OOM. The preempt on monitor contention
1967 // could succeed but we can't unmount now.
1968 NoPreemptMark npm(current);
1969 enter(current);
1970 } else {
1971 guarantee(v == ObjectWaiter::TS_ENTER, "invariant");
1972 reenter_internal(current, &node);
1973 node.wait_reenter_end(this);
1974 }
1975
1976 // current has reacquired the lock.
1977 // Lifecycle - the node representing current must not appear on any queues.
1978 // Node is about to go out-of-scope, but even if it were immortal we wouldn't
1979 // want residual elements associated with this thread left on any lists.
1980 guarantee(node.TState == ObjectWaiter::TS_RUN, "invariant");
1981 assert(has_owner(current), "invariant");
1982 assert(!has_successor(current), "invariant");
1983 } // OSThreadWaitState()
1984
1985 current->set_current_waiting_monitor(nullptr);
1986
1987 guarantee(_recursions == 0, "invariant");
1988 int relock_count = JvmtiDeferredUpdates::get_and_reset_relock_count_after_wait(current);
1989 _recursions = save // restore the old recursion count
1990 + relock_count; // increased by the deferred relock count
1991 current->inc_held_monitor_count(relock_count); // Deopt never entered these counts.
1992 _waiters--; // decrement the number of waiters
1993
1994 // Verify a few postconditions
1995 assert(has_owner(current), "invariant");
1996 assert(!has_successor(current), "invariant");
1997 assert_mark_word_consistency();
1998
1999 if (ce != nullptr && ce->is_virtual_thread()) {
2000 current->post_vthread_pinned_event(&vthread_pinned_event, "Object.wait", result);
2001 }
2002
2003 // check if the notification happened
2004 if (!WasNotified) {
2005 // no, it could be timeout or Thread.interrupt() or both
2006 // check for interrupt event, otherwise it is timeout
2007 if (interruptible && current->is_interrupted(true) && !HAS_PENDING_EXCEPTION) {
2008 THROW(vmSymbols::java_lang_InterruptedException());
2009 }
2010 }
2011
2012 // NOTE: Spurious wake up will be consider as timeout.
2013 // Monitor notify has precedence over thread interrupt.
2014 }
2015
2016 // Consider:
2017 // If the lock is cool (entry_list == null && succ == null) and we're on an MP system
2018 // then instead of transferring a thread from the wait_set to the entry_list
2019 // we might just dequeue a thread from the wait_set and directly unpark() it.
2020
2021 bool ObjectMonitor::notify_internal(JavaThread* current) {
2022 bool did_notify = false;
2023 Thread::SpinAcquire(&_wait_set_lock);
2024 ObjectWaiter* iterator = dequeue_waiter();
2025 if (iterator != nullptr) {
2026 guarantee(iterator->TState == ObjectWaiter::TS_WAIT, "invariant");
2027 guarantee(!iterator->_notified, "invariant");
2028
2029 if (iterator->is_vthread()) {
2030 oop vthread = iterator->vthread();
2031 java_lang_VirtualThread::set_notified(vthread, true);
2032 int old_state = java_lang_VirtualThread::state(vthread);
2033 // If state is not WAIT/TIMED_WAIT then target could still be on
2034 // unmount transition, or wait could have already timed-out or target
2035 // could have been interrupted. In the first case, the target itself
2036 // will set the state to BLOCKED at the end of the unmount transition.
2037 // In the other cases the target would have been already unblocked so
2038 // there is nothing to do.
2039 if (old_state == java_lang_VirtualThread::WAIT ||
2040 old_state == java_lang_VirtualThread::TIMED_WAIT) {
2041 java_lang_VirtualThread::cmpxchg_state(vthread, old_state, java_lang_VirtualThread::BLOCKED);
2042 }
2043 // Increment counter *before* adding the vthread to the _entry_list.
2044 // Adding to _entry_list uses Atomic::cmpxchg() which already provides
2045 // a fence that prevents reordering of the stores.
2046 inc_unmounted_vthreads();
2047 }
2048
2049 iterator->_notified = true;
2050 iterator->_notifier_tid = JFR_THREAD_ID(current);
2051 did_notify = true;
2052 add_to_entry_list(current, iterator);
2053
2054 // _wait_set_lock protects the wait queue, not the entry_list. We could
2055 // move the add-to-entry_list operation, above, outside the critical section
2056 // protected by _wait_set_lock. In practice that's not useful. With the
2057 // exception of wait() timeouts and interrupts the monitor owner
2058 // is the only thread that grabs _wait_set_lock. There's almost no contention
2059 // on _wait_set_lock so it's not profitable to reduce the length of the
2060 // critical section.
2061
2062 if (!iterator->is_vthread()) {
2063 iterator->wait_reenter_begin(this);
2064
2065 // Read counter *after* adding the thread to the _entry_list.
2066 // Adding to _entry_list uses Atomic::cmpxchg() which already provides
2067 // a fence that prevents this load from floating up previous store.
2068 if (has_unmounted_vthreads()) {
2069 // Wake up the thread to alleviate some deadlocks cases where the successor
2070 // that will be picked up when this thread releases the monitor is an unmounted
2071 // virtual thread that cannot run due to having run out of carriers. Upon waking
2072 // up, the thread will call reenter_internal() which will use time-park in case
2073 // there is contention and there are still vthreads in the _entry_list.
2074 JavaThread* t = iterator->thread();
2075 t->_ParkEvent->unpark();
2076 }
2077 }
2078 }
2079 Thread::SpinRelease(&_wait_set_lock);
2080 return did_notify;
2081 }
2082
2083 static void post_monitor_notify_event(EventJavaMonitorNotify* event,
2084 ObjectMonitor* monitor,
2085 int notified_count) {
2086 assert(event != nullptr, "invariant");
2087 assert(monitor != nullptr, "invariant");
2088 const Klass* monitor_klass = monitor->object()->klass();
2089 if (ObjectMonitor::is_jfr_excluded(monitor_klass)) {
2090 return;
2091 }
2092 event->set_monitorClass(monitor_klass);
2093 // Set an address that is 'unique enough', such that events close in
2094 // time and with the same address are likely (but not guaranteed) to
2095 // belong to the same object.
2096 event->set_address((uintptr_t)monitor);
2097 event->set_notifiedCount(notified_count);
2098 event->commit();
2099 }
2100
2101 // Consider: a not-uncommon synchronization bug is to use notify() when
2102 // notifyAll() is more appropriate, potentially resulting in stranded
2103 // threads; this is one example of a lost wakeup. A useful diagnostic
2104 // option is to force all notify() operations to behave as notifyAll().
2105 //
2106 // Note: We can also detect many such problems with a "minimum wait".
2107 // When the "minimum wait" is set to a small non-zero timeout value
2108 // and the program does not hang whereas it did absent "minimum wait",
2109 // that suggests a lost wakeup bug.
2110
2111 void ObjectMonitor::notify(TRAPS) {
2112 JavaThread* current = THREAD;
2113 CHECK_OWNER(); // Throws IMSE if not owner.
2114 if (_wait_set == nullptr) {
2115 return;
2116 }
2117
2118 quick_notify(current);
2119 }
2120
2121 void ObjectMonitor::quick_notify(JavaThread* current) {
2122 assert(has_owner(current), "Precondition");
2123
2124 EventJavaMonitorNotify event;
2125 DTRACE_MONITOR_PROBE(notify, this, object(), current);
2126 int tally = notify_internal(current) ? 1 : 0;
2127
2128 if ((tally > 0) && event.should_commit()) {
2129 post_monitor_notify_event(&event, this, /* notified_count = */ tally);
2130 }
2131 }
2132
2133 // notifyAll() transfers the waiters one-at-a-time from the waitset to
2134 // the entry_list. If the waitset is "ABCD" (where A was added first
2135 // and D last) and the entry_list is ->X->Y->Z. After a notifyAll()
2136 // the waitset will be empty and the entry_list will be
2137 // ->D->C->B->A->X->Y->Z, and the next choosen successor will be Z.
2138
2139 void ObjectMonitor::notifyAll(TRAPS) {
2140 JavaThread* current = THREAD;
2141 CHECK_OWNER(); // Throws IMSE if not owner.
2142 if (_wait_set == nullptr) {
2143 return;
2144 }
2145
2146 quick_notifyAll(current);
2147 }
2148
2149 void ObjectMonitor::quick_notifyAll(JavaThread* current) {
2150 assert(has_owner(current), "Precondition");
2151
2152 EventJavaMonitorNotify event;
2153 DTRACE_MONITOR_PROBE(notifyAll, this, object(), current);
2154 int tally = 0;
2155 while (_wait_set != nullptr) {
2156 if (notify_internal(current)) {
2157 tally++;
2158 }
2159 }
2160
2161 if ((tally > 0) && event.should_commit()) {
2162 post_monitor_notify_event(&event, this, /* notified_count = */ tally);
2163 }
2164 }
2165
2166 void ObjectMonitor::vthread_wait(JavaThread* current, jlong millis, bool interruptible) {
2167 oop vthread = current->vthread();
2168 ObjectWaiter* node = new ObjectWaiter(vthread, this);
2169 node->_is_wait = true;
2170 node->_interruptible = interruptible;
2171 node->TState = ObjectWaiter::TS_WAIT;
2172 java_lang_VirtualThread::set_notified(vthread, false); // Reset notified flag
2173 java_lang_VirtualThread::set_interruptible_wait(vthread, interruptible);
2174
2175 // Enter the waiting queue, which is a circular doubly linked list in this case
2176 // but it could be a priority queue or any data structure.
2177 // _wait_set_lock protects the wait queue. Normally the wait queue is accessed only
2178 // by the owner of the monitor *except* in the case where park()
2179 // returns because of a timeout or interrupt. Contention is exceptionally rare
2180 // so we use a simple spin-lock instead of a heavier-weight blocking lock.
2181
2182 Thread::SpinAcquire(&_wait_set_lock);
2183 add_waiter(node);
2184 Thread::SpinRelease(&_wait_set_lock);
2185
2186 node->_recursions = _recursions; // record the old recursion count
2187 _recursions = 0; // set the recursion level to be 0
2188 _waiters++; // increment the number of waiters
2189 exit(current); // exit the monitor
2190 guarantee(!has_owner(current), "invariant");
2191
2192 assert(java_lang_VirtualThread::state(vthread) == java_lang_VirtualThread::RUNNING, "wrong state for vthread");
2193 java_lang_VirtualThread::set_state(vthread, millis == 0 ? java_lang_VirtualThread::WAITING : java_lang_VirtualThread::TIMED_WAITING);
2194 java_lang_VirtualThread::set_timeout(vthread, millis);
2195
2196 // Save the ObjectWaiter* in the vthread since we will need it when resuming execution.
2197 java_lang_VirtualThread::set_objectWaiter(vthread, node);
2198 }
2199
2200 bool ObjectMonitor::vthread_wait_reenter(JavaThread* current, ObjectWaiter* node, ContinuationWrapper& cont) {
2201 // The first time we run after being preempted on Object.wait() we
2202 // need to check if we were interrupted or the wait timed-out, and
2203 // in that case remove ourselves from the _wait_set queue.
2204 if (node->TState == ObjectWaiter::TS_WAIT) {
2205 Thread::SpinAcquire(&_wait_set_lock);
2206 if (node->TState == ObjectWaiter::TS_WAIT) {
2207 dequeue_specific_waiter(node); // unlink from wait_set
2208 assert(!node->_notified, "invariant");
2209 node->TState = ObjectWaiter::TS_RUN;
2210 }
2211 Thread::SpinRelease(&_wait_set_lock);
2212 }
2213
2214 // If this was an interrupted case, set the _interrupted boolean so that
2215 // once we re-acquire the monitor we know if we need to throw IE or not.
2216 ObjectWaiter::TStates state = node->TState;
2217 bool was_notified = state == ObjectWaiter::TS_ENTER;
2218 assert(was_notified || state == ObjectWaiter::TS_RUN, "");
2219 node->_interrupted = node->_interruptible && !was_notified && current->is_interrupted(false);
2220
2221 // Post JFR and JVMTI events. If non-interruptible we are in
2222 // ObjectLocker case so we don't post anything.
2223 EventJavaMonitorWait wait_event;
2224 if (node->_interruptible && (wait_event.should_commit() || JvmtiExport::should_post_monitor_waited())) {
2225 vthread_monitor_waited_event(current, node, cont, &wait_event, !was_notified && !node->_interrupted);
2226 }
2227
2228 // Mark that we are at reenter so that we don't call this method again.
2229 node->_at_reenter = true;
2230
2231 if (!was_notified) {
2232 bool acquired = vthread_monitor_enter(current, node);
2233 if (acquired) {
2234 guarantee(_recursions == 0, "invariant");
2235 _recursions = node->_recursions; // restore the old recursion count
2236 _waiters--; // decrement the number of waiters
2237
2238 if (node->_interrupted) {
2239 // We will throw at thaw end after finishing the mount transition.
2240 current->set_pending_interrupted_exception(true);
2241 }
2242
2243 delete node;
2244 // Clear the ObjectWaiter* from the vthread.
2245 java_lang_VirtualThread::set_objectWaiter(current->vthread(), nullptr);
2246 return true;
2247 }
2248 } else {
2249 // Already moved to _entry_list by notifier, so just add to contentions.
2250 add_to_contentions(1);
2251 }
2252 return false;
2253 }
2254
2255 // -----------------------------------------------------------------------------
2256 // Adaptive Spinning Support
2257 //
2258 // Adaptive spin-then-block - rational spinning
2259 //
2260 // Note that we spin "globally" on _owner with a classic SMP-polite TATAS
2261 // algorithm.
2262 //
2263 // Broadly, we can fix the spin frequency -- that is, the % of contended lock
2264 // acquisition attempts where we opt to spin -- at 100% and vary the spin count
2265 // (duration) or we can fix the count at approximately the duration of
2266 // a context switch and vary the frequency. Of course we could also
2267 // vary both satisfying K == Frequency * Duration, where K is adaptive by monitor.
2268 // For a description of 'Adaptive spin-then-block mutual exclusion in
2269 // multi-threaded processing,' see U.S. Pat. No. 8046758.
2270 //
2271 // This implementation varies the duration "D", where D varies with
2272 // the success rate of recent spin attempts. (D is capped at approximately
2273 // length of a round-trip context switch). The success rate for recent
2274 // spin attempts is a good predictor of the success rate of future spin
2275 // attempts. The mechanism adapts automatically to varying critical
2276 // section length (lock modality), system load and degree of parallelism.
2277 // D is maintained per-monitor in _SpinDuration and is initialized
2278 // optimistically. Spin frequency is fixed at 100%.
2279 //
2280 // Note that _SpinDuration is volatile, but we update it without locks
2281 // or atomics. The code is designed so that _SpinDuration stays within
2282 // a reasonable range even in the presence of races. The arithmetic
2283 // operations on _SpinDuration are closed over the domain of legal values,
2284 // so at worst a race will install and older but still legal value.
2285 // At the very worst this introduces some apparent non-determinism.
2286 // We might spin when we shouldn't or vice-versa, but since the spin
2287 // count are relatively short, even in the worst case, the effect is harmless.
2288 //
2289 // Care must be taken that a low "D" value does not become an
2290 // an absorbing state. Transient spinning failures -- when spinning
2291 // is overall profitable -- should not cause the system to converge
2292 // on low "D" values. We want spinning to be stable and predictable
2293 // and fairly responsive to change and at the same time we don't want
2294 // it to oscillate, become metastable, be "too" non-deterministic,
2295 // or converge on or enter undesirable stable absorbing states.
2296 //
2297 // We implement a feedback-based control system -- using past behavior
2298 // to predict future behavior. We face two issues: (a) if the
2299 // input signal is random then the spin predictor won't provide optimal
2300 // results, and (b) if the signal frequency is too high then the control
2301 // system, which has some natural response lag, will "chase" the signal.
2302 // (b) can arise from multimodal lock hold times. Transient preemption
2303 // can also result in apparent bimodal lock hold times.
2304 // Although sub-optimal, neither condition is particularly harmful, as
2305 // in the worst-case we'll spin when we shouldn't or vice-versa.
2306 // The maximum spin duration is rather short so the failure modes aren't bad.
2307 // To be conservative, I've tuned the gain in system to bias toward
2308 // _not spinning. Relatedly, the system can sometimes enter a mode where it
2309 // "rings" or oscillates between spinning and not spinning. This happens
2310 // when spinning is just on the cusp of profitability, however, so the
2311 // situation is not dire. The state is benign -- there's no need to add
2312 // hysteresis control to damp the transition rate between spinning and
2313 // not spinning.
2314
2315 int ObjectMonitor::Knob_SpinLimit = 5000; // derived by an external tool
2316
2317 static int Knob_Bonus = 100; // spin success bonus
2318 static int Knob_Penalty = 200; // spin failure penalty
2319 static int Knob_Poverty = 1000;
2320 static int Knob_FixedSpin = 0;
2321 static int Knob_PreSpin = 10; // 20-100 likely better, but it's not better in my testing.
2322
2323 inline static int adjust_up(int spin_duration) {
2324 int x = spin_duration;
2325 if (x < ObjectMonitor::Knob_SpinLimit) {
2326 if (x < Knob_Poverty) {
2327 x = Knob_Poverty;
2328 }
2329 return x + Knob_Bonus;
2330 } else {
2331 return spin_duration;
2332 }
2333 }
2334
2335 inline static int adjust_down(int spin_duration) {
2336 // TODO: Use an AIMD-like policy to adjust _SpinDuration.
2337 // AIMD is globally stable.
2338 int x = spin_duration;
2339 if (x > 0) {
2340 // Consider an AIMD scheme like: x -= (x >> 3) + 100
2341 // This is globally sample and tends to damp the response.
2342 x -= Knob_Penalty;
2343 if (x < 0) { x = 0; }
2344 return x;
2345 } else {
2346 return spin_duration;
2347 }
2348 }
2349
2350 bool ObjectMonitor::short_fixed_spin(JavaThread* current, int spin_count, bool adapt) {
2351 for (int ctr = 0; ctr < spin_count; ctr++) {
2352 TryLockResult status = try_lock(current);
2353 if (status == TryLockResult::Success) {
2354 if (adapt) {
2355 _SpinDuration = adjust_up(_SpinDuration);
2356 }
2357 return true;
2358 } else if (status == TryLockResult::Interference) {
2359 break;
2360 }
2361 SpinPause();
2362 }
2363 return false;
2364 }
2365
2366 // Spinning: Fixed frequency (100%), vary duration
2367 bool ObjectMonitor::try_spin(JavaThread* current) {
2368
2369 // Dumb, brutal spin. Good for comparative measurements against adaptive spinning.
2370 int knob_fixed_spin = Knob_FixedSpin; // 0 (don't spin: default), 2000 good test
2371 if (knob_fixed_spin > 0) {
2372 return short_fixed_spin(current, knob_fixed_spin, false);
2373 }
2374
2375 // Admission control - verify preconditions for spinning
2376 //
2377 // We always spin a little bit, just to prevent _SpinDuration == 0 from
2378 // becoming an absorbing state. Put another way, we spin briefly to
2379 // sample, just in case the system load, parallelism, contention, or lock
2380 // modality changed.
2381
2382 int knob_pre_spin = Knob_PreSpin; // 10 (default), 100, 1000 or 2000
2383 if (short_fixed_spin(current, knob_pre_spin, true)) {
2384 return true;
2385 }
2386
2387 //
2388 // Consider the following alternative:
2389 // Periodically set _SpinDuration = _SpinLimit and try a long/full
2390 // spin attempt. "Periodically" might mean after a tally of
2391 // the # of failed spin attempts (or iterations) reaches some threshold.
2392 // This takes us into the realm of 1-out-of-N spinning, where we
2393 // hold the duration constant but vary the frequency.
2394
2395 int ctr = _SpinDuration;
2396 if (ctr <= 0) return false;
2397
2398 // We're good to spin ... spin ingress.
2399 // CONSIDER: use Prefetch::write() to avoid RTS->RTO upgrades
2400 // when preparing to LD...CAS _owner, etc and the CAS is likely
2401 // to succeed.
2402 if (!has_successor()) {
2403 set_successor(current);
2404 }
2405 int64_t prv = NO_OWNER;
2406
2407 // There are three ways to exit the following loop:
2408 // 1. A successful spin where this thread has acquired the lock.
2409 // 2. Spin failure with prejudice
2410 // 3. Spin failure without prejudice
2411
2412 while (--ctr >= 0) {
2413
2414 // Periodic polling -- Check for pending GC
2415 // Threads may spin while they're unsafe.
2416 // We don't want spinning threads to delay the JVM from reaching
2417 // a stop-the-world safepoint or to steal cycles from GC.
2418 // If we detect a pending safepoint we abort in order that
2419 // (a) this thread, if unsafe, doesn't delay the safepoint, and (b)
2420 // this thread, if safe, doesn't steal cycles from GC.
2421 // This is in keeping with the "no loitering in runtime" rule.
2422 // We periodically check to see if there's a safepoint pending.
2423 if ((ctr & 0xFF) == 0) {
2424 // Can't call SafepointMechanism::should_process() since that
2425 // might update the poll values and we could be in a thread_blocked
2426 // state here which is not allowed so just check the poll.
2427 if (SafepointMechanism::local_poll_armed(current)) {
2428 break;
2429 }
2430 SpinPause();
2431 }
2432
2433 // Probe _owner with TATAS
2434 // If this thread observes the monitor transition or flicker
2435 // from locked to unlocked to locked, then the odds that this
2436 // thread will acquire the lock in this spin attempt go down
2437 // considerably. The same argument applies if the CAS fails
2438 // or if we observe _owner change from one non-null value to
2439 // another non-null value. In such cases we might abort
2440 // the spin without prejudice or apply a "penalty" to the
2441 // spin count-down variable "ctr", reducing it by 100, say.
2442
2443 int64_t ox = owner_raw();
2444 if (ox == NO_OWNER) {
2445 ox = try_set_owner_from(NO_OWNER, current);
2446 if (ox == NO_OWNER) {
2447 // The CAS succeeded -- this thread acquired ownership
2448 // Take care of some bookkeeping to exit spin state.
2449 if (has_successor(current)) {
2450 clear_successor();
2451 }
2452
2453 // Increase _SpinDuration :
2454 // The spin was successful (profitable) so we tend toward
2455 // longer spin attempts in the future.
2456 // CONSIDER: factor "ctr" into the _SpinDuration adjustment.
2457 // If we acquired the lock early in the spin cycle it
2458 // makes sense to increase _SpinDuration proportionally.
2459 // Note that we don't clamp SpinDuration precisely at SpinLimit.
2460 _SpinDuration = adjust_up(_SpinDuration);
2461 return true;
2462 }
2463
2464 // The CAS failed ... we can take any of the following actions:
2465 // * penalize: ctr -= CASPenalty
2466 // * exit spin with prejudice -- abort without adapting spinner
2467 // * exit spin without prejudice.
2468 // * Since CAS is high-latency, retry again immediately.
2469 break;
2470 }
2471
2472 // Did lock ownership change hands ?
2473 if (ox != prv && prv != NO_OWNER) {
2474 break;
2475 }
2476 prv = ox;
2477
2478 if (!has_successor()) {
2479 set_successor(current);
2480 }
2481 }
2482
2483 // Spin failed with prejudice -- reduce _SpinDuration.
2484 if (ctr < 0) {
2485 _SpinDuration = adjust_down(_SpinDuration);
2486 }
2487
2488 if (has_successor(current)) {
2489 clear_successor();
2490 // Invariant: after setting succ=null a contending thread
2491 // must recheck-retry _owner before parking. This usually happens
2492 // in the normal usage of try_spin(), but it's safest
2493 // to make try_spin() as foolproof as possible.
2494 OrderAccess::fence();
2495 if (try_lock(current) == TryLockResult::Success) {
2496 return true;
2497 }
2498 }
2499
2500 return false;
2501 }
2502
2503
2504 // -----------------------------------------------------------------------------
2505 // wait_set management ...
2506
2507 ObjectWaiter::ObjectWaiter(JavaThread* current) {
2508 _next = nullptr;
2509 _prev = nullptr;
2510 _thread = current;
2511 _monitor = nullptr;
2512 _notifier_tid = 0;
2513 _recursions = 0;
2514 TState = TS_RUN;
2515 _notified = false;
2516 _is_wait = false;
2517 _at_reenter = false;
2518 _interrupted = false;
2519 _active = false;
2520 }
2521
2522 ObjectWaiter::ObjectWaiter(oop vthread, ObjectMonitor* mon) : ObjectWaiter(nullptr) {
2523 assert(oopDesc::is_oop(vthread), "");
2524 _vthread = OopHandle(JavaThread::thread_oop_storage(), vthread);
2525 _monitor = mon;
2526 }
2527
2528 ObjectWaiter::~ObjectWaiter() {
2529 if (is_vthread()) {
2530 assert(vthread() != nullptr, "");
2531 _vthread.release(JavaThread::thread_oop_storage());
2532 }
2533 }
2534
2535 oop ObjectWaiter::vthread() const {
2536 return _vthread.resolve();
2537 }
2538
2539 void ObjectWaiter::wait_reenter_begin(ObjectMonitor * const mon) {
2540 _active = JavaThreadBlockedOnMonitorEnterState::wait_reenter_begin(_thread, mon);
2541 }
2542
2543 void ObjectWaiter::wait_reenter_end(ObjectMonitor * const mon) {
2544 JavaThreadBlockedOnMonitorEnterState::wait_reenter_end(_thread, _active);
2545 }
2546
2547 inline void ObjectMonitor::add_waiter(ObjectWaiter* node) {
2548 assert(node != nullptr, "should not add null node");
2549 assert(node->_prev == nullptr, "node already in list");
2550 assert(node->_next == nullptr, "node already in list");
2551 // put node at end of queue (circular doubly linked list)
2552 if (_wait_set == nullptr) {
2553 _wait_set = node;
2554 node->_prev = node;
2555 node->_next = node;
2556 } else {
2557 ObjectWaiter* head = _wait_set;
2558 ObjectWaiter* tail = head->_prev;
2559 assert(tail->_next == head, "invariant check");
2560 tail->_next = node;
2561 head->_prev = node;
2562 node->_next = head;
2563 node->_prev = tail;
2564 }
2565 }
2566
2567 inline ObjectWaiter* ObjectMonitor::dequeue_waiter() {
2568 // dequeue the very first waiter
2569 ObjectWaiter* waiter = _wait_set;
2570 if (waiter) {
2571 dequeue_specific_waiter(waiter);
2572 }
2573 return waiter;
2574 }
2575
2576 inline void ObjectMonitor::dequeue_specific_waiter(ObjectWaiter* node) {
2577 assert(node != nullptr, "should not dequeue nullptr node");
2578 assert(node->_prev != nullptr, "node already removed from list");
2579 assert(node->_next != nullptr, "node already removed from list");
2580 // when the waiter has woken up because of interrupt,
2581 // timeout or other spurious wake-up, dequeue the
2582 // waiter from waiting list
2583 ObjectWaiter* next = node->_next;
2584 if (next == node) {
2585 assert(node->_prev == node, "invariant check");
2586 _wait_set = nullptr;
2587 } else {
2588 ObjectWaiter* prev = node->_prev;
2589 assert(prev->_next == node, "invariant check");
2590 assert(next->_prev == node, "invariant check");
2591 next->_prev = prev;
2592 prev->_next = next;
2593 if (_wait_set == node) {
2594 _wait_set = next;
2595 }
2596 }
2597 node->_next = nullptr;
2598 node->_prev = nullptr;
2599 }
2600
2601 // -----------------------------------------------------------------------------
2602
2603 // One-shot global initialization for the sync subsystem.
2604 // We could also defer initialization and initialize on-demand
2605 // the first time we call ObjectSynchronizer::inflate().
2606 // Initialization would be protected - like so many things - by
2607 // the MonitorCache_lock.
2608
2609 void ObjectMonitor::Initialize() {
2610 assert(!InitDone, "invariant");
2611
2612 if (!os::is_MP()) {
2613 Knob_SpinLimit = 0;
2614 Knob_PreSpin = 0;
2615 Knob_FixedSpin = -1;
2616 }
2617
2618 _oop_storage = OopStorageSet::create_weak("ObjectSynchronizer Weak", mtSynchronizer);
2619
2620 DEBUG_ONLY(InitDone = true;)
2621 }
2622
2623 // We can't call this during Initialize() because BarrierSet needs to be set.
2624 void ObjectMonitor::Initialize2() {
2625 _vthread_list_head = OopHandle(JavaThread::thread_oop_storage(), nullptr);
2626 _vthread_unparker_ParkEvent = ParkEvent::Allocate(nullptr);
2627 }
2628
2629 void ObjectMonitor::print_on(outputStream* st) const {
2630 // The minimal things to print for markWord printing, more can be added for debugging and logging.
2631 st->print("{contentions=0x%08x,waiters=0x%08x"
2632 ",recursions=%zd,owner=" INT64_FORMAT "}",
2633 contentions(), waiters(), recursions(),
2634 owner_raw());
2635 }
2636 void ObjectMonitor::print() const { print_on(tty); }
2637
2638 #ifdef ASSERT
2639 // Print the ObjectMonitor like a debugger would:
2640 //
2641 // (ObjectMonitor) 0x00007fdfb6012e40 = {
2642 // _metadata = 0x0000000000000001
2643 // _object = 0x000000070ff45fd0
2644 // _pad_buf0 = {
2645 // [0] = '\0'
2646 // ...
2647 // [43] = '\0'
2648 // }
2649 // _owner = 0x0000000000000000
2650 // _previous_owner_tid = 0
2651 // _pad_buf1 = {
2652 // [0] = '\0'
2653 // ...
2654 // [47] = '\0'
2655 // }
2656 // _next_om = 0x0000000000000000
2657 // _recursions = 0
2658 // _entry_list = 0x0000000000000000
2659 // _entry_list_tail = 0x0000000000000000
2660 // _succ = 0x0000000000000000
2661 // _SpinDuration = 5000
2662 // _contentions = 0
2663 // _wait_set = 0x0000700009756248
2664 // _waiters = 1
2665 // _wait_set_lock = 0
2666 // }
2667 //
2668 void ObjectMonitor::print_debug_style_on(outputStream* st) const {
2669 st->print_cr("(ObjectMonitor*) " INTPTR_FORMAT " = {", p2i(this));
2670 st->print_cr(" _metadata = " INTPTR_FORMAT, _metadata);
2671 st->print_cr(" _object = " INTPTR_FORMAT, p2i(object_peek()));
2672 st->print_cr(" _pad_buf0 = {");
2673 st->print_cr(" [0] = '\\0'");
2674 st->print_cr(" ...");
2675 st->print_cr(" [%d] = '\\0'", (int)sizeof(_pad_buf0) - 1);
2676 st->print_cr(" }");
2677 st->print_cr(" _owner = " INT64_FORMAT, owner_raw());
2678 st->print_cr(" _previous_owner_tid = " UINT64_FORMAT, _previous_owner_tid);
2679 st->print_cr(" _pad_buf1 = {");
2680 st->print_cr(" [0] = '\\0'");
2681 st->print_cr(" ...");
2682 st->print_cr(" [%d] = '\\0'", (int)sizeof(_pad_buf1) - 1);
2683 st->print_cr(" }");
2684 st->print_cr(" _next_om = " INTPTR_FORMAT, p2i(next_om()));
2685 st->print_cr(" _recursions = %zd", _recursions);
2686 st->print_cr(" _entry_list = " INTPTR_FORMAT, p2i(_entry_list));
2687 st->print_cr(" _entry_list_tail = " INTPTR_FORMAT, p2i(_entry_list_tail));
2688 st->print_cr(" _succ = " INT64_FORMAT, successor());
2689 st->print_cr(" _SpinDuration = %d", _SpinDuration);
2690 st->print_cr(" _contentions = %d", contentions());
2691 st->print_cr(" _unmounted_vthreads = " INT64_FORMAT, _unmounted_vthreads);
2692 st->print_cr(" _wait_set = " INTPTR_FORMAT, p2i(_wait_set));
2693 st->print_cr(" _waiters = %d", _waiters);
2694 st->print_cr(" _wait_set_lock = %d", _wait_set_lock);
2695 st->print_cr("}");
2696 }
2697 #endif