Home
last modified time | relevance | path

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

/fs/hpfs/
Danode.c123 if (!btree->n_free_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()
138 btree->n_free_nodes = 11; in hpfs_add_sector_to_btree()
155 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
175 if (btree->n_free_nodes) { in hpfs_add_sector_to_btree()
176 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
206 anode->btree.n_free_nodes = 59; 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()
254 btree->n_free_nodes = fnod ? 10 : 58; in hpfs_add_sector_to_btree()
417 btree->n_free_nodes = 8; in hpfs_truncate_btree()
[all …]
Dmap.c153 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
208 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
Dalloc.c465 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
482 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
Dhpfs.h405 u8 n_free_nodes; /* free nodes in following array */ member
Dnamei.c85 fnode->btree.n_free_nodes = 7; in hpfs_mkdir()