Home
last modified time | relevance | path

Searched refs:n_used_nodes (Results 1 – 5 of 5) sorted by relevance

/linux-2.4.37.9/fs/hpfs/
Danode.c24 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()
79 if ((n = btree->n_used_nodes - 1) < -!!fnod) { in hpfs_add_sector_to_btree()
132 anode->btree.n_used_nodes = btree->n_used_nodes; in hpfs_add_sector_to_btree()
134 anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes; in hpfs_add_sector_to_btree()
135 memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12); in hpfs_add_sector_to_btree()
138 btree->n_used_nodes = 1; in hpfs_add_sector_to_btree()
154 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
175 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
193 btree->u.internal[btree->n_used_nodes - 1].file_secno = /*fs*/-1; in hpfs_add_sector_to_btree()
[all …]
Dmap.c133 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
139 8 + fnode->btree.n_used_nodes * (fnode->btree.internal ? 8 : 12)) { in hpfs_map_fnode()
177 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
183 8 + anode->btree.n_used_nodes * (anode->btree.internal ? 8 : 12)) { in hpfs_map_anode()
Dhpfs.h351 unsigned char n_used_nodes; /* used nodes in following array */ member
Dalloc.c449 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()
Dnamei.c53 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()