Lines Matching defs:queue
79 struct list_head queue;
281 BUG_ON(list_empty(&td_chan->queue));
284 td_desc = list_entry(td_chan->queue.next, struct timb_dma_desc,
314 list_add_tail(&td_desc->desc_node, &td_chan->queue);
443 BUG_ON(!list_empty(&td_chan->queue));
483 if (list_empty(&td_chan->active_list) && !list_empty(&td_chan->queue))
553 /* first the easy part, put the queue into the free list */
555 list_for_each_entry_safe(td_desc, _td_desc, &td_chan->queue,
585 if (!list_empty(&td_chan->queue))
699 INIT_LIST_HEAD(&td_chan->queue);