Home
last modified time | relevance | path

Searched refs:queue_handle_t (Results 1 – 2 of 2) sorted by relevance

/dports/math/rumur/rumur-2021.09.29/misc/
H A Dpending-queue-4k.m71 queue_handle_t: record
87 head: queue_handle_t -- handle to the start of the queue
88 tail: queue_handle_t -- handle to the end of the queue
96 head: queue_handle_t
97 tail: queue_handle_t
108 next_tail: queue_handle_t
260 tmp: queue_handle_t
276 function queue_handle_next(h: queue_handle_t): queue_handle_t;
277 var tmp: queue_handle_t
306 function double_ptr_make(head: queue_handle_t; tail: queue_handle_t): double_ptr_t;
[all …]
/dports/math/rumur/rumur-2021.09.29/rumur/resources/
H A Dheader.c2266 typedef uintptr_t queue_handle_t; typedef
2269 return (queue_handle_t)n; in queue_handle_from_node_ptr()
2295 static queue_handle_t queue_handle_next(queue_handle_t h) { in queue_handle_next()
2318 static void hazard(queue_handle_t h) { in hazard()
2335 static void unhazard(queue_handle_t h) { in unhazard()
2352 static void reclaim(queue_handle_t h) { in reclaim()
2619 queue_handle_t tail = double_ptr_extract2(ends); in queue_enqueue()
2661 queue_handle_t next_tail = queue_handle_next(tail); in queue_enqueue()
2706 queue_handle_t head = double_ptr_extract1(ends); in queue_enqueue()
2772 queue_handle_t head = double_ptr_extract1(ends); in queue_dequeue()
[all …]