Home
last modified time | relevance | path

Searched refs:NOFREE (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/fs/jfs/
H A Djfs_dmap.c1182 if (leaf[word] == NOFREE) in dbAllocNext()
1372 * control pages to indicate no free space (NOFREE) within
2173 if (dp->tree.stree[word] == NOFREE) in dbFreeDmap()
2296 * NOFREE, dbSplit() will split the binary in dbAllocBits()
2300 dbSplit(tp, word, size, NOFREE, false); in dbAllocBits()
2591 if (oldval == NOFREE) { in dbAdjCtl()
2636 if (dcp->stree[ti] == NOFREE) in dbAdjCtl()
2762 assert(leaf[leafno] == NOFREE); in dbBackSplit()
2783 while (leaf[leafno] == NOFREE) { in dbBackSplit()
2799 if (leaf[bud] != NOFREE) { in dbBackSplit()
[all...]
H A Djfs_dmap.h25 #define NOFREE ((s8) -1) /* no blocks free */ macro
/kernel/linux/linux-6.6/fs/jfs/
H A Djfs_dmap.c1114 if (leaf[word] == NOFREE) in dbAllocNext()
1304 * control pages to indicate no free space (NOFREE) within
2105 if (dp->tree.stree[word] == NOFREE) in dbFreeDmap()
2228 * NOFREE, dbSplit() will split the binary in dbAllocBits()
2232 dbSplit(tp, word, size, NOFREE, false); in dbAllocBits()
2523 if (oldval == NOFREE) { in dbAdjCtl()
2572 if (dcp->stree[ti] == NOFREE) in dbAdjCtl()
2698 assert(leaf[leafno] == NOFREE); in dbBackSplit()
2719 while (leaf[leafno] == NOFREE) { in dbBackSplit()
2735 if (leaf[bud] != NOFREE) { in dbBackSplit()
[all...]
H A Djfs_dmap.h25 #define NOFREE ((s8) -1) /* no blocks free */ macro

Completed in 9 milliseconds