Searched refs:MAX_HEIGHT (Results 1 – 7 of 7) sorted by relevance
48 #define MAX_HEIGHT 243 macro
797 && B_LEVEL(p_s_bh) <= MAX_HEIGHT)1209 #define MAX_HEIGHT 5 /* maximal height of a tree. don't change this without changing JOURNAL_PER_BA… macro1416 struct buffer_head * L[MAX_HEIGHT]; /* array of left neighbors of nodes in the path */1417 struct buffer_head * R[MAX_HEIGHT]; /* array of right neighbors of nodes in the path*/1418 struct buffer_head * FL[MAX_HEIGHT]; /* array of fathers of the left neighbors */1419 struct buffer_head * FR[MAX_HEIGHT]; /* array of fathers of the right neighbors */1420 …struct buffer_head * CFL[MAX_HEIGHT]; /* array of common parents of center node and its left …1421 …struct buffer_head * CFR[MAX_HEIGHT]; /* array of common parents of center node and its right…1427 int lnum[MAX_HEIGHT]; /* array of number of items which must be1436 int rnum[MAX_HEIGHT]; /* substitute right for left in comment above */[all …]
732 for ( n_counter = 0; n_counter < MAX_HEIGHT; n_counter++ ) { in free_buffers_in_tb()2161 for ( i = 0; !locked && i < MAX_HEIGHT && p_s_tb->insert_size[i]; i++ ) { in wait_tb_buffers_until_unlocked()2363 for ( n_h = 0; n_h < MAX_HEIGHT && p_s_tb->insert_size[n_h]; n_h++ ) { in fix_nodes()2375 if ( n_h != MAX_HEIGHT - 1 ) in fix_nodes()2399 if ( n_h < MAX_HEIGHT - 1 ) in fix_nodes()2410 RFALSE( n_h == MAX_HEIGHT - 1, in fix_nodes()2416 if ( n_h < MAX_HEIGHT - 1 ) in fix_nodes()2456 for ( i = 0; i < MAX_HEIGHT; i++ ) { in fix_nodes()2498 for ( i = 0; i < MAX_HEIGHT; i++ ) { in unfix_nodes()
68 RFALSE( B_LEVEL (p_s_bh) > MAX_HEIGHT, in B_IS_IN_TREE()395 p_s_chk_path->path_length > MAX_HEIGHT, in key_in_buffer()560 if (nr <= DISK_LEAF_NODE_LEVEL || nr > MAX_HEIGHT) { in is_internal()
258 for( level = 0 ; level < MAX_HEIGHT ; ++ level ) { in reiserfs_per_level_in_proc()
688 if (!(B_LEVEL (bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL (bh) <= MAX_HEIGHT)) in check_internal_block_head()
1603 for ( h = 1; h < MAX_HEIGHT && tb->insert_size[h]; h++ ) in do_balance()