Home
last modified time | relevance | path

Searched refs:MAX_HEIGHT (Results 1 – 6 of 6) sorted by relevance

/linux-4.19.296/fs/reiserfs/
Dreiserfs.h1702 && B_LEVEL(bh) <= MAX_HEIGHT)
2097 #define MAX_HEIGHT 5 macro
2414 struct buffer_head *L[MAX_HEIGHT];
2417 struct buffer_head *R[MAX_HEIGHT];
2420 struct buffer_head *FL[MAX_HEIGHT];
2423 struct buffer_head *FR[MAX_HEIGHT];
2425 struct buffer_head *CFL[MAX_HEIGHT];
2428 struct buffer_head *CFR[MAX_HEIGHT];
2446 int lnum[MAX_HEIGHT];
2449 int rnum[MAX_HEIGHT];
[all …]
Dfix_node.c805 for (i = 0; i < MAX_HEIGHT; i++) { in free_buffers_in_tb()
2408 for (i = 0; !locked && i < MAX_HEIGHT && tb->insert_size[i]; in wait_tb_buffers_until_unlocked()
2634 for (h = 0; h < MAX_HEIGHT && tb->insert_size[h]; h++) { in fix_nodes()
2647 if (h != MAX_HEIGHT - 1) in fix_nodes()
2679 if (h < MAX_HEIGHT - 1) in fix_nodes()
2690 RFALSE(h == MAX_HEIGHT - 1, in fix_nodes()
2697 } else if (h < MAX_HEIGHT - 1) in fix_nodes()
2736 for (i = 0; i < MAX_HEIGHT; i++) { in fix_nodes()
2789 for (i = 0; i < MAX_HEIGHT; i++) { in unfix_nodes()
Dprocfs.c154 for (level = 0; level < MAX_HEIGHT; ++level) { in show_per_level()
Dstree.c23 RFALSE(B_LEVEL(bh) > MAX_HEIGHT, in B_IS_IN_TREE()
331 || chk_path->path_length > MAX_HEIGHT, in key_in_buffer()
500 if (nr <= DISK_LEAF_NODE_LEVEL || nr > MAX_HEIGHT) { in is_internal()
Dprints.c752 if (!(B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL(bh) <= MAX_HEIGHT)) in check_internal_block_head()
Ddo_balan.c1906 for (h = 1; h < MAX_HEIGHT && tb->insert_size[h]; h++) in do_balance()