usb/host/uhci-q.c

74 	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)
317 	struct urb_priv *urbp = urb->hcpriv;
334 	if (qh->queue.next != &urbp->node) {
338 		purbp = list_entry(urbp->node.prev, struct urb_priv, node);
342 		td = list_entry(urbp->td_list.prev, struct uhci_td,
359 	WARN_ON(list_empty(&urbp->td_list));
360 	td = list_entry(urbp->td_list.next, struct uhci_td, list);
375 	struct urb_priv *urbp = NULL;
383 		urbp = list_entry(qh->queue.next, struct urb_priv, node);
393 	urbp = list_prepare_entry(urbp, &qh->queue, node);
394 	list_for_each_entry_continue(urbp, &qh->queue, node) {
398 		td = list_entry(urbp->td_list.next, struct uhci_td, list);
400 			td = list_entry(urbp->td_list.prev, struct uhci_td,
406 			list_for_each_entry(td, &urbp->td_list, list) {
487 		struct urb_priv *urbp = list_entry(qh->queue.next,
489 		struct uhci_td *td = list_entry(urbp->td_list.next,
725 	struct urb_priv *urbp;
727 	urbp = kmem_cache_zalloc(uhci_up_cachep, GFP_ATOMIC);
728 	if (!urbp)
731 	urbp->urb = urb;
732 	urb->hcpriv = urbp;
734 	INIT_LIST_HEAD(&urbp->node);
735 	INIT_LIST_HEAD(&urbp->td_list);
737 	return urbp;
741 		struct urb_priv *urbp)
745 	if (!list_empty(&urbp->node))
747 				urbp->urb);
749 	list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
754 	kmem_cache_free(uhci_up_cachep, urbp);
798 	struct urb_priv *urbp = urb->hcpriv;
813 	uhci_add_td_to_urbp(td, urbp);
852 		uhci_add_td_to_urbp(td, urbp);
873 	uhci_add_td_to_urbp(td, urbp);
925 	struct urb_priv *urbp = urb->hcpriv;
979 		uhci_add_td_to_urbp(td, urbp);
1015 		uhci_add_td_to_urbp(td, urbp);
1123 		struct uhci_qh *qh, struct urb_priv *urbp)
1129 	td = list_entry(urbp->td_list.prev, struct uhci_td, list);
1135 		WARN_ON(list_empty(&urbp->td_list));
1149 		if (list_empty(&urbp->td_list))
1152 		tmp = urbp->td_list.prev;
1157 	while (tmp != &urbp->td_list) {
1172 	struct urb_priv *urbp = urb->hcpriv;
1173 	struct uhci_qh *qh = urbp->qh;
1178 	list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1201 					uhci_show_qh(uhci, urbp->qh, errbuf,
1213 				if (td->list.next != urbp->td_list.prev)
1222 			else if (&td->list != urbp->td_list.prev)
1247 		ret = uhci_fixup_short_transfer(uhci, qh, urbp);
1261 	struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1341 		uhci_add_td_to_urbp(td, urbp);
1353 	list_for_each_entry(td, &urbp->td_list, list) {
1372 	struct urb_priv *urbp = urb->hcpriv;
1373 	struct uhci_qh *qh = urbp->qh;
1375 	list_for_each_entry_safe(td, tmp, &urbp->td_list, list) {
1414 	struct urb_priv *urbp;
1424 	urbp = uhci_alloc_urb_priv(uhci, urb);
1425 	if (!urbp)
1435 	urbp->qh = qh;
1456 	list_add_tail(&urbp->node, &qh->queue);
1462 	if (qh->queue.next == &urbp->node && !qh->is_stopped) {
1464 		uhci_urbp_wants_fsbr(uhci, urbp);
1472 	uhci_free_urb_priv(uhci, urbp);
1521 	struct urb_priv *urbp = (struct urb_priv *) urb->hcpriv;
1534 			urbp->node.prev == &qh->queue &&
1535 			urbp->node.next != &qh->queue) {
1536 		struct urb *nurb = list_entry(urbp->node.next,
1545 	list_del_init(&urbp->node);
1552 	uhci_free_urb_priv(uhci, urbp);
1577 	struct urb_priv *urbp;
1582 		urbp = list_entry(qh->queue.next, struct urb_priv, node);
1583 		urb = urbp->urb;
1615 	list_for_each_entry(urbp, &qh->queue, node) {
1616 		urb = urbp->urb;
1641 		urbp = list_entry(qh->queue.next, struct urb_priv, node);
1642 		if (urbp->fsbr && qh->wait_expired) {
1643 			struct uhci_td *td = list_entry(urbp->td_list.next,
1670 	struct urb_priv *urbp = NULL;
1687 		urbp = NULL;
1691 		urbp = list_entry(qh->queue.next, struct urb_priv, node);
1692 		td = list_entry(urbp->td_list.next, struct uhci_td, list);
1725 		if (urbp && urbp->fsbr && !(status & TD_CTRL_IOC))
1730 		if (urbp)
1731 			uhci_urbp_wants_fsbr(uhci, urbp);