構造体定義書 - tree

構文

struct tree_balance

ファイル名

構造体情報

No.	名称	属性	説明
1	tree_balance
	transaction_handle	reiserfs_transaction_handle *
	tb_fs	reiserfs_filsys_t *
	tb_path	path *
	L[MAX_HEIGHT]	buffer_head *	array of left neighbors of nodes in the path
	R[MAX_HEIGHT]	buffer_head *	array of right neighbors of nodes in the path
	FL[MAX_HEIGHT]	buffer_head *	array of fathers of the left neighbors
	FR[MAX_HEIGHT]	buffer_head *	array of fathers of the right neighbors
	CFL[MAX_HEIGHT]	buffer_head *	array of common parents of center node and its left neighbor
	CFR[MAX_HEIGHT]	buffer_head *	array of common parents of center node and its right neighbor
	FEB[MAX_FEB_SIZE]	buffer_head *	array of empty buffers. Number of buffers in array equals
	used[MAX_FEB_SIZE]	buffer_head *
	lnum[MAX_HEIGHT]	short int	array of number of items which must be shifted to the left in
	rnum[MAX_HEIGHT]	short int	substitute right for left in comment above
	lkey[MAX_HEIGHT]	short int	array indexed by height h mapping the key delimiting L[h] and
	rkey[MAX_HEIGHT]	short int	substitute r for l in comment above
	insert_size[MAX_HEIGHT]	short int	the number of bytes by we are trying to add or remove from
	blknum[MAX_HEIGHT]	short int	number of nodes that will replace node S[h] after
	cur_blknum	short int	number of empty blocks having been already allocated
	s0num	short int	number of items that fall into left most node when S[0] splits
	s1num	short int	number of items that fall into first new node when S[0] splits
	s2num	short int	number of items that fall into second new node when S[0] splits
	lbytes	short int	number of bytes which can flow to the left neighbor from the left
	rbytes	short int	number of bytes which will flow to the right neighbor from the right
	s1bytes	short int	number of bytes which flow to the first new node when S[0] splits
	s2bytes	short int
	buf_to_free[MAX_FREE_BLOCK]	buffer_head *	buffers which are to be freed after do_balance finishes by unfix_nodes
	vn_buf	char *	kmalloced memory. Used to create
	vn_buf_size	int	size of the vn_buf
	tb_vn	virtual_node *	VN starts after bitmap of bitmap blocks

tree_balance

構文

ファイル名

構造体情報

See Also