include/linux/reiserfs_fs.h

1488 struct tree_balance {  struct
1489 	int tb_mode;
1490 	int need_balance_dirty;
1491 	struct super_block *tb_sb;
1492 	struct reiserfs_transaction_handle *transaction_handle;
1493 	struct treepath *tb_path;
1494 	struct buffer_head *L[MAX_HEIGHT];	/* array of left neighbors of nodes in the path */
1495 	struct buffer_head *R[MAX_HEIGHT];	/* array of right neighbors of nodes in the path */
1496 	struct buffer_head *FL[MAX_HEIGHT];	/* array of fathers of the left  neighbors      */
1497 	struct buffer_head *FR[MAX_HEIGHT];	/* array of fathers of the right neighbors      */
1498 …t buffer_head *CFL[MAX_HEIGHT];	/* array of common parents of center node and its left neighbor  */
1499 …t buffer_head *CFR[MAX_HEIGHT];	/* array of common parents of center node and its right neighbor */
1501 	struct buffer_head *FEB[MAX_FEB_SIZE];	/* array of empty buffers. Number of buffers in array equals
1503 	struct buffer_head *used[MAX_FEB_SIZE];
1504 	struct buffer_head *thrown[MAX_FEB_SIZE];
1505 	int lnum[MAX_HEIGHT];	/* array of number of items which must be
1514 	int rnum[MAX_HEIGHT];	/* substitute right for left in comment above */
1515 	int lkey[MAX_HEIGHT];	/* array indexed by height h mapping the key delimiting L[h] and
1517 	int rkey[MAX_HEIGHT];	/* substitute r for l in comment above */
1518 	int insert_size[MAX_HEIGHT];	/* the number of bytes by we are trying to add or remove from
1520 	int blknum[MAX_HEIGHT];	/* number of nodes that will replace node S[h] after
1527 	int cur_blknum;		/* number of empty blocks having been already allocated                 */
1528 	int s0num;		/* number of items that fall into left most  node when S[0] splits     */
1529 	int s1num;		/* number of items that fall into first  new node when S[0] splits     */
1530 	int s2num;		/* number of items that fall into second new node when S[0] splits     */
1531 	int lbytes;		/* number of bytes which can flow to the left neighbor from the        left    */
1534 	int rbytes;		/* number of bytes which will flow to the right neighbor from the right        */
1537 	int s1bytes;		/* number of bytes which flow to the first  new node when S[0] splits   */
1539 	int s2bytes;
1540 …_free[MAX_FREE_BLOCK];	/* buffers which are to be freed after do_balance finishes by unfix_nodes */
1541 	char *vn_buf;		/* kmalloced memory. Used to create
1544 	int vn_buf_size;	/* size of the vn_buf */
1545 	struct virtual_node *tb_vn;	/* VN starts after bitmap of bitmap blocks */
1547 	int fs_gen;		/* saved value of `reiserfs_generation' counter
1550 	struct in_core_key key;	/* key pointer, to pass to block allocator or