du/du.c

   1 /*
   2  * Copyright (c) 1989, 1993, 1994
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Chris Newcomb.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  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.
  23  *
  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
  34  * SUCH DAMAGE.
  35  */
  36
  37 #ifndef lint
  38 static const char copyright[] =
  39 "@(#) Copyright (c) 1989, 1993, 1994\n\
  40         The Regents of the University of California.  All rights reserved.\n";
  41 #endif /* not lint */
  42
  43 #ifndef lint
  44 #if 0
  45 static const char sccsid[] = "@(#)du.c  8.5 (Berkeley) 5/4/95";
  46 #endif
  47 #endif /* not lint */
  48 #include <sys/cdefs.h>
  49 __RCSID("$FreeBSD: src/usr.bin/du/du.c,v 1.28 2002/12/30 18:13:07 mike Exp $");
  50
  51 #include <sys/param.h>
  52 #include <sys/queue.h>
  53 #include <sys/stat.h>
  54
  55 #include <err.h>
  56 #include <errno.h>
  57 #include <fnmatch.h>
  58 #include <fts.h>
  59 #include <math.h>
  60 #include <stdio.h>
  61 #include <stdlib.h>
  62 #include <string.h>
  63 #include <sysexits.h>
  64 #include <unistd.h>
  65
  66 #define KILO_SZ(n) (n)
  67 #define MEGA_SZ(n) ((n) * (n))
  68 #define GIGA_SZ(n) ((n) * (n) * (n))
  69 #define TERA_SZ(n) ((n) * (n) * (n) * (n))
  70 #define PETA_SZ(n) ((n) * (n) * (n) * (n) * (n))
  71
  72 #define KILO_2_SZ (KILO_SZ(1024ULL))
  73 #define MEGA_2_SZ (MEGA_SZ(1024ULL))
  74 #define GIGA_2_SZ (GIGA_SZ(1024ULL))
  75 #define TERA_2_SZ (TERA_SZ(1024ULL))
  76 #define PETA_2_SZ (PETA_SZ(1024ULL))
  77
  78 #define KILO_SI_SZ (KILO_SZ(1000ULL))
  79 #define MEGA_SI_SZ (MEGA_SZ(1000ULL))
  80 #define GIGA_SI_SZ (GIGA_SZ(1000ULL))
  81 #define TERA_SI_SZ (TERA_SZ(1000ULL))
  82 #define PETA_SI_SZ (PETA_SZ(1000ULL))
  83
  84 #define TWO_TB  (2LL * 1024LL * 1024LL * 1024LL * 1024LL)
  85
  86 unsigned long long vals_si [] = {1, KILO_SI_SZ, MEGA_SI_SZ, GIGA_SI_SZ, TERA_SI_SZ, PETA_SI_SZ};
  87 unsigned long long vals_base2[] = {1, KILO_2_SZ, MEGA_2_SZ, GIGA_2_SZ, TERA_2_SZ, PETA_2_SZ};
  88 unsigned long long *valp;
  89
  90 typedef enum { NONE, KILO, MEGA, GIGA, TERA, PETA, UNIT_MAX } unit_t;
  91
  92 int unitp [] = { NONE, KILO, MEGA, GIGA, TERA, PETA };
  93
  94 SLIST_HEAD(ignhead, ignentry) ignores;
  95 struct ignentry {
  96         char                    *mask;
  97         SLIST_ENTRY(ignentry)   next;
  98 };
  99
 100 int             linkchk(FTSENT *);
 101 static void     usage(void);
 102 void            prthumanval(double);
 103 unit_t          unit_adjust(double *);
 104 void            ignoreadd(const char *);
 105 void            ignoreclean(void);
 106 int             ignorep(FTSENT *);
 107
 108 int
 109 main(int argc, char *argv[])
 110 {
 111         FTS             *fts;
 112         FTSENT          *p;
 113         long            blocksize;
 114         int             ftsoptions;
 115         int             listall;
 116         int             depth;
 117         int             Hflag, Lflag, Pflag, aflag, sflag, dflag, cflag, hflag, ch, notused, rval;
 118         char            **save;
 119         static char     dot[] = ".";
 120         off_t           *ftsnum, *ftsparnum, savednumber = 0;
 121
 122         Hflag = Lflag = Pflag = aflag = sflag = dflag = cflag = hflag = 0;
 123
 124         save = argv;
 125         ftsoptions = 0;
 126         depth = INT_MAX;
 127         SLIST_INIT(&ignores);
 128
 129         while ((ch = getopt(argc, argv, "HI:LPasd:chkrx")) != -1)
 130                 switch (ch) {
 131                         case 'H':
 132                                 Hflag = 1;
 133                                 break;
 134                         case 'I':
 135                                 ignoreadd(optarg);
 136                                 break;
 137                         case 'L':
 138                                 if (Pflag)
 139                                         usage();
 140                                 Lflag = 1;
 141                                 break;
 142                         case 'P':
 143                                 if (Lflag)
 144                                         usage();
 145                                 Pflag = 1;
 146                                 break;
 147                         case 'a':
 148                                 aflag = 1;
 149                                 break;
 150                         case 's':
 151                                 sflag = 1;
 152                                 break;
 153                         case 'd':
 154                                 dflag = 1;
 155                                 errno = 0;
 156                                 depth = atoi(optarg);
 157                                 if (errno == ERANGE || depth < 0) {
 158                                         warnx("invalid argument to option d: %s", optarg);
 159                                         usage();
 160                                 }
 161                                 break;
 162                         case 'c':
 163                                 cflag = 1;
 164                                 break;
 165                         case 'h':
 166                                 putenv("BLOCKSIZE=512");
 167                                 hflag = 1;
 168                                 valp = vals_base2;
 169                                 break;
 170                         case 'k':
 171                                 if (!hflag)
 172                                         putenv("BLOCKSIZE=1024");
 173                                 break;
 174                         case 'r':                /* Compatibility. */
 175                                 break;
 176                         case 'x':
 177                                 ftsoptions |= FTS_XDEV;
 178                                 break;
 179                         case '?':
 180                         default:
 181                                 usage();
 182                 }
 183
 184         argc -= optind;
 185         argv += optind;
 186
 187         /*
 188          * XXX
 189          * Because of the way that fts(3) works, logical walks will not count
 190          * the blocks actually used by symbolic links.  We rationalize this by
 191          * noting that users computing logical sizes are likely to do logical
 192          * copies, so not counting the links is correct.  The real reason is
 193          * that we'd have to re-implement the kernel's symbolic link traversing
 194          * algorithm to get this right.  If, for example, you have relative
 195          * symbolic links referencing other relative symbolic links, it gets
 196          * very nasty, very fast.  The bottom line is that it's documented in
 197          * the man page, so it's a feature.
 198          */
 199
 200         if (Hflag + Lflag + Pflag > 1)
 201                 usage();
 202
 203         if (Hflag + Lflag + Pflag == 0)
 204                 Pflag = 1;                      /* -P (physical) is default */
 205
 206         if (Hflag)
 207                 ftsoptions |= FTS_COMFOLLOW;
 208
 209         if (Lflag)
 210                 ftsoptions |= FTS_LOGICAL;
 211
 212         if (Pflag)
 213                 ftsoptions |= FTS_PHYSICAL;
 214
 215         listall = 0;
 216
 217         if (aflag) {
 218                 if (sflag || dflag)
 219                         usage();
 220                 listall = 1;
 221         } else if (sflag) {
 222                 if (dflag)
 223                         usage();
 224                 depth = 0;
 225         }
 226
 227         if (!*argv) {
 228                 argv = save;
 229                 argv[0] = dot;
 230                 argv[1] = NULL;
 231         }
 232
 233         (void) getbsize(&notused, &blocksize);
 234         blocksize /= 512;
 235
 236         rval = 0;
 237
 238         if ((fts = fts_open(argv, ftsoptions, NULL)) == NULL)
 239                 err(1, "fts_open");
 240
 241         while ((p = fts_read(fts)) != NULL) {
 242                 switch (p->fts_info) {
 243                         case FTS_D:                     /* Ignore. */
 244                                 if (ignorep(p))
 245                                         fts_set(fts, p, FTS_SKIP);
 246                                 break;
 247                         case FTS_DP:
 248                                 if (ignorep(p))
 249                                         break;
 250
 251                                 ftsparnum = (off_t *)&p->fts_parent->fts_number;
 252                                 ftsnum = (off_t *)&p->fts_number;
 253                                 if (p->fts_statp->st_size < TWO_TB) {
 254                                     ftsparnum[0] += ftsnum[0] += p->fts_statp->st_blocks;
 255                                 } else {
 256                                     ftsparnum[0] += ftsnum[0] += howmany(p->fts_statp->st_size, 512LL);
 257                                 }
 258
 259                                 if (p->fts_level <= depth) {
 260                                         if (hflag) {
 261                                                 (void) prthumanval(howmany(*ftsnum, blocksize));
 262                                                 (void) printf("\t%s\n", p->fts_path);
 263                                         } else {
 264                                         (void) printf("%lld\t%s\n",
 265                                             howmany(*ftsnum, blocksize),
 266                                             p->fts_path);
 267                                         }
 268                                 }
 269                                 break;
 270                         case FTS_DC:                    /* Ignore. */
 271                                 break;
 272                         case FTS_DNR:                   /* Warn, continue. */
 273                         case FTS_ERR:
 274                         case FTS_NS:
 275                                 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
 276                                 rval = 1;
 277                                 break;
 278                         default:
 279                                 if (ignorep(p))
 280                                         break;
 281
 282                                 if (p->fts_statp->st_nlink > 1 && linkchk(p))
 283                                         break;
 284
 285                                 if (listall || p->fts_level == 0) {
 286                                         if (hflag) {
 287                                             if (p->fts_statp->st_size < TWO_TB) {
 288                                                 (void) prthumanval(howmany(p->fts_statp->st_blocks,
 289                                                         blocksize));
 290                                             } else {
 291                                                 (void) prthumanval(howmany(howmany(p->fts_statp->st_size, 512LL),
 292                                                         blocksize));
 293                                             }
 294                                                 (void) printf("\t%s\n", p->fts_path);
 295                                         } else {
 296                                             if (p->fts_statp->st_size < TWO_TB) {
 297                                                 (void) printf("%qd\t%s\n",
 298                                                         (long long)howmany(p->fts_statp->st_blocks, blocksize),
 299                                                         p->fts_path);
 300                                             } else {
 301                                                 (void) printf("%qd\t%s\n",
 302                                                         (long long)howmany(howmany(p->fts_statp->st_size, 512LL), blocksize),
 303                                                         p->fts_path);
 304                                             }
 305                                         }
 306                                 }
 307
 308                                 ftsparnum = (off_t *)&p->fts_parent->fts_number;
 309                                 if (p->fts_statp->st_size < TWO_TB) {
 310                                     ftsparnum[0] += p->fts_statp->st_blocks;
 311                                 } else {
 312                                     ftsparnum[0] += p->fts_statp->st_size / 512LL;
 313                                 }
 314                 }
 315                 savednumber = ((off_t *)&p->fts_parent->fts_number)[0];
 316         }
 317
 318         if (errno)
 319                 err(1, "fts_read");
 320
 321         if (cflag) {
 322                 if (hflag) {
 323                         (void) prthumanval(howmany(savednumber, blocksize));
 324                         (void) printf("\ttotal\n");
 325                 } else {
 326                         (void) printf("%lld\ttotal\n", howmany(savednumber, blocksize));
 327                 }
 328         }
 329
 330         ignoreclean();
 331         exit(rval);
 332 }
 333
 334
 335 typedef struct _ID {
 336         dev_t   dev;
 337         ino_t   inode;
 338 } ID;
 339
 340
 341 int
 342 linkchk(FTSENT *p)
 343 {
 344         static ID *files;
 345         static int maxfiles, nfiles;
 346         ID *fp, *start;
 347         ino_t ino;
 348         dev_t dev;
 349
 350         ino = p->fts_statp->st_ino;
 351         dev = p->fts_statp->st_dev;
 352         if ((start = files) != NULL)
 353                 for (fp = start + nfiles - 1; fp >= start; --fp)
 354                         if (ino == fp->inode && dev == fp->dev)
 355                                 return (1);
 356
 357         if (nfiles == maxfiles && (files = realloc((char *)files,
 358             (u_int)(sizeof(ID) * (maxfiles += 128)))) == NULL)
 359                 errx(1, "can't allocate memory");
 360         files[nfiles].inode = ino;
 361         files[nfiles].dev = dev;
 362         ++nfiles;
 363         return (0);
 364 }
 365
 366 /*
 367  * Output in "human-readable" format.  Uses 3 digits max and puts
 368  * unit suffixes at the end.  Makes output compact and easy to read,
 369  * especially on huge disks.
 370  *
 371  */
 372 unit_t
 373 unit_adjust(double *val)
 374 {
 375         double abval;
 376         unit_t unit;
 377         unsigned int unit_sz;
 378
 379         abval = fabs(*val);
 380
 381         unit_sz = abval ? ilogb(abval) / 10 : 0;
 382
 383         if (unit_sz >= UNIT_MAX) {
 384                 unit = NONE;
 385         } else {
 386                 unit = unitp[unit_sz];
 387                 *val /= (double)valp[unit_sz];
 388         }
 389
 390         return (unit);
 391 }
 392
 393 void
 394 prthumanval(double bytes)
 395 {
 396         unit_t unit;
 397
 398         bytes *= 512;
 399         unit = unit_adjust(&bytes);
 400
 401         if (bytes == 0)
 402                 (void)printf("  0B");
 403         else if (bytes > 10)
 404                 (void)printf("%3.0f%c", bytes, "BKMGTPE"[unit]);
 405         else
 406                 (void)printf("%3.1f%c", bytes, "BKMGTPE"[unit]);
 407 }
 408
 409 static void
 410 usage(void)
 411 {
 412         (void)fprintf(stderr,
 413                 "usage: du [-H | -L | -P] [-a | -s | -d depth] [-c] [-h | -k] [-x] [-I mask] [file ...]\n");
 414         exit(EX_USAGE);
 415 }
 416
 417 void
 418 ignoreadd(const char *mask)
 419 {
 420         struct ignentry *ign;
 421
 422         ign = calloc(1, sizeof(*ign));
 423         if (ign == NULL)
 424                 errx(1, "cannot allocate memory");
 425         ign->mask = strdup(mask);
 426         if (ign->mask == NULL)
 427                 errx(1, "cannot allocate memory");
 428         SLIST_INSERT_HEAD(&ignores, ign, next);
 429 }
 430
 431 void
 432 ignoreclean(void)
 433 {
 434         struct ignentry *ign;
 435
 436         while (!SLIST_EMPTY(&ignores)) {
 437                 ign = SLIST_FIRST(&ignores);
 438                 SLIST_REMOVE_HEAD(&ignores, next);
 439                 free(ign->mask);
 440                 free(ign);
 441         }
 442 }
 443
 444 int
 445 ignorep(FTSENT *ent)
 446 {
 447         struct ignentry *ign;
 448
 449         SLIST_FOREACH(ign, &ignores, next)
 450                 if (fnmatch(ign->mask, ent->fts_name, 0) != FNM_NOMATCH)
 451                         return 1;
 452         return 0;
 453 }