forked from ziglang/zig
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request ziglang#20268 from ziglang/keep-calm-and-continue-…
…panicking
- Loading branch information
Showing
4 changed files
with
108 additions
and
28 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,72 @@ | ||
//! A synchronization primitive enforcing atomic access to a shared region of | ||
//! code known as the "critical section". | ||
//! | ||
//! Equivalent to `std.Mutex` except it allows the same thread to obtain the | ||
//! lock multiple times. | ||
//! | ||
//! A recursive mutex is an abstraction layer on top of a regular mutex; | ||
//! therefore it is recommended to use instead `std.Mutex` unless there is a | ||
//! specific reason a recursive mutex is warranted. | ||
|
||
const std = @import("../../std.zig"); | ||
const Recursive = @This(); | ||
const Mutex = std.Thread.Mutex; | ||
const assert = std.debug.assert; | ||
|
||
mutex: Mutex, | ||
thread_id: std.Thread.Id, | ||
lock_count: usize, | ||
|
||
pub const init: Recursive = .{ | ||
.mutex = .{}, | ||
.thread_id = invalid_thread_id, | ||
.lock_count = 0, | ||
}; | ||
|
||
/// Acquires the `Mutex` without blocking the caller's thread. | ||
/// | ||
/// Returns `false` if the calling thread would have to block to acquire it. | ||
/// | ||
/// Otherwise, returns `true` and the caller should `unlock()` the Mutex to release it. | ||
pub fn tryLock(r: *Recursive) bool { | ||
const current_thread_id = std.Thread.getCurrentId(); | ||
if (@atomicLoad(std.Thread.Id, &r.thread_id, .unordered) != current_thread_id) { | ||
if (!r.mutex.tryLock()) return false; | ||
assert(r.lock_count == 0); | ||
@atomicStore(std.Thread.Id, &r.thread_id, current_thread_id, .unordered); | ||
} | ||
r.lock_count += 1; | ||
return true; | ||
} | ||
|
||
/// Acquires the `Mutex`, blocking the current thread while the mutex is | ||
/// already held by another thread. | ||
/// | ||
/// The `Mutex` can be held multiple times by the same thread. | ||
/// | ||
/// Once acquired, call `unlock` on the `Mutex` to release it, regardless | ||
/// of whether the lock was already held by the same thread. | ||
pub fn lock(r: *Recursive) void { | ||
const current_thread_id = std.Thread.getCurrentId(); | ||
if (@atomicLoad(std.Thread.Id, &r.thread_id, .unordered) != current_thread_id) { | ||
r.mutex.lock(); | ||
assert(r.lock_count == 0); | ||
@atomicStore(std.Thread.Id, &r.thread_id, current_thread_id, .unordered); | ||
} | ||
r.lock_count += 1; | ||
} | ||
|
||
/// Releases the `Mutex` which was previously acquired with `lock` or `tryLock`. | ||
/// | ||
/// It is undefined behavior to unlock from a different thread that it was | ||
/// locked from. | ||
pub fn unlock(r: *Recursive) void { | ||
r.lock_count -= 1; | ||
if (r.lock_count == 0) { | ||
@atomicStore(std.Thread.Id, &r.thread_id, invalid_thread_id, .unordered); | ||
r.mutex.unlock(); | ||
} | ||
} | ||
|
||
/// A value that does not alias any other thread id. | ||
const invalid_thread_id: std.Thread.Id = std.math.maxInt(std.Thread.Id); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters