[apple/file_cmds.git] / du / du.c

/*	$NetBSD: du.c,v 1.14 1998/02/15 17:08:18 kleink Exp $	*/

/*
 * 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.
 */

#include <sys/cdefs.h>
#ifndef lint
__COPYRIGHT("@(#) Copyright (c) 1989, 1993, 1994\n\
	The Regents of the University of California.  All rights reserved.\n");
#endif /* not lint */

#ifndef lint
#if 0
static char sccsid[] = "@(#)du.c	8.5 (Berkeley) 5/4/95";
#else
__RCSID("$NetBSD: du.c,v 1.14 1998/02/15 17:08:18 kleink Exp $");
#endif
#endif /* not lint */

#include <sys/types.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 *));
int	main __P((int, char **));
void	usage __P((void));

int
main(argc, argv)
	int argc;
	char *argv[];
{
	FTS *fts;
	FTSENT *p;
	long blocksize, totalblocks;
	int ftsoptions, listdirs, listfiles;
	int Hflag, Lflag, Pflag, aflag, ch, cflag, kflag, notused, rval, sflag;
	char **save;

	save = argv;
	Hflag = Lflag = Pflag = aflag = cflag = kflag = sflag = 0;
	totalblocks = 0;
	ftsoptions = FTS_PHYSICAL;
	while ((ch = getopt(argc, argv, "HLPackrsx")) != -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 'c':
			cflag = 1;
			break;
		case 'k':
			blocksize = 1024;
			kflag = 1;
			break;
		case 'r':
			break;
		case 's':
			sflag = 1;
			break;
		case 'x':
			ftsoptions |= FTS_XDEV;
			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)
			usage();
		listdirs = listfiles = 1;
	} else if (sflag)
		listdirs = listfiles = 0;
	else {
		listfiles = 0;
		listdirs = 1;
	}

	if (!*argv) {
		argv = save;
		argv[0] = ".";
		argv[1] = NULL;
	}

	if (!kflag)
		(void)getbsize(&notused, &blocksize);
	blocksize /= 512;

	if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
		err(1, "fts_open `%s'", *argv);

	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 (cflag)
				totalblocks += 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 (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", (long long)
				    howmany(p->fts_statp->st_blocks, blocksize),
				    p->fts_path);
			p->fts_parent->fts_number += p->fts_statp->st_blocks;
			if (cflag)
				totalblocks += p->fts_statp->st_blocks;
		}
	if (errno)
		err(1, "fts_read");
	if (cflag)
		(void)printf("%ld\ttotal\n",
		    howmany(totalblocks, blocksize));
	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, "realloc");
	files[nfiles].inode = ino;
	files[nfiles].dev = dev;
	++nfiles;
	return (0);
}

void
usage()
{

	(void)fprintf(stderr,
		"usage: du [-H | -L | -P] [-a | -s] [-ckx] [file ...]\n");
	exit(1);
}
Commit	Line	Data
44a7a5ab A	1	/* $NetBSD: du.c,v 1.14 1998/02/15 17:08:18 kleink Exp $ */
	2
	3	/*
	4	* Copyright (c) 1989, 1993, 1994
	5	* The Regents of the University of California. All rights reserved.
	6	*
	7	* This code is derived from software contributed to Berkeley by
	8	* Chris Newcomb.
	9	*
	10	* Redistribution and use in source and binary forms, with or without
	11	* modification, are permitted provided that the following conditions
	12	* are met:
	13	* 1. Redistributions of source code must retain the above copyright
	14	* notice, this list of conditions and the following disclaimer.
	15	* 2. Redistributions in binary form must reproduce the above copyright
	16	* notice, this list of conditions and the following disclaimer in the
	17	* documentation and/or other materials provided with the distribution.
	18	* 3. All advertising materials mentioning features or use of this software
	19	* must display the following acknowledgement:
	20	* This product includes software developed by the University of
	21	* California, Berkeley and its contributors.
	22	* 4. Neither the name of the University nor the names of its contributors
	23	* may be used to endorse or promote products derived from this software
	24	* without specific prior written permission.
	25	*
	26	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	27	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	28	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	29	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	30	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	31	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	32	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	33	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	34	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	35	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	36	* SUCH DAMAGE.
	37	*/
	38
	39	#include <sys/cdefs.h>
	40	#ifndef lint
	41	__COPYRIGHT("@(#) Copyright (c) 1989, 1993, 1994\n\
	42	The Regents of the University of California. All rights reserved.\n");
	43	#endif /* not lint */
	44
	45	#ifndef lint
	46	#if 0
	47	static char sccsid[] = "@(#)du.c 8.5 (Berkeley) 5/4/95";
	48	#else
	49	__RCSID("$NetBSD: du.c,v 1.14 1998/02/15 17:08:18 kleink Exp $");
	50	#endif
	51	#endif /* not lint */
	52
	53	#include <sys/types.h>
	54	#include <sys/stat.h>
	55
	56	#include <dirent.h>
	57	#include <err.h>
	58	#include <errno.h>
	59	#include <fts.h>
	60	#include <stdio.h>
	61	#include <stdlib.h>
	62	#include <string.h>
	63	#include <unistd.h>
	64
65	int linkchk __P((FTSENT *));
66	int main __P((int, char **));
67	void usage __P((void));
68
69	int
70	main(argc, argv)
71	int argc;
72	char *argv[];
73	{
74	FTS *fts;
75	FTSENT *p;
76	long blocksize, totalblocks;
77	int ftsoptions, listdirs, listfiles;
78	int Hflag, Lflag, Pflag, aflag, ch, cflag, kflag, notused, rval, sflag;
79	char **save;
80
81	save = argv;
82	Hflag = Lflag = Pflag = aflag = cflag = kflag = sflag = 0;
83	totalblocks = 0;
84	ftsoptions = FTS_PHYSICAL;
85	while ((ch = getopt(argc, argv, "HLPackrsx")) != -1)
86	switch (ch) {
87	case 'H':
88	Hflag = 1;
89	Lflag = Pflag = 0;
90	break;
91	case 'L':
92	Lflag = 1;
93	Hflag = Pflag = 0;
94	break;
95	case 'P':
96	Pflag = 1;
97	Hflag = Lflag = 0;
98	break;
99	case 'a':
100	aflag = 1;
101	break;
102	case 'c':
103	cflag = 1;
104	break;
105	case 'k':
106	blocksize = 1024;
107	kflag = 1;
108	break;
109	case 'r':
110	break;
111	case 's':
112	sflag = 1;
113	break;
114	case 'x':
115	ftsoptions \|= FTS_XDEV;
116	break;
117	case '?':
118	default:
119	usage();
120	}
121	argc -= optind;
122	argv += optind;
123
124	/*
125	* XXX
126	* Because of the way that fts(3) works, logical walks will not count
127	* the blocks actually used by symbolic links. We rationalize this by
128	* noting that users computing logical sizes are likely to do logical
129	* copies, so not counting the links is correct. The real reason is
130	* that we'd have to re-implement the kernel's symbolic link traversing
131	* algorithm to get this right. If, for example, you have relative
132	* symbolic links referencing other relative symbolic links, it gets
133	* very nasty, very fast. The bottom line is that it's documented in
134	* the man page, so it's a feature.
135	*/
136	if (Hflag)
137	ftsoptions \|= FTS_COMFOLLOW;
138	if (Lflag) {
139	ftsoptions &= ~FTS_PHYSICAL;
140	ftsoptions \|= FTS_LOGICAL;
141	}
142
143	if (aflag) {
144	if (sflag)
145	usage();
146	listdirs = listfiles = 1;
147	} else if (sflag)
148	listdirs = listfiles = 0;
149	else {
150	listfiles = 0;
151	listdirs = 1;
152	}
153
154	if (!*argv) {
155	argv = save;
156	argv[0] = ".";
157	argv[1] = NULL;
158	}
159
160	if (!kflag)
161	(void)getbsize(&notused, &blocksize);
162	blocksize /= 512;
163
164	if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
165	err(1, "fts_open `%s'", *argv);
166
167	for (rval = 0; (p = fts_read(fts)) != NULL;)
168	switch (p->fts_info) {
169	case FTS_D: /* Ignore. */
170	break;
171	case FTS_DP:
172	p->fts_parent->fts_number +=
173	p->fts_number += p->fts_statp->st_blocks;
174	if (cflag)
175	totalblocks += p->fts_statp->st_blocks;
176	/*
177	* If listing each directory, or not listing files
178	* or directories and this is post-order of the
179	* root of a traversal, display the total.
180	*/
181	if (listdirs \|\| (!listfiles && !p->fts_level))
182	(void)printf("%ld\t%s\n",
183	howmany(p->fts_number, blocksize),
184	p->fts_path);
185	break;
186	case FTS_DC: /* Ignore. */
187	break;
188	case FTS_DNR: /* Warn, continue. */
189	case FTS_ERR:
190	case FTS_NS:
191	warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
192	rval = 1;
193	break;
194	default:
195	if (p->fts_statp->st_nlink > 1 && linkchk(p))
196	break;
197	/*
198	* If listing each file, or a non-directory file was
199	* the root of a traversal, display the total.
200	*/
201	if (listfiles \|\| !p->fts_level)
202	(void)printf("%qd\t%s\n", (long long)
203	howmany(p->fts_statp->st_blocks, blocksize),
204	p->fts_path);
205	p->fts_parent->fts_number += p->fts_statp->st_blocks;
206	if (cflag)
207	totalblocks += p->fts_statp->st_blocks;
208	}
209	if (errno)
210	err(1, "fts_read");
211	if (cflag)
212	(void)printf("%ld\ttotal\n",
213	howmany(totalblocks, blocksize));
214	exit(0);
215	}
216
217	typedef struct _ID {
218	dev_t dev;
219	ino_t inode;
220	} ID;
221
222	int
223	linkchk(p)
224	FTSENT *p;
225	{
226	static ID *files;
227	static int maxfiles, nfiles;
228	ID fp, start;
229	ino_t ino;
230	dev_t dev;
231
232	ino = p->fts_statp->st_ino;
233	dev = p->fts_statp->st_dev;
234	if ((start = files) != NULL)
235	for (fp = start + nfiles - 1; fp >= start; --fp)
236	if (ino == fp->inode && dev == fp->dev)
237	return (1);
238
239	if (nfiles == maxfiles && (files = realloc((char *)files,
240	(u_int)(sizeof(ID) * (maxfiles += 128)))) == NULL)
241	err(1, "realloc");
242	files[nfiles].inode = ino;
243	files[nfiles].dev = dev;
244	++nfiles;
245	return (0);
246	}
247
248	void
249	usage()
250	{
251
252	(void)fprintf(stderr,
253	"usage: du [-H \| -L \| -P] [-a \| -s] [-ckx] [file ...]\n");
254	exit(1);
255	}