Lines Matching refs:set
56 struct bset *i, unsigned set) in bch2_dump_bset() argument
72 printk(KERN_ERR "block %u key %5zu - u64s 0? aieee!\n", set, in bch2_dump_bset()
84 printk(KERN_ERR "block %u key %5zu: %s\n", set, in bch2_dump_bset()
108 bch2_dump_bset(c, b, bset(b, t), t - b->set); in bch2_dump_btree_node()
115 struct btree_node_iter_set *set; in bch2_dump_btree_node_iter() local
121 btree_node_iter_for_each(iter, set) { in bch2_dump_btree_node_iter()
122 struct bkey_packed *k = __btree_node_offset_to_key(b, set->k); in bch2_dump_btree_node_iter()
129 t - b->set, set->k, buf.buf); in bch2_dump_btree_node_iter()
143 btree_keys_account_key_add(&nr, t - b->set, k); in bch2_btree_node_count_keys()
168 struct btree_node_iter_set *set; in __bch2_btree_node_iter_next_check() local
181 btree_node_iter_for_each(_iter, set) { in __bch2_btree_node_iter_next_check()
182 struct bkey_packed *k2 = __btree_node_offset_to_key(b, set->k); in __bch2_btree_node_iter_next_check()
184 printk(" [%zi %zi]", t - b->set, in __bch2_btree_node_iter_next_check()
194 struct btree_node_iter_set *set, *s2; in __bch2_btree_node_iter_verify() local
201 btree_node_iter_for_each(iter, set) { in __bch2_btree_node_iter_verify()
202 BUG_ON(set->k > set->end); in __bch2_btree_node_iter_verify()
204 BUG_ON(set != s2 && set->end == s2->end); in __bch2_btree_node_iter_verify()
208 btree_node_iter_for_each(iter, set) { in __bch2_btree_node_iter_verify()
210 if (set->end == t->end_offset) { in __bch2_btree_node_iter_verify()
211 BUG_ON(set->k < btree_bkey_first_offset(t) || in __bch2_btree_node_iter_verify()
212 set->k >= t->end_offset); in __bch2_btree_node_iter_verify()
221 btree_node_iter_for_each(iter, set) in __bch2_btree_node_iter_verify()
222 BUG_ON(set != iter->data && in __bch2_btree_node_iter_verify()
223 btree_node_iter_cmp(b, set[-1], set[0]) > 0); in __bch2_btree_node_iter_verify()
339 return t == b->set in bset_aux_tree_buf_start()
371 BUG_ON(t != b->set && in __bset_aux_tree_verify()
394 b->set[i].data_offset = U16_MAX; in bch2_btree_keys_init()
396 bch2_bset_set_no_aux_tree(b, b->set); in bch2_btree_keys_init()
759 for (i = b->set; i != t; i++) in bset_alloc_tree()
802 t = &b->set[b->nsets++]; in bch2_bset_init_first()
819 t = &b->set[b->nsets++]; in bch2_bset_init_next()
1003 btree_keys_account_key_add(&b->nr, t - b->set, src); in bch2_bset_insert()
1334 k[i] = __bch2_bset_search(b, b->set + i, search, &p); in bch2_btree_node_iter_init()
1339 struct bset_tree *t = b->set + i; in bch2_btree_node_iter_init()
1370 struct btree_node_iter_set *set; in bch2_btree_node_iter_bset_pos() local
1372 btree_node_iter_for_each(iter, set) in bch2_btree_node_iter_bset_pos()
1373 if (set->end == t->end_offset) in bch2_btree_node_iter_bset_pos()
1374 return __btree_node_offset_to_key(b, set->k); in bch2_btree_node_iter_bset_pos()
1407 struct btree_node_iter_set *set) in bch2_btree_node_iter_set_drop() argument
1412 memmove(&set[0], &set[1], (void *) last - (void *) set); in bch2_btree_node_iter_set_drop()
1461 struct btree_node_iter_set *set; in bch2_btree_node_iter_prev_all() local
1484 btree_node_iter_for_each(iter, set) in bch2_btree_node_iter_prev_all()
1485 if (set->end == end) in bch2_btree_node_iter_prev_all()
1488 BUG_ON(set != &iter->data[__btree_node_iter_used(iter)]); in bch2_btree_node_iter_prev_all()
1490 BUG_ON(set >= iter->data + ARRAY_SIZE(iter->data)); in bch2_btree_node_iter_prev_all()
1494 (void *) set - (void *) &iter->data[0]); in bch2_btree_node_iter_prev_all()