73 	struct urb_priv *urbp = urb->hcpriv;  in uhci_add_fsbr()  local
76 		urbp->fsbr = 1;  in uhci_add_fsbr()
79 static void uhci_urbp_wants_fsbr(struct uhci_hcd *uhci, struct urb_priv *urbp)  in uhci_urbp_wants_fsbr()  argument
81 	if (urbp->fsbr) {  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()  argument
144 	list_add_tail(&td->list, &urbp->td_list);  in uhci_add_td_to_urbp()
238 	struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;  in uhci_unlink_isochronous_tds()  local
241 	list_for_each_entry(td, &urbp->td_list, list)  in uhci_unlink_isochronous_tds()
318 	struct urb_priv *urbp = urb->hcpriv;  in uhci_cleanup_queue()  local
335 	if (qh->queue.next != &urbp->node) {  in uhci_cleanup_queue()
339 		purbp = list_entry(urbp->node.prev, struct urb_priv, node);  in uhci_cleanup_queue()
343 		td = list_entry(urbp->td_list.prev, struct uhci_td,  in uhci_cleanup_queue()
360 	WARN_ON(list_empty(&urbp->td_list));  in uhci_cleanup_queue()
361 	td = list_entry(urbp->td_list.next, struct uhci_td, list);  in uhci_cleanup_queue()
376 	struct urb_priv *urbp = NULL;  in uhci_fixup_toggles()  local
384 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_fixup_toggles()
394 	urbp = list_prepare_entry(urbp, &qh->queue, node);  in uhci_fixup_toggles()
395 	list_for_each_entry_continue(urbp, &qh->queue, node) {  in uhci_fixup_toggles()
399 		td = list_entry(urbp->td_list.next, struct uhci_td, list);  in uhci_fixup_toggles()
401 			td = list_entry(urbp->td_list.prev, struct uhci_td,  in uhci_fixup_toggles()
407 			list_for_each_entry(td, &urbp->td_list, list) {  in uhci_fixup_toggles()
488 		struct urb_priv *urbp = list_entry(qh->queue.next,  in uhci_activate_qh()  local
490 		struct uhci_td *td = list_entry(urbp->td_list.next,  in uhci_activate_qh()
726 	struct urb_priv *urbp;  in uhci_alloc_urb_priv()  local
728 	urbp = kmem_cache_zalloc(uhci_up_cachep, GFP_ATOMIC);  in uhci_alloc_urb_priv()
729 	if (!urbp)  in uhci_alloc_urb_priv()
732 	urbp->urb = urb;  in uhci_alloc_urb_priv()
733 	urb->hcpriv = urbp;  in uhci_alloc_urb_priv()
735 	INIT_LIST_HEAD(&urbp->node);  in uhci_alloc_urb_priv()
736 	INIT_LIST_HEAD(&urbp->td_list);  in uhci_alloc_urb_priv()
738 	return urbp;  in uhci_alloc_urb_priv()
742 		struct urb_priv *urbp)  in uhci_free_urb_priv()  argument
746 	if (!list_empty(&urbp->node))  in uhci_free_urb_priv()
748 				urbp->urb);  in uhci_free_urb_priv()
750 	list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {  in uhci_free_urb_priv()
755 	kmem_cache_free(uhci_up_cachep, urbp);  in uhci_free_urb_priv()
799 	struct urb_priv *urbp = urb->hcpriv;  in uhci_submit_control()  local
814 	uhci_add_td_to_urbp(td, urbp);  in uhci_submit_control()
853 		uhci_add_td_to_urbp(td, urbp);  in uhci_submit_control()
874 	uhci_add_td_to_urbp(td, urbp);  in uhci_submit_control()
926 	struct urb_priv *urbp = urb->hcpriv;  in uhci_submit_common()  local
980 		uhci_add_td_to_urbp(td, urbp);  in uhci_submit_common()
1016 		uhci_add_td_to_urbp(td, urbp);  in uhci_submit_common()
1124 		struct uhci_qh *qh, struct urb_priv *urbp)  in uhci_fixup_short_transfer()  argument
1130 	td = list_entry(urbp->td_list.prev, struct uhci_td, list);  in uhci_fixup_short_transfer()
1136 		WARN_ON(list_empty(&urbp->td_list));  in uhci_fixup_short_transfer()
1150 		if (list_empty(&urbp->td_list))  in uhci_fixup_short_transfer()
1153 		tmp = urbp->td_list.prev;  in uhci_fixup_short_transfer()
1158 	while (tmp != &urbp->td_list) {  in uhci_fixup_short_transfer()
1173 	struct urb_priv *urbp = urb->hcpriv;  in uhci_result_common()  local
1174 	struct uhci_qh *qh = urbp->qh;  in uhci_result_common()
1179 	list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {  in uhci_result_common()
1202 					uhci_show_qh(uhci, urbp->qh, errbuf,  in uhci_result_common()
1214 				if (td->list.next != urbp->td_list.prev)  in uhci_result_common()
1223 			else if (&td->list != urbp->td_list.prev)  in uhci_result_common()
1248 		ret = uhci_fixup_short_transfer(uhci, qh, urbp);  in uhci_result_common()
1262 	struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;  in uhci_submit_isochronous()  local
1342 		uhci_add_td_to_urbp(td, urbp);  in uhci_submit_isochronous()
1354 	list_for_each_entry(td, &urbp->td_list, list) {  in uhci_submit_isochronous()
1373 	struct urb_priv *urbp = urb->hcpriv;  in uhci_result_isochronous()  local
1374 	struct uhci_qh *qh = urbp->qh;  in uhci_result_isochronous()
1376 	list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {  in uhci_result_isochronous()
1415 	struct urb_priv *urbp;  in uhci_urb_enqueue()  local
1425 	urbp = uhci_alloc_urb_priv(uhci, urb);  in uhci_urb_enqueue()
1426 	if (!urbp)  in uhci_urb_enqueue()
1436 	urbp->qh = qh;  in uhci_urb_enqueue()
1457 	list_add_tail(&urbp->node, &qh->queue);  in uhci_urb_enqueue()
1463 	if (qh->queue.next == &urbp->node && !qh->is_stopped) {  in uhci_urb_enqueue()
1465 		uhci_urbp_wants_fsbr(uhci, urbp);  in uhci_urb_enqueue()
1473 	uhci_free_urb_priv(uhci, urbp);  in uhci_urb_enqueue()
1522 	struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;  in uhci_giveback_urb()  local
1535 			urbp->node.prev == &qh->queue &&  in uhci_giveback_urb()
1536 			urbp->node.next != &qh->queue) {  in uhci_giveback_urb()
1537 		struct urb *nurb = list_entry(urbp->node.next,  in uhci_giveback_urb()
1546 	list_del_init(&urbp->node);  in uhci_giveback_urb()
1553 	uhci_free_urb_priv(uhci, urbp);  in uhci_giveback_urb()
1578 	struct urb_priv *urbp;  in uhci_scan_qh()  local
1583 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_scan_qh()
1584 		urb = urbp->urb;  in uhci_scan_qh()
1616 	list_for_each_entry(urbp, &qh->queue, node) {  in uhci_scan_qh()
1617 		urb = urbp->urb;  in uhci_scan_qh()
1642 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_scan_qh()
1643 		if (urbp->fsbr && qh->wait_expired) {  in uhci_scan_qh()
1644 			struct uhci_td *td = list_entry(urbp->td_list.next,  in uhci_scan_qh()
1671 	struct urb_priv *urbp = NULL;  in uhci_advance_check()  local
1688 		urbp = NULL;  in uhci_advance_check()
1692 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_advance_check()
1693 		td = list_entry(urbp->td_list.next, struct uhci_td, list);  in uhci_advance_check()
1726 		if (urbp && urbp->fsbr && !(status & TD_CTRL_IOC))  in uhci_advance_check()
1731 		if (urbp)  in uhci_advance_check()
1732 			uhci_urbp_wants_fsbr(uhci, urbp);  in uhci_advance_check()