Searched refs:bp_internal (Results 1 – 3 of 3) sorted by relevance
181 (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()
24 if (bp_internal(btree)) { in hpfs_bplus_lookup()87 if (bp_internal(btree)) { in hpfs_add_sector_to_btree()245 …GET_BTREE_PTR(&ranode->btree)->n_free_nodes = (bp_internal(GET_BTREE_PTR(&ranode->btree)) ? 60 : 4… in hpfs_add_sector_to_btree()246 …if (bp_internal(GET_BTREE_PTR(&ranode->btree))) for (n = 0; n < GET_BTREE_PTR(&ranode->btree)->n_u… in hpfs_add_sector_to_btree()288 while (bp_internal(btree1)) { in hpfs_remove_btree()428 while (bp_internal(btree)) { in hpfs_truncate_btree()
437 static inline bool bp_internal(struct bplus_header *bp) in bp_internal() function