fs/hfsplus/brec.c

25 	dataoff = node->tree->node_size - (rec + 2) * 2;
40 	   !(node->tree->attributes & HFS_TREE_VARIDXKEYS) &&
41 	   (node->tree->cnid != HFSPLUS_ATTR_CNID)) {
42 		retval = node->tree->max_key_len + 2;
45 			node->tree->node_size - (rec + 1) * 2);
48 		if (recoff > node->tree->node_size - 2) {
54 		if (retval > node->tree->max_key_len + 2) {
65 	struct hfs_btree *tree;
72 	tree = fd->tree;
74 		if (!tree->root)
75 			hfs_btree_inc_height(tree);
76 		node = hfs_bnode_find(tree, tree->leaf_head);
92 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;
106 		tree->leaf_count++;
107 		mark_inode_dirty(tree->inode);
117 	idx_rec_off = tree->node_size - (rec + 1) * 2;
148 			hfs_btree_inc_height(tree);
149 			new_node->parent = tree->root;
151 		fd->bnode = hfs_bnode_find(tree, new_node->parent);
165 		if ((tree->attributes & HFS_TREE_VARIDXKEYS) ||
166 				(tree->cnid == HFSPLUS_ATTR_CNID))
170 				cpu_to_be16(tree->max_key_len);
171 			key_len = tree->max_key_len + 2;
181 	struct hfs_btree *tree;
185 	tree = fd->tree;
188 	rec_off = tree->node_size - (fd->record + 2) * 2;
189 	end_off = tree->node_size - (node->num_recs + 1) * 2;
192 		tree->leaf_count--;
193 		mark_inode_dirty(tree->inode);
202 		parent = hfs_bnode_find(tree, node->parent);
237 	struct hfs_btree *tree;
243 	tree = fd->tree;
245 	new_node = hfs_bmap_alloc(tree);
258 		next_node = hfs_bnode_find(tree, node->next);
268 	size = tree->node_size / 2 - node->num_recs * 2 - 14;
269 	old_rec_off = tree->node_size - 4;
304 	new_rec_off = tree->node_size - 2;
343 	} else if (node->this == tree->leaf_tail) {
345 		tree->leaf_tail = new_node->this;
346 		mark_inode_dirty(tree->inode);
358 	struct hfs_btree *tree;
364 	tree = fd->tree;
371 	parent = hfs_bnode_find(tree, node->parent);
381 	if ((tree->attributes & HFS_TREE_VARIDXKEYS) ||
382 				(tree->cnid == HFSPLUS_ATTR_CNID))
385 		fd->keylength = newkeylen = tree->max_key_len + 2;
389 	rec_off = tree->node_size - (rec + 2) * 2;
390 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
405 			rec_off = tree->node_size - (rec + 2) * 2;
406 			end_rec_off = tree->node_size -
433 			hfs_btree_inc_height(tree);
434 			new_node->parent = tree->root;
436 		fd->bnode = hfs_bnode_find(tree, new_node->parent);
462 static int hfs_btree_inc_height(struct hfs_btree *tree)
470 	if (tree->root) {
471 		node = hfs_bnode_find(tree, tree->root);
475 	new_node = hfs_bmap_alloc(tree);
481 	tree->root = new_node->this;
482 	if (!tree->depth) {
483 		tree->leaf_head = tree->leaf_tail = new_node->this;
493 	new_node->height = ++tree->depth;
503 	rec = tree->node_size - 2;
508 		node->parent = tree->root;
510 				tree->attributes & HFS_TREE_VARIDXKEYS ||
511 				tree->cnid == HFSPLUS_ATTR_CNID)
514 			key_size = tree->max_key_len + 2;
517 		if (!(tree->attributes & HFS_TREE_VARIDXKEYS) &&
518 				(tree->cnid != HFSPLUS_ATTR_CNID)) {
519 			key_size = tree->max_key_len + 2;
520 			hfs_bnode_write_u16(new_node, 14, tree->max_key_len);
531 	mark_inode_dirty(tree->inode);