Home
last modified time | relevance | path

Searched refs:dmtree_t (Results 1 - 4 of 4) 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);
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); in dbFindCtl()
2035 if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false)) in dbAllocDmapLev()
2174 dbBackSplit((dmtree_t *)&dp->tree, word, false); in dbFreeDmap()
2209 dmtree_t *tp = (dmtree_t *) in dbAllocBits()
[all...]
H A Djfs_dmap.h178 } dmtree_t; typedef
/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);
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);
1720 rc = dbFindLeaf((dmtree_t *) dcp, l2nb, &leafidx, true); in dbFindCtl()
1967 if (dbFindLeaf((dmtree_t *) &dp->tree, l2nb, &leafidx, false)) in dbAllocDmapLev()
2106 dbBackSplit((dmtree_t *)&dp->tree, word, false); in dbFreeDmap()
2141 dmtree_t *tp = (dmtree_t *) in dbAllocBits()
[all...]
H A Djfs_dmap.h178 } dmtree_t; typedef

Completed in 8 milliseconds