2 * Copyright (c) 1989, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 static const char copyright[] =
35 "@(#) Copyright (c) 1989, 1993, 1994\n\
36 The Regents of the University of California. All rights reserved.\n";
41 static const char sccsid[] = "@(#)du.c 8.5 (Berkeley) 5/4/95";
44 #include <sys/cdefs.h>
45 __FBSDID("$FreeBSD$");
47 #include <sys/param.h>
48 #include <sys/queue.h>
64 static SLIST_HEAD(ignhead, ignentry) ignores;
67 SLIST_ENTRY(ignentry) next;
70 static int linkchk(FTSENT *);
71 static void usage(void);
72 static void prthumanval(int64_t);
73 static void ignoreadd(const char *);
74 static void ignoreclean(void);
75 static int ignorep(FTSENT *);
76 static void siginfo(int __unused);
78 static int nodumpflag = 0;
80 static long blocksize, cblocksize;
81 static volatile sig_atomic_t info;
84 main(int argc, char *argv[])
88 off_t savednumber, curblocks;
89 off_t threshold, threshold_sign;
92 int Hflag, Lflag, aflag, sflag, dflag, cflag;
93 int hflag, lflag, ch, notused, rval;
95 static char dot[] = ".";
97 setlocale(LC_ALL, "");
99 Hflag = Lflag = aflag = sflag = dflag = cflag = hflag =
103 ftsoptions = FTS_PHYSICAL;
107 cblocksize = DEV_BSIZE;
110 SLIST_INIT(&ignores);
112 while ((ch = getopt(argc, argv, "AB:HI:LPasd:cghklmnrt:x")) != -1)
119 cblocksize = atoi(optarg);
120 if (errno == ERANGE || cblocksize <= 0) {
121 warnx("invalid argument to option B: %s",
149 depth = atoi(optarg);
150 if (errno == ERANGE || depth < 0) {
151 warnx("invalid argument to option d: %s",
161 blocksize = 1073741824;
180 case 'r': /* Compatibility. */
183 if (expand_number(optarg, &threshold) != 0 ||
185 warnx("invalid threshold: %s", optarg);
187 } else if (threshold < 0)
191 ftsoptions |= FTS_XDEV;
204 * Because of the way that fts(3) works, logical walks will not count
205 * the blocks actually used by symbolic links. We rationalize this by
206 * noting that users computing logical sizes are likely to do logical
207 * copies, so not counting the links is correct. The real reason is
208 * that we'd have to re-implement the kernel's symbolic link traversing
209 * algorithm to get this right. If, for example, you have relative
210 * symbolic links referencing other relative symbolic links, it gets
211 * very nasty, very fast. The bottom line is that it's documented in
212 * the man page, so it's a feature.
216 ftsoptions |= FTS_COMFOLLOW;
218 ftsoptions &= ~FTS_PHYSICAL;
219 ftsoptions |= FTS_LOGICAL;
222 if (!Aflag && (cblocksize % DEV_BSIZE) != 0)
223 cblocksize = howmany(cblocksize, DEV_BSIZE) * DEV_BSIZE;
225 if (aflag + dflag + sflag > 1)
237 (void)getbsize(¬used, &blocksize);
240 cblocksize /= DEV_BSIZE;
241 blocksize /= DEV_BSIZE;
245 threshold = howmany(threshold / DEV_BSIZE * cblocksize,
250 (void)signal(SIGINFO, siginfo);
252 if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
255 while ((p = fts_read(fts)) != NULL) {
256 switch (p->fts_info) {
257 case FTS_D: /* Ignore. */
259 fts_set(fts, p, FTS_SKIP);
266 howmany(p->fts_statp->st_size, cblocksize) :
267 howmany(p->fts_statp->st_blocks, cblocksize);
268 p->fts_parent->fts_bignum += p->fts_bignum +=
271 if (p->fts_level <= depth && threshold <=
272 threshold_sign * howmany(p->fts_bignum *
273 cblocksize, blocksize)) {
275 prthumanval(p->fts_bignum);
276 (void)printf("\t%s\n", p->fts_path);
278 (void)printf("%jd\t%s\n",
279 (intmax_t)howmany(p->fts_bignum *
280 cblocksize, blocksize),
286 (void)printf("\t%s\n", p->fts_path);
289 case FTS_DC: /* Ignore. */
291 case FTS_DNR: /* Warn, continue. */
294 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
301 if (lflag == 0 && p->fts_statp->st_nlink > 1 &&
306 howmany(p->fts_statp->st_size, cblocksize) :
307 howmany(p->fts_statp->st_blocks, cblocksize);
309 if (aflag || p->fts_level == 0) {
311 prthumanval(curblocks);
312 (void)printf("\t%s\n", p->fts_path);
314 (void)printf("%jd\t%s\n",
315 (intmax_t)howmany(curblocks *
316 cblocksize, blocksize),
321 p->fts_parent->fts_bignum += curblocks;
323 savednumber = p->fts_parent->fts_bignum;
331 prthumanval(savednumber);
332 (void)printf("\ttotal\n");
334 (void)printf("%jd\ttotal\n", (intmax_t)howmany(
335 savednumber * cblocksize, blocksize));
347 struct links_entry *next;
348 struct links_entry *previous;
353 static const size_t links_hash_initial_size = 8192;
354 static struct links_entry **buckets;
355 static struct links_entry *free_list;
356 static size_t number_buckets;
357 static unsigned long number_entries;
358 static char stop_allocating;
359 struct links_entry *le, **new_buckets;
366 /* If necessary, initialize the hash table. */
367 if (buckets == NULL) {
368 number_buckets = links_hash_initial_size;
369 buckets = malloc(number_buckets * sizeof(buckets[0]));
371 errx(1, "No memory for hardlink detection");
372 for (i = 0; i < number_buckets; i++)
376 /* If the hash table is getting too full, enlarge it. */
377 if (number_entries > number_buckets * 10 && !stop_allocating) {
378 new_size = number_buckets * 2;
379 new_buckets = calloc(new_size, sizeof(struct links_entry *));
381 /* Try releasing the free list to see if that helps. */
382 if (new_buckets == NULL && free_list != NULL) {
383 while (free_list != NULL) {
385 free_list = le->next;
388 new_buckets = calloc(new_size, sizeof(new_buckets[0]));
391 if (new_buckets == NULL) {
393 warnx("No more memory for tracking hard links");
395 for (i = 0; i < number_buckets; i++) {
396 while (buckets[i] != NULL) {
397 /* Remove entry from old bucket. */
399 buckets[i] = le->next;
401 /* Add entry to new bucket. */
402 hash = (le->dev ^ le->ino) % new_size;
404 if (new_buckets[hash] != NULL)
405 new_buckets[hash]->previous =
407 le->next = new_buckets[hash];
409 new_buckets[hash] = le;
413 buckets = new_buckets;
414 number_buckets = new_size;
418 /* Try to locate this entry in the hash table. */
419 hash = ( st->st_dev ^ st->st_ino ) % number_buckets;
420 for (le = buckets[hash]; le != NULL; le = le->next) {
421 if (le->dev == st->st_dev && le->ino == st->st_ino) {
423 * Save memory by releasing an entry when we've seen
426 if (--le->links <= 0) {
427 if (le->previous != NULL)
428 le->previous->next = le->next;
429 if (le->next != NULL)
430 le->next->previous = le->previous;
431 if (buckets[hash] == le)
432 buckets[hash] = le->next;
434 /* Recycle this node through the free list */
435 if (stop_allocating) {
438 le->next = free_list;
449 /* Add this entry to the links cache. */
450 if (free_list != NULL) {
451 /* Pull a node from the free list if we can. */
453 free_list = le->next;
455 /* Malloc one if we have to. */
456 le = malloc(sizeof(struct links_entry));
459 warnx("No more memory for tracking hard links");
462 le->dev = st->st_dev;
463 le->ino = st->st_ino;
464 le->links = st->st_nlink - 1;
466 le->next = buckets[hash];
468 if (buckets[hash] != NULL)
469 buckets[hash]->previous = le;
475 prthumanval(int64_t bytes)
483 humanize_number(buf, sizeof(buf), bytes, "", HN_AUTOSCALE,
484 HN_B | HN_NOSPACE | HN_DECIMAL);
486 (void)printf("%4s", buf);
492 (void)fprintf(stderr,
493 "usage: du [-Aclnx] [-H | -L | -P] [-g | -h | -k | -m] "
494 "[-a | -s | -d depth] [-B blocksize] [-I mask] "
495 "[-t threshold] [file ...]\n");
500 ignoreadd(const char *mask)
502 struct ignentry *ign;
504 ign = calloc(1, sizeof(*ign));
506 errx(1, "cannot allocate memory");
507 ign->mask = strdup(mask);
508 if (ign->mask == NULL)
509 errx(1, "cannot allocate memory");
510 SLIST_INSERT_HEAD(&ignores, ign, next);
516 struct ignentry *ign;
518 while (!SLIST_EMPTY(&ignores)) {
519 ign = SLIST_FIRST(&ignores);
520 SLIST_REMOVE_HEAD(&ignores, next);
529 struct ignentry *ign;
531 if (nodumpflag && (ent->fts_statp->st_flags & UF_NODUMP))
533 SLIST_FOREACH(ign, &ignores, next)
534 if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)
540 siginfo(int sig __unused)