Lines Matching refs:queue_entry_t
221 typedef struct queue_entry *queue_entry_t; typedef
239 __QUEUE_ELT_VALIDATE(queue_entry_t elt) in __QUEUE_ELT_VALIDATE()
241 queue_entry_t elt_next, elt_prev; in __QUEUE_ELT_VALIDATE()
243 if (__improbable(elt == (queue_entry_t)NULL)) { in __QUEUE_ELT_VALIDATE()
250 if (__improbable(elt_next == (queue_entry_t)NULL || elt_prev == (queue_entry_t)NULL)) { in __QUEUE_ELT_VALIDATE()
260 __DEQUEUE_ELT_CLEANUP(queue_entry_t elt) in __DEQUEUE_ELT_CLEANUP()
262 (elt)->next = (queue_entry_t)NULL; in __DEQUEUE_ELT_CLEANUP()
263 (elt)->prev = (queue_entry_t)NULL; in __DEQUEUE_ELT_CLEANUP()
273 queue_entry_t elt) in enqueue_head()
275 queue_entry_t old_head; in enqueue_head()
277 __QUEUE_ELT_VALIDATE((queue_entry_t)que); in enqueue_head()
288 queue_entry_t elt) in enqueue_tail()
290 queue_entry_t old_tail; in enqueue_tail()
292 __QUEUE_ELT_VALIDATE((queue_entry_t)que); in enqueue_tail()
300 static __inline__ queue_entry_t
304 queue_entry_t elt = (queue_entry_t)NULL; in dequeue_head()
305 queue_entry_t new_head; in dequeue_head()
319 static __inline__ queue_entry_t
323 queue_entry_t elt = (queue_entry_t)NULL; in dequeue_tail()
324 queue_entry_t new_tail; in dequeue_tail()
340 queue_entry_t elt) in remqueue()
342 queue_entry_t next_elt, prev_elt; in remqueue()
354 queue_entry_t entry, in insque()
355 queue_entry_t pred) in insque()
357 queue_entry_t successor; in insque()
369 queue_entry_t elt) in remque()
386 re_queue_head(queue_t que, queue_entry_t elt) in re_queue_head()
388 queue_entry_t n_elt, p_elt; in re_queue_head()
391 __QUEUE_ELT_VALIDATE((queue_entry_t)que); in re_queue_head()
419 re_queue_tail(queue_t que, queue_entry_t elt) in re_queue_tail()
421 queue_entry_t n_elt, p_elt; in re_queue_tail()
424 __QUEUE_ELT_VALIDATE((queue_entry_t)que); in re_queue_tail()
488 for (queue_entry_t _ne = ((head)->next)->next, \
542 queue_entry_t _tmp_entry = dequeue_head((head)); \
544 if (_tmp_entry != (queue_entry_t) NULL) \
551 queue_entry_t _tmp_entry = dequeue_tail((head)); \
553 if (_tmp_entry != (queue_entry_t) NULL) \
560 queue_entry_t _tmp_entry = queue_first((head)); \
562 if (_tmp_entry != (queue_entry_t) head) \
569 queue_entry_t _tmp_entry = queue_last((head)); \
571 if (_tmp_entry != (queue_entry_t) head) \
578 queue_entry_t _tmp_entry = queue_next(&(element)->field); \
580 if (_tmp_entry != (queue_entry_t) head) \
587 queue_entry_t _tmp_entry = queue_prev(&(element)->field); \
589 if (_tmp_entry != (queue_entry_t) head) \
720 queue_entry_t next_elt, prev_elt; in movqueue()
722 __QUEUE_ELT_VALIDATE((queue_entry_t)_old); in movqueue()
775 queue_entry_t __prev; \
782 (head)->next = (queue_entry_t) (elt); \
786 (queue_entry_t)(elt); \
788 (head)->prev = (queue_entry_t) elt; \
806 queue_entry_t __next; \
810 (head)->prev = (queue_entry_t) (elt); \
814 (queue_entry_t)(elt); \
818 (head)->next = (queue_entry_t) elt; \
837 queue_entry_t __prev; \
839 if ((head) == (queue_entry_t)(cur)) { \
843 (head)->next = (queue_entry_t)(elt); \
847 (queue_entry_t)(elt); \
849 (head)->prev = (queue_entry_t)(elt); \
851 (elt)->field.next = (queue_entry_t)(cur); \
852 if ((head)->next == (queue_entry_t)(cur)) { \
855 (head)->next = (queue_entry_t)(elt); \
859 (queue_entry_t)(elt); \
861 (cur)->field.prev = (queue_entry_t)(elt); \
881 queue_entry_t __next; \
883 if ((head) == (queue_entry_t)(cur)) { \
887 (head)->prev = (queue_entry_t)(elt); \
891 (queue_entry_t)(elt); \
893 (head)->next = (queue_entry_t)(elt); \
895 (elt)->field.prev = (queue_entry_t)(cur); \
896 if ((head)->prev == (queue_entry_t)(cur)) { \
899 (head)->prev = (queue_entry_t)(elt); \
903 (queue_entry_t)(elt); \
905 (cur)->field.next = (queue_entry_t)(elt); \
932 queue_entry_t __next, __prev; \
964 queue_entry_t __next; \
992 queue_entry_t __prev; \
1062 !queue_end((head), (queue_entry_t)(elt)); \