fs/jfs/jfs_dmap.c

1103

if (leaf[word] == NOFREE)

fs/jfs/jfs_dmap.c

2107

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

fs/jfs/jfs_dmap.c

2234

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

fs/jfs/jfs_dmap.c

2525

if (oldval == NOFREE) {

fs/jfs/jfs_dmap.c

2574

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

fs/jfs/jfs_dmap.c

2700

assert(leaf[leafno] == NOFREE);

fs/jfs/jfs_dmap.c

2721

while (leaf[leafno] == NOFREE) {

fs/jfs/jfs_dmap.c

2737

if (leaf[bud] != NOFREE) {

fs/jfs/jfs_dmap.c

2825

dbAdjTree(tp, buddy, NOFREE, is_ctl);

fs/jfs/jfs_dmap.c

2830

dbAdjTree(tp, leafno, NOFREE, is_ctl);

fs/jfs/jfs_dmap.c

3970

*cp++ = NOFREE;