80 while (entry !=
NULL) {
123 original_next->
prev = new_entry;
125 new_entry->
next = original_next;
144 original_prev->
next = new_entry;
146 new_entry->
prev = original_prev;
162 new_head_next = front->
next;
183 new_tail_prev = back->
prev;
void * ff_queue_pop_back(Queue *q)
void * ff_queue_peek_back(Queue *q)
Memory handling functions.
void ff_queue_destroy(Queue *q)
int ff_queue_push_back(Queue *q, void *v)
void * ff_queue_peek_front(Queue *q)
int ff_queue_push_front(Queue *q, void *v)
simple assert() macros that are a bit more flexible than ISO C assert().
size_t ff_queue_size(Queue *q)
void * ff_queue_pop_front(Queue *q)
static QueueEntry * create_entry(void *val)
Queue * ff_queue_create(void)
static double val(void *priv, double ch)