76 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
78 static int dbJoin(dmtree_t * tp, int leafno, int newval);
79 static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
80 static int dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc,
2401 dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc, int level)  in dbAdjCtl()  argument
2463 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);  in dbAdjCtl()
2465 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);  in dbAdjCtl()
2555 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)  in dbSplit()  argument
2589 	dbAdjTree(tp, leafno, newval);  in dbSplit()
2699 static int dbJoin(dmtree_t * tp, int leafno, int newval)  in dbJoin()  argument
2706 	if (newval >= tp->dmt_budmin) {  in dbJoin()
2724 		budsz = BUDSIZE(newval, tp->dmt_budmin);  in dbJoin()
2736 			if (newval > leaf[buddy])  in dbJoin()
2740 			if (newval < leaf[buddy])  in dbJoin()
2765 			newval += 1;  in dbJoin()
2772 	dbAdjTree(tp, leafno, newval);  in dbJoin()
2793 static void dbAdjTree(dmtree_t * tp, int leafno, int newval)  in dbAdjTree()  argument
2805 	if (tp->dmt_stree[lp] == newval)  in dbAdjTree()
2810 	tp->dmt_stree[lp] = newval;  in dbAdjTree()