GET_BTREE_PTR
btree = GET_BTREE_PTR(&anode->btree);
btree = GET_BTREE_PTR(&anode->btree);
btree = GET_BTREE_PTR(&fnode->btree);
GET_BTREE_PTR(&anode->btree)->u.internal[0].down = cpu_to_le32(a);
GET_BTREE_PTR(&anode->btree)->u.internal[0].file_secno = cpu_to_le32(-1);
btree = GET_BTREE_PTR(&anode->btree);
btree = GET_BTREE_PTR(&fnode->btree);
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;
if (bp_internal(GET_BTREE_PTR(&ranode->btree))) for (n = 0; n < GET_BTREE_PTR(&ranode->btree)->n_used_nodes; n++) {
btree1 = GET_BTREE_PTR(&anode->btree);
btree = GET_BTREE_PTR(&anode->btree);
btree1 = GET_BTREE_PTR(&anode->btree);
return hpfs_bplus_lookup(s, NULL, GET_BTREE_PTR(&anode->btree), sec, bh);
hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree));
btree = GET_BTREE_PTR(&fnode->btree);
btree = GET_BTREE_PTR(&anode->btree);
btree = GET_BTREE_PTR(&anode->btree);
if (!fnode_is_dir(fnode)) hpfs_remove_btree(s, GET_BTREE_PTR(&fnode->btree));
btree = GET_BTREE_PTR(&fnode->btree);
btree = GET_BTREE_PTR(&anode->btree);
btree = GET_BTREE_PTR(&anode->btree);
hpfs_remove_btree(s, GET_BTREE_PTR(&anode->btree));
GET_BTREE_PTR(&fnode->btree),
(bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 12 : 8)) {
8 + fnode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&fnode->btree)) ? 8 : 12)) {
(bp_internal(GET_BTREE_PTR(&anode->btree)) ? 60 : 40)) {
8 + anode->btree.n_used_nodes * (bp_internal(GET_BTREE_PTR(&anode->btree)) ? 8 : 12)) {