62 void fhci_add_tds_to_ed(struct ed *ed, struct td **td_list, int number)  in fhci_add_tds_to_ed()  argument
67 		struct td *td = td_list[i];  in fhci_add_tds_to_ed()
68 		list_add_tail(&td->node, &ed->td_list);  in fhci_add_tds_to_ed()
71 		ed->td_head = td_list[0];  in fhci_add_tds_to_ed()
78 	if (!list_empty(&ed->td_list))  in peek_td_from_ed()
79 		td = list_entry(ed->td_list.next, struct td, node);  in peek_td_from_ed()
115 	if (!list_empty(&ed->td_list)) {  in fhci_remove_td_from_ed()
116 		td = list_entry(ed->td_list.next, struct td, node);  in fhci_remove_td_from_ed()
117 		list_del_init(ed->td_list.next);  in fhci_remove_td_from_ed()
120 		if (!list_empty(&ed->td_list))  in fhci_remove_td_from_ed()
121 			ed->td_head = list_entry(ed->td_list.next, struct td,  in fhci_remove_td_from_ed()
152 	if (!list_empty(&ed->td_list))  in fhci_move_td_from_ed_to_done_list()
153 		ed->td_head = list_entry(ed->td_list.next, struct td, node);  in fhci_move_td_from_ed_to_done_list()
177 	if (!list_empty(&ed->td_list))  in free_urb_priv()
178 		ed->td_head = list_entry(ed->td_list.next, struct td, node);  in free_urb_priv()