74 	if (!fd->bnode) {  in hfs_brec_insert()
77 		fd->bnode = hfs_bnode_find(tree, tree->leaf_head);  in hfs_brec_insert()
78 		if (IS_ERR(fd->bnode))  in hfs_brec_insert()
79 			return PTR_ERR(fd->bnode);  in hfs_brec_insert()
89 	node = fd->bnode;  in hfs_brec_insert()
144 		hfs_bnode_put(fd->bnode);  in hfs_brec_insert()
149 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
158 		__hfs_brec_find(fd->bnode, fd);  in hfs_brec_insert()
182 	node = fd->bnode;  in hfs_brec_remove()
202 		node = fd->bnode = parent;  in hfs_brec_remove()
238 	node = fd->bnode;  in hfs_bnode_split()
290 		fd->bnode = new_node;  in hfs_bnode_split()
359 	node = fd->bnode;  in hfs_brec_update_parent()
392 			fd->bnode = parent;  in hfs_brec_update_parent()
396 			parent = fd->bnode;  in hfs_brec_update_parent()
426 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
431 		__hfs_brec_find(fd->bnode, fd);  in hfs_brec_update_parent()
433 		hfs_bnode_put(fd->bnode);  in hfs_brec_update_parent()
447 	fd->bnode = node;  in hfs_brec_update_parent()