fs/jfs/jfs_dmap.c

1190

if (leaf[word] == NOFREE)

fs/jfs/jfs_dmap.c

187

if (budmin == NOFREE) {

fs/jfs/jfs_dmap.c

210

if (unlikely(val < NOFREE)) {

fs/jfs/jfs_dmap.c

2194

if (dp->tree.stree[word] == NOFREE)

fs/jfs/jfs_dmap.c

2321

dbSplit(tp, word, size, NOFREE, false);

fs/jfs/jfs_dmap.c

2612

if (oldval == NOFREE) {

fs/jfs/jfs_dmap.c

2661

if (dcp->stree[ti] == NOFREE)

fs/jfs/jfs_dmap.c

2787

assert(leaf[leafno] == NOFREE);

fs/jfs/jfs_dmap.c

2808

while (leaf[leafno] == NOFREE) {

fs/jfs/jfs_dmap.c

2824

if (leaf[bud] != NOFREE) {

fs/jfs/jfs_dmap.c

2912

dbAdjTree(tp, buddy, NOFREE, is_ctl);

fs/jfs/jfs_dmap.c

2917

dbAdjTree(tp, leafno, NOFREE, is_ctl);

fs/jfs/jfs_dmap.c

4078

*cp++ = NOFREE;