Lines Matching refs:level
41 reserve += min_t(unsigned, 1, r->b->c.level) * 8; in bch2_recalc_btree_reserve()
206 u64 mask = bc->pinned_nodes_mask[!!b->c.level]; in __btree_node_pinned()
293 unsigned level, enum btree_id id) in bch2_btree_node_hash_insert() argument
295 b->c.level = level; in bch2_btree_node_hash_insert()
306 enum btree_id btree, unsigned level, in bch2_btree_node_update_key_early() argument
317 b = bch2_btree_node_get_noiter(trans, tmp.k, btree, level, true); in bch2_btree_node_update_key_early()
901 unsigned level, in bch2_btree_node_fill() argument
909 if (unlikely(level >= BTREE_MAX_DEPTH)) { in bch2_btree_node_fill()
911 level, BTREE_MAX_DEPTH); in bch2_btree_node_fill()
937 if (path && !bch2_btree_node_relock(trans, path, level + 1)) { in bch2_btree_node_fill()
942 b = bch2_btree_node_mem_alloc(trans, level != 0); in bch2_btree_node_fill()
957 if (bch2_btree_node_hash_insert(bc, b, level, btree_id)) { in bch2_btree_node_fill()
1011 bch2_btree_id_level_to_text(&buf, b->c.btree_id, b->c.level); in btree_bad_header()
1031 b->c.level != BTREE_NODE_LEVEL(b->data) || in btree_check_header()
1040 const struct bkey_i *k, unsigned level, in __bch2_btree_node_get() argument
1050 EBUG_ON(level >= BTREE_MAX_DEPTH); in __bch2_btree_node_get()
1060 level, lock_type, true); in __bch2_btree_node_get()
1070 if (btree_node_read_locked(path, level + 1)) in __bch2_btree_node_get()
1071 btree_node_unlock(trans, path, level + 1); in __bch2_btree_node_get()
1073 ret = btree_node_lock(trans, path, &b->c, level, lock_type, trace_ip); in __bch2_btree_node_get()
1080 b->c.level != level || in __bch2_btree_node_get()
1083 if (bch2_btree_node_relock(trans, path, level + 1)) in __bch2_btree_node_get()
1141 EBUG_ON(BTREE_NODE_LEVEL(b->data) != level); in __bch2_btree_node_get()
1164 const struct bkey_i *k, unsigned level, in bch2_btree_node_get() argument
1172 EBUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_get()
1184 return __bch2_btree_node_get(trans, path, k, level, lock_type, trace_ip); in bch2_btree_node_get()
1186 if (btree_node_read_locked(path, level + 1)) in bch2_btree_node_get()
1187 btree_node_unlock(trans, path, level + 1); in bch2_btree_node_get()
1189 ret = btree_node_lock(trans, path, &b->c, level, lock_type, trace_ip); in bch2_btree_node_get()
1196 b->c.level != level || in bch2_btree_node_get()
1199 if (bch2_btree_node_relock(trans, path, level + 1)) in bch2_btree_node_get()
1200 return __bch2_btree_node_get(trans, path, k, level, lock_type, trace_ip); in bch2_btree_node_get()
1208 return __bch2_btree_node_get(trans, path, k, level, lock_type, trace_ip); in bch2_btree_node_get()
1231 EBUG_ON(BTREE_NODE_LEVEL(b->data) != level); in bch2_btree_node_get()
1240 unsigned level, in bch2_btree_node_get_noiter() argument
1248 EBUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_get_noiter()
1262 level, SIX_LOCK_read, true); in bch2_btree_node_get_noiter()
1284 b->c.level != level)) { in bch2_btree_node_get_noiter()
1314 EBUG_ON(BTREE_NODE_LEVEL(b->data) != level); in bch2_btree_node_get_noiter()
1324 enum btree_id btree_id, unsigned level) in bch2_btree_node_prefetch() argument
1329 BUG_ON(path && !btree_node_locked(path, level + 1)); in bch2_btree_node_prefetch()
1330 BUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_prefetch()
1337 level, SIX_LOCK_read, false); in bch2_btree_node_prefetch()
1402 void bch2_btree_id_level_to_text(struct printbuf *out, enum btree_id btree, unsigned level) in bch2_btree_id_level_to_text() argument
1406 prt_printf(out, " level=%u", level); in bch2_btree_id_level_to_text()
1410 enum btree_id btree, unsigned level, struct bkey_s_c k) in __bch2_btree_pos_to_text() argument
1413 prt_printf(out, " level %u/", level); in __bch2_btree_pos_to_text()
1416 prt_printf(out, "%u", r->level); in __bch2_btree_pos_to_text()
1426 __bch2_btree_pos_to_text(out, c, b->c.btree_id, b->c.level, bkey_i_to_s_c(&b->key)); in bch2_btree_pos_to_text()
1437 prt_printf(out, "l %u ", b->c.level); in bch2_btree_node_to_text()