15 static int hfs_btree_inc_height(struct hfs_btree *tree);
23 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
38 	   !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) {  in hfs_brec_keylen()
39 		if (node->tree->attributes & HFS_TREE_BIGKEYS)  in hfs_brec_keylen()
40 			retval = node->tree->max_key_len + 2;  in hfs_brec_keylen()
42 			retval = node->tree->max_key_len + 1;  in hfs_brec_keylen()
44 		recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
47 		if (node->tree->attributes & HFS_TREE_BIGKEYS) {  in hfs_brec_keylen()
49 			if (retval > node->tree->max_key_len + 2) {  in hfs_brec_keylen()
55 			if (retval > node->tree->max_key_len + 1) {  in hfs_brec_keylen()
66 	struct hfs_btree *tree;  in hfs_brec_insert()  local
73 	tree = fd->tree;  in hfs_brec_insert()
75 		if (!tree->root)  in hfs_brec_insert()
76 			hfs_btree_inc_height(tree);  in hfs_brec_insert()
77 		fd->bnode = hfs_bnode_find(tree, tree->leaf_head);  in hfs_brec_insert()
92 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
106 		tree->leaf_count++;  in hfs_brec_insert()
107 		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()
166 			fd->search_key->key_len = tree->max_key_len;  in hfs_brec_insert()
167 			key_len = tree->max_key_len + 1;  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()
231 	struct hfs_btree *tree;  in hfs_bnode_split()  local
237 	tree = fd->tree;  in hfs_bnode_split()
239 	new_node = hfs_bmap_alloc(tree);  in hfs_bnode_split()
252 		next_node = hfs_bnode_find(tree, node->next);  in hfs_bnode_split()
262 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
263 	old_rec_off = tree->node_size - 4;  in hfs_bnode_split()
298 	new_rec_off = tree->node_size - 2;  in hfs_bnode_split()
337 	} else if (node->this == tree->leaf_tail) {  in hfs_bnode_split()
339 		tree->leaf_tail = new_node->this;  in hfs_bnode_split()
340 		mark_inode_dirty(tree->inode);  in hfs_bnode_split()
352 	struct hfs_btree *tree;  in hfs_brec_update_parent()  local
358 	tree = fd->tree;  in hfs_brec_update_parent()
365 	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 + 1;  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 - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
416 	if (!(tree->attributes & HFS_TREE_VARIDXKEYS))  in hfs_brec_update_parent()
426 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
451 static int hfs_btree_inc_height(struct hfs_btree *tree)  in hfs_btree_inc_height()  argument
459 	if (tree->root) {  in hfs_btree_inc_height()
460 		node = hfs_bnode_find(tree, tree->root);  in hfs_btree_inc_height()
464 	new_node = hfs_bmap_alloc(tree);  in hfs_btree_inc_height()
470 	tree->root = new_node->this;  in hfs_btree_inc_height()
471 	if (!tree->depth) {  in hfs_btree_inc_height()
472 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
482 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
492 	rec = tree->node_size - 2;  in hfs_btree_inc_height()
497 		node->parent = tree->root;  in hfs_btree_inc_height()
499 		    tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_btree_inc_height()
502 			key_size = tree->max_key_len + 1;  in hfs_btree_inc_height()
505 		if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {  in hfs_btree_inc_height()
506 			key_size = tree->max_key_len + 1;  in hfs_btree_inc_height()
507 			hfs_bnode_write_u8(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
519 	mark_inode_dirty(tree->inode);  in hfs_btree_inc_height()