Lines Matching defs:newval
66 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, 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);
70 static int dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc,
2455 * newval - the new value of the lower level dmap or dmap control
2468 dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc, int level)
2531 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);
2533 rc = dbJoin((dmtree_t *) dcp, leafno, newval, true);
2618 * newval - the new value for the leaf.
2624 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl)
2658 dbAdjTree(tp, leafno, newval, is_ctl);
2764 * newval - the new value for the leaf.
2768 static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl)
2775 if (newval >= tp->dmt_budmin) {
2793 budsz = BUDSIZE(newval, tp->dmt_budmin);
2805 if (newval > leaf[buddy])
2809 if (newval < leaf[buddy])
2834 newval += 1;
2841 dbAdjTree(tp, leafno, newval, is_ctl);
2858 * newval - the new value for the leaf.
2862 static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl)
2879 if (tp->dmt_stree[lp] == newval)
2884 tp->dmt_stree[lp] = newval;