NOFREE           1154 fs/jfs/jfs_dmap.c 	if (leaf[word] == NOFREE)
NOFREE           2038 fs/jfs/jfs_dmap.c 		if (dp->tree.stree[word] == NOFREE)
NOFREE           2165 fs/jfs/jfs_dmap.c 				dbSplit(tp, word, size, NOFREE);
NOFREE           2457 fs/jfs/jfs_dmap.c 		if (oldval == NOFREE) {
NOFREE           2502 fs/jfs/jfs_dmap.c 					if (dcp->stree[ti] == NOFREE)
NOFREE           2629 fs/jfs/jfs_dmap.c 	assert(leaf[leafno] == NOFREE);
NOFREE           2650 fs/jfs/jfs_dmap.c 	while (leaf[leafno] == NOFREE) {
NOFREE           2666 fs/jfs/jfs_dmap.c 			if (leaf[bud] != NOFREE) {
NOFREE           2754 fs/jfs/jfs_dmap.c 				dbAdjTree(tp, buddy, NOFREE);
NOFREE           2759 fs/jfs/jfs_dmap.c 				dbAdjTree(tp, leafno, NOFREE);
NOFREE           3886 fs/jfs/jfs_dmap.c 		*cp++ = NOFREE;