Lines Matching refs:dmtree_t
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);
90 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx);
1690 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx); in dbFindCtl()
1937 if (dbFindLeaf((dmtree_t *) & dp->tree, l2nb, &leafidx)) in dbAllocDmapLev()
2073 dbBackSplit((dmtree_t *) & dp->tree, word); in dbFreeDmap()
2108 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbAllocBits()
2255 dmtree_t *tp = (dmtree_t *) & dp->tree; in dbFreeBits()
2491 rc = dbBackSplit((dmtree_t *) dcp, leafno); in dbAdjCtl()
2498 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval); in dbAdjCtl()
2500 rc = dbJoin((dmtree_t *) dcp, leafno, newval); in dbAdjCtl()
2530 dbJoin((dmtree_t *) dcp, leafno, in dbAdjCtl()
2540 dbBackSplit((dmtree_t *) in dbAdjCtl()
2542 dbSplit((dmtree_t *) dcp, leafno, in dbAdjCtl()
2591 static void dbSplit(dmtree_t * tp, int leafno, int splitsz, int newval) in dbSplit()
2656 static int dbBackSplit(dmtree_t * tp, int leafno) in dbBackSplit()
2735 static int dbJoin(dmtree_t * tp, int leafno, int newval) in dbJoin()
2829 static void dbAdjTree(dmtree_t * tp, int leafno, int newval) in dbAdjTree()
2903 static int dbFindLeaf(dmtree_t * tp, int l2nb, int *leafidx) in dbFindLeaf()