79 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
81 static int dbJoin(dmtree_t * tp, int leafno, int newval);
82 static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
83 static int dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc,
2508 dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc, int level)  in dbAdjCtl()  argument
2569 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);  in dbAdjCtl()
2571 		rc = dbJoin((dmtree_t *) dcp, leafno, newval);  in dbAdjCtl()
2660 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)  in dbSplit()  argument
2694 	dbAdjTree(tp, leafno, newval);  in dbSplit()
2804 static int dbJoin(dmtree_t * tp, int leafno, int newval)  in dbJoin()  argument
2811 	if (newval >= tp->dmt_budmin) {  in dbJoin()
2829 		budsz = BUDSIZE(newval, tp->dmt_budmin);  in dbJoin()
2841 			if (newval > leaf[buddy])  in dbJoin()
2845 			if (newval < leaf[buddy])  in dbJoin()
2870 			newval += 1;  in dbJoin()
2877 	dbAdjTree(tp, leafno, newval);  in dbJoin()
2898 static void dbAdjTree(dmtree_t * tp, int leafno, int newval)  in dbAdjTree()  argument
2910 	if (tp->dmt_stree[lp] == newval)  in dbAdjTree()
2915 	tp->dmt_stree[lp] = newval;  in dbAdjTree()