Lines Matching refs:dmtree_t
66 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl);
67 static int dbBackSplit(dmtree_t *tp, int leafno, bool is_ctl);
68 static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl);
69 static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl);
90 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl);
1788 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true);
2035 if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false))
2174 dbBackSplit((dmtree_t *)&dp->tree, word, false);
2209 dmtree_t *tp = (dmtree_t *) & dp->tree;
2356 dmtree_t *tp = (dmtree_t *) & dp->tree;
2592 rc = dbBackSplit((dmtree_t *)dcp, leafno, true);
2597 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);
2599 rc = dbJoin((dmtree_t *) dcp, leafno, newval, true);
2627 dbJoin((dmtree_t *) dcp, leafno,
2637 dbBackSplit((dmtree_t *)
2639 dbSplit((dmtree_t *) dcp, leafno,
2688 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl)
2753 static int dbBackSplit(dmtree_t *tp, int leafno, bool is_ctl)
2832 static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl)
2926 static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl)
2986 * FUNCTION: search a dmtree_t for sufficient free blocks, returning
2990 * the search starts at the top of the dmtree_t tree and
3006 static int dbFindLeaf(dmtree_t *tp, int l2nb, int *leafidx, bool is_ctl)