32   list_t* list;  member
52   ret->list = list_new(NULL);  in fixed_queue_new()
53   if (!ret->list) goto error;  in fixed_queue_new()
74     for (const list_node_t* node = list_begin(queue->list);  in fixed_queue_free()
75          node != list_end(queue->list); node = list_next(node))  in fixed_queue_free()
78   list_free(queue->list);  in fixed_queue_free()
100   return list_is_empty(queue->list);  in fixed_queue_is_empty()
107   return list_length(queue->list);  in fixed_queue_length()
124     list_append(queue->list, data);  in fixed_queue_enqueue()
138     ret = list_front(queue->list);  in fixed_queue_dequeue()
139     list_remove(queue->list, ret);  in fixed_queue_dequeue()
155     list_append(queue->list, data);  in fixed_queue_try_enqueue()
170     ret = list_front(queue->list);  in fixed_queue_try_dequeue()
171     list_remove(queue->list, ret);  in fixed_queue_try_dequeue()
183   return list_is_empty(queue->list) ? NULL : list_front(queue->list);  in fixed_queue_try_peek_first()
190   return list_is_empty(queue->list) ? NULL : list_back(queue->list);  in fixed_queue_try_peek_last()
199     if (list_contains(queue->list, data) &&  in fixed_queue_try_remove_from_queue()
201       removed = list_remove(queue->list, data);  in fixed_queue_try_remove_from_queue()
219   return queue->list;  in fixed_queue_get_list()