NOFREE           1144 fs/jfs/jfs_dmap.c 	if (leaf[word] == NOFREE)
NOFREE           2132 fs/jfs/jfs_dmap.c 		if (dp->tree.stree[word] == NOFREE)
NOFREE           2259 fs/jfs/jfs_dmap.c 				dbSplit(tp, word, size, NOFREE);
NOFREE           2550 fs/jfs/jfs_dmap.c 		if (oldval == NOFREE) {
NOFREE           2595 fs/jfs/jfs_dmap.c 					if (dcp->stree[ti] == NOFREE)
NOFREE           2721 fs/jfs/jfs_dmap.c 	assert(leaf[leafno] == NOFREE);
NOFREE           2742 fs/jfs/jfs_dmap.c 	while (leaf[leafno] == NOFREE) {
NOFREE           2758 fs/jfs/jfs_dmap.c 			if (leaf[bud] != NOFREE) {
NOFREE           2846 fs/jfs/jfs_dmap.c 				dbAdjTree(tp, buddy, NOFREE);
NOFREE           2851 fs/jfs/jfs_dmap.c 				dbAdjTree(tp, leafno, NOFREE);
NOFREE           3974 fs/jfs/jfs_dmap.c 		*cp++ = NOFREE;