24 		for (i = 0; i < btree->n_used_nodes; i++)  in hpfs_bplus_lookup()
36 	for (i = 0; i < btree->n_used_nodes; i++)  in hpfs_bplus_lookup()
80 	if ((n = btree->n_used_nodes - 1) < -!!fnod) {  in hpfs_add_sector_to_btree()
133 			anode->btree.n_used_nodes = btree->n_used_nodes;  in hpfs_add_sector_to_btree()
135 			anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;  in hpfs_add_sector_to_btree()
136 			memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);  in hpfs_add_sector_to_btree()
139 			btree->n_used_nodes = 1;  in hpfs_add_sector_to_btree()
155 	btree->n_free_nodes--; n = btree->n_used_nodes++;  in hpfs_add_sector_to_btree()
176 			btree->n_free_nodes--; n = btree->n_used_nodes++;  in hpfs_add_sector_to_btree()
197 		btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/*fs*/-1);  in hpfs_add_sector_to_btree()
205 			anode->btree.n_used_nodes = 1;  in hpfs_add_sector_to_btree()
243 	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;  in hpfs_add_sector_to_btree()
244 	if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) {  in hpfs_add_sector_to_btree()
255 	btree->n_used_nodes = 2;  in hpfs_add_sector_to_btree()
297 	for (i = 0; i < btree1->n_used_nodes; i++)  in hpfs_remove_btree()
311 	for (i = 0; i < btree1->n_used_nodes; i++) {  in hpfs_remove_btree()
313 			if ((pos = i + 1) < btree1->n_used_nodes)  in hpfs_remove_btree()
418 			btree->n_used_nodes = 0;  in hpfs_truncate_btree()
427 		nodes = btree->n_used_nodes + btree->n_free_nodes;  in hpfs_truncate_btree()
428 		for (i = 0; i < btree->n_used_nodes; i++)  in hpfs_truncate_btree()
434 		for (j = i + 1; j < btree->n_used_nodes; j++)  in hpfs_truncate_btree()
436 		btree->n_used_nodes = i + 1;  in hpfs_truncate_btree()
437 		btree->n_free_nodes = nodes - btree->n_used_nodes;  in hpfs_truncate_btree()
438 		btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes);  in hpfs_truncate_btree()
452 	nodes = btree->n_used_nodes + btree->n_free_nodes;  in hpfs_truncate_btree()
453 	for (i = 0; i < btree->n_used_nodes; i++)  in hpfs_truncate_btree()
468 	for (j = i + 1; j < btree->n_used_nodes; j++)  in hpfs_truncate_btree()
470 	btree->n_used_nodes = i + 1;  in hpfs_truncate_btree()
471 	btree->n_free_nodes = nodes - btree->n_used_nodes;  in hpfs_truncate_btree()
472 	btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes);  in hpfs_truncate_btree()