1 // SPDX-License-Identifier: GPL-2.0-only 2 /* 3 * This file is part of UBIFS. 4 * 5 * Copyright (C) 2006-2008 Nokia Corporation. 6 * 7 * Authors: Artem Bityutskiy (Битюцкий Артём) 8 * Adrian Hunter 9 */ 10 11 /* 12 * This file implements UBIFS journal. 13 * 14 * The journal consists of 2 parts - the log and bud LEBs. The log has fixed 15 * length and position, while a bud logical eraseblock is any LEB in the main 16 * area. Buds contain file system data - data nodes, inode nodes, etc. The log 17 * contains only references to buds and some other stuff like commit 18 * start node. The idea is that when we commit the journal, we do 19 * not copy the data, the buds just become indexed. Since after the commit the 20 * nodes in bud eraseblocks become leaf nodes of the file system index tree, we 21 * use term "bud". Analogy is obvious, bud eraseblocks contain nodes which will 22 * become leafs in the future. 23 * 24 * The journal is multi-headed because we want to write data to the journal as 25 * optimally as possible. It is nice to have nodes belonging to the same inode 26 * in one LEB, so we may write data owned by different inodes to different 27 * journal heads, although at present only one data head is used. 28 * 29 * For recovery reasons, the base head contains all inode nodes, all directory 30 * entry nodes and all truncate nodes. This means that the other heads contain 31 * only data nodes. 32 * 33 * Bud LEBs may be half-indexed. For example, if the bud was not full at the 34 * time of commit, the bud is retained to continue to be used in the journal, 35 * even though the "front" of the LEB is now indexed. In that case, the log 36 * reference contains the offset where the bud starts for the purposes of the 37 * journal. 38 * 39 * The journal size has to be limited, because the larger is the journal, the 40 * longer it takes to mount UBIFS (scanning the journal) and the more memory it 41 * takes (indexing in the TNC). 42 * 43 * All the journal write operations like 'ubifs_jnl_update()' here, which write 44 * multiple UBIFS nodes to the journal at one go, are atomic with respect to 45 * unclean reboots. Should the unclean reboot happen, the recovery code drops 46 * all the nodes. 47 */ 48 49 #include "ubifs.h" 50 51 /** 52 * zero_ino_node_unused - zero out unused fields of an on-flash inode node. 53 * @ino: the inode to zero out 54 */ 55 static inline void zero_ino_node_unused(struct ubifs_ino_node *ino) 56 { 57 memset(ino->padding1, 0, 4); 58 memset(ino->padding2, 0, 26); 59 } 60 61 /** 62 * zero_dent_node_unused - zero out unused fields of an on-flash directory 63 * entry node. 64 * @dent: the directory entry to zero out 65 */ 66 static inline void zero_dent_node_unused(struct ubifs_dent_node *dent) 67 { 68 dent->padding1 = 0; 69 } 70 71 /** 72 * zero_trun_node_unused - zero out unused fields of an on-flash truncation 73 * node. 74 * @trun: the truncation node to zero out 75 */ 76 static inline void zero_trun_node_unused(struct ubifs_trun_node *trun) 77 { 78 memset(trun->padding, 0, 12); 79 } 80 81 static void ubifs_add_auth_dirt(struct ubifs_info *c, int lnum) 82 { 83 if (ubifs_authenticated(c)) 84 ubifs_add_dirt(c, lnum, ubifs_auth_node_sz(c)); 85 } 86 87 /** 88 * reserve_space - reserve space in the journal. 89 * @c: UBIFS file-system description object 90 * @jhead: journal head number 91 * @len: node length 92 * 93 * This function reserves space in journal head @head. If the reservation 94 * succeeded, the journal head stays locked and later has to be unlocked using 95 * 'release_head()'. Returns zero in case of success, %-EAGAIN if commit has to 96 * be done, and other negative error codes in case of other failures. 97 */ 98 static int reserve_space(struct ubifs_info *c, int jhead, int len) 99 { 100 int err = 0, err1, retries = 0, avail, lnum, offs, squeeze; 101 struct ubifs_wbuf *wbuf = &c->jheads[jhead].wbuf; 102 103 /* 104 * Typically, the base head has smaller nodes written to it, so it is 105 * better to try to allocate space at the ends of eraseblocks. This is 106 * what the squeeze parameter does. 107 */ 108 ubifs_assert(c, !c->ro_media && !c->ro_mount); 109 squeeze = (jhead == BASEHD); 110 again: 111 mutex_lock_nested(&wbuf->io_mutex, wbuf->jhead); 112 113 if (c->ro_error) { 114 err = -EROFS; 115 goto out_unlock; 116 } 117 118 avail = c->leb_size - wbuf->offs - wbuf->used; 119 if (wbuf->lnum != -1 && avail >= len) 120 return 0; 121 122 /* 123 * Write buffer wasn't seek'ed or there is no enough space - look for an 124 * LEB with some empty space. 125 */ 126 lnum = ubifs_find_free_space(c, len, &offs, squeeze); 127 if (lnum >= 0) 128 goto out; 129 130 err = lnum; 131 if (err != -ENOSPC) 132 goto out_unlock; 133 134 /* 135 * No free space, we have to run garbage collector to make 136 * some. But the write-buffer mutex has to be unlocked because 137 * GC also takes it. 138 */ 139 dbg_jnl("no free space in jhead %s, run GC", dbg_jhead(jhead)); 140 mutex_unlock(&wbuf->io_mutex); 141 142 lnum = ubifs_garbage_collect(c, 0); 143 if (lnum < 0) { 144 err = lnum; 145 if (err != -ENOSPC) 146 return err; 147 148 /* 149 * GC could not make a free LEB. But someone else may 150 * have allocated new bud for this journal head, 151 * because we dropped @wbuf->io_mutex, so try once 152 * again. 153 */ 154 dbg_jnl("GC couldn't make a free LEB for jhead %s", 155 dbg_jhead(jhead)); 156 if (retries++ < 2) { 157 dbg_jnl("retry (%d)", retries); 158 goto again; 159 } 160 161 dbg_jnl("return -ENOSPC"); 162 return err; 163 } 164 165 mutex_lock_nested(&wbuf->io_mutex, wbuf->jhead); 166 dbg_jnl("got LEB %d for jhead %s", lnum, dbg_jhead(jhead)); 167 avail = c->leb_size - wbuf->offs - wbuf->used; 168 169 if (wbuf->lnum != -1 && avail >= len) { 170 /* 171 * Someone else has switched the journal head and we have 172 * enough space now. This happens when more than one process is 173 * trying to write to the same journal head at the same time. 174 */ 175 dbg_jnl("return LEB %d back, already have LEB %d:%d", 176 lnum, wbuf->lnum, wbuf->offs + wbuf->used); 177 err = ubifs_return_leb(c, lnum); 178 if (err) 179 goto out_unlock; 180 return 0; 181 } 182 183 offs = 0; 184 185 out: 186 /* 187 * Make sure we synchronize the write-buffer before we add the new bud 188 * to the log. Otherwise we may have a power cut after the log 189 * reference node for the last bud (@lnum) is written but before the 190 * write-buffer data are written to the next-to-last bud 191 * (@wbuf->lnum). And the effect would be that the recovery would see 192 * that there is corruption in the next-to-last bud. 193 */ 194 err = ubifs_wbuf_sync_nolock(wbuf); 195 if (err) 196 goto out_return; 197 err = ubifs_add_bud_to_log(c, jhead, lnum, offs); 198 if (err) 199 goto out_return; 200 err = ubifs_wbuf_seek_nolock(wbuf, lnum, offs); 201 if (err) 202 goto out_unlock; 203 204 return 0; 205 206 out_unlock: 207 mutex_unlock(&wbuf->io_mutex); 208 return err; 209 210 out_return: 211 /* An error occurred and the LEB has to be returned to lprops */ 212 ubifs_assert(c, err < 0); 213 err1 = ubifs_return_leb(c, lnum); 214 if (err1 && err == -EAGAIN) 215 /* 216 * Return original error code only if it is not %-EAGAIN, 217 * which is not really an error. Otherwise, return the error 218 * code of 'ubifs_return_leb()'. 219 */ 220 err = err1; 221 mutex_unlock(&wbuf->io_mutex); 222 return err; 223 } 224 225 static int ubifs_hash_nodes(struct ubifs_info *c, void *node, 226 int len, struct shash_desc *hash) 227 { 228 int auth_node_size = ubifs_auth_node_sz(c); 229 int err; 230 231 while (1) { 232 const struct ubifs_ch *ch = node; 233 int nodelen = le32_to_cpu(ch->len); 234 235 ubifs_assert(c, len >= auth_node_size); 236 237 if (len == auth_node_size) 238 break; 239 240 ubifs_assert(c, len > nodelen); 241 ubifs_assert(c, ch->magic == cpu_to_le32(UBIFS_NODE_MAGIC)); 242 243 err = ubifs_shash_update(c, hash, (void *)node, nodelen); 244 if (err) 245 return err; 246 247 node += ALIGN(nodelen, 8); 248 len -= ALIGN(nodelen, 8); 249 } 250 251 return ubifs_prepare_auth_node(c, node, hash); 252 } 253 254 /** 255 * write_head - write data to a journal head. 256 * @c: UBIFS file-system description object 257 * @jhead: journal head 258 * @buf: buffer to write 259 * @len: length to write 260 * @lnum: LEB number written is returned here 261 * @offs: offset written is returned here 262 * @sync: non-zero if the write-buffer has to by synchronized 263 * 264 * This function writes data to the reserved space of journal head @jhead. 265 * Returns zero in case of success and a negative error code in case of 266 * failure. 267 */ 268 static int write_head(struct ubifs_info *c, int jhead, void *buf, int len, 269 int *lnum, int *offs, int sync) 270 { 271 int err; 272 struct ubifs_wbuf *wbuf = &c->jheads[jhead].wbuf; 273 274 ubifs_assert(c, jhead != GCHD); 275 276 *lnum = c->jheads[jhead].wbuf.lnum; 277 *offs = c->jheads[jhead].wbuf.offs + c->jheads[jhead].wbuf.used; 278 dbg_jnl("jhead %s, LEB %d:%d, len %d", 279 dbg_jhead(jhead), *lnum, *offs, len); 280 281 if (ubifs_authenticated(c)) { 282 err = ubifs_hash_nodes(c, buf, len, c->jheads[jhead].log_hash); 283 if (err) 284 return err; 285 } 286 287 err = ubifs_wbuf_write_nolock(wbuf, buf, len); 288 if (err) 289 return err; 290 if (sync) 291 err = ubifs_wbuf_sync_nolock(wbuf); 292 return err; 293 } 294 295 /** 296 * make_reservation - reserve journal space. 297 * @c: UBIFS file-system description object 298 * @jhead: journal head 299 * @len: how many bytes to reserve 300 * 301 * This function makes space reservation in journal head @jhead. The function 302 * takes the commit lock and locks the journal head, and the caller has to 303 * unlock the head and finish the reservation with 'finish_reservation()'. 304 * Returns zero in case of success and a negative error code in case of 305 * failure. 306 * 307 * Note, the journal head may be unlocked as soon as the data is written, while 308 * the commit lock has to be released after the data has been added to the 309 * TNC. 310 */ 311 static int make_reservation(struct ubifs_info *c, int jhead, int len) 312 { 313 int err, cmt_retries = 0, nospc_retries = 0; 314 315 again: 316 down_read(&c->commit_sem); 317 err = reserve_space(c, jhead, len); 318 if (!err) 319 /* c->commit_sem will get released via finish_reservation(). */ 320 return 0; 321 up_read(&c->commit_sem); 322 323 if (err == -ENOSPC) { 324 /* 325 * GC could not make any progress. We should try to commit 326 * once because it could make some dirty space and GC would 327 * make progress, so make the error -EAGAIN so that the below 328 * will commit and re-try. 329 */ 330 if (nospc_retries++ < 2) { 331 dbg_jnl("no space, retry"); 332 err = -EAGAIN; 333 } 334 335 /* 336 * This means that the budgeting is incorrect. We always have 337 * to be able to write to the media, because all operations are 338 * budgeted. Deletions are not budgeted, though, but we reserve 339 * an extra LEB for them. 340 */ 341 } 342 343 if (err != -EAGAIN) 344 goto out; 345 346 /* 347 * -EAGAIN means that the journal is full or too large, or the above 348 * code wants to do one commit. Do this and re-try. 349 */ 350 if (cmt_retries > 128) { 351 /* 352 * This should not happen unless the journal size limitations 353 * are too tough. 354 */ 355 ubifs_err(c, "stuck in space allocation"); 356 err = -ENOSPC; 357 goto out; 358 } else if (cmt_retries > 32) 359 ubifs_warn(c, "too many space allocation re-tries (%d)", 360 cmt_retries); 361 362 dbg_jnl("-EAGAIN, commit and retry (retried %d times)", 363 cmt_retries); 364 cmt_retries += 1; 365 366 err = ubifs_run_commit(c); 367 if (err) 368 return err; 369 goto again; 370 371 out: 372 ubifs_err(c, "cannot reserve %d bytes in jhead %d, error %d", 373 len, jhead, err); 374 if (err == -ENOSPC) { 375 /* This are some budgeting problems, print useful information */ 376 down_write(&c->commit_sem); 377 dump_stack(); 378 ubifs_dump_budg(c, &c->bi); 379 ubifs_dump_lprops(c); 380 cmt_retries = dbg_check_lprops(c); 381 up_write(&c->commit_sem); 382 } 383 return err; 384 } 385 386 /** 387 * release_head - release a journal head. 388 * @c: UBIFS file-system description object 389 * @jhead: journal head 390 * 391 * This function releases journal head @jhead which was locked by 392 * the 'make_reservation()' function. It has to be called after each successful 393 * 'make_reservation()' invocation. 394 */ 395 static inline void release_head(struct ubifs_info *c, int jhead) 396 { 397 mutex_unlock(&c->jheads[jhead].wbuf.io_mutex); 398 } 399 400 /** 401 * finish_reservation - finish a reservation. 402 * @c: UBIFS file-system description object 403 * 404 * This function finishes journal space reservation. It must be called after 405 * 'make_reservation()'. 406 */ 407 static void finish_reservation(struct ubifs_info *c) 408 { 409 up_read(&c->commit_sem); 410 } 411 412 /** 413 * get_dent_type - translate VFS inode mode to UBIFS directory entry type. 414 * @mode: inode mode 415 */ 416 static int get_dent_type(int mode) 417 { 418 switch (mode & S_IFMT) { 419 case S_IFREG: 420 return UBIFS_ITYPE_REG; 421 case S_IFDIR: 422 return UBIFS_ITYPE_DIR; 423 case S_IFLNK: 424 return UBIFS_ITYPE_LNK; 425 case S_IFBLK: 426 return UBIFS_ITYPE_BLK; 427 case S_IFCHR: 428 return UBIFS_ITYPE_CHR; 429 case S_IFIFO: 430 return UBIFS_ITYPE_FIFO; 431 case S_IFSOCK: 432 return UBIFS_ITYPE_SOCK; 433 default: 434 BUG(); 435 } 436 return 0; 437 } 438 439 /** 440 * pack_inode - pack an inode node. 441 * @c: UBIFS file-system description object 442 * @ino: buffer in which to pack inode node 443 * @inode: inode to pack 444 * @last: indicates the last node of the group 445 */ 446 static void pack_inode(struct ubifs_info *c, struct ubifs_ino_node *ino, 447 const struct inode *inode, int last) 448 { 449 int data_len = 0, last_reference = !inode->i_nlink; 450 struct ubifs_inode *ui = ubifs_inode(inode); 451 452 ino->ch.node_type = UBIFS_INO_NODE; 453 ino_key_init_flash(c, &ino->key, inode->i_ino); 454 ino->creat_sqnum = cpu_to_le64(ui->creat_sqnum); 455 ino->atime_sec = cpu_to_le64(inode->i_atime.tv_sec); 456 ino->atime_nsec = cpu_to_le32(inode->i_atime.tv_nsec); 457 ino->ctime_sec = cpu_to_le64(inode->i_ctime.tv_sec); 458 ino->ctime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec); 459 ino->mtime_sec = cpu_to_le64(inode->i_mtime.tv_sec); 460 ino->mtime_nsec = cpu_to_le32(inode->i_mtime.tv_nsec); 461 ino->uid = cpu_to_le32(i_uid_read(inode)); 462 ino->gid = cpu_to_le32(i_gid_read(inode)); 463 ino->mode = cpu_to_le32(inode->i_mode); 464 ino->flags = cpu_to_le32(ui->flags); 465 ino->size = cpu_to_le64(ui->ui_size); 466 ino->nlink = cpu_to_le32(inode->i_nlink); 467 ino->compr_type = cpu_to_le16(ui->compr_type); 468 ino->data_len = cpu_to_le32(ui->data_len); 469 ino->xattr_cnt = cpu_to_le32(ui->xattr_cnt); 470 ino->xattr_size = cpu_to_le32(ui->xattr_size); 471 ino->xattr_names = cpu_to_le32(ui->xattr_names); 472 zero_ino_node_unused(ino); 473 474 /* 475 * Drop the attached data if this is a deletion inode, the data is not 476 * needed anymore. 477 */ 478 if (!last_reference) { 479 memcpy(ino->data, ui->data, ui->data_len); 480 data_len = ui->data_len; 481 } 482 483 ubifs_prep_grp_node(c, ino, UBIFS_INO_NODE_SZ + data_len, last); 484 } 485 486 /** 487 * mark_inode_clean - mark UBIFS inode as clean. 488 * @c: UBIFS file-system description object 489 * @ui: UBIFS inode to mark as clean 490 * 491 * This helper function marks UBIFS inode @ui as clean by cleaning the 492 * @ui->dirty flag and releasing its budget. Note, VFS may still treat the 493 * inode as dirty and try to write it back, but 'ubifs_write_inode()' would 494 * just do nothing. 495 */ 496 static void mark_inode_clean(struct ubifs_info *c, struct ubifs_inode *ui) 497 { 498 if (ui->dirty) 499 ubifs_release_dirty_inode_budget(c, ui); 500 ui->dirty = 0; 501 } 502 503 static void set_dent_cookie(struct ubifs_info *c, struct ubifs_dent_node *dent) 504 { 505 if (c->double_hash) 506 dent->cookie = (__force __le32) prandom_u32(); 507 else 508 dent->cookie = 0; 509 } 510 511 /** 512 * ubifs_jnl_update - update inode. 513 * @c: UBIFS file-system description object 514 * @dir: parent inode or host inode in case of extended attributes 515 * @nm: directory entry name 516 * @inode: inode to update 517 * @deletion: indicates a directory entry deletion i.e unlink or rmdir 518 * @xent: non-zero if the directory entry is an extended attribute entry 519 * 520 * This function updates an inode by writing a directory entry (or extended 521 * attribute entry), the inode itself, and the parent directory inode (or the 522 * host inode) to the journal. 523 * 524 * The function writes the host inode @dir last, which is important in case of 525 * extended attributes. Indeed, then we guarantee that if the host inode gets 526 * synchronized (with 'fsync()'), and the write-buffer it sits in gets flushed, 527 * the extended attribute inode gets flushed too. And this is exactly what the 528 * user expects - synchronizing the host inode synchronizes its extended 529 * attributes. Similarly, this guarantees that if @dir is synchronized, its 530 * directory entry corresponding to @nm gets synchronized too. 531 * 532 * If the inode (@inode) or the parent directory (@dir) are synchronous, this 533 * function synchronizes the write-buffer. 534 * 535 * This function marks the @dir and @inode inodes as clean and returns zero on 536 * success. In case of failure, a negative error code is returned. 537 */ 538 int ubifs_jnl_update(struct ubifs_info *c, const struct inode *dir, 539 const struct fscrypt_name *nm, const struct inode *inode, 540 int deletion, int xent) 541 { 542 int err, dlen, ilen, len, lnum, ino_offs, dent_offs, orphan_added = 0; 543 int aligned_dlen, aligned_ilen, sync = IS_DIRSYNC(dir); 544 int last_reference = !!(deletion && inode->i_nlink == 0); 545 struct ubifs_inode *ui = ubifs_inode(inode); 546 struct ubifs_inode *host_ui = ubifs_inode(dir); 547 struct ubifs_dent_node *dent; 548 struct ubifs_ino_node *ino; 549 union ubifs_key dent_key, ino_key; 550 u8 hash_dent[UBIFS_HASH_ARR_SZ]; 551 u8 hash_ino[UBIFS_HASH_ARR_SZ]; 552 u8 hash_ino_host[UBIFS_HASH_ARR_SZ]; 553 554 ubifs_assert(c, mutex_is_locked(&host_ui->ui_mutex)); 555 556 dlen = UBIFS_DENT_NODE_SZ + fname_len(nm) + 1; 557 ilen = UBIFS_INO_NODE_SZ; 558 559 /* 560 * If the last reference to the inode is being deleted, then there is 561 * no need to attach and write inode data, it is being deleted anyway. 562 * And if the inode is being deleted, no need to synchronize 563 * write-buffer even if the inode is synchronous. 564 */ 565 if (!last_reference) { 566 ilen += ui->data_len; 567 sync |= IS_SYNC(inode); 568 } 569 570 aligned_dlen = ALIGN(dlen, 8); 571 aligned_ilen = ALIGN(ilen, 8); 572 573 len = aligned_dlen + aligned_ilen + UBIFS_INO_NODE_SZ; 574 /* Make sure to also account for extended attributes */ 575 if (ubifs_authenticated(c)) 576 len += ALIGN(host_ui->data_len, 8) + ubifs_auth_node_sz(c); 577 else 578 len += host_ui->data_len; 579 580 dent = kzalloc(len, GFP_NOFS); 581 if (!dent) 582 return -ENOMEM; 583 584 /* Make reservation before allocating sequence numbers */ 585 err = make_reservation(c, BASEHD, len); 586 if (err) 587 goto out_free; 588 589 if (!xent) { 590 dent->ch.node_type = UBIFS_DENT_NODE; 591 if (fname_name(nm) == NULL) 592 dent_key_init_hash(c, &dent_key, dir->i_ino, nm->hash); 593 else 594 dent_key_init(c, &dent_key, dir->i_ino, nm); 595 } else { 596 dent->ch.node_type = UBIFS_XENT_NODE; 597 xent_key_init(c, &dent_key, dir->i_ino, nm); 598 } 599 600 key_write(c, &dent_key, dent->key); 601 dent->inum = deletion ? 0 : cpu_to_le64(inode->i_ino); 602 dent->type = get_dent_type(inode->i_mode); 603 dent->nlen = cpu_to_le16(fname_len(nm)); 604 memcpy(dent->name, fname_name(nm), fname_len(nm)); 605 dent->name[fname_len(nm)] = '\0'; 606 set_dent_cookie(c, dent); 607 608 zero_dent_node_unused(dent); 609 ubifs_prep_grp_node(c, dent, dlen, 0); 610 err = ubifs_node_calc_hash(c, dent, hash_dent); 611 if (err) 612 goto out_release; 613 614 ino = (void *)dent + aligned_dlen; 615 pack_inode(c, ino, inode, 0); 616 err = ubifs_node_calc_hash(c, ino, hash_ino); 617 if (err) 618 goto out_release; 619 620 ino = (void *)ino + aligned_ilen; 621 pack_inode(c, ino, dir, 1); 622 err = ubifs_node_calc_hash(c, ino, hash_ino_host); 623 if (err) 624 goto out_release; 625 626 if (last_reference) { 627 err = ubifs_add_orphan(c, inode->i_ino); 628 if (err) { 629 release_head(c, BASEHD); 630 goto out_finish; 631 } 632 ui->del_cmtno = c->cmt_no; 633 orphan_added = 1; 634 } 635 636 err = write_head(c, BASEHD, dent, len, &lnum, &dent_offs, sync); 637 if (err) 638 goto out_release; 639 if (!sync) { 640 struct ubifs_wbuf *wbuf = &c->jheads[BASEHD].wbuf; 641 642 ubifs_wbuf_add_ino_nolock(wbuf, inode->i_ino); 643 ubifs_wbuf_add_ino_nolock(wbuf, dir->i_ino); 644 } 645 release_head(c, BASEHD); 646 kfree(dent); 647 ubifs_add_auth_dirt(c, lnum); 648 649 if (deletion) { 650 if (fname_name(nm) == NULL) 651 err = ubifs_tnc_remove_dh(c, &dent_key, nm->minor_hash); 652 else 653 err = ubifs_tnc_remove_nm(c, &dent_key, nm); 654 if (err) 655 goto out_ro; 656 err = ubifs_add_dirt(c, lnum, dlen); 657 } else 658 err = ubifs_tnc_add_nm(c, &dent_key, lnum, dent_offs, dlen, 659 hash_dent, nm); 660 if (err) 661 goto out_ro; 662 663 /* 664 * Note, we do not remove the inode from TNC even if the last reference 665 * to it has just been deleted, because the inode may still be opened. 666 * Instead, the inode has been added to orphan lists and the orphan 667 * subsystem will take further care about it. 668 */ 669 ino_key_init(c, &ino_key, inode->i_ino); 670 ino_offs = dent_offs + aligned_dlen; 671 err = ubifs_tnc_add(c, &ino_key, lnum, ino_offs, ilen, hash_ino); 672 if (err) 673 goto out_ro; 674 675 ino_key_init(c, &ino_key, dir->i_ino); 676 ino_offs += aligned_ilen; 677 err = ubifs_tnc_add(c, &ino_key, lnum, ino_offs, 678 UBIFS_INO_NODE_SZ + host_ui->data_len, hash_ino_host); 679 if (err) 680 goto out_ro; 681 682 finish_reservation(c); 683 spin_lock(&ui->ui_lock); 684 ui->synced_i_size = ui->ui_size; 685 spin_unlock(&ui->ui_lock); 686 if (xent) { 687 spin_lock(&host_ui->ui_lock); 688 host_ui->synced_i_size = host_ui->ui_size; 689 spin_unlock(&host_ui->ui_lock); 690 } 691 mark_inode_clean(c, ui); 692 mark_inode_clean(c, host_ui); 693 return 0; 694 695 out_finish: 696 finish_reservation(c); 697 out_free: 698 kfree(dent); 699 return err; 700 701 out_release: 702 release_head(c, BASEHD); 703 kfree(dent); 704 out_ro: 705 ubifs_ro_mode(c, err); 706 if (orphan_added) 707 ubifs_delete_orphan(c, inode->i_ino); 708 finish_reservation(c); 709 return err; 710 } 711 712 /** 713 * ubifs_jnl_write_data - write a data node to the journal. 714 * @c: UBIFS file-system description object 715 * @inode: inode the data node belongs to 716 * @key: node key 717 * @buf: buffer to write 718 * @len: data length (must not exceed %UBIFS_BLOCK_SIZE) 719 * 720 * This function writes a data node to the journal. Returns %0 if the data node 721 * was successfully written, and a negative error code in case of failure. 722 */ 723 int ubifs_jnl_write_data(struct ubifs_info *c, const struct inode *inode, 724 const union ubifs_key *key, const void *buf, int len) 725 { 726 struct ubifs_data_node *data; 727 int err, lnum, offs, compr_type, out_len, compr_len, auth_len; 728 int dlen = COMPRESSED_DATA_NODE_BUF_SZ, allocated = 1; 729 int write_len; 730 struct ubifs_inode *ui = ubifs_inode(inode); 731 bool encrypted = IS_ENCRYPTED(inode); 732 u8 hash[UBIFS_HASH_ARR_SZ]; 733 734 dbg_jnlk(key, "ino %lu, blk %u, len %d, key ", 735 (unsigned long)key_inum(c, key), key_block(c, key), len); 736 ubifs_assert(c, len <= UBIFS_BLOCK_SIZE); 737 738 if (encrypted) 739 dlen += UBIFS_CIPHER_BLOCK_SIZE; 740 741 auth_len = ubifs_auth_node_sz(c); 742 743 data = kmalloc(dlen + auth_len, GFP_NOFS | __GFP_NOWARN); 744 if (!data) { 745 /* 746 * Fall-back to the write reserve buffer. Note, we might be 747 * currently on the memory reclaim path, when the kernel is 748 * trying to free some memory by writing out dirty pages. The 749 * write reserve buffer helps us to guarantee that we are 750 * always able to write the data. 751 */ 752 allocated = 0; 753 mutex_lock(&c->write_reserve_mutex); 754 data = c->write_reserve_buf; 755 } 756 757 data->ch.node_type = UBIFS_DATA_NODE; 758 key_write(c, key, &data->key); 759 data->size = cpu_to_le32(len); 760 761 if (!(ui->flags & UBIFS_COMPR_FL)) 762 /* Compression is disabled for this inode */ 763 compr_type = UBIFS_COMPR_NONE; 764 else 765 compr_type = ui->compr_type; 766 767 out_len = compr_len = dlen - UBIFS_DATA_NODE_SZ; 768 ubifs_compress(c, buf, len, &data->data, &compr_len, &compr_type); 769 ubifs_assert(c, compr_len <= UBIFS_BLOCK_SIZE); 770 771 if (encrypted) { 772 err = ubifs_encrypt(inode, data, compr_len, &out_len, key_block(c, key)); 773 if (err) 774 goto out_free; 775 776 } else { 777 data->compr_size = 0; 778 out_len = compr_len; 779 } 780 781 dlen = UBIFS_DATA_NODE_SZ + out_len; 782 if (ubifs_authenticated(c)) 783 write_len = ALIGN(dlen, 8) + auth_len; 784 else 785 write_len = dlen; 786 787 data->compr_type = cpu_to_le16(compr_type); 788 789 /* Make reservation before allocating sequence numbers */ 790 err = make_reservation(c, DATAHD, write_len); 791 if (err) 792 goto out_free; 793 794 ubifs_prepare_node(c, data, dlen, 0); 795 err = write_head(c, DATAHD, data, write_len, &lnum, &offs, 0); 796 if (err) 797 goto out_release; 798 799 err = ubifs_node_calc_hash(c, data, hash); 800 if (err) 801 goto out_release; 802 803 ubifs_wbuf_add_ino_nolock(&c->jheads[DATAHD].wbuf, key_inum(c, key)); 804 release_head(c, DATAHD); 805 806 ubifs_add_auth_dirt(c, lnum); 807 808 err = ubifs_tnc_add(c, key, lnum, offs, dlen, hash); 809 if (err) 810 goto out_ro; 811 812 finish_reservation(c); 813 if (!allocated) 814 mutex_unlock(&c->write_reserve_mutex); 815 else 816 kfree(data); 817 return 0; 818 819 out_release: 820 release_head(c, DATAHD); 821 out_ro: 822 ubifs_ro_mode(c, err); 823 finish_reservation(c); 824 out_free: 825 if (!allocated) 826 mutex_unlock(&c->write_reserve_mutex); 827 else 828 kfree(data); 829 return err; 830 } 831 832 /** 833 * ubifs_jnl_write_inode - flush inode to the journal. 834 * @c: UBIFS file-system description object 835 * @inode: inode to flush 836 * 837 * This function writes inode @inode to the journal. If the inode is 838 * synchronous, it also synchronizes the write-buffer. Returns zero in case of 839 * success and a negative error code in case of failure. 840 */ 841 int ubifs_jnl_write_inode(struct ubifs_info *c, const struct inode *inode) 842 { 843 int err, lnum, offs; 844 struct ubifs_ino_node *ino, *ino_start; 845 struct ubifs_inode *ui = ubifs_inode(inode); 846 int sync = 0, write_len = 0, ilen = UBIFS_INO_NODE_SZ; 847 int last_reference = !inode->i_nlink; 848 int kill_xattrs = ui->xattr_cnt && last_reference; 849 u8 hash[UBIFS_HASH_ARR_SZ]; 850 851 dbg_jnl("ino %lu, nlink %u", inode->i_ino, inode->i_nlink); 852 853 /* 854 * If the inode is being deleted, do not write the attached data. No 855 * need to synchronize the write-buffer either. 856 */ 857 if (!last_reference) { 858 ilen += ui->data_len; 859 sync = IS_SYNC(inode); 860 } else if (kill_xattrs) { 861 write_len += UBIFS_INO_NODE_SZ * ui->xattr_cnt; 862 } 863 864 if (ubifs_authenticated(c)) 865 write_len += ALIGN(ilen, 8) + ubifs_auth_node_sz(c); 866 else 867 write_len += ilen; 868 869 ino_start = ino = kmalloc(write_len, GFP_NOFS); 870 if (!ino) 871 return -ENOMEM; 872 873 /* Make reservation before allocating sequence numbers */ 874 err = make_reservation(c, BASEHD, write_len); 875 if (err) 876 goto out_free; 877 878 if (kill_xattrs) { 879 union ubifs_key key; 880 struct fscrypt_name nm = {0}; 881 struct inode *xino; 882 struct ubifs_dent_node *xent, *pxent = NULL; 883 884 if (ui->xattr_cnt > ubifs_xattr_max_cnt(c)) { 885 ubifs_err(c, "Cannot delete inode, it has too much xattrs!"); 886 goto out_release; 887 } 888 889 lowest_xent_key(c, &key, inode->i_ino); 890 while (1) { 891 xent = ubifs_tnc_next_ent(c, &key, &nm); 892 if (IS_ERR(xent)) { 893 err = PTR_ERR(xent); 894 if (err == -ENOENT) 895 break; 896 897 kfree(pxent); 898 goto out_release; 899 } 900 901 fname_name(&nm) = xent->name; 902 fname_len(&nm) = le16_to_cpu(xent->nlen); 903 904 xino = ubifs_iget(c->vfs_sb, le64_to_cpu(xent->inum)); 905 if (IS_ERR(xino)) { 906 err = PTR_ERR(xino); 907 ubifs_err(c, "dead directory entry '%s', error %d", 908 xent->name, err); 909 ubifs_ro_mode(c, err); 910 kfree(pxent); 911 kfree(xent); 912 goto out_release; 913 } 914 ubifs_assert(c, ubifs_inode(xino)->xattr); 915 916 clear_nlink(xino); 917 pack_inode(c, ino, xino, 0); 918 ino = (void *)ino + UBIFS_INO_NODE_SZ; 919 iput(xino); 920 921 kfree(pxent); 922 pxent = xent; 923 key_read(c, &xent->key, &key); 924 } 925 kfree(pxent); 926 } 927 928 pack_inode(c, ino, inode, 1); 929 err = ubifs_node_calc_hash(c, ino, hash); 930 if (err) 931 goto out_release; 932 933 err = write_head(c, BASEHD, ino_start, write_len, &lnum, &offs, sync); 934 if (err) 935 goto out_release; 936 if (!sync) 937 ubifs_wbuf_add_ino_nolock(&c->jheads[BASEHD].wbuf, 938 inode->i_ino); 939 release_head(c, BASEHD); 940 941 if (last_reference) { 942 err = ubifs_tnc_remove_ino(c, inode->i_ino); 943 if (err) 944 goto out_ro; 945 ubifs_delete_orphan(c, inode->i_ino); 946 err = ubifs_add_dirt(c, lnum, write_len); 947 } else { 948 union ubifs_key key; 949 950 ubifs_add_auth_dirt(c, lnum); 951 952 ino_key_init(c, &key, inode->i_ino); 953 err = ubifs_tnc_add(c, &key, lnum, offs, ilen, hash); 954 } 955 if (err) 956 goto out_ro; 957 958 finish_reservation(c); 959 spin_lock(&ui->ui_lock); 960 ui->synced_i_size = ui->ui_size; 961 spin_unlock(&ui->ui_lock); 962 kfree(ino_start); 963 return 0; 964 965 out_release: 966 release_head(c, BASEHD); 967 out_ro: 968 ubifs_ro_mode(c, err); 969 finish_reservation(c); 970 out_free: 971 kfree(ino_start); 972 return err; 973 } 974 975 /** 976 * ubifs_jnl_delete_inode - delete an inode. 977 * @c: UBIFS file-system description object 978 * @inode: inode to delete 979 * 980 * This function deletes inode @inode which includes removing it from orphans, 981 * deleting it from TNC and, in some cases, writing a deletion inode to the 982 * journal. 983 * 984 * When regular file inodes are unlinked or a directory inode is removed, the 985 * 'ubifs_jnl_update()' function writes a corresponding deletion inode and 986 * direntry to the media, and adds the inode to orphans. After this, when the 987 * last reference to this inode has been dropped, this function is called. In 988 * general, it has to write one more deletion inode to the media, because if 989 * a commit happened between 'ubifs_jnl_update()' and 990 * 'ubifs_jnl_delete_inode()', the deletion inode is not in the journal 991 * anymore, and in fact it might not be on the flash anymore, because it might 992 * have been garbage-collected already. And for optimization reasons UBIFS does 993 * not read the orphan area if it has been unmounted cleanly, so it would have 994 * no indication in the journal that there is a deleted inode which has to be 995 * removed from TNC. 996 * 997 * However, if there was no commit between 'ubifs_jnl_update()' and 998 * 'ubifs_jnl_delete_inode()', then there is no need to write the deletion 999 * inode to the media for the second time. And this is quite a typical case. 1000 * 1001 * This function returns zero in case of success and a negative error code in 1002 * case of failure. 1003 */ 1004 int ubifs_jnl_delete_inode(struct ubifs_info *c, const struct inode *inode) 1005 { 1006 int err; 1007 struct ubifs_inode *ui = ubifs_inode(inode); 1008 1009 ubifs_assert(c, inode->i_nlink == 0); 1010 1011 if (ui->xattr_cnt || ui->del_cmtno != c->cmt_no) 1012 /* A commit happened for sure or inode hosts xattrs */ 1013 return ubifs_jnl_write_inode(c, inode); 1014 1015 down_read(&c->commit_sem); 1016 /* 1017 * Check commit number again, because the first test has been done 1018 * without @c->commit_sem, so a commit might have happened. 1019 */ 1020 if (ui->del_cmtno != c->cmt_no) { 1021 up_read(&c->commit_sem); 1022 return ubifs_jnl_write_inode(c, inode); 1023 } 1024 1025 err = ubifs_tnc_remove_ino(c, inode->i_ino); 1026 if (err) 1027 ubifs_ro_mode(c, err); 1028 else 1029 ubifs_delete_orphan(c, inode->i_ino); 1030 up_read(&c->commit_sem); 1031 return err; 1032 } 1033 1034 /** 1035 * ubifs_jnl_xrename - cross rename two directory entries. 1036 * @c: UBIFS file-system description object 1037 * @fst_dir: parent inode of 1st directory entry to exchange 1038 * @fst_inode: 1st inode to exchange 1039 * @fst_nm: name of 1st inode to exchange 1040 * @snd_dir: parent inode of 2nd directory entry to exchange 1041 * @snd_inode: 2nd inode to exchange 1042 * @snd_nm: name of 2nd inode to exchange 1043 * @sync: non-zero if the write-buffer has to be synchronized 1044 * 1045 * This function implements the cross rename operation which may involve 1046 * writing 2 inodes and 2 directory entries. It marks the written inodes as clean 1047 * and returns zero on success. In case of failure, a negative error code is 1048 * returned. 1049 */ 1050 int ubifs_jnl_xrename(struct ubifs_info *c, const struct inode *fst_dir, 1051 const struct inode *fst_inode, 1052 const struct fscrypt_name *fst_nm, 1053 const struct inode *snd_dir, 1054 const struct inode *snd_inode, 1055 const struct fscrypt_name *snd_nm, int sync) 1056 { 1057 union ubifs_key key; 1058 struct ubifs_dent_node *dent1, *dent2; 1059 int err, dlen1, dlen2, lnum, offs, len, plen = UBIFS_INO_NODE_SZ; 1060 int aligned_dlen1, aligned_dlen2; 1061 int twoparents = (fst_dir != snd_dir); 1062 void *p; 1063 u8 hash_dent1[UBIFS_HASH_ARR_SZ]; 1064 u8 hash_dent2[UBIFS_HASH_ARR_SZ]; 1065 u8 hash_p1[UBIFS_HASH_ARR_SZ]; 1066 u8 hash_p2[UBIFS_HASH_ARR_SZ]; 1067 1068 ubifs_assert(c, ubifs_inode(fst_dir)->data_len == 0); 1069 ubifs_assert(c, ubifs_inode(snd_dir)->data_len == 0); 1070 ubifs_assert(c, mutex_is_locked(&ubifs_inode(fst_dir)->ui_mutex)); 1071 ubifs_assert(c, mutex_is_locked(&ubifs_inode(snd_dir)->ui_mutex)); 1072 1073 dlen1 = UBIFS_DENT_NODE_SZ + fname_len(snd_nm) + 1; 1074 dlen2 = UBIFS_DENT_NODE_SZ + fname_len(fst_nm) + 1; 1075 aligned_dlen1 = ALIGN(dlen1, 8); 1076 aligned_dlen2 = ALIGN(dlen2, 8); 1077 1078 len = aligned_dlen1 + aligned_dlen2 + ALIGN(plen, 8); 1079 if (twoparents) 1080 len += plen; 1081 1082 len += ubifs_auth_node_sz(c); 1083 1084 dent1 = kzalloc(len, GFP_NOFS); 1085 if (!dent1) 1086 return -ENOMEM; 1087 1088 /* Make reservation before allocating sequence numbers */ 1089 err = make_reservation(c, BASEHD, len); 1090 if (err) 1091 goto out_free; 1092 1093 /* Make new dent for 1st entry */ 1094 dent1->ch.node_type = UBIFS_DENT_NODE; 1095 dent_key_init_flash(c, &dent1->key, snd_dir->i_ino, snd_nm); 1096 dent1->inum = cpu_to_le64(fst_inode->i_ino); 1097 dent1->type = get_dent_type(fst_inode->i_mode); 1098 dent1->nlen = cpu_to_le16(fname_len(snd_nm)); 1099 memcpy(dent1->name, fname_name(snd_nm), fname_len(snd_nm)); 1100 dent1->name[fname_len(snd_nm)] = '\0'; 1101 set_dent_cookie(c, dent1); 1102 zero_dent_node_unused(dent1); 1103 ubifs_prep_grp_node(c, dent1, dlen1, 0); 1104 err = ubifs_node_calc_hash(c, dent1, hash_dent1); 1105 if (err) 1106 goto out_release; 1107 1108 /* Make new dent for 2nd entry */ 1109 dent2 = (void *)dent1 + aligned_dlen1; 1110 dent2->ch.node_type = UBIFS_DENT_NODE; 1111 dent_key_init_flash(c, &dent2->key, fst_dir->i_ino, fst_nm); 1112 dent2->inum = cpu_to_le64(snd_inode->i_ino); 1113 dent2->type = get_dent_type(snd_inode->i_mode); 1114 dent2->nlen = cpu_to_le16(fname_len(fst_nm)); 1115 memcpy(dent2->name, fname_name(fst_nm), fname_len(fst_nm)); 1116 dent2->name[fname_len(fst_nm)] = '\0'; 1117 set_dent_cookie(c, dent2); 1118 zero_dent_node_unused(dent2); 1119 ubifs_prep_grp_node(c, dent2, dlen2, 0); 1120 err = ubifs_node_calc_hash(c, dent2, hash_dent2); 1121 if (err) 1122 goto out_release; 1123 1124 p = (void *)dent2 + aligned_dlen2; 1125 if (!twoparents) { 1126 pack_inode(c, p, fst_dir, 1); 1127 err = ubifs_node_calc_hash(c, p, hash_p1); 1128 if (err) 1129 goto out_release; 1130 } else { 1131 pack_inode(c, p, fst_dir, 0); 1132 err = ubifs_node_calc_hash(c, p, hash_p1); 1133 if (err) 1134 goto out_release; 1135 p += ALIGN(plen, 8); 1136 pack_inode(c, p, snd_dir, 1); 1137 err = ubifs_node_calc_hash(c, p, hash_p2); 1138 if (err) 1139 goto out_release; 1140 } 1141 1142 err = write_head(c, BASEHD, dent1, len, &lnum, &offs, sync); 1143 if (err) 1144 goto out_release; 1145 if (!sync) { 1146 struct ubifs_wbuf *wbuf = &c->jheads[BASEHD].wbuf; 1147 1148 ubifs_wbuf_add_ino_nolock(wbuf, fst_dir->i_ino); 1149 ubifs_wbuf_add_ino_nolock(wbuf, snd_dir->i_ino); 1150 } 1151 release_head(c, BASEHD); 1152 1153 ubifs_add_auth_dirt(c, lnum); 1154 1155 dent_key_init(c, &key, snd_dir->i_ino, snd_nm); 1156 err = ubifs_tnc_add_nm(c, &key, lnum, offs, dlen1, hash_dent1, snd_nm); 1157 if (err) 1158 goto out_ro; 1159 1160 offs += aligned_dlen1; 1161 dent_key_init(c, &key, fst_dir->i_ino, fst_nm); 1162 err = ubifs_tnc_add_nm(c, &key, lnum, offs, dlen2, hash_dent2, fst_nm); 1163 if (err) 1164 goto out_ro; 1165 1166 offs += aligned_dlen2; 1167 1168 ino_key_init(c, &key, fst_dir->i_ino); 1169 err = ubifs_tnc_add(c, &key, lnum, offs, plen, hash_p1); 1170 if (err) 1171 goto out_ro; 1172 1173 if (twoparents) { 1174 offs += ALIGN(plen, 8); 1175 ino_key_init(c, &key, snd_dir->i_ino); 1176 err = ubifs_tnc_add(c, &key, lnum, offs, plen, hash_p2); 1177 if (err) 1178 goto out_ro; 1179 } 1180 1181 finish_reservation(c); 1182 1183 mark_inode_clean(c, ubifs_inode(fst_dir)); 1184 if (twoparents) 1185 mark_inode_clean(c, ubifs_inode(snd_dir)); 1186 kfree(dent1); 1187 return 0; 1188 1189 out_release: 1190 release_head(c, BASEHD); 1191 out_ro: 1192 ubifs_ro_mode(c, err); 1193 finish_reservation(c); 1194 out_free: 1195 kfree(dent1); 1196 return err; 1197 } 1198 1199 /** 1200 * ubifs_jnl_rename - rename a directory entry. 1201 * @c: UBIFS file-system description object 1202 * @old_dir: parent inode of directory entry to rename 1203 * @old_dentry: directory entry to rename 1204 * @new_dir: parent inode of directory entry to rename 1205 * @new_dentry: new directory entry (or directory entry to replace) 1206 * @sync: non-zero if the write-buffer has to be synchronized 1207 * 1208 * This function implements the re-name operation which may involve writing up 1209 * to 4 inodes and 2 directory entries. It marks the written inodes as clean 1210 * and returns zero on success. In case of failure, a negative error code is 1211 * returned. 1212 */ 1213 int ubifs_jnl_rename(struct ubifs_info *c, const struct inode *old_dir, 1214 const struct inode *old_inode, 1215 const struct fscrypt_name *old_nm, 1216 const struct inode *new_dir, 1217 const struct inode *new_inode, 1218 const struct fscrypt_name *new_nm, 1219 const struct inode *whiteout, int sync) 1220 { 1221 void *p; 1222 union ubifs_key key; 1223 struct ubifs_dent_node *dent, *dent2; 1224 int err, dlen1, dlen2, ilen, lnum, offs, len, orphan_added = 0; 1225 int aligned_dlen1, aligned_dlen2, plen = UBIFS_INO_NODE_SZ; 1226 int last_reference = !!(new_inode && new_inode->i_nlink == 0); 1227 int move = (old_dir != new_dir); 1228 struct ubifs_inode *new_ui; 1229 u8 hash_old_dir[UBIFS_HASH_ARR_SZ]; 1230 u8 hash_new_dir[UBIFS_HASH_ARR_SZ]; 1231 u8 hash_new_inode[UBIFS_HASH_ARR_SZ]; 1232 u8 hash_dent1[UBIFS_HASH_ARR_SZ]; 1233 u8 hash_dent2[UBIFS_HASH_ARR_SZ]; 1234 1235 ubifs_assert(c, ubifs_inode(old_dir)->data_len == 0); 1236 ubifs_assert(c, ubifs_inode(new_dir)->data_len == 0); 1237 ubifs_assert(c, mutex_is_locked(&ubifs_inode(old_dir)->ui_mutex)); 1238 ubifs_assert(c, mutex_is_locked(&ubifs_inode(new_dir)->ui_mutex)); 1239 1240 dlen1 = UBIFS_DENT_NODE_SZ + fname_len(new_nm) + 1; 1241 dlen2 = UBIFS_DENT_NODE_SZ + fname_len(old_nm) + 1; 1242 if (new_inode) { 1243 new_ui = ubifs_inode(new_inode); 1244 ubifs_assert(c, mutex_is_locked(&new_ui->ui_mutex)); 1245 ilen = UBIFS_INO_NODE_SZ; 1246 if (!last_reference) 1247 ilen += new_ui->data_len; 1248 } else 1249 ilen = 0; 1250 1251 aligned_dlen1 = ALIGN(dlen1, 8); 1252 aligned_dlen2 = ALIGN(dlen2, 8); 1253 len = aligned_dlen1 + aligned_dlen2 + ALIGN(ilen, 8) + ALIGN(plen, 8); 1254 if (move) 1255 len += plen; 1256 1257 len += ubifs_auth_node_sz(c); 1258 1259 dent = kzalloc(len, GFP_NOFS); 1260 if (!dent) 1261 return -ENOMEM; 1262 1263 /* Make reservation before allocating sequence numbers */ 1264 err = make_reservation(c, BASEHD, len); 1265 if (err) 1266 goto out_free; 1267 1268 /* Make new dent */ 1269 dent->ch.node_type = UBIFS_DENT_NODE; 1270 dent_key_init_flash(c, &dent->key, new_dir->i_ino, new_nm); 1271 dent->inum = cpu_to_le64(old_inode->i_ino); 1272 dent->type = get_dent_type(old_inode->i_mode); 1273 dent->nlen = cpu_to_le16(fname_len(new_nm)); 1274 memcpy(dent->name, fname_name(new_nm), fname_len(new_nm)); 1275 dent->name[fname_len(new_nm)] = '\0'; 1276 set_dent_cookie(c, dent); 1277 zero_dent_node_unused(dent); 1278 ubifs_prep_grp_node(c, dent, dlen1, 0); 1279 err = ubifs_node_calc_hash(c, dent, hash_dent1); 1280 if (err) 1281 goto out_release; 1282 1283 dent2 = (void *)dent + aligned_dlen1; 1284 dent2->ch.node_type = UBIFS_DENT_NODE; 1285 dent_key_init_flash(c, &dent2->key, old_dir->i_ino, old_nm); 1286 1287 if (whiteout) { 1288 dent2->inum = cpu_to_le64(whiteout->i_ino); 1289 dent2->type = get_dent_type(whiteout->i_mode); 1290 } else { 1291 /* Make deletion dent */ 1292 dent2->inum = 0; 1293 dent2->type = DT_UNKNOWN; 1294 } 1295 dent2->nlen = cpu_to_le16(fname_len(old_nm)); 1296 memcpy(dent2->name, fname_name(old_nm), fname_len(old_nm)); 1297 dent2->name[fname_len(old_nm)] = '\0'; 1298 set_dent_cookie(c, dent2); 1299 zero_dent_node_unused(dent2); 1300 ubifs_prep_grp_node(c, dent2, dlen2, 0); 1301 err = ubifs_node_calc_hash(c, dent2, hash_dent2); 1302 if (err) 1303 goto out_release; 1304 1305 p = (void *)dent2 + aligned_dlen2; 1306 if (new_inode) { 1307 pack_inode(c, p, new_inode, 0); 1308 err = ubifs_node_calc_hash(c, p, hash_new_inode); 1309 if (err) 1310 goto out_release; 1311 1312 p += ALIGN(ilen, 8); 1313 } 1314 1315 if (!move) { 1316 pack_inode(c, p, old_dir, 1); 1317 err = ubifs_node_calc_hash(c, p, hash_old_dir); 1318 if (err) 1319 goto out_release; 1320 } else { 1321 pack_inode(c, p, old_dir, 0); 1322 err = ubifs_node_calc_hash(c, p, hash_old_dir); 1323 if (err) 1324 goto out_release; 1325 1326 p += ALIGN(plen, 8); 1327 pack_inode(c, p, new_dir, 1); 1328 err = ubifs_node_calc_hash(c, p, hash_new_dir); 1329 if (err) 1330 goto out_release; 1331 } 1332 1333 if (last_reference) { 1334 err = ubifs_add_orphan(c, new_inode->i_ino); 1335 if (err) { 1336 release_head(c, BASEHD); 1337 goto out_finish; 1338 } 1339 new_ui->del_cmtno = c->cmt_no; 1340 orphan_added = 1; 1341 } 1342 1343 err = write_head(c, BASEHD, dent, len, &lnum, &offs, sync); 1344 if (err) 1345 goto out_release; 1346 if (!sync) { 1347 struct ubifs_wbuf *wbuf = &c->jheads[BASEHD].wbuf; 1348 1349 ubifs_wbuf_add_ino_nolock(wbuf, new_dir->i_ino); 1350 ubifs_wbuf_add_ino_nolock(wbuf, old_dir->i_ino); 1351 if (new_inode) 1352 ubifs_wbuf_add_ino_nolock(&c->jheads[BASEHD].wbuf, 1353 new_inode->i_ino); 1354 } 1355 release_head(c, BASEHD); 1356 1357 ubifs_add_auth_dirt(c, lnum); 1358 1359 dent_key_init(c, &key, new_dir->i_ino, new_nm); 1360 err = ubifs_tnc_add_nm(c, &key, lnum, offs, dlen1, hash_dent1, new_nm); 1361 if (err) 1362 goto out_ro; 1363 1364 offs += aligned_dlen1; 1365 if (whiteout) { 1366 dent_key_init(c, &key, old_dir->i_ino, old_nm); 1367 err = ubifs_tnc_add_nm(c, &key, lnum, offs, dlen2, hash_dent2, old_nm); 1368 if (err) 1369 goto out_ro; 1370 1371 ubifs_delete_orphan(c, whiteout->i_ino); 1372 } else { 1373 err = ubifs_add_dirt(c, lnum, dlen2); 1374 if (err) 1375 goto out_ro; 1376 1377 dent_key_init(c, &key, old_dir->i_ino, old_nm); 1378 err = ubifs_tnc_remove_nm(c, &key, old_nm); 1379 if (err) 1380 goto out_ro; 1381 } 1382 1383 offs += aligned_dlen2; 1384 if (new_inode) { 1385 ino_key_init(c, &key, new_inode->i_ino); 1386 err = ubifs_tnc_add(c, &key, lnum, offs, ilen, hash_new_inode); 1387 if (err) 1388 goto out_ro; 1389 offs += ALIGN(ilen, 8); 1390 } 1391 1392 ino_key_init(c, &key, old_dir->i_ino); 1393 err = ubifs_tnc_add(c, &key, lnum, offs, plen, hash_old_dir); 1394 if (err) 1395 goto out_ro; 1396 1397 if (move) { 1398 offs += ALIGN(plen, 8); 1399 ino_key_init(c, &key, new_dir->i_ino); 1400 err = ubifs_tnc_add(c, &key, lnum, offs, plen, hash_new_dir); 1401 if (err) 1402 goto out_ro; 1403 } 1404 1405 finish_reservation(c); 1406 if (new_inode) { 1407 mark_inode_clean(c, new_ui); 1408 spin_lock(&new_ui->ui_lock); 1409 new_ui->synced_i_size = new_ui->ui_size; 1410 spin_unlock(&new_ui->ui_lock); 1411 } 1412 mark_inode_clean(c, ubifs_inode(old_dir)); 1413 if (move) 1414 mark_inode_clean(c, ubifs_inode(new_dir)); 1415 kfree(dent); 1416 return 0; 1417 1418 out_release: 1419 release_head(c, BASEHD); 1420 out_ro: 1421 ubifs_ro_mode(c, err); 1422 if (orphan_added) 1423 ubifs_delete_orphan(c, new_inode->i_ino); 1424 out_finish: 1425 finish_reservation(c); 1426 out_free: 1427 kfree(dent); 1428 return err; 1429 } 1430 1431 /** 1432 * truncate_data_node - re-compress/encrypt a truncated data node. 1433 * @c: UBIFS file-system description object 1434 * @inode: inode which referes to the data node 1435 * @block: data block number 1436 * @dn: data node to re-compress 1437 * @new_len: new length 1438 * 1439 * This function is used when an inode is truncated and the last data node of 1440 * the inode has to be re-compressed/encrypted and re-written. 1441 */ 1442 static int truncate_data_node(const struct ubifs_info *c, const struct inode *inode, 1443 unsigned int block, struct ubifs_data_node *dn, 1444 int *new_len) 1445 { 1446 void *buf; 1447 int err, dlen, compr_type, out_len, old_dlen; 1448 1449 out_len = le32_to_cpu(dn->size); 1450 buf = kmalloc_array(out_len, WORST_COMPR_FACTOR, GFP_NOFS); 1451 if (!buf) 1452 return -ENOMEM; 1453 1454 dlen = old_dlen = le32_to_cpu(dn->ch.len) - UBIFS_DATA_NODE_SZ; 1455 compr_type = le16_to_cpu(dn->compr_type); 1456 1457 if (IS_ENCRYPTED(inode)) { 1458 err = ubifs_decrypt(inode, dn, &dlen, block); 1459 if (err) 1460 goto out; 1461 } 1462 1463 if (compr_type == UBIFS_COMPR_NONE) { 1464 out_len = *new_len; 1465 } else { 1466 err = ubifs_decompress(c, &dn->data, dlen, buf, &out_len, compr_type); 1467 if (err) 1468 goto out; 1469 1470 ubifs_compress(c, buf, *new_len, &dn->data, &out_len, &compr_type); 1471 } 1472 1473 if (IS_ENCRYPTED(inode)) { 1474 err = ubifs_encrypt(inode, dn, out_len, &old_dlen, block); 1475 if (err) 1476 goto out; 1477 1478 out_len = old_dlen; 1479 } else { 1480 dn->compr_size = 0; 1481 } 1482 1483 ubifs_assert(c, out_len <= UBIFS_BLOCK_SIZE); 1484 dn->compr_type = cpu_to_le16(compr_type); 1485 dn->size = cpu_to_le32(*new_len); 1486 *new_len = UBIFS_DATA_NODE_SZ + out_len; 1487 err = 0; 1488 out: 1489 kfree(buf); 1490 return err; 1491 } 1492 1493 /** 1494 * ubifs_jnl_truncate - update the journal for a truncation. 1495 * @c: UBIFS file-system description object 1496 * @inode: inode to truncate 1497 * @old_size: old size 1498 * @new_size: new size 1499 * 1500 * When the size of a file decreases due to truncation, a truncation node is 1501 * written, the journal tree is updated, and the last data block is re-written 1502 * if it has been affected. The inode is also updated in order to synchronize 1503 * the new inode size. 1504 * 1505 * This function marks the inode as clean and returns zero on success. In case 1506 * of failure, a negative error code is returned. 1507 */ 1508 int ubifs_jnl_truncate(struct ubifs_info *c, const struct inode *inode, 1509 loff_t old_size, loff_t new_size) 1510 { 1511 union ubifs_key key, to_key; 1512 struct ubifs_ino_node *ino; 1513 struct ubifs_trun_node *trun; 1514 struct ubifs_data_node *dn; 1515 int err, dlen, len, lnum, offs, bit, sz, sync = IS_SYNC(inode); 1516 struct ubifs_inode *ui = ubifs_inode(inode); 1517 ino_t inum = inode->i_ino; 1518 unsigned int blk; 1519 u8 hash_ino[UBIFS_HASH_ARR_SZ]; 1520 u8 hash_dn[UBIFS_HASH_ARR_SZ]; 1521 1522 dbg_jnl("ino %lu, size %lld -> %lld", 1523 (unsigned long)inum, old_size, new_size); 1524 ubifs_assert(c, !ui->data_len); 1525 ubifs_assert(c, S_ISREG(inode->i_mode)); 1526 ubifs_assert(c, mutex_is_locked(&ui->ui_mutex)); 1527 1528 sz = UBIFS_TRUN_NODE_SZ + UBIFS_INO_NODE_SZ + 1529 UBIFS_MAX_DATA_NODE_SZ * WORST_COMPR_FACTOR; 1530 1531 sz += ubifs_auth_node_sz(c); 1532 1533 ino = kmalloc(sz, GFP_NOFS); 1534 if (!ino) 1535 return -ENOMEM; 1536 1537 trun = (void *)ino + UBIFS_INO_NODE_SZ; 1538 trun->ch.node_type = UBIFS_TRUN_NODE; 1539 trun->inum = cpu_to_le32(inum); 1540 trun->old_size = cpu_to_le64(old_size); 1541 trun->new_size = cpu_to_le64(new_size); 1542 zero_trun_node_unused(trun); 1543 1544 dlen = new_size & (UBIFS_BLOCK_SIZE - 1); 1545 if (dlen) { 1546 /* Get last data block so it can be truncated */ 1547 dn = (void *)trun + UBIFS_TRUN_NODE_SZ; 1548 blk = new_size >> UBIFS_BLOCK_SHIFT; 1549 data_key_init(c, &key, inum, blk); 1550 dbg_jnlk(&key, "last block key "); 1551 err = ubifs_tnc_lookup(c, &key, dn); 1552 if (err == -ENOENT) 1553 dlen = 0; /* Not found (so it is a hole) */ 1554 else if (err) 1555 goto out_free; 1556 else { 1557 int dn_len = le32_to_cpu(dn->size); 1558 1559 if (dn_len <= 0 || dn_len > UBIFS_BLOCK_SIZE) { 1560 ubifs_err(c, "bad data node (block %u, inode %lu)", 1561 blk, inode->i_ino); 1562 ubifs_dump_node(c, dn, sz - UBIFS_INO_NODE_SZ - 1563 UBIFS_TRUN_NODE_SZ); 1564 goto out_free; 1565 } 1566 1567 if (dn_len <= dlen) 1568 dlen = 0; /* Nothing to do */ 1569 else { 1570 err = truncate_data_node(c, inode, blk, dn, &dlen); 1571 if (err) 1572 goto out_free; 1573 } 1574 } 1575 } 1576 1577 /* Must make reservation before allocating sequence numbers */ 1578 len = UBIFS_TRUN_NODE_SZ + UBIFS_INO_NODE_SZ; 1579 1580 if (ubifs_authenticated(c)) 1581 len += ALIGN(dlen, 8) + ubifs_auth_node_sz(c); 1582 else 1583 len += dlen; 1584 1585 err = make_reservation(c, BASEHD, len); 1586 if (err) 1587 goto out_free; 1588 1589 pack_inode(c, ino, inode, 0); 1590 err = ubifs_node_calc_hash(c, ino, hash_ino); 1591 if (err) 1592 goto out_release; 1593 1594 ubifs_prep_grp_node(c, trun, UBIFS_TRUN_NODE_SZ, dlen ? 0 : 1); 1595 if (dlen) { 1596 ubifs_prep_grp_node(c, dn, dlen, 1); 1597 err = ubifs_node_calc_hash(c, dn, hash_dn); 1598 if (err) 1599 goto out_release; 1600 } 1601 1602 err = write_head(c, BASEHD, ino, len, &lnum, &offs, sync); 1603 if (err) 1604 goto out_release; 1605 if (!sync) 1606 ubifs_wbuf_add_ino_nolock(&c->jheads[BASEHD].wbuf, inum); 1607 release_head(c, BASEHD); 1608 1609 ubifs_add_auth_dirt(c, lnum); 1610 1611 if (dlen) { 1612 sz = offs + UBIFS_INO_NODE_SZ + UBIFS_TRUN_NODE_SZ; 1613 err = ubifs_tnc_add(c, &key, lnum, sz, dlen, hash_dn); 1614 if (err) 1615 goto out_ro; 1616 } 1617 1618 ino_key_init(c, &key, inum); 1619 err = ubifs_tnc_add(c, &key, lnum, offs, UBIFS_INO_NODE_SZ, hash_ino); 1620 if (err) 1621 goto out_ro; 1622 1623 err = ubifs_add_dirt(c, lnum, UBIFS_TRUN_NODE_SZ); 1624 if (err) 1625 goto out_ro; 1626 1627 bit = new_size & (UBIFS_BLOCK_SIZE - 1); 1628 blk = (new_size >> UBIFS_BLOCK_SHIFT) + (bit ? 1 : 0); 1629 data_key_init(c, &key, inum, blk); 1630 1631 bit = old_size & (UBIFS_BLOCK_SIZE - 1); 1632 blk = (old_size >> UBIFS_BLOCK_SHIFT) - (bit ? 0 : 1); 1633 data_key_init(c, &to_key, inum, blk); 1634 1635 err = ubifs_tnc_remove_range(c, &key, &to_key); 1636 if (err) 1637 goto out_ro; 1638 1639 finish_reservation(c); 1640 spin_lock(&ui->ui_lock); 1641 ui->synced_i_size = ui->ui_size; 1642 spin_unlock(&ui->ui_lock); 1643 mark_inode_clean(c, ui); 1644 kfree(ino); 1645 return 0; 1646 1647 out_release: 1648 release_head(c, BASEHD); 1649 out_ro: 1650 ubifs_ro_mode(c, err); 1651 finish_reservation(c); 1652 out_free: 1653 kfree(ino); 1654 return err; 1655 } 1656 1657 1658 /** 1659 * ubifs_jnl_delete_xattr - delete an extended attribute. 1660 * @c: UBIFS file-system description object 1661 * @host: host inode 1662 * @inode: extended attribute inode 1663 * @nm: extended attribute entry name 1664 * 1665 * This function delete an extended attribute which is very similar to 1666 * un-linking regular files - it writes a deletion xentry, a deletion inode and 1667 * updates the target inode. Returns zero in case of success and a negative 1668 * error code in case of failure. 1669 */ 1670 int ubifs_jnl_delete_xattr(struct ubifs_info *c, const struct inode *host, 1671 const struct inode *inode, 1672 const struct fscrypt_name *nm) 1673 { 1674 int err, xlen, hlen, len, lnum, xent_offs, aligned_xlen, write_len; 1675 struct ubifs_dent_node *xent; 1676 struct ubifs_ino_node *ino; 1677 union ubifs_key xent_key, key1, key2; 1678 int sync = IS_DIRSYNC(host); 1679 struct ubifs_inode *host_ui = ubifs_inode(host); 1680 u8 hash[UBIFS_HASH_ARR_SZ]; 1681 1682 ubifs_assert(c, inode->i_nlink == 0); 1683 ubifs_assert(c, mutex_is_locked(&host_ui->ui_mutex)); 1684 1685 /* 1686 * Since we are deleting the inode, we do not bother to attach any data 1687 * to it and assume its length is %UBIFS_INO_NODE_SZ. 1688 */ 1689 xlen = UBIFS_DENT_NODE_SZ + fname_len(nm) + 1; 1690 aligned_xlen = ALIGN(xlen, 8); 1691 hlen = host_ui->data_len + UBIFS_INO_NODE_SZ; 1692 len = aligned_xlen + UBIFS_INO_NODE_SZ + ALIGN(hlen, 8); 1693 1694 write_len = len + ubifs_auth_node_sz(c); 1695 1696 xent = kzalloc(write_len, GFP_NOFS); 1697 if (!xent) 1698 return -ENOMEM; 1699 1700 /* Make reservation before allocating sequence numbers */ 1701 err = make_reservation(c, BASEHD, write_len); 1702 if (err) { 1703 kfree(xent); 1704 return err; 1705 } 1706 1707 xent->ch.node_type = UBIFS_XENT_NODE; 1708 xent_key_init(c, &xent_key, host->i_ino, nm); 1709 key_write(c, &xent_key, xent->key); 1710 xent->inum = 0; 1711 xent->type = get_dent_type(inode->i_mode); 1712 xent->nlen = cpu_to_le16(fname_len(nm)); 1713 memcpy(xent->name, fname_name(nm), fname_len(nm)); 1714 xent->name[fname_len(nm)] = '\0'; 1715 zero_dent_node_unused(xent); 1716 ubifs_prep_grp_node(c, xent, xlen, 0); 1717 1718 ino = (void *)xent + aligned_xlen; 1719 pack_inode(c, ino, inode, 0); 1720 ino = (void *)ino + UBIFS_INO_NODE_SZ; 1721 pack_inode(c, ino, host, 1); 1722 err = ubifs_node_calc_hash(c, ino, hash); 1723 if (err) 1724 goto out_release; 1725 1726 err = write_head(c, BASEHD, xent, write_len, &lnum, &xent_offs, sync); 1727 if (!sync && !err) 1728 ubifs_wbuf_add_ino_nolock(&c->jheads[BASEHD].wbuf, host->i_ino); 1729 release_head(c, BASEHD); 1730 1731 ubifs_add_auth_dirt(c, lnum); 1732 kfree(xent); 1733 if (err) 1734 goto out_ro; 1735 1736 /* Remove the extended attribute entry from TNC */ 1737 err = ubifs_tnc_remove_nm(c, &xent_key, nm); 1738 if (err) 1739 goto out_ro; 1740 err = ubifs_add_dirt(c, lnum, xlen); 1741 if (err) 1742 goto out_ro; 1743 1744 /* 1745 * Remove all nodes belonging to the extended attribute inode from TNC. 1746 * Well, there actually must be only one node - the inode itself. 1747 */ 1748 lowest_ino_key(c, &key1, inode->i_ino); 1749 highest_ino_key(c, &key2, inode->i_ino); 1750 err = ubifs_tnc_remove_range(c, &key1, &key2); 1751 if (err) 1752 goto out_ro; 1753 err = ubifs_add_dirt(c, lnum, UBIFS_INO_NODE_SZ); 1754 if (err) 1755 goto out_ro; 1756 1757 /* And update TNC with the new host inode position */ 1758 ino_key_init(c, &key1, host->i_ino); 1759 err = ubifs_tnc_add(c, &key1, lnum, xent_offs + len - hlen, hlen, hash); 1760 if (err) 1761 goto out_ro; 1762 1763 finish_reservation(c); 1764 spin_lock(&host_ui->ui_lock); 1765 host_ui->synced_i_size = host_ui->ui_size; 1766 spin_unlock(&host_ui->ui_lock); 1767 mark_inode_clean(c, host_ui); 1768 return 0; 1769 1770 out_release: 1771 kfree(xent); 1772 release_head(c, BASEHD); 1773 out_ro: 1774 ubifs_ro_mode(c, err); 1775 finish_reservation(c); 1776 return err; 1777 } 1778 1779 /** 1780 * ubifs_jnl_change_xattr - change an extended attribute. 1781 * @c: UBIFS file-system description object 1782 * @inode: extended attribute inode 1783 * @host: host inode 1784 * 1785 * This function writes the updated version of an extended attribute inode and 1786 * the host inode to the journal (to the base head). The host inode is written 1787 * after the extended attribute inode in order to guarantee that the extended 1788 * attribute will be flushed when the inode is synchronized by 'fsync()' and 1789 * consequently, the write-buffer is synchronized. This function returns zero 1790 * in case of success and a negative error code in case of failure. 1791 */ 1792 int ubifs_jnl_change_xattr(struct ubifs_info *c, const struct inode *inode, 1793 const struct inode *host) 1794 { 1795 int err, len1, len2, aligned_len, aligned_len1, lnum, offs; 1796 struct ubifs_inode *host_ui = ubifs_inode(host); 1797 struct ubifs_ino_node *ino; 1798 union ubifs_key key; 1799 int sync = IS_DIRSYNC(host); 1800 u8 hash_host[UBIFS_HASH_ARR_SZ]; 1801 u8 hash[UBIFS_HASH_ARR_SZ]; 1802 1803 dbg_jnl("ino %lu, ino %lu", host->i_ino, inode->i_ino); 1804 ubifs_assert(c, inode->i_nlink > 0); 1805 ubifs_assert(c, mutex_is_locked(&host_ui->ui_mutex)); 1806 1807 len1 = UBIFS_INO_NODE_SZ + host_ui->data_len; 1808 len2 = UBIFS_INO_NODE_SZ + ubifs_inode(inode)->data_len; 1809 aligned_len1 = ALIGN(len1, 8); 1810 aligned_len = aligned_len1 + ALIGN(len2, 8); 1811 1812 aligned_len += ubifs_auth_node_sz(c); 1813 1814 ino = kzalloc(aligned_len, GFP_NOFS); 1815 if (!ino) 1816 return -ENOMEM; 1817 1818 /* Make reservation before allocating sequence numbers */ 1819 err = make_reservation(c, BASEHD, aligned_len); 1820 if (err) 1821 goto out_free; 1822 1823 pack_inode(c, ino, host, 0); 1824 err = ubifs_node_calc_hash(c, ino, hash_host); 1825 if (err) 1826 goto out_release; 1827 pack_inode(c, (void *)ino + aligned_len1, inode, 1); 1828 err = ubifs_node_calc_hash(c, (void *)ino + aligned_len1, hash); 1829 if (err) 1830 goto out_release; 1831 1832 err = write_head(c, BASEHD, ino, aligned_len, &lnum, &offs, 0); 1833 if (!sync && !err) { 1834 struct ubifs_wbuf *wbuf = &c->jheads[BASEHD].wbuf; 1835 1836 ubifs_wbuf_add_ino_nolock(wbuf, host->i_ino); 1837 ubifs_wbuf_add_ino_nolock(wbuf, inode->i_ino); 1838 } 1839 release_head(c, BASEHD); 1840 if (err) 1841 goto out_ro; 1842 1843 ubifs_add_auth_dirt(c, lnum); 1844 1845 ino_key_init(c, &key, host->i_ino); 1846 err = ubifs_tnc_add(c, &key, lnum, offs, len1, hash_host); 1847 if (err) 1848 goto out_ro; 1849 1850 ino_key_init(c, &key, inode->i_ino); 1851 err = ubifs_tnc_add(c, &key, lnum, offs + aligned_len1, len2, hash); 1852 if (err) 1853 goto out_ro; 1854 1855 finish_reservation(c); 1856 spin_lock(&host_ui->ui_lock); 1857 host_ui->synced_i_size = host_ui->ui_size; 1858 spin_unlock(&host_ui->ui_lock); 1859 mark_inode_clean(c, host_ui); 1860 kfree(ino); 1861 return 0; 1862 1863 out_release: 1864 release_head(c, BASEHD); 1865 out_ro: 1866 ubifs_ro_mode(c, err); 1867 finish_reservation(c); 1868 out_free: 1869 kfree(ino); 1870 return err; 1871 } 1872 1873