free_buffers
rb_insert_color(&new_buffer->rb_node, &alloc->free_buffers);
size_t free_buffers = 0;
for (n = rb_first(&alloc->free_buffers); n; n = rb_next(n)) {
free_buffers++;
free_buffers, largest_free_size);
struct rb_node *n = alloc->free_buffers.rb_node;
rb_erase(&buffer->rb_node, &alloc->free_buffers);
struct rb_node **p = &alloc->free_buffers.rb_node;
rb_erase(&next->rb_node, &alloc->free_buffers);
rb_erase(&prev->rb_node, &alloc->free_buffers);
struct rb_root free_buffers;
n = rb_first(&alloc->free_buffers);
free_buffers(map[pages]);
free_buffers(sb_page);
struct list_head free_buffers;
list_add_tail(&buf->list, &dma->free_buffers);
if (list_empty(&dma->free_buffers)) {
buf = list_first_entry(&dma->free_buffers,
while (!list_empty(&dma->free_buffers)) {
buf = list_first_entry(&dma->free_buffers,
INIT_LIST_HEAD(&dma->free_buffers);
goto free_buffers;
goto free_buffers;
free_buffers:
goto free_buffers;
goto free_buffers;
free_buffers:
int free_buffers)
if (free_buffers)
goto free_buffers;
goto free_buffers;
goto free_buffers;
free_buffers:
goto free_buffers;
goto free_buffers;
free_buffers:
goto free_buffers;
goto free_buffers;
free_buffers:
goto free_buffers;
free_buffers:
goto free_buffers;
goto free_buffers;
free_buffers: