blob: d132c5ae4606f050989ed1260ccc5657fe1dd5ae [file] [log] [blame]
.\" $Id$
.\" -----------------------------------------------------------------------
.\" Copyright 2001 H. Peter Anvin - All Rights Reserved
.\" This program is free software; you can redistribute it and/or modify
.\" it under the terms of the GNU General Public License as published by
.\" the Free Software Foundation, Inc., 675 Mass Ave, Cambridge MA 02139,
.\" USA; either version 2 of the License, or (at your option) any later
.\" version; incorporated herein by reference.
.\" -----------------------------------------------------------------------
.TH MKZFTREE "1" "30 July 2001" "zisofs-tools" "H. Peter Anvin"
mkzftree \- Create a zisofs/RockRidge compressed file tree
.B mkzftree
Takes an input file tree (\fIINPUT\fR) and create a corresponding
compressed file tree (\fIOUTPUT\fR) that can be used with an
appropriately patched
.BR mkisofs (8)
to create a transparent-compression ISO 9660/Rock Ridge filesystem using
the "ZF" compression records.
\fB\-f\fP, \fB\-\-force\fP
Always compress all files, even if they get larger when compressed.
\fB\-z\fP \fIlevel\fP, \fB\-\-level\fP \fIlevel\fP
Select compression level (1-9, default is 9). Lower compression
levels are faster, but typically result in larger output.
\fB\-u\fP, \fB\-\-uncompress\fP
Uncompress an already compressed tree. This can be used to read a
compressed filesystem on a system which cannot read them natively.
\fB\-p\fP \fIparallelism\fP, \fB\-\-parallelism\fP \fIparallelism\fP
Compress in parallel. The
.I parallelism
value indicates how many compression threads are allowed to run.
\fB\-x\fP, \fB\-\-one-filesystem\fP
Do not cross filesystem boundaries, but create directory stubs at
mount points.
\fB\-X\fP, \fB\-\-strict-one-filesystem\fP
Do not cross filesystem boundaries, and do not create directory stubs
at mount points.
\fB\-C\fP \fIpath\fP, \fB\-\-crib-path\fP \fIpath\fP
Steal ("crib") files from another directory if it looks (based on
name, size, type and modification time) like they match entries in the
new filesystem. The "crib tree" is usually the compressed version of
an older version of the same workload; this thus allows for
"incremental rebuilds" of a compressed filesystem tree. The files are
hardlinked from the crib tree to the output tree, so if it is
desirable to keep the link count correct the crib path should be
deleted before running \fBmkisofs\fP. The crib tree must be on the
same filesystem as the output tree.
\fB\-l\fP, \fB\-\-local\fP
Do not recurse into subdirectories, but create the directories
\fB\-L\fP, \fB\-\-strict-local\fP
Do not recurse into subdirectories, and do not create directories.
\fB\-F\fP, \fB\-\-file\fP
Indicates that \fIINPUT\fP may not necessarily be a directory; this
allows operation on a single file. Note especially that if \fI\-F\fP
is specified, and \fIINPUT\fP is a symlink, the symlink itself will be
copied rather than whatever it happens to point to.
\fB\-s\fP, \fB\-\-sloppy\fP
Treat file modes, times and ownership data as less than precious
information and don't abort if they cannot be set. This may be useful
if running
.B mkisofs
on an input tree you do not own.
\fB\-v\fP, \fB\-\-verbose\fP
Increase the program verbosity.
\fB\-V\fP \fIvalue\fP, \fB\-\-verbosity\fP \fIvalue\fP
Set the program verbosity to
.IR value .
\fB\-q\fP, \fB\-\-quiet\fP
Issue no messages whatsoever, including error messages. This is the same
as specifying
.IR "\-V\ 0" .
\fB\-h\fP, \fB\-\-help\fP
Display a brief help message.
\fB\-w\fP, \fB\-\-version\fP
Display the release version.
Long options (beginning with \fI\-\-\fP) may not work on all systems.
See the message printed out by \fImkzftree\ \-h\fP to see if this
applies to your system.
Inode change times (ctimes) are not copied. This is a system
limitation and applies to all file copy programs.
If using the parallel option (\fI\-z\fP) the access times (atimes) on
directories may or may not be copied. If it is important that the
atimes on directories are copied exactly, avoid using \fI\-z\fP.
Written by H. Peter Anvin <>.
Copyright \(co 2001-2002 H. Peter Anvin.
This is free software; see the source for copying conditions. There is NO
.BR mkisofs (8)