Lines Matching refs:queue

171 	/* Removed the req from fsl_ep->queue */
172 list_del_init(&req->queue);
219 while (!list_empty(&ep->queue)) {
222 req = list_entry(ep->queue.next, struct fsl_req, queue);
677 * the main operation is to insert the req->queue to the eq->queue
690 INIT_LIST_HEAD(&req->queue);
739 if (!(list_empty(&ep->queue)) && !(ep_index(ep) == 0)) {
742 lastreq = list_entry(ep->queue.prev, struct fsl_req, queue);
882 || !list_empty(&req->queue)) {
909 /* build dtds and push them to device queue */
917 /* irq handler advances the queue */
919 list_add_tail(&req->queue, &ep->queue);
940 /* Stop the ep before we deal with the queue */
951 list_for_each_entry(req, &ep->queue, queue) {
961 if (ep->queue.next == &req->queue) {
965 /* The request isn't the last request in this ep queue */
966 if (req->queue.next != &ep->queue) {
969 next_req = list_entry(req->queue.next, struct fsl_req,
970 queue);
979 prev_req = list_entry(req->queue.prev, struct fsl_req, queue);
1027 * are still queue */
1028 if (value && ep_is_in(ep) && !list_empty(&ep->queue)) {
1129 .queue = fsl_ep_queue,
1299 list_add_tail(&req->queue, &ep->queue);
1383 list_add_tail(&req->queue, &ep->queue);
1701 /* process the req queue until an uncomplete request */
1702 list_for_each_entry_safe(curr_req, temp_req, &curr_ep->queue,
1703 queue) {
1836 /* Reset all the queues, include XD, dTD, EP queue
2170 if (list_empty(&ep->queue)) {
2171 seq_puts(m, "its req queue is empty\n\n");
2173 list_for_each_entry(req, &ep->queue, queue) {
2189 if (list_empty(&ep->queue)) {
2190 seq_puts(m, "its req queue is empty\n\n");
2192 list_for_each_entry(req, &ep->queue, queue) {
2200 } /* end for if(ep->queue) */
2319 /* the queue lists any req for this ep */
2320 INIT_LIST_HEAD(&ep->queue);