du.c revision 78158 
1/*
2 * Copyright (c) 1989, 1993, 1994
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Chris Newcomb.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 *    must display the following acknowledgement:
18 *	This product includes software developed by the University of
19 *	California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 *    may be used to endorse or promote products derived from this software
22 *    without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37#ifndef lint
38static const char copyright[] =
39"@(#) Copyright (c) 1989, 1993, 1994\n\
40	The Regents of the University of California.  All rights reserved.\n";
41#endif /* not lint */
42
43#ifndef lint
44#if 0
45static const char sccsid[] = "@(#)du.c	8.5 (Berkeley) 5/4/95";
46#endif
47static const char rcsid[] =
48  "$FreeBSD: head/usr.bin/du/du.c 78158 2001-06-13 06:38:58Z roam $";
49#endif /* not lint */
50
51
52#include <sys/param.h>
53#include <sys/queue.h>
54#include <sys/stat.h>
55
56#include <err.h>
57#include <errno.h>
58#include <fnmatch.h>
59#include <fts.h>
60#include <math.h>
61#include <stdio.h>
62#include <stdlib.h>
63#include <string.h>
64#include <sysexits.h>
65#include <unistd.h>
66
67#define	KILO_SZ(n) (n)
68#define	MEGA_SZ(n) ((n) * (n))
69#define	GIGA_SZ(n) ((n) * (n) * (n))
70#define	TERA_SZ(n) ((n) * (n) * (n) * (n))
71#define	PETA_SZ(n) ((n) * (n) * (n) * (n) * (n))
72
73#define	KILO_2_SZ (KILO_SZ(1024ULL))
74#define	MEGA_2_SZ (MEGA_SZ(1024ULL))
75#define	GIGA_2_SZ (GIGA_SZ(1024ULL))
76#define	TERA_2_SZ (TERA_SZ(1024ULL))
77#define	PETA_2_SZ (PETA_SZ(1024ULL))
78
79#define	KILO_SI_SZ (KILO_SZ(1000ULL))
80#define	MEGA_SI_SZ (MEGA_SZ(1000ULL))
81#define	GIGA_SI_SZ (GIGA_SZ(1000ULL))
82#define	TERA_SI_SZ (TERA_SZ(1000ULL))
83#define	PETA_SI_SZ (PETA_SZ(1000ULL))
84
85unsigned long long vals_si [] = {1, KILO_SI_SZ, MEGA_SI_SZ, GIGA_SI_SZ, TERA_SI_SZ, PETA_SI_SZ};
86unsigned long long vals_base2[] = {1, KILO_2_SZ, MEGA_2_SZ, GIGA_2_SZ, TERA_2_SZ, PETA_2_SZ};
87unsigned long long *valp;
88
89typedef enum { NONE, KILO, MEGA, GIGA, TERA, PETA, UNIT_MAX } unit_t;
90
91int unitp [] = { NONE, KILO, MEGA, GIGA, TERA, PETA };
92
93SLIST_HEAD(ignhead, ignentry) ignores;
94struct ignentry {
95	char			*mask;
96	SLIST_ENTRY(ignentry)	next;
97};
98
99int		linkchk __P((FTSENT *));
100static void	usage __P((void));
101void		prthumanval __P((double));
102unit_t		unit_adjust __P((double *));
103void		ignoreadd __P((const char *));
104void		ignoreclean __P((void));
105int		ignorep __P((FTSENT *));
106
107int
108main(argc, argv)
109	int argc;
110	char *argv[];
111{
112	FTS		*fts;
113	FTSENT		*p;
114	long		blocksize, savednumber = 0;
115	int		ftsoptions;
116	int		listall;
117	int		depth;
118	int		Hflag, Lflag, Pflag, aflag, sflag, dflag, cflag, hflag, ch, notused, rval;
119	char 		**save;
120
121	Hflag = Lflag = Pflag = aflag = sflag = dflag = cflag = hflag = 0;
122
123	save = argv;
124	ftsoptions = 0;
125	depth = INT_MAX;
126	SLIST_INIT(&ignores);
127
128	while ((ch = getopt(argc, argv, "HI:LPasd:chkrx")) != -1)
129		switch (ch) {
130			case 'H':
131				Hflag = 1;
132				break;
133			case 'I':
134				ignoreadd(optarg);
135				break;
136			case 'L':
137				if (Pflag)
138					usage();
139				Lflag = 1;
140				break;
141			case 'P':
142				if (Lflag)
143					usage();
144				Pflag = 1;
145				break;
146			case 'a':
147				aflag = 1;
148				break;
149			case 's':
150				sflag = 1;
151				break;
152			case 'd':
153				dflag = 1;
154				errno = 0;
155				depth = atoi(optarg);
156				if (errno == ERANGE || depth < 0) {
157					warnx("invalid argument to option d: %s", optarg);
158					usage();
159				}
160				break;
161			case 'c':
162				cflag = 1;
163				break;
164			case 'h':
165				putenv("BLOCKSIZE=512");
166				hflag = 1;
167				valp = vals_base2;
168				break;
169			case 'k':
170				putenv("BLOCKSIZE=1024");
171				break;
172			case 'r':		 /* Compatibility. */
173				break;
174			case 'x':
175				ftsoptions |= FTS_XDEV;
176				break;
177			case '?':
178			default:
179				usage();
180		}
181
182	argc -= optind;
183	argv += optind;
184
185	/*
186	 * XXX
187	 * Because of the way that fts(3) works, logical walks will not count
188	 * the blocks actually used by symbolic links.  We rationalize this by
189	 * noting that users computing logical sizes are likely to do logical
190	 * copies, so not counting the links is correct.  The real reason is
191	 * that we'd have to re-implement the kernel's symbolic link traversing
192	 * algorithm to get this right.  If, for example, you have relative
193	 * symbolic links referencing other relative symbolic links, it gets
194	 * very nasty, very fast.  The bottom line is that it's documented in
195	 * the man page, so it's a feature.
196	 */
197
198	if (Hflag + Lflag + Pflag > 1)
199		usage();
200
201	if (Hflag + Lflag + Pflag == 0)
202		Pflag = 1;			/* -P (physical) is default */
203
204	if (Hflag)
205		ftsoptions |= FTS_COMFOLLOW;
206
207	if (Lflag)
208		ftsoptions |= FTS_LOGICAL;
209
210	if (Pflag)
211		ftsoptions |= FTS_PHYSICAL;
212
213	listall = 0;
214
215	if (aflag) {
216		if (sflag || dflag)
217			usage();
218		listall = 1;
219	} else if (sflag) {
220		if (dflag)
221			usage();
222		depth = 0;
223	}
224
225	if (!*argv) {
226		argv = save;
227		argv[0] = ".";
228		argv[1] = NULL;
229	}
230
231	(void) getbsize(&notused, &blocksize);
232	blocksize /= 512;
233
234	rval = 0;
235
236	if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
237		err(1, "fts_open");
238
239	while ((p = fts_read(fts)) != NULL) {
240		switch (p->fts_info) {
241			case FTS_D:			/* Ignore. */
242				if (ignorep(p))
243					fts_set(fts, p, FTS_SKIP);
244				break;
245			case FTS_DP:
246				if (ignorep(p))
247					break;
248
249				p->fts_parent->fts_number +=
250				    p->fts_number += p->fts_statp->st_blocks;
251
252				if (p->fts_level <= depth) {
253					if (hflag) {
254						(void) prthumanval(howmany(p->fts_number, blocksize));
255						(void) printf("\t%s\n", p->fts_path);
256					} else {
257					(void) printf("%ld\t%s\n",
258					    howmany(p->fts_number, blocksize),
259					    p->fts_path);
260					}
261				}
262				break;
263			case FTS_DC:			/* Ignore. */
264				break;
265			case FTS_DNR:			/* Warn, continue. */
266			case FTS_ERR:
267			case FTS_NS:
268				warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
269				rval = 1;
270				break;
271			default:
272				if (ignorep(p))
273					break;
274
275				if (p->fts_statp->st_nlink > 1 && linkchk(p))
276					break;
277
278				if (listall || p->fts_level == 0) {
279					if (hflag) {
280						(void) prthumanval(howmany(p->fts_statp->st_blocks,
281							blocksize));
282						(void) printf("\t%s\n", p->fts_path);
283					} else {
284						(void) printf("%qd\t%s\n",
285							howmany(p->fts_statp->st_blocks, blocksize),
286							p->fts_path);
287					}
288				}
289
290				p->fts_parent->fts_number += p->fts_statp->st_blocks;
291		}
292		savednumber = p->fts_parent->fts_number;
293	}
294
295	if (errno)
296		err(1, "fts_read");
297
298	if (cflag) {
299		if (hflag) {
300			(void) prthumanval(howmany(savednumber, blocksize));
301			(void) printf("\ttotal\n");
302		} else {
303			(void) printf("%ld\ttotal\n", howmany(savednumber, blocksize));
304		}
305	}
306
307	ignoreclean();
308	exit(rval);
309}
310
311
312typedef struct _ID {
313	dev_t	dev;
314	ino_t	inode;
315} ID;
316
317
318int
319linkchk(p)
320	FTSENT *p;
321{
322	static ID *files;
323	static int maxfiles, nfiles;
324	ID *fp, *start;
325	ino_t ino;
326	dev_t dev;
327
328	ino = p->fts_statp->st_ino;
329	dev = p->fts_statp->st_dev;
330	if ((start = files) != NULL)
331		for (fp = start + nfiles - 1; fp >= start; --fp)
332			if (ino == fp->inode && dev == fp->dev)
333				return (1);
334
335	if (nfiles == maxfiles && (files = realloc((char *)files,
336	    (u_int)(sizeof(ID) * (maxfiles += 128)))) == NULL)
337		errx(1, "can't allocate memory");
338	files[nfiles].inode = ino;
339	files[nfiles].dev = dev;
340	++nfiles;
341	return (0);
342}
343
344/*
345 * Output in "human-readable" format.  Uses 3 digits max and puts
346 * unit suffixes at the end.  Makes output compact and easy to read,
347 * especially on huge disks.
348 *
349 */
350unit_t
351unit_adjust(val)
352	double *val;
353{
354	double abval;
355	unit_t unit;
356	unsigned int unit_sz;
357
358	abval = fabs(*val);
359
360	unit_sz = abval ? ilogb(abval) / 10 : 0;
361
362	if (unit_sz >= UNIT_MAX) {
363		unit = NONE;
364	} else {
365		unit = unitp[unit_sz];
366		*val /= (double)valp[unit_sz];
367	}
368
369	return (unit);
370}
371
372void
373prthumanval(bytes)
374	double bytes;
375{
376	unit_t unit;
377
378	bytes *= 512;
379	unit = unit_adjust(&bytes);
380
381	if (bytes == 0)
382		(void)printf("  0B");
383	else if (bytes > 10)
384		(void)printf("%3.0f%c", bytes, "BKMGTPE"[unit]);
385	else
386		(void)printf("%3.1f%c", bytes, "BKMGTPE"[unit]);
387}
388
389static void
390usage()
391{
392	(void)fprintf(stderr,
393		"usage: du [-H | -L | -P] [-a | -s | -d depth] [-c] [-h | -k] [-x] [-I mask] [file ...]\n");
394	exit(EX_USAGE);
395}
396
397void
398ignoreadd(mask)
399	const char *mask;
400{
401	struct ignentry *ign;
402
403	ign = calloc(1, sizeof(*ign));
404	if (ign == NULL)
405		errx(1, "cannot allocate memory");
406	ign->mask = strdup(mask);
407	if (ign->mask == NULL)
408		errx(1, "cannot allocate memory");
409	SLIST_INSERT_HEAD(&ignores, ign, next);
410}
411
412void
413ignoreclean()
414{
415	struct ignentry *ign;
416
417	while (!SLIST_EMPTY(&ignores)) {
418		ign = SLIST_FIRST(&ignores);
419		SLIST_REMOVE_HEAD(&ignores, next);
420		free(ign->mask);
421		free(ign);
422	}
423}
424
425int
426ignorep(ent)
427	FTSENT *ent;
428{
429	struct ignentry *ign;
430
431	SLIST_FOREACH(ign, &ignores, next)
432		if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)
433			return 1;
434	return 0;
435}
436