79 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
80 static int dbBackSplit(dmtree_t * tp, int leafno);
81 static int dbJoin(dmtree_t * tp, int leafno, int newval);
82 static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
2515 	int rc, leafno, ti;  in dbAdjCtl()  local
2535 	leafno = BLKTOCTLLEAF(blkno, dcp->budmin);  in dbAdjCtl()
2536 	ti = leafno + le32_to_cpu(dcp->leafidx);  in dbAdjCtl()
2564 			rc = dbBackSplit((dmtree_t *) dcp, leafno);  in dbAdjCtl()
2569 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);  in dbAdjCtl()
2571 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);  in dbAdjCtl()
2599 					dbJoin((dmtree_t *) dcp, leafno,  in dbAdjCtl()
2610 							    dcp, leafno);  in dbAdjCtl()
2611 					dbSplit((dmtree_t *) dcp, leafno,  in dbAdjCtl()
2660 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)  in dbSplit()  argument
2668 	if (leaf[leafno] > tp->dmt_budmin) {  in dbSplit()
2674 		cursz = leaf[leafno] - 1;  in dbSplit()
2682 			dbAdjTree(tp, leafno ^ budsz, cursz);  in dbSplit()
2694 	dbAdjTree(tp, leafno, newval);  in dbSplit()
2725 static int dbBackSplit(dmtree_t * tp, int leafno)  in dbBackSplit()  argument
2734 	assert(leaf[leafno] == NOFREE);  in dbBackSplit()
2744 	    LITOL2BSZ(leafno, le32_to_cpu(tp->dmt_l2nleafs),  in dbBackSplit()
2755 	while (leaf[leafno] == NOFREE) {  in dbBackSplit()
2758 		for (w = leafno, bsz = budsz;; bsz <<= 1,  in dbBackSplit()
2782 	if (leaf[leafno] != size) {  in dbBackSplit()
2804 static int dbJoin(dmtree_t * tp, int leafno, int newval)  in dbJoin()  argument
2836 			buddy = leafno ^ budsz;  in dbJoin()
2856 			if (leafno < buddy) {  in dbJoin()
2864 				dbAdjTree(tp, leafno, NOFREE);  in dbJoin()
2865 				leafno = buddy;  in dbJoin()
2877 	dbAdjTree(tp, leafno, newval);  in dbJoin()
2898 static void dbAdjTree(dmtree_t * tp, int leafno, int newval)  in dbAdjTree()  argument
2905 	lp = leafno + le32_to_cpu(tp->dmt_leafidx);  in dbAdjTree()