Lines Matching defs:list
74 * Rather than use an LRU list, we use a clock algorithm where entries
75 * are held in a circular list. When an entry is 'hit' a reference bit
77 * cursor around the list selecting unreferenced entries. Referenced
81 struct list_head list;
87 struct list_head list;
126 list_add_tail(&le->list, lru->cursor);
128 INIT_LIST_HEAD(&le->list);
129 lru->cursor = &le->list;
141 return container_of(l, struct lru_entry, list);
145 * Initialize an lru_iter and add it to the list of cursors in the lru.
152 list_add(&it->list, &lru->iterators);
156 * Remove an lru_iter from the list of cursors in the lru.
160 list_del(&it->list);
183 it->e = to_le(it->e->list.next);
200 list_for_each_entry(it, &lru->iterators, list) {
203 it->e = to_le(it->e->list.next);
210 it->stop = to_le(it->stop->list.prev);
228 if (lru->cursor == &le->list)
230 list_del(&le->list);
271 le = container_of(h, struct lru_entry, list);
283 lru->cursor = le->list.next;
291 lru->cursor = le->list.next;
530 struct lru_entry *le = list_entry(l, struct lru_entry, list);
804 le = to_le(le->list.next);
1013 * Used by global_cleanup to sort the clients list.
1080 * The list of all clients.
1268 * the vector list is limited (increasing this limit increases
1633 list_del(&b->lru.list);
1671 list_add(&b->lru.list, &c->reserved_buffers);
2308 DMERR("leaked buffer %llx, hold count %u, list %d",
2551 list_del(&b->lru.list);
2593 list_del(&b->lru.list);
2773 * Inserts the client in the global client list based on its