55 	lqh = list_entry(uhci->skel_async_qh->node.prev,  in uhci_fsbr_on()
56 			struct uhci_qh, node);  in uhci_fsbr_on()
67 	lqh = list_entry(uhci->skel_async_qh->node.prev,  in uhci_fsbr_off()
68 			struct uhci_qh, node);  in uhci_fsbr_off()
261 	INIT_LIST_HEAD(&qh->node);  in uhci_alloc_qh()
298 	list_del(&qh->node);  in uhci_free_qh()
334 	if (qh->queue.next != &urbp->node) {  in uhci_cleanup_queue()
338 		purbp = list_entry(urbp->node.prev, struct urb_priv, node);  in uhci_cleanup_queue()
383 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_fixup_toggles()
393 	urbp = list_prepare_entry(urbp, &qh->queue, node);  in uhci_fixup_toggles()
394 	list_for_each_entry_continue(urbp, &qh->queue, node) {  in uhci_fixup_toggles()
415 	pipe = list_entry(qh->queue.next, struct urb_priv, node)->urb->pipe;  in uhci_fixup_toggles()
426 	list_add_tail(&qh->node, &uhci->skel_iso_qh->node);  in link_iso()
439 	list_add_tail(&qh->node, &uhci->skelqh[qh->skel]->node);  in link_interrupt()
441 	pqh = list_entry(qh->node.prev, struct uhci_qh, node);  in link_interrupt()
459 	list_for_each_entry_reverse(pqh, &uhci->skel_async_qh->node, node) {  in link_async()
463 	list_add(&qh->node, &pqh->node);  in link_async()
488 				struct urb_priv, node);  in uhci_activate_qh()
506 		uhci->next_qh = list_entry(qh->node.next, struct uhci_qh,  in uhci_activate_qh()
507 				node);  in uhci_activate_qh()
508 	list_del(&qh->node);  in uhci_activate_qh()
525 	pqh = list_entry(qh->node.prev, struct uhci_qh, node);  in unlink_interrupt()
538 	pqh = list_entry(qh->node.prev, struct uhci_qh, node);  in unlink_async()
570 	if (list_empty(&uhci->skel_unlink_qh->node) || uhci->is_stopped)  in uhci_unlink_qh()
575 		uhci->next_qh = list_entry(qh->node.next, struct uhci_qh,  in uhci_unlink_qh()
576 				node);  in uhci_unlink_qh()
577 	list_move_tail(&qh->node, &uhci->skel_unlink_qh->node);  in uhci_unlink_qh()
591 		uhci->next_qh = list_entry(qh->node.next, struct uhci_qh,  in uhci_make_qh_idle()
592 				node);  in uhci_make_qh_idle()
593 	list_move(&qh->node, &uhci->idle_qh_list);  in uhci_make_qh_idle()
734 	INIT_LIST_HEAD(&urbp->node);  in uhci_alloc_urb_priv()
745 	if (!list_empty(&urbp->node))  in uhci_free_urb_priv()
1298 					struct urb_priv, node)->urb;  in uhci_submit_isochronous()
1456 	list_add_tail(&urbp->node, &qh->queue);  in uhci_urb_enqueue()
1462 	if (qh->queue.next == &urbp->node && !qh->is_stopped) {  in uhci_urb_enqueue()
1534 			urbp->node.prev == &qh->queue &&  in uhci_giveback_urb()
1535 			urbp->node.next != &qh->queue) {  in uhci_giveback_urb()
1536 		struct urb *nurb = list_entry(urbp->node.next,  in uhci_giveback_urb()
1537 				struct urb_priv, node)->urb;  in uhci_giveback_urb()
1545 	list_del_init(&urbp->node);  in uhci_giveback_urb()
1582 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_scan_qh()
1615 	list_for_each_entry(urbp, &qh->queue, node) {  in uhci_scan_qh()
1641 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_scan_qh()
1691 		urbp = list_entry(qh->queue.next, struct urb_priv, node);  in uhci_advance_check()
1762 		uhci->next_qh = list_entry(uhci->skelqh[i]->node.next,  in uhci_scan_schedule()
1763 				struct uhci_qh, node);  in uhci_scan_schedule()
1765 			uhci->next_qh = list_entry(qh->node.next,  in uhci_scan_schedule()
1766 					struct uhci_qh, node);  in uhci_scan_schedule()
1772 	list_entry(qh->queue.next, struct urb_priv, node));  in uhci_scan_schedule()
1789 	if (list_empty(&uhci->skel_unlink_qh->node))  in uhci_scan_schedule()