2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1989, 1993, 1994
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
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. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static const char copyright[] =
37 "@(#) Copyright (c) 1989, 1993, 1994\n\
38 The Regents of the University of California. All rights reserved.\n";
43 static const char sccsid[] = "@(#)du.c 8.5 (Berkeley) 5/4/95";
46 #include <sys/cdefs.h>
47 __FBSDID("$FreeBSD$");
49 #include <sys/param.h>
50 #include <sys/queue.h>
66 #define SI_OPT (CHAR_MAX + 1)
71 static SLIST_HEAD(ignhead, ignentry) ignores;
74 SLIST_ENTRY(ignentry) next;
77 static int linkchk(FTSENT *);
78 static void usage(void);
79 static void prthumanval(int64_t);
80 static void ignoreadd(const char *);
81 static void ignoreclean(void);
82 static int ignorep(FTSENT *);
83 static void siginfo(int __unused);
85 static int nodumpflag = 0;
86 static int Aflag, hflag;
87 static long blocksize, cblocksize;
88 static volatile sig_atomic_t info;
90 static const struct option long_options[] =
92 { "si", no_argument, NULL, SI_OPT },
93 { NULL, no_argument, NULL, 0 },
97 main(int argc, char *argv[])
101 off_t savednumber, curblocks;
102 off_t threshold, threshold_sign;
105 int Hflag, Lflag, aflag, sflag, dflag, cflag;
106 int lflag, ch, notused, rval;
108 static char dot[] = ".";
110 setlocale(LC_ALL, "");
112 Hflag = Lflag = aflag = sflag = dflag = cflag = lflag = Aflag = 0;
115 ftsoptions = FTS_PHYSICAL;
119 cblocksize = DEV_BSIZE;
122 SLIST_INIT(&ignores);
124 while ((ch = getopt_long(argc, argv, "+AB:HI:LPasd:cghklmnrt:x",
125 long_options, NULL)) != -1)
132 cblocksize = atoi(optarg);
133 if (errno == ERANGE || cblocksize <= 0) {
134 warnx("invalid argument to option B: %s",
162 depth = atoi(optarg);
163 if (errno == ERANGE || depth < 0) {
164 warnx("invalid argument to option d: %s",
174 blocksize = 1073741824;
193 case 'r': /* Compatibility. */
196 if (expand_number(optarg, &threshold) != 0 ||
198 warnx("invalid threshold: %s", optarg);
200 } else if (threshold < 0)
204 ftsoptions |= FTS_XDEV;
220 * Because of the way that fts(3) works, logical walks will not count
221 * the blocks actually used by symbolic links. We rationalize this by
222 * noting that users computing logical sizes are likely to do logical
223 * copies, so not counting the links is correct. The real reason is
224 * that we'd have to re-implement the kernel's symbolic link traversing
225 * algorithm to get this right. If, for example, you have relative
226 * symbolic links referencing other relative symbolic links, it gets
227 * very nasty, very fast. The bottom line is that it's documented in
228 * the man page, so it's a feature.
232 ftsoptions |= FTS_COMFOLLOW;
234 ftsoptions &= ~FTS_PHYSICAL;
235 ftsoptions |= FTS_LOGICAL;
238 if (!Aflag && (cblocksize % DEV_BSIZE) != 0)
239 cblocksize = howmany(cblocksize, DEV_BSIZE) * DEV_BSIZE;
241 if (aflag + dflag + sflag > 1)
253 (void)getbsize(¬used, &blocksize);
256 cblocksize /= DEV_BSIZE;
257 blocksize /= DEV_BSIZE;
261 threshold = howmany(threshold / DEV_BSIZE * cblocksize,
266 (void)signal(SIGINFO, siginfo);
268 if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
271 while (errno = 0, (p = fts_read(fts)) != NULL) {
272 switch (p->fts_info) {
273 case FTS_D: /* Ignore. */
275 fts_set(fts, p, FTS_SKIP);
282 howmany(p->fts_statp->st_size, cblocksize) :
283 howmany(p->fts_statp->st_blocks, cblocksize);
284 p->fts_parent->fts_bignum += p->fts_bignum +=
287 if (p->fts_level <= depth && threshold <=
288 threshold_sign * howmany(p->fts_bignum *
289 cblocksize, blocksize)) {
291 prthumanval(p->fts_bignum);
292 (void)printf("\t%s\n", p->fts_path);
294 (void)printf("%jd\t%s\n",
295 (intmax_t)howmany(p->fts_bignum *
296 cblocksize, blocksize),
302 (void)printf("\t%s\n", p->fts_path);
305 case FTS_DC: /* Ignore. */
307 case FTS_DNR: /* Warn, continue. */
310 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
317 if (lflag == 0 && p->fts_statp->st_nlink > 1 &&
322 howmany(p->fts_statp->st_size, cblocksize) :
323 howmany(p->fts_statp->st_blocks, cblocksize);
325 if (aflag || p->fts_level == 0) {
327 prthumanval(curblocks);
328 (void)printf("\t%s\n", p->fts_path);
330 (void)printf("%jd\t%s\n",
331 (intmax_t)howmany(curblocks *
332 cblocksize, blocksize),
337 p->fts_parent->fts_bignum += curblocks;
339 savednumber = p->fts_parent->fts_bignum;
347 prthumanval(savednumber);
348 (void)printf("\ttotal\n");
350 (void)printf("%jd\ttotal\n", (intmax_t)howmany(
351 savednumber * cblocksize, blocksize));
363 struct links_entry *next;
364 struct links_entry *previous;
369 static const size_t links_hash_initial_size = 8192;
370 static struct links_entry **buckets;
371 static struct links_entry *free_list;
372 static size_t number_buckets;
373 static unsigned long number_entries;
374 static char stop_allocating;
375 struct links_entry *le, **new_buckets;
382 /* If necessary, initialize the hash table. */
383 if (buckets == NULL) {
384 number_buckets = links_hash_initial_size;
385 buckets = malloc(number_buckets * sizeof(buckets[0]));
387 errx(1, "No memory for hardlink detection");
388 for (i = 0; i < number_buckets; i++)
392 /* If the hash table is getting too full, enlarge it. */
393 if (number_entries > number_buckets * 10 && !stop_allocating) {
394 new_size = number_buckets * 2;
395 new_buckets = calloc(new_size, sizeof(struct links_entry *));
397 /* Try releasing the free list to see if that helps. */
398 if (new_buckets == NULL && free_list != NULL) {
399 while (free_list != NULL) {
401 free_list = le->next;
404 new_buckets = calloc(new_size, sizeof(new_buckets[0]));
407 if (new_buckets == NULL) {
409 warnx("No more memory for tracking hard links");
411 for (i = 0; i < number_buckets; i++) {
412 while (buckets[i] != NULL) {
413 /* Remove entry from old bucket. */
415 buckets[i] = le->next;
417 /* Add entry to new bucket. */
418 hash = (le->dev ^ le->ino) % new_size;
420 if (new_buckets[hash] != NULL)
421 new_buckets[hash]->previous =
423 le->next = new_buckets[hash];
425 new_buckets[hash] = le;
429 buckets = new_buckets;
430 number_buckets = new_size;
434 /* Try to locate this entry in the hash table. */
435 hash = ( st->st_dev ^ st->st_ino ) % number_buckets;
436 for (le = buckets[hash]; le != NULL; le = le->next) {
437 if (le->dev == st->st_dev && le->ino == st->st_ino) {
439 * Save memory by releasing an entry when we've seen
442 if (--le->links <= 0) {
443 if (le->previous != NULL)
444 le->previous->next = le->next;
445 if (le->next != NULL)
446 le->next->previous = le->previous;
447 if (buckets[hash] == le)
448 buckets[hash] = le->next;
450 /* Recycle this node through the free list */
451 if (stop_allocating) {
454 le->next = free_list;
465 /* Add this entry to the links cache. */
466 if (free_list != NULL) {
467 /* Pull a node from the free list if we can. */
469 free_list = le->next;
471 /* Malloc one if we have to. */
472 le = malloc(sizeof(struct links_entry));
475 warnx("No more memory for tracking hard links");
478 le->dev = st->st_dev;
479 le->ino = st->st_ino;
480 le->links = st->st_nlink - 1;
482 le->next = buckets[hash];
484 if (buckets[hash] != NULL)
485 buckets[hash]->previous = le;
491 prthumanval(int64_t bytes)
497 flags = HN_B | HN_NOSPACE | HN_DECIMAL;
500 if (hflag == UNITS_SI)
501 flags |= HN_DIVISOR_1000;
503 humanize_number(buf, sizeof(buf), bytes, "", HN_AUTOSCALE, flags);
505 (void)printf("%4s", buf);
511 (void)fprintf(stderr,
512 "usage: du [-Aclnx] [-H | -L | -P] [-g | -h | -k | -m] "
513 "[-a | -s | -d depth] [-B blocksize] [-I mask] "
514 "[-t threshold] [file ...]\n");
519 ignoreadd(const char *mask)
521 struct ignentry *ign;
523 ign = calloc(1, sizeof(*ign));
525 errx(1, "cannot allocate memory");
526 ign->mask = strdup(mask);
527 if (ign->mask == NULL)
528 errx(1, "cannot allocate memory");
529 SLIST_INSERT_HEAD(&ignores, ign, next);
535 struct ignentry *ign;
537 while (!SLIST_EMPTY(&ignores)) {
538 ign = SLIST_FIRST(&ignores);
539 SLIST_REMOVE_HEAD(&ignores, next);
548 struct ignentry *ign;
550 if (nodumpflag && (ent->fts_statp->st_flags & UF_NODUMP))
552 SLIST_FOREACH(ign, &ignores, next)
553 if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)
559 siginfo(int sig __unused)