Lines Matching refs:list
18 #include <linux/list.h>
347 * For this we maintain a list of cache_detail and
348 * a current pointer into that list and into the table
352 * in the current table and walks the list in that entry
424 * -1 if it fell off the end of the list.
788 * Implemented by linked list of requests. Each open file has
789 * a ->private that also exists in this list. New requests are added
792 * CACHE_UPCALLING clear, we free it from the list.
799 struct list_head list;
842 while (rp->q.list.next != &cd->queue &&
843 list_entry(rp->q.list.next, struct cache_queue, list)
845 struct list_head *next = rp->q.list.next;
846 list_move(&rp->q.list, next);
848 if (rp->q.list.next == &cd->queue) {
854 rq = container_of(rp->q.list.next, struct cache_request, q.list);
870 list_move(&rp->q.list, &rq->q.list);
882 list_move(&rp->q.list, &rq->q.list);
894 list_del(&rq->q.list);
983 for (cq= &rp->q; &cq->list != &cd->queue;
984 cq = list_entry(cq->list.next, struct cache_queue, list))
1009 for (cq= &rp->q; &cq->list != &cd->queue;
1010 cq = list_entry(cq->list.next, struct cache_queue, list))
1040 list_add(&rp->q.list, &cd->queue);
1058 for (cq= &rp->q; &cq->list != &cd->queue;
1059 cq = list_entry(cq->list.next, struct cache_queue, list))
1067 list_del(&rp->q.list);
1092 list_for_each_entry_safe(cq, tmp, &detail->queue, list)
1102 list_move(&cr->q.list, &dequeued);
1106 cr = list_entry(dequeued.next, struct cache_request, q.list);
1107 list_del(&cr->q.list);
1232 list_add_tail(&crq->q.list, &detail->queue);