fs/hpfs/anode.c

25 		for (i = 0; i < btree->n_used_nodes; i++)
37 	for (i = 0; i < btree->n_used_nodes; i++)
81 	if ((n = btree->n_used_nodes - 1) < -!!fnod) {
134 			anode->btree.n_used_nodes = btree->n_used_nodes;
136 			anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
137 			memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);
140 			btree->n_used_nodes = 1;
156 	btree->n_free_nodes--; n = btree->n_used_nodes++;
177 			btree->n_free_nodes--; n = btree->n_used_nodes++;
198 		btree->u.internal[btree->n_used_nodes - 1].file_secno = cpu_to_le32(/*fs*/-1);
206 			anode->btree.n_used_nodes = 1;
244 	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
245 	if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) {
256 	btree->n_used_nodes = 2;
298 	for (i = 0; i < btree1->n_used_nodes; i++)
312 	for (i = 0; i < btree1->n_used_nodes; i++) {
314 			if ((pos = i + 1) < btree1->n_used_nodes)
419 			btree->n_used_nodes = 0;
428 		nodes = btree->n_used_nodes + btree->n_free_nodes;
429 		for (i = 0; i < btree->n_used_nodes; i++)
435 		for (j = i + 1; j < btree->n_used_nodes; j++)
437 		btree->n_used_nodes = i + 1;
438 		btree->n_free_nodes = nodes - btree->n_used_nodes;
439 		btree->first_free = cpu_to_le16(8 + 8 * btree->n_used_nodes);
453 	nodes = btree->n_used_nodes + btree->n_free_nodes;
454 	for (i = 0; i < btree->n_used_nodes; i++)
469 	for (j = i + 1; j < btree->n_used_nodes; j++)
471 	btree->n_used_nodes = i + 1;
472 	btree->n_free_nodes = nodes - btree->n_used_nodes;
473 	btree->first_free = cpu_to_le16(8 + 12 * btree->n_used_nodes);