Home
last modified time | relevance | path

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

/linux-4.19.296/fs/hpfs/
Danode.c124 if (!btree->n_free_nodes) { in hpfs_add_sector_to_btree()
136 anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes; in hpfs_add_sector_to_btree()
139 btree->n_free_nodes = 11; in hpfs_add_sector_to_btree()
156 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
176 if (btree->n_free_nodes) { in hpfs_add_sector_to_btree()
177 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
207 anode->btree.n_free_nodes = 59; in hpfs_add_sector_to_btree()
244 ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes; in hpfs_add_sector_to_btree()
255 btree->n_free_nodes = fnod ? 10 : 58; in hpfs_add_sector_to_btree()
418 btree->n_free_nodes = 8; in hpfs_truncate_btree()
[all …]
Dmap.c180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
Dalloc.c466 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
483 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
Dhpfs.h406 u8 n_free_nodes; /* free nodes in following array */ member
Dnamei.c86 fnode->btree.n_free_nodes = 7; in hpfs_mkdir()