Home
last modified time | relevance | path

Searched refs:dbSplit (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-5.10/fs/jfs/
H A Djfs_dmap.c66 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl);
2256 * of the updated dmap word, dbSplit() will split in dbAllocBits()
2259 dbSplit(tp, word, BUDMIN, in dbAllocBits()
2296 * NOFREE, dbSplit() will split the binary in dbAllocBits()
2300 dbSplit(tp, word, size, NOFREE, false); in dbAllocBits()
2574 * dbSplit(); otherwise (deallocation), use dbJoin() to update in dbAdjCtl()
2576 * leaf, dbSplit() will also split the binary buddy system of in dbAdjCtl()
2588 * the system prior to calling dbSplit() which assumes in dbAdjCtl()
2597 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true); in dbAdjCtl()
2639 dbSplit((dmtree_ in dbAdjCtl()
2688 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl) dbSplit() function
[all...]
/kernel/linux/linux-6.6/fs/jfs/
H A Djfs_dmap.c66 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl);
2188 * of the updated dmap word, dbSplit() will split in dbAllocBits()
2191 dbSplit(tp, word, BUDMIN, in dbAllocBits()
2228 * NOFREE, dbSplit() will split the binary in dbAllocBits()
2232 dbSplit(tp, word, size, NOFREE, false); in dbAllocBits()
2506 * dbSplit(); otherwise (deallocation), use dbJoin() to update in dbAdjCtl()
2508 * leaf, dbSplit() will also split the binary buddy system of in dbAdjCtl()
2520 * the system prior to calling dbSplit() which assumes in dbAdjCtl()
2531 dbSplit((dmtree_t *) dcp, leafno, dcp->budmin, newval, true); in dbAdjCtl()
2575 dbSplit((dmtree_ in dbAdjCtl()
2624 static void dbSplit(dmtree_t *tp, int leafno, int splitsz, int newval, bool is_ctl) dbSplit() function
[all...]

Completed in 8 milliseconds