Lines Matching full:tree

24 #define	TREESIZE	(256+64+16+4+1)	/* size of a dmap tree */
25 #define	LEAFIND		(64+16+4+1)	/* index of 1st leaf of a dmap tree */
26 #define LPERDMAP	256	/* num leaves per dmap tree */
27 #define L2LPERDMAP	8	/* l2 number of leaves per dmap tree */
33 #define CTLTREESIZE	(1024+256+64+16+4+1)	/* size of a dmapctl tree */
34 #define CTLLEAFIND	(256+64+16+4+1)	/* idx of 1st leaf of a dmapctl tree */
35 #define LPERCTL		1024	/* num of leaves per dmapctl tree */
36 #define L2LPERCTL	10	/* l2 num of leaves per dmapctl tree */
37 #define	ROOT		0	/* index of the root of a tree */
62  * of the tree.
143  *	dmap summary tree
148 	__le32 nleafs;		/* 4: number of tree leafs	*/
149 	__le32 l2nleafs;	/* 4: l2 number of tree leafs	*/
150 	__le32 leafidx;		/* 4: index of first tree leaf	*/
151 	__le32 height;		/* 4: height of the tree	*/
152 	s8 budmin;		/* 1: min l2 tree leaf value to combine */
153 	s8 stree[TREESIZE];	/* TREESIZE: tree		*/
164 	struct dmaptree tree;	/* 360: dmap tree			*/  member
176 	__le32 nleafs;		/* 4: number of tree leafs	*/
177 	__le32 l2nleafs;	/* 4: l2 number of tree leafs	*/
178 	__le32 leafidx;		/* 4: index of the first tree leaf	*/
179 	__le32 height;		/* 4: height of tree		*/
180 	s8 budmin;		/* 1: minimum l2 tree leaf value	*/
181 	s8 stree[CTLTREESIZE];	/* CTLTREESIZE: dmapctl tree	*/
215 	__le32 dn_agstart;	/* 4: start tree index at AG height	*/
234 	int dn_agstart;		/* start tree index at AG height	*/