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