Lines Matching refs:dbSplit
66 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl);
2188 * of the updated dmap word, dbSplit() will split
2191 dbSplit(tp, word, BUDMIN,
2228 * NOFREE, dbSplit() will split the binary
2232 dbSplit(tp, word, size, NOFREE, false);
2506 * dbSplit(); otherwise (deallocation), use dbJoin() to update
2508 * leaf, dbSplit() will also split the binary buddy system of
2520 * the system prior to calling dbSplit() which assumes
2531 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true);
2575 dbSplit((dmtree_t *) dcp, leafno,
2607 * NAME: dbSplit()
2624 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl)
2670 * of binary buddy systems and dbSplit() is used to accomplish
2740 dbSplit(tp, bud, cursz, cursz, is_ctl);