1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857
|
/*
* Copyright (c) 2003-2006 Erez Zadok
* Copyright (c) 2003-2006 Charles P. Wright
* Copyright (c) 2005-2006 Josef 'Jeff' Sipek
* Copyright (c) 2005-2006 Junjiro Okajima
* Copyright (c) 2005 Arun M. Krishnakumar
* Copyright (c) 2005-2006 David P. Quigley
* Copyright (c) 2003-2004 Mohammad Nayyer Zubair
* Copyright (c) 2003 Puja Gupta
* Copyright (c) 2003 Harikesavan Krishnan
* Copyright (c) 2003-2006 Stony Brook University
* Copyright (c) 2003-2006 The Research Foundation of State University of New York
*
* For specific licensing information, see the COPYING file distributed with
* this package.
*
* This Copyright notice must be kept intact and distributed with all sources.
*/
/*
* $Id: main.c,v 1.176 2006/10/10 07:28:13 jsipek Exp $
*/
#include "unionfs.h"
#include <linux/module.h>
#include <linux/moduleparam.h>
/* declarations added for "sparse" */
extern void unionfs_kill_block_super(struct super_block *sb);
/* declarations added for malloc_debugging */
#ifdef FIST_MALLOC_DEBUG
extern atomic_t unionfs_malloc_counter;
extern atomic_t unionfs_mallocs_outstanding;
#endif
/* sb we pass is unionfs's super_block */
int unionfs_interpose(struct dentry *dentry, struct super_block *sb, int flag)
{
struct inode *hidden_inode;
struct dentry *hidden_dentry;
int err = 0;
struct inode *inode;
int is_negative_dentry = 1;
int bindex, bstart, bend;
print_entry("flag = %d", flag);
verify_locked(dentry);
print_dentry("In unionfs_interpose", dentry);
bstart = dbstart(dentry);
bend = dbend(dentry);
/* Make sure that we didn't get a negative dentry. */
for (bindex = bstart; bindex <= bend; bindex++) {
if (dtohd_index(dentry, bindex) &&
dtohd_index(dentry, bindex)->d_inode) {
is_negative_dentry = 0;
break;
}
}
BUG_ON(is_negative_dentry);
/* We allocate our new inode below, by calling iget.
* iget will call our read_inode which will initialize some
* of the new inode's fields
*/
/* On revalidate we've already got our own inode and just need
* to fix it up. */
if (flag == INTERPOSE_REVAL) {
inode = dentry->d_inode;
itopd(inode)->b_start = -1;
itopd(inode)->b_end = -1;
atomic_set(&itopd(inode)->uii_generation,
atomic_read(&stopd(sb)->usi_generation));
itohi_ptr(inode) =
KZALLOC(sbmax(sb) * sizeof(struct inode *), GFP_KERNEL);
if (!itohi_ptr(inode)) {
err = -ENOMEM;
goto out;
}
mutex_lock(&inode->i_mutex);
} else {
ino_t ino;
/* get unique inode number for unionfs */
#ifdef UNIONFS_IMAP
if (stopd(sb)->usi_persistent) {
err = read_uin(sb, bindex,
dtohd_index(dentry,
bindex)->d_inode->i_ino,
O_CREAT, &ino);
if (err)
goto out;
} else
#endif
ino = iunique(sb, UNIONFS_ROOT_INO);
inode = IGET(sb, ino);
if (!inode) {
err = -EACCES; /* should be impossible??? */
goto out;
}
mutex_lock(&inode->i_mutex);
if (atomic_read(&inode->i_count) > 1)
goto skip;
}
for (bindex = bstart; bindex <= bend; bindex++) {
hidden_dentry = dtohd_index(dentry, bindex);
if (!hidden_dentry) {
set_itohi_index(inode, bindex, NULL);
continue;
}
/* Initialize the hidden inode to the new hidden inode. */
if (!hidden_dentry->d_inode)
continue;
set_itohi_index(inode, bindex, IGRAB(hidden_dentry->d_inode));
}
ibstart(inode) = dbstart(dentry);
ibend(inode) = dbend(dentry);
/* Use attributes from the first branch. */
hidden_inode = itohi(inode);
/* Use different set of inode ops for symlinks & directories */
if (S_ISLNK(hidden_inode->i_mode))
inode->i_op = &unionfs_symlink_iops;
else if (S_ISDIR(hidden_inode->i_mode))
inode->i_op = &unionfs_dir_iops;
/* Use different set of file ops for directories */
if (S_ISDIR(hidden_inode->i_mode))
inode->i_fop = &unionfs_dir_fops;
/* properly initialize special inodes */
if (S_ISBLK(hidden_inode->i_mode) || S_ISCHR(hidden_inode->i_mode) ||
S_ISFIFO(hidden_inode->i_mode) || S_ISSOCK(hidden_inode->i_mode))
init_special_inode(inode, hidden_inode->i_mode,
hidden_inode->i_rdev);
#ifndef UNIONFS_MMAP
/* Fix our inode's address operations to that of the lower inode (Unionfs is FiST-Lite) */
if (inode->i_mapping->a_ops != hidden_inode->i_mapping->a_ops) {
dprint(PRINT_DEBUG, "fixing inode 0x%p a_ops (0x%p -> 0x%p)\n",
inode, inode->i_mapping->a_ops,
hidden_inode->i_mapping->a_ops);
inode->i_mapping->a_ops = hidden_inode->i_mapping->a_ops;
}
#endif
/* all well, copy inode attributes */
fist_copy_attr_all(inode, hidden_inode);
skip:
/* only (our) lookup wants to do a d_add */
switch (flag) {
case INTERPOSE_DEFAULT:
case INTERPOSE_REVAL_NEG:
d_instantiate(dentry, inode);
break;
case INTERPOSE_LOOKUP:
err = PTR_ERR(d_splice_alias(inode, dentry));
break;
case INTERPOSE_REVAL:
/* Do nothing. */
break;
default:
printk(KERN_ERR "Invalid interpose flag passed!");
BUG();
}
print_dentry("Leaving unionfs_interpose", dentry);
print_inode("Leaving unionfs_interpose", inode);
mutex_unlock(&inode->i_mutex);
out:
print_exit_status(err);
return err;
}
void unionfs_reinterpose(struct dentry *dentry)
{
struct dentry *hidden_dentry;
struct inode *inode;
int bindex, bstart, bend;
print_entry_location();
verify_locked(dentry);
print_dentry("IN: unionfs_reinterpose: ", dentry);
/* This is pre-allocated inode */
inode = dentry->d_inode;
bstart = dbstart(dentry);
bend = dbend(dentry);
for (bindex = bstart; bindex <= bend; bindex++) {
hidden_dentry = dtohd_index(dentry, bindex);
if (!hidden_dentry)
continue;
if (!hidden_dentry->d_inode)
continue;
if (itohi_index(inode, bindex))
continue;
set_itohi_index(inode, bindex, IGRAB(hidden_dentry->d_inode));
}
ibstart(inode) = dbstart(dentry);
ibend(inode) = dbend(dentry);
print_dentry("OUT: unionfs_reinterpose: ", dentry);
print_inode("OUT: unionfs_reinterpose: ", inode);
print_exit_location();
}
int check_branch(struct nameidata *nd)
{
if (!strcmp(nd->dentry->d_sb->s_type->name, "unionfs"))
return -EINVAL;
if (!nd->dentry->d_inode)
return -ENOENT;
if (!S_ISDIR(nd->dentry->d_inode->i_mode))
return -ENOTDIR;
return 0;
}
/* checks if two hidden_dentries have overlapping branches */
int is_branch_overlap(struct dentry *dent1, struct dentry *dent2)
{
struct dentry *dent = NULL;
dent = dent1;
while ((dent != dent2) && (dent->d_parent != dent)) {
dent = dent->d_parent;
}
if (dent == dent2) {
return 1;
}
dent = dent2;
while ((dent != dent1) && (dent->d_parent != dent)) {
dent = dent->d_parent;
}
if (dent == dent1) {
return 1;
}
return 0;
}
static int parse_branch_mode(char *name)
{
int perms;
int l = strlen(name);
if (!strcmp(name + l - 3, "=ro")) {
perms = MAY_READ;
name[l - 3] = '\0';
} else if (!strcmp(name + l - 6, "=nfsro")) {
perms = MAY_READ | MAY_NFSRO;
name[l - 6] = '\0';
} else if (!strcmp(name + l - 3, "=rw")) {
perms = MAY_READ | MAY_WRITE;
name[l - 3] = '\0';
} else {
perms = MAY_READ | MAY_WRITE;
}
return perms;
}
static int get_separator_count(char *options, char *separator)
{
char *token, *locopts, *locsep = NULL;
int count = 0;
/*
* We copy options so we dont destroy our pointer for parsing
*/
if (separator == NULL) {
locsep = KMALLOC(2, GFP_KERNEL);
if (!locsep) {
count = -ENOMEM;
goto out;
}
strcpy(locsep, ":");
} else {
locsep = separator;
}
locopts = KMALLOC(strlen(options) + 1, GFP_KERNEL);
if (!locopts) {
count = -ENOMEM;
goto out;
}
strcpy(locopts, options);
while ((token = strsep(&locopts, locsep)) != NULL)
count++;
out:
KFREE(locopts);
return count;
}
static int parse_dirs_option(struct super_block *sb, struct unionfs_dentry_info
*hidden_root_info, char *options, char *separator)
{
struct nameidata nd;
char *name, *locsep = NULL;
int err = 0;
int branches = 1;
int bindex = 0;
int i = 0;
int j = 0;
struct dentry *dent1 = NULL;
struct dentry *dent2 = NULL;
if (options[0] == '\0') {
printk(KERN_WARNING "unionfs: no branches specified\n");
err = -EINVAL;
goto out;
}
/*
* Check to see if separator is specified otherwise use ':'
*/
if (separator == NULL) {
locsep = KMALLOC(2, GFP_KERNEL);
if (!locsep) {
err = -ENOMEM;
goto out;
}
strcpy(locsep, ":");
} else {
locsep = separator;
}
branches = get_separator_count(options, separator);
/* allocate space for underlying pointers to hidden dentry */
if (!(stopd(sb)->usi_data = alloc_new_data(branches))) {
err = -ENOMEM;
goto out;
}
if (!(hidden_root_info->udi_dentry = alloc_new_dentries(branches))) {
err = -ENOMEM;
goto out;
}
/* now parsing the string b1:b2=rw:b3=ro:b4 */
branches = 0;
while ((name = strsep(&options, locsep)) != NULL) {
int perms;
if (!*name)
continue;
branches++;
/* strip off =rw or =ro if it is specified. */
perms = parse_branch_mode(name);
if (!bindex && !(perms & MAY_WRITE)) {
err = -EINVAL;
goto out;
}
dprint(PRINT_DEBUG, "using directory: %s (%c%c%c)\n",
name, perms & MAY_READ ? 'r' : '-',
perms & MAY_WRITE ? 'w' : '-',
perms & MAY_NFSRO ? 'n' : '-');
err = path_lookup(name, LOOKUP_FOLLOW, &nd);
RECORD_PATH_LOOKUP(&nd);
if (err) {
printk(KERN_WARNING "unionfs: error accessing "
"hidden directory '%s' (error %d)\n", name, err);
goto out;
}
if ((err = check_branch(&nd))) {
printk(KERN_WARNING "unionfs: hidden directory "
"'%s' is not a valid branch\n", name);
path_release(&nd);
RECORD_PATH_RELEASE(&nd);
goto out;
}
hidden_root_info->udi_dentry[bindex] = nd.dentry;
set_stohiddenmnt_index(sb, bindex, nd.mnt);
set_branchperms(sb, bindex, perms);
set_branch_count(sb, bindex, 0);
if (hidden_root_info->udi_bstart < 0)
hidden_root_info->udi_bstart = bindex;
hidden_root_info->udi_bend = bindex;
bindex++;
}
if (branches == 0) {
printk(KERN_WARNING "unionfs: no branches specified\n");
err = -EINVAL;
goto out;
}
BUG_ON(branches != (hidden_root_info->udi_bend + 1));
/* ensure that no overlaps exist in the branches */
for (i = 0; i < branches; i++) {
for (j = i + 1; j < branches; j++) {
dent1 = hidden_root_info->udi_dentry[i];
dent2 = hidden_root_info->udi_dentry[j];
if (is_branch_overlap(dent1, dent2)) {
goto out_overlap;
}
}
}
out_overlap:
if (i != branches) {
printk(KERN_WARNING "unionfs: branches %d and %d overlap\n", i,
j);
err = -EINVAL;
goto out;
}
out:
if (err) {
for (i = 0; i < branches; i++) {
if (hidden_root_info->udi_dentry[i])
DPUT(hidden_root_info->udi_dentry[i]);
}
KFREE(hidden_root_info->udi_dentry);
KFREE(stopd(sb)->usi_data);
/* MUST clear the pointers to prevent potential double free if
* the caller dies later on
*/
hidden_root_info->udi_dentry = NULL;
stopd(sb)->usi_data = NULL;
}
if (!separator)
KFREE(locsep);
return err;
}
/*
* Parse mount options. See the manual page for usage instructions.
*
* Returns the dentry object of the lower-level (hidden) directory;
* We want to mount our stackable file system on top of that hidden directory.
*
* Sets default debugging level to N, if any.
*/
static struct unionfs_dentry_info *unionfs_parse_options(struct super_block *sb,
char *options)
{
struct unionfs_dentry_info *hidden_root_info;
char *optname, *separator = NULL;
int err = 0;
int bindex;
int sepfound = 0;
int dirsfound = 0;
#ifdef UNIONFS_IMAP
int imapfound = 0;
#endif
print_entry_location();
/* allocate private data area */
err = -ENOMEM;
hidden_root_info =
KZALLOC(sizeof(struct unionfs_dentry_info), GFP_KERNEL);
if (!hidden_root_info)
goto out_error;
hidden_root_info->udi_bstart = -1;
hidden_root_info->udi_bend = -1;
hidden_root_info->udi_bopaque = -1;
while ((optname = strsep(&options, ",")) != NULL) {
char *optarg;
char *endptr;
int intval;
if (!*optname) {
continue;
}
optarg = strchr(optname, '=');
if (optarg) {
*optarg++ = '\0';
}
/* All of our options take an argument now. Insert ones that
* don't, above this check. */
if (!optarg) {
printk("unionfs: %s requires an argument.\n", optname);
err = -EINVAL;
goto out_error;
}
if (!strcmp("dirs", optname)) {
if (++dirsfound > 1) {
printk(KERN_WARNING
"unionfs: multiple dirs specified\n");
err = -EINVAL;
goto out_error;
}
err =
parse_dirs_option(sb, hidden_root_info, optarg,
separator);
if (err)
goto out_error;
continue;
}
#ifdef UNIONFS_IMAP
if (!strcmp("imap", optname)) {
if (++imapfound > 1) {
printk(KERN_WARNING
"unionfs: multiple imap specified\n");
err = -EINVAL;
goto out_error;
}
err = parse_imap_option(sb, hidden_root_info, optarg);
if (err)
goto out_error;
continue;
}
#endif
if (!strcmp("delete", optname)) {
if (!strcmp("whiteout", optarg)) {
/* default */
#ifdef UNIONFS_DELETE_ALL
} else if (!strcmp("all", optarg)) {
MOUNT_FLAG(sb) |= DELETE_ALL;
#endif
} else {
printk(KERN_WARNING
"unionfs: invalid delete option '%s'\n",
optarg);
err = -EINVAL;
goto out_error;
}
continue;
}
if (!strcmp("separator", optname)) {
if (dirsfound) {
printk(KERN_WARNING
"unionfs: dirs= already parsed separator '%s' will have no effect\n",
optarg);
continue;
}
sepfound = 1;
separator = KMALLOC(strlen(optarg) + 1, GFP_KERNEL);
if (!separator) {
err = -ENOMEM;
goto out_error;
}
strcpy(separator, optarg);
continue;
}
/* All of these options require an integer argument. */
intval = simple_strtoul(optarg, &endptr, 0);
if (*endptr) {
printk(KERN_WARNING
"unionfs: invalid %s option '%s'\n",
optname, optarg);
err = -EINVAL;
goto out_error;
}
if (!strcmp("debug", optname)) {
set_debug_mask(intval);
continue;
}
err = -EINVAL;
printk(KERN_WARNING
"unionfs: unrecognized option '%s'\n", optname);
goto out_error;
}
if (dirsfound != 1) {
printk(KERN_WARNING "unionfs: dirs option required\n");
err = -EINVAL;
goto out_error;
}
goto out;
out_error:
if (hidden_root_info && hidden_root_info->udi_dentry) {
for (bindex = hidden_root_info->udi_bstart;
bindex >= 0 && bindex <= hidden_root_info->udi_bend;
bindex++) {
struct dentry *d;
d = hidden_root_info->udi_dentry[bindex];
DPUT(d);
if (stohiddenmnt_index(sb, bindex))
mntput(stohiddenmnt_index(sb, bindex));
}
}
KFREE(hidden_root_info->udi_dentry);
KFREE(hidden_root_info);
KFREE(stopd(sb)->usi_data);
stopd(sb)->usi_data = NULL;
hidden_root_info = ERR_PTR(err);
KFREE(separator);
out:
print_exit_location();
return hidden_root_info;
}
static struct dentry *unionfs_d_alloc_root(struct super_block *sb)
{
struct dentry *ret = NULL;
if (sb) {
static const struct qstr name = {.name = "/",.len = 1 };
ret = d_alloc(NULL, &name);
if (ret) {
ret->d_op = &unionfs_dops;
ret->d_sb = sb;
ret->d_parent = ret;
}
}
return ret;
}
static int unionfs_read_super(struct super_block *sb, void *raw_data,
int silent)
{
int err = 0;
struct unionfs_dentry_info *hidden_root_info = NULL;
int bindex, bstart, bend;
unsigned long long maxbytes;
print_entry_location();
if (!raw_data) {
printk(KERN_WARNING
"unionfs_read_super: missing data argument\n");
err = -EINVAL;
goto out;
}
/*
* Allocate superblock private data
*/
stopd_lhs(sb) = KZALLOC(sizeof(struct unionfs_sb_info), GFP_KERNEL);
if (!stopd(sb)) {
printk(KERN_WARNING "%s: out of memory\n", __FUNCTION__);
err = -ENOMEM;
goto out;
}
stopd(sb)->b_end = -1;
atomic_set(&stopd(sb)->usi_generation, 1);
init_rwsem(&stopd(sb)->usi_rwsem);
hidden_root_info = unionfs_parse_options(sb, raw_data);
if (IS_ERR(hidden_root_info)) {
printk(KERN_WARNING
"unionfs_read_super: error while parsing options (err = %ld)\n",
PTR_ERR(hidden_root_info));
err = PTR_ERR(hidden_root_info);
hidden_root_info = NULL;
goto out_free;
}
if (hidden_root_info->udi_bstart == -1) {
err = -ENOENT;
goto out_free;
}
/* set the hidden superblock field of upper superblock */
bstart = hidden_root_info->udi_bstart;
BUG_ON(bstart != 0);
sbend(sb) = bend = hidden_root_info->udi_bend;
for (bindex = bstart; bindex <= bend; bindex++) {
struct dentry *d;
d = hidden_root_info->udi_dentry[bindex];
set_stohs_index(sb, bindex, d->d_sb);
}
/* Unionfs: Max Bytes is the maximum bytes from among all the branches */
maxbytes = -1;
for (bindex = bstart; bindex <= bend; bindex++)
if (maxbytes < stohs_index(sb, bindex)->s_maxbytes)
maxbytes = stohs_index(sb, bindex)->s_maxbytes;
sb->s_maxbytes = maxbytes;
sb->s_op = &unionfs_sops;
#ifdef CONFIG_EXPORTFS
sb->s_export_op = &unionfs_export_ops;
#endif
/*
* we can't use d_alloc_root if we want to use
* our own interpose function unchanged,
* so we simply call our own "fake" d_alloc_root
*/
sb->s_root = unionfs_d_alloc_root(sb);
if (!sb->s_root) {
err = -ENOMEM;
goto out_dput;
}
/* link the upper and lower dentries */
dtopd_lhs(sb->s_root) = NULL;
if ((err = new_dentry_private_data(sb->s_root)))
goto out_freedpd;
/* Set the hidden dentries for s_root */
for (bindex = bstart; bindex <= bend; bindex++) {
struct dentry *d;
d = hidden_root_info->udi_dentry[bindex];
set_dtohd_index(sb->s_root, bindex, d);
}
set_dbstart(sb->s_root, bstart);
set_dbend(sb->s_root, bend);
/* Set the generation number to one, since this is for the mount. */
atomic_set(&dtopd(sb->s_root)->udi_generation, 1);
/* call interpose to create the upper level inode */
if ((err = unionfs_interpose(sb->s_root, sb, 0)))
goto out_freedpd;
unlock_dentry(sb->s_root);
goto out;
out_freedpd:
if (dtopd(sb->s_root)) {
KFREE(dtohd_ptr(sb->s_root));
free_dentry_private_data(dtopd(sb->s_root));
}
DPUT(sb->s_root);
out_dput:
if (hidden_root_info && !IS_ERR(hidden_root_info)) {
for (bindex = hidden_root_info->udi_bstart;
bindex <= hidden_root_info->udi_bend; bindex++) {
struct dentry *d;
d = hidden_root_info->udi_dentry[bindex];
if (d)
DPUT(d);
if (stopd(sb) && stohiddenmnt_index(sb, bindex))
mntput(stohiddenmnt_index(sb, bindex));
}
KFREE(hidden_root_info->udi_dentry);
KFREE(hidden_root_info);
hidden_root_info = NULL;
}
out_free:
KFREE(stopd(sb)->usi_data);
KFREE(stopd(sb));
stopd_lhs(sb) = NULL;
out:
if (hidden_root_info && !IS_ERR(hidden_root_info)) {
KFREE(hidden_root_info->udi_dentry);
KFREE(hidden_root_info);
}
print_exit_status(err);
return err;
}
static int unionfs_get_sb(struct file_system_type *fs_type,
int flags, const char *dev_name,
void *raw_data, struct vfsmount *mnt)
{
return get_sb_nodev(fs_type, flags, raw_data, unionfs_read_super, mnt);
}
void unionfs_kill_block_super(struct super_block *sb)
{
generic_shutdown_super(sb);
}
static struct file_system_type unionfs_fs_type = {
.owner = THIS_MODULE,
.name = "unionfs",
.get_sb = unionfs_get_sb,
.kill_sb = unionfs_kill_block_super,
.fs_flags = FS_REVAL_DOT,
};
static int init_debug = 0;
module_param_named(debug, init_debug, int, S_IRUGO);
MODULE_PARM_DESC(debug, "Initial Unionfs debug value.");
static int __init init_unionfs_fs(void)
{
int err;
printk("Registering unionfs " UNIONFS_VERSION "\n");
set_debug_mask(init_debug);
#ifdef FIST_MALLOC_DEBUG
atomic_set(&unionfs_malloc_counter, 0);
atomic_set(&unionfs_mallocs_outstanding, 0);
#endif /* FIST_MALLOC_DEBUG */
if ((err = init_filldir_cache()))
goto out;
if ((err = init_inode_cache()))
goto out;
if ((err = init_dentry_cache()))
goto out;
if ((err = init_sioq()))
goto out;
err = register_filesystem(&unionfs_fs_type);
out:
if (err) {
fin_sioq();
destroy_filldir_cache();
destroy_inode_cache();
destroy_dentry_cache();
}
return err;
}
static void __exit exit_unionfs_fs(void)
{
fin_sioq();
destroy_filldir_cache();
destroy_inode_cache();
destroy_dentry_cache();
unregister_filesystem(&unionfs_fs_type);
printk("Completed unionfs module unload.\n");
}
MODULE_AUTHOR
("Filesystems and Storage Lab, Stony Brook University (http://www.fsl.cs.sunysb.edu/)");
MODULE_DESCRIPTION("Unionfs " UNIONFS_VERSION
" (http://unionfs.filesystems.org/)");
MODULE_LICENSE("GPL");
module_init(init_unionfs_fs);
module_exit(exit_unionfs_fs);
/*
*
* vim:shiftwidth=8
* vim:tabstop=8
*
* For Emacs:
* Local variables:
* c-basic-offset: 8
* c-comment-only-line-offset: 0
* c-offsets-alist: ((statement-block-intro . +) (knr-argdecl-intro . 0)
* (substatement-open . 0) (label . 0) (statement-cont . +))
* indent-tabs-mode: t
* tab-width: 8
* End:
*/
|