24 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
39 	   !(node->tree->attributes & HFS_TREE_VARIDXKEYS) &&  in hfs_brec_keylen()
40 	   (node->tree->cnid != HFSPLUS_ATTR_CNID)) {  in hfs_brec_keylen()
41 		retval = node->tree->max_key_len + 2;  in hfs_brec_keylen()
44 			node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
47 		if (recoff > node->tree->node_size - 2) {  in hfs_brec_keylen()
53 		if (retval > node->tree->max_key_len + 2) {  in hfs_brec_keylen()
64 	struct hfs_btree *tree;  in hfs_brec_insert()  local
71 	tree = fd->tree;  in hfs_brec_insert()
73 		if (!tree->root)  in hfs_brec_insert()
74 			hfs_btree_inc_height(tree);  in hfs_brec_insert()
75 		fd->bnode = hfs_bnode_find(tree, tree->leaf_head);  in hfs_brec_insert()
90 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
104 		tree->leaf_count++;  in hfs_brec_insert()
105 		mark_inode_dirty(tree->inode);  in hfs_brec_insert()
115 	idx_rec_off = tree->node_size - (rec + 1) * 2;  in hfs_brec_insert()
146 			hfs_btree_inc_height(tree);  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()
163 		if ((tree->attributes & HFS_TREE_VARIDXKEYS) ||  in hfs_brec_insert()
164 				(tree->cnid == HFSPLUS_ATTR_CNID))  in hfs_brec_insert()
168 				cpu_to_be16(tree->max_key_len);  in hfs_brec_insert()
169 			key_len = tree->max_key_len + 2;  in hfs_brec_insert()
179 	struct hfs_btree *tree;  in hfs_brec_remove()  local
183 	tree = fd->tree;  in hfs_brec_remove()
186 	rec_off = tree->node_size - (fd->record + 2) * 2;  in hfs_brec_remove()
187 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
190 		tree->leaf_count--;  in hfs_brec_remove()
191 		mark_inode_dirty(tree->inode);  in hfs_brec_remove()
200 		parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_remove()
235 	struct hfs_btree *tree;  in hfs_bnode_split()  local
241 	tree = fd->tree;  in hfs_bnode_split()
243 	new_node = hfs_bmap_alloc(tree);  in hfs_bnode_split()
256 		next_node = hfs_bnode_find(tree, node->next);  in hfs_bnode_split()
266 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
267 	old_rec_off = tree->node_size - 4;  in hfs_bnode_split()
302 	new_rec_off = tree->node_size - 2;  in hfs_bnode_split()
341 	} else if (node->this == tree->leaf_tail) {  in hfs_bnode_split()
343 		tree->leaf_tail = new_node->this;  in hfs_bnode_split()
344 		mark_inode_dirty(tree->inode);  in hfs_bnode_split()
356 	struct hfs_btree *tree;  in hfs_brec_update_parent()  local
362 	tree = fd->tree;  in hfs_brec_update_parent()
369 	parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_update_parent()
379 	if ((tree->attributes & HFS_TREE_VARIDXKEYS) ||  in hfs_brec_update_parent()
380 				(tree->cnid == HFSPLUS_ATTR_CNID))  in hfs_brec_update_parent()
383 		fd->keylength = newkeylen = tree->max_key_len + 2;  in hfs_brec_update_parent()
387 	rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
388 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
403 			rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
404 			end_rec_off = tree->node_size -  in hfs_brec_update_parent()
430 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
455 static int hfs_btree_inc_height(struct hfs_btree *tree)  in hfs_btree_inc_height()  argument
463 	if (tree->root) {  in hfs_btree_inc_height()
464 		node = hfs_bnode_find(tree, tree->root);  in hfs_btree_inc_height()
468 	new_node = hfs_bmap_alloc(tree);  in hfs_btree_inc_height()
474 	tree->root = new_node->this;  in hfs_btree_inc_height()
475 	if (!tree->depth) {  in hfs_btree_inc_height()
476 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
486 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
496 	rec = tree->node_size - 2;  in hfs_btree_inc_height()
501 		node->parent = tree->root;  in hfs_btree_inc_height()
503 				tree->attributes & HFS_TREE_VARIDXKEYS ||  in hfs_btree_inc_height()
504 				tree->cnid == HFSPLUS_ATTR_CNID)  in hfs_btree_inc_height()
507 			key_size = tree->max_key_len + 2;  in hfs_btree_inc_height()
510 		if (!(tree->attributes & HFS_TREE_VARIDXKEYS) &&  in hfs_btree_inc_height()
511 				(tree->cnid != HFSPLUS_ATTR_CNID)) {  in hfs_btree_inc_height()
512 			key_size = tree->max_key_len + 2;  in hfs_btree_inc_height()
513 			hfs_bnode_write_u16(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
524 	mark_inode_dirty(tree->inode);  in hfs_btree_inc_height()