fs/hpfs/anode.c

24

if (bp_internal(btree)) {

fs/hpfs/anode.c

245

GET_BTREE_PTR(&ranode->btree)->n_free_nodes = (bp_internal(GET_BTREE_PTR(&ranode->btree)) ? 60 : 40) - GET_BTREE_PTR(&ranode->btree)->n_used_nodes;

fs/hpfs/anode.c

246

if (bp_internal(GET_BTREE_PTR(&ranode->btree))) for (n = 0; n < GET_BTREE_PTR(&ranode->btree)->n_used_nodes; n++) {

fs/hpfs/anode.c

288

while (bp_internal(btree1)) {

fs/hpfs/anode.c

428

while (bp_internal(btree)) {

fs/hpfs/anode.c

87

if (bp_internal(btree)) {

fs/hpfs/map.c

181

(bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 12 : 8)) {

fs/hpfs/map.c

188

8 + fnode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 8 : 12)) {

fs/hpfs/map.c

236

(bp_internal(GET_BTREE_PTR(&anode->btree)) ? 60 : 40)) {

fs/hpfs/map.c

241

8 + anode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&anode->btree)) ? 8 : 12)) {