linux/fs/logfs/dir.c
<<
>>
Prefs
   1/*
   2 * fs/logfs/dir.c       - directory-related code
   3 *
   4 * As should be obvious for Linux kernel code, license is GPLv2
   5 *
   6 * Copyright (c) 2005-2008 Joern Engel <joern@logfs.org>
   7 */
   8#include "logfs.h"
   9#include <linux/slab.h>
  10
  11/*
  12 * Atomic dir operations
  13 *
  14 * Directory operations are by default not atomic.  Dentries and Inodes are
  15 * created/removed/altered in separate operations.  Therefore we need to do
  16 * a small amount of journaling.
  17 *
  18 * Create, link, mkdir, mknod and symlink all share the same function to do
  19 * the work: __logfs_create.  This function works in two atomic steps:
  20 * 1. allocate inode (remember in journal)
  21 * 2. allocate dentry (clear journal)
  22 *
  23 * As we can only get interrupted between the two, when the inode we just
  24 * created is simply stored in the anchor.  On next mount, if we were
  25 * interrupted, we delete the inode.  From a users point of view the
  26 * operation never happened.
  27 *
  28 * Unlink and rmdir also share the same function: unlink.  Again, this
  29 * function works in two atomic steps
  30 * 1. remove dentry (remember inode in journal)
  31 * 2. unlink inode (clear journal)
  32 *
  33 * And again, on the next mount, if we were interrupted, we delete the inode.
  34 * From a users point of view the operation succeeded.
  35 *
  36 * Rename is the real pain to deal with, harder than all the other methods
  37 * combined.  Depending on the circumstances we can run into three cases.
  38 * A "target rename" where the target dentry already existed, a "local
  39 * rename" where both parent directories are identical or a "cross-directory
  40 * rename" in the remaining case.
  41 *
  42 * Local rename is atomic, as the old dentry is simply rewritten with a new
  43 * name.
  44 *
  45 * Cross-directory rename works in two steps, similar to __logfs_create and
  46 * logfs_unlink:
  47 * 1. Write new dentry (remember old dentry in journal)
  48 * 2. Remove old dentry (clear journal)
  49 *
  50 * Here we remember a dentry instead of an inode.  On next mount, if we were
  51 * interrupted, we delete the dentry.  From a users point of view, the
  52 * operation succeeded.
  53 *
  54 * Target rename works in three atomic steps:
  55 * 1. Attach old inode to new dentry (remember old dentry and new inode)
  56 * 2. Remove old dentry (still remember the new inode)
  57 * 3. Remove victim inode
  58 *
  59 * Here we remember both an inode an a dentry.  If we get interrupted
  60 * between steps 1 and 2, we delete both the dentry and the inode.  If
  61 * we get interrupted between steps 2 and 3, we delete just the inode.
  62 * In either case, the remaining objects are deleted on next mount.  From
  63 * a users point of view, the operation succeeded.
  64 */
  65
  66static int write_dir(struct inode *dir, struct logfs_disk_dentry *dd,
  67                loff_t pos)
  68{
  69        return logfs_inode_write(dir, dd, sizeof(*dd), pos, WF_LOCK, NULL);
  70}
  71
  72static int write_inode(struct inode *inode)
  73{
  74        return __logfs_write_inode(inode, WF_LOCK);
  75}
  76
  77static s64 dir_seek_data(struct inode *inode, s64 pos)
  78{
  79        s64 new_pos = logfs_seek_data(inode, pos);
  80
  81        return max(pos, new_pos - 1);
  82}
  83
  84static int beyond_eof(struct inode *inode, loff_t bix)
  85{
  86        loff_t pos = bix << inode->i_sb->s_blocksize_bits;
  87        return pos >= i_size_read(inode);
  88}
  89
  90/*
  91 * Prime value was chosen to be roughly 256 + 26.  r5 hash uses 11,
  92 * so short names (len <= 9) don't even occupy the complete 32bit name
  93 * space.  A prime >256 ensures short names quickly spread the 32bit
  94 * name space.  Add about 26 for the estimated amount of information
  95 * of each character and pick a prime nearby, preferrably a bit-sparse
  96 * one.
  97 */
  98static u32 hash_32(const char *s, int len, u32 seed)
  99{
 100        u32 hash = seed;
 101        int i;
 102
 103        for (i = 0; i < len; i++)
 104                hash = hash * 293 + s[i];
 105        return hash;
 106}
 107
 108/*
 109 * We have to satisfy several conflicting requirements here.  Small
 110 * directories should stay fairly compact and not require too many
 111 * indirect blocks.  The number of possible locations for a given hash
 112 * should be small to make lookup() fast.  And we should try hard not
 113 * to overflow the 32bit name space or nfs and 32bit host systems will
 114 * be unhappy.
 115 *
 116 * So we use the following scheme.  First we reduce the hash to 0..15
 117 * and try a direct block.  If that is occupied we reduce the hash to
 118 * 16..255 and try an indirect block.  Same for 2x and 3x indirect
 119 * blocks.  Lastly we reduce the hash to 0x800_0000 .. 0xffff_ffff,
 120 * but use buckets containing eight entries instead of a single one.
 121 *
 122 * Using 16 entries should allow for a reasonable amount of hash
 123 * collisions, so the 32bit name space can be packed fairly tight
 124 * before overflowing.  Oh and currently we don't overflow but return
 125 * and error.
 126 *
 127 * How likely are collisions?  Doing the appropriate math is beyond me
 128 * and the Bronstein textbook.  But running a test program to brute
 129 * force collisions for a couple of days showed that on average the
 130 * first collision occurs after 598M entries, with 290M being the
 131 * smallest result.  Obviously 21 entries could already cause a
 132 * collision if all entries are carefully chosen.
 133 */
 134static pgoff_t hash_index(u32 hash, int round)
 135{
 136        u32 i0_blocks = I0_BLOCKS;
 137        u32 i1_blocks = I1_BLOCKS;
 138        u32 i2_blocks = I2_BLOCKS;
 139        u32 i3_blocks = I3_BLOCKS;
 140
 141        switch (round) {
 142        case 0:
 143                return hash % i0_blocks;
 144        case 1:
 145                return i0_blocks + hash % (i1_blocks - i0_blocks);
 146        case 2:
 147                return i1_blocks + hash % (i2_blocks - i1_blocks);
 148        case 3:
 149                return i2_blocks + hash % (i3_blocks - i2_blocks);
 150        case 4 ... 19:
 151                return i3_blocks + 16 * (hash % (((1<<31) - i3_blocks) / 16))
 152                        + round - 4;
 153        }
 154        BUG();
 155}
 156
 157static struct page *logfs_get_dd_page(struct inode *dir, struct dentry *dentry)
 158{
 159        struct qstr *name = &dentry->d_name;
 160        struct page *page;
 161        struct logfs_disk_dentry *dd;
 162        u32 hash = hash_32(name->name, name->len, 0);
 163        pgoff_t index;
 164        int round;
 165
 166        if (name->len > LOGFS_MAX_NAMELEN)
 167                return ERR_PTR(-ENAMETOOLONG);
 168
 169        for (round = 0; round < 20; round++) {
 170                index = hash_index(hash, round);
 171
 172                if (beyond_eof(dir, index))
 173                        return NULL;
 174                if (!logfs_exist_block(dir, index))
 175                        continue;
 176                page = read_cache_page(dir->i_mapping, index,
 177                                (filler_t *)logfs_readpage, NULL);
 178                if (IS_ERR(page))
 179                        return page;
 180                dd = kmap_atomic(page, KM_USER0);
 181                BUG_ON(dd->namelen == 0);
 182
 183                if (name->len != be16_to_cpu(dd->namelen) ||
 184                                memcmp(name->name, dd->name, name->len)) {
 185                        kunmap_atomic(dd, KM_USER0);
 186                        page_cache_release(page);
 187                        continue;
 188                }
 189
 190                kunmap_atomic(dd, KM_USER0);
 191                return page;
 192        }
 193        return NULL;
 194}
 195
 196static int logfs_remove_inode(struct inode *inode)
 197{
 198        int ret;
 199
 200        inode->i_nlink--;
 201        ret = write_inode(inode);
 202        LOGFS_BUG_ON(ret, inode->i_sb);
 203        return ret;
 204}
 205
 206static void abort_transaction(struct inode *inode, struct logfs_transaction *ta)
 207{
 208        if (logfs_inode(inode)->li_block)
 209                logfs_inode(inode)->li_block->ta = NULL;
 210        kfree(ta);
 211}
 212
 213static int logfs_unlink(struct inode *dir, struct dentry *dentry)
 214{
 215        struct logfs_super *super = logfs_super(dir->i_sb);
 216        struct inode *inode = dentry->d_inode;
 217        struct logfs_transaction *ta;
 218        struct page *page;
 219        pgoff_t index;
 220        int ret;
 221
 222        ta = kzalloc(sizeof(*ta), GFP_KERNEL);
 223        if (!ta)
 224                return -ENOMEM;
 225
 226        ta->state = UNLINK_1;
 227        ta->ino = inode->i_ino;
 228
 229        inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME;
 230
 231        page = logfs_get_dd_page(dir, dentry);
 232        if (!page) {
 233                kfree(ta);
 234                return -ENOENT;
 235        }
 236        if (IS_ERR(page)) {
 237                kfree(ta);
 238                return PTR_ERR(page);
 239        }
 240        index = page->index;
 241        page_cache_release(page);
 242
 243        mutex_lock(&super->s_dirop_mutex);
 244        logfs_add_transaction(dir, ta);
 245
 246        ret = logfs_delete(dir, index, NULL);
 247        if (!ret)
 248                ret = write_inode(dir);
 249
 250        if (ret) {
 251                abort_transaction(dir, ta);
 252                printk(KERN_ERR"LOGFS: unable to delete inode\n");
 253                goto out;
 254        }
 255
 256        ta->state = UNLINK_2;
 257        logfs_add_transaction(inode, ta);
 258        ret = logfs_remove_inode(inode);
 259out:
 260        mutex_unlock(&super->s_dirop_mutex);
 261        return ret;
 262}
 263
 264static inline int logfs_empty_dir(struct inode *dir)
 265{
 266        u64 data;
 267
 268        data = logfs_seek_data(dir, 0) << dir->i_sb->s_blocksize_bits;
 269        return data >= i_size_read(dir);
 270}
 271
 272static int logfs_rmdir(struct inode *dir, struct dentry *dentry)
 273{
 274        struct inode *inode = dentry->d_inode;
 275
 276        if (!logfs_empty_dir(inode))
 277                return -ENOTEMPTY;
 278
 279        return logfs_unlink(dir, dentry);
 280}
 281
 282/* FIXME: readdir currently has it's own dir_walk code.  I don't see a good
 283 * way to combine the two copies */
 284#define IMPLICIT_NODES 2
 285static int __logfs_readdir(struct file *file, void *buf, filldir_t filldir)
 286{
 287        struct inode *dir = file->f_dentry->d_inode;
 288        loff_t pos = file->f_pos - IMPLICIT_NODES;
 289        struct page *page;
 290        struct logfs_disk_dentry *dd;
 291        int full;
 292
 293        BUG_ON(pos < 0);
 294        for (;; pos++) {
 295                if (beyond_eof(dir, pos))
 296                        break;
 297                if (!logfs_exist_block(dir, pos)) {
 298                        /* deleted dentry */
 299                        pos = dir_seek_data(dir, pos);
 300                        continue;
 301                }
 302                page = read_cache_page(dir->i_mapping, pos,
 303                                (filler_t *)logfs_readpage, NULL);
 304                if (IS_ERR(page))
 305                        return PTR_ERR(page);
 306                dd = kmap(page);
 307                BUG_ON(dd->namelen == 0);
 308
 309                full = filldir(buf, (char *)dd->name, be16_to_cpu(dd->namelen),
 310                                pos, be64_to_cpu(dd->ino), dd->type);
 311                kunmap(page);
 312                page_cache_release(page);
 313                if (full)
 314                        break;
 315        }
 316
 317        file->f_pos = pos + IMPLICIT_NODES;
 318        return 0;
 319}
 320
 321static int logfs_readdir(struct file *file, void *buf, filldir_t filldir)
 322{
 323        struct inode *inode = file->f_dentry->d_inode;
 324        ino_t pino = parent_ino(file->f_dentry);
 325        int err;
 326
 327        if (file->f_pos < 0)
 328                return -EINVAL;
 329
 330        if (file->f_pos == 0) {
 331                if (filldir(buf, ".", 1, 1, inode->i_ino, DT_DIR) < 0)
 332                        return 0;
 333                file->f_pos++;
 334        }
 335        if (file->f_pos == 1) {
 336                if (filldir(buf, "..", 2, 2, pino, DT_DIR) < 0)
 337                        return 0;
 338                file->f_pos++;
 339        }
 340
 341        err = __logfs_readdir(file, buf, filldir);
 342        return err;
 343}
 344
 345static void logfs_set_name(struct logfs_disk_dentry *dd, struct qstr *name)
 346{
 347        dd->namelen = cpu_to_be16(name->len);
 348        memcpy(dd->name, name->name, name->len);
 349}
 350
 351static struct dentry *logfs_lookup(struct inode *dir, struct dentry *dentry,
 352                struct nameidata *nd)
 353{
 354        struct page *page;
 355        struct logfs_disk_dentry *dd;
 356        pgoff_t index;
 357        u64 ino = 0;
 358        struct inode *inode;
 359
 360        page = logfs_get_dd_page(dir, dentry);
 361        if (IS_ERR(page))
 362                return ERR_CAST(page);
 363        if (!page) {
 364                d_add(dentry, NULL);
 365                return NULL;
 366        }
 367        index = page->index;
 368        dd = kmap_atomic(page, KM_USER0);
 369        ino = be64_to_cpu(dd->ino);
 370        kunmap_atomic(dd, KM_USER0);
 371        page_cache_release(page);
 372
 373        inode = logfs_iget(dir->i_sb, ino);
 374        if (IS_ERR(inode)) {
 375                printk(KERN_ERR"LogFS: Cannot read inode #%llx for dentry (%lx, %lx)n",
 376                                ino, dir->i_ino, index);
 377                return ERR_CAST(inode);
 378        }
 379        return d_splice_alias(inode, dentry);
 380}
 381
 382static void grow_dir(struct inode *dir, loff_t index)
 383{
 384        index = (index + 1) << dir->i_sb->s_blocksize_bits;
 385        if (i_size_read(dir) < index)
 386                i_size_write(dir, index);
 387}
 388
 389static int logfs_write_dir(struct inode *dir, struct dentry *dentry,
 390                struct inode *inode)
 391{
 392        struct page *page;
 393        struct logfs_disk_dentry *dd;
 394        u32 hash = hash_32(dentry->d_name.name, dentry->d_name.len, 0);
 395        pgoff_t index;
 396        int round, err;
 397
 398        for (round = 0; round < 20; round++) {
 399                index = hash_index(hash, round);
 400
 401                if (logfs_exist_block(dir, index))
 402                        continue;
 403                page = find_or_create_page(dir->i_mapping, index, GFP_KERNEL);
 404                if (!page)
 405                        return -ENOMEM;
 406
 407                dd = kmap_atomic(page, KM_USER0);
 408                memset(dd, 0, sizeof(*dd));
 409                dd->ino = cpu_to_be64(inode->i_ino);
 410                dd->type = logfs_type(inode);
 411                logfs_set_name(dd, &dentry->d_name);
 412                kunmap_atomic(dd, KM_USER0);
 413
 414                err = logfs_write_buf(dir, page, WF_LOCK);
 415                unlock_page(page);
 416                page_cache_release(page);
 417                if (!err)
 418                        grow_dir(dir, index);
 419                return err;
 420        }
 421        /* FIXME: Is there a better return value?  In most cases neither
 422         * the filesystem nor the directory are full.  But we have had
 423         * too many collisions for this particular hash and no fallback.
 424         */
 425        return -ENOSPC;
 426}
 427
 428static int __logfs_create(struct inode *dir, struct dentry *dentry,
 429                struct inode *inode, const char *dest, long destlen)
 430{
 431        struct logfs_super *super = logfs_super(dir->i_sb);
 432        struct logfs_inode *li = logfs_inode(inode);
 433        struct logfs_transaction *ta;
 434        int ret;
 435
 436        ta = kzalloc(sizeof(*ta), GFP_KERNEL);
 437        if (!ta)
 438                return -ENOMEM;
 439
 440        ta->state = CREATE_1;
 441        ta->ino = inode->i_ino;
 442        mutex_lock(&super->s_dirop_mutex);
 443        logfs_add_transaction(inode, ta);
 444
 445        if (dest) {
 446                /* symlink */
 447                ret = logfs_inode_write(inode, dest, destlen, 0, WF_LOCK, NULL);
 448                if (!ret)
 449                        ret = write_inode(inode);
 450        } else {
 451                /* creat/mkdir/mknod */
 452                ret = write_inode(inode);
 453        }
 454        if (ret) {
 455                abort_transaction(inode, ta);
 456                li->li_flags |= LOGFS_IF_STILLBORN;
 457                /* FIXME: truncate symlink */
 458                inode->i_nlink--;
 459                iput(inode);
 460                goto out;
 461        }
 462
 463        ta->state = CREATE_2;
 464        logfs_add_transaction(dir, ta);
 465        ret = logfs_write_dir(dir, dentry, inode);
 466        /* sync directory */
 467        if (!ret)
 468                ret = write_inode(dir);
 469
 470        if (ret) {
 471                logfs_del_transaction(dir, ta);
 472                ta->state = CREATE_2;
 473                logfs_add_transaction(inode, ta);
 474                logfs_remove_inode(inode);
 475                iput(inode);
 476                goto out;
 477        }
 478        d_instantiate(dentry, inode);
 479out:
 480        mutex_unlock(&super->s_dirop_mutex);
 481        return ret;
 482}
 483
 484static int logfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
 485{
 486        struct inode *inode;
 487
 488        /*
 489         * FIXME: why do we have to fill in S_IFDIR, while the mode is
 490         * correct for mknod, creat, etc.?  Smells like the vfs *should*
 491         * do it for us but for some reason fails to do so.
 492         */
 493        inode = logfs_new_inode(dir, S_IFDIR | mode);
 494        if (IS_ERR(inode))
 495                return PTR_ERR(inode);
 496
 497        inode->i_op = &logfs_dir_iops;
 498        inode->i_fop = &logfs_dir_fops;
 499
 500        return __logfs_create(dir, dentry, inode, NULL, 0);
 501}
 502
 503static int logfs_create(struct inode *dir, struct dentry *dentry, int mode,
 504                struct nameidata *nd)
 505{
 506        struct inode *inode;
 507
 508        inode = logfs_new_inode(dir, mode);
 509        if (IS_ERR(inode))
 510                return PTR_ERR(inode);
 511
 512        inode->i_op = &logfs_reg_iops;
 513        inode->i_fop = &logfs_reg_fops;
 514        inode->i_mapping->a_ops = &logfs_reg_aops;
 515
 516        return __logfs_create(dir, dentry, inode, NULL, 0);
 517}
 518
 519static int logfs_mknod(struct inode *dir, struct dentry *dentry, int mode,
 520                dev_t rdev)
 521{
 522        struct inode *inode;
 523
 524        if (dentry->d_name.len > LOGFS_MAX_NAMELEN)
 525                return -ENAMETOOLONG;
 526
 527        inode = logfs_new_inode(dir, mode);
 528        if (IS_ERR(inode))
 529                return PTR_ERR(inode);
 530
 531        init_special_inode(inode, mode, rdev);
 532
 533        return __logfs_create(dir, dentry, inode, NULL, 0);
 534}
 535
 536static int logfs_symlink(struct inode *dir, struct dentry *dentry,
 537                const char *target)
 538{
 539        struct inode *inode;
 540        size_t destlen = strlen(target) + 1;
 541
 542        if (destlen > dir->i_sb->s_blocksize)
 543                return -ENAMETOOLONG;
 544
 545        inode = logfs_new_inode(dir, S_IFLNK | 0777);
 546        if (IS_ERR(inode))
 547                return PTR_ERR(inode);
 548
 549        inode->i_op = &logfs_symlink_iops;
 550        inode->i_mapping->a_ops = &logfs_reg_aops;
 551
 552        return __logfs_create(dir, dentry, inode, target, destlen);
 553}
 554
 555static int logfs_permission(struct inode *inode, int mask)
 556{
 557        return generic_permission(inode, mask, NULL);
 558}
 559
 560static int logfs_link(struct dentry *old_dentry, struct inode *dir,
 561                struct dentry *dentry)
 562{
 563        struct inode *inode = old_dentry->d_inode;
 564
 565        if (inode->i_nlink >= LOGFS_LINK_MAX)
 566                return -EMLINK;
 567
 568        inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME;
 569        atomic_inc(&inode->i_count);
 570        inode->i_nlink++;
 571        mark_inode_dirty_sync(inode);
 572
 573        return __logfs_create(dir, dentry, inode, NULL, 0);
 574}
 575
 576static int logfs_get_dd(struct inode *dir, struct dentry *dentry,
 577                struct logfs_disk_dentry *dd, loff_t *pos)
 578{
 579        struct page *page;
 580        void *map;
 581
 582        page = logfs_get_dd_page(dir, dentry);
 583        if (IS_ERR(page))
 584                return PTR_ERR(page);
 585        *pos = page->index;
 586        map = kmap_atomic(page, KM_USER0);
 587        memcpy(dd, map, sizeof(*dd));
 588        kunmap_atomic(map, KM_USER0);
 589        page_cache_release(page);
 590        return 0;
 591}
 592
 593static int logfs_delete_dd(struct inode *dir, loff_t pos)
 594{
 595        /*
 596         * Getting called with pos somewhere beyond eof is either a goofup
 597         * within this file or means someone maliciously edited the
 598         * (crc-protected) journal.
 599         */
 600        BUG_ON(beyond_eof(dir, pos));
 601        dir->i_ctime = dir->i_mtime = CURRENT_TIME;
 602        log_dir(" Delete dentry (%lx, %llx)\n", dir->i_ino, pos);
 603        return logfs_delete(dir, pos, NULL);
 604}
 605
 606/*
 607 * Cross-directory rename, target does not exist.  Just a little nasty.
 608 * Create a new dentry in the target dir, then remove the old dentry,
 609 * all the while taking care to remember our operation in the journal.
 610 */
 611static int logfs_rename_cross(struct inode *old_dir, struct dentry *old_dentry,
 612                              struct inode *new_dir, struct dentry *new_dentry)
 613{
 614        struct logfs_super *super = logfs_super(old_dir->i_sb);
 615        struct logfs_disk_dentry dd;
 616        struct logfs_transaction *ta;
 617        loff_t pos;
 618        int err;
 619
 620        /* 1. locate source dd */
 621        err = logfs_get_dd(old_dir, old_dentry, &dd, &pos);
 622        if (err)
 623                return err;
 624
 625        ta = kzalloc(sizeof(*ta), GFP_KERNEL);
 626        if (!ta)
 627                return -ENOMEM;
 628
 629        ta->state = CROSS_RENAME_1;
 630        ta->dir = old_dir->i_ino;
 631        ta->pos = pos;
 632
 633        /* 2. write target dd */
 634        mutex_lock(&super->s_dirop_mutex);
 635        logfs_add_transaction(new_dir, ta);
 636        err = logfs_write_dir(new_dir, new_dentry, old_dentry->d_inode);
 637        if (!err)
 638                err = write_inode(new_dir);
 639
 640        if (err) {
 641                super->s_rename_dir = 0;
 642                super->s_rename_pos = 0;
 643                abort_transaction(new_dir, ta);
 644                goto out;
 645        }
 646
 647        /* 3. remove source dd */
 648        ta->state = CROSS_RENAME_2;
 649        logfs_add_transaction(old_dir, ta);
 650        err = logfs_delete_dd(old_dir, pos);
 651        if (!err)
 652                err = write_inode(old_dir);
 653        LOGFS_BUG_ON(err, old_dir->i_sb);
 654out:
 655        mutex_unlock(&super->s_dirop_mutex);
 656        return err;
 657}
 658
 659static int logfs_replace_inode(struct inode *dir, struct dentry *dentry,
 660                struct logfs_disk_dentry *dd, struct inode *inode)
 661{
 662        loff_t pos;
 663        int err;
 664
 665        err = logfs_get_dd(dir, dentry, dd, &pos);
 666        if (err)
 667                return err;
 668        dd->ino = cpu_to_be64(inode->i_ino);
 669        dd->type = logfs_type(inode);
 670
 671        err = write_dir(dir, dd, pos);
 672        if (err)
 673                return err;
 674        log_dir("Replace dentry (%lx, %llx) %s -> %llx\n", dir->i_ino, pos,
 675                        dd->name, be64_to_cpu(dd->ino));
 676        return write_inode(dir);
 677}
 678
 679/* Target dentry exists - the worst case.  We need to attach the source
 680 * inode to the target dentry, then remove the orphaned target inode and
 681 * source dentry.
 682 */
 683static int logfs_rename_target(struct inode *old_dir, struct dentry *old_dentry,
 684                               struct inode *new_dir, struct dentry *new_dentry)
 685{
 686        struct logfs_super *super = logfs_super(old_dir->i_sb);
 687        struct inode *old_inode = old_dentry->d_inode;
 688        struct inode *new_inode = new_dentry->d_inode;
 689        int isdir = S_ISDIR(old_inode->i_mode);
 690        struct logfs_disk_dentry dd;
 691        struct logfs_transaction *ta;
 692        loff_t pos;
 693        int err;
 694
 695        BUG_ON(isdir != S_ISDIR(new_inode->i_mode));
 696        if (isdir) {
 697                if (!logfs_empty_dir(new_inode))
 698                        return -ENOTEMPTY;
 699        }
 700
 701        /* 1. locate source dd */
 702        err = logfs_get_dd(old_dir, old_dentry, &dd, &pos);
 703        if (err)
 704                return err;
 705
 706        ta = kzalloc(sizeof(*ta), GFP_KERNEL);
 707        if (!ta)
 708                return -ENOMEM;
 709
 710        ta->state = TARGET_RENAME_1;
 711        ta->dir = old_dir->i_ino;
 712        ta->pos = pos;
 713        ta->ino = new_inode->i_ino;
 714
 715        /* 2. attach source inode to target dd */
 716        mutex_lock(&super->s_dirop_mutex);
 717        logfs_add_transaction(new_dir, ta);
 718        err = logfs_replace_inode(new_dir, new_dentry, &dd, old_inode);
 719        if (err) {
 720                super->s_rename_dir = 0;
 721                super->s_rename_pos = 0;
 722                super->s_victim_ino = 0;
 723                abort_transaction(new_dir, ta);
 724                goto out;
 725        }
 726
 727        /* 3. remove source dd */
 728        ta->state = TARGET_RENAME_2;
 729        logfs_add_transaction(old_dir, ta);
 730        err = logfs_delete_dd(old_dir, pos);
 731        if (!err)
 732                err = write_inode(old_dir);
 733        LOGFS_BUG_ON(err, old_dir->i_sb);
 734
 735        /* 4. remove target inode */
 736        ta->state = TARGET_RENAME_3;
 737        logfs_add_transaction(new_inode, ta);
 738        err = logfs_remove_inode(new_inode);
 739
 740out:
 741        mutex_unlock(&super->s_dirop_mutex);
 742        return err;
 743}
 744
 745static int logfs_rename(struct inode *old_dir, struct dentry *old_dentry,
 746                        struct inode *new_dir, struct dentry *new_dentry)
 747{
 748        if (new_dentry->d_inode)
 749                return logfs_rename_target(old_dir, old_dentry,
 750                                           new_dir, new_dentry);
 751        return logfs_rename_cross(old_dir, old_dentry, new_dir, new_dentry);
 752}
 753
 754/* No locking done here, as this is called before .get_sb() returns. */
 755int logfs_replay_journal(struct super_block *sb)
 756{
 757        struct logfs_super *super = logfs_super(sb);
 758        struct inode *inode;
 759        u64 ino, pos;
 760        int err;
 761
 762        if (super->s_victim_ino) {
 763                /* delete victim inode */
 764                ino = super->s_victim_ino;
 765                printk(KERN_INFO"LogFS: delete unmapped inode #%llx\n", ino);
 766                inode = logfs_iget(sb, ino);
 767                if (IS_ERR(inode))
 768                        goto fail;
 769
 770                LOGFS_BUG_ON(i_size_read(inode) > 0, sb);
 771                super->s_victim_ino = 0;
 772                err = logfs_remove_inode(inode);
 773                iput(inode);
 774                if (err) {
 775                        super->s_victim_ino = ino;
 776                        goto fail;
 777                }
 778        }
 779        if (super->s_rename_dir) {
 780                /* delete old dd from rename */
 781                ino = super->s_rename_dir;
 782                pos = super->s_rename_pos;
 783                printk(KERN_INFO"LogFS: delete unbacked dentry (%llx, %llx)\n",
 784                                ino, pos);
 785                inode = logfs_iget(sb, ino);
 786                if (IS_ERR(inode))
 787                        goto fail;
 788
 789                super->s_rename_dir = 0;
 790                super->s_rename_pos = 0;
 791                err = logfs_delete_dd(inode, pos);
 792                iput(inode);
 793                if (err) {
 794                        super->s_rename_dir = ino;
 795                        super->s_rename_pos = pos;
 796                        goto fail;
 797                }
 798        }
 799        return 0;
 800fail:
 801        LOGFS_BUG(sb);
 802        return -EIO;
 803}
 804
 805const struct inode_operations logfs_symlink_iops = {
 806        .readlink       = generic_readlink,
 807        .follow_link    = page_follow_link_light,
 808};
 809
 810const struct inode_operations logfs_dir_iops = {
 811        .create         = logfs_create,
 812        .link           = logfs_link,
 813        .lookup         = logfs_lookup,
 814        .mkdir          = logfs_mkdir,
 815        .mknod          = logfs_mknod,
 816        .rename         = logfs_rename,
 817        .rmdir          = logfs_rmdir,
 818        .permission     = logfs_permission,
 819        .symlink        = logfs_symlink,
 820        .unlink         = logfs_unlink,
 821};
 822const struct file_operations logfs_dir_fops = {
 823        .fsync          = logfs_fsync,
 824        .ioctl          = logfs_ioctl,
 825        .readdir        = logfs_readdir,
 826        .read           = generic_read_dir,
 827};
 828
lxr.linux.no kindly hosted by Redpill Linpro AS, provider of Linux consulting and operations services since 1995.