n_used_nodes      484 fs/hpfs/alloc.c 	a->btree.n_used_nodes = 0;
n_used_nodes       25 fs/hpfs/anode.c 		for (i = 0; i < btree->n_used_nodes; i++)
n_used_nodes       37 fs/hpfs/anode.c 	for (i = 0; i < btree->n_used_nodes; i++)
n_used_nodes       81 fs/hpfs/anode.c 	if ((n = btree->n_used_nodes - 1) < -!!fnod) {
n_used_nodes      134 fs/hpfs/anode.c 			anode->btree.n_used_nodes = btree->n_used_nodes;
n_used_nodes      136 fs/hpfs/anode.c 			anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
n_used_nodes      137 fs/hpfs/anode.c 			memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);
n_used_nodes      140 fs/hpfs/anode.c 			btree->n_used_nodes = 1;
n_used_nodes      156 fs/hpfs/anode.c 	btree->n_free_nodes--; n = btree->n_used_nodes++;
n_used_nodes      177 fs/hpfs/anode.c 			btree->n_free_nodes--; n = btree->n_used_nodes++;
n_used_nodes      198 fs/hpfs/anode.c 		btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/*fs*/-1);
n_used_nodes      206 fs/hpfs/anode.c 			anode->btree.n_used_nodes = 1;
n_used_nodes      244 fs/hpfs/anode.c 	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
n_used_nodes      245 fs/hpfs/anode.c 	if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) {
n_used_nodes      256 fs/hpfs/anode.c 	btree->n_used_nodes = 2;
n_used_nodes      298 fs/hpfs/anode.c 	for (i = 0; i < btree1->n_used_nodes; i++)
n_used_nodes      312 fs/hpfs/anode.c 	for (i = 0; i < btree1->n_used_nodes; i++) {
n_used_nodes      314 fs/hpfs/anode.c 			if ((pos = i + 1) < btree1->n_used_nodes)
n_used_nodes      419 fs/hpfs/anode.c 			btree->n_used_nodes = 0;
n_used_nodes      428 fs/hpfs/anode.c 		nodes = btree->n_used_nodes + btree->n_free_nodes;
n_used_nodes      429 fs/hpfs/anode.c 		for (i = 0; i < btree->n_used_nodes; i++)
n_used_nodes      435 fs/hpfs/anode.c 		for (j = i + 1; j < btree->n_used_nodes; j++)
n_used_nodes      437 fs/hpfs/anode.c 		btree->n_used_nodes = i + 1;
n_used_nodes      438 fs/hpfs/anode.c 		btree->n_free_nodes = nodes - btree->n_used_nodes;
n_used_nodes      439 fs/hpfs/anode.c 		btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes);
n_used_nodes      453 fs/hpfs/anode.c 	nodes = btree->n_used_nodes + btree->n_free_nodes;
n_used_nodes      454 fs/hpfs/anode.c 	for (i = 0; i < btree->n_used_nodes; i++)
n_used_nodes      469 fs/hpfs/anode.c 	for (j = i + 1; j < btree->n_used_nodes; j++)
n_used_nodes      471 fs/hpfs/anode.c 	btree->n_used_nodes = i + 1;
n_used_nodes      472 fs/hpfs/anode.c 	btree->n_free_nodes = nodes - btree->n_used_nodes;
n_used_nodes      473 fs/hpfs/anode.c 	btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes);
n_used_nodes      407 fs/hpfs/hpfs.h   u8 n_used_nodes;			/* used nodes in following array */
n_used_nodes      180 fs/hpfs/map.c  				if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes !=
n_used_nodes      188 fs/hpfs/map.c  				    8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) {
n_used_nodes      235 fs/hpfs/map.c  			if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes !=
n_used_nodes      241 fs/hpfs/map.c  			    8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) {
n_used_nodes       87 fs/hpfs/namei.c 	fnode->btree.n_used_nodes = 1;