Lines Matching defs:queue
163 struct list_head queue;
179 /* Request queue */
180 struct list_head queue;
290 list_del(&req->queue);
309 while (!list_empty(&ep->queue)) {
312 req = list_entry(ep->queue.next, struct ast_udc_request,
313 queue);
461 INIT_LIST_HEAD(&req->queue);
648 list_add_tail(&req->queue, &ep->queue);
678 if (list_is_singular(&ep->queue)) {
702 list_for_each_entry(req, &ep->queue, queue) {
704 list_del_init(&req->queue);
768 .queue = ast_udc_ep_queue,
793 if (list_empty(&ep->queue))
796 req = list_entry(ep->queue.next, struct ast_udc_request, queue);
832 if (list_empty(&ep->queue)) {
841 req = list_entry(ep->queue.next, struct ast_udc_request, queue);
865 if (list_empty(&ep->queue))
868 req = list_first_entry(&ep->queue, struct ast_udc_request, queue);
879 req = list_first_entry_or_null(&ep->queue,
881 queue);
887 req = list_first_entry_or_null(&ep->queue,
889 queue);
908 if (list_empty(&ep->queue)) {
909 dev_warn(dev, "%s request queue empty!\n", ep->ep.name);
913 req = list_first_entry(&ep->queue, struct ast_udc_request, queue);
958 req = list_first_entry_or_null(&ep->queue,
960 queue);
966 req = list_first_entry_or_null(&ep->queue,
968 queue);
1046 * Cleanup ep0 request(s) in queue because
1049 list_for_each_entry(req, &udc->ep[0].queue, queue) {
1051 EP_DBG(ep, "there is req %p in ep0 queue !\n", req);
1240 * using a work queue
1372 INIT_LIST_HEAD(&ep->queue);