du.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1989 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Chris Newcomb.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #ifndef lint
38 1.1 cgd char copyright[] =
39 1.1 cgd "@(#) Copyright (c) 1989 The Regents of the University of California.\n\
40 1.1 cgd All rights reserved.\n";
41 1.1 cgd #endif /* not lint */
42 1.1 cgd
43 1.1 cgd #ifndef lint
44 1.2 mycroft /*static char sccsid[] = "from: @(#)du.c 5.12 (Berkeley) 6/20/91";*/
45 1.2 mycroft static char rcsid[] = "$Id: du.c,v 1.2 1993/08/01 18:16:53 mycroft Exp $";
46 1.1 cgd #endif /* not lint */
47 1.1 cgd
48 1.1 cgd #include <sys/param.h>
49 1.1 cgd #include <sys/stat.h>
50 1.1 cgd #include <sys/errno.h>
51 1.1 cgd #include <dirent.h>
52 1.1 cgd #include <stdio.h>
53 1.1 cgd #include <fts.h>
54 1.1 cgd #include <string.h>
55 1.1 cgd #include <stdlib.h>
56 1.1 cgd
57 1.1 cgd main(argc, argv)
58 1.1 cgd int argc;
59 1.1 cgd char **argv;
60 1.1 cgd {
61 1.1 cgd extern int optind;
62 1.1 cgd register FTS *fts;
63 1.1 cgd register FTSENT *p;
64 1.1 cgd register int kvalue, listdirs, listfiles;
65 1.1 cgd int aflag, ch, ftsoptions, sflag;
66 1.1 cgd char **save;
67 1.1 cgd
68 1.1 cgd ftsoptions = FTS_PHYSICAL;
69 1.1 cgd kvalue = 0;
70 1.1 cgd save = argv;
71 1.1 cgd aflag = sflag = 0;
72 1.1 cgd while ((ch = getopt(argc, argv, "aksx")) != EOF)
73 1.1 cgd switch(ch) {
74 1.1 cgd case 'a':
75 1.1 cgd aflag = 1;
76 1.1 cgd break;
77 1.1 cgd case 'k':
78 1.1 cgd kvalue = 1;
79 1.1 cgd break;
80 1.1 cgd case 's':
81 1.1 cgd sflag = 1;
82 1.1 cgd break;
83 1.1 cgd case 'x':
84 1.1 cgd ftsoptions |= FTS_XDEV;
85 1.1 cgd break;
86 1.1 cgd case '?':
87 1.1 cgd default:
88 1.1 cgd usage();
89 1.1 cgd }
90 1.1 cgd argv += optind;
91 1.1 cgd
92 1.1 cgd if (aflag) {
93 1.1 cgd if (sflag)
94 1.1 cgd usage();
95 1.1 cgd listdirs = listfiles = 1;
96 1.1 cgd } else if (sflag)
97 1.1 cgd listdirs = listfiles = 0;
98 1.1 cgd else {
99 1.1 cgd listfiles = 0;
100 1.1 cgd listdirs = 1;
101 1.1 cgd }
102 1.1 cgd
103 1.1 cgd if (!*argv) {
104 1.1 cgd argv = save;
105 1.1 cgd argv[0] = ".";
106 1.1 cgd argv[1] = NULL;
107 1.1 cgd }
108 1.1 cgd
109 1.1 cgd if (!(fts = fts_open(argv, ftsoptions, (int (*)())NULL))) {
110 1.1 cgd (void)fprintf(stderr, "du: %s.\n", strerror(errno));
111 1.1 cgd exit(1);
112 1.1 cgd }
113 1.1 cgd
114 1.1 cgd while (p = fts_read(fts))
115 1.1 cgd switch(p->fts_info) {
116 1.1 cgd case FTS_D:
117 1.1 cgd break;
118 1.1 cgd case FTS_DP:
119 1.1 cgd p->fts_parent->fts_number +=
120 1.1 cgd p->fts_number += p->fts_statb.st_blocks;
121 1.1 cgd /*
122 1.1 cgd * If listing each directory, or not listing files
123 1.1 cgd * or directories and this is post-order of the
124 1.1 cgd * root of a traversal, display the total.
125 1.1 cgd */
126 1.1 cgd if (listdirs || !listfiles && !p->fts_level)
127 1.1 cgd (void)printf("%ld\t%s\n", kvalue ?
128 1.1 cgd howmany(p->fts_number, 2) :
129 1.1 cgd p->fts_number, p->fts_path);
130 1.1 cgd break;
131 1.1 cgd case FTS_DNR:
132 1.1 cgd case FTS_ERR:
133 1.1 cgd case FTS_NS:
134 1.1 cgd (void)fprintf(stderr,
135 1.1 cgd "du: %s: %s.\n", p->fts_path, strerror(errno));
136 1.1 cgd break;
137 1.1 cgd case FTS_SL:
138 1.1 cgd if (p->fts_level == FTS_ROOTLEVEL) {
139 1.1 cgd (void)fts_set(fts, p, FTS_FOLLOW);
140 1.1 cgd break;
141 1.1 cgd }
142 1.1 cgd /* FALLTHROUGH */
143 1.1 cgd default:
144 1.1 cgd if (p->fts_statb.st_nlink > 1 && linkchk(p))
145 1.1 cgd break;
146 1.1 cgd /*
147 1.1 cgd * If listing each file, or a non-directory file was
148 1.1 cgd * the root of a traversal, display the total.
149 1.1 cgd */
150 1.1 cgd if (listfiles || !p->fts_level)
151 1.1 cgd (void)printf("%ld\t%s\n", kvalue ?
152 1.1 cgd howmany(p->fts_statb.st_blocks, 2) :
153 1.1 cgd p->fts_statb.st_blocks, p->fts_path);
154 1.1 cgd p->fts_parent->fts_number += p->fts_statb.st_blocks;
155 1.1 cgd }
156 1.1 cgd exit(0);
157 1.1 cgd }
158 1.1 cgd
159 1.1 cgd typedef struct _ID {
160 1.1 cgd dev_t dev;
161 1.1 cgd ino_t inode;
162 1.1 cgd } ID;
163 1.1 cgd
164 1.1 cgd linkchk(p)
165 1.1 cgd register FTSENT *p;
166 1.1 cgd {
167 1.1 cgd static ID *files;
168 1.1 cgd static int maxfiles, nfiles;
169 1.1 cgd register ID *fp, *start;
170 1.1 cgd register ino_t ino;
171 1.1 cgd register dev_t dev;
172 1.1 cgd
173 1.1 cgd ino = p->fts_statb.st_ino;
174 1.1 cgd dev = p->fts_statb.st_dev;
175 1.1 cgd if (start = files)
176 1.1 cgd for (fp = start + nfiles - 1; fp >= start; --fp)
177 1.1 cgd if (ino == fp->inode && dev == fp->dev)
178 1.1 cgd return(1);
179 1.1 cgd
180 1.1 cgd if (nfiles == maxfiles && !(files = (ID *)realloc((char *)files,
181 1.1 cgd (u_int)(sizeof(ID) * (maxfiles += 128))))) {
182 1.1 cgd (void)fprintf(stderr, "du: %s\n", strerror(errno));
183 1.1 cgd exit(1);
184 1.1 cgd }
185 1.1 cgd files[nfiles].inode = ino;
186 1.1 cgd files[nfiles].dev = dev;
187 1.1 cgd ++nfiles;
188 1.1 cgd return(0);
189 1.1 cgd }
190 1.1 cgd
191 1.1 cgd usage()
192 1.1 cgd {
193 1.1 cgd (void)fprintf(stderr, "usage: du [-a | -s] [-kx] [file ...]\n");
194 1.1 cgd exit(1);
195 1.1 cgd }
196