1 // SPDX-License-Identifier: GPL-2.0
18 /* Get the length and offset of the given record in the given node */
24 	dataoff = node->tree->node_size - (rec + 2) * 2;  in hfs_brec_lenoff()
27 	return be16_to_cpu(retval[0]) - *off;  in hfs_brec_lenoff()
30 /* Get the length of the key from a keyed record */
35 	if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF)  in hfs_brec_keylen()
38 	if ((node->type == HFS_NODE_INDEX) &&  in hfs_brec_keylen()
39 	   !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) {  in hfs_brec_keylen()
40 		if (node->tree->attributes & HFS_TREE_BIGKEYS)  in hfs_brec_keylen()
41 			retval = node->tree->max_key_len + 2;  in hfs_brec_keylen()
43 			retval = node->tree->max_key_len + 1;  in hfs_brec_keylen()
45 		recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2);  in hfs_brec_keylen()
48 		if (node->tree->attributes & HFS_TREE_BIGKEYS) {  in hfs_brec_keylen()
50 			if (retval > node->tree->max_key_len + 2) {  in hfs_brec_keylen()
56 			if (retval > node->tree->max_key_len + 1) {  in hfs_brec_keylen()
69 	int size, key_len, rec;  in hfs_brec_insert()  local
74 	tree = fd->tree;  in hfs_brec_insert()
75 	if (!fd->bnode) {  in hfs_brec_insert()
76 		if (!tree->root)  in hfs_brec_insert()
78 		node = hfs_bnode_find(tree, tree->leaf_head);  in hfs_brec_insert()
81 		fd->bnode = node;  in hfs_brec_insert()
82 		fd->record = -1;  in hfs_brec_insert()
85 	key_len = (fd->search_key->key_len | 1) + 1;  in hfs_brec_insert()
87 	/* new record idx and complete record size */  in hfs_brec_insert()
88 	rec = fd->record + 1;  in hfs_brec_insert()
89 	size = key_len + entry_len;  in hfs_brec_insert()
91 	node = fd->bnode;  in hfs_brec_insert()
94 	end_rec_off = tree->node_size - (node->num_recs + 1) * 2;  in hfs_brec_insert()
96 	end_rec_off -= 2;  in hfs_brec_insert()
98 		rec, size, end_off, end_rec_off);  in hfs_brec_insert()
99 	if (size > end_rec_off - end_off) {  in hfs_brec_insert()
107 	if (node->type == HFS_NODE_LEAF) {  in hfs_brec_insert()
108 		tree->leaf_count++;  in hfs_brec_insert()
109 		mark_inode_dirty(tree->inode);  in hfs_brec_insert()
111 	node->num_recs++;  in hfs_brec_insert()
113 	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);  in hfs_brec_insert()
114 	hfs_bnode_write_u16(node, end_rec_off, end_off + size);  in hfs_brec_insert()
117 	idx_rec_off = tree->node_size - (rec + 1) * 2;  in hfs_brec_insert()
123 		hfs_bnode_write_u16(node, data_rec_off, data_off + size);  in hfs_brec_insert()
128 	hfs_bnode_move(node, data_off + size, data_off,  in hfs_brec_insert()
129 		       end_off - data_off);  in hfs_brec_insert()
132 	hfs_bnode_write(node, fd->search_key, data_off, key_len);  in hfs_brec_insert()
141 		hfs_bnode_read_key(node, fd->search_key, data_off + size);  in hfs_brec_insert()
146 		hfs_bnode_put(fd->bnode);  in hfs_brec_insert()
147 		if (!new_node->parent) {  in hfs_brec_insert()
149 			new_node->parent = tree->root;  in hfs_brec_insert()
151 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_insert()
154 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_insert()
159 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_insert()
160 		__hfs_brec_find(fd->bnode, fd);  in hfs_brec_insert()
165 		if (tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_brec_insert()
166 			key_len = fd->search_key->key_len + 1;  in hfs_brec_insert()
168 			fd->search_key->key_len = tree->max_key_len;  in hfs_brec_insert()
169 			key_len = tree->max_key_len + 1;  in hfs_brec_insert()
181 	int end_off, rec_off, data_off, size;  in hfs_brec_remove()  local
183 	tree = fd->tree;  in hfs_brec_remove()
184 	node = fd->bnode;  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()
189 	if (node->type == HFS_NODE_LEAF) {  in hfs_brec_remove()
190 		tree->leaf_count--;  in hfs_brec_remove()
191 		mark_inode_dirty(tree->inode);  in hfs_brec_remove()
195 		fd->record, fd->keylength + fd->entrylength);  in hfs_brec_remove()
196 	if (!--node->num_recs) {  in hfs_brec_remove()
198 		if (!node->parent)  in hfs_brec_remove()
200 		parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_remove()
204 		node = fd->bnode = parent;  in hfs_brec_remove()
209 	hfs_bnode_write_u16(node, offsetof(struct hfs_bnode_desc, num_recs), node->num_recs);  in hfs_brec_remove()
213 	size = fd->keylength + fd->entrylength;  in hfs_brec_remove()
217 		hfs_bnode_write_u16(node, rec_off + 2, data_off - size);  in hfs_brec_remove()
218 		rec_off -= 2;  in hfs_brec_remove()
222 	hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size,  in hfs_brec_remove()
223 		       data_off - fd->keyoffset - size);  in hfs_brec_remove()
226 	if (!fd->record)  in hfs_brec_remove()
237 	int data_start, data_end, size;  in hfs_bnode_split()  local
239 	tree = fd->tree;  in hfs_bnode_split()
240 	node = fd->bnode;  in hfs_bnode_split()
245 	hfs_dbg(BNODE_MOD, "split_nodes: %d - %d - %d\n",  in hfs_bnode_split()
246 		node->this, new_node->this, node->next);  in hfs_bnode_split()
247 	new_node->next = node->next;  in hfs_bnode_split()
248 	new_node->prev = node->this;  in hfs_bnode_split()
249 	new_node->parent = node->parent;  in hfs_bnode_split()
250 	new_node->type = node->type;  in hfs_bnode_split()
251 	new_node->height = node->height;  in hfs_bnode_split()
253 	if (node->next)  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()
269 		if (data_start > size)  in hfs_bnode_split()
271 		old_rec_off -= 2;  in hfs_bnode_split()
272 		if (++num_recs < node->num_recs)  in hfs_bnode_split()
279 		return ERR_PTR(-ENOSPC);  in hfs_bnode_split()
282 	if (fd->record + 1 < num_recs) {  in hfs_bnode_split()
283 		/* new record is in the lower half,  in hfs_bnode_split()
287 		num_recs--;  in hfs_bnode_split()
292 		fd->bnode = new_node;  in hfs_bnode_split()
293 		fd->record -= num_recs;  in hfs_bnode_split()
294 		fd->keyoffset -= data_start - 14;  in hfs_bnode_split()
295 		fd->entryoffset -= data_start - 14;  in hfs_bnode_split()
297 	new_node->num_recs = node->num_recs - num_recs;  in hfs_bnode_split()
298 	node->num_recs = num_recs;  in hfs_bnode_split()
300 	new_rec_off = tree->node_size - 2;  in hfs_bnode_split()
302 	size = data_start - new_off;  in hfs_bnode_split()
303 	num_recs = new_node->num_recs;  in hfs_bnode_split()
307 		old_rec_off -= 2;  in hfs_bnode_split()
308 		new_rec_off -= 2;  in hfs_bnode_split()
310 		new_off = data_end - size;  in hfs_bnode_split()
311 		num_recs--;  in hfs_bnode_split()
314 	hfs_bnode_copy(new_node, 14, node, data_start, data_end - data_start);  in hfs_bnode_split()
317 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_bnode_split()
318 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_bnode_split()
319 	node_desc.type = new_node->type;  in hfs_bnode_split()
320 	node_desc.height = new_node->height;  in hfs_bnode_split()
321 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_bnode_split()
326 	node->next = new_node->this;  in hfs_bnode_split()
328 	node_desc.next = cpu_to_be32(node->next);  in hfs_bnode_split()
329 	node_desc.num_recs = cpu_to_be16(node->num_recs);  in hfs_bnode_split()
334 		next_node->prev = new_node->this;  in hfs_bnode_split()
336 		node_desc.prev = cpu_to_be32(next_node->prev);  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()
360 	tree = fd->tree;  in hfs_brec_update_parent()
361 	node = fd->bnode;  in hfs_brec_update_parent()
363 	if (!node->parent)  in hfs_brec_update_parent()
367 	parent = hfs_bnode_find(tree, node->parent);  in hfs_brec_update_parent()
371 	if (fd->record < 0)  in hfs_brec_update_parent()
372 		return -ENOENT;  in hfs_brec_update_parent()
374 	rec = fd->record;  in hfs_brec_update_parent()
376 	/* size difference between old and new key */  in hfs_brec_update_parent()
377 	if (tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_brec_update_parent()
380 		fd->keylength = newkeylen = tree->max_key_len + 1;  in hfs_brec_update_parent()
382 		rec, fd->keylength, newkeylen);  in hfs_brec_update_parent()
384 	rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
385 	end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
386 	diff = newkeylen - fd->keylength;  in hfs_brec_update_parent()
391 		if (end_rec_off - end_off < diff) {  in hfs_brec_update_parent()
394 			fd->bnode = parent;  in hfs_brec_update_parent()
398 			parent = fd->bnode;  in hfs_brec_update_parent()
399 			rec = fd->record;  in hfs_brec_update_parent()
400 			rec_off = tree->node_size - (rec + 2) * 2;  in hfs_brec_update_parent()
401 			end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;  in hfs_brec_update_parent()
407 	start_off -= 4;	/* move previous cnid too */  in hfs_brec_update_parent()
410 		rec_off -= 2;  in hfs_brec_update_parent()
415 		       end_off - start_off);  in hfs_brec_update_parent()
417 	hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen);  in hfs_brec_update_parent()
418 	if (!(tree->attributes & HFS_TREE_VARIDXKEYS))  in hfs_brec_update_parent()
419 		hfs_bnode_write_u8(parent, fd->keyoffset, newkeylen - 1);  in hfs_brec_update_parent()
428 		if (!new_node->parent) {  in hfs_brec_update_parent()
430 			new_node->parent = tree->root;  in hfs_brec_update_parent()
432 		fd->bnode = hfs_bnode_find(tree, new_node->parent);  in hfs_brec_update_parent()
434 		hfs_bnode_read_key(new_node, fd->search_key, 14);  in hfs_brec_update_parent()
435 		cnid = cpu_to_be32(new_node->this);  in hfs_brec_update_parent()
437 		__hfs_brec_find(fd->bnode, fd);  in hfs_brec_update_parent()
439 		hfs_bnode_put(fd->bnode);  in hfs_brec_update_parent()
446 			hfs_bnode_read_key(node, fd->search_key, 14);  in hfs_brec_update_parent()
451 	if (!rec && node->parent)  in hfs_brec_update_parent()
454 	fd->bnode = node;  in hfs_brec_update_parent()
466 	if (tree->root) {  in hfs_btree_inc_height()
467 		node = hfs_bnode_find(tree, tree->root);  in hfs_btree_inc_height()
477 	tree->root = new_node->this;  in hfs_btree_inc_height()
478 	if (!tree->depth) {  in hfs_btree_inc_height()
479 		tree->leaf_head = tree->leaf_tail = new_node->this;  in hfs_btree_inc_height()
480 		new_node->type = HFS_NODE_LEAF;  in hfs_btree_inc_height()
481 		new_node->num_recs = 0;  in hfs_btree_inc_height()
483 		new_node->type = HFS_NODE_INDEX;  in hfs_btree_inc_height()
484 		new_node->num_recs = 1;  in hfs_btree_inc_height()
486 	new_node->parent = 0;  in hfs_btree_inc_height()
487 	new_node->next = 0;  in hfs_btree_inc_height()
488 	new_node->prev = 0;  in hfs_btree_inc_height()
489 	new_node->height = ++tree->depth;  in hfs_btree_inc_height()
491 	node_desc.next = cpu_to_be32(new_node->next);  in hfs_btree_inc_height()
492 	node_desc.prev = cpu_to_be32(new_node->prev);  in hfs_btree_inc_height()
493 	node_desc.type = new_node->type;  in hfs_btree_inc_height()
494 	node_desc.height = new_node->height;  in hfs_btree_inc_height()
495 	node_desc.num_recs = cpu_to_be16(new_node->num_recs);  in hfs_btree_inc_height()
499 	rec = tree->node_size - 2;  in hfs_btree_inc_height()
504 		node->parent = tree->root;  in hfs_btree_inc_height()
505 		if (node->type == HFS_NODE_LEAF ||  in hfs_btree_inc_height()
506 		    tree->attributes & HFS_TREE_VARIDXKEYS)  in hfs_btree_inc_height()
509 			key_size = tree->max_key_len + 1;  in hfs_btree_inc_height()
512 		if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {  in hfs_btree_inc_height()
513 			key_size = tree->max_key_len + 1;  in hfs_btree_inc_height()
514 			hfs_bnode_write_u8(new_node, 14, tree->max_key_len);  in hfs_btree_inc_height()
516 		key_size = (key_size + 1) & -2;  in hfs_btree_inc_height()
517 		cnid = cpu_to_be32(node->this);  in hfs_btree_inc_height()
520 		rec -= 2;  in hfs_btree_inc_height()
526 	mark_inode_dirty(tree->inode);  in hfs_btree_inc_height()