mirror of
https://github.com/ziglang/zig.git
synced 2025-12-06 14:23:09 +00:00
382 lines
11 KiB
Zig
382 lines
11 KiB
Zig
//! A lock that supports one writer or many readers.
|
|
//! This API is for kernel threads, not evented I/O.
|
|
//! This API requires being initialized at runtime, and initialization
|
|
//! can fail. Once initialized, the core operations cannot fail.
|
|
|
|
impl: Impl = .{},
|
|
|
|
const RwLock = @This();
|
|
const std = @import("../std.zig");
|
|
const builtin = @import("builtin");
|
|
const assert = std.debug.assert;
|
|
const testing = std.testing;
|
|
|
|
pub const Impl = if (builtin.single_threaded)
|
|
SingleThreadedRwLock
|
|
else if (std.Thread.use_pthreads)
|
|
PthreadRwLock
|
|
else
|
|
DefaultRwLock;
|
|
|
|
/// Attempts to obtain exclusive lock ownership.
|
|
/// Returns `true` if the lock is obtained, `false` otherwise.
|
|
pub fn tryLock(rwl: *RwLock) bool {
|
|
return rwl.impl.tryLock();
|
|
}
|
|
|
|
/// Blocks until exclusive lock ownership is acquired.
|
|
pub fn lock(rwl: *RwLock) void {
|
|
return rwl.impl.lock();
|
|
}
|
|
|
|
/// Releases a held exclusive lock.
|
|
/// Asserts the lock is held exclusively.
|
|
pub fn unlock(rwl: *RwLock) void {
|
|
return rwl.impl.unlock();
|
|
}
|
|
|
|
/// Attempts to obtain shared lock ownership.
|
|
/// Returns `true` if the lock is obtained, `false` otherwise.
|
|
pub fn tryLockShared(rwl: *RwLock) bool {
|
|
return rwl.impl.tryLockShared();
|
|
}
|
|
|
|
/// Blocks until shared lock ownership is acquired.
|
|
pub fn lockShared(rwl: *RwLock) void {
|
|
return rwl.impl.lockShared();
|
|
}
|
|
|
|
/// Releases a held shared lock.
|
|
pub fn unlockShared(rwl: *RwLock) void {
|
|
return rwl.impl.unlockShared();
|
|
}
|
|
|
|
/// Single-threaded applications use this for deadlock checks in
|
|
/// debug mode, and no-ops in release modes.
|
|
pub const SingleThreadedRwLock = struct {
|
|
state: enum { unlocked, locked_exclusive, locked_shared } = .unlocked,
|
|
shared_count: usize = 0,
|
|
|
|
/// Attempts to obtain exclusive lock ownership.
|
|
/// Returns `true` if the lock is obtained, `false` otherwise.
|
|
pub fn tryLock(rwl: *SingleThreadedRwLock) bool {
|
|
switch (rwl.state) {
|
|
.unlocked => {
|
|
assert(rwl.shared_count == 0);
|
|
rwl.state = .locked_exclusive;
|
|
return true;
|
|
},
|
|
.locked_exclusive, .locked_shared => return false,
|
|
}
|
|
}
|
|
|
|
/// Blocks until exclusive lock ownership is acquired.
|
|
pub fn lock(rwl: *SingleThreadedRwLock) void {
|
|
assert(rwl.state == .unlocked); // deadlock detected
|
|
assert(rwl.shared_count == 0); // corrupted state detected
|
|
rwl.state = .locked_exclusive;
|
|
}
|
|
|
|
/// Releases a held exclusive lock.
|
|
/// Asserts the lock is held exclusively.
|
|
pub fn unlock(rwl: *SingleThreadedRwLock) void {
|
|
assert(rwl.state == .locked_exclusive);
|
|
assert(rwl.shared_count == 0); // corrupted state detected
|
|
rwl.state = .unlocked;
|
|
}
|
|
|
|
/// Attempts to obtain shared lock ownership.
|
|
/// Returns `true` if the lock is obtained, `false` otherwise.
|
|
pub fn tryLockShared(rwl: *SingleThreadedRwLock) bool {
|
|
switch (rwl.state) {
|
|
.unlocked => {
|
|
rwl.state = .locked_shared;
|
|
assert(rwl.shared_count == 0);
|
|
rwl.shared_count = 1;
|
|
return true;
|
|
},
|
|
.locked_shared => {
|
|
rwl.shared_count += 1;
|
|
return true;
|
|
},
|
|
.locked_exclusive => return false,
|
|
}
|
|
}
|
|
|
|
/// Blocks until shared lock ownership is acquired.
|
|
pub fn lockShared(rwl: *SingleThreadedRwLock) void {
|
|
switch (rwl.state) {
|
|
.unlocked => {
|
|
rwl.state = .locked_shared;
|
|
assert(rwl.shared_count == 0);
|
|
rwl.shared_count = 1;
|
|
},
|
|
.locked_shared => {
|
|
rwl.shared_count += 1;
|
|
},
|
|
.locked_exclusive => unreachable, // deadlock detected
|
|
}
|
|
}
|
|
|
|
/// Releases a held shared lock.
|
|
pub fn unlockShared(rwl: *SingleThreadedRwLock) void {
|
|
switch (rwl.state) {
|
|
.unlocked => unreachable, // too many calls to `unlockShared`
|
|
.locked_exclusive => unreachable, // exclusively held lock
|
|
.locked_shared => {
|
|
rwl.shared_count -= 1;
|
|
if (rwl.shared_count == 0) {
|
|
rwl.state = .unlocked;
|
|
}
|
|
},
|
|
}
|
|
}
|
|
};
|
|
|
|
pub const PthreadRwLock = struct {
|
|
rwlock: std.c.pthread_rwlock_t = .{},
|
|
|
|
pub fn tryLock(rwl: *PthreadRwLock) bool {
|
|
return std.c.pthread_rwlock_trywrlock(&rwl.rwlock) == .SUCCESS;
|
|
}
|
|
|
|
pub fn lock(rwl: *PthreadRwLock) void {
|
|
const rc = std.c.pthread_rwlock_wrlock(&rwl.rwlock);
|
|
assert(rc == .SUCCESS);
|
|
}
|
|
|
|
pub fn unlock(rwl: *PthreadRwLock) void {
|
|
const rc = std.c.pthread_rwlock_unlock(&rwl.rwlock);
|
|
assert(rc == .SUCCESS);
|
|
}
|
|
|
|
pub fn tryLockShared(rwl: *PthreadRwLock) bool {
|
|
return std.c.pthread_rwlock_tryrdlock(&rwl.rwlock) == .SUCCESS;
|
|
}
|
|
|
|
pub fn lockShared(rwl: *PthreadRwLock) void {
|
|
const rc = std.c.pthread_rwlock_rdlock(&rwl.rwlock);
|
|
assert(rc == .SUCCESS);
|
|
}
|
|
|
|
pub fn unlockShared(rwl: *PthreadRwLock) void {
|
|
const rc = std.c.pthread_rwlock_unlock(&rwl.rwlock);
|
|
assert(rc == .SUCCESS);
|
|
}
|
|
};
|
|
|
|
pub const DefaultRwLock = struct {
|
|
state: usize = 0,
|
|
mutex: std.Thread.Mutex = .{},
|
|
semaphore: std.Thread.Semaphore = .{},
|
|
|
|
const IS_WRITING: usize = 1;
|
|
const WRITER: usize = 1 << 1;
|
|
const READER: usize = 1 << (1 + @bitSizeOf(Count));
|
|
const WRITER_MASK: usize = std.math.maxInt(Count) << @ctz(WRITER);
|
|
const READER_MASK: usize = std.math.maxInt(Count) << @ctz(READER);
|
|
const Count = std.meta.Int(.unsigned, @divFloor(@bitSizeOf(usize) - 1, 2));
|
|
|
|
pub fn tryLock(rwl: *DefaultRwLock) bool {
|
|
if (rwl.mutex.tryLock()) {
|
|
const state = @atomicLoad(usize, &rwl.state, .SeqCst);
|
|
if (state & READER_MASK == 0) {
|
|
_ = @atomicRmw(usize, &rwl.state, .Or, IS_WRITING, .SeqCst);
|
|
return true;
|
|
}
|
|
|
|
rwl.mutex.unlock();
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
pub fn lock(rwl: *DefaultRwLock) void {
|
|
_ = @atomicRmw(usize, &rwl.state, .Add, WRITER, .SeqCst);
|
|
rwl.mutex.lock();
|
|
|
|
const state = @atomicRmw(usize, &rwl.state, .Add, IS_WRITING -% WRITER, .SeqCst);
|
|
if (state & READER_MASK != 0)
|
|
rwl.semaphore.wait();
|
|
}
|
|
|
|
pub fn unlock(rwl: *DefaultRwLock) void {
|
|
_ = @atomicRmw(usize, &rwl.state, .And, ~IS_WRITING, .SeqCst);
|
|
rwl.mutex.unlock();
|
|
}
|
|
|
|
pub fn tryLockShared(rwl: *DefaultRwLock) bool {
|
|
const state = @atomicLoad(usize, &rwl.state, .SeqCst);
|
|
if (state & (IS_WRITING | WRITER_MASK) == 0) {
|
|
_ = @cmpxchgStrong(
|
|
usize,
|
|
&rwl.state,
|
|
state,
|
|
state + READER,
|
|
.SeqCst,
|
|
.SeqCst,
|
|
) orelse return true;
|
|
}
|
|
|
|
if (rwl.mutex.tryLock()) {
|
|
_ = @atomicRmw(usize, &rwl.state, .Add, READER, .SeqCst);
|
|
rwl.mutex.unlock();
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
pub fn lockShared(rwl: *DefaultRwLock) void {
|
|
var state = @atomicLoad(usize, &rwl.state, .SeqCst);
|
|
while (state & (IS_WRITING | WRITER_MASK) == 0) {
|
|
state = @cmpxchgWeak(
|
|
usize,
|
|
&rwl.state,
|
|
state,
|
|
state + READER,
|
|
.SeqCst,
|
|
.SeqCst,
|
|
) orelse return;
|
|
}
|
|
|
|
rwl.mutex.lock();
|
|
_ = @atomicRmw(usize, &rwl.state, .Add, READER, .SeqCst);
|
|
rwl.mutex.unlock();
|
|
}
|
|
|
|
pub fn unlockShared(rwl: *DefaultRwLock) void {
|
|
const state = @atomicRmw(usize, &rwl.state, .Sub, READER, .SeqCst);
|
|
|
|
if ((state & READER_MASK == READER) and (state & IS_WRITING != 0))
|
|
rwl.semaphore.post();
|
|
}
|
|
};
|
|
|
|
test "DefaultRwLock - internal state" {
|
|
var rwl = DefaultRwLock{};
|
|
|
|
// The following failed prior to the fix for Issue #13163,
|
|
// where the WRITER flag was subtracted by the lock method.
|
|
|
|
rwl.lock();
|
|
rwl.unlock();
|
|
try testing.expectEqual(rwl, DefaultRwLock{});
|
|
}
|
|
|
|
test "RwLock - smoke test" {
|
|
var rwl = RwLock{};
|
|
|
|
rwl.lock();
|
|
try testing.expect(!rwl.tryLock());
|
|
try testing.expect(!rwl.tryLockShared());
|
|
rwl.unlock();
|
|
|
|
try testing.expect(rwl.tryLock());
|
|
try testing.expect(!rwl.tryLock());
|
|
try testing.expect(!rwl.tryLockShared());
|
|
rwl.unlock();
|
|
|
|
rwl.lockShared();
|
|
try testing.expect(!rwl.tryLock());
|
|
try testing.expect(rwl.tryLockShared());
|
|
rwl.unlockShared();
|
|
rwl.unlockShared();
|
|
|
|
try testing.expect(rwl.tryLockShared());
|
|
try testing.expect(!rwl.tryLock());
|
|
try testing.expect(rwl.tryLockShared());
|
|
rwl.unlockShared();
|
|
rwl.unlockShared();
|
|
|
|
rwl.lock();
|
|
rwl.unlock();
|
|
}
|
|
|
|
test "RwLock - concurrent access" {
|
|
if (builtin.single_threaded)
|
|
return;
|
|
|
|
if (builtin.zig_backend == .stage2_x86_64) return error.SkipZigTest;
|
|
|
|
const num_writers: usize = 2;
|
|
const num_readers: usize = 4;
|
|
const num_writes: usize = 10000;
|
|
const num_reads: usize = num_writes * 2;
|
|
|
|
const Runner = struct {
|
|
const Self = @This();
|
|
|
|
rwl: RwLock = .{},
|
|
writes: usize = 0,
|
|
reads: std.atomic.Atomic(usize) = std.atomic.Atomic(usize).init(0),
|
|
|
|
term1: usize = 0,
|
|
term2: usize = 0,
|
|
term_sum: usize = 0,
|
|
|
|
fn reader(self: *Self) !void {
|
|
while (true) {
|
|
self.rwl.lockShared();
|
|
defer self.rwl.unlockShared();
|
|
|
|
if (self.writes >= num_writes or self.reads.load(.Unordered) >= num_reads)
|
|
break;
|
|
|
|
try self.check();
|
|
|
|
_ = self.reads.fetchAdd(1, .Monotonic);
|
|
}
|
|
}
|
|
|
|
fn writer(self: *Self, thread_idx: usize) !void {
|
|
var prng = std.rand.DefaultPrng.init(thread_idx);
|
|
var rnd = prng.random();
|
|
|
|
while (true) {
|
|
self.rwl.lock();
|
|
defer self.rwl.unlock();
|
|
|
|
if (self.writes >= num_writes)
|
|
break;
|
|
|
|
try self.check();
|
|
|
|
const term1 = rnd.int(usize);
|
|
self.term1 = term1;
|
|
try std.Thread.yield();
|
|
|
|
const term2 = rnd.int(usize);
|
|
self.term2 = term2;
|
|
try std.Thread.yield();
|
|
|
|
self.term_sum = term1 +% term2;
|
|
self.writes += 1;
|
|
}
|
|
}
|
|
|
|
fn check(self: *const Self) !void {
|
|
const term_sum = self.term_sum;
|
|
try std.Thread.yield();
|
|
|
|
const term2 = self.term2;
|
|
try std.Thread.yield();
|
|
|
|
const term1 = self.term1;
|
|
try testing.expectEqual(term_sum, term1 +% term2);
|
|
}
|
|
};
|
|
|
|
var runner = Runner{};
|
|
var threads: [num_writers + num_readers]std.Thread = undefined;
|
|
|
|
for (threads[0..num_writers], 0..) |*t, i| t.* = try std.Thread.spawn(.{}, Runner.writer, .{ &runner, i });
|
|
for (threads[num_writers..]) |*t| t.* = try std.Thread.spawn(.{}, Runner.reader, .{&runner});
|
|
|
|
for (threads) |t| t.join();
|
|
|
|
try testing.expectEqual(num_writes, runner.writes);
|
|
|
|
//std.debug.print("reads={}\n", .{ runner.reads.load(.Unordered)});
|
|
}
|