61 _pqueue_node_t qn, scan;
89 for(scan = q->
back; scan != NULL && scan->
priority > priority; scan = scan->
next);
104 if(scan->
prev != NULL)
void * pmalloc(pool_t p, int size)
int pqueue_size(pqueue_t q)
void * pmalloco(pool_t p, int size)
easy safety utility (for creating blank mem for structs, etc)
void * pqueue_pull(pqueue_t q)
void pqueue_push(pqueue_t q, void *data, int priority)
pqueue_t pqueue_new(pool_t p)
pool - base node for a pool.
struct _pqueue_st * pqueue_t
struct _pqueue_node_st * _pqueue_node_t