141 		if (!new_node->parent) {  in hfs_brec_insert()
143 			new_node->parent = tree->root;  in hfs_brec_insert()
145 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
178 	struct hfs_bnode *node, *parent;  in hfs_brec_remove()  local
196 		if (!node->parent)  in hfs_brec_remove()
198 		parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_remove()
199 		if (IS_ERR(parent))  in hfs_brec_remove()
200 			return PTR_ERR(parent);  in hfs_brec_remove()
202 		node = fd->bnode = parent;  in hfs_brec_remove()
249 	new_node->parent = node->parent;  in hfs_bnode_split()
355 	struct hfs_bnode *node, *new_node, *parent;  in hfs_brec_update_parent()  local
363 	if (!node->parent)  in hfs_brec_update_parent()
367 	parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_update_parent()
368 	if (IS_ERR(parent))  in hfs_brec_update_parent()
369 		return PTR_ERR(parent);  in hfs_brec_update_parent()
370 	__hfs_brec_find(parent, fd);  in hfs_brec_update_parent()
371 	hfs_bnode_dump(parent);  in hfs_brec_update_parent()
383 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
388 		end_off = hfs_bnode_read_u16(parent, end_rec_off);  in hfs_brec_update_parent()
392 			fd->bnode = parent;  in hfs_brec_update_parent()
396 			parent = fd->bnode;  in hfs_brec_update_parent()
400 				(parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
404 	end_off = start_off = hfs_bnode_read_u16(parent, rec_off);  in hfs_brec_update_parent()
405 	hfs_bnode_write_u16(parent, rec_off, start_off + diff);  in hfs_brec_update_parent()
410 		end_off = hfs_bnode_read_u16(parent, rec_off);  in hfs_brec_update_parent()
411 		hfs_bnode_write_u16(parent, rec_off, end_off + diff);  in hfs_brec_update_parent()
413 	hfs_bnode_move(parent, start_off + diff, start_off,  in hfs_brec_update_parent()
416 	hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);  in hfs_brec_update_parent()
417 	hfs_bnode_dump(parent);  in hfs_brec_update_parent()
420 	node = parent;  in hfs_brec_update_parent()
425 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
443 	if (!rec && node->parent)  in hfs_brec_update_parent()
478 	new_node->parent = 0;  in hfs_btree_inc_height()
496 		node->parent = tree->root;  in hfs_btree_inc_height()