Lines Matching refs:td_list
58 void fhci_add_tds_to_ed(struct ed *ed, struct td **td_list, int number) in fhci_add_tds_to_ed() argument
63 struct td *td = td_list[i]; in fhci_add_tds_to_ed()
64 list_add_tail(&td->node, &ed->td_list); in fhci_add_tds_to_ed()
67 ed->td_head = td_list[0]; in fhci_add_tds_to_ed()
74 if (!list_empty(&ed->td_list)) in peek_td_from_ed()
75 td = list_entry(ed->td_list.next, struct td, node); in peek_td_from_ed()
111 if (!list_empty(&ed->td_list)) { in fhci_remove_td_from_ed()
112 td = list_entry(ed->td_list.next, struct td, node); in fhci_remove_td_from_ed()
113 list_del_init(ed->td_list.next); in fhci_remove_td_from_ed()
116 if (!list_empty(&ed->td_list)) in fhci_remove_td_from_ed()
117 ed->td_head = list_entry(ed->td_list.next, struct td, in fhci_remove_td_from_ed()
148 if (!list_empty(&ed->td_list)) in fhci_move_td_from_ed_to_done_list()
149 ed->td_head = list_entry(ed->td_list.next, struct td, node); in fhci_move_td_from_ed_to_done_list()
173 if (!list_empty(&ed->td_list)) in free_urb_priv()
174 ed->td_head = list_entry(ed->td_list.next, struct td, node); in free_urb_priv()