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 		retval = node->tree->max_key_len + 2;  in hfs_brec_keylen()
43 			node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
46 		if (recoff > node->tree->node_size - 2) {  in hfs_brec_keylen()
52 		if (retval > node->tree->max_key_len + 2) {  in hfs_brec_keylen()
63 	struct hfs_btree *tree;  in hfs_brec_insert()  local
70 	tree = fd->tree;  in hfs_brec_insert()
72 		if (!tree->root)  in hfs_brec_insert()
73 			hfs_btree_inc_height(tree);  in hfs_brec_insert()
74 		fd->bnode = hfs_bnode_find(tree, tree->leaf_head);  in hfs_brec_insert()
89 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
103 		tree->leaf_count++;  in hfs_brec_insert()
104 		mark_inode_dirty(tree->inode);  in hfs_brec_insert()
114 	idx_rec_off = tree->node_size - (rec + 1) * 2;  in hfs_brec_insert()
142 			hfs_btree_inc_height(tree);  in hfs_brec_insert()
143 			new_node->parent = tree->root;  in hfs_brec_insert()
145 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
159 		if (tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_brec_insert()
163 				cpu_to_be16(tree->max_key_len);  in hfs_brec_insert()
164 			key_len = tree->max_key_len + 2;  in hfs_brec_insert()
177 	struct hfs_btree *tree;  in hfs_brec_remove()  local
181 	tree = fd->tree;  in hfs_brec_remove()
184 	rec_off = tree->node_size - (fd->record + 2) * 2;  in hfs_brec_remove()
185 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
188 		tree->leaf_count--;  in hfs_brec_remove()
189 		mark_inode_dirty(tree->inode);  in hfs_brec_remove()
198 		parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_remove()
233 	struct hfs_btree *tree;  in hfs_bnode_split()  local
239 	tree = fd->tree;  in hfs_bnode_split()
241 	new_node = hfs_bmap_alloc(tree);  in hfs_bnode_split()
254 		next_node = hfs_bnode_find(tree, node->next);  in hfs_bnode_split()
264 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
265 	old_rec_off = tree->node_size - 4;  in hfs_bnode_split()
300 	new_rec_off = tree->node_size - 2;  in hfs_bnode_split()
339 	} else if (node->this == tree->leaf_tail) {  in hfs_bnode_split()
341 		tree->leaf_tail = new_node->this;  in hfs_bnode_split()
342 		mark_inode_dirty(tree->inode);  in hfs_bnode_split()
354 	struct hfs_btree *tree;  in hfs_brec_update_parent()  local
360 	tree = fd->tree;  in hfs_brec_update_parent()
367 	parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_update_parent()
375 	if (tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_brec_update_parent()
378 		fd->keylength = newkeylen = tree->max_key_len + 2;  in hfs_brec_update_parent()
382 	rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
383 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
398 			rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
399 			end_rec_off = tree->node_size -  in hfs_brec_update_parent()
425 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
450 static int hfs_btree_inc_height(struct hfs_btree *tree)  in hfs_btree_inc_height()  argument
458 	if (tree->root) {  in hfs_btree_inc_height()
459 		node = hfs_bnode_find(tree, tree->root);  in hfs_btree_inc_height()
463 	new_node = hfs_bmap_alloc(tree);  in hfs_btree_inc_height()
469 	tree->root = new_node->this;  in hfs_btree_inc_height()
470 	if (!tree->depth) {  in hfs_btree_inc_height()
471 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
481 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
491 	rec = tree->node_size - 2;  in hfs_btree_inc_height()
496 		node->parent = tree->root;  in hfs_btree_inc_height()
498 		    tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_btree_inc_height()
501 			key_size = tree->max_key_len + 2;  in hfs_btree_inc_height()
504 		if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {  in hfs_btree_inc_height()
505 			key_size = tree->max_key_len + 2;  in hfs_btree_inc_height()
506 			hfs_bnode_write_u16(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
517 	mark_inode_dirty(tree->inode);  in hfs_btree_inc_height()