Home
last modified time | relevance | path

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

/linux/fs/hpfs/
H A Danode.c30 btree = GET_BTREE_PTR(&anode->btree); in hpfs_bplus_lookup()
75 btree = GET_BTREE_PTR(&fnode->btree); in hpfs_add_sector_to_btree()
78 btree = GET_BTREE_PTR(&anode->btree); in hpfs_add_sector_to_btree()
95 btree = GET_BTREE_PTR(&anode->btree); in hpfs_add_sector_to_btree()
155 btree = GET_BTREE_PTR(&anode->btree); in hpfs_add_sector_to_btree()
172 btree = GET_BTREE_PTR(&anode->btree); in hpfs_add_sector_to_btree()
175 btree = GET_BTREE_PTR(&fnode->btree); in hpfs_add_sector_to_btree()
210 GET_BTREE_PTR(&anode->btree)->u.internal[0].down = cpu_to_le32(a); in hpfs_add_sector_to_btree()
211 GET_BTREE_PTR(&anode->btree)->u.internal[0].file_secno = cpu_to_le32(-1); in hpfs_add_sector_to_btree()
233 btree = GET_BTREE_PTR(&anode->btree); in hpfs_add_sector_to_btree()
[all …]
H A Dmap.c181 (bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 12 : 8)) { in hpfs_map_fnode()
188 8 + fnode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 8 : 12)) { in hpfs_map_fnode()
236 (bp_internal(GET_BTREE_PTR(&anode->btree)) ? 60 : 40)) { in hpfs_map_anode()
241 8 + anode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&anode->btree)) ? 8 : 12)) { in hpfs_map_anode()
H A Dhpfs.h407 #define GET_BTREE_PTR(ptr) \ macro
H A Dfile.c55 GET_BTREE_PTR(&fnode->btree), in hpfs_bmap()
H A Dea.c44 hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree)); in hpfs_ea_ext_remove()