n_free_nodes      466 fs/hpfs/alloc.c 	f->btree.n_free_nodes = 8;
n_free_nodes      483 fs/hpfs/alloc.c 	a->btree.n_free_nodes = 40;
n_free_nodes      124 fs/hpfs/anode.c 	if (!btree->n_free_nodes) {
n_free_nodes      136 fs/hpfs/anode.c 			anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
n_free_nodes      139 fs/hpfs/anode.c 			btree->n_free_nodes = 11;
n_free_nodes      156 fs/hpfs/anode.c 	btree->n_free_nodes--; n = btree->n_used_nodes++;
n_free_nodes      176 fs/hpfs/anode.c 		if (btree->n_free_nodes) {
n_free_nodes      177 fs/hpfs/anode.c 			btree->n_free_nodes--; n = btree->n_used_nodes++;
n_free_nodes      207 fs/hpfs/anode.c 			anode->btree.n_free_nodes = 59;
n_free_nodes      244 fs/hpfs/anode.c 	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
n_free_nodes      255 fs/hpfs/anode.c 	btree->n_free_nodes = fnod ? 10 : 58;
n_free_nodes      418 fs/hpfs/anode.c 			btree->n_free_nodes = 8;
n_free_nodes      428 fs/hpfs/anode.c 		nodes = btree->n_used_nodes + btree->n_free_nodes;
n_free_nodes      438 fs/hpfs/anode.c 		btree->n_free_nodes = nodes - btree->n_used_nodes;
n_free_nodes      453 fs/hpfs/anode.c 	nodes = btree->n_used_nodes + btree->n_free_nodes;
n_free_nodes      472 fs/hpfs/anode.c 	btree->n_free_nodes = nodes - btree->n_used_nodes;
n_free_nodes      406 fs/hpfs/hpfs.h   u8 n_free_nodes;			/* free nodes in following array */
n_free_nodes      180 fs/hpfs/map.c  				if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes !=
n_free_nodes      235 fs/hpfs/map.c  			if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes !=
n_free_nodes       86 fs/hpfs/namei.c 	fnode->btree.n_free_nodes = 7;