objects.go RawHistoryFolder

1package wlturbo
2
3import "sync"
4
5// objectTable maps object IDs to objects. Unlike sync.Map, storing an ID that
6// was deleted earlier reuses the map's storage, so the steady-state cycle of
7// server-created objects (wl_callback per frame, recycled IDs) does not
8// allocate.
9type objectTable[V comparable] struct {
10	mu sync.RWMutex
11	m  map[uint32]V
12}
13
14func (t *objectTable[V]) Load(id uint32) (V, bool) {
15	t.mu.RLock()
16	v, ok := t.m[id]
17	t.mu.RUnlock()
18	return v, ok
19}
20
21func (t *objectTable[V]) Store(id uint32, v V) {
22	t.mu.Lock()
23	if t.m == nil {
24		t.m = make(map[uint32]V)
25	}
26	t.m[id] = v
27	t.mu.Unlock()
28}
29
30func (t *objectTable[V]) Delete(id uint32) {
31	t.mu.Lock()
32	delete(t.m, id)
33	t.mu.Unlock()
34}
35
36// CompareAndDelete deletes id only while it maps to old.
37func (t *objectTable[V]) CompareAndDelete(id uint32, old V) bool {
38	t.mu.Lock()
39	defer t.mu.Unlock()
40	if v, ok := t.m[id]; !ok || v != old {
41		return false
42	}
43	delete(t.m, id)
44	return true
45}
46
47// CompareAndSwap replaces id's value only while it maps to old.
48func (t *objectTable[V]) CompareAndSwap(id uint32, old, new V) bool {
49	t.mu.Lock()
50	defer t.mu.Unlock()
51	if v, ok := t.m[id]; !ok || v != old {
52		return false
53	}
54	t.m[id] = new
55	return true
56}