31   list_t *list;  member
50   ret->list = list_new(NULL);  in fixed_queue_new()
51   if (!ret->list)  in fixed_queue_new()
76 …for (const list_node_t *node = list_begin(queue->list); node != list_end(queue->list); node = list…  in fixed_queue_free()
79   list_free(queue->list);  in fixed_queue_free()
91   bool is_empty = list_is_empty(queue->list);  in fixed_queue_is_empty()
102   size_t length = list_length(queue->list);  in fixed_queue_length()
121   list_append(queue->list, data);  in fixed_queue_enqueue()
133   void *ret = list_front(queue->list);  in fixed_queue_dequeue()
134   list_remove(queue->list, ret);  in fixed_queue_dequeue()
150   list_append(queue->list, data);  in fixed_queue_try_enqueue()
165   void *ret = list_front(queue->list);  in fixed_queue_try_dequeue()
166   list_remove(queue->list, ret);  in fixed_queue_try_dequeue()
179   void *ret = list_is_empty(queue->list) ? NULL : list_front(queue->list);  in fixed_queue_try_peek_first()
190   void *ret = list_is_empty(queue->list) ? NULL : list_back(queue->list);  in fixed_queue_try_peek_last()
202   if (list_contains(queue->list, data) &&  in fixed_queue_try_remove_from_queue()
204     removed = list_remove(queue->list, data);  in fixed_queue_try_remove_from_queue()
221   return queue->list;  in fixed_queue_get_list()