Lines Matching refs:list
35 static int journal_read_bucket(struct cache *ca, struct list_head *list,
102 * Nodes in 'list' are in linear increasing order of
111 * in list is expired and useless, remove it from
112 * this list. Otherwise, j is a candidate jset for
115 while (!list_empty(list)) {
116 i = list_first_entry(list,
117 struct journal_replay, list);
120 list_del(&i->list);
124 /* iterate list in reverse order (from latest jset) */
125 list_for_each_entry_reverse(i, list, list) {
131 * in list, j is an expired and useless jset.
137 * 'where' points to first jset in list which
141 where = &i->list;
146 where = list;
155 list_add(&i->list, where);
170 int bch_journal_read(struct cache_set *c, struct list_head *list)
174 ret = journal_read_bucket(ca, list, b); \
224 BUG_ON(list_empty(list));
232 seq = list_entry(list->prev, struct journal_replay,
233 list)->j.seq;
238 if (seq != list_entry(list->prev, struct journal_replay,
239 list)->j.seq)
284 if (!list_empty(list))
285 c->journal.seq = list_entry(list->prev,
287 list)->j.seq;
293 void bch_journal_mark(struct cache_set *c, struct list_head *list)
304 * iterate over the list in reverse order so that we can just skip that
308 list_for_each_entry_reverse(i, list, list) {
349 int bch_journal_replay(struct cache_set *s, struct list_head *list)
354 list_entry(list->prev, struct journal_replay, list);
359 list_for_each_entry(i, list, list) {
400 while (!list_empty(list)) {
401 i = list_first_entry(list, struct journal_replay, list);
402 list_del(&i->list);
455 list_for_each_entry_safe_reverse(b, t, &c->btree_cache, list) {
759 struct bio_list list;
761 bio_list_init(&list);
804 bio_list_add(&list, bio);
820 while ((bio = bio_list_pop(&list)))
920 * pass bch_journal() a list of keys to be journalled, and then