Lines Matching refs:queue

261 	INIT_LIST_HEAD(&qh->queue);  in uhci_alloc_qh()
296 if (!list_empty(&qh->queue)) in uhci_free_qh()
335 if (qh->queue.next != &urbp->node) { in uhci_cleanup_queue()
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()
416 pipe = list_entry(qh->queue.next, struct urb_priv, node)->urb->pipe; in uhci_fixup_toggles()
483 WARN_ON(list_empty(&qh->queue)); in uhci_activate_qh()
488 struct urb_priv *urbp = list_entry(qh->queue.next, in uhci_activate_qh()
1293 if (list_empty(&qh->queue)) { in uhci_submit_isochronous()
1298 lurb = list_entry(qh->queue.prev, in uhci_submit_isochronous()
1359 if (list_empty(&qh->queue)) { in uhci_submit_isochronous()
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()
1535 urbp->node.prev == &qh->queue && in uhci_giveback_urb()
1536 urbp->node.next != &qh->queue) { in uhci_giveback_urb()
1547 if (list_empty(&qh->queue) && qh->needs_fixup) { in uhci_giveback_urb()
1562 if (list_empty(&qh->queue)) { in uhci_giveback_urb()
1582 while (!list_empty(&qh->queue)) { in uhci_scan_qh()
1583 urbp = list_entry(qh->queue.next, struct urb_priv, node); in uhci_scan_qh()
1616 list_for_each_entry(urbp, &qh->queue, node) { in uhci_scan_qh()
1635 if (!list_empty(&qh->queue)) { in uhci_scan_qh()
1642 urbp = list_entry(qh->queue.next, struct urb_priv, node); in uhci_scan_qh()
1692 urbp = list_entry(qh->queue.next, struct urb_priv, node); in uhci_advance_check()
1773 list_entry(qh->queue.next, struct urb_priv, node)); in uhci_scan_schedule()