mirror of
https://github.com/odin-lang/Odin.git
synced 2025-12-29 09:24:33 +00:00
61c581baeb
Linux is in the unfortunate situation where the system call number is architecture specific. This consolidates the system call number definitions in a single location, adds some wrappers, and hopefully fixes the existing non-portable invocations of the syscall intrinsic.
37 lines
1.0 KiB
Odin
37 lines
1.0 KiB
Odin
package sync
|
|
|
|
import "core:sys/unix"
|
|
|
|
current_thread_id :: proc "contextless" () -> int {
|
|
return unix.sys_gettid()
|
|
}
|
|
|
|
|
|
// The Darwin docs say it best:
|
|
// A semaphore is much like a lock, except that a finite number of threads can hold it simultaneously.
|
|
// Semaphores can be thought of as being much like piles of tokens; multiple threads can take these tokens,
|
|
// but when there are none left, a thread must wait until another thread returns one.
|
|
Semaphore :: struct #align 16 {
|
|
handle: unix.sem_t,
|
|
}
|
|
|
|
semaphore_init :: proc(s: ^Semaphore, initial_count := 0) {
|
|
assert(unix.sem_init(&s.handle, 0, u32(initial_count)) == 0)
|
|
}
|
|
|
|
semaphore_destroy :: proc(s: ^Semaphore) {
|
|
assert(unix.sem_destroy(&s.handle) == 0)
|
|
s.handle = {}
|
|
}
|
|
|
|
semaphore_post :: proc(s: ^Semaphore, count := 1) {
|
|
// NOTE: SPEED: If there's one syscall to do this, we should use it instead of the loop.
|
|
for in 0..<count {
|
|
assert(unix.sem_post(&s.handle) == 0)
|
|
}
|
|
}
|
|
|
|
semaphore_wait_for :: proc(s: ^Semaphore) {
|
|
assert(unix.sem_wait(&s.handle) == 0)
|
|
}
|