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