107 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval);
108 static void dbBackSplit(dmtree_t * tp, int leafno);
109 static void dbJoin(dmtree_t * tp, int leafno, int newval);
110 static void dbAdjTree(dmtree_t * tp, int leafno, int newval);
131 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
1734 		rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx);  in dbFindCtl()
1982 	if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx))  in dbAllocDmapLev()
2118 			dbBackSplit((dmtree_t *) & dp->tree, word);  in dbFreeDmap()
2153 	dmtree_t *tp = (dmtree_t *) & dp->tree;  in dbAllocBits()
2300 	dmtree_t *tp = (dmtree_t *) & dp->tree;  in dbFreeBits()
2530 			dbBackSplit((dmtree_t *) dcp, leafno);  in dbAdjCtl()
2533 		dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval);  in dbAdjCtl()
2535 		dbJoin((dmtree_t *) dcp, leafno, newval);  in dbAdjCtl()
2561 					dbJoin((dmtree_t *) dcp, leafno,  in dbAdjCtl()
2571 						dbBackSplit((dmtree_t *)  in dbAdjCtl()
2573 					dbSplit((dmtree_t *) dcp, leafno,  in dbAdjCtl()
2623 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval)  in dbSplit()
2688 static void dbBackSplit(dmtree_t * tp, int leafno)  in dbBackSplit()
2760 static void dbJoin(dmtree_t * tp, int leafno, int newval)  in dbJoin()
2850 static void dbAdjTree(dmtree_t * tp, int leafno, int newval)  in dbAdjTree()
2924 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx)  in dbFindLeaf()