29     item->next = NULL;  in pitem_new()
55     pitem *curr, *next;  in pqueue_insert()  local
62     for (curr = NULL, next = pq->items;  in pqueue_insert()
63          next != NULL; curr = next, next = next->next) {  in pqueue_insert()
67         int cmp = memcmp(next->priority, item->priority, 8);  in pqueue_insert()
69             item->next = next;  in pqueue_insert()
74                 curr->next = item;  in pqueue_insert()
83     item->next = NULL;  in pqueue_insert()
84     curr->next = item;  in pqueue_insert()
99         pq->items = pq->items->next;  in pqueue_pop()
106     pitem *next;  in pqueue_find()  local
112     for (next = pq->items; next->next != NULL; next = next->next) {  in pqueue_find()
113         if (memcmp(next->priority, prio64be, 8) == 0) {  in pqueue_find()
114             found = next;  in pqueue_find()
120     if (memcmp(next->priority, prio64be, 8) == 0)  in pqueue_find()
121         found = next;  in pqueue_find()
143     *item = (*item)->next;  in pqueue_next()
155         item = item->next;  in pqueue_size()