vasilito/RedBear-OS
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix(pthread/tls): destructors

Browse Source 
Also added tests for it.

Signed-off-by: Anhad Singh <andypython@protonmail.com>
This commit is contained in:
Anhad Singh
2026-01-23 14:22:16 +11:00
parent ba99b7940c
commit 0f4a82b5e8
3 changed files with 167 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/header/limits/mod.rs
+4
View File
@@ -115,3 +115,7 @@ pub const COLL_WEIGHTS_MAX: c_long = _POSIX2_COLL_WEIGHTS_MAX;
pub const EXPR_NEST_MAX: c_long = _POSIX2_EXPR_NEST_MAX;
pub const LINE_MAX: c_long = _POSIX2_LINE_MAX;
pub const RE_DUP_MAX: c_long = _POSIX2_RE_DUP_MAX;
pub const PTHREAD_DESTRUCTOR_ITERATIONS: c_long = _POSIX_THREAD_DESTRUCTOR_ITERATIONS;
// TODO: What should this limit be? Both glibc and musl have it as 1024
pub const PTHREAD_KEYS_MAX: c_long = 4096 * 32;
src/header/pthread/tls.rs
+92 -79
View File
@@ -1,71 +1,47 @@
// FIXME(andypython): remove this when #![allow(warnings, unused_variables)] is
// dropped from src/lib.rs.
#![warn(warnings, unused_variables)]
use super::*;
// TODO: Hashmap?
use alloc::collections::BTreeMap;
use alloc::{collections::BTreeMap, vec::Vec};
use core::{
cell::{Cell, RefCell},
cell::RefCell,
ptr,
sync::atomic::{AtomicUsize, Ordering},
};
use crate::{header::errno::EINVAL, sync::Mutex};
use crate::{
header::{errno::EINVAL, limits::PTHREAD_DESTRUCTOR_ITERATIONS},
sync::Mutex,
};
// TODO: What should this limit be?
pub const PTHREAD_KEYS_MAX: u32 = 4096 * 32;
type Dtor = Option<extern "C" fn(value: *mut c_void)>;
struct Record {
data: *mut c_void,
}
#[thread_local]
static VALUES: RefCell<BTreeMap<pthread_key_t, Record>> = RefCell::new(BTreeMap::new());
static KEYS: Mutex<BTreeMap<pthread_key_t, Dtor>> = Mutex::new(BTreeMap::new());
static NEXTKEY: AtomicUsize = AtomicUsize::new(1);
#[unsafe(no_mangle)]
pub unsafe extern "C" fn pthread_getspecific(key: pthread_key_t) -> *mut c_void {
//print!("pthread_getspecific key={:#0x}: ", key);
// TODO: Right?
if !KEYS.lock().contains_key(&key) {
//println!("= not found");
return core::ptr::null_mut();
}
let Some(&Record { data, .. }) = VALUES.borrow_mut().get(&key) else {
//println!("= NULL");
return core::ptr::null_mut();
};
//println!("= {:p}", data);
data
}
#[unsafe(no_mangle)]
pub unsafe extern "C" fn pthread_key_create(
key_ptr: *mut pthread_key_t,
destructor: Option<extern "C" fn(value: *mut c_void)>,
) -> c_int {
let key = NEXTKEY.fetch_add(1, Ordering::SeqCst) as pthread_key_t;
//println!("pthread_key_create new key {:#0x}, dtor {:?}", key, destructor);
// TODO
//if key >= PTHREAD_KEYS_MAX {
//}
KEYS.lock().insert(key, Dtor { destructor });
VALUES.borrow_mut().insert(
key,
Record {
data: core::ptr::null_mut(),
},
);
unsafe { key_ptr.write(key) };
0
}
#[unsafe(no_mangle)]
pub unsafe extern "C" fn pthread_key_delete(key: pthread_key_t) -> c_int {
if KEYS.lock().remove(&key).is_none() || VALUES.borrow_mut().remove(&key).is_none() {
// We don't have to return anything, but it's not less expensive to ignore it.
return EINVAL;
}
//println!("pthread_key_delete {:#0x}", key);
0
// According to POSIX (issue 8): Calling [`pthread_getspecific`] with a key
// that has been deleted with [`pthread_key_delete`] or not obtained from
// [`pthread_key_create`] results in undefined behaviour. Therefore, we only
// do this check when debug assertions are explicitly enabled to avoid
// acquiring the global [`KEYS`] lock when it is not necessary.
debug_assert!(KEYS.lock().contains_key(&key));
VALUES
.borrow_mut()
.get(&key)
.map(|record| record.data)
.unwrap_or(ptr::null_mut())
}
#[unsafe(no_mangle)]
@@ -78,40 +54,77 @@ pub unsafe extern "C" fn pthread_setspecific(key: pthread_key_t, value: *const c
let mut guard = VALUES.borrow_mut();
let mut record = guard.entry(key).or_insert(Record {
let record = guard.entry(key).or_insert(Record {
data: core::ptr::null_mut(),
});
//println!("Valid key for pthread_setspecific key {:#0x} value {:p} (was {:p})", key, value, record.data);
record.data = value as *mut c_void;
0
}
#[unsafe(no_mangle)]
pub unsafe extern "C" fn pthread_key_create(
key_ptr: *mut pthread_key_t,
destructor: Dtor,
) -> c_int {
let key = NEXTKEY.fetch_add(1, Ordering::SeqCst) as pthread_key_t;
// TODO
//if key >= PTHREAD_KEYS_MAX {
//}
KEYS.lock().insert(key, destructor);
unsafe { key_ptr.write(key) };
0
}
#[unsafe(no_mangle)]
pub unsafe extern "C" fn pthread_key_delete(key: pthread_key_t) -> c_int {
if KEYS.lock().remove(&key).is_none() || VALUES.borrow_mut().remove(&key).is_none() {
// We don't have to return anything, but it's not less expensive to ignore it.
return EINVAL;
}
0
}
static KEYS: Mutex<BTreeMap<pthread_key_t, Dtor>> = Mutex::new(BTreeMap::new());
struct Dtor {
destructor: Option<extern "C" fn(value: *mut c_void)>,
}
#[thread_local]
static VALUES: RefCell<BTreeMap<pthread_key_t, Record>> = RefCell::new(BTreeMap::new());
struct Record {
data: *mut c_void,
}
static NEXTKEY: AtomicUsize = AtomicUsize::new(1);
pub(crate) unsafe fn run_all_destructors() {
for (key, Record { data }) in VALUES.take() {
let Some(&Dtor {
destructor: Some(dtor),
}) = KEYS.lock().get(&key)
else {
continue;
for _ in 0..PTHREAD_DESTRUCTOR_ITERATIONS {
let mut any_run = false;
let dtors = {
let keys = KEYS.lock();
keys.iter()
.filter_map(|(&key, &dtor)| dtor.map(|dtor| (key, dtor)))
.collect::<Vec<_>>()
};
dtor(data);
// According to POSIX (issue 8): There is no specific order in which we
// have to run the destructors.
for (key, dtor) in dtors {
let mut values = VALUES.borrow_mut();
if let Some(record) = values.get_mut(&key) {
let val = record.data;
if val.is_null() {
continue;
}
record.data = ptr::null_mut();
drop(values);
dtor(val);
any_run = true;
}
}
if !any_run {
break;
}
}
// According to POSIX (issue 8): If even after
// [`PTHREAD_DESTRUCTOR_ITERATIONS`] there are still some non-NULL
// associated values with associated destructors, the behaviour is
// implementation-defined. We can choose to stop calling them or continue
// calling them until none are left. Both musl and glibc choose to stop
// calling them so we do the same.
}