73           pitem *item = malloc(sizeof(pitem));  in pitem_new()  local
75           if (item == NULL)  in pitem_new()
78           memcpy(item->priority, prio64be, sizeof(item->priority));  in pitem_new()
80           item->data = data;  in pitem_new()
81           item->next = NULL;  in pitem_new()
83           return item;  in pitem_new()
87 pitem_free(pitem *item)  in pitem_free()  argument
89           free(item);  in pitem_free()
105 pqueue_insert(pqueue_s *pq, pitem *item)  in pqueue_insert()  argument
110                     pq->items = item;  in pqueue_insert()
111                     return item;  in pqueue_insert()
118                     int cmp = memcmp(next->priority, item->priority,  in pqueue_insert()
119                         sizeof(item->priority));  in pqueue_insert()
121                               item->next = next;  in pqueue_insert()
124                                         pq->items = item;  in pqueue_insert()
126                                         curr->next = item;  in pqueue_insert()
128                               return item;  in pqueue_insert()
133           item->next = NULL;  in pqueue_insert()
134           curr->next = item;  in pqueue_insert()
136           return item;  in pqueue_insert()
148           pitem *item = pq->items;  in pqueue_pop()  local
153           return item;  in pqueue_pop()
176 pqueue_next(pitem **item)  in pqueue_next()  argument
180           if (item == NULL || *item == NULL)  in pqueue_next()
184           ret = *item;  in pqueue_next()
185           *item = (*item)->next;  in pqueue_next()
193           pitem *item = pq->items;  in pqueue_size()  local
196           while (item != NULL) {  in pqueue_size()
198                     item = item->next;  in pqueue_size()