Searched refs:bp_internal (Results 1 – 3 of 3) sorted by relevance
181 (bp_internal(&fnode->btree) ? 12 : 8)) { in hpfs_map_fnode()188 8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) { in hpfs_map_fnode()236 (bp_internal(&anode->btree) ? 60 : 40)) { in hpfs_map_anode()241 8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) { in hpfs_map_anode()
24 if (bp_internal(btree)) { in hpfs_bplus_lookup()86 if (bp_internal(btree)) { 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()245 if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) { in hpfs_add_sector_to_btree()287 while (bp_internal(btree1)) { in hpfs_remove_btree()427 while (bp_internal(btree)) { in hpfs_truncate_btree()
419 static inline bool bp_internal(struct bplus_header *bp) in bp_internal() function