1 /*
2 * Copyright (c) 1998, 2024, 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 #ifndef SHARE_RUNTIME_MUTEX_HPP
26 #define SHARE_RUNTIME_MUTEX_HPP
27
28 #include "memory/allocation.hpp"
29 #include "runtime/atomic.hpp"
30 #include "runtime/semaphore.hpp"
31
32 #if defined(LINUX) || defined(AIX) || defined(BSD)
33 # include "mutex_posix.hpp"
34 #else
35 # include OS_HEADER(mutex)
36 #endif
37
38
39 // A Mutex/Monitor is a simple wrapper around a native lock plus condition
40 // variable that supports lock ownership tracking, lock ranking for deadlock
41 // detection and coordinates with the safepoint protocol.
42
43 // Locking is non-recursive: if you try to lock a mutex you already own then you
44 // will get an assertion failure in a debug build (which should suffice to expose
45 // usage bugs). If you call try_lock on a mutex you already own it will return false.
46 // The underlying PlatformMutex may support recursive locking but this is not exposed
47 // and we account for that possibility in try_lock.
48
49 // A thread is not allowed to safepoint while holding a mutex whose rank
50 // is nosafepoint or lower.
51
52 class Mutex : public CHeapObj<mtSynchronizer> {
53
54 public:
55 // Special low level locks are given names and ranges avoid overlap.
56 enum class Rank {
57 event,
58 service = event + 6,
59 stackwatermark = service + 3,
60 tty = stackwatermark + 3,
61 oopstorage = tty + 3,
62 nosafepoint = oopstorage + 6,
63 safepoint = nosafepoint + 20
64 };
65
66 // want C++later "using enum" directives.
67 static const Rank event = Rank::event;
68 static const Rank service = Rank::service;
69 static const Rank stackwatermark = Rank::stackwatermark;
70 static const Rank tty = Rank::tty;
71 static const Rank oopstorage = Rank::oopstorage;
72 static const Rank nosafepoint = Rank::nosafepoint;
73 static const Rank safepoint = Rank::safepoint;
74
75 static void assert_no_overlap(Rank orig, Rank adjusted, int adjust);
76
77 friend Rank operator-(Rank base, int adjust) {
78 Rank result = static_cast<Rank>(static_cast<int>(base) - adjust);
79 DEBUG_ONLY(assert_no_overlap(base, result, adjust));
80 return result;
81 }
82
83 friend constexpr bool operator<(Rank lhs, Rank rhs) {
84 return static_cast<int>(lhs) < static_cast<int>(rhs);
85 }
86
87 friend constexpr bool operator>(Rank lhs, Rank rhs) { return rhs < lhs; }
88 friend constexpr bool operator<=(Rank lhs, Rank rhs) { return !(lhs > rhs); }
89 friend constexpr bool operator>=(Rank lhs, Rank rhs) { return !(lhs < rhs); }
90
91 private:
92 // The _owner field is only set by the current thread, either to itself after it has acquired
93 // the low-level _lock, or to null before it has released the _lock. Accesses by any thread other
94 // than the lock owner are inherently racy.
95 Thread* volatile _owner;
96 void raw_set_owner(Thread* new_owner) { Atomic::store(&_owner, new_owner); }
97
98 protected: // Monitor-Mutex metadata
99 PlatformMonitor _lock; // Native monitor implementation
100 const char* _name; // Name of mutex/monitor
101 int _id; // ID for named mutexes
102
103 // Debugging fields for naming, deadlock detection, etc. (some only used in debug mode)
104 #ifndef PRODUCT
105 bool _allow_vm_block;
106 #endif
107 #ifdef ASSERT
108 Rank _rank; // rank (to avoid/detect potential deadlocks)
109 Mutex* _next; // Used by a Thread to link up owned locks
110 Thread* _last_owner; // the last thread to own the lock
111 bool _skip_rank_check; // read only by owner when doing rank checks
112
113 static Mutex* get_least_ranked_lock(Mutex* locks);
114 Mutex* get_least_ranked_lock_besides_this(Mutex* locks);
115 bool skip_rank_check() {
116 assert(owned_by_self(), "only the owner should call this");
117 return _skip_rank_check;
118 }
119
120 public:
121 Rank rank() const { return _rank; }
122 const char* rank_name() const;
123 Mutex* next() const { return _next; }
124 #endif // ASSERT
125
126 protected:
127 void set_owner_implementation(Thread* owner) NOT_DEBUG({ raw_set_owner(owner);});
128 void check_block_state (Thread* thread) NOT_DEBUG_RETURN;
129 void check_safepoint_state (Thread* thread) NOT_DEBUG_RETURN;
130 void check_no_safepoint_state(Thread* thread) NOT_DEBUG_RETURN;
131 void check_rank (Thread* thread) NOT_DEBUG_RETURN;
132 void assert_owner (Thread* expected) NOT_DEBUG_RETURN;
133
134 public:
135 static const bool _allow_vm_block_flag = true;
136
137 // Locks can be acquired with or without a safepoint check. NonJavaThreads do not follow
138 // the safepoint protocol when acquiring locks.
139
140 // Each lock can be acquired by only JavaThreads, only NonJavaThreads, or shared between
141 // Java and NonJavaThreads. When the lock is initialized with rank > nosafepoint,
142 // that means that whenever the lock is acquired by a JavaThread, it will verify that
143 // it is done with a safepoint check. In corollary, when the lock is initialized with
144 // rank <= nosafepoint, that means that whenever the lock is acquired by a JavaThread
145 // it will verify that it is done without a safepoint check.
146
147 // TODO: Locks that are shared between JavaThreads and NonJavaThreads
148 // should never encounter a safepoint check while they are held, or else a
149 // deadlock can occur. We should check this by noting which
150 // locks are shared, and walk held locks during safepoint checking.
151
152 enum class SafepointCheckFlag {
153 _safepoint_check_flag,
154 _no_safepoint_check_flag
155 };
156 // Bring the enumerator names into class scope.
157 static const SafepointCheckFlag _safepoint_check_flag =
158 SafepointCheckFlag::_safepoint_check_flag;
159 static const SafepointCheckFlag _no_safepoint_check_flag =
160 SafepointCheckFlag::_no_safepoint_check_flag;
161
162 public:
163 Mutex(Rank rank, const char *name, bool allow_vm_block);
164
165 Mutex(Rank rank, const char *name) :
166 Mutex(rank, name, rank > nosafepoint ? false : true) {}
167
168 ~Mutex();
169
170 void lock(); // prints out warning if VM thread blocks
171 void lock(Thread *thread); // overloaded with current thread
172 void unlock();
173 bool is_locked() const { return owner() != nullptr; }
174
175 bool try_lock(); // Like lock(), but unblocking. It returns false instead
176 private:
177 void lock_contended(Thread *thread); // contended slow-path
178 bool try_lock_inner(bool do_rank_checks);
179 public:
180
181 void release_for_safepoint();
182
183 // Lock without safepoint check. Should ONLY be used by safepoint code and other code
184 // that is guaranteed not to block while running inside the VM.
185 void lock_without_safepoint_check();
186 void lock_without_safepoint_check(Thread* self);
187 // A thread should not call this if failure to acquire ownership will blocks its progress
188 bool try_lock_without_rank_check();
189
190 // Current owner - note not MT-safe. Can only be used to guarantee that
191 // the current running thread owns the lock
192 Thread* owner() const { return Atomic::load(&_owner); }
193 void set_owner(Thread* owner) { set_owner_implementation(owner); }
194 bool owned_by_self() const;
195
196 const char *name() const { return _name; }
197
198 int id() const { return _id; }
199 // void set_id(int id) { _id = id; }
200
201 static const char* id2name(int id);
202
203 void print_on_error(outputStream* st) const;
204 #ifndef PRODUCT
205 void print_on(outputStream* st) const;
206 void print() const;
207 #endif
208 };
209
210 class Monitor : public Mutex {
211 public:
212 Monitor(Rank rank, const char *name, bool allow_vm_block) :
213 Mutex(rank, name, allow_vm_block) {}
214
215 Monitor(Rank rank, const char *name) :
216 Mutex(rank, name) {}
217 // default destructor
218
219 // Wait until monitor is notified (or times out).
220 // Defaults are to make safepoint checks, wait time is forever (i.e.,
221 // zero). Returns true if wait times out; otherwise returns false.
222 bool wait(uint64_t timeout = 0);
223 bool wait_without_safepoint_check(uint64_t timeout = 0);
224 void notify();
225 void notify_all();
226 };
227
228
229 class PaddedMutex : public Mutex {
230 enum {
231 CACHE_LINE_PADDING = (int)DEFAULT_PADDING_SIZE - (int)sizeof(Mutex),
232 PADDING_LEN = CACHE_LINE_PADDING > 0 ? CACHE_LINE_PADDING : 1
233 };
234 char _padding[PADDING_LEN];
235 public:
236 PaddedMutex(Rank rank, const char *name, bool allow_vm_block) : Mutex(rank, name, allow_vm_block) {};
237 PaddedMutex(Rank rank, const char *name) : Mutex(rank, name) {};
238 };
239
240 class PaddedMonitor : public Monitor {
241 enum {
242 CACHE_LINE_PADDING = (int)DEFAULT_PADDING_SIZE - (int)sizeof(Monitor),
243 PADDING_LEN = CACHE_LINE_PADDING > 0 ? CACHE_LINE_PADDING : 1
244 };
245 char _padding[PADDING_LEN];
246 public:
247 PaddedMonitor(Rank rank, const char *name, bool allow_vm_block) : Monitor(rank, name, allow_vm_block) {};
248 PaddedMonitor(Rank rank, const char *name) : Monitor(rank, name) {};
249 };
250
251 // RecursiveMutex is a minimal implementation, and has no safety and rank checks that Mutex has.
252 // There are also no checks that the recursive lock is not held when going to Java or to JNI, like
253 // other JVM mutexes have. This should be used only for cases where the alternatives with all the
254 // nice safety features don't work.
255 // Waiting on the RecursiveMutex partipates in the safepoint protocol if the current thread is a Java thread,
256 // (ie. waiting sets JavaThread to blocked)
257 class RecursiveMutex : public CHeapObj<mtThread> {
258 Semaphore _sem;
259 Thread* _owner;
260 int _recursions;
261
262 NONCOPYABLE(RecursiveMutex);
263 public:
264 RecursiveMutex();
265 void lock(Thread* current);
266 void unlock(Thread* current);
267 // For use in asserts
268 bool holds_lock(Thread* current) { return _owner == current; }
269 };
270
271 #endif // SHARE_RUNTIME_MUTEX_HPP