249 lines
6.4 KiB
C
249 lines
6.4 KiB
C
/*
|
|
* Copyright (c) 1989, 1993, 1994
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* Chris Newcomb.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
#ifndef lint
|
|
static char copyright[] =
|
|
"@(#) Copyright (c) 1989, 1993, 1994\n\
|
|
The Regents of the University of California. All rights reserved.\n";
|
|
#endif /* not lint */
|
|
|
|
#ifndef lint
|
|
static char sccsid[] = "@(#)du.c 8.5 (Berkeley) 5/4/95";
|
|
#endif /* not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/stat.h>
|
|
|
|
#include <dirent.h>
|
|
#include <err.h>
|
|
#include <errno.h>
|
|
#include <fts.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
int linkchk __P((FTSENT *));
|
|
void usage __P((void));
|
|
|
|
int
|
|
main(argc, argv)
|
|
int argc;
|
|
char *argv[];
|
|
{
|
|
FTS *fts;
|
|
FTSENT *p;
|
|
long blocksize;
|
|
int ftsoptions, listdirs, listfiles, depth;
|
|
int Hflag, Lflag, Pflag, aflag, ch, notused, rval, sflag, dflag;
|
|
char **save;
|
|
|
|
save = argv;
|
|
Hflag = Lflag = Pflag = aflag = sflag = dflag = 0;
|
|
depth = INT_MAX;
|
|
ftsoptions = FTS_PHYSICAL;
|
|
while ((ch = getopt(argc, argv, "HLPad:ksx")) != -1)
|
|
switch (ch) {
|
|
case 'H':
|
|
Hflag = 1;
|
|
Lflag = Pflag = 0;
|
|
break;
|
|
case 'L':
|
|
Lflag = 1;
|
|
Hflag = Pflag = 0;
|
|
break;
|
|
case 'P':
|
|
Pflag = 1;
|
|
Hflag = Lflag = 0;
|
|
break;
|
|
case 'a':
|
|
aflag = 1;
|
|
break;
|
|
case 'k':
|
|
putenv("BLOCKSIZE=1024");
|
|
break;
|
|
case 's':
|
|
sflag = 1;
|
|
break;
|
|
case 'x':
|
|
ftsoptions |= FTS_XDEV;
|
|
break;
|
|
case 'd':
|
|
dflag = 1;
|
|
depth=atoi(optarg);
|
|
if(errno == ERANGE) {
|
|
(void)fprintf(stderr, "Invalid argument to option d: %s", optarg);
|
|
usage();
|
|
}
|
|
break;
|
|
case '?':
|
|
default:
|
|
usage();
|
|
}
|
|
argc -= optind;
|
|
argv += optind;
|
|
|
|
/*
|
|
* XXX
|
|
* Because of the way that fts(3) works, logical walks will not count
|
|
* the blocks actually used by symbolic links. We rationalize this by
|
|
* noting that users computing logical sizes are likely to do logical
|
|
* copies, so not counting the links is correct. The real reason is
|
|
* that we'd have to re-implement the kernel's symbolic link traversing
|
|
* algorithm to get this right. If, for example, you have relative
|
|
* symbolic links referencing other relative symbolic links, it gets
|
|
* very nasty, very fast. The bottom line is that it's documented in
|
|
* the man page, so it's a feature.
|
|
*/
|
|
if (Hflag)
|
|
ftsoptions |= FTS_COMFOLLOW;
|
|
if (Lflag) {
|
|
ftsoptions &= ~FTS_PHYSICAL;
|
|
ftsoptions |= FTS_LOGICAL;
|
|
}
|
|
|
|
if (aflag) {
|
|
if (sflag || dflag)
|
|
usage();
|
|
listdirs = listfiles = 1;
|
|
} else if (sflag) {
|
|
if (dflag)
|
|
usage();
|
|
listdirs = listfiles = 0;
|
|
} else if (dflag) {
|
|
listfiles = 0;
|
|
listdirs = 1;
|
|
} else {
|
|
listfiles = 0;
|
|
listdirs = 1;
|
|
}
|
|
|
|
if (!*argv) {
|
|
argv = save;
|
|
argv[0] = ".";
|
|
argv[1] = NULL;
|
|
}
|
|
|
|
(void)getbsize(¬used, &blocksize);
|
|
blocksize /= 512;
|
|
|
|
if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
|
|
err(1, NULL);
|
|
|
|
for (rval = 0; (p = fts_read(fts)) != NULL;)
|
|
switch (p->fts_info) {
|
|
case FTS_D: /* Ignore. */
|
|
break;
|
|
case FTS_DP:
|
|
p->fts_parent->fts_number +=
|
|
p->fts_number += p->fts_statp->st_blocks;
|
|
/*
|
|
* If listing each directory, or not listing files
|
|
* or directories and this is post-order of the
|
|
* root of a traversal, display the total.
|
|
*/
|
|
if ((p->fts_level <= depth && listdirs) ||
|
|
(!listfiles && !p->fts_level))
|
|
(void)printf("%ld\t%s\n",
|
|
howmany(p->fts_number, blocksize),
|
|
p->fts_path);
|
|
break;
|
|
case FTS_DC: /* Ignore. */
|
|
break;
|
|
case FTS_DNR: /* Warn, continue. */
|
|
case FTS_ERR:
|
|
case FTS_NS:
|
|
warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
|
|
rval = 1;
|
|
break;
|
|
default:
|
|
if (p->fts_statp->st_nlink > 1 && linkchk(p))
|
|
break;
|
|
/*
|
|
* If listing each file, or a non-directory file was
|
|
* the root of a traversal, display the total.
|
|
*/
|
|
if (listfiles || !p->fts_level)
|
|
(void)printf("%qd\t%s\n",
|
|
howmany(p->fts_statp->st_blocks, blocksize),
|
|
p->fts_path);
|
|
p->fts_parent->fts_number += p->fts_statp->st_blocks;
|
|
}
|
|
if (errno)
|
|
err(1, "fts_read");
|
|
exit(0);
|
|
}
|
|
|
|
typedef struct _ID {
|
|
dev_t dev;
|
|
ino_t inode;
|
|
} ID;
|
|
|
|
int
|
|
linkchk(p)
|
|
FTSENT *p;
|
|
{
|
|
static ID *files;
|
|
static int maxfiles, nfiles;
|
|
ID *fp, *start;
|
|
ino_t ino;
|
|
dev_t dev;
|
|
|
|
ino = p->fts_statp->st_ino;
|
|
dev = p->fts_statp->st_dev;
|
|
if ((start = files) != NULL)
|
|
for (fp = start + nfiles - 1; fp >= start; --fp)
|
|
if (ino == fp->inode && dev == fp->dev)
|
|
return (1);
|
|
|
|
if (nfiles == maxfiles && (files = realloc((char *)files,
|
|
(u_int)(sizeof(ID) * (maxfiles += 128)))) == NULL)
|
|
err(1, "");
|
|
files[nfiles].inode = ino;
|
|
files[nfiles].dev = dev;
|
|
++nfiles;
|
|
return (0);
|
|
}
|
|
|
|
void
|
|
usage()
|
|
{
|
|
|
|
(void)fprintf(stderr,
|
|
"usage: du [-H | -L | -P] [-a | -s | -d depth] [-k] [-x] [file ...]\n");
|
|
exit(1);
|
|
}
|