Lines Matching refs: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);
236 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
239 list_for_each_entry(td, &urbp->td_list, list)
316 struct urb_priv *urbp = urb->hcpriv;
333 if (qh->queue.next != &urbp->node) {
337 purbp = list_entry(urbp->node.prev, struct urb_priv, node);
341 td = list_entry(urbp->td_list.prev, struct uhci_td,
358 WARN_ON(list_empty(&urbp->td_list));
359 td = list_entry(urbp->td_list.next, struct uhci_td, list);
373 struct urb_priv *urbp = NULL;
381 urbp = list_entry(qh->queue.next, struct urb_priv, node);
391 urbp = list_prepare_entry(urbp, &qh->queue, node);
392 list_for_each_entry_continue(urbp, &qh->queue, node) {
396 td = list_entry(urbp->td_list.next, struct uhci_td, list);
398 td = list_entry(urbp->td_list.prev, struct uhci_td,
404 list_for_each_entry(td, &urbp->td_list, list) {
485 struct urb_priv *urbp = list_entry(qh->queue.next,
487 struct uhci_td *td = list_entry(urbp->td_list.next,
723 struct urb_priv *urbp;
725 urbp = kmem_cache_zalloc(uhci_up_cachep, GFP_ATOMIC);
726 if (!urbp)
729 urbp->urb = urb;
730 urb->hcpriv = urbp;
732 INIT_LIST_HEAD(&urbp->node);
733 INIT_LIST_HEAD(&urbp->td_list);
735 return urbp;
739 struct urb_priv *urbp)
743 if (!list_empty(&urbp->node))
745 urbp->urb);
747 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
752 kmem_cache_free(uhci_up_cachep, urbp);
796 struct urb_priv *urbp = urb->hcpriv;
811 uhci_add_td_to_urbp(td, urbp);
850 uhci_add_td_to_urbp(td, urbp);
871 uhci_add_td_to_urbp(td, urbp);
922 struct urb_priv *urbp = urb->hcpriv;
960 uhci_add_td_to_urbp(td, urbp);
988 uhci_add_td_to_urbp(td, urbp);
1096 struct uhci_qh *qh, struct urb_priv *urbp)
1102 td = list_entry(urbp->td_list.prev, struct uhci_td, list);
1108 WARN_ON(list_empty(&urbp->td_list));
1121 if (list_empty(&urbp->td_list))
1124 tmp = urbp->td_list.prev;
1129 while (tmp != &urbp->td_list) {
1144 struct urb_priv *urbp = urb->hcpriv;
1145 struct uhci_qh *qh = urbp->qh;
1150 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1173 uhci_show_qh(uhci, urbp->qh, errbuf,
1185 if (td->list.next != urbp->td_list.prev)
1194 else if (&td->list != urbp->td_list.prev)
1219 ret = uhci_fixup_short_transfer(uhci, qh, urbp);
1232 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1310 uhci_add_td_to_urbp(td, urbp);
1322 list_for_each_entry(td, &urbp->td_list, list) {
1341 struct urb_priv *urbp = urb->hcpriv;
1342 struct uhci_qh *qh = urbp->qh;
1344 list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1383 struct urb_priv *urbp;
1393 urbp = uhci_alloc_urb_priv(uhci, urb);
1394 if (!urbp)
1404 urbp->qh = qh;
1425 list_add_tail(&urbp->node, &qh->queue);
1431 if (qh->queue.next == &urbp->node && !qh->is_stopped) {
1433 uhci_urbp_wants_fsbr(uhci, urbp);
1441 uhci_free_urb_priv(uhci, urbp);
1490 struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1503 urbp->node.prev == &qh->queue &&
1504 urbp->node.next != &qh->queue) {
1505 struct urb *nurb = list_entry(urbp->node.next,
1514 list_del_init(&urbp->node);
1521 uhci_free_urb_priv(uhci, urbp);
1546 struct urb_priv *urbp;
1551 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1552 urb = urbp->urb;
1584 list_for_each_entry(urbp, &qh->queue, node) {
1585 urb = urbp->urb;
1610 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1611 if (urbp->fsbr && qh->wait_expired) {
1612 struct uhci_td *td = list_entry(urbp->td_list.next,
1639 struct urb_priv *urbp = NULL;
1656 urbp = NULL;
1660 urbp = list_entry(qh->queue.next, struct urb_priv, node);
1661 td = list_entry(urbp->td_list.next, struct uhci_td, list);
1692 if (urbp && urbp->fsbr && !(status & TD_CTRL_IOC))
1697 if (urbp)
1698 uhci_urbp_wants_fsbr(uhci, urbp);