Lines Matching defs:list
18 #include <linux/list.h>
345 * For this we maintain a list of cache_detail and
346 * a current pointer into that list and into the table
350 * in the current table and walks the list in that entry
422 * -1 if it fell off the end of the list.
772 * Implemented by linked list of requests. Each open file has
773 * a ->private that also exists in this list. New requests are added
776 * CACHE_UPCALLING clear, we free it from the list.
784 struct list_head list;
827 while (rp->q.list.next != &cd->queue &&
828 list_entry(rp->q.list.next, struct cache_queue, list)
830 struct list_head *next = rp->q.list.next;
831 list_move(&rp->q.list, next);
833 if (rp->q.list.next == &cd->queue) {
839 rq = container_of(rp->q.list.next, struct cache_request, q.list);
855 list_move(&rp->q.list, &rq->q.list);
867 list_move(&rp->q.list, &rq->q.list);
879 list_del(&rq->q.list);
986 for (cq= &rp->q; &cq->list != &cd->queue;
987 cq = list_entry(cq->list.next, struct cache_queue, list))
1012 for (cq= &rp->q; &cq->list != &cd->queue;
1013 cq = list_entry(cq->list.next, struct cache_queue, list))
1043 list_add(&rp->q.list, &cd->queue);
1061 for (cq= &rp->q; &cq->list != &cd->queue;
1062 cq = list_entry(cq->list.next, struct cache_queue, list))
1070 list_del(&rp->q.list);
1095 list_for_each_entry_safe(cq, tmp, &detail->queue, list)
1105 list_move(&cr->q.list, &dequeued);
1109 cr = list_entry(dequeued.next, struct cache_request, q.list);
1110 list_del(&cr->q.list);
1235 list_add_tail(&crq->q.list, &detail->queue);