Home
last modified time | relevance | path

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

/linux-6.3-rc2/fs/hpfs/
A Danode.c25 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
37 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_bplus_lookup()
134 anode->btree.n_used_nodes = btree->n_used_nodes; in hpfs_add_sector_to_btree()
140 btree->n_used_nodes = 1; in hpfs_add_sector_to_btree()
206 anode->btree.n_used_nodes = 1; in hpfs_add_sector_to_btree()
256 btree->n_used_nodes = 2; in hpfs_add_sector_to_btree()
298 for (i = 0; i < btree1->n_used_nodes; i++) in hpfs_remove_btree()
419 btree->n_used_nodes = 0; in hpfs_truncate_btree()
437 btree->n_used_nodes = i + 1; in hpfs_truncate_btree()
454 for (i = 0; i < btree->n_used_nodes; i++) in hpfs_truncate_btree()
[all …]
A Dmap.c180 if ((unsigned)fnode->btree.n_used_nodes + (unsigned)fnode->btree.n_free_nodes != in hpfs_map_fnode()
188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode()
235 if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes != in hpfs_map_anode()
241 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) { in hpfs_map_anode()
A Dhpfs.h408 u8 n_used_nodes; /* used nodes in following array */ member
A Dalloc.c484 a->btree.n_used_nodes = 0; in hpfs_alloc_anode()
A Dnamei.c88 fnode->btree.n_used_nodes = 1; in hpfs_mkdir()

Completed in 10 milliseconds