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
36 * @(#) Copyright (c) 1989, 1993, 1994 The Regents of the University of California. All rights reserved.
37 * @(#)du.c 8.5 (Berkeley) 5/4/95
38 * $FreeBSD: src/usr.bin/du/du.c,v 1.17.2.4 2002/12/12 16:29:39 trhodes Exp $
39 * $DragonFly: src/usr.bin/du/du.c,v 1.12 2008/08/12 03:35:35 y0netan1 Exp $
42 #include <sys/param.h>
43 #include <sys/queue.h>
57 #define HASHSIZE 256 /* power of 2 only */
58 #define HASHMASK (HASHSIZE - 1)
60 SLIST_HEAD(ignhead, ignentry) ignores;
63 SLIST_ENTRY(ignentry) next;
66 static int linkchk(FTSENT *);
67 static void usage(void);
68 void prthumanval(int64_t);
69 void ignoreadd(const char *);
70 void ignoreclean(void);
71 int ignorep(FTSENT *);
73 static char period[] = ".";
75 typedef long long du_number_t;
78 main(int argc, char **argv)
83 du_number_t savednumber = 0;
87 int Hflag, Lflag, Pflag, aflag, sflag, dflag, cflag, hflag, ch, notused, rval;
90 Hflag = Lflag = Pflag = aflag = sflag = dflag = cflag = hflag = 0;
97 while ((ch = getopt(argc, argv, "HI:LPasd:chkrx")) != -1)
124 depth = atoi(optarg);
125 if (errno == ERANGE || depth < 0) {
126 warnx("invalid argument to option d: %s", optarg);
134 if (setenv("BLOCKSIZE", "512", 1) == -1)
135 warn("setenv: cannot set BLOCKSIZE=512");
140 if (setenv("BLOCKSIZE", "1024", 1) == -1)
141 warn("setenv: cannot set BLOCKSIZE=1024");
143 case 'r': /* Compatibility. */
146 ftsoptions |= FTS_XDEV;
158 * Because of the way that fts(3) works, logical walks will not count
159 * the blocks actually used by symbolic links. We rationalize this by
160 * noting that users computing logical sizes are likely to do logical
161 * copies, so not counting the links is correct. The real reason is
162 * that we'd have to re-implement the kernel's symbolic link traversing
163 * algorithm to get this right. If, for example, you have relative
164 * symbolic links referencing other relative symbolic links, it gets
165 * very nasty, very fast. The bottom line is that it's documented in
166 * the man page, so it's a feature.
169 if (Hflag + Lflag + Pflag > 1)
172 if (Hflag + Lflag + Pflag == 0)
173 Pflag = 1; /* -P (physical) is default */
176 ftsoptions |= FTS_COMFOLLOW;
179 ftsoptions |= FTS_LOGICAL;
182 ftsoptions |= FTS_PHYSICAL;
202 (void) getbsize(¬used, &blocksize);
207 if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
210 while ((p = fts_read(fts)) != NULL) {
211 switch (p->fts_info) {
212 case FTS_D: /* Ignore. */
214 fts_set(fts, p, FTS_SKIP);
220 if (p->fts_pointer == NULL) {
221 p->fts_pointer = malloc(sizeof(du_number_t));
222 *(du_number_t *)p->fts_pointer = 0;
224 *(du_number_t *)p->fts_pointer += p->fts_statp->st_blocks;
226 if (p->fts_parent->fts_pointer == NULL) {
227 p->fts_parent->fts_pointer = malloc(sizeof(du_number_t));
228 *(du_number_t *)p->fts_parent->fts_pointer = 0;
230 *(du_number_t *)p->fts_parent->fts_pointer += *(du_number_t *)p->fts_pointer += p->fts_statp->st_blocks;
232 if (p->fts_level <= depth) {
234 (void) prthumanval(howmany(*(du_number_t *)p->fts_pointer, blocksize));
235 (void) printf("\t%s\n", p->fts_path);
237 (void) printf("%lld\t%s\n",
238 howmany(*(du_number_t *)p->fts_pointer, blocksize),
242 if (p->fts_pointer) {
243 free(p->fts_pointer);
244 p->fts_pointer = NULL;
247 case FTS_DC: /* Ignore. */
249 case FTS_DNR: /* Warn, continue. */
252 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
259 if (p->fts_statp->st_nlink > 1 && linkchk(p))
262 if (listall || p->fts_level == 0) {
264 (void) prthumanval(howmany(p->fts_statp->st_blocks,
266 (void) printf("\t%s\n", p->fts_path);
268 (void) printf("%lld\t%s\n",
269 howmany((long long)p->fts_statp->st_blocks, blocksize),
273 if (p->fts_parent->fts_pointer == NULL) {
274 p->fts_parent->fts_pointer = malloc(sizeof(du_number_t));
275 *(du_number_t *)p->fts_parent->fts_pointer = 0;
277 *(du_number_t *)p->fts_parent->fts_pointer += p->fts_statp->st_blocks;
279 if (p->fts_parent->fts_pointer)
280 savednumber = *(du_number_t *)p->fts_parent->fts_pointer;
290 (void) prthumanval(howmany(savednumber, blocksize));
291 (void) printf("\ttotal\n");
293 (void) printf("%lld\ttotal\n", howmany(savednumber, blocksize));
305 struct links_entry *next;
306 struct links_entry *previous;
312 static const size_t links_hash_initial_size = 8192;
313 static struct links_entry **buckets;
314 static struct links_entry *free_list;
315 static size_t number_buckets;
316 static unsigned long number_entries;
317 static char stop_allocating;
318 struct links_entry *le, **new_buckets;
325 /* If necessary, initialize the hash table. */
326 if (buckets == NULL) {
327 number_buckets = links_hash_initial_size;
328 buckets = malloc(number_buckets * sizeof(buckets[0]));
330 errx(1, "No memory for hardlink detection");
331 for (i = 0; i < number_buckets; i++)
335 /* If the hash table is getting too full, enlarge it. */
336 if (number_entries > number_buckets * 10 && !stop_allocating) {
337 new_size = number_buckets * 2;
338 new_buckets = malloc(new_size * sizeof(struct links_entry *));
340 /* Try releasing the free list to see if that helps. */
341 if (new_buckets == NULL && free_list != NULL) {
342 while (free_list != NULL) {
344 free_list = le->next;
347 new_buckets = malloc(new_size * sizeof(new_buckets[0]));
350 if (new_buckets == NULL) {
352 warnx("No more memory for tracking hard links");
354 memset(new_buckets, 0, new_size * sizeof(struct links_entry *));
355 for (i = 0; i < number_buckets; i++) {
356 while (buckets[i] != NULL) {
357 /* Remove entry from old bucket. */
359 buckets[i] = le->next;
361 /* Add entry to new bucket. */
362 hash = (le->dev ^ le->ino) % new_size;
364 if (new_buckets[hash] != NULL)
365 new_buckets[hash]->previous = le;
366 le->next = new_buckets[hash];
368 new_buckets[hash] = le;
372 buckets = new_buckets;
373 number_buckets = new_size;
377 /* Try to locate this entry in the hash table. */
378 hash = ( st->st_dev ^ st->st_ino ) % number_buckets;
379 for (le = buckets[hash]; le != NULL; le = le->next) {
380 if (le->dev == st->st_dev && le->ino == st->st_ino) {
382 * Save memory by releasing an entry when we've seen
385 if (--le->links <= 0) {
386 if (le->previous != NULL)
387 le->previous->next = le->next;
388 if (le->next != NULL)
389 le->next->previous = le->previous;
390 if (buckets[hash] == le)
391 buckets[hash] = le->next;
393 /* Recycle this node through the free list */
394 if (stop_allocating) {
397 le->next = free_list;
408 /* Add this entry to the links cache. */
409 if (free_list != NULL) {
410 /* Pull a node from the free list if we can. */
412 free_list = le->next;
414 /* Malloc one if we have to. */
415 le = malloc(sizeof(struct links_entry));
418 warnx("No more memory for tracking hard links");
421 le->dev = st->st_dev;
422 le->ino = st->st_ino;
423 le->links = st->st_nlink - 1;
425 le->next = buckets[hash];
427 if (buckets[hash] != NULL)
428 buckets[hash]->previous = le;
434 prthumanval(int64_t bytes)
436 char buf[sizeof("999M")];
440 humanize_number(buf, sizeof(buf), bytes, "", HN_AUTOSCALE,
441 HN_B | HN_NOSPACE | HN_DECIMAL);
443 (void) printf("%4s", buf);
449 (void)fprintf(stderr,
450 "usage: du [-H | -L | -P] [-a | -s | -d depth] [-c] [-h | -k] [-x] [-I mask] [file ...]\n");
455 ignoreadd(const char *mask)
457 struct ignentry *ign;
459 ign = calloc(1, sizeof(*ign));
461 errx(1, "cannot allocate memory");
462 ign->mask = strdup(mask);
463 if (ign->mask == NULL)
464 errx(1, "cannot allocate memory");
465 SLIST_INSERT_HEAD(&ignores, ign, next);
471 struct ignentry *ign;
473 while (!SLIST_EMPTY(&ignores)) {
474 ign = SLIST_FIRST(&ignores);
475 SLIST_REMOVE_HEAD(&ignores, next);
484 struct ignentry *ign;
486 SLIST_FOREACH(ign, &ignores, next)
487 if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)