65 	struct hfs_bnode *node, *new_node;  in hfs_brec_insert()  local
80 	new_node = NULL;  in hfs_brec_insert()
96 		if (new_node)  in hfs_brec_insert()
98 		new_node = hfs_bnode_split(fd);  in hfs_brec_insert()
99 		if (IS_ERR(new_node))  in hfs_brec_insert()
100 			return PTR_ERR(new_node);  in hfs_brec_insert()
138 	if (!rec && new_node != node) {  in hfs_brec_insert()
143 	if (new_node) {  in hfs_brec_insert()
145 		if (!new_node->parent) {  in hfs_brec_insert()
147 			new_node->parent = tree->root;  in hfs_brec_insert()
149 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
152 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_insert()
157 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_insert()
160 		hfs_bnode_put(new_node);  in hfs_brec_insert()
161 		new_node = NULL;  in hfs_brec_insert()
236 	struct hfs_bnode *node, *new_node, *next_node;  in hfs_bnode_split()  local
243 	new_node = hfs_bmap_alloc(tree);  in hfs_bnode_split()
244 	if (IS_ERR(new_node))  in hfs_bnode_split()
245 		return new_node;  in hfs_bnode_split()
248 		node->this, new_node->this, node->next);  in hfs_bnode_split()
249 	new_node->next = node->next;  in hfs_bnode_split()
250 	new_node->prev = node->this;  in hfs_bnode_split()
251 	new_node->parent = node->parent;  in hfs_bnode_split()
252 	new_node->type = node->type;  in hfs_bnode_split()
253 	new_node->height = node->height;  in hfs_bnode_split()
262 		hfs_bnode_put(new_node);  in hfs_bnode_split()
278 		hfs_bnode_put(new_node);  in hfs_bnode_split()
293 		hfs_bnode_get(new_node);  in hfs_bnode_split()
294 		fd->bnode = new_node;  in hfs_bnode_split()
299 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
305 	num_recs = new_node->num_recs;  in hfs_bnode_split()
308 		hfs_bnode_write_u16(new_node, new_rec_off, new_off);  in hfs_bnode_split()
315 	hfs_bnode_write_u16(new_node, new_rec_off, new_off);  in hfs_bnode_split()
316 	hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);  in hfs_bnode_split()
319 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_bnode_split()
320 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_bnode_split()
321 	node_desc.type = new_node->type;  in hfs_bnode_split()
322 	node_desc.height = new_node->height;  in hfs_bnode_split()
323 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_bnode_split()
325 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));  in hfs_bnode_split()
328 	node->next = new_node->this;  in hfs_bnode_split()
336 		next_node->prev = new_node->this;  in hfs_bnode_split()
343 		tree->leaf_tail = new_node->this;  in hfs_bnode_split()
348 	hfs_bnode_dump(new_node);  in hfs_bnode_split()
351 	return new_node;  in hfs_bnode_split()
357 	struct hfs_bnode *node, *new_node, *parent;  in hfs_brec_update_parent()  local
364 	new_node = NULL;  in hfs_brec_update_parent()
398 			new_node = hfs_bnode_split(fd);  in hfs_brec_update_parent()
399 			if (IS_ERR(new_node))  in hfs_brec_update_parent()
400 				return PTR_ERR(new_node);  in hfs_brec_update_parent()
427 	if (new_node) {  in hfs_brec_update_parent()
430 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
432 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_update_parent()
433 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_update_parent()
438 		hfs_bnode_put(new_node);  in hfs_brec_update_parent()
441 			if (new_node == node)  in hfs_brec_update_parent()
457 	struct hfs_bnode *node, *new_node;  in hfs_btree_inc_height()  local
468 	new_node = hfs_bmap_alloc(tree);  in hfs_btree_inc_height()
469 	if (IS_ERR(new_node)) {  in hfs_btree_inc_height()
471 		return PTR_ERR(new_node);  in hfs_btree_inc_height()
474 	tree->root = new_node->this;  in hfs_btree_inc_height()
476 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
477 		new_node->type = HFS_NODE_LEAF;  in hfs_btree_inc_height()
478 		new_node->num_recs = 0;  in hfs_btree_inc_height()
480 		new_node->type = HFS_NODE_INDEX;  in hfs_btree_inc_height()
481 		new_node->num_recs = 1;  in hfs_btree_inc_height()
483 	new_node->parent = 0;  in hfs_btree_inc_height()
484 	new_node->next = 0;  in hfs_btree_inc_height()
485 	new_node->prev = 0;  in hfs_btree_inc_height()
486 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
488 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_btree_inc_height()
489 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_btree_inc_height()
490 	node_desc.type = new_node->type;  in hfs_btree_inc_height()
491 	node_desc.height = new_node->height;  in hfs_btree_inc_height()
492 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_btree_inc_height()
494 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));  in hfs_btree_inc_height()
497 	hfs_bnode_write_u16(new_node, rec, 14);  in hfs_btree_inc_height()
508 		hfs_bnode_copy(new_node, 14, node, 14, key_size);  in hfs_btree_inc_height()
513 			hfs_bnode_write_u16(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
516 		hfs_bnode_write(new_node, &cnid, 14 + key_size, 4);  in hfs_btree_inc_height()
519 		hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);  in hfs_btree_inc_height()
523 	hfs_bnode_put(new_node);  in hfs_btree_inc_height()