67 	struct hfs_bnode *node, *new_node;  in hfs_brec_insert()  local
82 	new_node = NULL;  in hfs_brec_insert()
98 		if (new_node)  in hfs_brec_insert()
100 		new_node = hfs_bnode_split(fd);  in hfs_brec_insert()
101 		if (IS_ERR(new_node))  in hfs_brec_insert()
102 			return PTR_ERR(new_node);  in hfs_brec_insert()
134 	if (new_node) {  in hfs_brec_insert()
138 		if (!rec && new_node != node)  in hfs_brec_insert()
142 		if (!new_node->parent) {  in hfs_brec_insert()
144 			new_node->parent = tree->root;  in hfs_brec_insert()
146 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
149 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_insert()
154 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_insert()
157 		hfs_bnode_put(new_node);  in hfs_brec_insert()
158 		new_node = NULL;  in hfs_brec_insert()
232 	struct hfs_bnode *node, *new_node, *next_node;  in hfs_bnode_split()  local
239 	new_node = hfs_bmap_alloc(tree);  in hfs_bnode_split()
240 	if (IS_ERR(new_node))  in hfs_bnode_split()
241 		return new_node;  in hfs_bnode_split()
244 		node->this, new_node->this, node->next);  in hfs_bnode_split()
245 	new_node->next = node->next;  in hfs_bnode_split()
246 	new_node->prev = node->this;  in hfs_bnode_split()
247 	new_node->parent = node->parent;  in hfs_bnode_split()
248 	new_node->type = node->type;  in hfs_bnode_split()
249 	new_node->height = node->height;  in hfs_bnode_split()
258 		hfs_bnode_put(new_node);  in hfs_bnode_split()
274 		hfs_bnode_put(new_node);  in hfs_bnode_split()
289 		hfs_bnode_get(new_node);  in hfs_bnode_split()
290 		fd->bnode = new_node;  in hfs_bnode_split()
295 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
301 	num_recs = new_node->num_recs;  in hfs_bnode_split()
304 		hfs_bnode_write_u16(new_node, new_rec_off, new_off);  in hfs_bnode_split()
311 	hfs_bnode_write_u16(new_node, new_rec_off, new_off);  in hfs_bnode_split()
312 	hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);  in hfs_bnode_split()
315 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_bnode_split()
316 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_bnode_split()
317 	node_desc.type = new_node->type;  in hfs_bnode_split()
318 	node_desc.height = new_node->height;  in hfs_bnode_split()
319 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_bnode_split()
321 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));  in hfs_bnode_split()
324 	node->next = new_node->this;  in hfs_bnode_split()
332 		next_node->prev = new_node->this;  in hfs_bnode_split()
339 		tree->leaf_tail = new_node->this;  in hfs_bnode_split()
344 	hfs_bnode_dump(new_node);  in hfs_bnode_split()
347 	return new_node;  in hfs_bnode_split()
353 	struct hfs_bnode *node, *new_node, *parent;  in hfs_brec_update_parent()  local
360 	new_node = NULL;  in hfs_brec_update_parent()
391 			new_node = hfs_bnode_split(fd);  in hfs_brec_update_parent()
392 			if (IS_ERR(new_node))  in hfs_brec_update_parent()
393 				return PTR_ERR(new_node);  in hfs_brec_update_parent()
421 	if (new_node) {  in hfs_brec_update_parent()
424 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
426 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_update_parent()
427 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_update_parent()
432 		hfs_bnode_put(new_node);  in hfs_brec_update_parent()
435 			if (new_node == node)  in hfs_brec_update_parent()
451 	struct hfs_bnode *node, *new_node;  in hfs_btree_inc_height()  local
462 	new_node = hfs_bmap_alloc(tree);  in hfs_btree_inc_height()
463 	if (IS_ERR(new_node)) {  in hfs_btree_inc_height()
465 		return PTR_ERR(new_node);  in hfs_btree_inc_height()
468 	tree->root = new_node->this;  in hfs_btree_inc_height()
470 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
471 		new_node->type = HFS_NODE_LEAF;  in hfs_btree_inc_height()
472 		new_node->num_recs = 0;  in hfs_btree_inc_height()
474 		new_node->type = HFS_NODE_INDEX;  in hfs_btree_inc_height()
475 		new_node->num_recs = 1;  in hfs_btree_inc_height()
477 	new_node->parent = 0;  in hfs_btree_inc_height()
478 	new_node->next = 0;  in hfs_btree_inc_height()
479 	new_node->prev = 0;  in hfs_btree_inc_height()
480 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
482 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_btree_inc_height()
483 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_btree_inc_height()
484 	node_desc.type = new_node->type;  in hfs_btree_inc_height()
485 	node_desc.height = new_node->height;  in hfs_btree_inc_height()
486 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_btree_inc_height()
488 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));  in hfs_btree_inc_height()
491 	hfs_bnode_write_u16(new_node, rec, 14);  in hfs_btree_inc_height()
501 		hfs_bnode_copy(new_node, 14, node, 14, key_size);  in hfs_btree_inc_height()
505 			hfs_bnode_write_u8(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
509 		hfs_bnode_write(new_node, &cnid, 14 + key_size, 4);  in hfs_btree_inc_height()
512 		hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);  in hfs_btree_inc_height()
516 	hfs_bnode_put(new_node);  in hfs_btree_inc_height()