Home
last modified time | relevance | path

Searched refs:urb_priv (Results 1 – 17 of 17) sorted by relevance

/linux/drivers/usb/host/
H A Dfhci-q.c164 struct urb_priv *urb_priv = urb->hcpriv; in free_urb_priv() local
165 struct ed *ed = urb_priv->ed; in free_urb_priv()
167 for (i = 0; i < urb_priv->num_of_tds; i++) { in free_urb_priv()
168 list_del_init(&urb_priv->tds[i]->node); in free_urb_priv()
169 fhci_recycle_empty_td(fhci, urb_priv->tds[i]); in free_urb_priv()
178 kfree(urb_priv->tds); in free_urb_priv()
179 kfree(urb_priv); in free_urb_priv()
269 struct urb_priv *urb_priv = urb->hcpriv; in fhci_del_ed_list() local
271 if (urb_priv->state == URB_DEL) { in fhci_del_ed_list()
278 if (++(urb_priv->tds_cnt) == urb_priv->num_of_tds) in fhci_del_ed_list()
H A Dohci-q.c14 static void urb_free_priv (struct ohci_hcd *hc, urb_priv_t *urb_priv) in urb_free_priv() argument
16 int last = urb_priv->length - 1; in urb_free_priv()
23 td = urb_priv->td [i]; in urb_free_priv()
29 list_del (&urb_priv->pending); in urb_free_priv()
30 kfree (urb_priv); in urb_free_priv()
47 struct urb_priv *urb_priv; in finish_urb() local
93 urb_priv = urb->hcpriv; in finish_urb()
94 if (urb_priv->td_cnt > urb_priv->length) { in finish_urb()
521 struct urb_priv *urb_priv = urb->hcpriv; in td_fill() local
538 if (index != (urb_priv->length - 1) in td_fill()
[all …]
H A Dfhci-sched.c636 struct urb_priv *urb_priv; in process_done_list() local
646 urb_priv = urb->hcpriv; in process_done_list()
651 urb_priv->tds_cnt++; in process_done_list()
659 if (urb_priv->tds_cnt == urb_priv->num_of_tds) { in process_done_list()
661 } else if (urb_priv->state == URB_DEL && in process_done_list()
666 urb_priv->state = URB_DEL; in process_done_list()
700 struct urb_priv *urb_priv = urb->hcpriv; in fhci_queue_urb() local
757 urb_priv->tds_cnt = 0; in fhci_queue_urb()
758 urb_priv->ed = ed; in fhci_queue_urb()
772 fhci_td_fill(fhci, urb, urb_priv, ed, cnt, in fhci_queue_urb()
[all …]
H A Dfhci-hcd.c393 struct urb_priv *urb_priv; in fhci_urb_enqueue() local
429 urb_priv = kzalloc(sizeof(*urb_priv), mem_flags); in fhci_urb_enqueue()
430 if (!urb_priv) in fhci_urb_enqueue()
434 urb_priv->tds = kcalloc(size, sizeof(*urb_priv->tds), mem_flags); in fhci_urb_enqueue()
435 if (!urb_priv->tds) { in fhci_urb_enqueue()
436 kfree(urb_priv); in fhci_urb_enqueue()
447 urb_priv->num_of_tds = size; in fhci_urb_enqueue()
452 urb->hcpriv = urb_priv; in fhci_urb_enqueue()
457 kfree(urb_priv->tds); in fhci_urb_enqueue()
458 kfree(urb_priv); in fhci_urb_enqueue()
[all …]
H A Duhci-q.c74 struct urb_priv *urbp = urb->hcpriv; in uhci_add_fsbr()
79 static void uhci_urbp_wants_fsbr(struct uhci_hcd *uhci, struct urb_priv *urbp) in uhci_urbp_wants_fsbr()
142 static void uhci_add_td_to_urbp(struct uhci_td *td, struct urb_priv *urbp) in uhci_add_td_to_urbp()
238 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv; in uhci_unlink_isochronous_tds()
317 struct urb_priv *urbp = urb->hcpriv; in uhci_cleanup_queue()
335 struct urb_priv *purbp; in uhci_cleanup_queue()
338 purbp = list_entry(urbp->node.prev, struct urb_priv, node); in uhci_cleanup_queue()
375 struct urb_priv *urbp = NULL; in uhci_fixup_toggles()
383 urbp = list_entry(qh->queue.next, struct urb_priv, node); in uhci_fixup_toggles()
415 pipe = list_entry(qh->queue.next, struct urb_priv, node)->urb->pipe; in uhci_fixup_toggles()
[all …]
H A Dohci-hcd.c154 urb_priv_t *urb_priv; in ohci_urb_enqueue() local
193 urb_priv = kzalloc(struct_size(urb_priv, td, size), mem_flags); in ohci_urb_enqueue()
194 if (!urb_priv) in ohci_urb_enqueue()
196 INIT_LIST_HEAD (&urb_priv->pending); in ohci_urb_enqueue()
197 urb_priv->length = size; in ohci_urb_enqueue()
198 urb_priv->ed = ed; in ohci_urb_enqueue()
202 urb_priv->td [i] = td_alloc (ohci, mem_flags); in ohci_urb_enqueue()
203 if (!urb_priv->td [i]) { in ohci_urb_enqueue()
204 urb_priv->length = i; in ohci_urb_enqueue()
205 urb_free_priv (ohci, urb_priv); in ohci_urb_enqueue()
[all …]
H A Dfhci-mem.c86 struct urb_priv *urb_priv, struct ed *ed, u16 index, in fhci_td_fill() argument
107 urb_priv->tds[index] = td; in fhci_td_fill()
H A Dxhci-ring.c111 struct urb_priv *urb_priv = td->urb->hcpriv; in last_td_in_urb() local
113 return urb_priv->num_tds_done == urb_priv->num_tds; in last_td_in_urb()
124 struct urb_priv *urb_priv = urb->hcpriv; in inc_td_cnt() local
126 urb_priv->num_tds_done++; in inc_td_cnt()
767 struct urb_priv *urb_priv = urb->hcpriv; in xhci_giveback_urb_in_irq() local
777 xhci_urb_free_priv(urb_priv); in xhci_giveback_urb_in_irq()
2371 struct urb_priv *urb_priv; in process_isoc_td() local
2380 urb_priv = td->urb->hcpriv; in process_isoc_td()
2381 idx = urb_priv->num_tds_done; in process_isoc_td()
2472 struct urb_priv *urb_priv; in skip_isoc_td() local
[all …]
H A Dxen-hcd.c26 struct urb_priv { struct
554 static void xenhcd_free_urb_priv(struct urb_priv *urbp) in xenhcd_free_urb_priv()
765 struct urb_priv *urbp = (struct urb_priv *)urb->hcpriv; in xenhcd_giveback_urb()
780 static int xenhcd_do_request(struct xenhcd_info *info, struct urb_priv *urbp) in xenhcd_do_request()
822 struct urb_priv *urbp; in xenhcd_kick_pending_urbs()
831 struct urb_priv, list); in xenhcd_kick_pending_urbs()
845 struct urb_priv *urbp, *tmp; in xenhcd_cancel_all_enqueued_urbs()
874 struct urb_priv *urbp, *tmp; in xenhcd_giveback_unlinked_urbs()
880 static int xenhcd_submit_urb(struct xenhcd_info *info, struct urb_priv *urbp) in xenhcd_submit_urb()
903 static int xenhcd_unlink_urb(struct xenhcd_info *info, struct urb_priv *urbp) in xenhcd_unlink_urb()
[all …]
H A Dxhci.c1550 struct urb_priv *urb_priv; in xhci_urb_enqueue() local
1565 urb_priv = kzalloc(struct_size(urb_priv, td, num_tds), mem_flags); in xhci_urb_enqueue()
1566 if (!urb_priv) in xhci_urb_enqueue()
1569 urb_priv->num_tds = num_tds; in xhci_urb_enqueue()
1570 urb_priv->num_tds_done = 0; in xhci_urb_enqueue()
1571 urb->hcpriv = urb_priv; in xhci_urb_enqueue()
1639 xhci_urb_free_priv(urb_priv); in xhci_urb_enqueue()
1683 struct urb_priv *urb_priv; in xhci_urb_dequeue() local
1703 urb_priv = urb->hcpriv; in xhci_urb_dequeue()
1704 if (!vdev || !urb_priv) in xhci_urb_dequeue()
[all …]
H A Dfhci.h385 struct urb_priv { struct
518 struct urb_priv *urb_priv, struct ed *ed, u16 index,
H A Duhci-debug.c100 static int uhci_show_urbp(struct uhci_hcd *uhci, struct urb_priv *urbp, in uhci_show_urbp()
220 struct urb_priv *urbp = list_entry(qh->queue.next, in uhci_show_qh()
221 struct urb_priv, node); in uhci_show_qh()
H A Duhci-hcd.h479 struct urb_priv { struct
H A Dxhci.h1387 struct urb_priv { struct
1826 void xhci_urb_free_priv(struct urb_priv *urb_priv);
H A Dohci.h335 typedef struct urb_priv { struct
H A Duhci-hcd.c880 sizeof(struct urb_priv), 0, 0, NULL); in uhci_hcd_init()
H A Dxhci-mem.c1752 void xhci_urb_free_priv(struct urb_priv *urb_priv) in xhci_urb_free_priv() argument
1754 kfree(urb_priv); in xhci_urb_free_priv()