Searched refs:desc_node (Results 1 - 10 of 10) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/dma/
H A Dat_hdmac.c62 struct at_desc, desc_node);
68 struct at_desc, desc_node);
114 list_for_each_entry_safe(desc, _desc, &atchan->free_list, desc_node) {
117 list_del(&desc->desc_node);
155 list_for_each_entry(child, &desc->tx_list, desc_node)
162 list_add(&desc->desc_node, &atchan->free_list);
254 list_move(&desc->desc_node, &atchan->free_list);
320 list_for_each_entry_safe(desc, _desc, &list, desc_node)
337 list_for_each_entry_safe(desc, _desc, &atchan->active_list, desc_node) {
342 list_for_each_entry(child, &desc->tx_list, desc_node)
[all...]
H A Dtxx9dmac.c167 struct txx9dmac_desc, desc_node);
173 struct txx9dmac_desc, desc_node);
178 return list_entry(dc->queue.next, struct txx9dmac_desc, desc_node);
184 desc = list_entry(desc->tx_list.prev, typeof(*desc), desc_node);
216 list_for_each_entry_safe(desc, _desc, &dc->free_list, desc_node) {
218 list_del(&desc->desc_node);
248 list_for_each_entry(child, &desc->tx_list, desc_node)
270 list_for_each_entry(child, &desc->tx_list, desc_node)
277 list_add(&desc->desc_node, &dc->free_list);
433 list_move(&desc->desc_node,
[all...]
H A Dintel_mid_dma.c209 list_for_each_entry_safe(desc, _desc, &midc->free_list, desc_node) {
211 list_del(&desc->desc_node);
232 list_add_tail(&desc->desc_node, &midc->free_list);
292 list_move(&desc->desc_node, &midc->free_list);
319 list_for_each_entry_safe(desc, _desc, &midc->active_list, desc_node) {
354 list_add_tail(&desc->desc_node, &midc->active_list);
356 list_add_tail(&desc->desc_node, &midc->queue);
449 list_for_each_entry_safe(desc, _desc, &list, desc_node) {
628 list_for_each_entry_safe(desc, _desc, &midc->active_list, desc_node) {
629 list_del(&desc->desc_node);
[all...]
H A Dpch_dma.c90 struct list_head desc_node; member in struct:pch_dma_desc
168 struct pch_dma_desc, desc_node);
174 struct pch_dma_desc, desc_node);
294 list_move(&desc->desc_node, &pd_chan->free_list);
313 list_for_each_entry_safe(desc, _d, &list, desc_node)
322 list_del(&bad_desc->desc_node);
371 list_add_tail(&desc->desc_node, &pd_chan->active_list);
374 list_add_tail(&desc->desc_node, &pd_chan->queue);
407 list_for_each_entry_safe(desc, _d, &pd_chan->free_list, desc_node) {
410 list_del(&desc->desc_node);
[all...]
H A Dtimb_dma.c73 struct list_head desc_node; member in struct:timb_dma_desc
232 desc_node);
274 desc_node);
293 list_move(&td_desc->desc_node, &td_chan->free_list);
317 struct timb_dma_desc, desc_node);
334 desc_node);
339 list_move(&td_desc->desc_node, &td_chan->active_list);
362 list_add_tail(&td_desc->desc_node, &td_chan->active_list);
368 list_add_tail(&td_desc->desc_node, &td_chan->queue);
434 list_add(&td_desc->desc_node,
[all...]
H A Ddw_dmac.c84 return list_entry(dwc->active_list.next, struct dw_desc, desc_node);
89 return list_entry(dwc->queue.next, struct dw_desc, desc_node);
99 list_for_each_entry_safe(desc, _desc, &dwc->free_list, desc_node) {
101 list_del(&desc->desc_node);
119 list_for_each_entry(child, &desc->tx_list, desc_node)
140 list_for_each_entry(child, &desc->tx_list, desc_node)
146 list_add(&desc->desc_node, &dwc->free_list);
213 list_move(&desc->desc_node, &dwc->free_list);
267 list_for_each_entry_safe(desc, _desc, &list, desc_node)
296 list_for_each_entry_safe(desc, _desc, &dwc->active_list, desc_node) {
[all...]
H A Ddw_dmac_regs.h219 struct list_head desc_node; member in struct:dw_desc
H A Dintel_mid_dma_regs.h232 struct list_head desc_node; member in struct:intel_mid_dma_desc
H A Dat_hdmac_regs.h160 * @desc_node: node on the channed descriptors list
170 struct list_head desc_node; member in struct:at_desc
H A Dtxx9dmac.h233 struct list_head desc_node ____cacheline_aligned;

Completed in 194 milliseconds