Lines Matching defs:list
35 static int journal_read_bucket(struct cache *ca, struct list_head *list,
104 * Nodes in 'list' are in linear increasing order of
113 * in list is expired and useless, remove it from
114 * this list. Otherwise, j is a condidate jset for
117 while (!list_empty(list)) {
118 i = list_first_entry(list,
119 struct journal_replay, list);
122 list_del(&i->list);
126 /* iterate list in reverse order (from latest jset) */
127 list_for_each_entry_reverse(i, list, list) {
133 * in list, j is an expired and useless jset.
139 * 'where' points to first jset in list which
143 where = &i->list;
148 where = list;
156 list_add(&i->list, where);
171 int bch_journal_read(struct cache_set *c, struct list_head *list)
175 ret = journal_read_bucket(ca, list, b); \
225 BUG_ON(list_empty(list));
233 seq = list_entry(list->prev, struct journal_replay,
234 list)->j.seq;
239 if (seq != list_entry(list->prev, struct journal_replay,
240 list)->j.seq)
285 if (!list_empty(list))
286 c->journal.seq = list_entry(list->prev,
288 list)->j.seq;
294 void bch_journal_mark(struct cache_set *c, struct list_head *list)
305 * iterate over the list in reverse order so that we can just skip that
309 list_for_each_entry_reverse(i, list, list) {
350 int bch_journal_replay(struct cache_set *s, struct list_head *list)
355 list_entry(list->prev, struct journal_replay, list);
360 list_for_each_entry(i, list, list) {
401 while (!list_empty(list)) {
402 i = list_first_entry(list, struct journal_replay, list);
403 list_del(&i->list);
456 list_for_each_entry_safe_reverse(b, t, &c->btree_cache, list) {
762 struct bio_list list;
764 bio_list_init(&list);
809 bio_list_add(&list, bio);
825 while ((bio = bio_list_pop(&list)))
925 * pass bch_journal() a list of keys to be journalled, and then