1 diff -urN linux-2.6.21.1.old/fs/Kconfig linux-2.6.21.1.dev/fs/Kconfig
2 --- linux-2.6.21.1.old/fs/Kconfig 2007-05-26 19:03:45.497714200 +0200
3 +++ linux-2.6.21.1.dev/fs/Kconfig 2007-05-26 21:01:26.154331240 +0200
5 This option will enlarge your kernel, but it allows debugging of
6 ocfs2 filesystem issues.
9 + tristate "Mini fanout overlay filesystem"
12 tristate "Minix fs support"
14 diff -urN linux-2.6.21.1.old/fs/Makefile linux-2.6.21.1.dev/fs/Makefile
15 --- linux-2.6.21.1.old/fs/Makefile 2007-05-26 19:03:45.497714200 +0200
16 +++ linux-2.6.21.1.dev/fs/Makefile 2007-05-26 21:01:26.160330328 +0200
18 obj-$(CONFIG_RAMFS) += ramfs/
19 obj-$(CONFIG_HUGETLBFS) += hugetlbfs/
20 obj-$(CONFIG_CODA_FS) += coda/
21 +obj-$(CONFIG_MINI_FO) += mini_fo/
22 obj-$(CONFIG_MINIX_FS) += minix/
23 obj-$(CONFIG_FAT_FS) += fat/
24 obj-$(CONFIG_MSDOS_FS) += msdos/
25 diff -urN linux-2.6.21.1.old/fs/mini_fo/aux.c linux-2.6.21.1.dev/fs/mini_fo/aux.c
26 --- linux-2.6.21.1.old/fs/mini_fo/aux.c 1970-01-01 01:00:00.000000000 +0100
27 +++ linux-2.6.21.1.dev/fs/mini_fo/aux.c 2007-05-26 21:01:26.160330328 +0200
30 + * Copyright (c) 1997-2003 Erez Zadok
31 + * Copyright (c) 2001-2003 Stony Brook University
33 + * For specific licensing information, see the COPYING file distributed with
34 + * this package, or get one from ftp://ftp.filesystems.org/pub/fist/COPYING.
36 + * This Copyright notice must be kept intact and distributed with all
37 + * fistgen sources INCLUDING sources generated by fistgen.
40 + * Copyright (C) 2004, 2005 Markus Klotzbuecher <mk@creamnet.de>
42 + * This program is free software; you can redistribute it and/or
43 + * modify it under the terms of the GNU General Public License
44 + * as published by the Free Software Foundation; either version
45 + * 2 of the License, or (at your option) any later version.
58 +/* check if file exists in storage */
59 +int exists_in_storage(dentry_t *dentry)
61 + check_mini_fo_dentry(dentry);
62 + if(dtost(dentry) == MODIFIED || dtost(dentry) == CREATED || dtost(dentry) == DEL_REWRITTEN)
67 +/* check if dentry is in an existing state */
68 +int is_mini_fo_existant(dentry_t *dentry)
70 + check_mini_fo_dentry(dentry);
72 + if(dtost(dentry) == DELETED || dtost(dentry) == NON_EXISTANT)
79 + * This function will create a negative storage dentry for
80 + * dentry, what is required for many create like options.
81 + * It will create the storage structure if necessary.
83 +int get_neg_sto_dentry(dentry_t *dentry)
87 + const unsigned char *name;
91 + !(dtost(dentry) == UNMODIFIED ||
92 + dtost(dentry) == NON_EXISTANT ||
93 + dtost(dentry) == DELETED)) {
94 + printk(KERN_CRIT "mini_fo: get_neg_sto_dentry: invalid dentry passed.\n");
98 + /* Have we got a neg. dentry already? */
99 + if(dtohd2(dentry)) {
103 + if(dtost(dentry->d_parent) == UNMODIFIED) {
104 + /* build sto struct */
105 + err = build_sto_structure(dentry->d_parent->d_parent, dentry->d_parent);
107 + dtost(dentry->d_parent) != MODIFIED) {
108 + printk(KERN_CRIT "mini_fo: get_neg_sto_dentry: ERROR building sto structure.\n");
114 + len = dentry->d_name.len;
115 + name = dentry->d_name.name;
118 + lookup_one_len(name, dtohd2(dentry->d_parent), len);
124 +int check_mini_fo_dentry(dentry_t *dentry)
126 + ASSERT(dentry != NULL);
127 + ASSERT(dtopd(dentry) != NULL);
128 + ASSERT((dtohd(dentry) != NULL) || (dtohd2(dentry) != NULL));
130 +/* if(dtost(dentry) == MODIFIED) { */
131 +/* ASSERT(dentry->d_inode != NULL); */
132 +/* ASSERT(dtohd(dentry) != NULL); */
133 +/* ASSERT(dtohd(dentry)->d_inode != NULL); */
134 +/* ASSERT(dtohd2(dentry) != NULL); */
135 +/* ASSERT(dtohd2(dentry)->d_inode != NULL); */
137 +/* else if(dtost(dentry) == UNMODIFIED) { */
138 +/* ASSERT(dentry->d_inode != NULL); */
144 +int check_mini_fo_file(file_t *file)
146 + ASSERT(file != NULL);
147 + ASSERT(ftopd(file) != NULL);
148 + ASSERT(file->f_dentry != NULL);
150 + /* violent checking, check depending of state and type
151 + * if(S_ISDIR(file->f_dentry->d_inode->i_mode)) {}
153 + ASSERT((ftohf(file) != NULL) || (ftohf2(file) != NULL));
157 +int check_mini_fo_inode(inode_t *inode)
159 + ASSERT(inode != NULL);
160 + ASSERT(itopd(inode) != NULL);
161 + ASSERT((itohi(inode) != NULL) || (itohi2(inode) != NULL));
166 + * will walk a base path as provided by get_mini_fo_bpath and return
167 + * the (hopefully ;-) ) positive dentry of the renamed base dir.
169 + * This does some work of path_init.
171 +dentry_t *bpath_walk(super_block_t *sb, char *bpath)
174 + struct nameidata nd;
177 + if(!bpath || bpath[0] != '/') {
178 + printk(KERN_CRIT "mini_fo: bpath_walk: Invalid string.\n");
181 + if(!sb || !stopd(sb)) {
182 + printk(KERN_CRIT "mini_fo: bpath_walk: Invalid sb.\n");
186 + /* setup nd as path_init does */
187 + nd.last_type = LAST_ROOT; /* if there are only slashes... */
188 + nd.flags = LOOKUP_FOLLOW;
189 + /* fix this: how do I reach this lock?
190 + * read_lock(¤t->fs->lock); */
191 + nd.mnt = mntget(stopd(sb)->hidden_mnt);
192 + nd.dentry = dget(stopd(sb)->base_dir_dentry);
193 + /* read_unlock(¤t->fs->lock); */
195 + err = path_walk(bpath+1, &nd);
198 + if (err || !nd.dentry || !nd.dentry->d_inode) {
199 + printk(KERN_CRIT "mini_fo: bpath_walk: path_walk failed.\n");
206 +/* returns the full path of the basefile incl. its name */
207 +int get_mini_fo_bpath(dentry_t *dentry, char **bpath, int *bpath_len)
211 + dentry_t *sky_walker;
213 + if(!dentry || !dtohd(dentry)) {
214 + printk(KERN_CRIT "mini_fo: get_mini_fo_bpath: invalid dentry passed.\n");
217 + sky_walker = dtohd(dentry);
220 + len += sky_walker->d_name.len + 1 ; /* 1 for '/' */
221 + sky_walker = sky_walker->d_parent;
222 + } while(sky_walker != stopd(dentry->d_inode->i_sb)->base_dir_dentry);
224 + /* 1 to oil the loop */
225 + *bpath = (char*) kmalloc(len + 1, GFP_KERNEL);
227 + printk(KERN_CRIT "mini_fo: get_mini_fo_bpath: out of mem.\n");
230 + buf_walker = *bpath+len; /* put it on last char */
231 + *buf_walker = '\n';
232 + sky_walker = dtohd(dentry);
235 + buf_walker -= sky_walker->d_name.len;
236 + strncpy(buf_walker,
237 + sky_walker->d_name.name,
238 + sky_walker->d_name.len);
239 + *(--buf_walker) = '/';
240 + sky_walker = sky_walker->d_parent;
241 + } while(sky_walker != stopd(dentry->d_inode->i_sb)->base_dir_dentry);
243 + /* bpath_len doesn't count newline! */
248 +int mini_fo_cp_cont(dentry_t *tgt_dentry, struct vfsmount *tgt_mnt,
249 + dentry_t *src_dentry, struct vfsmount *src_mnt)
252 + mm_segment_t old_fs;
255 + int bytes, len, tmp, err;
258 + if(!(tgt_dentry->d_inode && src_dentry->d_inode)) {
259 + printk(KERN_CRIT "mini_fo_cp_cont: ERROR, neg. dentry passed.\n");
269 + /* open file write only */
270 + tgt_file = dentry_open(tgt_dentry, tgt_mnt, 0x1);
271 + if(!tgt_file || IS_ERR(tgt_file)) {
272 + printk(KERN_CRIT "mini_fo_cp_cont: ERROR opening target file.\n");
273 + err = PTR_ERR(tgt_file);
277 + /* open file read only */
278 + src_file = dentry_open(src_dentry, src_mnt, 0x0);
279 + if(!src_file || IS_ERR(src_file)) {
280 + printk(KERN_CRIT "mini_fo_cp_cont: ERROR opening source file.\n");
281 + err = PTR_ERR(src_file);
283 + /* close target file */
288 + /* check if the filesystem(s) support read respective write */
289 + if(!src_file->f_op->read || !tgt_file->f_op->write) {
290 + printk(KERN_CRIT "mini_fo_cp_cont: ERROR, no fs read or write support.\n");
295 + /* allocate a page for transfering the data */
296 + buf = (void *) __get_free_page(GFP_KERNEL);
298 + printk(KERN_CRIT "mini_fo_cp_cont: ERROR, out of kernel mem.\n");
302 + tgt_file->f_pos = 0;
303 + src_file->f_pos = 0;
308 + /* Doing this I assume that a read operation will return a full
309 + * buffer while there is still data to read, and a less than
310 + * full buffer when all data has been read.
312 + bytes = len = PAGE_SIZE;
313 + while(bytes == len) {
314 + bytes = src_file->f_op->read(src_file, buf, len,
316 + tmp = tgt_file->f_op->write(tgt_file, buf, bytes,
319 + printk(KERN_CRIT "mini_fo_cp_cont: ERROR writing.\n");
320 + goto out_close_unset;
324 + free_page((unsigned long) buf);
331 + free_page((unsigned long) buf);
342 + /* mk: not sure if this need to be done */
351 + * ndl (no-duplicate list) stuff
352 + * This is used in mini_fo_readdir, to save the storage directory contents
353 + * and later when reading base, match them against the list in order
354 + * to avoid duplicates.
357 +/* add a file specified by name and len to the ndl
358 + * Return values: 0 on success, <0 on failure.
360 +int ndl_add_entry(struct readdir_data *rd, const char *name, int len)
362 + struct ndl_entry *tmp_entry;
364 + tmp_entry = (struct ndl_entry *)
365 + kmalloc(sizeof(struct ndl_entry), GFP_KERNEL);
367 + printk(KERN_CRIT "mini_fo: ndl_add_entry: out of mem.\n");
370 + tmp_entry->name = (char*) kmalloc(len, GFP_KERNEL);
371 + if(!tmp_entry->name) {
372 + printk(KERN_CRIT "mini_fo: ndl_add_entry: out of mem.\n");
375 + strncpy(tmp_entry->name, name, len);
376 + tmp_entry->len = len;
378 + list_add(&tmp_entry->list, &rd->ndl_list);
383 +/* delete all list entries and free memory */
384 +void ndl_put_list(struct readdir_data *rd)
386 + struct list_head *tmp;
387 + struct ndl_entry *tmp_entry;
389 + if(rd->ndl_size <= 0)
391 + while(!list_empty(&rd->ndl_list)) {
392 + tmp = rd->ndl_list.next;
394 + tmp_entry = list_entry(tmp, struct ndl_entry, list);
395 + kfree(tmp_entry->name);
401 +/* Check if a file specified by name and len is in the ndl
402 + * Return value: 0 if not in list, 1 if file is found in ndl.
404 +int ndl_check_entry(struct readdir_data *rd, const char *name, int len)
406 + struct list_head *tmp;
407 + struct ndl_entry *tmp_entry;
409 + if(rd->ndl_size <= 0)
412 + list_for_each(tmp, &rd->ndl_list) {
413 + tmp_entry = list_entry(tmp, struct ndl_entry, list);
414 + if(tmp_entry->len != len)
416 + if(!strncmp(tmp_entry->name, name, len))
423 + * Recursive function to create corresponding directorys in the storage fs.
424 + * The function will build the storage directorys up to dentry.
426 +int build_sto_structure(dentry_t *dir, dentry_t *dentry)
429 + dentry_t *hidden_sto_dentry;
430 + dentry_t *hidden_sto_dir_dentry;
432 + if(dentry->d_parent != dir) {
433 + printk(KERN_CRIT "mini_fo: build_sto_structure: invalid parameter or meta data corruption [1].\n");
437 + if(dtost(dir) != MODIFIED) {
438 + err = build_sto_structure(dir->d_parent, dentry->d_parent);
443 + /* ok, coming back again. */
444 + check_mini_fo_dentry(dentry);
445 + hidden_sto_dentry = dtohd2(dentry);
447 + if(!hidden_sto_dentry) {
449 + * This is the case after creating the first
450 + * hidden_sto_dentry.
451 + * After one negative storage_dentry, all pointers to
452 + * hidden_storage dentries are set to NULL. We need to
453 + * create the negative dentry before we create the storage
457 + const unsigned char *name;
458 + len = dtohd(dentry)->d_name.len;
459 + name = dtohd(dentry)->d_name.name;
460 + hidden_sto_dentry = lookup_one_len(name, dtohd2(dir), len);
461 + dtohd2(dentry) = hidden_sto_dentry;
464 + /* was: hidden_sto_dir_dentry = lock_parent(hidden_sto_dentry); */
465 + hidden_sto_dir_dentry = dget(hidden_sto_dentry->d_parent);
466 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
467 + mutex_lock(&hidden_sto_dir_dentry->d_inode->i_mutex);
469 + down(&hidden_sto_dir_dentry->d_inode->i_sem);
472 + if(dtohd2(dir) != hidden_sto_dir_dentry) {
473 + printk(KERN_CRIT "mini_fo: build_sto_structure: invalid parameter or meta data corruption [2].\n");
477 + /* check for errors in lock_parent */
478 + err = PTR_ERR(hidden_sto_dir_dentry);
479 + if(IS_ERR(hidden_sto_dir_dentry)) {
480 + printk(KERN_CRIT "mini_fo: build_sto_structure: lock_parent failed.\n");
484 + err = vfs_mkdir(hidden_sto_dir_dentry->d_inode,
486 + dir->d_inode->i_mode);
489 + printk(KERN_CRIT "mini_fo: build_sto_structure: failed to create storage dir [1].\n");
490 + /* was: unlock_dir(dir); */
491 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
492 + mutex_unlock(&dir->d_inode->i_mutex);
494 + up(&dir->d_inode->i_sem);
500 + /* everything ok! */
501 + if(!dtohd2(dentry)->d_inode) {
502 + printk(KERN_CRIT "mini_fo: build_sto_structure: failed to create storage dir [2].\n");
503 + /* was: unlock_dir(dir); */
504 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
505 + mutex_unlock(&dir->d_inode->i_mutex);
507 + up(&dir->d_inode->i_sem);
513 + /* interpose the new inode and set new state */
514 + itohi2(dentry->d_inode) = igrab(dtohd2(dentry)->d_inode);
515 + dtopd(dentry)->state = MODIFIED;
517 + /* initalize the wol list */
518 + itopd(dentry->d_inode)->deleted_list_size = -1;
519 + itopd(dentry->d_inode)->renamed_list_size = -1;
520 + meta_build_lists(dentry);
522 + fist_copy_attr_all(dentry->d_inode, itohi2(dentry->d_inode));
523 + fist_copy_attr_timesizes(dir->d_inode,
524 + hidden_sto_dir_dentry->d_inode);
525 + dir->d_inode->i_nlink++;
526 + /* was: unlock_dir(hidden_sto_dir_dentry); */
527 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
528 + mutex_unlock(&hidden_sto_dir_dentry->d_inode->i_mutex);
530 + up(&hidden_sto_dir_dentry->d_inode->i_sem);
532 + dput(hidden_sto_dir_dentry);
540 + * Read "len" bytes from "filename" into "buf".
541 + * "buf" is in kernel space.
544 +mini_fo_read_file(const char *filename, void *buf, int len)
547 + mm_segment_t oldfs;
549 + /* Chroot? Maybe NULL isn't right here */
550 + filp = filp_open(filename, O_RDONLY, 0);
551 + if (!filp || IS_ERR(filp)) {
552 + printk("mini_fo_read_file err %d\n", (int) PTR_ERR(filp));
553 + return -1; /* or do something else */
556 + if (!filp->f_op->read)
557 + return -2; /* file(system) doesn't allow reads */
559 + /* now read len bytes from offset 0 */
560 + filp->f_pos = 0; /* start offset */
563 + bytes = filp->f_op->read(filp, buf, len, &filp->f_pos);
566 + /* close the file */
575 + * Write "len" bytes from "buf" to "filename"
576 + * "buf" is in kernel space.
579 +mini_fo_write_file(const char *filename, void *buf, int len)
582 + mm_segment_t oldfs;
584 + /* Chroot? Maybe NULL isn't right here */
585 + filp = filp_open(filename, O_RDWR|O_CREAT, 0640);
586 + if (!filp || IS_ERR(filp)) {
587 + printk("mini_fo_write_file err %d\n", (int) PTR_ERR(filp));
588 + return -1; /* or do something else */
591 + if (!filp->f_op->write)
592 + return -2; /* file(system) doesn't allow writes */
594 + /* now write len bytes from offset 0 */
595 + filp->f_pos = 0; /* start offset */
598 + bytes = filp->f_op->write(filp, buf, len, &filp->f_pos);
601 + /* close the file */
609 diff -urN linux-2.6.21.1.old/fs/mini_fo/ChangeLog linux-2.6.21.1.dev/fs/mini_fo/ChangeLog
610 --- linux-2.6.21.1.old/fs/mini_fo/ChangeLog 1970-01-01 01:00:00.000000000 +0100
611 +++ linux-2.6.21.1.dev/fs/mini_fo/ChangeLog 2007-05-26 21:01:26.161330176 +0200
613 +2006-01-24 Markus Klotzbuecher <mk@mary.denx.de>
615 + * Add tons of ugly ifdefs to Ed L. Cashin's mutex patch to
616 + retain backwards compatibility.
618 +2006-01-24 Ed L. Cashin <ecashin@coraid.com>
620 + * Support for the new mutex infrastructure
621 + (7892f2f48d165a34b0b8130c8a195dfd807b8cb6)
623 +2005-10-15 Markus Klotzbuecher <mk@localhost.localdomain>
625 + * Bugfix for a serious memory leak in mini_fo_follow_link.
627 +2005-09-21 Markus Klotzbuecher <mk@mary>
629 + * new release 0.6.1
631 + * fix of a compiler warning due to changes in 2.6.13
633 +2005-09-21 Klaus Wenninger <klaus.wenninger@siemens.com>
635 + * file.c: readdir: fix for a bug that caused directory entries
636 + to show up twice when using storage filesystems such as
639 +2005-06-30 Eric Lammerts <eric@lammerts.org>
641 + * fix for an oops when overwriting a binary thats beeing
644 +2005-06-09 <mk@mary>
646 + * Renamed overlay to mini_fo-overlay.
648 + * Added mini_fo-merge script to allow merging of storage and base
649 + after making modifications.
651 +2005-05-22 root <mk@mary>
653 + * Added overlay script that allows to easily mount mini_fo ontop
654 + of a given base directory
656 +2005-05-10 <mk@mary>
658 + * inode.c: xattr functions return -EOPNOSUPP instead of
659 + -ENOSUPP, what confuses "ls -l"
661 + * Changed license from LGPL to GPL.
663 +2005-05-08 root <mk@mary>
665 + * Makefile: clean it up and added make install and make
668 +2005-05-06 <mk@mary>
670 + * merged devel branch back to main. [v0-6-0-pre3]
672 + * removed unused files print.c and fist_ioctl. [devel-0-0-18]
674 + * ioctl: removed fist_ioctl stuff, that is not needed for
677 +2005-05-03 <mk@mary>
679 + * file.c: simplified mini_fo_open and mini_fo_setattr using
680 + new state changing functions. [devel-0-0-17]
682 + * inode.c: Fixed getattr state bug (see below) in 2.4 function
683 + mini_fo_inode revalidate.
685 + * inode.c: found an other bug in mini_fo_getattr. States are not
686 + reliable in this function, as a file can be opened, unlinked and
687 + the getattr function called. This results in a deleted dentry
688 + with an inode. Fix is to ignore states and simply use the inode
691 +2005-04-29 <mk@mary>
693 + * file.c: Bugfix and cleanup in fasync and fsync. [devel-0-0-16]
695 + * file.c: do not use mini_fo_lock so the generic version is
698 + * inode.c: getattr, never call getattr on lower files, as this
699 + will cause the inum to change.
701 + * inode.c: rename_reg_file renamed to rename_nondir, as it
702 + doesn't matter as long it't not a dir. Removed all
703 + rename_dev_file etc.
705 + * tagged as devel-0-0-15
707 + * inode.c: added support for chosing support for extended
708 + attrs at compile time by XATTR define in mini_fo.h .
710 + * inode.c: fixed mini_fo_getattr to use mini_fo inode and not
711 + lower again, what avoids inode number changes that confused
712 + rm again. This is the proper solution.
714 +2005-04-24 <mk@mary>
716 + * all files: updated Copyright notive to 2005. [devel-0-0-14]
718 + * inode.c: fixed mini_fo_getattr to not change the inode
719 + number, even if lower files change.
721 + * super.c: fixed a bug that caused deleted base file to show
722 + up suddenly after some time, or after creating a special
723 + file. The problem was that after some time or after special
724 + file creating sync_sb_inodes is called by the vfs, that
725 + called our mini_fo_put_inode. There was (wrongly) called
726 + __meta_put_lists, that nuked the lists, although the inode
727 + was going to continue its life. Moving __meta_put_lists to
728 + mini_fo_clear_inode, where an inode is really destroyed,
729 + solved the problem.
732 +2005-04-23 <mk@mary>
734 + * state.c, aux.c: more cleaning up and
735 + simplifications. [devel-0-0-13]
737 + * inode.c: implemented mini_fo_getattr, that was required for
738 + 2.6 because inode_revalidate has been remove there, and the
739 + old "du" bug returned.
742 +2005-04-20 <mk@mary>
744 + * aux.c: get_neg_sto_dentry(): allow to be called for dentries
745 + in state UNMODIFIED, NON_EXISTANT _and_ DELETED.
747 +2005-04-19 <mk@mary>
749 + * Fixed a bug under 2.6 that caused files deleted via mini_fo
750 + not to be deleted properly and therefore the fs filled up
751 + untill no memory was left. [devel-0-0-12]
753 + * Added basic hard link support. This means that creating
754 + hardlinks will work, but existing ones will be treated as
755 + individual files. [devel-0-0-11]
757 +2005-04-17 <mk@mary>
761 +2005-04-13 root <mk@mary>
763 + * Added file state.c for the state transition
764 + functions. Doesn't work very well yet, though...
766 +2005-04-12 <mk@mary>
768 + * Porting to 2.6 started, which is easier than expected, also
769 + due to Olivier previous work.
771 +2005-04-08 <mk@mary>
773 + * Fixed the bug that caused du to return invalid sizes of
774 + directory trees. The problem was that
775 + mini_fo_inode_revalidate didn't always copy the attributes
776 + from the base inode properly.
778 +2005-04-01 Markus Klotzbuecher <mk@chasey>
780 + * Merged devel branch back to main trunk and updated the
781 + RELEASE notes. This will be 0-6-0-pre1.
783 +2005-03-31 Markus Klotzbuecher <mk@chasey>
785 + * Fixed some bugs in rename_reg_file, that only showed up in
786 + the kernel compile test. Kernel compiles cleanly ontop of
787 + mini_fo, now also make mrproper etc. work. Seems pretty stable.
789 +2005-03-28 Markus Klotzbuecher <mk@chasey>
791 + * Many, many directory renaming bugfixes and a lot of other
792 + cleanup. Dir renaming seems to work relatively stable.
794 +2005-03-22 Markus Klotzbuecher <mk@chasey>
796 + * Finished implementing lightweight directory renaming. Some
797 + basic testing indicates it works fine.
798 + Next is to implement testcases for the testsuite and confirm
799 + everything is really working ok.
801 +2005-03-18 Markus Klotzbuecher <mk@chasey>
803 + * Finished implementing meta.c stuff required for directory
806 +2005-03-17 Markus Klotzbuecher <mk@chasey>
808 + * Fixed all compile warnings + an extremly old bug that
809 + somehow crept in while reworking the wol stuff to the META
810 + system. Turning on -Werror again... :-)
812 + * Fixed some bugs in the new rename_reg_file function.
814 + * Rewrote mini_fo rename and split it into several
815 + subfunctions, that handle the different types
816 + seperately. Rewrote the regular file function aswell, as it
817 + was implemented somewhat inefficient.
819 +2005-03-16 Markus Klotzbuecher <mk@chasey>
821 + * Implemented new META subsystem, removed old WOL stuff in favor
824 + * After some basic testing everything seems ok...
826 +2005-03-11 Markus Klotzbuecher <mk@chasey>
828 + * Renaming a non regular file caused trouble because I always
829 + tried to copy the contents. Now I only do this for regular
830 + files. mini_fo_rename still isn't implemented properly, renaming
831 + of device files, symlinks etc. results in a empty regular file
832 + instead of the proper type.
834 + * Directory renaming suddenly works! What a surprise! I guess
835 + this is because renaming is implemented as making a copy and
836 + removing the original. Still this might not work
839 +2005-03-09 Markus Klotzbuecher <mk@chasey>
841 + * Bugfix, when a mini_fo directory that exists in storage
842 + (state: MODIFIED, CREATED and DEL_REWRITTEN) is deleted, a
843 + possibly existing WOL file contained in it needs to be
846 + * Starting cleanup: defined state names in order to get rid of
849 +2005-03-08 Markus Klotzbuecher <mk@chasey>
851 + * Makefile fix, fist_ioctl was built against wrong sources if ARCH=um
853 + * Fixed a bug in dentry.c, mini_fo_d_hash. In state 4 =
854 + DEL_REWRITTEN the hash was calculated from the base dentry,
855 + which was wrong and and caused assertions in
856 + __mini_fo_hidden_dentry to fail.
858 +2005-02-21 <mk@mary>
860 + * Implemented directory deleting (inode.c)
862 + * main.c: made mini_fo_parse_options a little more robust.
864 +2004-12-22 <mk@mary>
866 + * Makefile cleanup and uml stuff, removed unneccessary files
868 + * Created a new and hopefully more informative README
870 + * CHANGELOG: created a new CHANGELOG and added old entries reversely
873 +2004-10-24 Gleb Natapov <gleb@nbase.co.il>
875 + * Fix: owner and group where not correctly copied from base to
879 +2004-10-05 Gleb Natapov <gleb@nbase.co.il>
881 + * Implementation of fsync, fasync and lock mini_fo functions.
884 +2004-09-29 Bob Lee <bob@pantasys.com>
886 + * Fix of a serious pointer bug
889 +2004-09-28 Gleb Natapov <gleb@nbase.co.il>
891 + * Implementation of mini_fo_mknod and mini_fo_rename, support
894 diff -urN linux-2.6.21.1.old/fs/mini_fo/dentry.c linux-2.6.21.1.dev/fs/mini_fo/dentry.c
895 --- linux-2.6.21.1.old/fs/mini_fo/dentry.c 1970-01-01 01:00:00.000000000 +0100
896 +++ linux-2.6.21.1.dev/fs/mini_fo/dentry.c 2007-05-26 21:01:26.161330176 +0200
899 + * Copyright (c) 1997-2003 Erez Zadok
900 + * Copyright (c) 2001-2003 Stony Brook University
902 + * For specific licensing information, see the COPYING file distributed with
903 + * this package, or get one from ftp://ftp.filesystems.org/pub/fist/COPYING.
905 + * This Copyright notice must be kept intact and distributed with all
906 + * fistgen sources INCLUDING sources generated by fistgen.
909 + * Copyright (C) 2004, 2005 Markus Klotzbuecher <mk@creamnet.de>
911 + * This program is free software; you can redistribute it and/or
912 + * modify it under the terms of the GNU General Public License
913 + * as published by the Free Software Foundation; either version
914 + * 2 of the License, or (at your option) any later version.
921 +#ifdef HAVE_CONFIG_H
922 +# include <config.h>
926 +#include "mini_fo.h"
929 + * THIS IS A BOOLEAN FUNCTION: returns 1 if valid, 0 otherwise.
932 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
933 +mini_fo_d_revalidate(dentry_t *dentry, struct nameidata *nd)
935 +mini_fo_d_revalidate(dentry_t *dentry, int flags)
938 + int err1 = 1; /* valid = 1, invalid = 0 */
940 + dentry_t *hidden_dentry;
941 + dentry_t *hidden_sto_dentry;
944 + check_mini_fo_dentry(dentry);
946 + hidden_dentry = dtohd(dentry);
947 + hidden_sto_dentry = dtohd2(dentry);
949 + if(hidden_dentry &&
950 + hidden_dentry->d_op &&
951 + hidden_dentry->d_op->d_revalidate) {
952 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
953 + err1 = hidden_dentry->d_op->d_revalidate(hidden_dentry, nd);
955 + err1 = hidden_dentry->d_op->d_revalidate(hidden_dentry, flags);
958 + if(hidden_sto_dentry &&
959 + hidden_sto_dentry->d_op &&
960 + hidden_sto_dentry->d_op->d_revalidate) {
961 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
962 + err2 = hidden_sto_dentry->d_op->d_revalidate(hidden_sto_dentry,
965 + err2 = hidden_sto_dentry->d_op->d_revalidate(hidden_sto_dentry,
970 + /* mk: if one of the lower level dentries are valid,
971 + * the mini_fo dentry is too.
973 + return (err1 || err2);
978 +mini_fo_d_hash(dentry_t *dentry, qstr_t *name)
981 + dentry_t *hidden_dentry;
982 + dentry_t *hidden_sto_dentry;
984 + /* hidden_dentry = mini_fo_hidden_dentry(dentry);
985 + * hidden_sto_dentry = mini_fo_hidden_sto_dentry(dentry); */
987 + /* state 1, 3, 4, 5: build the hash for the storage dentry */
988 + if((dtopd(dentry)->state == MODIFIED) ||
989 + (dtopd(dentry)->state == CREATED) ||
990 + (dtopd(dentry)->state == DEL_REWRITTEN) ||
991 + (dtopd(dentry)->state == DELETED)) {
992 + hidden_sto_dentry = dtohd2(dentry);
993 + if(hidden_sto_dentry &&
994 + hidden_sto_dentry->d_op &&
995 + hidden_sto_dentry->d_op->d_hash) {
996 + err = hidden_sto_dentry->d_op->d_hash(hidden_sto_dentry, name);
1000 + /* state 2: build the hash for the base dentry */
1001 + if(dtopd(dentry)->state == UNMODIFIED) {
1002 + hidden_dentry = dtohd(dentry);
1003 + if(hidden_dentry &&
1004 + hidden_dentry->d_op &&
1005 + hidden_dentry->d_op->d_hash) {
1006 + err = hidden_dentry->d_op->d_hash(hidden_dentry, name);
1010 + /* state 6: build hash for the dentry that exists */
1011 + if(dtopd(dentry)->state == NON_EXISTANT) {
1012 + hidden_sto_dentry = dtohd2(dentry);
1013 + if(hidden_sto_dentry &&
1014 + hidden_sto_dentry->d_op &&
1015 + hidden_sto_dentry->d_op->d_hash) {
1016 + err = hidden_sto_dentry->d_op->d_hash(hidden_sto_dentry, name);
1019 + hidden_dentry = dtohd(dentry);
1020 + if(hidden_dentry &&
1021 + hidden_dentry->d_op &&
1022 + hidden_dentry->d_op->d_hash) {
1023 + err = hidden_dentry->d_op->d_hash(hidden_dentry, name);
1028 + printk(KERN_CRIT "mini_fo: d_hash: invalid state detected.\n");
1036 +mini_fo_d_compare(dentry_t *dentry, qstr_t *a, qstr_t *b)
1039 + dentry_t *hidden_dentry=NULL;
1041 + /* hidden_dentry = mini_fo_hidden_dentry(dentry); */
1042 + if(dtohd2(dentry))
1043 + hidden_dentry = dtohd2(dentry);
1044 + else if(dtohd(dentry))
1045 + hidden_dentry = dtohd(dentry);
1047 + if (hidden_dentry && hidden_dentry->d_op && hidden_dentry->d_op->d_compare) {
1048 + err = hidden_dentry->d_op->d_compare(hidden_dentry, a, b);
1050 + err = ((a->len != b->len) || memcmp(a->name, b->name, b->len));
1058 +mini_fo_d_delete(dentry_t *dentry)
1060 + dentry_t *hidden_dentry;
1061 + dentry_t *hidden_sto_dentry;
1064 + /* this could be a negative dentry, so check first */
1065 + if (!dtopd(dentry)) {
1066 + printk(KERN_CRIT "mini_fo_d_delete: negative dentry passed.\n");
1069 + hidden_dentry = dtohd(dentry);
1070 + hidden_sto_dentry = dtohd2(dentry);
1072 + if(hidden_dentry) {
1073 + if(hidden_dentry->d_op &&
1074 + hidden_dentry->d_op->d_delete) {
1075 + err = hidden_dentry->d_op->d_delete(hidden_dentry);
1078 + if(hidden_sto_dentry) {
1079 + if(hidden_sto_dentry->d_op &&
1080 + hidden_sto_dentry->d_op->d_delete) {
1081 + err = hidden_sto_dentry->d_op->d_delete(hidden_sto_dentry);
1091 +mini_fo_d_release(dentry_t *dentry)
1093 + dentry_t *hidden_dentry;
1094 + dentry_t *hidden_sto_dentry;
1097 + /* this could be a negative dentry, so check first */
1098 + if (!dtopd(dentry)) {
1099 + printk(KERN_CRIT "mini_fo_d_release: no private data.\n");
1102 + hidden_dentry = dtohd(dentry);
1103 + hidden_sto_dentry = dtohd2(dentry);
1105 + if(hidden_dentry) {
1106 + /* decrement hidden dentry's counter and free its inode */
1107 + dput(hidden_dentry);
1109 + if(hidden_sto_dentry) {
1110 + /* decrement hidden dentry's counter and free its inode */
1111 + dput(hidden_sto_dentry);
1114 + /* free private data (mini_fo_dentry_info) here */
1115 + kfree(dtopd(dentry));
1116 + __dtopd(dentry) = NULL; /* just to be safe */
1123 + * we don't really need mini_fo_d_iput, because dentry_iput will call iput() if
1124 + * mini_fo_d_iput is not defined. We left this implemented for ease of
1125 + * tracing/debugging.
1128 +mini_fo_d_iput(dentry_t *dentry, inode_t *inode)
1134 +struct dentry_operations mini_fo_dops = {
1135 + d_revalidate: mini_fo_d_revalidate,
1136 + d_hash: mini_fo_d_hash,
1137 + d_compare: mini_fo_d_compare,
1138 + d_release: mini_fo_d_release,
1139 + d_delete: mini_fo_d_delete,
1140 + d_iput: mini_fo_d_iput,
1142 diff -urN linux-2.6.21.1.old/fs/mini_fo/file.c linux-2.6.21.1.dev/fs/mini_fo/file.c
1143 --- linux-2.6.21.1.old/fs/mini_fo/file.c 1970-01-01 01:00:00.000000000 +0100
1144 +++ linux-2.6.21.1.dev/fs/mini_fo/file.c 2007-05-26 21:01:26.162330024 +0200
1147 + * Copyright (c) 1997-2003 Erez Zadok
1148 + * Copyright (c) 2001-2003 Stony Brook University
1150 + * For specific licensing information, see the COPYING file distributed with
1151 + * this package, or get one from ftp://ftp.filesystems.org/pub/fist/COPYING.
1153 + * This Copyright notice must be kept intact and distributed with all
1154 + * fistgen sources INCLUDING sources generated by fistgen.
1157 + * Copyright (C) 2004, 2005 Markus Klotzbuecher <mk@creamnet.de>
1159 + * This program is free software; you can redistribute it and/or
1160 + * modify it under the terms of the GNU General Public License
1161 + * as published by the Free Software Foundation; either version
1162 + * 2 of the License, or (at your option) any later version.
1169 +#ifdef HAVE_CONFIG_H
1170 +# include <config.h>
1174 +#include "mini_fo.h"
1175 +#define ROUND_UP(x) (((x)+sizeof(long)-1) & ~(sizeof(long)-1))
1177 +/*******************
1178 + * File Operations *
1179 + *******************/
1182 +mini_fo_llseek(file_t *file, loff_t offset, int origin)
1185 + file_t *hidden_file = NULL;
1187 + if(S_ISDIR(file->f_dentry->d_inode->i_mode)) {
1188 + /* Check if trying to llseek from a directory */
1192 + if (ftopd(file) != NULL) {
1193 + if(ftohf2(file)) {
1194 + hidden_file = ftohf2(file);
1196 + hidden_file = ftohf(file);
1200 + /* always set hidden position to this one */
1201 + hidden_file->f_pos = file->f_pos;
1203 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
1204 + memcpy(&(hidden_file->f_ra),
1206 + sizeof(struct file_ra_state));
1208 + if (file->f_reada) { /* update readahead information if needed */
1209 + hidden_file->f_reada = file->f_reada;
1210 + hidden_file->f_ramax = file->f_ramax;
1211 + hidden_file->f_raend = file->f_raend;
1212 + hidden_file->f_ralen = file->f_ralen;
1213 + hidden_file->f_rawin = file->f_rawin;
1216 + if (hidden_file->f_op && hidden_file->f_op->llseek)
1217 + err = hidden_file->f_op->llseek(hidden_file, offset, origin);
1219 + err = generic_file_llseek(hidden_file, offset, origin);
1224 + if (err != file->f_pos) {
1225 + file->f_pos = err;
1226 + // ION maybe this?
1227 + // file->f_pos = hidden_file->f_pos;
1228 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
1229 + file->f_reada = 0;
1231 + file->f_version++;
1239 +/* mk: fanout capable */
1241 +mini_fo_read(file_t *file, char *buf, size_t count, loff_t *ppos)
1243 + int err = -EINVAL;
1244 + file_t *hidden_file = NULL;
1245 + loff_t pos = *ppos;
1247 + if(S_ISDIR(file->f_dentry->d_inode->i_mode)) {
1248 + /* Check if trying to read from a directory */
1249 + /* printk(KERN_CRIT "mini_fo_read: ERROR: trying to read data from a directory.\n"); */
1254 + if (ftopd(file) != NULL) {
1255 + if(ftohf2(file)) {
1256 + hidden_file = ftohf2(file);
1258 + hidden_file = ftohf(file);
1262 + if (!hidden_file->f_op || !hidden_file->f_op->read)
1265 + err = hidden_file->f_op->read(hidden_file, buf, count, &pos);
1269 + /* atime should also be updated for reads of size zero or more */
1270 + fist_copy_attr_atime(file->f_dentry->d_inode,
1271 + hidden_file->f_dentry->d_inode);
1274 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
1277 + * because pread() does not have any way to tell us that it is
1278 + * our caller, then we don't know for sure if we have to update
1279 + * the file positions. This hack relies on read() having passed us
1280 + * the "real" pointer of its struct file's f_pos field.
1282 + if (ppos == &file->f_pos)
1283 + hidden_file->f_pos = *ppos = pos;
1284 + if (hidden_file->f_reada) { /* update readahead information if needed */
1285 + file->f_reada = hidden_file->f_reada;
1286 + file->f_ramax = hidden_file->f_ramax;
1287 + file->f_raend = hidden_file->f_raend;
1288 + file->f_ralen = hidden_file->f_ralen;
1289 + file->f_rawin = hidden_file->f_rawin;
1292 + memcpy(&(file->f_ra),&(hidden_file->f_ra),sizeof(struct file_ra_state));
1300 +/* this mini_fo_write() does not modify data pages! */
1302 +mini_fo_write(file_t *file, const char *buf, size_t count, loff_t *ppos)
1304 + int err = -EINVAL;
1305 + file_t *hidden_file = NULL;
1307 + inode_t *hidden_inode;
1308 + loff_t pos = *ppos;
1310 + /* mk: fan out: */
1311 + if (ftopd(file) != NULL) {
1312 + if(ftohf2(file)) {
1313 + hidden_file = ftohf2(file);
1315 + /* This is bad! We have no storage file to write to. This
1316 + * should never happen because if a file is opened for
1317 + * writing, a copy should have been made earlier.
1319 + printk(KERN_CRIT "mini_fo: write : ERROR, no storage file to write.\n");
1325 + inode = file->f_dentry->d_inode;
1326 + hidden_inode = itohi2(inode);
1327 + if(!hidden_inode) {
1328 + printk(KERN_CRIT "mini_fo: write: no sto inode found, not good.\n");
1332 + if (!hidden_file->f_op || !hidden_file->f_op->write)
1335 + /* adjust for append -- seek to the end of the file */
1336 + if (file->f_flags & O_APPEND)
1337 + pos = inode->i_size;
1339 + err = hidden_file->f_op->write(hidden_file, buf, count, &pos);
1342 + * copy ctime and mtime from lower layer attributes
1343 + * atime is unchanged for both layers
1346 + fist_copy_attr_times(inode, hidden_inode);
1349 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
1353 + * because pwrite() does not have any way to tell us that it is
1354 + * our caller, then we don't know for sure if we have to update
1355 + * the file positions. This hack relies on write() having passed us
1356 + * the "real" pointer of its struct file's f_pos field.
1358 + if (ppos == &file->f_pos)
1359 + hidden_file->f_pos = *ppos = pos;
1361 + /* update this inode's size */
1362 + if (pos > inode->i_size)
1363 + inode->i_size = pos;
1369 +/* Global variable to hold a file_t pointer.
1370 + * This serves to allow mini_fo_filldir function to know which file is
1371 + * beeing read, which is required for two reasons:
1373 + * - be able to call wol functions in order to avoid listing deleted
1375 + * - if we're reading a directory which is in state 1, we need to
1376 + * maintain a list (in mini_fo_filldir) of which files allready
1377 + * have been copied to userspace,to detect files existing in base
1378 + * and storage and not list them twice.
1380 +filldir_t mini_fo_filldir_orig;
1381 +file_t *mini_fo_filldir_file;
1383 +/* mainly copied from fs/readdir.c */
1385 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,18)
1386 +mini_fo_filldir(void * __buf, const char * name, int namlen, loff_t offset,
1387 + u64 ino, unsigned int d_type)
1389 +mini_fo_filldir(void * __buf, const char * name, int namlen, loff_t offset,
1390 + ino_t ino, unsigned int d_type)
1393 + struct getdents_callback * buf = (struct getdents_callback *) __buf;
1394 + file_t* file = mini_fo_filldir_file;
1396 + /* In theses states we filter meta files in storage (WOL) */
1397 + if(file && (dtopd(file->f_dentry)->state == MODIFIED ||
1398 + dtopd(file->f_dentry)->state == CREATED ||
1399 + dtopd(file->f_dentry)->state == DEL_REWRITTEN)) {
1401 + int tmp = strlen(META_FILENAME);
1402 + if(tmp == namlen) {
1403 + if(!strncmp(name, META_FILENAME, namlen))
1408 + /* check if we are merging the contents of storage and base */
1409 + if(file && dtopd(file->f_dentry)->state == MODIFIED) {
1410 + /* check if we are still reading storage contents, if
1411 + * yes, we just save the name of the file for duplicate
1412 + * checking later. */
1414 + if(!ftopd(file)->rd.sto_done) {
1415 + /* put file into ndl list */
1416 + if(ndl_add_entry(&ftopd(file)->rd, name, namlen))
1417 + printk(KERN_CRIT "mini_fo_filldir: Error adding to ndl.\n");
1419 + /* check if file has been deleted */
1420 + if(meta_check_d_entry(file->f_dentry, name, namlen))
1423 + /* do duplicate checking */
1424 + if(ndl_check_entry(&ftopd(file)->rd, name, namlen))
1429 + return mini_fo_filldir_orig(buf, name, namlen, offset, ino, d_type);
1434 +mini_fo_readdir(file_t *file, void *dirent, filldir_t filldir)
1436 + int err = 0;/* mk: ??? -ENOTDIR; */
1437 + file_t *hidden_file = NULL;
1438 + file_t *hidden_sto_file = NULL;
1440 + struct getdents_callback *buf;
1443 +#if defined(FIST_FILTER_NAME) || defined(FIST_FILTER_SCA)
1444 + struct mini_fo_getdents_callback buf;
1445 +#endif /* FIST_FILTER_NAME || FIST_FILTER_SCA */
1447 + buf = (struct getdents_callback *) dirent;
1448 + oldcount = buf->count;
1449 + inode = file->f_dentry->d_inode;
1450 + mini_fo_filldir_file = file;
1451 + mini_fo_filldir_orig = filldir;
1453 + ftopd(file)->rd.sto_done = 0;
1455 + if (ftopd(file) != NULL) {
1456 + if(ftohf2(file)) {
1457 + hidden_sto_file = ftohf2(file);
1458 + err = vfs_readdir(hidden_sto_file, mini_fo_filldir, dirent);
1459 + file->f_pos = hidden_sto_file->f_pos;
1461 + fist_copy_attr_atime(inode, hidden_sto_file->f_dentry->d_inode);
1462 + /* not finshed yet, we'll be called again */
1463 + if (buf->count != oldcount)
1467 + ftopd(file)->rd.sto_done = 1;
1470 + hidden_file = ftohf(file);
1471 + err = vfs_readdir(hidden_file, mini_fo_filldir, dirent);
1472 + file->f_pos = hidden_file->f_pos;
1474 + fist_copy_attr_atime(inode, hidden_file->f_dentry->d_inode);
1481 + * we need to check if all the directory data has been copied to userspace,
1482 + * or if we will be called again by userspace to complete the operation.
1484 + if(buf->count == oldcount) {
1485 + ndl_put_list(&ftopd(file)->rd);
1488 + /* unset this, safe */
1489 + mini_fo_filldir_file = NULL;
1494 +STATIC unsigned int
1495 +mini_fo_poll(file_t *file, poll_table *wait)
1497 + unsigned int mask = DEFAULT_POLLMASK;
1498 + file_t *hidden_file = NULL;
1500 + if (ftopd(file) != NULL) {
1501 + if(ftohf2(file)) {
1502 + hidden_file = ftohf2(file);
1504 + hidden_file = ftohf(file);
1508 + if (!hidden_file->f_op || !hidden_file->f_op->poll)
1511 + mask = hidden_file->f_op->poll(hidden_file, wait);
1517 +/* FIST-LITE special version of mmap */
1519 +mini_fo_mmap(file_t *file, vm_area_t *vma)
1522 + file_t *hidden_file = NULL;
1524 + /* fanout capability */
1525 + if (ftopd(file) != NULL) {
1526 + if(ftohf2(file)) {
1527 + hidden_file = ftohf2(file);
1529 + hidden_file = ftohf(file);
1533 + ASSERT(hidden_file != NULL);
1534 + ASSERT(hidden_file->f_op != NULL);
1535 + ASSERT(hidden_file->f_op->mmap != NULL);
1537 + vma->vm_file = hidden_file;
1538 + err = hidden_file->f_op->mmap(hidden_file, vma);
1539 + get_file(hidden_file); /* make sure it doesn't get freed on us */
1540 + fput(file); /* no need to keep extra ref on ours */
1548 +mini_fo_open(inode_t *inode, file_t *file)
1552 + file_t *hidden_file = NULL;
1553 + dentry_t *hidden_dentry = NULL;
1555 + /* fanout stuff */
1556 + file_t *hidden_sto_file = NULL;
1557 + dentry_t *hidden_sto_dentry = NULL;
1560 + kmalloc(sizeof(struct mini_fo_file_info), GFP_KERNEL);
1561 + if (!ftopd(file)) {
1566 + /* init the readdir_helper structure */
1567 + INIT_LIST_HEAD(&ftopd(file)->rd.ndl_list);
1568 + ftopd(file)->rd.ndl_size = 0;
1570 + /* In certain paths this could stay uninitalized and cause trouble */
1571 + ftohf(file) = NULL;
1572 + ftohf2(file) = NULL;
1573 + hidden_flags = file->f_flags;
1575 + /* create storage files? */
1576 + if(dtost(file->f_dentry) == UNMODIFIED) {
1577 + if(!IS_WRITE_FLAG(file->f_flags)) {
1578 + hidden_dentry = dtohd(file->f_dentry);
1579 + dget(hidden_dentry);
1580 + /* dentry_open will decrement mnt refcnt if err.
1581 + * otherwise fput() will do an mntput() for us upon file close. */
1582 + mntget(stopd(inode->i_sb)->hidden_mnt);
1583 + hidden_file = dentry_open(hidden_dentry,
1584 + stopd(inode->i_sb)->hidden_mnt,
1586 + if (IS_ERR(hidden_file)) {
1587 + err = PTR_ERR(hidden_file);
1588 + dput(hidden_dentry);
1591 + ftohf(file) = hidden_file; /* link two files */
1595 + if(S_ISDIR(file->f_dentry->d_inode->i_mode)) {
1596 + err = dir_unmod_to_mod(file->f_dentry);
1598 + err = nondir_unmod_to_mod(file->f_dentry, 1);
1601 + printk("mini_fo_open: ERROR creating storage file.\n");
1606 + hidden_sto_dentry = dtohd2(file->f_dentry);
1607 + dget(hidden_sto_dentry);
1609 + if(dtopd(file->f_dentry)->state == MODIFIED) {
1610 + /* Directorys are special, interpose on both lower level files */
1611 + if(S_ISDIR(itohi(inode)->i_mode)) {
1612 + /* check for invalid file types of lower level files */
1613 + if(!(S_ISDIR(itohi(inode)->i_mode) && S_ISDIR(itohi2(inode)->i_mode))) {
1614 + printk(KERN_CRIT "mini_fo_open: meta data corruption detected.\n");
1615 + dput(hidden_sto_dentry);
1620 + /* lower level directorys are ok, open the base file */
1621 + hidden_dentry = dtohd(file->f_dentry);
1622 + dget(hidden_dentry);
1624 + mntget(stopd(inode->i_sb)->hidden_mnt);
1625 + hidden_file = dentry_open(hidden_dentry,
1626 + stopd(inode->i_sb)->hidden_mnt,
1628 + if (IS_ERR(hidden_file)) {
1629 + err = PTR_ERR(hidden_file);
1630 + dput(hidden_dentry);
1631 + dput(hidden_sto_dentry);
1634 + ftohf(file) = hidden_file; /* link the two files */
1638 + if(!exists_in_storage(file->f_dentry)) {
1639 + printk(KERN_CRIT "mini_fo_open: invalid file state detected.\n");
1641 + dput(hidden_sto_dentry);
1643 + /* If the base file has been opened, we need to close it here */
1645 + if (hidden_file->f_op && hidden_file->f_op->flush)
1646 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,18)
1647 + hidden_file->f_op->flush(hidden_file, NULL);
1649 + hidden_file->f_op->flush(hidden_file);
1651 + dput(hidden_dentry);
1656 + /* ok, now we can safely open the storage file */
1657 + mntget(stopd(inode->i_sb)->hidden_mnt2);
1658 + hidden_sto_file = dentry_open(hidden_sto_dentry,
1659 + stopd(inode->i_sb)->hidden_mnt2,
1662 + /* dentry_open dputs the dentry if it fails */
1663 + if (IS_ERR(hidden_sto_file)) {
1664 + err = PTR_ERR(hidden_sto_file);
1665 + /* close base file if open */
1667 + if (hidden_file->f_op && hidden_file->f_op->flush)
1668 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,18)
1669 + hidden_file->f_op->flush(hidden_file, NULL);
1671 + hidden_file->f_op->flush(hidden_file);
1673 + dput(hidden_dentry);
1677 + ftohf2(file) = hidden_sto_file; /* link storage file */
1680 + if (err < 0 && ftopd(file)) {
1681 + kfree(ftopd(file));
1687 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,18)
1688 +mini_fo_flush(file_t *file, fl_owner_t id)
1690 +mini_fo_flush(file_t *file)
1693 + int err1 = 0; /* assume ok (see open.c:close_fp) */
1695 + file_t *hidden_file = NULL;
1697 + check_mini_fo_file(file);
1699 + /* mk: we don't do any state checking here, as its not worth the time.
1700 + * Just flush the lower level files if they exist.
1702 + if(ftopd(file) != NULL) {
1703 + if(ftohf(file) != NULL) {
1704 + hidden_file = ftohf(file);
1705 + if (hidden_file->f_op && hidden_file->f_op->flush)
1706 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,18)
1707 + err1 = hidden_file->f_op->flush(hidden_file, id);
1709 + err1 = hidden_file->f_op->flush(hidden_file);
1712 + if(ftohf2(file) != NULL) {
1713 + hidden_file = ftohf2(file);
1714 + if (hidden_file->f_op && hidden_file->f_op->flush)
1715 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,18)
1716 + err2 = hidden_file->f_op->flush(hidden_file, id);
1718 + err2 = hidden_file->f_op->flush(hidden_file);
1722 + return (err1 | err2);
1727 +mini_fo_release(inode_t *inode, file_t *file)
1730 + file_t *hidden_file = NULL;
1732 + if (ftopd(file) != NULL) {
1734 + hidden_file = ftohf(file);
1735 + fput(hidden_file);
1737 + if(ftohf2(file)) {
1738 + hidden_file = ftohf2(file);
1739 + fput(hidden_file);
1741 + kfree(ftopd(file));
1747 +mini_fo_fsync(file_t *file, dentry_t *dentry, int datasync)
1751 + file_t *hidden_file = NULL;
1752 + dentry_t *hidden_dentry;
1754 + check_mini_fo_file(file);
1756 + if ((hidden_file = ftohf(file)) != NULL) {
1757 + hidden_dentry = dtohd(dentry);
1758 + if (hidden_file->f_op && hidden_file->f_op->fsync) {
1759 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
1760 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
1762 + down(&hidden_dentry->d_inode->i_sem);
1764 + err1 = hidden_file->f_op->fsync(hidden_file, hidden_dentry, datasync);
1765 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
1766 + mutex_unlock(&hidden_dentry->d_inode->i_mutex);
1768 + up(&hidden_dentry->d_inode->i_sem);
1773 + if ((hidden_file = ftohf2(file)) != NULL) {
1774 + hidden_dentry = dtohd2(dentry);
1775 + if (hidden_file->f_op && hidden_file->f_op->fsync) {
1776 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
1777 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
1779 + down(&hidden_dentry->d_inode->i_sem);
1781 + err2 = hidden_file->f_op->fsync(hidden_file, hidden_dentry, datasync);
1782 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
1783 + mutex_unlock(&hidden_dentry->d_inode->i_mutex);
1785 + up(&hidden_dentry->d_inode->i_sem);
1793 + return (err1 || err2);
1798 +mini_fo_fasync(int fd, file_t *file, int flag)
1803 + file_t *hidden_file = NULL;
1805 + check_mini_fo_file(file);
1807 + if((hidden_file = ftohf(file)) != NULL) {
1808 + err1 = hidden_file->f_op->fasync(fd, hidden_file, flag);
1810 + if((hidden_file = ftohf2(file)) != NULL) {
1811 + err2 = hidden_file->f_op->fasync(fd, hidden_file, flag);
1814 + return (err1 || err2);
1819 +struct file_operations mini_fo_dir_fops =
1821 + read: generic_read_dir,
1822 + write: mini_fo_write,
1823 + readdir: mini_fo_readdir,
1824 + poll: mini_fo_poll,
1825 + /* ioctl: mini_fo_ioctl, */
1826 + mmap: mini_fo_mmap,
1827 + open: mini_fo_open,
1828 + flush: mini_fo_flush,
1829 + release: mini_fo_release,
1830 + fsync: mini_fo_fsync,
1831 + fasync: mini_fo_fasync,
1832 + /* not needed lock: mini_fo_lock, */
1833 + /* not needed: readv */
1834 + /* not needed: writev */
1835 + /* not implemented: sendpage */
1836 + /* not implemented: get_unmapped_area */
1839 +struct file_operations mini_fo_main_fops =
1841 + llseek: mini_fo_llseek,
1842 + read: mini_fo_read,
1843 + write: mini_fo_write,
1844 + readdir: mini_fo_readdir,
1845 + poll: mini_fo_poll,
1846 + /* ioctl: mini_fo_ioctl, */
1847 + mmap: mini_fo_mmap,
1848 + open: mini_fo_open,
1849 + flush: mini_fo_flush,
1850 + release: mini_fo_release,
1851 + fsync: mini_fo_fsync,
1852 + fasync: mini_fo_fasync,
1853 + /* not needed: lock: mini_fo_lock, */
1854 + /* not needed: readv */
1855 + /* not needed: writev */
1856 + /* not implemented: sendpage */
1857 + /* not implemented: get_unmapped_area */
1859 diff -urN linux-2.6.21.1.old/fs/mini_fo/fist.h linux-2.6.21.1.dev/fs/mini_fo/fist.h
1860 --- linux-2.6.21.1.old/fs/mini_fo/fist.h 1970-01-01 01:00:00.000000000 +0100
1861 +++ linux-2.6.21.1.dev/fs/mini_fo/fist.h 2007-05-26 21:01:26.162330024 +0200
1864 + * Copyright (c) 1997-2003 Erez Zadok
1865 + * Copyright (c) 2001-2003 Stony Brook University
1867 + * For specific licensing information, see the COPYING file distributed with
1868 + * this package, or get one from ftp://ftp.filesystems.org/pub/fist/COPYING.
1870 + * This Copyright notice must be kept intact and distributed with all
1871 + * fistgen sources INCLUDING sources generated by fistgen.
1874 + * Copyright (C) 2004, 2005 Markus Klotzbuecher <mk@creamnet.de>
1876 + * This program is free software; you can redistribute it and/or
1877 + * modify it under the terms of the GNU General Public License
1878 + * as published by the Free Software Foundation; either version
1879 + * 2 of the License, or (at your option) any later version.
1891 + * KERNEL ONLY CODE:
1894 +#include <linux/version.h>
1895 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,19)
1896 +#include <linux/autoconf.h>
1898 +#include <linux/config.h>
1900 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
1901 +#ifdef CONFIG_MODVERSIONS
1902 +# define MODVERSIONS
1903 +# include <linux/modversions.h>
1904 +#endif /* CONFIG_MODVERSIONS */
1905 +#endif /* KERNEL_VERSION < 2.6.0 */
1906 +#include <linux/sched.h>
1907 +#include <linux/kernel.h>
1908 +#include <linux/mm.h>
1909 +#include <linux/string.h>
1910 +#include <linux/stat.h>
1911 +#include <linux/errno.h>
1912 +#include <linux/wait.h>
1913 +#include <linux/limits.h>
1914 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
1915 +#include <linux/locks.h>
1917 +#include <linux/buffer_head.h>
1918 +#include <linux/pagemap.h>
1919 +#include <linux/namei.h>
1920 +#include <linux/module.h>
1921 +#include <linux/mount.h>
1922 +#include <linux/page-flags.h>
1923 +#include <linux/writeback.h>
1924 +#include <linux/statfs.h>
1926 +#include <linux/smp.h>
1927 +#include <linux/smp_lock.h>
1928 +#include <linux/file.h>
1929 +#include <linux/slab.h>
1930 +#include <linux/vmalloc.h>
1931 +#include <linux/poll.h>
1932 +#include <linux/list.h>
1933 +#include <linux/init.h>
1935 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,4,20)
1936 +#include <linux/xattr.h>
1939 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
1940 +#include <linux/security.h>
1943 +#include <linux/swap.h>
1945 +#include <asm/system.h>
1946 +/* #include <asm/segment.h> */
1947 +#include <asm/mman.h>
1948 +#include <linux/seq_file.h>
1954 +/* those mapped to ATTR_* were copied from linux/fs.h */
1955 +#define FA_MODE ATTR_MODE
1956 +#define FA_UID ATTR_UID
1957 +#define FA_GID ATTR_GID
1958 +#define FA_SIZE ATTR_SIZE
1959 +#define FA_ATIME ATTR_ATIME
1960 +#define FA_MTIME ATTR_MTIME
1961 +#define FA_CTIME ATTR_CTIME
1962 +#define FA_ATIME_SET ATTR_ATIME_SET
1963 +#define FA_MTIME_SET ATTR_MTIME_SET
1964 +#define FA_FORCE ATTR_FORCE
1965 +#define FA_ATTR_FLAGS ATTR_ATTR_FLAG
1967 +/* must be greater than all other ATTR_* flags! */
1968 +#define FA_NLINK 2048
1969 +#define FA_BLKSIZE 4096
1970 +#define FA_BLOCKS 8192
1971 +#define FA_TIMES (FA_ATIME|FA_MTIME|FA_CTIME)
1974 +/* macros to manage changes between kernels */
1975 +#define INODE_DATA(i) (&(i)->i_data)
1977 +#define MIN(x,y) ((x < y) ? (x) : (y))
1978 +#define MAX(x,y) ((x > y) ? (x) : (y))
1979 +#define MAXPATHLEN PATH_MAX
1981 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,4,5)
1982 +# define lookup_one_len(a,b,c) lookup_one(a,b)
1983 +#endif /* LINUX_VERSION_CODE < KERNEL_VERSION(2,4,5) */
1985 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,4,8)
1986 +# define generic_file_llseek default_llseek
1987 +#endif /* LINUX_VERSION_CODE < KERNEL_VERSION(2,4,8) */
1990 +# define SEEK_SET 0
1991 +#endif /* not SEEK_SET */
1994 +# define SEEK_CUR 1
1995 +#endif /* not SEEK_CUR */
1998 +# define SEEK_END 2
1999 +#endif /* not SEEK_END */
2001 +#ifndef DEFAULT_POLLMASK
2002 +# define DEFAULT_POLLMASK (POLLIN | POLLOUT | POLLRDNORM | POLLWRNORM)
2003 +#endif /* not DEFAULT_POLLMASK */
2005 +/* XXX: fix this so fistgen generates kfree() code directly */
2006 +#define kfree_s(a,b) kfree(a)
2011 +typedef struct dentry dentry_t;
2012 +typedef struct file file_t;
2013 +typedef struct inode inode_t;
2014 +typedef inode_t vnode_t;
2015 +typedef struct page page_t;
2016 +typedef struct qstr qstr_t;
2017 +typedef struct super_block super_block_t;
2018 +typedef super_block_t vfs_t;
2019 +typedef struct vm_area_struct vm_area_t;
2026 +#define FPPF(str,page) printk("PPF %s 0x%x/%d: Lck:%d Err:%d Ref:%d Upd:%d Other::%d:%d:%d:%d:\n", \
2029 + (int) page->index, \
2030 + (PageLocked(page) ? 1 : 0), \
2031 + (PageError(page) ? 1 : 0), \
2032 + (PageReferenced(page) ? 1 : 0), \
2033 + (Page_Uptodate(page) ? 1 : 0), \
2034 + (PageDecrAfter(page) ? 1 : 0), \
2035 + (PageSlab(page) ? 1 : 0), \
2036 + (PageSwapCache(page) ? 1 : 0), \
2037 + (PageReserved(page) ? 1 : 0) \
2039 +#define EZKDBG printk("EZK %s:%d:%s\n",__FILE__,__LINE__,__FUNCTION__)
2041 +# define EZKDBG1 printk("EZK %s:%d\n",__FILE__,__LINE__)
2046 +extern int fist_get_debug_value(void);
2047 +extern int fist_set_debug_value(int val);
2048 +#if 0 /* mini_fo doesn't need these */
2049 +extern void fist_dprint_internal(int level, char *str,...);
2050 +extern void fist_print_dentry(char *str, const dentry_t *dentry);
2051 +extern void fist_print_inode(char *str, const inode_t *inode);
2052 +extern void fist_print_file(char *str, const file_t *file);
2053 +extern void fist_print_buffer_flags(char *str, struct buffer_head *buffer);
2054 +extern void fist_print_page_flags(char *str, page_t *page);
2055 +extern void fist_print_page_bytes(char *str, page_t *page);
2056 +extern void fist_print_pte_flags(char *str, const page_t *page);
2057 +extern void fist_checkinode(inode_t *inode, char *msg);
2058 +extern void fist_print_sb(char *str, const super_block_t *sb);
2060 +/* §$% by mk: special debug functions */
2061 +extern void fist_mk_print_dentry(char *str, const dentry_t *dentry);
2062 +extern void fist_mk_print_inode(char *str, const inode_t *inode);
2064 +extern char *add_indent(void);
2065 +extern char *del_indent(void);
2066 +#endif/* mini_fo doesn't need these */
2070 +#define ASSERT(EX) \
2073 + printk(KERN_CRIT "ASSERTION FAILED: %s at %s:%d (%s)\n", #EX, \
2074 + __FILE__, __LINE__, __FUNCTION__); \
2075 + (*((char *)0))=0; \
2078 +/* same ASSERT, but tell me who was the caller of the function */
2079 +#define ASSERT2(EX) \
2082 + printk(KERN_CRIT "ASSERTION FAILED (caller): %s at %s:%d (%s)\n", #EX, \
2083 + file, line, func); \
2084 + (*((char *)0))=0; \
2088 +#if 0 /* mini_fo doesn't need these */
2089 +#define dprintk(format, args...) printk(KERN_DEBUG format, ##args)
2090 +#define fist_dprint(level, str, args...) fist_dprint_internal(level, KERN_DEBUG str, ## args)
2091 +#define print_entry_location() fist_dprint(4, "%sIN: %s %s:%d\n", add_indent(), __FUNCTION__, __FILE__, __LINE__)
2092 +#define print_exit_location() fist_dprint(4, "%s OUT: %s %s:%d\n", del_indent(), __FUNCTION__, __FILE__, __LINE__)
2093 +#define print_exit_status(status) fist_dprint(4, "%s OUT: %s %s:%d, STATUS: %d\n", del_indent(), __FUNCTION__, __FILE__, __LINE__, status)
2094 +#define print_exit_pointer(status) \
2096 + if (IS_ERR(status)) \
2097 + fist_dprint(4, "%s OUT: %s %s:%d, RESULT: %ld\n", del_indent(), __FUNCTION__, __FILE__, __LINE__, PTR_ERR(status)); \
2099 + fist_dprint(4, "%s OUT: %s %s:%d, RESULT: 0x%x\n", del_indent(), __FUNCTION__, __FILE__, __LINE__, PTR_ERR(status)); \
2101 +#endif/* mini_fo doesn't need these */
2103 +#endif /* __KERNEL__ */
2107 + * DEFINITIONS FOR USER AND KERNEL CODE:
2108 + * (Note: ioctl numbers 1--9 are reserved for fistgen, the rest
2109 + * are auto-generated automatically based on the user's .fist file.)
2111 +# define FIST_IOCTL_GET_DEBUG_VALUE _IOR(0x15, 1, int)
2112 +# define FIST_IOCTL_SET_DEBUG_VALUE _IOW(0x15, 2, int)
2114 +#endif /* not __FIST_H_ */
2115 diff -urN linux-2.6.21.1.old/fs/mini_fo/inode.c linux-2.6.21.1.dev/fs/mini_fo/inode.c
2116 --- linux-2.6.21.1.old/fs/mini_fo/inode.c 1970-01-01 01:00:00.000000000 +0100
2117 +++ linux-2.6.21.1.dev/fs/mini_fo/inode.c 2007-05-26 21:01:26.164329720 +0200
2120 + * Copyright (c) 1997-2003 Erez Zadok
2121 + * Copyright (c) 2001-2003 Stony Brook University
2123 + * For specific licensing information, see the COPYING file distributed with
2124 + * this package, or get one from ftp://ftp.filesystems.org/pub/fist/COPYING.
2126 + * This Copyright notice must be kept intact and distributed with all
2127 + * fistgen sources INCLUDING sources generated by fistgen.
2130 + * Copyright (C) 2004, 2005 Markus Klotzbuecher <mk@creamnet.de>
2132 + * This program is free software; you can redistribute it and/or
2133 + * modify it under the terms of the GNU General Public License
2134 + * as published by the Free Software Foundation; either version
2135 + * 2 of the License, or (at your option) any later version.
2142 +#ifdef HAVE_CONFIG_H
2143 +# include <config.h>
2147 +#include "mini_fo.h"
2150 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
2151 +mini_fo_create(inode_t *dir, dentry_t *dentry, int mode, struct nameidata *nd)
2153 +mini_fo_create(inode_t *dir, dentry_t *dentry, int mode)
2158 + check_mini_fo_dentry(dentry);
2160 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
2161 + err = create_sto_reg_file(dentry, mode, nd);
2163 + err = create_sto_reg_file(dentry, mode);
2165 + check_mini_fo_dentry(dentry);
2171 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
2172 +mini_fo_lookup(inode_t *dir, dentry_t *dentry, struct nameidata* nd)
2174 +mini_fo_lookup(inode_t *dir, dentry_t *dentry)
2178 + dentry_t *hidden_dir_dentry;
2179 + dentry_t *hidden_dentry = NULL;
2181 + dentry_t *hidden_sto_dir_dentry;
2182 + dentry_t *hidden_sto_dentry = NULL;
2184 + /* whiteout flag */
2186 + char *bpath = NULL;
2189 + unsigned int namelen;
2191 + /* Don't allow lookups of META-files */
2192 + namelen = strlen(META_FILENAME);
2193 + if(namelen == dentry->d_name.len) {
2194 + if(!strncmp(dentry->d_name.name, META_FILENAME, namelen)) {
2200 + hidden_dir_dentry = dtohd(dentry->d_parent);
2201 + hidden_sto_dir_dentry = dtohd2(dentry->d_parent);
2203 + name = dentry->d_name.name;
2204 + namelen = dentry->d_name.len;
2206 + /* must initialize dentry operations */
2207 + dentry->d_op = &mini_fo_dops;
2209 + /* setup the del_flag */
2210 + del_flag = __meta_check_d_entry(dir, name, namelen);
2211 + bpath = __meta_check_r_entry(dir, name, namelen);
2213 + /* perform the lookups of base and storage files:
2215 + * This caused some serious trouble, as a lookup_one_len passing
2216 + * a negative dentry oopses. Solution is to only do the lookup
2217 + * if the dentry is positive, else we set it to NULL
2218 + * More trouble, who said a *_dir_dentry can't be NULL?
2221 + /* Cross-Interposing (C), yeah! */
2222 + hidden_dentry = bpath_walk(dir->i_sb, bpath);
2223 + if(!hidden_dentry || !hidden_dentry->d_inode) {
2224 + printk(KERN_CRIT "mini_fo_lookup: bpath_walk failed.\n");
2229 + /* this can be set up safely without fear of spaghetti
2230 + * interposing as it is only used for copying times */
2231 + hidden_dir_dentry = hidden_dentry->d_parent;
2234 + else if(hidden_dir_dentry && hidden_dir_dentry->d_inode)
2236 + lookup_one_len(name, hidden_dir_dentry, namelen);
2238 + hidden_dentry = NULL;
2240 + if(hidden_sto_dir_dentry && hidden_sto_dir_dentry->d_inode)
2241 + hidden_sto_dentry =
2242 + lookup_one_len(name, hidden_sto_dir_dentry, namelen);
2244 + hidden_sto_dentry = NULL;
2246 + /* catch error in lookup */
2247 + if (IS_ERR(hidden_dentry) || IS_ERR(hidden_sto_dentry)) {
2248 + /* mk: we need to call dput on the dentry, whose
2249 + * lookup_one_len operation failed, in order to avoid
2250 + * unmount trouble.
2252 + if(IS_ERR(hidden_dentry)) {
2253 + printk(KERN_CRIT "mini_fo_lookup: ERR from base dentry, lookup failed.\n");
2254 + err = PTR_ERR(hidden_dentry);
2256 + dput(hidden_dentry);
2258 + if(IS_ERR(hidden_sto_dentry)) {
2259 + printk(KERN_CRIT "mini_fo_lookup: ERR from storage dentry, lookup failed.\n");
2260 + err = PTR_ERR(hidden_sto_dentry);
2262 + dput(hidden_sto_dentry);
2267 + /* allocate dentry private data */
2268 + __dtopd(dentry) = (struct mini_fo_dentry_info *)
2269 + kmalloc(sizeof(struct mini_fo_dentry_info), GFP_KERNEL);
2271 + if (!dtopd(dentry)) {
2276 + /* check for different states of the mini_fo file to be looked up. */
2278 + /* state 1, file has been modified */
2279 + if(hidden_dentry && hidden_sto_dentry &&
2280 + hidden_dentry->d_inode && hidden_sto_dentry->d_inode && !del_flag) {
2282 + /* update parent directory's atime */
2283 + fist_copy_attr_atime(dir, hidden_sto_dir_dentry->d_inode);
2285 + dtopd(dentry)->state = MODIFIED;
2286 + dtohd(dentry) = hidden_dentry;
2287 + dtohd2(dentry) = hidden_sto_dentry;
2289 + err = mini_fo_tri_interpose(hidden_dentry,
2290 + hidden_sto_dentry,
2291 + dentry, dir->i_sb, 1);
2293 + printk(KERN_CRIT "mini_fo_lookup: error interposing (state1).\n");
2298 + /* state 2, file is unmodified */
2299 + if(hidden_dentry && hidden_dentry->d_inode && !del_flag) {
2301 + fist_copy_attr_atime(dir, hidden_dir_dentry->d_inode);
2303 + dtopd(dentry)->state = UNMODIFIED;
2304 + dtohd(dentry) = hidden_dentry;
2305 + dtohd2(dentry) = hidden_sto_dentry; /* could be negative */
2307 + err = mini_fo_tri_interpose(hidden_dentry,
2308 + hidden_sto_dentry,
2309 + dentry, dir->i_sb, 1);
2311 + printk(KERN_CRIT "mini_fo_lookup: error interposing (state2).\n");
2316 + /* state 3, file has been newly created */
2317 + if(hidden_sto_dentry && hidden_sto_dentry->d_inode && !del_flag) {
2319 + fist_copy_attr_atime(dir, hidden_sto_dir_dentry->d_inode);
2320 + dtopd(dentry)->state = CREATED;
2321 + dtohd(dentry) = hidden_dentry; /* could be negative */
2322 + dtohd2(dentry) = hidden_sto_dentry;
2324 + err = mini_fo_tri_interpose(hidden_dentry,
2325 + hidden_sto_dentry,
2326 + dentry, dir->i_sb, 1);
2328 + printk(KERN_CRIT "mini_fo_lookup: error interposing (state3).\n");
2334 + /* state 4, file has deleted and created again. */
2335 + if(hidden_dentry && hidden_sto_dentry &&
2336 + hidden_dentry->d_inode &&
2337 + hidden_sto_dentry->d_inode && del_flag) {
2339 + fist_copy_attr_atime(dir, hidden_sto_dir_dentry->d_inode);
2340 + dtopd(dentry)->state = DEL_REWRITTEN;
2341 + dtohd(dentry) = NULL;
2342 + dtohd2(dentry) = hidden_sto_dentry;
2344 + err = mini_fo_tri_interpose(NULL,
2345 + hidden_sto_dentry,
2346 + dentry, dir->i_sb, 1);
2348 + printk(KERN_CRIT "mini_fo_lookup: error interposing (state4).\n");
2351 + /* We will never need this dentry again, as the file has been
2352 + * deleted from base */
2353 + dput(hidden_dentry);
2356 + /* state 5, file has been deleted in base */
2357 + if(hidden_dentry && hidden_sto_dentry &&
2358 + hidden_dentry->d_inode &&
2359 + !hidden_sto_dentry->d_inode && del_flag) {
2361 + /* check which parents atime we need for updating */
2362 + if(hidden_sto_dir_dentry->d_inode)
2363 + fist_copy_attr_atime(dir,
2364 + hidden_sto_dir_dentry->d_inode);
2366 + fist_copy_attr_atime(dir,
2367 + hidden_dir_dentry->d_inode);
2369 + dtopd(dentry)->state = DELETED;
2370 + dtohd(dentry) = NULL;
2371 + dtohd2(dentry) = hidden_sto_dentry;
2373 + /* add negative dentry to dcache to speed up lookups */
2374 + d_add(dentry, NULL);
2375 + dput(hidden_dentry);
2378 + /* state 6, file does not exist */
2379 + if(((hidden_dentry && !hidden_dentry->d_inode) ||
2380 + (hidden_sto_dentry && !hidden_sto_dentry->d_inode)) && !del_flag)
2382 + /* check which parents atime we need for updating */
2383 + if(hidden_sto_dir_dentry && hidden_sto_dir_dentry->d_inode)
2384 + fist_copy_attr_atime(dir, hidden_sto_dir_dentry->d_inode);
2386 + fist_copy_attr_atime(dir, hidden_dir_dentry->d_inode);
2388 + dtopd(dentry)->state = NON_EXISTANT;
2389 + dtohd(dentry) = hidden_dentry;
2390 + dtohd2(dentry) = hidden_sto_dentry;
2391 + d_add(dentry, NULL);
2395 + /* if we get to here, were in an invalid state. bad. */
2396 + printk(KERN_CRIT "mini_fo_lookup: ERROR, meta data corruption detected.\n");
2398 + /* end state checking */
2400 + d_drop(dentry); /* so that our bad dentry will get destroyed */
2401 + kfree(dtopd(dentry));
2402 + __dtopd(dentry) = NULL; /* be safe */
2406 + dput(hidden_dentry);
2407 + if(hidden_sto_dentry)
2408 + dput(hidden_sto_dentry); /* drops usage count and marks for release */
2411 + /* initalize wol if file exists and is directory */
2412 + if(dentry->d_inode) {
2413 + if(S_ISDIR(dentry->d_inode->i_mode)) {
2414 + itopd(dentry->d_inode)->deleted_list_size = -1;
2415 + itopd(dentry->d_inode)->renamed_list_size = -1;
2416 + meta_build_lists(dentry);
2419 + return ERR_PTR(err);
2424 +mini_fo_link(dentry_t *old_dentry, inode_t *dir, dentry_t *new_dentry)
2427 + dentry_t *hidden_old_dentry;
2428 + dentry_t *hidden_new_dentry;
2429 + dentry_t *hidden_dir_dentry;
2432 + check_mini_fo_dentry(old_dentry);
2433 + check_mini_fo_dentry(new_dentry);
2434 + check_mini_fo_inode(dir);
2436 + /* no links to directorys and existing targets target allowed */
2437 + if(S_ISDIR(old_dentry->d_inode->i_mode) ||
2438 + is_mini_fo_existant(new_dentry)) {
2443 + /* bring it directly from unmod to del_rew */
2444 + if(dtost(old_dentry) == UNMODIFIED) {
2445 + err = nondir_unmod_to_mod(old_dentry, 1);
2450 + err = meta_add_d_entry(old_dentry->d_parent,
2451 + old_dentry->d_name.name,
2452 + old_dentry->d_name.len);
2457 + dput(dtohd(old_dentry));
2458 + dtohd(old_dentry) = NULL;
2459 + dtost(old_dentry) = DEL_REWRITTEN;
2462 + err = get_neg_sto_dentry(new_dentry);
2468 + hidden_old_dentry = dtohd2(old_dentry);
2469 + hidden_new_dentry = dtohd2(new_dentry);
2471 + dget(hidden_old_dentry);
2472 + dget(hidden_new_dentry);
2474 + /* was: hidden_dir_dentry = lock_parent(hidden_new_dentry); */
2475 + hidden_dir_dentry = dget(hidden_new_dentry->d_parent);
2476 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2477 + mutex_lock(&hidden_dir_dentry->d_inode->i_mutex);
2479 + down(&hidden_dir_dentry->d_inode->i_sem);
2482 + err = vfs_link(hidden_old_dentry,
2483 + hidden_dir_dentry->d_inode,
2484 + hidden_new_dentry);
2485 + if (err || !hidden_new_dentry->d_inode)
2488 + dtost(new_dentry) = CREATED;
2489 + err = mini_fo_tri_interpose(NULL, hidden_new_dentry, new_dentry, dir->i_sb, 0);
2493 + fist_copy_attr_timesizes(dir, hidden_new_dentry->d_inode);
2494 + /* propagate number of hard-links */
2495 + old_dentry->d_inode->i_nlink = itohi2(old_dentry->d_inode)->i_nlink;
2498 + /* was: unlock_dir(hidden_dir_dentry); */
2499 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2500 + mutex_unlock(&hidden_dir_dentry->d_inode->i_mutex);
2502 + up(&hidden_dir_dentry->d_inode->i_sem);
2504 + dput(hidden_dir_dentry);
2506 + dput(hidden_new_dentry);
2507 + dput(hidden_old_dentry);
2508 + if (!new_dentry->d_inode)
2509 + d_drop(new_dentry);
2517 +mini_fo_unlink(inode_t *dir, dentry_t *dentry)
2522 + if(dtopd(dentry)->state == MODIFIED) {
2523 + err = nondir_mod_to_del(dentry);
2526 + else if(dtopd(dentry)->state == UNMODIFIED) {
2527 + err = nondir_unmod_to_del(dentry);
2530 + else if(dtopd(dentry)->state == CREATED) {
2531 + err = nondir_creat_to_del(dentry);
2534 + else if(dtopd(dentry)->state == DEL_REWRITTEN) {
2535 + err = nondir_del_rew_to_del(dentry);
2539 + printk(KERN_CRIT "mini_fo_unlink: ERROR, invalid state detected.\n");
2542 + fist_copy_attr_times(dir, itohi2(dentry->d_parent->d_inode));
2545 + /* is this causing my pain? d_delete(dentry); */
2555 +mini_fo_symlink(inode_t *dir, dentry_t *dentry, const char *symname)
2558 + dentry_t *hidden_sto_dentry;
2559 + dentry_t *hidden_sto_dir_dentry;
2560 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
2564 + /* Fail if the symlink file exists */
2565 + if(!(dtost(dentry) == DELETED ||
2566 + dtost(dentry) == NON_EXISTANT)) {
2571 + err = get_neg_sto_dentry(dentry);
2576 + hidden_sto_dentry = dtohd2(dentry);
2578 + dget(hidden_sto_dentry);
2579 + /* was: hidden_sto_dir_dentry = lock_parent(hidden_sto_dentry); */
2580 + hidden_sto_dir_dentry = dget(hidden_sto_dentry->d_parent);
2581 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2582 + mutex_lock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2584 + down(&hidden_sto_dir_dentry->d_inode->i_sem);
2587 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
2589 + err = vfs_symlink(hidden_sto_dir_dentry->d_inode,
2590 + hidden_sto_dentry, symname, mode);
2592 + err = vfs_symlink(hidden_sto_dir_dentry->d_inode,
2593 + hidden_sto_dentry,
2596 + if (err || !hidden_sto_dentry->d_inode)
2599 + if(dtost(dentry) == DELETED) {
2600 + dtost(dentry) = DEL_REWRITTEN;
2601 + err = mini_fo_tri_interpose(NULL, hidden_sto_dentry, dentry, dir->i_sb, 0);
2604 + } else if(dtost(dentry) == NON_EXISTANT) {
2605 + dtost(dentry) = CREATED;
2606 + err = mini_fo_tri_interpose(dtohd(dentry), hidden_sto_dentry, dentry, dir->i_sb, 0);
2610 + fist_copy_attr_timesizes(dir, hidden_sto_dir_dentry->d_inode);
2613 + /* was: unlock_dir(hidden_sto_dir_dentry); */
2614 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2615 + mutex_unlock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2617 + up(&hidden_sto_dir_dentry->d_inode->i_sem);
2619 + dput(hidden_sto_dir_dentry);
2621 + dput(hidden_sto_dentry);
2622 + if (!dentry->d_inode)
2629 +mini_fo_mkdir(inode_t *dir, dentry_t *dentry, int mode)
2633 + err = create_sto_dir(dentry, mode);
2635 + check_mini_fo_dentry(dentry);
2642 +mini_fo_rmdir(inode_t *dir, dentry_t *dentry)
2646 + dentry_t *hidden_sto_dentry;
2647 + dentry_t *hidden_sto_dir_dentry;
2648 + dentry_t *meta_dentry;
2649 + inode_t *hidden_sto_dir = NULL;
2651 + check_mini_fo_dentry(dentry);
2652 + check_mini_fo_inode(dir);
2655 + if(dtopd(dentry)->state == MODIFIED) {
2656 + /* XXX: disabled, because it does not bother to check files on
2657 + * the original filesystem - just a hack, but better than simply
2658 + * removing it without testing */
2662 + hidden_sto_dir = itohi2(dir);
2663 + hidden_sto_dentry = dtohd2(dentry);
2665 + /* was:hidden_sto_dir_dentry = lock_parent(hidden_sto_dentry); */
2666 + hidden_sto_dir_dentry = dget(hidden_sto_dentry->d_parent);
2667 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2668 + mutex_lock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2670 + down(&hidden_sto_dir_dentry->d_inode->i_sem);
2673 + /* avoid destroying the hidden inode if the file is in use */
2674 + dget(hidden_sto_dentry);
2676 + /* Delete an old WOL file contained in the storage dir */
2677 + meta_dentry = lookup_one_len(META_FILENAME,
2678 + hidden_sto_dentry,
2679 + strlen(META_FILENAME));
2680 + if(meta_dentry->d_inode) {
2681 + err = vfs_unlink(hidden_sto_dentry->d_inode, meta_dentry);
2682 + dput(meta_dentry);
2684 + d_delete(meta_dentry);
2687 + err = vfs_rmdir(hidden_sto_dir, hidden_sto_dentry);
2688 + dput(hidden_sto_dentry);
2690 + d_delete(hidden_sto_dentry);
2692 + /* propagate number of hard-links */
2693 + dentry->d_inode->i_nlink = itohi2(dentry->d_inode)->i_nlink;
2695 + dput(dtohd(dentry));
2697 + dtohd(dentry) = NULL;
2698 + dtopd(dentry)->state = DELETED;
2700 + /* carefull with R files */
2701 + if( __meta_is_r_entry(dir,
2702 + dentry->d_name.name,
2703 + dentry->d_name.len) == 1) {
2704 + err = meta_remove_r_entry(dentry->d_parent,
2705 + dentry->d_name.name,
2706 + dentry->d_name.len);
2708 + printk(KERN_CRIT "mini_fo: rmdir: meta_remove_r_entry failed.\n");
2713 + /* ok, add deleted file to META */
2714 + meta_add_d_entry(dentry->d_parent,
2715 + dentry->d_name.name,
2716 + dentry->d_name.len);
2718 + /* was: unlock_dir(hidden_sto_dir_dentry); */
2719 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2720 + mutex_unlock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2722 + up(&hidden_sto_dir_dentry->d_inode->i_sem);
2724 + dput(hidden_sto_dir_dentry);
2727 + else if(dtopd(dentry)->state == UNMODIFIED) {
2728 + /* XXX: simply adding it to the delete list here is fscking dangerous!
2729 + * as a temporary hack, i will disable rmdir on unmodified directories
2735 + err = get_neg_sto_dentry(dentry);
2741 + /* dput base dentry, this will relase the inode and free the
2742 + * dentry, as we will never need it again. */
2743 + dput(dtohd(dentry));
2744 + dtohd(dentry) = NULL;
2745 + dtopd(dentry)->state = DELETED;
2747 + /* add deleted file to META-file */
2748 + meta_add_d_entry(dentry->d_parent,
2749 + dentry->d_name.name,
2750 + dentry->d_name.len);
2753 + else if(dtopd(dentry)->state == CREATED) {
2754 + hidden_sto_dir = itohi2(dir);
2755 + hidden_sto_dentry = dtohd2(dentry);
2757 + /* was: hidden_sto_dir_dentry = lock_parent(hidden_sto_dentry);*/
2758 + hidden_sto_dir_dentry = dget(hidden_sto_dentry->d_parent);
2760 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2761 + mutex_lock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2763 + down(&hidden_sto_dir_dentry->d_inode->i_sem);
2766 + /* avoid destroying the hidden inode if the file is in use */
2767 + dget(hidden_sto_dentry);
2769 + /* Delete an old WOL file contained in the storage dir */
2770 + meta_dentry = lookup_one_len(META_FILENAME,
2771 + hidden_sto_dentry,
2772 + strlen(META_FILENAME));
2773 + if(meta_dentry->d_inode) {
2774 + /* is this necessary? dget(meta_dentry); */
2775 + err = vfs_unlink(hidden_sto_dentry->d_inode,
2777 + dput(meta_dentry);
2779 + d_delete(meta_dentry);
2782 + err = vfs_rmdir(hidden_sto_dir, hidden_sto_dentry);
2783 + dput(hidden_sto_dentry);
2785 + d_delete(hidden_sto_dentry);
2787 + /* propagate number of hard-links */
2788 + dentry->d_inode->i_nlink = itohi2(dentry->d_inode)->i_nlink;
2789 + dtopd(dentry)->state = NON_EXISTANT;
2791 + /* was: unlock_dir(hidden_sto_dir_dentry); */
2792 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2793 + mutex_unlock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2795 + up(&hidden_sto_dir_dentry->d_inode->i_sem);
2797 + dput(hidden_sto_dir_dentry);
2801 + else if(dtopd(dentry)->state == DEL_REWRITTEN) {
2802 + hidden_sto_dir = itohi2(dir);
2803 + hidden_sto_dentry = dtohd2(dentry);
2805 + /* was: hidden_sto_dir_dentry = lock_parent(hidden_sto_dentry);*/
2806 + hidden_sto_dir_dentry = dget(hidden_sto_dentry->d_parent);
2808 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2809 + mutex_lock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2811 + down(&hidden_sto_dir_dentry->d_inode->i_sem);
2814 + /* avoid destroying the hidden inode if the file is in use */
2815 + dget(hidden_sto_dentry);
2817 + /* Delete an old WOL file contained in the storage dir */
2818 + meta_dentry = lookup_one_len(META_FILENAME,
2819 + hidden_sto_dentry,
2820 + strlen(META_FILENAME));
2821 + if(meta_dentry->d_inode) {
2822 + /* is this necessary? dget(meta_dentry); */
2823 + err = vfs_unlink(hidden_sto_dentry->d_inode,
2825 + dput(meta_dentry);
2827 + d_delete(meta_dentry);
2830 + err = vfs_rmdir(hidden_sto_dir, hidden_sto_dentry);
2831 + dput(hidden_sto_dentry);
2833 + d_delete(hidden_sto_dentry);
2835 + /* propagate number of hard-links */
2836 + dentry->d_inode->i_nlink = itohi2(dentry->d_inode)->i_nlink;
2837 + dtopd(dentry)->state = DELETED;
2838 + /* was: unlock_dir(hidden_sto_dir_dentry); */
2840 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
2841 + mutex_unlock(&hidden_sto_dir_dentry->d_inode->i_mutex);
2843 + up(&hidden_sto_dir_dentry->d_inode->i_sem);
2845 + dput(hidden_sto_dir_dentry);
2849 + printk(KERN_CRIT "mini_fo_rmdir: ERROR, invalid state detected.\n");
2856 + fist_copy_attr_times(dir, itohi2(dentry->d_parent->d_inode));
2864 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
2865 +mini_fo_mknod(inode_t *dir, dentry_t *dentry, int mode, dev_t dev)
2867 +mini_fo_mknod(inode_t *dir, dentry_t *dentry, int mode, int dev)
2872 + check_mini_fo_dentry(dentry);
2874 + err = create_sto_nod(dentry, mode, dev);
2876 + printk(KERN_CRIT "mini_fo_mknod: creating sto nod failed.\n");
2880 + check_mini_fo_dentry(dentry);
2886 +mini_fo_rename(inode_t *old_dir, dentry_t *old_dentry,
2887 + inode_t *new_dir, dentry_t *new_dentry)
2890 + if(S_ISDIR(old_dentry->d_inode->i_mode))
2891 + return rename_directory(old_dir, old_dentry, new_dir, new_dentry);
2892 + return rename_nondir(old_dir, old_dentry, new_dir, new_dentry);
2896 +int rename_directory(inode_t *old_dir, dentry_t *old_dentry,
2897 + inode_t *new_dir, dentry_t *new_dentry)
2899 + int err, bpath_len;
2902 + dentry_t *hidden_old_dentry;
2903 + dentry_t *hidden_new_dentry;
2904 + dentry_t *hidden_old_dir_dentry;
2905 + dentry_t *hidden_new_dir_dentry;
2911 + /* this is a test, chuck out if it works */
2912 + if(!(dtopd(new_dentry)->state == DELETED ||
2913 + dtopd(new_dentry)->state == NON_EXISTANT)) {
2914 + printk(KERN_CRIT "mini_fo: rename_directory: \
2915 + uh, ah, new_dentry not negative.\n");
2919 + /* state = UNMODIFIED */
2920 + if(dtopd(old_dentry)->state == UNMODIFIED) {
2921 + err = dir_unmod_to_mod(old_dentry);
2926 + /* state = MODIFIED */
2927 + if(dtopd(old_dentry)->state == MODIFIED) {
2928 + bpath = meta_check_r_entry(old_dentry->d_parent,
2929 + old_dentry->d_name.name,
2930 + old_dentry->d_name.len);
2932 + err = meta_remove_r_entry(old_dentry->d_parent,
2933 + old_dentry->d_name.name,
2934 + old_dentry->d_name.len);
2936 + printk(KERN_CRIT "mini_fo: rename_directory:\
2937 + meta_remove_r_entry \
2941 + err = meta_add_r_entry(new_dentry->d_parent,
2944 + new_dentry->d_name.name,
2945 + new_dentry->d_name.len);
2948 + else {/* wol it */
2949 + err = meta_add_d_entry(old_dentry->d_parent,
2950 + old_dentry->d_name.name,
2951 + old_dentry->d_name.len);
2954 + /* put it on rename list */
2955 + err = get_mini_fo_bpath(old_dentry,
2960 + err = meta_add_r_entry(new_dentry->d_parent,
2962 + new_dentry->d_name.name,
2963 + new_dentry->d_name.len);
2967 + /* no state change, MODIFIED stays MODIFIED */
2969 + /* state = CREATED */
2970 + if(dtopd(old_dentry)->state == CREATED ||
2971 + dtopd(old_dentry)->state == DEL_REWRITTEN) {
2972 + if(dtohd(old_dentry))
2973 + dput(dtohd(old_dentry));
2975 + if(dtopd(new_dentry)->state == DELETED) {
2976 + dtopd(old_dentry)->state = DEL_REWRITTEN;
2977 + dtohd(old_dentry) = NULL;
2979 + else if(dtopd(new_dentry)->state == NON_EXISTANT) {
2980 + dtopd(old_dentry)->state = CREATED;
2981 + /* steal new dentry's neg. base dentry */
2982 + dtohd(old_dentry) = dtohd(new_dentry);
2983 + dtohd(new_dentry) = NULL;
2986 + if(dtopd(new_dentry)->state == UNMODIFIED ||
2987 + dtopd(new_dentry)->state == NON_EXISTANT) {
2988 + err = get_neg_sto_dentry(new_dentry);
2993 + /* now move sto file */
2994 + hidden_old_dentry = dtohd2(old_dentry);
2995 + hidden_new_dentry = dtohd2(new_dentry);
2997 + dget(hidden_old_dentry);
2998 + dget(hidden_new_dentry);
3000 + hidden_old_dir_dentry = dget(hidden_old_dentry->d_parent);
3001 + hidden_new_dir_dentry = dget(hidden_new_dentry->d_parent);
3002 + double_lock(hidden_old_dir_dentry, hidden_new_dir_dentry);
3004 + err = vfs_rename(hidden_old_dir_dentry->d_inode, hidden_old_dentry,
3005 + hidden_new_dir_dentry->d_inode, hidden_new_dentry);
3009 + fist_copy_attr_all(new_dir, hidden_new_dir_dentry->d_inode);
3010 + if (new_dir != old_dir)
3011 + fist_copy_attr_all(old_dir,
3012 + hidden_old_dir_dentry->d_inode);
3015 + /* double_unlock will dput the new/old parent dentries
3016 + * whose refcnts were incremented via get_parent above. */
3017 + double_unlock(hidden_old_dir_dentry, hidden_new_dir_dentry);
3018 + dput(hidden_new_dentry);
3019 + dput(hidden_old_dentry);
3025 +int rename_nondir(inode_t *old_dir, dentry_t *old_dentry,
3026 + inode_t *new_dir, dentry_t *new_dentry)
3030 + check_mini_fo_dentry(old_dentry);
3031 + check_mini_fo_dentry(new_dentry);
3032 + check_mini_fo_inode(old_dir);
3033 + check_mini_fo_inode(new_dir);
3035 + /* state: UNMODIFIED */
3036 + if(dtost(old_dentry) == UNMODIFIED) {
3037 + err = nondir_unmod_to_mod(old_dentry, 1);
3044 + /* the easy states */
3045 + if(exists_in_storage(old_dentry)) {
3047 + dentry_t *hidden_old_dentry;
3048 + dentry_t *hidden_new_dentry;
3049 + dentry_t *hidden_old_dir_dentry;
3050 + dentry_t *hidden_new_dir_dentry;
3052 + /* if old file is MODIFIED, add it to the deleted_list */
3053 + if(dtopd(old_dentry)->state == MODIFIED) {
3054 + meta_add_d_entry(old_dentry->d_parent,
3055 + old_dentry->d_name.name,
3056 + old_dentry->d_name.len);
3058 + dput(dtohd(old_dentry));
3060 + /* if old file is CREATED, we only release the base dentry */
3061 + if(dtopd(old_dentry)->state == CREATED) {
3062 + if(dtohd(old_dentry))
3063 + dput(dtohd(old_dentry));
3066 + /* now setup the new states (depends on new_dentry state) */
3067 + /* new dentry state = MODIFIED */
3068 + if(dtopd(new_dentry)->state == MODIFIED) {
3069 + meta_add_d_entry(new_dentry->d_parent,
3070 + new_dentry->d_name.name,
3071 + new_dentry->d_name.len);
3073 + /* new dentry will be d_put'ed later by the vfs
3074 + * so don't do it here
3075 + * dput(dtohd(new_dentry));
3077 + dtohd(old_dentry) = NULL;
3078 + dtopd(old_dentry)->state = DEL_REWRITTEN;
3080 + /* new dentry state = UNMODIFIED */
3081 + else if(dtopd(new_dentry)->state == UNMODIFIED) {
3082 + if(get_neg_sto_dentry(new_dentry))
3085 + meta_add_d_entry(new_dentry->d_parent,
3086 + new_dentry->d_name.name,
3087 + new_dentry->d_name.len);
3089 + /* is this right??? */
3090 + /*dput(dtohd(new_dentry));*/
3091 + dtohd(old_dentry) = NULL;
3092 + dtopd(old_dentry)->state = DEL_REWRITTEN;
3094 + /* new dentry state = CREATED */
3095 + else if(dtopd(new_dentry)->state == CREATED) {
3096 + /* we keep the neg. base dentry (if exists) */
3097 + dtohd(old_dentry) = dtohd(new_dentry);
3098 + /* ...and set it to Null, or we'll get
3099 + * dcache.c:345 if it gets dput twice... */
3100 + dtohd(new_dentry) = NULL;
3101 + dtopd(old_dentry)->state = CREATED;
3103 + /* new dentry state = NON_EXISTANT */
3104 + else if(dtopd(new_dentry)->state == NON_EXISTANT) {
3105 + if(get_neg_sto_dentry(new_dentry))
3108 + /* we keep the neg. base dentry (if exists) */
3109 + dtohd(old_dentry) = dtohd(new_dentry);
3110 + /* ...and set it to Null, or we'll get
3111 + * Dr. dcache.c:345 if it gets dput twice... */
3112 + dtohd(new_dentry) = NULL;
3113 + dtopd(old_dentry)->state = CREATED;
3115 + /* new dentry state = DEL_REWRITTEN or DELETED */
3116 + else if(dtopd(new_dentry)->state == DEL_REWRITTEN ||
3117 + dtopd(new_dentry)->state == DELETED) {
3118 + dtohd(old_dentry) = NULL;
3119 + dtopd(old_dentry)->state = DEL_REWRITTEN;
3121 + else { /* not possible, uhh, ahh */
3123 + "mini_fo: rename_reg_file: invalid state detected [1].\n");
3127 + /* now we definitely have a sto file */
3128 + hidden_old_dentry = dtohd2(old_dentry);
3129 + hidden_new_dentry = dtohd2(new_dentry);
3131 + dget(hidden_old_dentry);
3132 + dget(hidden_new_dentry);
3134 + hidden_old_dir_dentry = dget(hidden_old_dentry->d_parent);
3135 + hidden_new_dir_dentry = dget(hidden_new_dentry->d_parent);
3136 + double_lock(hidden_old_dir_dentry, hidden_new_dir_dentry);
3138 + err = vfs_rename(hidden_old_dir_dentry->d_inode,
3139 + hidden_old_dentry,
3140 + hidden_new_dir_dentry->d_inode,
3141 + hidden_new_dentry);
3145 + fist_copy_attr_all(new_dir, hidden_new_dir_dentry->d_inode);
3146 + if (new_dir != old_dir)
3147 + fist_copy_attr_all(old_dir, hidden_old_dir_dentry->d_inode);
3150 + /* double_unlock will dput the new/old parent dentries
3151 + * whose refcnts were incremented via get_parent above.
3153 + double_unlock(hidden_old_dir_dentry, hidden_new_dir_dentry);
3154 + dput(hidden_new_dentry);
3155 + dput(hidden_old_dentry);
3159 + else { /* invalid state */
3160 + printk(KERN_CRIT "mini_fo: rename_reg_file: ERROR: invalid state detected [2].\n");
3167 +mini_fo_readlink(dentry_t *dentry, char *buf, int bufsiz)
3170 + dentry_t *hidden_dentry = NULL;
3172 + if(dtohd2(dentry) && dtohd2(dentry)->d_inode) {
3173 + hidden_dentry = dtohd2(dentry);
3174 + } else if(dtohd(dentry) && dtohd(dentry)->d_inode) {
3175 + hidden_dentry = dtohd(dentry);
3180 + if (!hidden_dentry->d_inode->i_op ||
3181 + !hidden_dentry->d_inode->i_op->readlink) {
3182 + err = -EINVAL; goto out;
3185 + err = hidden_dentry->d_inode->i_op->readlink(hidden_dentry,
3189 + fist_copy_attr_atime(dentry->d_inode, hidden_dentry->d_inode);
3196 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,13)
3197 +static int mini_fo_follow_link(dentry_t *dentry, struct nameidata *nd)
3199 +static void* mini_fo_follow_link(dentry_t *dentry, struct nameidata *nd)
3203 + int len = PAGE_SIZE, err;
3204 + mm_segment_t old_fs;
3206 + /* in 2.6 this is freed by mini_fo_put_link called by __do_follow_link */
3207 + buf = kmalloc(len, GFP_KERNEL);
3213 + /* read the symlink, and then we will follow it */
3214 + old_fs = get_fs();
3215 + set_fs(KERNEL_DS);
3216 + err = dentry->d_inode->i_op->readlink(dentry, buf, len);
3224 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
3225 + nd_set_link(nd, buf);
3228 + err = vfs_follow_link(nd, buf);
3232 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
3236 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,13)
3239 + return ERR_PTR(err);
3244 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
3245 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,13)
3246 +void mini_fo_put_link(struct dentry *dentry, struct nameidata *nd)
3248 +void mini_fo_put_link(struct dentry *dentry, struct nameidata *nd, void *cookie)
3252 + link = nd_get_link(nd);
3258 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
3259 +mini_fo_permission(inode_t *inode, int mask, struct nameidata *nd)
3261 +mini_fo_permission(inode_t *inode, int mask)
3264 + inode_t *hidden_inode;
3268 + if(itohi2(inode)) {
3269 + hidden_inode = itohi2(inode);
3271 + hidden_inode = itohi(inode);
3273 + mode = inode->i_mode;
3275 + /* not really needed, as permission handles everything:
3276 + * err = vfs_permission(inode, mask);
3281 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
3282 + err = permission(hidden_inode, mask, nd);
3284 + err = permission(hidden_inode, mask);
3291 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
3293 +mini_fo_inode_revalidate(dentry_t *dentry)
3296 + dentry_t *hidden_dentry;
3297 + inode_t *hidden_inode;
3299 + ASSERT(dentry->d_inode);
3300 + ASSERT(itopd(dentry->d_inode));
3302 + if(itohi2(dentry->d_inode)) {
3303 + hidden_dentry = dtohd2(dentry);
3304 + hidden_inode = hidden_dentry->d_inode;
3305 + } else if(itohi(dentry->d_inode)) {
3306 + hidden_dentry = dtohd(dentry);
3307 + hidden_inode = hidden_dentry->d_inode;
3309 + printk(KERN_CRIT "mini_fo_inode_revalidate: ERROR, invalid state detected.\n");
3313 + if (hidden_inode && hidden_inode->i_op && hidden_inode->i_op->revalidate){
3314 + err = hidden_inode->i_op->revalidate(hidden_dentry);
3318 + fist_copy_attr_all(dentry->d_inode, hidden_inode);
3325 +mini_fo_setattr(dentry_t *dentry, struct iattr *ia)
3329 + check_mini_fo_dentry(dentry);
3331 + if(!is_mini_fo_existant(dentry)) {
3332 + printk(KERN_CRIT "mini_fo_setattr: ERROR, invalid state detected [1].\n");
3336 + if(dtost(dentry) == UNMODIFIED) {
3337 + if(!IS_COPY_FLAG(ia->ia_valid))
3338 + goto out; /* we ignore these changes to base */
3340 + if(S_ISDIR(dentry->d_inode->i_mode)) {
3341 + err = dir_unmod_to_mod(dentry);
3343 + /* we copy contents if file is not beeing truncated */
3344 + if(S_ISREG(dentry->d_inode->i_mode) &&
3345 + !(ia->ia_size == 0 && (ia->ia_valid & ATTR_SIZE))) {
3346 + err = nondir_unmod_to_mod(dentry, 1);
3348 + err = nondir_unmod_to_mod(dentry, 0);
3352 + printk(KERN_CRIT "mini_fo_setattr: ERROR changing states.\n");
3356 + if(!exists_in_storage(dentry)) {
3357 + printk(KERN_CRIT "mini_fo_setattr: ERROR, invalid state detected [2].\n");
3361 + ASSERT(dentry->d_inode);
3362 + ASSERT(dtohd2(dentry));
3363 + ASSERT(itopd(dentry->d_inode));
3364 + ASSERT(itohi2(dentry->d_inode));
3366 + err = notify_change(dtohd2(dentry), ia);
3367 + fist_copy_attr_all(dentry->d_inode, itohi2(dentry->d_inode));
3372 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
3374 +mini_fo_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
3377 + dentry_t *hidden_dentry;
3379 + ASSERT(dentry->d_inode);
3380 + ASSERT(itopd(dentry->d_inode));
3382 + if(itohi2(dentry->d_inode)) {
3383 + hidden_dentry = dtohd2(dentry);
3384 + } else if(itohi(dentry->d_inode)) {
3385 + hidden_dentry = dtohd(dentry);
3387 + printk(KERN_CRIT "mini_fo_getattr: ERROR, invalid state detected.\n");
3391 + fist_copy_attr_all(dentry->d_inode, hidden_dentry->d_inode);
3393 + ASSERT(hidden_dentry);
3394 + ASSERT(hidden_dentry->d_inode);
3395 + ASSERT(hidden_dentry->d_inode->i_op);
3397 + generic_fillattr(dentry->d_inode, stat);
3398 + if (!stat->blksize) {
3399 + struct super_block *s = hidden_dentry->d_inode->i_sb;
3401 + blocks = (stat->size+s->s_blocksize-1) >> s->s_blocksize_bits;
3402 + stat->blocks = (s->s_blocksize / 512) * blocks;
3403 + stat->blksize = s->s_blocksize;
3410 +#if defined(XATTR) && (LINUX_VERSION_CODE >= KERNEL_VERSION(2,4,20))
3411 +#if 0 /* no xattr_alloc() and xattr_free() */
3412 +/* This is lifted from fs/xattr.c */
3414 +xattr_alloc(size_t size, size_t limit)
3419 + return ERR_PTR(-E2BIG);
3421 + if (!size) /* size request, no buffer is needed */
3423 + else if (size <= PAGE_SIZE)
3424 + ptr = kmalloc((unsigned long) size, GFP_KERNEL);
3426 + ptr = vmalloc((unsigned long) size);
3428 + return ERR_PTR(-ENOMEM);
3433 +xattr_free(void *ptr, size_t size)
3435 + if (!size) /* size request, no buffer was needed */
3437 + else if (size <= PAGE_SIZE)
3442 +#endif /* no xattr_alloc() and xattr_free() */
3444 +/* BKL held by caller.
3445 + * dentry->d_inode->i_sem down
3448 +mini_fo_getxattr(struct dentry *dentry, const char *name, void *value, size_t size) {
3449 + struct dentry *hidden_dentry = NULL;
3450 + int err = -EOPNOTSUPP;
3451 + /* Define these anyway so we don't need as much ifdef'ed code. */
3452 + char *encoded_name = NULL;
3453 + char *encoded_value = NULL;
3455 + check_mini_fo_dentry(dentry);
3457 + if(exists_in_storage(dentry))
3458 + hidden_dentry = dtohd2(dentry);
3460 + hidden_dentry = dtohd(dentry);
3462 + ASSERT(hidden_dentry);
3463 + ASSERT(hidden_dentry->d_inode);
3464 + ASSERT(hidden_dentry->d_inode->i_op);
3466 + if (hidden_dentry->d_inode->i_op->getxattr) {
3467 + encoded_name = (char *)name;
3468 + encoded_value = (char *)value;
3470 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3471 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
3473 + down(&hidden_dentry->d_inode->i_sem);
3475 + /* lock_kernel() already done by caller. */
3476 + err = hidden_dentry->d_inode->i_op->getxattr(hidden_dentry, encoded_name, encoded_value, size);
3477 + /* unlock_kernel() will be done by caller. */
3478 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3479 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
3481 + up(&hidden_dentry->d_inode->i_sem);
3487 +/* BKL held by caller.
3488 + * dentry->d_inode->i_sem down
3491 +#if ((LINUX_VERSION_CODE >= KERNEL_VERSION(2,4,21) \
3492 + && LINUX_VERSION_CODE <= KERNEL_VERSION(2,4,23)) \
3493 + || LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0))
3494 +mini_fo_setxattr(struct dentry *dentry, const char *name,
3495 + const void *value, size_t size, int flags)
3497 +mini_fo_setxattr(struct dentry *dentry, const char *name,
3498 + void *value, size_t size, int flags)
3502 + struct dentry *hidden_dentry = NULL;
3503 + int err = -EOPNOTSUPP;
3505 + /* Define these anyway, so we don't have as much ifdef'ed code. */
3506 + char *encoded_value = NULL;
3507 + char *encoded_name = NULL;
3509 + check_mini_fo_dentry(dentry);
3511 + if(exists_in_storage(dentry))
3512 + hidden_dentry = dtohd2(dentry);
3514 + hidden_dentry = dtohd(dentry);
3516 + ASSERT(hidden_dentry);
3517 + ASSERT(hidden_dentry->d_inode);
3518 + ASSERT(hidden_dentry->d_inode->i_op);
3520 + if (hidden_dentry->d_inode->i_op->setxattr) {
3521 + encoded_name = (char *)name;
3522 + encoded_value = (char *)value;
3524 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3525 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
3527 + down(&hidden_dentry->d_inode->i_sem);
3529 + /* lock_kernel() already done by caller. */
3530 + err = hidden_dentry->d_inode->i_op->setxattr(hidden_dentry, encoded_name, encoded_value, size, flags);
3531 + /* unlock_kernel() will be done by caller. */
3532 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3533 + mutex_unlock(&hidden_dentry->d_inode->i_mutex);
3535 + up(&hidden_dentry->d_inode->i_sem);
3541 +/* BKL held by caller.
3542 + * dentry->d_inode->i_sem down
3545 +mini_fo_removexattr(struct dentry *dentry, const char *name) {
3546 + struct dentry *hidden_dentry = NULL;
3547 + int err = -EOPNOTSUPP;
3548 + char *encoded_name;
3550 + check_mini_fo_dentry(dentry);
3552 + if(exists_in_storage(dentry))
3553 + hidden_dentry = dtohd2(dentry);
3555 + hidden_dentry = dtohd(dentry);
3557 + ASSERT(hidden_dentry);
3558 + ASSERT(hidden_dentry->d_inode);
3559 + ASSERT(hidden_dentry->d_inode->i_op);
3561 + if (hidden_dentry->d_inode->i_op->removexattr) {
3562 + encoded_name = (char *)name;
3564 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3565 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
3567 + down(&hidden_dentry->d_inode->i_sem);
3569 + /* lock_kernel() already done by caller. */
3570 + err = hidden_dentry->d_inode->i_op->removexattr(hidden_dentry, encoded_name);
3571 + /* unlock_kernel() will be done by caller. */
3572 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3573 + mutex_unlock(&hidden_dentry->d_inode->i_mutex);
3575 + up(&hidden_dentry->d_inode->i_sem);
3581 +/* BKL held by caller.
3582 + * dentry->d_inode->i_sem down
3585 +mini_fo_listxattr(struct dentry *dentry, char *list, size_t size) {
3586 + struct dentry *hidden_dentry = NULL;
3587 + int err = -EOPNOTSUPP;
3588 + char *encoded_list = NULL;
3590 + check_mini_fo_dentry(dentry);
3592 + if(exists_in_storage(dentry))
3593 + hidden_dentry = dtohd2(dentry);
3595 + hidden_dentry = dtohd(dentry);
3597 + ASSERT(hidden_dentry);
3598 + ASSERT(hidden_dentry->d_inode);
3599 + ASSERT(hidden_dentry->d_inode->i_op);
3601 + if (hidden_dentry->d_inode->i_op->listxattr) {
3602 + encoded_list = list;
3604 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3605 + mutex_lock(&hidden_dentry->d_inode->i_mutex);
3607 + down(&hidden_dentry->d_inode->i_sem);
3609 + /* lock_kernel() already done by caller. */
3610 + err = hidden_dentry->d_inode->i_op->listxattr(hidden_dentry, encoded_list, size);
3611 + /* unlock_kernel() will be done by caller. */
3612 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,16)
3613 + mutex_unlock(&hidden_dentry->d_inode->i_mutex);
3615 + up(&hidden_dentry->d_inode->i_sem);
3620 +# endif /* defined(XATTR) && (LINUX_VERSION_CODE >= KERNEL_VERSION(2,4,20)) */
3622 +struct inode_operations mini_fo_symlink_iops =
3624 + readlink: mini_fo_readlink,
3625 + follow_link: mini_fo_follow_link,
3626 + /* mk: permission: mini_fo_permission, */
3627 +#if LINUX_VERSION_CODE < KERNEL_VERSION(2,6,0)
3628 + revalidate: mini_fo_inode_revalidate,
3630 + setattr: mini_fo_setattr,
3631 +#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,0)
3632 + getattr: mini_fo_getattr,
3633 + put_link: mini_fo_put_link,
3636 +#if defined(XATTR) && (LINUX_VERSION_CODE >= KERNEL_VERSION(2,4,20))
3637 + setxattr: mini_fo_setxattr,
3638 + getxattr: mini_fo_getxattr,
3639 + listxattr: mini_fo_listxattr,
3640 + removexattr: mini_fo_removexattr
3641 +# endif /* defined(XATTR) && (LINUX_VERSION_CODE >= KERNEL_VERSION(2,4,20)) */