* Mini du implementation for busybox
*
*
- * Copyright (C) 1999 by Lineo, inc.
+ * Copyright (C) 1999,2000,2001 by Lineo, inc.
* Written by John Beppu <beppu@lineo.com>
*
* This program is free software; you can redistribute it and/or modify
*
*/
-#include "internal.h"
+#include "busybox.h"
#define BB_DECLARE_EXTERN
#define bb_need_name_too_long
#include "messages.c"
#include <fcntl.h>
#include <dirent.h>
#include <stdio.h>
+#include <stdlib.h>
+#include <getopt.h>
#include <errno.h>
-#include <sys/param.h> /* for PATH_MAX */
-typedef void (Display) (long, char *);
-
-typedef struct inode_type {
- struct inode_type *next;
- ino_t ino;
-} INODETYPE;
-
-#define HASH_SIZE 311 /* Should be prime */
-#define hash_inode(i) ((i) % HASH_SIZE)
+#ifdef BB_FEATURE_HUMAN_READABLE
+unsigned long du_disp_hr = KILOBYTE;
+#endif
-static INODETYPE *inode_hash_list[HASH_SIZE];
-
-static const char du_usage[] =
- "du [OPTION]... [FILE]...\n\n"
- "Summarize disk space used for each FILE and/or directory.\n"
- "Disk space is printed in units of 1024 bytes.\n\n"
- "Options:\n"
- "\t-l\tcount sizes many times if hard linked\n"
- "\t-s\tdisplay only a total for each argument\n";
+typedef void (Display) (long, char *);
static int du_depth = 0;
static int count_hardlinks = 0;
static void print_normal(long size, char *filename)
{
- fprintf(stdout, "%ld\t%s\n", size, filename);
+#ifdef BB_FEATURE_HUMAN_READABLE
+ printf("%s\t%s\n", format((size * KILOBYTE), du_disp_hr), filename);
+#else
+ printf("%ld\t%s\n", size, filename);
+#endif
}
static void print_summary(long size, char *filename)
{
if (du_depth == 1) {
+printf("summary\n");
print_normal(size, filename);
}
}
-/* Return 1 if inode is in inode hash list, else return 0 */
-static int is_in_list(const ino_t ino)
-{
- INODETYPE *inode;
-
- inode = inode_hash_list[hash_inode(ino)];
- while (inode != NULL) {
- if (inode->ino == ino)
- return 1;
- inode = inode->next;
- }
-
- return 0;
-}
-
-/* Add inode to inode hash list */
-static void add_inode(const ino_t ino)
-{
- int i;
- INODETYPE *inode;
-
- i = hash_inode(ino);
- inode = malloc(sizeof(INODETYPE));
- if (inode == NULL)
- fatalError("du: Not enough memory.");
-
- inode->ino = ino;
- inode->next = inode_hash_list[i];
- inode_hash_list[i] = inode;
-}
-
-/* Clear inode hash list */
-static void reset_inode_list(void)
-{
- int i;
- INODETYPE *inode;
-
- for (i = 0; i < HASH_SIZE; i++) {
- while (inode_hash_list[i] != NULL) {
- inode = inode_hash_list[i]->next;
- free(inode_hash_list[i]);
- inode_hash_list[i] = inode;
- }
- }
-}
-
/* tiny recursive du */
static long du(char *filename)
{
int len;
if ((lstat(filename, &statbuf)) != 0) {
- printf("du: %s: %s\n", filename, strerror(errno));
- return 0;
+ perror_msg_and_die("%s", filename);
}
du_depth++;
filename[--len] = '\0';
while ((entry = readdir(dir))) {
- char newfile[PATH_MAX + 1];
+ char newfile[BUFSIZ + 1];
char *name = entry->d_name;
if ((strcmp(name, "..") == 0)
continue;
}
- if (len + strlen(name) + 1 > PATH_MAX) {
- fprintf(stderr, name_too_long, "du");
+ if (len + strlen(name) + 1 > BUFSIZ) {
+ error_msg(name_too_long);
du_depth--;
return 0;
}
}
else if (statbuf.st_nlink > 1 && !count_hardlinks) {
/* Add files with hard links only once */
- if (is_in_list(statbuf.st_ino)) {
+ if (is_in_ino_dev_hashtable(&statbuf, NULL)) {
sum = 0L;
if (du_depth == 1)
print(sum, filename);
}
else {
- add_inode(statbuf.st_ino);
+ add_to_ino_dev_hashtable(&statbuf, NULL);
}
}
du_depth--;
int du_main(int argc, char **argv)
{
+ int status = EXIT_SUCCESS;
int i;
- char opt;
+ int c;
/* default behaviour */
print = print_normal;
/* parse argv[] */
- for (i = 1; i < argc; i++) {
- if (argv[i][0] == '-') {
- opt = argv[i][1];
- switch (opt) {
+ while ((c = getopt(argc, argv, "sl"
+#ifdef BB_FEATURE_HUMAN_READABLE
+"hm"
+#endif
+"k")) != EOF) {
+ switch (c) {
case 's':
- print = print_summary;
- break;
+ print = print_summary;
+ break;
case 'l':
- count_hardlinks = 1;
- break;
- case 'h':
- case '-':
- usage(du_usage);
- break;
+ count_hardlinks = 1;
+ break;
+#ifdef BB_FEATURE_HUMAN_READABLE
+ case 'h': du_disp_hr = 0; break;
+ case 'm': du_disp_hr = MEGABYTE; break;
+ case 'k': du_disp_hr = KILOBYTE; break;
+#else
+ case 'k': break;
+#endif
default:
- fprintf(stderr, "du: invalid option -- %c\n", opt);
- usage(du_usage);
+ usage(du_usage);
}
- } else {
- break;
- }
}
/* go through remaining args (if any) */
- if (i >= argc) {
- du(".");
+ if (optind >= argc) {
+ if (du(".") == 0)
+ status = EXIT_FAILURE;
} else {
long sum;
- for (; i < argc; i++) {
- sum = du(argv[i]);
- if (sum && isDirectory(argv[i], FALSE, NULL)) {
+ for (i=optind; i < argc; i++) {
+ if ((sum = du(argv[i])) == 0)
+ status = EXIT_FAILURE;
+ if(is_directory(argv[i], FALSE, NULL)==FALSE) {
print_normal(sum, argv[i]);
}
- reset_inode_list();
+ reset_ino_dev_hashtable();
}
}
- exit(0);
+ return status;
}
-/* $Id: du.c,v 1.15 2000/02/21 17:27:17 erik Exp $ */
+/* $Id: du.c,v 1.36 2001/01/27 09:33:38 andersen Exp $ */
+/*
+Local Variables:
+c-file-style: "linux"
+c-basic-offset: 4
+tab-width: 4
+End:
+*/