gadget/udc/omap_udc.c

275 	INIT_LIST_HEAD(&req->queue);
296 	list_del_init(&req->queue);
314 	/* don't modify queue heads during completion callback */
418 /* return:  0 = still running, 1 = queue empty, negative = errno */
647 		if (!list_empty(&ep->queue)) {
648 			req = container_of(ep->queue.next,
649 						struct omap_req, queue);
654 		if (!list_empty(&ep->queue)) {
655 			req = container_of(ep->queue.next,
656 					struct omap_req, queue);
666 		if (!list_empty(&ep->queue)) {
667 			req = container_of(ep->queue.next,
668 					struct omap_req, queue);
673 		if (!list_empty(&ep->queue)) {
674 			req = container_of(ep->queue.next,
675 					struct omap_req, queue);
777 	/* restart any queue, even if the claim failed  */
778 	restart = !ep->stopped && !list_empty(&ep->queue);
791 		req = container_of(ep->queue.next, struct omap_req, queue);
815 	if (!list_empty(&ep->queue))
816 		req = container_of(ep->queue.next, struct omap_req, queue);
876 			|| !list_empty(&req->queue)) {
910 	VDBG("%s queue req %p, len %d buf %p\n",
925 	} else if (list_empty(&ep->queue) && !ep->stopped && !ep->ackwait) {
929 			if (!udc->ep0_pending || !list_empty(&ep->queue)) {
998 	/* irq handler advances the queue */
1000 		list_add_tail(&req->queue, &ep->queue);
1018 	list_for_each_entry(iter, &ep->queue, queue) {
1029 	if (use_dma && ep->dma_channel && ep->queue.next == &req->queue) {
1033 		 * reclaiming the channel restarts the queue
1073 				&& !list_empty(&ep->queue)) {
1082 					&& !list_empty(&ep->queue)) {
1123 	.queue		= omap_ep_queue,
1346 	while (!list_empty(&ep->queue)) {
1347 		req = list_entry(ep->queue.next, struct omap_req, queue);
1422 	if (!list_empty(&ep0->queue))
1423 		req = container_of(ep0->queue.next, struct omap_req, queue);
1587 				 * restart the queue... very messy for DMA!
1869 	if (!list_empty(&ep->queue) && ep->ackwait) {
1878 			req = container_of(ep->queue.next,
1879 					struct omap_req, queue);
1917 			if (!list_empty(&ep->queue)) {
1919 				req = container_of(ep->queue.next,
1920 						struct omap_req, queue);
1952 			if (!list_empty(&ep->queue)) {
1953 				req = container_of(ep->queue.next,
1954 						struct omap_req, queue);
1984 		if (ep->has_dma || list_empty(&ep->queue))
1986 		req = list_entry(ep->queue.next, struct omap_req, queue);
2018 		if (!list_empty(&ep->queue))
2191 	if (list_empty(&ep->queue))
2192 		seq_printf(s, "\t(queue empty)\n");
2194 		list_for_each_entry(req, &ep->queue, queue) {
2557 	INIT_LIST_HEAD(&ep->queue);