68 	struct hfs_bnode *node, *new_node;  in hfs_brec_insert()  local
84 	new_node = NULL;  in hfs_brec_insert()
100 		if (new_node)  in hfs_brec_insert()
102 		new_node = hfs_bnode_split(fd);  in hfs_brec_insert()
103 		if (IS_ERR(new_node))  in hfs_brec_insert()
104 			return PTR_ERR(new_node);  in hfs_brec_insert()
140 	if (!rec && new_node != node) {  in hfs_brec_insert()
145 	if (new_node) {  in hfs_brec_insert()
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()
154 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_insert()
159 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_insert()
162 		hfs_bnode_put(new_node);  in hfs_brec_insert()
163 		new_node = NULL;  in hfs_brec_insert()
234 	struct hfs_bnode *node, *new_node, *next_node;  in hfs_bnode_split()  local
241 	new_node = hfs_bmap_alloc(tree);  in hfs_bnode_split()
242 	if (IS_ERR(new_node))  in hfs_bnode_split()
243 		return new_node;  in hfs_bnode_split()
246 		node->this, new_node->this, node->next);  in hfs_bnode_split()
247 	new_node->next = node->next;  in hfs_bnode_split()
248 	new_node->prev = node->this;  in hfs_bnode_split()
249 	new_node->parent = node->parent;  in hfs_bnode_split()
250 	new_node->type = node->type;  in hfs_bnode_split()
251 	new_node->height = node->height;  in hfs_bnode_split()
260 		hfs_bnode_put(new_node);  in hfs_bnode_split()
276 		hfs_bnode_put(new_node);  in hfs_bnode_split()
291 		hfs_bnode_get(new_node);  in hfs_bnode_split()
292 		fd->bnode = new_node;  in hfs_bnode_split()
297 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
303 	num_recs = new_node->num_recs;  in hfs_bnode_split()
306 		hfs_bnode_write_u16(new_node, new_rec_off, new_off);  in hfs_bnode_split()
313 	hfs_bnode_write_u16(new_node, new_rec_off, new_off);  in hfs_bnode_split()
314 	hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);  in hfs_bnode_split()
317 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_bnode_split()
318 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_bnode_split()
319 	node_desc.type = new_node->type;  in hfs_bnode_split()
320 	node_desc.height = new_node->height;  in hfs_bnode_split()
321 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_bnode_split()
323 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));  in hfs_bnode_split()
326 	node->next = new_node->this;  in hfs_bnode_split()
334 		next_node->prev = new_node->this;  in hfs_bnode_split()
341 		tree->leaf_tail = new_node->this;  in hfs_bnode_split()
346 	hfs_bnode_dump(new_node);  in hfs_bnode_split()
349 	return new_node;  in hfs_bnode_split()
355 	struct hfs_bnode *node, *new_node, *parent;  in hfs_brec_update_parent()  local
362 	new_node = NULL;  in hfs_brec_update_parent()
395 			new_node = hfs_bnode_split(fd);  in hfs_brec_update_parent()
396 			if (IS_ERR(new_node))  in hfs_brec_update_parent()
397 				return PTR_ERR(new_node);  in hfs_brec_update_parent()
425 	if (new_node) {  in hfs_brec_update_parent()
428 		if (!new_node->parent) {  in hfs_brec_update_parent()
430 			new_node->parent = tree->root;  in hfs_brec_update_parent()
432 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
434 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_update_parent()
435 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_update_parent()
440 		hfs_bnode_put(new_node);  in hfs_brec_update_parent()
443 			if (new_node == node)  in hfs_brec_update_parent()
448 		new_node = NULL;  in hfs_brec_update_parent()
460 	struct hfs_bnode *node, *new_node;  in hfs_btree_inc_height()  local
471 	new_node = hfs_bmap_alloc(tree);  in hfs_btree_inc_height()
472 	if (IS_ERR(new_node)) {  in hfs_btree_inc_height()
474 		return PTR_ERR(new_node);  in hfs_btree_inc_height()
477 	tree->root = new_node->this;  in hfs_btree_inc_height()
479 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
480 		new_node->type = HFS_NODE_LEAF;  in hfs_btree_inc_height()
481 		new_node->num_recs = 0;  in hfs_btree_inc_height()
483 		new_node->type = HFS_NODE_INDEX;  in hfs_btree_inc_height()
484 		new_node->num_recs = 1;  in hfs_btree_inc_height()
486 	new_node->parent = 0;  in hfs_btree_inc_height()
487 	new_node->next = 0;  in hfs_btree_inc_height()
488 	new_node->prev = 0;  in hfs_btree_inc_height()
489 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
491 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_btree_inc_height()
492 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_btree_inc_height()
493 	node_desc.type = new_node->type;  in hfs_btree_inc_height()
494 	node_desc.height = new_node->height;  in hfs_btree_inc_height()
495 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_btree_inc_height()
497 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));  in hfs_btree_inc_height()
500 	hfs_bnode_write_u16(new_node, rec, 14);  in hfs_btree_inc_height()
510 		hfs_bnode_copy(new_node, 14, node, 14, key_size);  in hfs_btree_inc_height()
514 			hfs_bnode_write_u8(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
518 		hfs_bnode_write(new_node, &cnid, 14 + key_size, 4);  in hfs_btree_inc_height()
521 		hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);  in hfs_btree_inc_height()
525 	hfs_bnode_put(new_node);  in hfs_btree_inc_height()