fs/hfs/brec.c

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