Home
last modified time | relevance | path

Searched refs:BTREE_MAX_DEPTH (Results 1 – 13 of 13) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_locking.h23 return l < BTREE_MAX_DEPTH && !IS_ERR_OR_NULL(path->l[l].b); in is_btree_node()
129 EBUG_ON(level >= BTREE_MAX_DEPTH); in btree_node_unlock()
288 EBUG_ON(level >= BTREE_MAX_DEPTH); in btree_node_lock()
395 new_locks_want = min(new_locks_want, BTREE_MAX_DEPTH); in bch2_btree_path_upgrade()
H A Dbtree_update_interior.h9 #define BTREE_UPDATE_NODES_MAX ((BTREE_MAX_DEPTH - 2) * 2 + GC_MERGE_NODES)
194 if (depth < BTREE_MAX_DEPTH) in btree_update_reserve_required()
H A Dbtree_cache.c909 if (unlikely(level >= BTREE_MAX_DEPTH)) { in bch2_btree_node_fill()
911 level, BTREE_MAX_DEPTH); in bch2_btree_node_fill()
1050 EBUG_ON(level >= BTREE_MAX_DEPTH); in __bch2_btree_node_get()
1172 EBUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_get()
1248 EBUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_get_noiter()
1330 BUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_prefetch()
H A Dbtree_locking.c336 top->level < BTREE_MAX_DEPTH; in bch2_check_for_deadlock()
826 for (unsigned l = 0; l < BTREE_MAX_DEPTH; l++) in bch2_trans_unlock_write()
859 for (unsigned l = 0; l < BTREE_MAX_DEPTH; l++) { in bch2_btree_path_verify_locks()
H A Dbtree_iter.c225 for (unsigned i = 0; i < (!path->cached ? BTREE_MAX_DEPTH : 1); i++) { in bch2_btree_path_verify()
762 for (i = path->level; i < BTREE_MAX_DEPTH; i++) in btree_path_lock_root()
782 for (i = path->level + 1; i < BTREE_MAX_DEPTH; i++) in btree_path_lock_root()
1102 for (l = path->level + 1; l < BTREE_MAX_DEPTH; l++) in btree_path_set_level_down()
1185 if (unlikely(path->level >= BTREE_MAX_DEPTH)) in bch2_btree_path_traverse_one()
1251 for (i = 0; i < BTREE_MAX_DEPTH; i++) { in btree_path_copy()
1572 for (unsigned l = 0; l < BTREE_MAX_DEPTH; l++) { in bch2_btree_path_to_text()
1817 locks_want = min(locks_want, BTREE_MAX_DEPTH); in bch2_path_get()
3095 BUG_ON(path->locks_want < min(locks_want, BTREE_MAX_DEPTH)); in bch2_trans_node_iter_init()
3577 for (l = 0; l < BTREE_MAX_DEPTH; l++) { in bch2_btree_trans_to_text()
H A Dbcachefs.h496 #define BTREE_RESERVE_MAX (BTREE_MAX_DEPTH + (BTREE_MAX_DEPTH - 1))
H A Dbtree_gc.c542 bch2_shoot_down_journal_keys(c, i, 1, BTREE_MAX_DEPTH, POS_MIN, SPOS_MAX); in bch2_check_topology()
669 for (unsigned level = target_depth; level < BTREE_MAX_DEPTH; level++) { in bch2_gc_btree()
H A Dbtree_types.h342 } l[BTREE_MAX_DEPTH];
H A Dbackpointers.c23 bkey_fsck_err_on(bp.v->level > BTREE_MAX_DEPTH, in bch2_backpointer_validate()
26 bp.v->level, BTREE_MAX_DEPTH); in bch2_backpointer_validate()
H A Dbtree_node_scan.c191 if (BTREE_NODE_LEVEL(bn) >= BTREE_MAX_DEPTH) in try_read_btree_node()
H A Dbtree_update_interior.c373 BUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_alloc()
1167 level_end = BTREE_MAX_DEPTH; in bch2_btree_update_start()
2209 BTREE_MAX_DEPTH, a->level, 0); in async_btree_node_rewrite_trans()
2500 BTREE_MAX_DEPTH, b->c.level, in bch2_btree_node_update_key_get_iter()
H A Dbtree_iter.h59 return level < BTREE_MAX_DEPTH ? path->l[level].b : NULL; in btree_path_node()
H A Dbcachefs_format.h1412 #define BTREE_MAX_DEPTH 4U macro