39 assert((
int) (q != NULL));
47 assert((
int) (q != NULL));
73 for(scan = q->
back; scan != NULL && scan->
priority > priority; scan = scan->
next);
88 if(scan->
prev != NULL)
100 assert((
int) (q != NULL));
void * pmalloc(pool_t p, int size)
int jqueue_size(jqueue_t q)
struct _jqueue_node_st * _jqueue_node_t
void jqueue_free(jqueue_t q)
void * pmalloco(pool_t p, int size)
easy safety utility (for creating blank mem for structs, etc)
void jqueue_push(jqueue_t q, void *data, int priority)
time_t jqueue_age(jqueue_t q)
void * jqueue_pull(jqueue_t q)
jqueue_t jqueue_new(void)
pool - base node for a pool.
struct _jqueue_st * jqueue_t