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,
2523 * newval - the new value of the lower level dmap or dmap control
2536 dbAdjCtl(struct bmap * bmp, s64 blkno, int newval, int alloc, int level)
2597 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);
2599 rc = dbJoin((dmtree_t *) dcp, leafno, newval, true);
2682 * newval - the new value for the leaf.
2688 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl)
2722 dbAdjTree(tp, leafno, newval, is_ctl);
2828 * newval - the new value for the leaf.
2832 static int dbJoin(dmtree_t *tp, int leafno, int newval, bool is_ctl)
2839 if (newval >= tp->dmt_budmin) {
2857 budsz = BUDSIZE(newval, tp->dmt_budmin);
2869 if (newval > leaf[buddy])
2873 if (newval < leaf[buddy])
2898 newval += 1;
2905 dbAdjTree(tp, leafno, newval, is_ctl);
2922 * newval - the new value for the leaf.
2926 static void dbAdjTree(dmtree_t *tp, int leafno, int newval, bool is_ctl)
2943 if (tp->dmt_stree[lp] == newval)
2948 tp->dmt_stree[lp] = newval;