1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * linux/fs/hfsplus/brec.c 4 * 5 * Copyright (C) 2001 6 * Brad Boyer (flar@allandria.com) 7 * (C) 2003 Ardis Technologies <roman@ardistech.com> 8 * 9 * Handle individual btree records 10 */ 11 12 #include "hfsplus_fs.h" 13 #include "hfsplus_raw.h" 14 15 static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd); 16 static int hfs_brec_update_parent(struct hfs_find_data *fd); 17 static int hfs_btree_inc_height(struct hfs_btree *); 18 19 /* Get the length and offset of the given record in the given node */ 20 u16 hfs_brec_lenoff(struct hfs_bnode *node, u16 rec, u16 *off) 21 { 22 __be16 retval[2]; 23 u16 dataoff; 24 25 dataoff = node->tree->node_size - (rec + 2) * 2; 26 hfs_bnode_read(node, retval, dataoff, 4); 27 *off = be16_to_cpu(retval[1]); 28 return be16_to_cpu(retval[0]) - *off; 29 } 30 31 /* Get the length of the key from a keyed record */ 32 u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) 33 { 34 u16 retval, recoff; 35 36 if (node->type != HFS_NODE_INDEX && node->type != HFS_NODE_LEAF) 37 return 0; 38 39 if ((node->type == HFS_NODE_INDEX) && 40 !(node->tree->attributes & HFS_TREE_VARIDXKEYS) && 41 (node->tree->cnid != HFSPLUS_ATTR_CNID)) { 42 retval = node->tree->max_key_len + 2; 43 } else { 44 recoff = hfs_bnode_read_u16(node, 45 node->tree->node_size - (rec + 1) * 2); 46 if (!recoff) 47 return 0; 48 if (recoff > node->tree->node_size - 2) { 49 pr_err("recoff %d too large\n", recoff); 50 return 0; 51 } 52 53 retval = hfs_bnode_read_u16(node, recoff) + 2; 54 if (retval > node->tree->max_key_len + 2) { 55 pr_err("keylen %d too large\n", 56 retval); 57 retval = 0; 58 } 59 } 60 return retval; 61 } 62 63 int hfs_brec_insert(struct hfs_find_data *fd, void *entry, u32 entry_len) 64 { 65 struct hfs_btree *tree; 66 struct hfs_bnode *node, *new_node; 67 int size, key_len, rec; 68 int data_off, end_off; 69 int idx_rec_off, data_rec_off, end_rec_off; 70 __be32 cnid; 71 72 tree = fd->tree; 73 if (!fd->bnode) { 74 if (!tree->root) 75 hfs_btree_inc_height(tree); 76 node = hfs_bnode_find(tree, tree->leaf_head); 77 if (IS_ERR(node)) 78 return PTR_ERR(node); 79 fd->bnode = node; 80 fd->record = -1; 81 } 82 new_node = NULL; 83 key_len = be16_to_cpu(fd->search_key->key_len) + 2; 84 again: 85 /* new record idx and complete record size */ 86 rec = fd->record + 1; 87 size = key_len + entry_len; 88 89 node = fd->bnode; 90 hfs_bnode_dump(node); 91 /* get last offset */ 92 end_rec_off = tree->node_size - (node->num_recs + 1) * 2; 93 end_off = hfs_bnode_read_u16(node, end_rec_off); 94 end_rec_off -= 2; 95 hfs_dbg("rec %d, size %d, end_off %d, end_rec_off %d\n", 96 rec, size, end_off, end_rec_off); 97 if (size > end_rec_off - end_off) { 98 if (new_node) 99 panic("not enough room!\n"); 100 new_node = hfs_bnode_split(fd); 101 if (IS_ERR(new_node)) 102 return PTR_ERR(new_node); 103 goto again; 104 } 105 if (node->type == HFS_NODE_LEAF) { 106 tree->leaf_count++; 107 mark_inode_dirty(tree->inode); 108 } 109 node->num_recs++; 110 /* write new last offset */ 111 hfs_bnode_write_u16(node, 112 offsetof(struct hfs_bnode_desc, num_recs), 113 node->num_recs); 114 hfs_bnode_write_u16(node, end_rec_off, end_off + size); 115 data_off = end_off; 116 data_rec_off = end_rec_off + 2; 117 idx_rec_off = tree->node_size - (rec + 1) * 2; 118 if (idx_rec_off == data_rec_off) 119 goto skip; 120 /* move all following entries */ 121 do { 122 data_off = hfs_bnode_read_u16(node, data_rec_off + 2); 123 hfs_bnode_write_u16(node, data_rec_off, data_off + size); 124 data_rec_off += 2; 125 } while (data_rec_off < idx_rec_off); 126 127 /* move data away */ 128 hfs_bnode_move(node, data_off + size, data_off, 129 end_off - data_off); 130 131 skip: 132 hfs_bnode_write(node, fd->search_key, data_off, key_len); 133 hfs_bnode_write(node, entry, data_off + key_len, entry_len); 134 hfs_bnode_dump(node); 135 136 /* 137 * update parent key if we inserted a key 138 * at the start of the node and it is not the new node 139 */ 140 if (!rec && new_node != node) { 141 hfs_bnode_read_key(node, fd->search_key, data_off + size); 142 hfs_brec_update_parent(fd); 143 } 144 145 if (new_node) { 146 hfs_bnode_put(fd->bnode); 147 if (!new_node->parent) { 148 hfs_btree_inc_height(tree); 149 new_node->parent = tree->root; 150 } 151 fd->bnode = hfs_bnode_find(tree, new_node->parent); 152 153 /* create index data entry */ 154 cnid = cpu_to_be32(new_node->this); 155 entry = &cnid; 156 entry_len = sizeof(cnid); 157 158 /* get index key */ 159 hfs_bnode_read_key(new_node, fd->search_key, 14); 160 __hfs_brec_find(fd->bnode, fd, hfs_find_rec_by_key); 161 162 hfs_bnode_put(new_node); 163 new_node = NULL; 164 165 if ((tree->attributes & HFS_TREE_VARIDXKEYS) || 166 (tree->cnid == HFSPLUS_ATTR_CNID)) 167 key_len = be16_to_cpu(fd->search_key->key_len) + 2; 168 else { 169 fd->search_key->key_len = 170 cpu_to_be16(tree->max_key_len); 171 key_len = tree->max_key_len + 2; 172 } 173 goto again; 174 } 175 176 return 0; 177 } 178 179 int hfs_brec_remove(struct hfs_find_data *fd) 180 { 181 struct hfs_btree *tree; 182 struct hfs_bnode *node, *parent; 183 int end_off, rec_off, data_off, size; 184 185 tree = fd->tree; 186 node = fd->bnode; 187 again: 188 rec_off = tree->node_size - (fd->record + 2) * 2; 189 end_off = tree->node_size - (node->num_recs + 1) * 2; 190 191 if (node->type == HFS_NODE_LEAF) { 192 tree->leaf_count--; 193 mark_inode_dirty(tree->inode); 194 } 195 hfs_bnode_dump(node); 196 hfs_dbg("rec %d, len %d\n", 197 fd->record, fd->keylength + fd->entrylength); 198 if (!--node->num_recs) { 199 hfs_bnode_unlink(node); 200 if (!node->parent) 201 return 0; 202 parent = hfs_bnode_find(tree, node->parent); 203 if (IS_ERR(parent)) 204 return PTR_ERR(parent); 205 hfs_bnode_put(node); 206 node = fd->bnode = parent; 207 208 __hfs_brec_find(node, fd, hfs_find_rec_by_key); 209 goto again; 210 } 211 hfs_bnode_write_u16(node, 212 offsetof(struct hfs_bnode_desc, num_recs), 213 node->num_recs); 214 215 if (rec_off == end_off) 216 goto skip; 217 size = fd->keylength + fd->entrylength; 218 219 do { 220 data_off = hfs_bnode_read_u16(node, rec_off); 221 hfs_bnode_write_u16(node, rec_off + 2, data_off - size); 222 rec_off -= 2; 223 } while (rec_off >= end_off); 224 225 /* fill hole */ 226 hfs_bnode_move(node, fd->keyoffset, fd->keyoffset + size, 227 data_off - fd->keyoffset - size); 228 skip: 229 hfs_bnode_dump(node); 230 if (!fd->record) 231 hfs_brec_update_parent(fd); 232 return 0; 233 } 234 235 static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) 236 { 237 struct hfs_btree *tree; 238 struct hfs_bnode *node, *new_node, *next_node; 239 struct hfs_bnode_desc node_desc; 240 int num_recs, new_rec_off, new_off, old_rec_off; 241 int data_start, data_end, size; 242 size_t rec_off_tbl_size; 243 size_t node_desc_size = sizeof(struct hfs_bnode_desc); 244 size_t rec_size = sizeof(__be16); 245 246 tree = fd->tree; 247 node = fd->bnode; 248 new_node = hfs_bmap_alloc(tree); 249 if (IS_ERR(new_node)) 250 return new_node; 251 hfs_bnode_get(node); 252 hfs_dbg("this %d - new %d - next %d\n", 253 node->this, new_node->this, node->next); 254 new_node->next = node->next; 255 new_node->prev = node->this; 256 new_node->parent = node->parent; 257 new_node->type = node->type; 258 new_node->height = node->height; 259 260 if (node->next) 261 next_node = hfs_bnode_find(tree, node->next); 262 else 263 next_node = NULL; 264 265 if (IS_ERR(next_node)) { 266 hfs_bnode_put(node); 267 hfs_bnode_put(new_node); 268 return next_node; 269 } 270 271 rec_off_tbl_size = node->num_recs * rec_size; 272 size = tree->node_size / 2; 273 size -= node_desc_size; 274 size -= rec_off_tbl_size; 275 old_rec_off = tree->node_size - (2 * rec_size); 276 277 num_recs = 1; 278 for (;;) { 279 data_start = hfs_bnode_read_u16(node, old_rec_off); 280 if (data_start > size) 281 break; 282 old_rec_off -= rec_size; 283 if (++num_recs < node->num_recs) 284 continue; 285 hfs_bnode_put(node); 286 hfs_bnode_unlink(new_node); 287 hfs_bnode_put(new_node); 288 if (next_node) 289 hfs_bnode_put(next_node); 290 return ERR_PTR(-ENOSPC); 291 } 292 293 if (fd->record + 1 < num_recs) { 294 /* new record is in the lower half, 295 * so leave some more space there 296 */ 297 old_rec_off += rec_size; 298 num_recs--; 299 data_start = hfs_bnode_read_u16(node, old_rec_off); 300 } else { 301 hfs_bnode_put(node); 302 hfs_bnode_get(new_node); 303 fd->bnode = new_node; 304 fd->record -= num_recs; 305 fd->keyoffset -= data_start - node_desc_size; 306 fd->entryoffset -= data_start - node_desc_size; 307 } 308 new_node->num_recs = node->num_recs - num_recs; 309 node->num_recs = num_recs; 310 311 new_rec_off = tree->node_size - rec_size; 312 new_off = node_desc_size; 313 size = data_start - new_off; 314 num_recs = new_node->num_recs; 315 data_end = data_start; 316 while (num_recs) { 317 hfs_bnode_write_u16(new_node, new_rec_off, new_off); 318 old_rec_off -= rec_size; 319 new_rec_off -= rec_size; 320 data_end = hfs_bnode_read_u16(node, old_rec_off); 321 new_off = data_end - size; 322 num_recs--; 323 } 324 hfs_bnode_write_u16(new_node, new_rec_off, new_off); 325 hfs_bnode_copy(new_node, node_desc_size, 326 node, data_start, data_end - data_start); 327 328 /* update new bnode header */ 329 node_desc.next = cpu_to_be32(new_node->next); 330 node_desc.prev = cpu_to_be32(new_node->prev); 331 node_desc.type = new_node->type; 332 node_desc.height = new_node->height; 333 node_desc.num_recs = cpu_to_be16(new_node->num_recs); 334 node_desc.reserved = 0; 335 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); 336 337 /* update previous bnode header */ 338 node->next = new_node->this; 339 hfs_bnode_read(node, &node_desc, 0, sizeof(node_desc)); 340 node_desc.next = cpu_to_be32(node->next); 341 node_desc.num_recs = cpu_to_be16(node->num_recs); 342 hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc)); 343 344 /* update next bnode header */ 345 if (next_node) { 346 next_node->prev = new_node->this; 347 hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); 348 node_desc.prev = cpu_to_be32(next_node->prev); 349 hfs_bnode_write(next_node, &node_desc, 0, sizeof(node_desc)); 350 hfs_bnode_put(next_node); 351 } else if (node->this == tree->leaf_tail) { 352 /* if there is no next node, this might be the new tail */ 353 tree->leaf_tail = new_node->this; 354 mark_inode_dirty(tree->inode); 355 } 356 357 hfs_bnode_dump(node); 358 hfs_bnode_dump(new_node); 359 hfs_bnode_put(node); 360 361 return new_node; 362 } 363 364 static int hfs_brec_update_parent(struct hfs_find_data *fd) 365 { 366 struct hfs_btree *tree; 367 struct hfs_bnode *node, *new_node, *parent; 368 int newkeylen, diff; 369 int rec, rec_off, end_rec_off; 370 int start_off, end_off; 371 372 tree = fd->tree; 373 node = fd->bnode; 374 new_node = NULL; 375 if (!node->parent) 376 return 0; 377 378 again: 379 parent = hfs_bnode_find(tree, node->parent); 380 if (IS_ERR(parent)) 381 return PTR_ERR(parent); 382 __hfs_brec_find(parent, fd, hfs_find_rec_by_key); 383 if (fd->record < 0) 384 return -ENOENT; 385 hfs_bnode_dump(parent); 386 rec = fd->record; 387 388 /* size difference between old and new key */ 389 if ((tree->attributes & HFS_TREE_VARIDXKEYS) || 390 (tree->cnid == HFSPLUS_ATTR_CNID)) 391 newkeylen = hfs_bnode_read_u16(node, 14) + 2; 392 else 393 fd->keylength = newkeylen = tree->max_key_len + 2; 394 hfs_dbg("rec %d, keylength %d, newkeylen %d\n", 395 rec, fd->keylength, newkeylen); 396 397 rec_off = tree->node_size - (rec + 2) * 2; 398 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2; 399 diff = newkeylen - fd->keylength; 400 if (!diff) 401 goto skip; 402 if (diff > 0) { 403 end_off = hfs_bnode_read_u16(parent, end_rec_off); 404 if (end_rec_off - end_off < diff) { 405 406 hfs_dbg("splitting index node\n"); 407 fd->bnode = parent; 408 new_node = hfs_bnode_split(fd); 409 if (IS_ERR(new_node)) 410 return PTR_ERR(new_node); 411 parent = fd->bnode; 412 rec = fd->record; 413 rec_off = tree->node_size - (rec + 2) * 2; 414 end_rec_off = tree->node_size - 415 (parent->num_recs + 1) * 2; 416 } 417 } 418 419 end_off = start_off = hfs_bnode_read_u16(parent, rec_off); 420 hfs_bnode_write_u16(parent, rec_off, start_off + diff); 421 start_off -= 4; /* move previous cnid too */ 422 423 while (rec_off > end_rec_off) { 424 rec_off -= 2; 425 end_off = hfs_bnode_read_u16(parent, rec_off); 426 hfs_bnode_write_u16(parent, rec_off, end_off + diff); 427 } 428 hfs_bnode_move(parent, start_off + diff, start_off, 429 end_off - start_off); 430 skip: 431 hfs_bnode_copy(parent, fd->keyoffset, node, 14, newkeylen); 432 hfs_bnode_dump(parent); 433 434 hfs_bnode_put(node); 435 node = parent; 436 437 if (new_node) { 438 __be32 cnid; 439 440 if (!new_node->parent) { 441 hfs_btree_inc_height(tree); 442 new_node->parent = tree->root; 443 } 444 fd->bnode = hfs_bnode_find(tree, new_node->parent); 445 /* create index key and entry */ 446 hfs_bnode_read_key(new_node, fd->search_key, 14); 447 cnid = cpu_to_be32(new_node->this); 448 449 __hfs_brec_find(fd->bnode, fd, hfs_find_rec_by_key); 450 hfs_brec_insert(fd, &cnid, sizeof(cnid)); 451 hfs_bnode_put(fd->bnode); 452 hfs_bnode_put(new_node); 453 454 if (!rec) { 455 if (new_node == node) 456 goto out; 457 /* restore search_key */ 458 hfs_bnode_read_key(node, fd->search_key, 14); 459 } 460 new_node = NULL; 461 } 462 463 if (!rec && node->parent) 464 goto again; 465 out: 466 fd->bnode = node; 467 return 0; 468 } 469 470 static int hfs_btree_inc_height(struct hfs_btree *tree) 471 { 472 struct hfs_bnode *node, *new_node; 473 struct hfs_bnode_desc node_desc; 474 int key_size, rec; 475 __be32 cnid; 476 477 node = NULL; 478 if (tree->root) { 479 node = hfs_bnode_find(tree, tree->root); 480 if (IS_ERR(node)) 481 return PTR_ERR(node); 482 } 483 new_node = hfs_bmap_alloc(tree); 484 if (IS_ERR(new_node)) { 485 hfs_bnode_put(node); 486 return PTR_ERR(new_node); 487 } 488 489 tree->root = new_node->this; 490 if (!tree->depth) { 491 tree->leaf_head = tree->leaf_tail = new_node->this; 492 new_node->type = HFS_NODE_LEAF; 493 new_node->num_recs = 0; 494 } else { 495 new_node->type = HFS_NODE_INDEX; 496 new_node->num_recs = 1; 497 } 498 new_node->parent = 0; 499 new_node->next = 0; 500 new_node->prev = 0; 501 new_node->height = ++tree->depth; 502 503 node_desc.next = cpu_to_be32(new_node->next); 504 node_desc.prev = cpu_to_be32(new_node->prev); 505 node_desc.type = new_node->type; 506 node_desc.height = new_node->height; 507 node_desc.num_recs = cpu_to_be16(new_node->num_recs); 508 node_desc.reserved = 0; 509 hfs_bnode_write(new_node, &node_desc, 0, sizeof(node_desc)); 510 511 rec = tree->node_size - 2; 512 hfs_bnode_write_u16(new_node, rec, 14); 513 514 if (node) { 515 /* insert old root idx into new root */ 516 node->parent = tree->root; 517 if (node->type == HFS_NODE_LEAF || 518 tree->attributes & HFS_TREE_VARIDXKEYS || 519 tree->cnid == HFSPLUS_ATTR_CNID) 520 key_size = hfs_bnode_read_u16(node, 14) + 2; 521 else 522 key_size = tree->max_key_len + 2; 523 hfs_bnode_copy(new_node, 14, node, 14, key_size); 524 525 if (!(tree->attributes & HFS_TREE_VARIDXKEYS) && 526 (tree->cnid != HFSPLUS_ATTR_CNID)) { 527 key_size = tree->max_key_len + 2; 528 hfs_bnode_write_u16(new_node, 14, tree->max_key_len); 529 } 530 cnid = cpu_to_be32(node->this); 531 hfs_bnode_write(new_node, &cnid, 14 + key_size, 4); 532 533 rec -= 2; 534 hfs_bnode_write_u16(new_node, rec, 14 + key_size + 4); 535 536 hfs_bnode_put(node); 537 } 538 hfs_bnode_put(new_node); 539 mark_inode_dirty(tree->inode); 540 541 return 0; 542 } 543