Searched refs:keylist (Results 1 - 9 of 9) sorted by relevance
| /linux-4.4.14/drivers/md/bcache/ |
| H A D | request.h | 31 struct keylist insert_keys;
|
| H A D | bset.h | 461 struct keylist { struct
476 static inline void bch_keylist_init(struct keylist *l) bch_keylist_init()
481 static inline void bch_keylist_init_single(struct keylist *l, struct bkey *k) bch_keylist_init_single()
487 static inline void bch_keylist_push(struct keylist *l) bch_keylist_push()
492 static inline void bch_keylist_add(struct keylist *l, struct bkey *k) bch_keylist_add()
498 static inline bool bch_keylist_empty(struct keylist *l) bch_keylist_empty()
503 static inline void bch_keylist_reset(struct keylist *l) bch_keylist_reset()
508 static inline void bch_keylist_free(struct keylist *l) bch_keylist_free()
514 static inline size_t bch_keylist_nkeys(struct keylist *l) bch_keylist_nkeys()
519 static inline size_t bch_keylist_bytes(struct keylist *l) bch_keylist_bytes()
524 struct bkey *bch_keylist_pop(struct keylist *);
525 void bch_keylist_pop_front(struct keylist *);
526 int __bch_keylist_realloc(struct keylist *, unsigned);
|
| H A D | btree.c | 1295 struct keylist *, atomic_t *, struct bkey *);
1302 struct keylist keylist; btree_gc_coalesce() local
1306 bch_keylist_init(&keylist); btree_gc_coalesce()
1400 if (__bch_keylist_realloc(&keylist, btree_gc_coalesce()
1405 bch_keylist_add(&keylist, &new_nodes[i]->key); btree_gc_coalesce()
1420 if (__bch_keylist_realloc(&keylist, bkey_u64s(&r[i].b->key))) btree_gc_coalesce()
1423 make_btree_freeing_key(r[i].b, keylist.top); btree_gc_coalesce()
1424 bch_keylist_push(&keylist); btree_gc_coalesce()
1427 bch_btree_insert_node(b, op, &keylist, NULL, NULL); btree_gc_coalesce()
1428 BUG_ON(!bch_keylist_empty(&keylist)); btree_gc_coalesce()
1443 bch_keylist_free(&keylist); btree_gc_coalesce()
1450 bch_keylist_free(&keylist); btree_gc_coalesce()
1452 while ((k = bch_keylist_pop(&keylist))) btree_gc_coalesce()
1467 struct keylist keys; btree_gc_rewrite_node()
1919 struct keylist *insert_keys, bch_btree_insert_keys()
1961 struct keylist *insert_keys, btree_split()
1968 struct keylist parent_keys; btree_split()
2095 struct keylist *insert_keys, bch_btree_insert_node()
2156 struct keylist insert; bch_btree_insert_check_key()
2190 struct keylist *keys;
2208 int bch_btree_insert(struct cache_set *c, struct keylist *keys, bch_btree_insert()
|
| H A D | journal.c | 320 struct keylist keylist; bch_journal_replay() local
334 bch_keylist_init_single(&keylist, k); list_for_each_entry()
336 ret = bch_btree_insert(s, &keylist, i->pin, NULL); list_for_each_entry()
340 BUG_ON(!bch_keylist_empty(&keylist)); list_for_each_entry()
753 struct keylist *keys, bch_journal()
788 struct keylist keys; bch_journal_meta()
|
| H A D | journal.h | 167 struct keylist;
169 atomic_t *bch_journal(struct cache_set *, struct keylist *, struct closure *);
|
| H A D | writeback.c | 142 struct keylist keys; write_dirty_finish()
|
| H A D | bset.c | 129 int __bch_keylist_realloc(struct keylist *l, unsigned u64s) __bch_keylist_realloc()
156 struct bkey *bch_keylist_pop(struct keylist *l) bch_keylist_pop()
169 void bch_keylist_pop_front(struct keylist *l) bch_keylist_pop_front()
|
| H A D | btree.h | 252 int bch_btree_insert(struct cache_set *, struct keylist *,
|
| H A D | request.c | 100 static int bch_keylist_realloc(struct keylist *l, unsigned u64s, bch_keylist_realloc()
110 * and finish the rest when the keylist is empty. bch_keylist_realloc()
|
Completed in 203 milliseconds