mirror of
https://github.com/odin-lang/Odin.git
synced 2025-12-29 01:14:40 +00:00
55 lines
1.6 KiB
Odin
55 lines
1.6 KiB
Odin
package sync
|
|
|
|
import "core:sys/darwin"
|
|
|
|
import "core:c"
|
|
|
|
foreign import pthread "System.framework"
|
|
|
|
current_thread_id :: proc "contextless" () -> int {
|
|
tid: u64
|
|
// NOTE(Oskar): available from OSX 10.6 and iOS 3.2.
|
|
// For older versions there is `syscall(SYS_thread_selfid)`, but not really
|
|
// the same thing apparently.
|
|
foreign pthread { pthread_threadid_np :: proc "c" (rawptr, ^u64) -> c.int --- }
|
|
pthread_threadid_np(nil, &tid)
|
|
return int(tid)
|
|
}
|
|
|
|
|
|
// 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: darwin.semaphore_t,
|
|
}
|
|
// TODO(tetra): Only marked with alignment because we cannot mark distinct integers with alignments.
|
|
// See core/sys/unix/pthread_linux.odin/pthread_t.
|
|
|
|
semaphore_init :: proc(s: ^Semaphore, initial_count := 0) {
|
|
ct := darwin.mach_task_self()
|
|
res := darwin.semaphore_create(ct, &s.handle, 0, c.int(initial_count))
|
|
assert(res == 0)
|
|
}
|
|
|
|
semaphore_destroy :: proc(s: ^Semaphore) {
|
|
ct := darwin.mach_task_self()
|
|
res := darwin.semaphore_destroy(ct, s.handle)
|
|
assert(res == 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 {
|
|
res := darwin.semaphore_signal(s.handle)
|
|
assert(res == 0)
|
|
}
|
|
}
|
|
|
|
semaphore_wait_for :: proc(s: ^Semaphore) {
|
|
res := darwin.semaphore_wait(s.handle)
|
|
assert(res == 0)
|
|
}
|