66 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
67 static int dbBackSplit(dmtree_t * tp, int leafno);
68 static int dbJoin(dmtree_t * tp, int leafno, int newval);
69 static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
2502 	int rc, leafno, ti;  in dbAdjCtl()  local
2522 	leafno = BLKTOCTLLEAF(blkno, dcp->budmin);  in dbAdjCtl()
2523 	ti = leafno + le32_to_cpu(dcp->leafidx);  in dbAdjCtl()
2551 			rc = dbBackSplit((dmtree_t *) dcp, leafno);  in dbAdjCtl()
2556 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);  in dbAdjCtl()
2558 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);  in dbAdjCtl()
2586 					dbJoin((dmtree_t *) dcp, leafno,  in dbAdjCtl()
2597 							    dcp, leafno);  in dbAdjCtl()
2598 					dbSplit((dmtree_t *) dcp, leafno,  in dbAdjCtl()
2647 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)  in dbSplit()  argument
2655 	if (leaf[leafno] > tp->dmt_budmin) {  in dbSplit()
2661 		cursz = leaf[leafno] - 1;  in dbSplit()
2669 			dbAdjTree(tp, leafno ^ budsz, cursz);  in dbSplit()
2681 	dbAdjTree(tp, leafno, newval);  in dbSplit()
2712 static int dbBackSplit(dmtree_t * tp, int leafno)  in dbBackSplit()  argument
2721 	assert(leaf[leafno] == NOFREE);  in dbBackSplit()
2731 	    LITOL2BSZ(leafno, le32_to_cpu(tp->dmt_l2nleafs),  in dbBackSplit()
2742 	while (leaf[leafno] == NOFREE) {  in dbBackSplit()
2745 		for (w = leafno, bsz = budsz;; bsz <<= 1,  in dbBackSplit()
2769 	if (leaf[leafno] != size) {  in dbBackSplit()
2791 static int dbJoin(dmtree_t * tp, int leafno, int newval)  in dbJoin()  argument
2823 			buddy = leafno ^ budsz;  in dbJoin()
2843 			if (leafno < buddy) {  in dbJoin()
2851 				dbAdjTree(tp, leafno, NOFREE);  in dbJoin()
2852 				leafno = buddy;  in dbJoin()
2864 	dbAdjTree(tp, leafno, newval);  in dbJoin()
2885 static void dbAdjTree(dmtree_t * tp, int leafno, int newval)  in dbAdjTree()  argument
2892 	lp = leafno + le32_to_cpu(tp->dmt_leafidx);  in dbAdjTree()