1 /* vi: set sw=4 ts=4: */
3 * Mini du implementation for busybox
6 * Copyright (C) 1999 by Lineo, inc.
7 * Written by John Beppu <beppu@lineo.com>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 * General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
26 #define BB_DECLARE_EXTERN
27 #define bb_need_name_too_long
30 #include <sys/types.h>
35 #include <sys/param.h> /* for PATH_MAX */
37 typedef void (Display) (long, char *);
39 typedef struct inode_type {
40 struct inode_type *next;
44 #define HASH_SIZE 311 /* Should be prime */
45 #define hash_inode(i) ((i) % HASH_SIZE)
47 static INODETYPE *inode_hash_list[HASH_SIZE];
49 static const char du_usage[] =
50 "du [OPTION]... [FILE]...\n\n"
51 "Summarize disk space used for each FILE and/or directory.\n"
52 "Disk space is printed in units of 1024 bytes.\n\n"
54 "\t-l\tcount sizes many times if hard linked\n"
55 "\t-s\tdisplay only a total for each argument\n";
57 static int du_depth = 0;
58 static int count_hardlinks = 0;
60 static Display *print;
62 static void print_normal(long size, char *filename)
64 fprintf(stdout, "%ld\t%s\n", size, filename);
67 static void print_summary(long size, char *filename)
70 print_normal(size, filename);
74 /* Return 1 if inode is in inode hash list, else return 0 */
75 static int is_in_list(const ino_t ino)
79 inode = inode_hash_list[hash_inode(ino)];
80 while (inode != NULL) {
81 if (inode->ino == ino)
89 /* Add inode to inode hash list */
90 static void add_inode(const ino_t ino)
96 inode = malloc(sizeof(INODETYPE));
98 fatalError("du: Not enough memory.");
101 inode->next = inode_hash_list[i];
102 inode_hash_list[i] = inode;
105 /* Clear inode hash list */
106 static void reset_inode_list(void)
111 for (i = 0; i < HASH_SIZE; i++) {
112 while (inode_hash_list[i] != NULL) {
113 inode = inode_hash_list[i]->next;
114 free(inode_hash_list[i]);
115 inode_hash_list[i] = inode;
120 /* tiny recursive du */
121 static long du(char *filename)
127 if ((lstat(filename, &statbuf)) != 0) {
128 printf("du: %s: %s\n", filename, strerror(errno));
133 sum = (statbuf.st_blocks >> 1);
135 /* Don't add in stuff pointed to by symbolic links */
136 if (S_ISLNK(statbuf.st_mode)) {
139 print(sum, filename);
141 if (S_ISDIR(statbuf.st_mode)) {
143 struct dirent *entry;
145 dir = opendir(filename);
151 len = strlen(filename);
152 if (filename[len - 1] == '/')
153 filename[--len] = '\0';
155 while ((entry = readdir(dir))) {
156 char newfile[PATH_MAX + 1];
157 char *name = entry->d_name;
159 if ((strcmp(name, "..") == 0)
160 || (strcmp(name, ".") == 0)) {
164 if (len + strlen(name) + 1 > PATH_MAX) {
165 fprintf(stderr, name_too_long, "du");
169 sprintf(newfile, "%s/%s", filename, name);
174 print(sum, filename);
176 else if (statbuf.st_nlink > 1 && !count_hardlinks) {
177 /* Add files with hard links only once */
178 if (is_in_list(statbuf.st_ino)) {
181 print(sum, filename);
184 add_inode(statbuf.st_ino);
191 int du_main(int argc, char **argv)
196 /* default behaviour */
197 print = print_normal;
200 for (i = 1; i < argc; i++) {
201 if (argv[i][0] == '-') {
205 print = print_summary;
215 fprintf(stderr, "du: invalid option -- %c\n", opt);
223 /* go through remaining args (if any) */
229 for (; i < argc; i++) {
231 if (sum && isDirectory(argv[i], FALSE, NULL)) {
232 print_normal(sum, argv[i]);
241 /* $Id: du.c,v 1.15 2000/02/21 17:27:17 erik Exp $ */