Lines Matching defs:urbp

73 	struct urb_priv *urbp = urb->hcpriv;
76 urbp->fsbr = 1;
79 static void uhci_urbp_wants_fsbr(struct uhci_hcd *uhci, struct urb_priv *urbp)
81 if (urbp->fsbr) {
142 static void uhci_add_td_to_urbp(struct uhci_td *td, struct urb_priv *urbp)
144 list_add_tail(&td->list, &urbp->td_list);
238 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
241 list_for_each_entry(td, &urbp->td_list, list)
318 struct urb_priv *urbp = urb->hcpriv;
335 if (qh->queue.next != &urbp->node) {
339 purbp = list_entry(urbp->node.prev, struct urb_priv, node);
343 td = list_entry(urbp->td_list.prev, struct uhci_td,
360 WARN_ON(list_empty(&urbp->td_list));
361 td = list_entry(urbp->td_list.next, struct uhci_td, list);
376 struct urb_priv *urbp = NULL;
384 urbp = list_entry(qh->queue.next, struct urb_priv, node);
394 urbp = list_prepare_entry(urbp, &qh->queue, node);
395 list_for_each_entry_continue(urbp, &qh->queue, node) {
399 td = list_entry(urbp->td_list.next, struct uhci_td, list);
401 td = list_entry(urbp->td_list.prev, struct uhci_td,
407 list_for_each_entry(td, &urbp->td_list, list) {
488 struct urb_priv *urbp = list_entry(qh->queue.next,
490 struct uhci_td *td = list_entry(urbp->td_list.next,
726 struct urb_priv *urbp;
728 urbp = kmem_cache_zalloc(uhci_up_cachep, GFP_ATOMIC);
729 if (!urbp)
732 urbp->urb = urb;
733 urb->hcpriv = urbp;
735 INIT_LIST_HEAD(&urbp->node);
736 INIT_LIST_HEAD(&urbp->td_list);
738 return urbp;
742 struct urb_priv *urbp)
746 if (!list_empty(&urbp->node))
748 urbp->urb);
750 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
755 kmem_cache_free(uhci_up_cachep, urbp);
799 struct urb_priv *urbp = urb->hcpriv;
814 uhci_add_td_to_urbp(td, urbp);
853 uhci_add_td_to_urbp(td, urbp);
874 uhci_add_td_to_urbp(td, urbp);
926 struct urb_priv *urbp = urb->hcpriv;
980 uhci_add_td_to_urbp(td, urbp);
1016 uhci_add_td_to_urbp(td, urbp);
1124 struct uhci_qh *qh, struct urb_priv *urbp)
1130 td = list_entry(urbp->td_list.prev, struct uhci_td, list);
1136 WARN_ON(list_empty(&urbp->td_list));
1150 if (list_empty(&urbp->td_list))
1153 tmp = urbp->td_list.prev;
1158 while (tmp != &urbp->td_list) {
1173 struct urb_priv *urbp = urb->hcpriv;
1174 struct uhci_qh *qh = urbp->qh;
1179 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1202 uhci_show_qh(uhci, urbp->qh, errbuf,
1214 if (td->list.next != urbp->td_list.prev)
1223 else if (&td->list != urbp->td_list.prev)
1248 ret = uhci_fixup_short_transfer(uhci, qh, urbp);
1261 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1339 uhci_add_td_to_urbp(td, urbp);
1351 list_for_each_entry(td, &urbp->td_list, list) {
1370 struct urb_priv *urbp = urb->hcpriv;
1371 struct uhci_qh *qh = urbp->qh;
1373 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1412 struct urb_priv *urbp;
1422 urbp = uhci_alloc_urb_priv(uhci, urb);
1423 if (!urbp)
1433 urbp->qh = qh;
1454 list_add_tail(&urbp->node, &qh->queue);
1460 if (qh->queue.next == &urbp->node && !qh->is_stopped) {
1462 uhci_urbp_wants_fsbr(uhci, urbp);
1470 uhci_free_urb_priv(uhci, urbp);
1519 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1532 urbp->node.prev == &qh->queue &&
1533 urbp->node.next != &qh->queue) {
1534 struct urb *nurb = list_entry(urbp->node.next,
1543 list_del_init(&urbp->node);
1550 uhci_free_urb_priv(uhci, urbp);
1575 struct urb_priv *urbp;
1580 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1581 urb = urbp->urb;
1613 list_for_each_entry(urbp, &qh->queue, node) {
1614 urb = urbp->urb;
1639 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1640 if (urbp->fsbr && qh->wait_expired) {
1641 struct uhci_td *td = list_entry(urbp->td_list.next,
1668 struct urb_priv *urbp = NULL;
1685 urbp = NULL;
1689 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1690 td = list_entry(urbp->td_list.next, struct uhci_td, list);
1723 if (urbp && urbp->fsbr && !(status & TD_CTRL_IOC))
1728 if (urbp)
1729 uhci_urbp_wants_fsbr(uhci, urbp);