取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
|
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
/
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
@
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
=
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
" [TYPEINDEX(mode)])
#define COLOR(mode) ("
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
03332
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
033"\
"
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
0
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
04
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
03
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
0
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
00" [TYPEINDEX(mode)])
#define ATTR(mode) ("
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
"\
"
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
|
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
/
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
@
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
=
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
03332
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
033"\
"
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
0
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
04
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
03
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
0
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
00" [TYPEINDEX(mode)])
#define ATTR(mode) ("
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
"\
"
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '7';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "3[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "3[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "3[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "3[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '
取自busybox-0.60.3中的ls.c,并且经过整理,使得能编译运行
#include <sys/types.h>
#include <sys/stat.h>
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <fcntl.h>
#include <signal.h>
#include <termios.h>
#include <sys/ioctl.h>
#include <time.h>
#include <stdarg.h>
#include <pwd.h>
#include <grp.h>
#define MAJOR(dev) (((dev)>>8)&0xff)
#define MINOR(dev) ((dev)&0xff)
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
enum {
KILOBYTE = 1024,
MEGABYTE = (KILOBYTE*1024),
GIGABYTE = (MEGABYTE*1024)
};
/* Some useful definitions */
#define FALSE ((int) 0)
#define TRUE ((int) 1)
#define SKIP ((int) 2)
enum {
TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
COLUMN_GAP = 2, /* includes the file type char */
};
/* what is the overall style of the listing */
enum {
STYLE_AUTO = 0,
STYLE_LONG = 1, /* one record per line, extended info */
STYLE_SINGLE = 2, /* one record per line */
STYLE_COLUMNS = 3 /* fill columns */
};
/* what file information will be listed */
#define LIST_INO (1<<0)
#define LIST_BLOCKS (1<<1)
#define LIST_MODEBITS (1<<2)
#define LIST_NLINKS (1<<3)
#define LIST_ID_NAME (1<<4)
#define LIST_ID_NUMERIC (1<<5)
#define LIST_SIZE (1<<6)
#define LIST_DEV (1<<7)
#define LIST_DATE_TIME (1<<8)
#define LIST_FULLTIME (1<<9)
#define LIST_FILENAME (1<<10)
#define LIST_SYMLINK (1<<11)
#define LIST_FILETYPE (1<<12)
#define LIST_EXEC (1<<13)
/* what files will be displayed */
#define DISP_NORMAL (0) /* show normal filenames */
#define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
#define DISP_HIDDEN (1<<1) /* show filenames starting with . */
#define DISP_DOT (1<<2) /* show . and .. */
#define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
#define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
#define DISP_ROWS (1<<5) /* print across rows */
#define ERR_EXIT(m) (perror_msg(m), exit(EXIT_FAILURE))
/* how will the files be sorted */
static const int SORT_FORWARD = 0; /* sort in reverse order */
static const int SORT_REVERSE = 1; /* sort in reverse order */
static const int SORT_NAME = 2; /* sort by file name */
static const int SORT_SIZE = 3; /* sort by file size */
static const int SORT_ATIME = 4; /* sort by last access time */
static const int SORT_CTIME = 5; /* sort by last change time */
static const int SORT_MTIME = 6; /* sort by last modification time */
static const int SORT_VERSION = 7; /* sort by version */
static const int SORT_EXT = 8; /* sort by file name extension */
static const int SORT_DIR = 9; /* sort by file or directory */
/* which of the three times will be used */
static const int TIME_MOD = 0;
static const int TIME_CHANGE = 1;
static const int TIME_ACCESS = 2;
#define LIST_SHORT (LIST_FILENAME)
#define LIST_ISHORT (LIST_INO | LIST_FILENAME)
#define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
LIST_SYMLINK)
#define LIST_ILONG (LIST_INO | LIST_LONG)
static const int SPLIT_DIR = 0;
static const int SPLIT_FILE = 1;
static const int SPLIT_SUBDIR = 2;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
/* colored LS support */
static int show_color = 0;
#define COLOR(mode) ("\000\043\043\043\042\000\043\043"\
"\000\000\044\000\043\000\000\040" [TYPEINDEX(mode)])
#define ATTR(mode) ("\00\00\01\00\01\00\01\00"\
"\00\00\01\00\01\00\00\01" [TYPEINDEX(mode)])
#define show_usage() usage(argv[0])
/*
* a directory entry and its stat info are stored here
*/
struct dnode { /* the basic node */
char *name; /* the dir entry name */
char *fullname; /* the dir path name */
struct stat dstat; /* the file stat info */
struct dnode *next; /* point at the next node */
};
typedef struct dnode dnode_t;
static struct dnode **list_dir(char *);
static struct dnode **dnalloc(int);
static int list_single(struct dnode *);
static unsigned int disp_opts;
static unsigned int style_fmt;
static unsigned int list_fmt;
static unsigned int sort_opts;
static unsigned int sort_order;
static unsigned int time_fmt;
static unsigned int follow_links=FALSE;
static unsigned short column = 0;
static unsigned short terminal_width = TERMINAL_WIDTH;
static unsigned short column_width = COLUMN_WIDTH;
static unsigned short tabstops = COLUMN_GAP;
static int status = EXIT_SUCCESS;
static unsigned long ls_disp_hr = 0;
#define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
#define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
/* The special bits. If set, display SMODE0/1 instead of MODE0/1 */
static const mode_t SBIT[] = {
0, 0, S_ISUID,
0, 0, S_ISGID,
0, 0, S_ISVTX
};
/* The 9 mode bits to test */
static const mode_t MBIT[] = {
S_IRUSR, S_IWUSR, S_IXUSR,
S_IRGRP, S_IWGRP, S_IXGRP,
S_IROTH, S_IWOTH, S_IXOTH
};
static const char MODE1[] = "rwxrwxrwx";
static const char MODE0[] = "---------";
static const char SMODE1[] = "..s..s..t";
static const char SMODE0[] = "..S..S..T";
char * last_char_is(const char *s, int c);
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit);
const char *mode_string(int mode);
extern char * safe_strncpy(char *dst, const char *src, size_t size);
extern char * xstrdup (const char *s);
extern char * xstrndup (const char *s, int n);
extern char *concat_path_file(const char *path, const char *filename);
extern char *xreadlink(const char *path);
extern int ls_main(int argc, char **argv);
extern void *xcalloc(size_t nmemb, size_t size);
extern void *xmalloc(size_t size);
extern void *xrealloc(void *ptr, size_t size);
extern void perror_msg(const char *str, ...);
FILE *xfopen(const char *path, const char *mode);
int main(int argc, char **argv);
size_t xstrlen(const char *string);
static char append_char(mode_t mode);
static char bgcolor(mode_t mode);
static char fgcolor(mode_t mode);
static int countdirs(struct dnode **dn, int nfiles);
static int countfiles(struct dnode **dnp);
static int countsubdirs(struct dnode **dn, int nfiles);
static int is_subdir(struct dnode *dn);
static int list_single(struct dnode *dn);
static int my_stat(struct dnode *cur);
static int sortcmp(struct dnode *d1, struct dnode *d2);
static struct dnode **dnalloc(int num);
static struct dnode **list_dir(char *path);
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which);
static void dfree(struct dnode **dnp);
static void newline(void);
static void nexttabstop( void );
static void shellsort(struct dnode **dn, int size);
static void showdirs(struct dnode **dn, int ndirs);
static void showfiles(struct dnode **dn, int nfiles);
void my_getgrgid(char *group, long gid);
void my_getpwuid(char *name, long uid);
void usage(char *prog);
/*----------------------------------------------------------------------*/
static int my_stat(struct dnode *cur)
{
if (follow_links == TRUE) {
if (stat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
}
else if (lstat(cur->fullname, &cur->dstat)) {
perror_msg("ls: ", cur->fullname, NULL);
status = EXIT_FAILURE;
free(cur->fullname);
free(cur);
return -1;
}
return 0;
}
/*----------------------------------------------------------------------*/
static void newline(void)
{
if (column > 0) {
putchar('\n');
column = 0;
}
}
/*----------------------------------------------------------------------*/
static char append_char(mode_t mode)
{
if ( !(list_fmt & LIST_FILETYPE))
return '\0';
if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
&& (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
return APPCHAR(mode);
}
/*----------------------------------------------------------------------*/
static void nexttabstop( void )
{
static short nexttab= 0;
int n=0;
if (column > 0) {
n= nexttab - column;
if (n < 1) n= 1;
while (n--) {
putchar(' ');
column++;
}
}
nexttab= column + column_width + COLUMN_GAP;
}
/*----------------------------------------------------------------------*/
static int is_subdir(struct dnode *dn)
{
return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
strcmp(dn->name, "..") != 0);
}
/*----------------------------------------------------------------------*/
static int countdirs(struct dnode **dn, int nfiles)
{
int i, dirs;
if (dn==NULL || nfiles < 1) return(0);
dirs= 0;
for (i=0; i<nfiles; i++) {
if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
}
return(dirs);
}
/*----------------------------------------------------------------------*/
static int countsubdirs(struct dnode **dn, int nfiles)
{
int i, subdirs;
if (dn == NULL || nfiles < 1) return 0;
subdirs = 0;
for (i = 0; i < nfiles; i++)
if (is_subdir(dn[i]))
subdirs++;
return subdirs;
}
/*----------------------------------------------------------------------*/
static int countfiles(struct dnode **dnp)
{
int nfiles;
struct dnode *cur;
if (dnp == NULL) return(0);
nfiles= 0;
for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
nfiles++;
return(nfiles);
}
/* get memory to hold an array of pointers */
static struct dnode **dnalloc(int num)
{
struct dnode **p;
if (num < 1) return(NULL);
p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
return(p);
}
/*----------------------------------------------------------------------*/
static void dfree(struct dnode **dnp)
{
struct dnode *cur, *next;
if(dnp == NULL) return;
cur=dnp[0];
while (cur != NULL) {
if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
next= cur->next;
free(cur); /* free the dnode */
cur= next;
}
free(dnp); /* free the array holding the dnode pointers */
}
/*----------------------------------------------------------------------*/
static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
{
int dncnt, i, d;
struct dnode **dnp;
if (dn==NULL || nfiles < 1) return(NULL);
/* count how many dirs and regular files there are */
if (which == SPLIT_SUBDIR)
dncnt = countsubdirs(dn, nfiles);
else {
dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
if (which == SPLIT_FILE)
dncnt= nfiles - dncnt; /* looking for files */
}
/* allocate a file array and a dir array */
dnp= dnalloc(dncnt);
/* copy the entrys into the file or dir array */
for (d= i=0; i<nfiles; i++) {
if (which == SPLIT_DIR) {
if (S_ISDIR(dn[i]->dstat.st_mode)) {
dnp[d++]= dn[i];
} /* else skip the file */
} else if (which == SPLIT_SUBDIR) {
if (is_subdir(dn[i])) {
dnp[d++]= dn[i];
} /* else skip the file or dir */
} else {
if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
dnp[d++]= dn[i];
} /* else skip the dir */
}
}
return(dnp);
}
/*----------------------------------------------------------------------*/
static int sortcmp(struct dnode *d1, struct dnode *d2)
{
int cmp, dif;
cmp= 0;
if (sort_opts == SORT_SIZE) {
dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
} else if (sort_opts == SORT_ATIME) {
dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
} else if (sort_opts == SORT_CTIME) {
dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
} else if (sort_opts == SORT_MTIME) {
dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
} else if (sort_opts == SORT_DIR) {
dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
} else { /* assume SORT_NAME */
dif= 0;
}
if (dif > 0) cmp= -1;
if (dif < 0) cmp= 1;
if (dif == 0) {
/* sort by name- may be a tie_breaker for time or size cmp */
dif= strcmp(d1->name, d2->name);
if (dif > 0) cmp= 1;
if (dif < 0) cmp= -1;
}
if (sort_order == SORT_REVERSE) {
cmp= -1 * cmp;
}
return(cmp);
}
/*----------------------------------------------------------------------*/
static void shellsort(struct dnode **dn, int size)
{
struct dnode *temp;
int gap, i, j;
/* shell sort the array */
if(dn==NULL || size < 2) return;
for (gap= size/2; gap>0; gap /=2) {
for (i=gap; i<size; i++) {
for (j= i-gap; j>=0; j-=gap) {
if (sortcmp(dn[j], dn[j+gap]) <= 0)
break;
/* they are out of order, swap them */
temp= dn[j];
dn[j]= dn[j+gap];
dn[j+gap]= temp;
}
}
}
}
/*----------------------------------------------------------------------*/
static void showfiles(struct dnode **dn, int nfiles)
{
int i, ncols, nrows, row, nc;
int len;
if(dn==NULL || nfiles < 1) return;
/* find the longest file name- use that as the column width */
column_width= 0;
for (i=0; i<nfiles; i++) {
len= strlen(dn[i]->name) +
((list_fmt & LIST_INO) ? 8 : 0) +
((list_fmt & LIST_BLOCKS) ? 5 : 0)
;
if (column_width < len)
column_width= len;
}
ncols = 1;
if (column_width >= 1)
ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
else {
ncols = 1;
column_width = COLUMN_WIDTH;
}
//ncols= TERMINAL_WIDTH;
switch (style_fmt) {
case STYLE_LONG: /* one record per line, extended info */
case STYLE_SINGLE: /* one record per line */
ncols= 1;
break;
}
if (ncols > 1) {
nrows = nfiles / ncols;
} else {
nrows = nfiles;
ncols = 1;
}
if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
if (nrows > nfiles) nrows= nfiles;
for (row=0; row<nrows; row++) {
for (nc=0; nc<ncols; nc++) {
/* reach into the array based on the column and row */
i= (nc * nrows) + row; /* assume display by column */
if (disp_opts & DISP_ROWS)
i= (row * ncols) + nc; /* display across row */
if (i < nfiles) {
nexttabstop();
list_single(dn[i]);
}
}
newline();
}
}
/*----------------------------------------------------------------------*/
static void showdirs(struct dnode **dn, int ndirs)
{
int i, nfiles;
struct dnode **subdnp;
int dndirs;
struct dnode **dnd;
if (dn==NULL || ndirs < 1) return;
for (i=0; i<ndirs; i++) {
if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
printf("\n%s:\n", dn[i]->fullname);
}
subdnp= list_dir(dn[i]->fullname);
nfiles= countfiles(subdnp);
if (nfiles > 0) {
/* list all files at this level */
shellsort(subdnp, nfiles);
showfiles(subdnp, nfiles);
if (disp_opts & DISP_RECURSIVE) {
/* recursive- list the sub-dirs */
dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
dndirs= countsubdirs(subdnp, nfiles);
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
free(dnd); /* free the array of dnode pointers to the dirs */
}
}
dfree(subdnp); /* free the dnodes and the fullname mem */
}
}
}
/*----------------------------------------------------------------------*/
static struct dnode **list_dir(char *path)
{
struct dnode *dn, *cur, **dnp;
struct dirent *entry;
DIR *dir;
int i, nfiles;
if (path==NULL) return(NULL);
dn= NULL;
nfiles= 0;
dir = opendir(path);
if (dir == NULL) {
perror_msg("ls: ", path, NULL);
status = EXIT_FAILURE;
return(NULL); /* could not open the dir */
}
while ((entry = readdir(dir)) != NULL) {
/* are we going to list the file- it may be . or .. or a hidden file */
if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
continue;
if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
continue;
if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
continue;
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname = concat_path_file(path, entry->d_name);
cur->name = cur->fullname +
(strlen(cur->fullname) - strlen(entry->d_name));
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
closedir(dir);
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
if (nfiles < 1) return(NULL);
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
return(dnp);
}
void my_getpwuid(char *name, long uid)
{
struct passwd *myuser;
myuser = getpwuid(uid);
if (myuser==NULL)
sprintf(name, "%-8ld ", (long)uid);
else
strcpy(name, myuser->pw_name);
}
void my_getgrgid(char *group, long gid)
{
struct group *mygroup;
mygroup = getgrgid(gid);
if (mygroup==NULL)
sprintf(group, "%-8ld ", (long)gid);
else
strcpy(group, mygroup->gr_name);
}
static char fgcolor(mode_t mode)
{
/* Check if the file is missing */
if ( errno == ENOENT ) {
errno = 0;
/* Color it red! */
return '\037';
}
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return COLOR(0xF000); /* File is executable ... */
return COLOR(mode);
}
/*----------------------------------------------------------------------*/
static char bgcolor(mode_t mode)
{
if ( LIST_EXEC && S_ISREG( mode )
&& ( mode & ( S_IXUSR | S_IXGRP | S_IXOTH ) ) )
return ATTR(0xF000); /* File is executable ... */
return ATTR(mode);
}
/*
* Return the standard ls-like mode string from a file mode.
* This is static and so is overwritten on each call.
*/
const char *mode_string(int mode)
{
static char buf[12];
int i;
buf[0] = TYPECHAR(mode);
for (i = 0; i < 9; i++) {
if (mode & SBIT[i])
buf[i + 1] = (mode & MBIT[i]) ? SMODE1[i] : SMODE0[i];
else
buf[i + 1] = (mode & MBIT[i]) ? MODE1[i] : MODE0[i];
}
return buf;
}
/*----------------------------------------------------------------------*/
static int list_single(struct dnode *dn)
{
int i;
char scratch[BUFSIZ + 1];
char *filetime;
time_t ttime, age;
struct stat info;
char append;
if (dn==NULL || dn->fullname==NULL) return(0);
ttime= dn->dstat.st_mtime; /* the default time */
if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
filetime= ctime(&ttime);
append = append_char(dn->dstat.st_mode);
for (i=0; i<=31; i++) {
switch (list_fmt & (1<<i)) {
case LIST_INO:
printf("%7ld ", (long int)dn->dstat.st_ino);
column += 8;
break;
case LIST_BLOCKS:
fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
printf("%4lld ", dn->dstat.st_blocks>>1);
printf("%4ld ", dn->dstat.st_blocks>>1);
column += 5;
break;
case LIST_MODEBITS:
printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
column += 10;
break;
case LIST_NLINKS:
printf("%4ld ", (long)dn->dstat.st_nlink);
column += 10;
break;
case LIST_ID_NAME:
my_getpwuid(scratch, dn->dstat.st_uid);
printf("%-8.8s ", scratch);
my_getgrgid(scratch, dn->dstat.st_gid);
printf("%-8.8s", scratch);
column += 17;
break;
case LIST_ID_NUMERIC:
printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
column += 17;
break;
case LIST_SIZE:
case LIST_DEV:
if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
} else {
if (ls_disp_hr==TRUE) {
fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
} else
{
printf("%9lld ", (long long)dn->dstat.st_size);
printf("%9ld ", dn->dstat.st_size);
}
}
column += 10;
break;
case LIST_FULLTIME:
case LIST_DATE_TIME:
if (list_fmt & LIST_FULLTIME) {
printf("%24.24s ", filetime);
column += 25;
break;
}
age = time(NULL) - ttime;
printf("%6.6s ", filetime+4);
if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
/* hh:mm if less than 6 months old */
printf("%5.5s ", filetime+11);
} else {
printf(" %4.4s ", filetime+20);
}
column += 13;
break;
case LIST_FILENAME:
errno = 0;
if (show_color && !lstat(dn->fullname, &info)) {
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", dn->name);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(dn->name);
break;
case LIST_SYMLINK:
if (S_ISLNK(dn->dstat.st_mode)) {
char *lpath = xreadlink(dn->fullname);
if (lpath) {
printf(" -> ");
if (!stat(dn->fullname, &info)) {
append = append_char(info.st_mode);
}
if (show_color) {
errno = 0;
printf( "\033[%d;%dm", bgcolor(info.st_mode),
fgcolor(info.st_mode) );
}
printf("%s", lpath);
if (show_color) {
printf( "\033[0m" );
}
column += strlen(lpath) + 4;
free(lpath);
}
}
break;
case LIST_FILETYPE:
if (append != '\0') {
printf("%1c", append);
column++;
}
break;
}
}
return(0);
}
void usage(char *prog)
{
fprintf(stderr,
"Usage: %s [ -q ] [ -o offset ] [ -f frequency ] [ -p timeconstant ] [ -t tick ]\n",
prog);
}
/*----------------------------------------------------------------------*/
extern int ls_main(int argc, char **argv)
{
struct dnode **dnf, **dnd;
int dnfiles, dndirs;
struct dnode *dn, *cur, **dnp;
int i, nfiles;
int opt;
int oi, ac;
char **av;
struct winsize win = { 0, 0, 0, 0 };
disp_opts= DISP_NORMAL;
style_fmt= STYLE_AUTO;
list_fmt= LIST_SHORT;
sort_opts= SORT_NAME;
sort_order= SORT_FORWARD;
time_fmt= TIME_MOD;
ioctl(fileno(stdout), TIOCGWINSZ, &win);
if (win.ws_row > 4)
column_width = win.ws_row - 2;
if (win.ws_col > 0)
terminal_width = win.ws_col - 1;
nfiles=0;
if (isatty(fileno(stdout)))
show_color = 1;
/* process options */
while ((opt = getopt(argc, argv, "1AaCdgilnsx"
"T:w:"
"Fp"
"R"
"rSvX"
"cetu"
"L"
"h"
"k")) > 0) {
switch (opt) {
case '1': style_fmt = STYLE_SINGLE; break;
case 'A': disp_opts |= DISP_HIDDEN; break;
case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
case 'C': style_fmt = STYLE_COLUMNS; break;
case 'd': disp_opts |= DISP_NOLIST; break;
case 'g': /* ignore -- for ftp servers */ break;
case 'i': list_fmt |= LIST_INO; break;
case 'l':
style_fmt = STYLE_LONG;
list_fmt |= LIST_LONG;
ls_disp_hr = FALSE;
break;
case 'n': list_fmt |= LIST_ID_NUMERIC; break;
case 's': list_fmt |= LIST_BLOCKS; break;
case 'x': disp_opts = DISP_ROWS; break;
case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
case 'p': list_fmt |= LIST_FILETYPE; break;
case 'R': disp_opts |= DISP_RECURSIVE; break;
case 'r': sort_order |= SORT_REVERSE; break;
case 'S': sort_opts= SORT_SIZE; break;
case 'v': sort_opts= SORT_VERSION; break;
case 'X': sort_opts= SORT_EXT; break;
case 'e': list_fmt |= LIST_FULLTIME; break;
case 'c':
time_fmt = TIME_CHANGE;
sort_opts= SORT_CTIME;
break;
case 'u':
time_fmt = TIME_ACCESS;
sort_opts= SORT_ATIME;
break;
case 't':
sort_opts= SORT_MTIME;
break;
case 'L': follow_links= TRUE; break;
case 'T': tabstops= atoi(optarg); break;
case 'w': terminal_width= atoi(optarg); break;
case 'h': ls_disp_hr = TRUE; break;
case 'k': break;
default:
goto print_usage_message;
}
}
/* sort out which command line options take precedence */
if (disp_opts & DISP_NOLIST)
disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
if (style_fmt != STYLE_LONG)
list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
/* choose a display format */
if (style_fmt == STYLE_AUTO)
style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
/*
* when there are no cmd line args we have to supply a default "." arg.
* we will create a second argv array, "av" that will hold either
* our created "." arg, or the real cmd line args. The av array
* just holds the pointers- we don't move the date the pointers
* point to.
*/
ac= argc - optind; /* how many cmd line args are left */
if (ac < 1) {
av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
av[0]= xstrdup(".");
ac=1;
} else {
av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
for (oi=0 ; oi < ac; oi++) {
av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
}
}
/* now, everything is in the av array */
if (ac > 1)
disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
/* stuff the command line file names into an dnode array */
dn=NULL;
for (oi=0 ; oi < ac; oi++) {
cur= (struct dnode *)xmalloc(sizeof(struct dnode));
cur->fullname= xstrdup(av[oi]);
cur->name= cur->fullname;
if (my_stat(cur))
continue;
cur->next= dn;
dn= cur;
nfiles++;
}
/* now that we know how many files there are
** allocate memory for an array to hold dnode pointers
*/
dnp= dnalloc(nfiles);
for (i=0, cur=dn; i<nfiles; i++) {
dnp[i]= cur; /* save pointer to node in array */
cur= cur->next;
}
if (disp_opts & DISP_NOLIST) {
shellsort(dnp, nfiles);
if (nfiles > 0) showfiles(dnp, nfiles);
} else {
dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
dndirs= countdirs(dnp, nfiles);
dnfiles= nfiles - dndirs;
if (dnfiles > 0) {
shellsort(dnf, dnfiles);
showfiles(dnf, dnfiles);
}
if (dndirs > 0) {
shellsort(dnd, dndirs);
showdirs(dnd, dndirs);
}
}
return(status);
print_usage_message:
show_usage();
}
extern void perror_msg(const char *str, ...)
{
va_list list;
char *next_arg;
char msg[555] = "";
next_arg = (char *)str;
va_start(list,str);
while ( next_arg ) {
strcat(msg, next_arg);
next_arg = va_arg(list,char*);
}
perror(msg);
va_end(list);
}
const char *make_human_readable_str(unsigned long size,
unsigned long block_size,
unsigned long display_unit)
{
/* The code will adjust for additional (appended) units. */
static const char zero_and_units[] = { '0', 0, 'k', 'M', 'G', 'T' };
static const char fmt[] = "%Lu";
static const char fmt_tenths[] = "%Lu.%d%c";
static char str[21]; /* Sufficient for 64 bit unsigned integers. */
unsigned long long val;
int frac;
const char *u;
const char *f;
u = zero_and_units;
f = fmt;
frac = 0;
val = ((unsigned long long) size) * block_size;
if (val == 0) {
return u;
}
if (display_unit) {
val += display_unit/2; /* Deal with rounding. */
val /= display_unit; /* Don't combine with the line above!!! */
} else {
++u;
while ((val >= KILOBYTE)
&& (u < zero_and_units + sizeof(zero_and_units) - 1)) {
f = fmt_tenths;
++u;
frac = ((((int)(val % KILOBYTE)) * 10) + (KILOBYTE/2)) / KILOBYTE;
val /= KILOBYTE;
}
if (frac >= 10) { /* We need to round up here. */
++val;
frac = 0;
}
}
/* If f==fmt then 'frac' and 'u' are ignored. */
snprintf(str, sizeof(str), f, val, frac, *u);
return str;
}
extern char *concat_path_file(const char *path, const char *filename)
{
char *outbuf;
char *lc;
if (!path)
path="";
lc = last_char_is(path, '/');
while (*filename == '/')
filename++;
outbuf = xmalloc(strlen(path)+strlen(filename)+1+(lc==NULL));
sprintf(outbuf, "%s%s%s", path, (lc==NULL)? "/" : "", filename);
return outbuf;
}
extern char *xreadlink(const char *path)
{
static const int GROWBY = 80; /* how large we will grow strings by */
char *buf = NULL;
int bufsize = 0, readsize = 0;
do {
buf = xrealloc(buf, bufsize += GROWBY);
readsize = readlink(path, buf, bufsize); /* 1st try */
if (readsize == -1) {
perror_msg("ls: ", path, NULL);
return NULL;
}
}
while (bufsize < readsize + 1);
buf[readsize] = '\0';
return buf;
}
extern void *xmalloc(size_t size)
{
void *ptr = malloc(size);
if (ptr == NULL && size != 0)
ERR_EXIT("malloc");
return ptr;
}
extern void *xrealloc(void *ptr, size_t size)
{
ptr = realloc(ptr, size);
if (ptr == NULL && size != 0)
ERR_EXIT("realloc");
return ptr;
}
extern void *xcalloc(size_t nmemb, size_t size)
{
void *ptr = calloc(nmemb, size);
if (ptr == NULL && nmemb != 0 && size != 0)
ERR_EXIT("calloc");
return ptr;
}
extern char * xstrdup (const char *s) {
char *t;
if (s == NULL)
return NULL;
t = strdup (s);
if (t == NULL)
ERR_EXIT("strdup");
return t;
}
extern char * safe_strncpy(char *dst, const char *src, size_t size)
{
dst[size-1] = '\0';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}
';
return strncpy(dst, src, size-1);
}
extern char * xstrndup (const char *s, int n) {
char *t;
if (s == NULL)
ERR_EXIT("xstrndup bug");
t = xmalloc(++n);
return safe_strncpy(t,s,n);
}
FILE *xfopen(const char *path, const char *mode)
{
FILE *fp;
if ((fp = fopen(path, mode)) == NULL)
ERR_EXIT(path);
return fp;
}
/* Stupid gcc always includes its own builtin strlen()... */
size_t xstrlen(const char *string)
{
return(strlen(string));
}
char * last_char_is(const char *s, int c)
{
char *sret;
if (!s)
return NULL;
sret = (char *)s+strlen(s)-1;
if (sret>=s && *sret == c) {
return sret;
} else {
return NULL;
}
}
int main(int argc, char **argv)
{
ls_main(argc, argv);
return 0;
}#inc