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. 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.
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
38 static const char copyright[] =
39 "@(#) Copyright (c) 1989, 1993, 1994\n\
40 The Regents of the University of California. All rights reserved.\n";
45 static const char sccsid[] = "@(#)du.c 8.5 (Berkeley) 5/4/95";
48 #include <sys/cdefs.h>
49 __FBSDID("$FreeBSD$");
51 #include <sys/param.h>
52 #include <sys/queue.h>
68 SLIST_HEAD(ignhead, ignentry) ignores;
71 SLIST_ENTRY(ignentry) next;
74 static int linkchk(FTSENT *);
75 static void usage(void);
76 static void prthumanval(int64_t);
77 static void ignoreadd(const char *);
78 static void ignoreclean(void);
79 static int ignorep(FTSENT *);
80 static void siginfo(int __unused);
82 static int nodumpflag = 0;
84 static long blocksize, cblocksize;
85 static volatile sig_atomic_t info;
88 main(int argc, char *argv[])
92 off_t savednumber, curblocks;
93 off_t threshold, threshold_sign;
97 int Hflag, Lflag, Pflag, aflag, sflag, dflag, cflag;
98 int hflag, lflag, ch, notused, rval;
100 static char dot[] = ".";
102 setlocale(LC_ALL, "");
104 Hflag = Lflag = Pflag = aflag = sflag = dflag = cflag = hflag =
112 cblocksize = DEV_BSIZE;
115 SLIST_INIT(&ignores);
117 while ((ch = getopt(argc, argv, "AB:HI:LPasd:chklmnrt:x")) != -1)
124 cblocksize = atoi(optarg);
125 if (errno == ERANGE || cblocksize <= 0) {
126 warnx("invalid argument to option B: %s",
156 depth = atoi(optarg);
157 if (errno == ERANGE || depth < 0) {
158 warnx("invalid argument to option d: %s",
183 case 'r': /* Compatibility. */
186 if (expand_number(optarg, &threshold) != 0 ||
188 warnx("invalid threshold: %s", optarg);
190 } else if (threshold < 0)
194 ftsoptions |= FTS_XDEV;
207 * Because of the way that fts(3) works, logical walks will not count
208 * the blocks actually used by symbolic links. We rationalize this by
209 * noting that users computing logical sizes are likely to do logical
210 * copies, so not counting the links is correct. The real reason is
211 * that we'd have to re-implement the kernel's symbolic link traversing
212 * algorithm to get this right. If, for example, you have relative
213 * symbolic links referencing other relative symbolic links, it gets
214 * very nasty, very fast. The bottom line is that it's documented in
215 * the man page, so it's a feature.
218 if (Hflag + Lflag + Pflag > 1)
221 if (Hflag + Lflag + Pflag == 0)
222 Pflag = 1; /* -P (physical) is default */
225 ftsoptions |= FTS_COMFOLLOW;
228 ftsoptions |= FTS_LOGICAL;
231 ftsoptions |= FTS_PHYSICAL;
233 if (!Aflag && (cblocksize % DEV_BSIZE) != 0)
234 cblocksize = howmany(cblocksize, DEV_BSIZE) * DEV_BSIZE;
255 (void)getbsize(¬used, &blocksize);
258 cblocksize /= DEV_BSIZE;
259 blocksize /= DEV_BSIZE;
263 threshold = howmany(threshold / DEV_BSIZE * cblocksize,
268 (void)signal(SIGINFO, siginfo);
270 if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
273 while ((p = fts_read(fts)) != NULL) {
274 switch (p->fts_info) {
275 case FTS_D: /* Ignore. */
277 fts_set(fts, p, FTS_SKIP);
284 howmany(p->fts_statp->st_size, cblocksize) :
285 howmany(p->fts_statp->st_blocks, cblocksize);
286 p->fts_parent->fts_bignum += p->fts_bignum +=
289 if (p->fts_level <= depth && threshold <=
290 threshold_sign * howmany(p->fts_bignum *
291 cblocksize, blocksize)) {
293 prthumanval(p->fts_bignum);
294 (void)printf("\t%s\n", p->fts_path);
296 (void)printf("%jd\t%s\n",
297 (intmax_t)howmany(p->fts_bignum *
298 cblocksize, blocksize),
304 (void)printf("\t%s\n", p->fts_path);
307 case FTS_DC: /* Ignore. */
309 case FTS_DNR: /* Warn, continue. */
312 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
319 if (lflag == 0 && p->fts_statp->st_nlink > 1 &&
324 howmany(p->fts_statp->st_size, cblocksize) :
325 howmany(p->fts_statp->st_blocks, cblocksize);
327 if (listall || p->fts_level == 0) {
329 prthumanval(curblocks);
330 (void)printf("\t%s\n", p->fts_path);
332 (void)printf("%jd\t%s\n",
333 (intmax_t)howmany(curblocks *
334 cblocksize, blocksize),
339 p->fts_parent->fts_bignum += curblocks;
341 savednumber = p->fts_parent->fts_bignum;
349 prthumanval(savednumber);
350 (void)printf("\ttotal\n");
352 (void)printf("%jd\ttotal\n", (intmax_t)howmany(
353 savednumber * cblocksize, blocksize));
365 struct links_entry *next;
366 struct links_entry *previous;
371 static const size_t links_hash_initial_size = 8192;
372 static struct links_entry **buckets;
373 static struct links_entry *free_list;
374 static size_t number_buckets;
375 static unsigned long number_entries;
376 static char stop_allocating;
377 struct links_entry *le, **new_buckets;
384 /* If necessary, initialize the hash table. */
385 if (buckets == NULL) {
386 number_buckets = links_hash_initial_size;
387 buckets = malloc(number_buckets * sizeof(buckets[0]));
389 errx(1, "No memory for hardlink detection");
390 for (i = 0; i < number_buckets; i++)
394 /* If the hash table is getting too full, enlarge it. */
395 if (number_entries > number_buckets * 10 && !stop_allocating) {
396 new_size = number_buckets * 2;
397 new_buckets = malloc(new_size * sizeof(struct links_entry *));
399 /* Try releasing the free list to see if that helps. */
400 if (new_buckets == NULL && free_list != NULL) {
401 while (free_list != NULL) {
403 free_list = le->next;
406 new_buckets = malloc(new_size *
407 sizeof(new_buckets[0]));
410 if (new_buckets == NULL) {
412 warnx("No more memory for tracking hard links");
414 memset(new_buckets, 0,
415 new_size * sizeof(struct links_entry *));
416 for (i = 0; i < number_buckets; i++) {
417 while (buckets[i] != NULL) {
418 /* Remove entry from old bucket. */
420 buckets[i] = le->next;
422 /* Add entry to new bucket. */
423 hash = (le->dev ^ le->ino) % new_size;
425 if (new_buckets[hash] != NULL)
426 new_buckets[hash]->previous =
428 le->next = new_buckets[hash];
430 new_buckets[hash] = le;
434 buckets = new_buckets;
435 number_buckets = new_size;
439 /* Try to locate this entry in the hash table. */
440 hash = ( st->st_dev ^ st->st_ino ) % number_buckets;
441 for (le = buckets[hash]; le != NULL; le = le->next) {
442 if (le->dev == st->st_dev && le->ino == st->st_ino) {
444 * Save memory by releasing an entry when we've seen
447 if (--le->links <= 0) {
448 if (le->previous != NULL)
449 le->previous->next = le->next;
450 if (le->next != NULL)
451 le->next->previous = le->previous;
452 if (buckets[hash] == le)
453 buckets[hash] = le->next;
455 /* Recycle this node through the free list */
456 if (stop_allocating) {
459 le->next = free_list;
470 /* Add this entry to the links cache. */
471 if (free_list != NULL) {
472 /* Pull a node from the free list if we can. */
474 free_list = le->next;
476 /* Malloc one if we have to. */
477 le = malloc(sizeof(struct links_entry));
480 warnx("No more memory for tracking hard links");
483 le->dev = st->st_dev;
484 le->ino = st->st_ino;
485 le->links = st->st_nlink - 1;
487 le->next = buckets[hash];
489 if (buckets[hash] != NULL)
490 buckets[hash]->previous = le;
496 prthumanval(int64_t bytes)
504 humanize_number(buf, sizeof(buf), bytes, "", HN_AUTOSCALE,
505 HN_B | HN_NOSPACE | HN_DECIMAL);
507 (void)printf("%4s", buf);
513 (void)fprintf(stderr,
514 "usage: du [-A] [-H | -L | -P] [-a | -s | -d depth] [-c] "
515 "[-l] [-h | -k | -m | -B bsize] [-n] [-x] [-I mask] "
521 ignoreadd(const char *mask)
523 struct ignentry *ign;
525 ign = calloc(1, sizeof(*ign));
527 errx(1, "cannot allocate memory");
528 ign->mask = strdup(mask);
529 if (ign->mask == NULL)
530 errx(1, "cannot allocate memory");
531 SLIST_INSERT_HEAD(&ignores, ign, next);
537 struct ignentry *ign;
539 while (!SLIST_EMPTY(&ignores)) {
540 ign = SLIST_FIRST(&ignores);
541 SLIST_REMOVE_HEAD(&ignores, next);
550 struct ignentry *ign;
552 if (nodumpflag && (ent->fts_statp->st_flags & UF_NODUMP))
554 SLIST_FOREACH(ign, &ignores, next)
555 if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)
561 siginfo(int sig __unused)