MAX_HEIGHT       2131 fs/reiserfs/do_balan.c 	for (h = 1; h < MAX_HEIGHT && tb->insert_size[h]; h++)
MAX_HEIGHT        758 fs/reiserfs/fix_node.c 	for (n_counter = 0; n_counter < MAX_HEIGHT; n_counter++) {
MAX_HEIGHT       2187 fs/reiserfs/fix_node.c 		for (i = 0; !locked && i < MAX_HEIGHT && p_s_tb->insert_size[i];
MAX_HEIGHT       2402 fs/reiserfs/fix_node.c 	for (n_h = 0; n_h < MAX_HEIGHT && p_s_tb->insert_size[n_h]; n_h++) {
MAX_HEIGHT       2417 fs/reiserfs/fix_node.c 				if (n_h != MAX_HEIGHT - 1)
MAX_HEIGHT       2441 fs/reiserfs/fix_node.c 			if (n_h < MAX_HEIGHT - 1)
MAX_HEIGHT       2450 fs/reiserfs/fix_node.c 				RFALSE(n_h == MAX_HEIGHT - 1,
MAX_HEIGHT       2457 fs/reiserfs/fix_node.c 			} else if (n_h < MAX_HEIGHT - 1)
MAX_HEIGHT       2493 fs/reiserfs/fix_node.c 		for (i = 0; i < MAX_HEIGHT; i++) {
MAX_HEIGHT       2548 fs/reiserfs/fix_node.c 	for (i = 0; i < MAX_HEIGHT; i++) {
MAX_HEIGHT        699 fs/reiserfs/prints.c 	if (!(B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL(bh) <= MAX_HEIGHT))
MAX_HEIGHT        164 fs/reiserfs/procfs.c 	for (level = 0; level < MAX_HEIGHT; ++level) {
MAX_HEIGHT         63 fs/reiserfs/stree.c 	RFALSE(B_LEVEL(p_s_bh) > MAX_HEIGHT,
MAX_HEIGHT        346 fs/reiserfs/stree.c 	       || p_s_chk_path->path_length > MAX_HEIGHT,
MAX_HEIGHT        515 fs/reiserfs/stree.c 	if (nr <= DISK_LEAF_NODE_LEVEL || nr > MAX_HEIGHT) {
MAX_HEIGHT        765 include/linux/reiserfs_fs.h                                             && B_LEVEL(p_s_bh) <= MAX_HEIGHT)
MAX_HEIGHT       1347 include/linux/reiserfs_fs.h 	struct buffer_head *L[MAX_HEIGHT];	/* array of left neighbors of nodes in the path */
MAX_HEIGHT       1348 include/linux/reiserfs_fs.h 	struct buffer_head *R[MAX_HEIGHT];	/* array of right neighbors of nodes in the path */
MAX_HEIGHT       1349 include/linux/reiserfs_fs.h 	struct buffer_head *FL[MAX_HEIGHT];	/* array of fathers of the left  neighbors      */
MAX_HEIGHT       1350 include/linux/reiserfs_fs.h 	struct buffer_head *FR[MAX_HEIGHT];	/* array of fathers of the right neighbors      */
MAX_HEIGHT       1351 include/linux/reiserfs_fs.h 	struct buffer_head *CFL[MAX_HEIGHT];	/* array of common parents of center node and its left neighbor  */
MAX_HEIGHT       1352 include/linux/reiserfs_fs.h 	struct buffer_head *CFR[MAX_HEIGHT];	/* array of common parents of center node and its right neighbor */
MAX_HEIGHT       1358 include/linux/reiserfs_fs.h 	int lnum[MAX_HEIGHT];	/* array of number of items which must be
MAX_HEIGHT       1367 include/linux/reiserfs_fs.h 	int rnum[MAX_HEIGHT];	/* substitute right for left in comment above */
MAX_HEIGHT       1368 include/linux/reiserfs_fs.h 	int lkey[MAX_HEIGHT];	/* array indexed by height h mapping the key delimiting L[h] and
MAX_HEIGHT       1370 include/linux/reiserfs_fs.h 	int rkey[MAX_HEIGHT];	/* substitute r for l in comment above */
MAX_HEIGHT       1371 include/linux/reiserfs_fs.h 	int insert_size[MAX_HEIGHT];	/* the number of bytes by we are trying to add or remove from
MAX_HEIGHT       1373 include/linux/reiserfs_fs.h 	int blknum[MAX_HEIGHT];	/* number of nodes that will replace node S[h] after
MAX_HEIGHT       1600 include/linux/reiserfs_fs.h #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)