1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84
|
Copyright (c) 2003-2006 Erez Zadok
Copyright (c) 2003-2006 Charles P. Wright
Copyright (c) 2005-2006 Josef Sipek
Copyright (c) 2005 Arun M. Krishnakumar
Copyright (c) 2005-2006 David P. Quigley
Copyright (c) 2003-2004 Mohammad Nayyer Zubair
Copyright (c) 2003 Puja Gupta
Copyright (c) 2003 Harikesavan Krishnan
Copyright (c) 2003-2006 Stony Brook University
Copyright (c) 2003-2006 The Research Foundation of State University of New York
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
We're pleased to announce the first release of a unioning file system
for Linux, called Unionfs. To download software and documentation,
see
http://www.fsl.cs.sunysb.edu/project-unionfs.html
Unionfs is a stackable unification file system, which can appear to merge
the contents of several directories (branches), while keeping their physical
content separate. Unionfs is useful for unified source tree management,
merged contents of split CD-ROM, merged separate software package
directories, data grids, and more. Unionfs allows any mix of read-only and
read-write branches, as well as insertion and deletion of branches anywhere
in the fan-out. To maintain Unix semantics, Unionfs handles elimination of
duplicates, partial-error conditions, and more. This release also includes
additional preliminary features that were specifically designed for security
applications, such as snapshotting and sandboxing.
This Unionfs release supports only one 2.6 kernel version (run 'make kvers'
to find out which). For older kernels look into Unionfs version 1.0.x and
1.1.x. For detailed information about the new Unionfs versioning scheme,
look at docs/versions.txt. You also need to have the development headers
for e2fsprogs installed.
Unionfs is released under the GPL (see the COPYING file in the distribution
for details).
For more information on using Unionfs, download the tarball and see the
following man pages:
- unionfs.4: Describes how to mount unionfs
- unionctl.8: Describes how to control an already mounted Union
For more information about Unionfs internals (which we think are really cool
:-), see the following technical report at the above Web site:
C. P. Wright, J. Dave, P. Gupta, H. Krishnan, E. Zadok, and M. Zubair
"Versatility and Unix Semantics in a Fan-Out Unification File System"
Technical Report FSL-04-01b, October 2004
Computer Science Department, Stony Brook University
http://www.fsl.cs.sunysb.edu/docs/unionfs-tr/unionfs.pdf
In addition, you can find an article in Linux Journal (December 2004 issue)
titled "Unionfs: Bringing File Systems Together." It is available online at
http://www.linuxjournal.com/article/7714.
See the INSTALL file for instructions on building Unionfs, iteractions with
kernel features, and known bugs and limitations.
To report bugs, please email them to the "unionfs@filesystems.org" list (see
www.filesystems.org), or submit them via Bugzilla to
https://bugzilla.filesystems.org/. But reports with fixes are most welcome.
Enjoy,
Erez and Charles (on behalf of the Unionfs team)
##############################################################################
## For Emacs:
# Local variables:
# fill-column: 70
# End:
##############################################################################
|