Lines Matching full:item

20 	LRU_REMOVED,		/* item removed from list */
21 	LRU_REMOVED_RETRY,	/* item removed, but lock has been
23 	LRU_ROTATE,		/* item referenced, give another pass */
24 	LRU_SKIP,		/* item cannot be locked, skip */
25 	LRU_RETRY,		/* item not freeable. May drop the lock
89  * @item: the item to be added.
90  * @nid: the node id of the sublist to add the item to.
91  * @memcg: the cgroup of the sublist to add the item to.
96  * works if the item is in *this* list. If the item might be in some other
101  * parameters are used to determine which sublist to insert the item into.
103  * item, since it might otherwise get deleted from the wrong sublist.
105  * This also applies when attempting to insert the item multiple times - if
106  * the item is currently in one sublist and you call list_lru_add() again, you
115 bool list_lru_add(struct list_lru *lru, struct list_head *item, int nid,
121  * @item: the item to be added.
124  * memcg of the sublist is determined by @item list_head. This assumption is
129 bool list_lru_add_obj(struct list_lru *lru, struct list_head *item);
134  * @item: the item to be deleted.
135  * @nid: the node id of the sublist to delete the item from.
136  * @memcg: the cgroup of the sublist to delete the item from.
142  * also valid for list_lru_del(), that is, you can delete an item that has
143  * already been removed or never been added. However, if the item is in a
155 bool list_lru_del(struct list_lru *lru, struct list_head *item, int nid,
161  * @item: the item to be deleted.
164  * memcg of the sublist is determined by @item list_head. This assumption is
169 bool list_lru_del_obj(struct list_lru *lru, struct list_head *item);
204 void list_lru_isolate(struct list_lru_one *list, struct list_head *item);
205 void list_lru_isolate_move(struct list_lru_one *list, struct list_head *item,
208 typedef enum lru_status (*list_lru_walk_cb)(struct list_head *item,
217  *  the item currently being scanned
243  *  the item currently being scanned