Home
last modified time | relevance | path

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

/linux-2.4.37.9/fs/hpfs/
Danode.c122 if (!btree->n_free_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()
137 btree->n_free_nodes = 11; in hpfs_add_sector_to_btree()
154 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
174 if (btree->n_free_nodes) { in hpfs_add_sector_to_btree()
175 btree->n_free_nodes--; n = btree->n_used_nodes++; in hpfs_add_sector_to_btree()
202 anode->btree.n_free_nodes = 59; in hpfs_add_sector_to_btree()
237 ranode->btree.n_free_nodes = (ranode->btree.internal ? 60 : 40) - ranode->btree.n_used_nodes; in hpfs_add_sector_to_btree()
248 btree->n_free_nodes = fnod ? 10 : 58; in hpfs_add_sector_to_btree()
411 btree->n_free_nodes = 8; in hpfs_truncate_btree()
[all …]
Dmap.c133 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
177 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
Dhpfs.h350 unsigned char n_free_nodes; /* free nodes in following array */ member
Dalloc.c431 f->btree.n_free_nodes = 8; in hpfs_alloc_fnode()
448 a->btree.n_free_nodes = 40; in hpfs_alloc_anode()
Dnamei.c52 fnode->btree.n_free_nodes = 7; in hpfs_mkdir()