18 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off)  in hfs_brec_lenoff()  argument
23 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
24 	hfs_bnode_read(node, retval, dataoff, 4);  in hfs_brec_lenoff()
30 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec)  in hfs_brec_keylen()  argument
34 	if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF)  in hfs_brec_keylen()
37 	if ((node->type == HFS_NODE_INDEX) &&  in hfs_brec_keylen()
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()
48 			retval = hfs_bnode_read_u16(node, recoff) + 2;  in hfs_brec_keylen()
49 			if (retval > node->tree->max_key_len + 2) {  in hfs_brec_keylen()
54 			retval = (hfs_bnode_read_u8(node, recoff) | 1) + 1;  in hfs_brec_keylen()
55 			if (retval > node->tree->max_key_len + 1) {  in hfs_brec_keylen()
67 	struct hfs_bnode *node, *new_node;  in hfs_brec_insert()  local
89 	node = fd->bnode;  in hfs_brec_insert()
90 	hfs_bnode_dump(node);  in hfs_brec_insert()
92 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
93 	end_off = hfs_bnode_read_u16(node, end_rec_off);  in hfs_brec_insert()
105 	if (node->type == HFS_NODE_LEAF) {  in hfs_brec_insert()
109 	node->num_recs++;  in hfs_brec_insert()
111 	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);  in hfs_brec_insert()
112 	hfs_bnode_write_u16(node, end_rec_off, end_off + size);  in hfs_brec_insert()
120 		data_off = hfs_bnode_read_u16(node, data_rec_off + 2);  in hfs_brec_insert()
121 		hfs_bnode_write_u16(node, data_rec_off, data_off + size);  in hfs_brec_insert()
126 	hfs_bnode_move(node, data_off + size, data_off,  in hfs_brec_insert()
130 	hfs_bnode_write(node, fd->search_key, data_off, key_len);  in hfs_brec_insert()
131 	hfs_bnode_write(node, entry, data_off + key_len, entry_len);  in hfs_brec_insert()
132 	hfs_bnode_dump(node);  in hfs_brec_insert()
138 	if (!rec && new_node != node) {  in hfs_brec_insert()
139 		hfs_bnode_read_key(node, fd->search_key, data_off + size);  in hfs_brec_insert()
178 	struct hfs_bnode *node, *parent;  in hfs_brec_remove()  local
182 	node = fd->bnode;  in hfs_brec_remove()
185 	end_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_remove()
187 	if (node->type == HFS_NODE_LEAF) {  in hfs_brec_remove()
191 	hfs_bnode_dump(node);  in hfs_brec_remove()
194 	if (!--node->num_recs) {  in hfs_brec_remove()
195 		hfs_bnode_unlink(node);  in hfs_brec_remove()
196 		if (!node->parent)  in hfs_brec_remove()
198 		parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_remove()
201 		hfs_bnode_put(node);  in hfs_brec_remove()
202 		node = fd->bnode = parent;  in hfs_brec_remove()
204 		__hfs_brec_find(node, fd);  in hfs_brec_remove()
207 	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);  in hfs_brec_remove()
214 		data_off = hfs_bnode_read_u16(node, rec_off);  in hfs_brec_remove()
215 		hfs_bnode_write_u16(node, rec_off + 2, data_off - size);  in hfs_brec_remove()
220 	hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size,  in hfs_brec_remove()
223 	hfs_bnode_dump(node);  in hfs_brec_remove()
232 	struct hfs_bnode *node, *new_node, *next_node;  in hfs_bnode_split()  local
238 	node = fd->bnode;  in hfs_bnode_split()
242 	hfs_bnode_get(node);  in hfs_bnode_split()
244 		node->this, new_node->this, node->next);  in hfs_bnode_split()
245 	new_node->next = node->next;  in hfs_bnode_split()
246 	new_node->prev = node->this;  in hfs_bnode_split()
247 	new_node->parent = node->parent;  in hfs_bnode_split()
248 	new_node->type = node->type;  in hfs_bnode_split()
249 	new_node->height = node->height;  in hfs_bnode_split()
251 	if (node->next)  in hfs_bnode_split()
252 		next_node = hfs_bnode_find(tree, node->next);  in hfs_bnode_split()
257 		hfs_bnode_put(node);  in hfs_bnode_split()
262 	size = tree->node_size / 2 - node->num_recs * 2 - 14;  in hfs_bnode_split()
266 		data_start = hfs_bnode_read_u16(node, old_rec_off);  in hfs_bnode_split()
270 		if (++num_recs < node->num_recs)  in hfs_bnode_split()
273 		hfs_bnode_put(node);  in hfs_bnode_split()
286 		data_start = hfs_bnode_read_u16(node, old_rec_off);  in hfs_bnode_split()
288 		hfs_bnode_put(node);  in hfs_bnode_split()
295 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
296 	node->num_recs = num_recs;  in hfs_bnode_split()
307 		data_end = hfs_bnode_read_u16(node, old_rec_off);  in hfs_bnode_split()
312 	hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);  in hfs_bnode_split()
324 	node->next = new_node->this;  in hfs_bnode_split()
325 	hfs_bnode_read(node, &node_desc, 0, sizeof(node_desc));  in hfs_bnode_split()
326 	node_desc.next = cpu_to_be32(node->next);  in hfs_bnode_split()
327 	node_desc.num_recs = cpu_to_be16(node->num_recs);  in hfs_bnode_split()
328 	hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc));  in hfs_bnode_split()
337 	} else if (node->this == tree->leaf_tail) {  in hfs_bnode_split()
343 	hfs_bnode_dump(node);  in hfs_bnode_split()
345 	hfs_bnode_put(node);  in hfs_bnode_split()
353 	struct hfs_bnode *node, *new_node, *parent;  in hfs_brec_update_parent()  local
359 	node = fd->bnode;  in hfs_brec_update_parent()
361 	if (!node->parent)  in hfs_brec_update_parent()
365 	parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_update_parent()
376 		newkeylen = (hfs_bnode_read_u8(node, 14) | 1) + 1;  in hfs_brec_update_parent()
415 	hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);  in hfs_brec_update_parent()
420 	hfs_bnode_put(node);  in hfs_brec_update_parent()
421 	node = parent;  in hfs_brec_update_parent()
437 			if (new_node == node)  in hfs_brec_update_parent()
440 			hfs_bnode_read_key(node, fd->search_key, 14);  in hfs_brec_update_parent()
444 	if (!rec && node->parent)  in hfs_brec_update_parent()
447 	fd->bnode = node;  in hfs_brec_update_parent()
453 	struct hfs_bnode *node, *new_node;  in hfs_btree_inc_height()  local
458 	node = NULL;  in hfs_btree_inc_height()
460 		node = hfs_bnode_find(tree, tree->root);  in hfs_btree_inc_height()
461 		if (IS_ERR(node))  in hfs_btree_inc_height()
462 			return PTR_ERR(node);  in hfs_btree_inc_height()
466 		hfs_bnode_put(node);  in hfs_btree_inc_height()
495 	if (node) {  in hfs_btree_inc_height()
497 		node->parent = tree->root;  in hfs_btree_inc_height()
498 		if (node->type == HFS_NODE_LEAF ||  in hfs_btree_inc_height()
500 			key_size = hfs_bnode_read_u8(node, 14) + 1;  in hfs_btree_inc_height()
503 		hfs_bnode_copy(new_node, 14, node, 14, key_size);  in hfs_btree_inc_height()
510 		cnid = cpu_to_be32(node->this);  in hfs_btree_inc_height()
516 		hfs_bnode_put(node);  in hfs_btree_inc_height()