bp_internal        24 fs/hpfs/anode.c 	if (bp_internal(btree)) {
bp_internal        86 fs/hpfs/anode.c 	if (bp_internal(btree)) {
bp_internal       244 fs/hpfs/anode.c 	ranode->btree.n_free_nodes = (bp_internal(&ranode->btree) ? 60 : 40) - ranode->btree.n_used_nodes;
bp_internal       245 fs/hpfs/anode.c 	if (bp_internal(&ranode->btree)) for (n = 0; n < ranode->btree.n_used_nodes; n++) {
bp_internal       287 fs/hpfs/anode.c 	while (bp_internal(btree1)) {
bp_internal       427 fs/hpfs/anode.c 	while (bp_internal(btree)) {
bp_internal       181 fs/hpfs/map.c  				    (bp_internal(&fnode->btree) ? 12 : 8)) {
bp_internal       188 fs/hpfs/map.c  				    8 + fnode->btree.n_used_nodes * (bp_internal(&fnode->btree) ? 8 : 12)) {
bp_internal       236 fs/hpfs/map.c  			    (bp_internal(&anode->btree) ? 60 : 40)) {
bp_internal       241 fs/hpfs/map.c  			    8 + anode->btree.n_used_nodes * (bp_internal(&anode->btree) ? 8 : 12)) {