147 		if (!new_node->parent) {  in hfs_brec_insert()
149 			new_node->parent = tree->root;  in hfs_brec_insert()
151 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
182 	struct hfs_bnode *node, *parent;  in hfs_brec_remove()  local
200 		if (!node->parent)  in hfs_brec_remove()
202 		parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_remove()
203 		if (IS_ERR(parent))  in hfs_brec_remove()
204 			return PTR_ERR(parent);  in hfs_brec_remove()
206 		node = fd->bnode = parent;  in hfs_brec_remove()
253 	new_node->parent = node->parent;  in hfs_bnode_split()
359 	struct hfs_bnode *node, *new_node, *parent;  in hfs_brec_update_parent()  local
367 	if (!node->parent)  in hfs_brec_update_parent()
371 	parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_update_parent()
372 	if (IS_ERR(parent))  in hfs_brec_update_parent()
373 		return PTR_ERR(parent);  in hfs_brec_update_parent()
374 	__hfs_brec_find(parent, fd, hfs_find_rec_by_key);  in hfs_brec_update_parent()
377 	hfs_bnode_dump(parent);  in hfs_brec_update_parent()
390 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
395 		end_off = hfs_bnode_read_u16(parent, end_rec_off);  in hfs_brec_update_parent()
399 			fd->bnode = parent;  in hfs_brec_update_parent()
403 			parent = fd->bnode;  in hfs_brec_update_parent()
407 				(parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
411 	end_off = start_off = hfs_bnode_read_u16(parent, rec_off);  in hfs_brec_update_parent()
412 	hfs_bnode_write_u16(parent, rec_off, start_off + diff);  in hfs_brec_update_parent()
417 		end_off = hfs_bnode_read_u16(parent, rec_off);  in hfs_brec_update_parent()
418 		hfs_bnode_write_u16(parent, rec_off, end_off + diff);  in hfs_brec_update_parent()
420 	hfs_bnode_move(parent, start_off + diff, start_off,  in hfs_brec_update_parent()
423 	hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);  in hfs_brec_update_parent()
424 	hfs_bnode_dump(parent);  in hfs_brec_update_parent()
427 	node = parent;  in hfs_brec_update_parent()
432 		if (!new_node->parent) {  in hfs_brec_update_parent()
434 			new_node->parent = tree->root;  in hfs_brec_update_parent()
436 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
455 	if (!rec && node->parent)  in hfs_brec_update_parent()
490 	new_node->parent = 0;  in hfs_btree_inc_height()
508 		node->parent = tree->root;  in hfs_btree_inc_height()