Home
last modified time | relevance | path

Searched refs:bch_ptr_bad (Results 1 – 5 of 5) sorted by relevance

/drivers/md/bcache/
Dbtree.c1295 if (bch_ptr_bad(&b->keys, k)) in btree_gc_mark_node()
1550 for_each_key_filter(&b->keys, k, &iter, bch_ptr_bad) in btree_gc_count_keys()
1598 k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad); in btree_gc_recurse()
1900 bch_ptr_bad); in bch_btree_check_recurse()
1937 k = bch_btree_iter_next_filter(&iter, &c->root->keys, bch_ptr_bad); in bch_btree_check_thread()
1957 bch_ptr_bad); in bch_btree_check_thread()
2529 bch_ptr_bad))) { in bch_btree_map_nodes_recurse()
2561 while ((k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad))) { in bch_btree_map_keys_recurse()
Dwriteback.c863 k = bch_btree_iter_next_filter(&iter, &c->root->keys, bch_ptr_bad); in bch_dirty_init_thread()
879 bch_ptr_bad); in bch_dirty_init_thread()
Dbset.h464 static inline bool bch_ptr_bad(struct btree_keys *b, const struct bkey *k) in bch_ptr_bad() function
Dbset.c86 if (bch_ptr_bad(b, k)) in __bch_check_keys()
1198 ? bch_ptr_bad in btree_mergesort()
Dsysfs.c653 for_each_key_filter(&b->keys, k, &iter, bch_ptr_bad) in bch_root_usage()