fs/hfsplus/brec.c

66 	struct hfs_bnode *node, *new_node;
82 	new_node = NULL;
98 		if (new_node)
100 		new_node = hfs_bnode_split(fd);
101 		if (IS_ERR(new_node))
102 			return PTR_ERR(new_node);
140 	if (!rec && new_node != node) {
145 	if (new_node) {
147 		if (!new_node->parent) {
149 			new_node->parent = tree->root;
151 		fd->bnode = hfs_bnode_find(tree, new_node->parent);
154 		cnid = cpu_to_be32(new_node->this);
159 		hfs_bnode_read_key(new_node, fd->search_key, 14);
162 		hfs_bnode_put(new_node);
163 		new_node = NULL;
238 	struct hfs_bnode *node, *new_node, *next_node;
245 	new_node = hfs_bmap_alloc(tree);
246 	if (IS_ERR(new_node))
247 		return new_node;
250 		node->this, new_node->this, node->next);
251 	new_node->next = node->next;
252 	new_node->prev = node->this;
253 	new_node->parent = node->parent;
254 	new_node->type = node->type;
255 	new_node->height = node->height;
264 		hfs_bnode_put(new_node);
280 		hfs_bnode_put(new_node);
295 		hfs_bnode_get(new_node);
296 		fd->bnode = new_node;
301 	new_node->num_recs = node->num_recs - num_recs;
307 	num_recs = new_node->num_recs;
310 		hfs_bnode_write_u16(new_node, new_rec_off, new_off);
317 	hfs_bnode_write_u16(new_node, new_rec_off, new_off);
318 	hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);
321 	node_desc.next = cpu_to_be32(new_node->next);
322 	node_desc.prev = cpu_to_be32(new_node->prev);
323 	node_desc.type = new_node->type;
324 	node_desc.height = new_node->height;
325 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);
327 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));
330 	node->next = new_node->this;
338 		next_node->prev = new_node->this;
345 		tree->leaf_tail = new_node->this;
350 	hfs_bnode_dump(new_node);
353 	return new_node;
359 	struct hfs_bnode *node, *new_node, *parent;
366 	new_node = NULL;
400 			new_node = hfs_bnode_split(fd);
401 			if (IS_ERR(new_node))
402 				return PTR_ERR(new_node);
429 	if (new_node) {
432 		if (!new_node->parent) {
434 			new_node->parent = tree->root;
436 		fd->bnode = hfs_bnode_find(tree, new_node->parent);
438 		hfs_bnode_read_key(new_node, fd->search_key, 14);
439 		cnid = cpu_to_be32(new_node->this);
444 		hfs_bnode_put(new_node);
447 			if (new_node == node)
452 		new_node = NULL;
464 	struct hfs_bnode *node, *new_node;
475 	new_node = hfs_bmap_alloc(tree);
476 	if (IS_ERR(new_node)) {
478 		return PTR_ERR(new_node);
481 	tree->root = new_node->this;
483 		tree->leaf_head = tree->leaf_tail = new_node->this;
484 		new_node->type = HFS_NODE_LEAF;
485 		new_node->num_recs = 0;
487 		new_node->type = HFS_NODE_INDEX;
488 		new_node->num_recs = 1;
490 	new_node->parent = 0;
491 	new_node->next = 0;
492 	new_node->prev = 0;
493 	new_node->height = ++tree->depth;
495 	node_desc.next = cpu_to_be32(new_node->next);
496 	node_desc.prev = cpu_to_be32(new_node->prev);
497 	node_desc.type = new_node->type;
498 	node_desc.height = new_node->height;
499 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);
501 	hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc));
504 	hfs_bnode_write_u16(new_node, rec, 14);
515 		hfs_bnode_copy(new_node, 14, node, 14, key_size);
520 			hfs_bnode_write_u16(new_node, 14, tree->max_key_len);
523 		hfs_bnode_write(new_node, &cnid, 14 + key_size, 4);
526 		hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4);
530 	hfs_bnode_put(new_node);