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 * 4. 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 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;
93 int Hflag, Lflag, aflag, sflag, dflag, cflag;
94 int hflag, lflag, ch, notused, rval;
96 static char dot[] = ".";
98 setlocale(LC_ALL, "");
100 Hflag = Lflag = aflag = sflag = dflag = cflag = hflag =
104 ftsoptions = FTS_PHYSICAL;
108 cblocksize = DEV_BSIZE;
111 SLIST_INIT(&ignores);
113 while ((ch = getopt(argc, argv, "AB:HI:LPasd:cghklmnrt:x")) != -1)
120 cblocksize = atoi(optarg);
121 if (errno == ERANGE || cblocksize <= 0) {
122 warnx("invalid argument to option B: %s",
150 depth = atoi(optarg);
151 if (errno == ERANGE || depth < 0) {
152 warnx("invalid argument to option d: %s",
162 blocksize = 1073741824;
181 case 'r': /* Compatibility. */
184 if (expand_number(optarg, &threshold) != 0 ||
186 warnx("invalid threshold: %s", optarg);
188 } else if (threshold < 0)
192 ftsoptions |= FTS_XDEV;
205 * Because of the way that fts(3) works, logical walks will not count
206 * the blocks actually used by symbolic links. We rationalize this by
207 * noting that users computing logical sizes are likely to do logical
208 * copies, so not counting the links is correct. The real reason is
209 * that we'd have to re-implement the kernel's symbolic link traversing
210 * algorithm to get this right. If, for example, you have relative
211 * symbolic links referencing other relative symbolic links, it gets
212 * very nasty, very fast. The bottom line is that it's documented in
213 * the man page, so it's a feature.
217 ftsoptions |= FTS_COMFOLLOW;
219 ftsoptions &= ~FTS_PHYSICAL;
220 ftsoptions |= FTS_LOGICAL;
223 if (!Aflag && (cblocksize % DEV_BSIZE) != 0)
224 cblocksize = howmany(cblocksize, DEV_BSIZE) * DEV_BSIZE;
245 (void)getbsize(¬used, &blocksize);
248 cblocksize /= DEV_BSIZE;
249 blocksize /= DEV_BSIZE;
253 threshold = howmany(threshold / DEV_BSIZE * cblocksize,
258 (void)signal(SIGINFO, siginfo);
260 if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
263 while ((p = fts_read(fts)) != NULL) {
264 switch (p->fts_info) {
265 case FTS_D: /* Ignore. */
267 fts_set(fts, p, FTS_SKIP);
274 howmany(p->fts_statp->st_size, cblocksize) :
275 howmany(p->fts_statp->st_blocks, cblocksize);
276 p->fts_parent->fts_bignum += p->fts_bignum +=
279 if (p->fts_level <= depth && threshold <=
280 threshold_sign * howmany(p->fts_bignum *
281 cblocksize, blocksize)) {
283 prthumanval(p->fts_bignum);
284 (void)printf("\t%s\n", p->fts_path);
286 (void)printf("%jd\t%s\n",
287 (intmax_t)howmany(p->fts_bignum *
288 cblocksize, blocksize),
294 (void)printf("\t%s\n", p->fts_path);
297 case FTS_DC: /* Ignore. */
299 case FTS_DNR: /* Warn, continue. */
302 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
309 if (lflag == 0 && p->fts_statp->st_nlink > 1 &&
314 howmany(p->fts_statp->st_size, cblocksize) :
315 howmany(p->fts_statp->st_blocks, cblocksize);
317 if (listall || p->fts_level == 0) {
319 prthumanval(curblocks);
320 (void)printf("\t%s\n", p->fts_path);
322 (void)printf("%jd\t%s\n",
323 (intmax_t)howmany(curblocks *
324 cblocksize, blocksize),
329 p->fts_parent->fts_bignum += curblocks;
331 savednumber = p->fts_parent->fts_bignum;
339 prthumanval(savednumber);
340 (void)printf("\ttotal\n");
342 (void)printf("%jd\ttotal\n", (intmax_t)howmany(
343 savednumber * cblocksize, blocksize));
355 struct links_entry *next;
356 struct links_entry *previous;
361 static const size_t links_hash_initial_size = 8192;
362 static struct links_entry **buckets;
363 static struct links_entry *free_list;
364 static size_t number_buckets;
365 static unsigned long number_entries;
366 static char stop_allocating;
367 struct links_entry *le, **new_buckets;
374 /* If necessary, initialize the hash table. */
375 if (buckets == NULL) {
376 number_buckets = links_hash_initial_size;
377 buckets = malloc(number_buckets * sizeof(buckets[0]));
379 errx(1, "No memory for hardlink detection");
380 for (i = 0; i < number_buckets; i++)
384 /* If the hash table is getting too full, enlarge it. */
385 if (number_entries > number_buckets * 10 && !stop_allocating) {
386 new_size = number_buckets * 2;
387 new_buckets = malloc(new_size * sizeof(struct links_entry *));
389 /* Try releasing the free list to see if that helps. */
390 if (new_buckets == NULL && free_list != NULL) {
391 while (free_list != NULL) {
393 free_list = le->next;
396 new_buckets = malloc(new_size *
397 sizeof(new_buckets[0]));
400 if (new_buckets == NULL) {
402 warnx("No more memory for tracking hard links");
404 memset(new_buckets, 0,
405 new_size * sizeof(struct links_entry *));
406 for (i = 0; i < number_buckets; i++) {
407 while (buckets[i] != NULL) {
408 /* Remove entry from old bucket. */
410 buckets[i] = le->next;
412 /* Add entry to new bucket. */
413 hash = (le->dev ^ le->ino) % new_size;
415 if (new_buckets[hash] != NULL)
416 new_buckets[hash]->previous =
418 le->next = new_buckets[hash];
420 new_buckets[hash] = le;
424 buckets = new_buckets;
425 number_buckets = new_size;
429 /* Try to locate this entry in the hash table. */
430 hash = ( st->st_dev ^ st->st_ino ) % number_buckets;
431 for (le = buckets[hash]; le != NULL; le = le->next) {
432 if (le->dev == st->st_dev && le->ino == st->st_ino) {
434 * Save memory by releasing an entry when we've seen
437 if (--le->links <= 0) {
438 if (le->previous != NULL)
439 le->previous->next = le->next;
440 if (le->next != NULL)
441 le->next->previous = le->previous;
442 if (buckets[hash] == le)
443 buckets[hash] = le->next;
445 /* Recycle this node through the free list */
446 if (stop_allocating) {
449 le->next = free_list;
460 /* Add this entry to the links cache. */
461 if (free_list != NULL) {
462 /* Pull a node from the free list if we can. */
464 free_list = le->next;
466 /* Malloc one if we have to. */
467 le = malloc(sizeof(struct links_entry));
470 warnx("No more memory for tracking hard links");
473 le->dev = st->st_dev;
474 le->ino = st->st_ino;
475 le->links = st->st_nlink - 1;
477 le->next = buckets[hash];
479 if (buckets[hash] != NULL)
480 buckets[hash]->previous = le;
486 prthumanval(int64_t bytes)
494 humanize_number(buf, sizeof(buf), bytes, "", HN_AUTOSCALE,
495 HN_B | HN_NOSPACE | HN_DECIMAL);
497 (void)printf("%4s", buf);
503 (void)fprintf(stderr,
504 "usage: du [-Aclnx] [-H | -L | -P] [-h | -k | -m ] "
505 "[-a | -s | -d depth] [-B blocksize] [-I mask] "
506 "[-t threshold] [file ...]\n");
511 ignoreadd(const char *mask)
513 struct ignentry *ign;
515 ign = calloc(1, sizeof(*ign));
517 errx(1, "cannot allocate memory");
518 ign->mask = strdup(mask);
519 if (ign->mask == NULL)
520 errx(1, "cannot allocate memory");
521 SLIST_INSERT_HEAD(&ignores, ign, next);
527 struct ignentry *ign;
529 while (!SLIST_EMPTY(&ignores)) {
530 ign = SLIST_FIRST(&ignores);
531 SLIST_REMOVE_HEAD(&ignores, next);
540 struct ignentry *ign;
542 if (nodumpflag && (ent->fts_statp->st_flags & UF_NODUMP))
544 SLIST_FOREACH(ign, &ignores, next)
545 if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)
551 siginfo(int sig __unused)