1 /* vi: set sw=4 ts=4: */
3 * tiny-ls.c version 0.1.0: A minimalist 'ls'
4 * Copyright (C) 1996 Brian Candler <B.Candler@pobox.com>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 * To achieve a small memory footprint, this version of 'ls' doesn't do any
23 * file sorting, and only has the most essential command line switches
24 * (i.e. the ones I couldn't live without :-) All features which involve
25 * linking in substantial chunks of libc can be disabled.
27 * Although I don't really want to add new features to this program to
28 * keep it small, I *am* interested to receive bug fixes and ways to make
32 * 1. ls -l of a directory doesn't give "total <blocks>" header
33 * 2. ls of a symlink to a directory doesn't list directory contents
34 * 3. hidden files can make column width too large
36 * NON-OPTIMAL BEHAVIOUR:
37 * 1. autowidth reads directories twice
38 * 2. if you do a short directory listing without filetype characters
39 * appended, there's no need to stat each one
41 * 1. requires lstat (BSD) - how do you do it without?
44 static const int TERMINAL_WIDTH = 80; /* use 79 if your terminal has linefold bug */
45 static const int COLUMN_WIDTH = 14; /* default if AUTOWIDTH not defined */
46 static const int COLUMN_GAP = 2; /* includes the file type char, if present */
48 /************************************************************************/
51 #include <sys/types.h>
58 #ifdef BB_FEATURE_LS_TIMESTAMPS
64 #define MAJOR(dev) (((dev)>>8)&0xff)
65 #define MINOR(dev) ((dev)&0xff)
68 /* what is the overall style of the listing */
71 STYLE_LONG = 1, /* one record per line, extended info */
72 STYLE_SINGLE = 2, /* one record per line */
73 STYLE_COLUMNS = 3 /* fill columns */
76 /* 51306 lrwxrwxrwx 1 root root 2 May 11 01:43 /bin/view -> vi* */
77 /* what file information will be listed */
78 #define LIST_INO (1<<0)
79 #define LIST_BLOCKS (1<<1)
80 #define LIST_MODEBITS (1<<2)
81 #define LIST_NLINKS (1<<3)
82 #define LIST_ID_NAME (1<<4)
83 #define LIST_ID_NUMERIC (1<<5)
84 #define LIST_SIZE (1<<6)
85 #define LIST_DEV (1<<7)
86 #define LIST_DATE_TIME (1<<8)
87 #define LIST_FULLTIME (1<<9)
88 #define LIST_FILENAME (1<<10)
89 #define LIST_SYMLINK (1<<11)
90 #define LIST_FILETYPE (1<<12)
91 #define LIST_EXEC (1<<13)
93 /* what files will be displayed */
94 #define DISP_NORMAL (0) /* show normal filenames */
95 #define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
96 #define DISP_HIDDEN (1<<1) /* show filenames starting with . */
97 #define DISP_DOT (1<<2) /* show . and .. */
98 #define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
99 #define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
100 #define DISP_ROWS (1<<5) /* print across rows */
102 #ifdef BB_FEATURE_LS_SORTFILES
103 /* how will the files be sorted */
104 static const int SORT_FORWARD = 0; /* sort in reverse order */
105 static const int SORT_REVERSE = 1; /* sort in reverse order */
106 static const int SORT_NAME = 2; /* sort by file name */
107 static const int SORT_SIZE = 3; /* sort by file size */
108 static const int SORT_ATIME = 4; /* sort by last access time */
109 static const int SORT_CTIME = 5; /* sort by last change time */
110 static const int SORT_MTIME = 6; /* sort by last modification time */
111 static const int SORT_VERSION = 7; /* sort by version */
112 static const int SORT_EXT = 8; /* sort by file name extension */
113 static const int SORT_DIR = 9; /* sort by file or directory */
116 #ifdef BB_FEATURE_LS_TIMESTAMPS
117 /* which of the three times will be used */
118 static const int TIME_MOD = 0;
119 static const int TIME_CHANGE = 1;
120 static const int TIME_ACCESS = 2;
123 #define LIST_SHORT (LIST_FILENAME)
124 #define LIST_ISHORT (LIST_INO | LIST_FILENAME)
125 #define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
126 LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
128 #define LIST_ILONG (LIST_INO | LIST_LONG)
130 static const int SPLIT_DIR = 0;
131 static const int SPLIT_FILE = 1;
132 static const int SPLIT_SUBDIR = 2;
134 #define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
135 #define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
136 #ifdef BB_FEATURE_LS_FILETYPES
137 #define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
141 * a directory entry and its stat info are stored here
143 struct dnode { /* the basic node */
144 char *name; /* the dir entry name */
145 char *fullname; /* the dir entry name */
146 struct stat dstat; /* the file stat info */
147 struct dnode *next; /* point at the next node */
149 typedef struct dnode dnode_t;
151 struct dnode **list_dir(char *);
152 struct dnode **dnalloc(int);
153 int list_single(struct dnode *);
155 static unsigned int disp_opts;
156 static unsigned int style_fmt;
157 static unsigned int list_fmt;
158 #ifdef BB_FEATURE_LS_SORTFILES
159 static unsigned int sort_opts;
160 static unsigned int sort_order;
162 #ifdef BB_FEATURE_LS_TIMESTAMPS
163 static unsigned int time_fmt;
165 #ifdef BB_FEATURE_LS_FOLLOWLINKS
166 static unsigned int follow_links=FALSE;
169 static unsigned short column = 0;
170 #ifdef BB_FEATURE_AUTOWIDTH
171 static unsigned short terminal_width;
172 static unsigned short column_width;
173 static unsigned short tabstops;
175 # define column_width COLUMN_WIDTH
178 static int status = EXIT_SUCCESS;
180 #ifdef BB_FEATURE_HUMAN_READABLE
181 unsigned long ls_disp_hr = KILOBYTE;
184 static int my_stat(struct dnode *cur)
186 #ifdef BB_FEATURE_LS_FOLLOWLINKS
187 if (follow_links == TRUE) {
188 if (stat(cur->fullname, &cur->dstat)) {
189 perror_msg("%s", cur->fullname);
190 status = EXIT_FAILURE;
197 if (lstat(cur->fullname, &cur->dstat)) {
198 perror_msg("%s", cur->fullname);
199 status = EXIT_FAILURE;
207 static void newline(void)
215 /*----------------------------------------------------------------------*/
216 #ifdef BB_FEATURE_LS_FILETYPES
217 static char append_char(mode_t mode)
219 if ( !(list_fmt & LIST_FILETYPE))
221 if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
222 && (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
223 return APPCHAR(mode);
227 /*----------------------------------------------------------------------*/
228 static void nexttabstop( void )
230 static short nexttab= 0;
241 nexttab= column + column_width + COLUMN_GAP;
244 /*----------------------------------------------------------------------*/
245 static int is_subdir(struct dnode *dn)
247 return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
248 strcmp(dn->name, "..") != 0);
251 int countdirs(struct dnode **dn, int nfiles)
255 if (dn==NULL || nfiles < 1) return(0);
257 for (i=0; i<nfiles; i++) {
258 if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
263 int countsubdirs(struct dnode **dn, int nfiles)
267 if (dn == NULL || nfiles < 1) return 0;
269 for (i = 0; i < nfiles; i++)
270 if (is_subdir(dn[i]))
275 int countfiles(struct dnode **dnp)
280 if (dnp == NULL) return(0);
282 for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
287 /* get memory to hold an array of pointers */
288 struct dnode **dnalloc(int num)
292 if (num < 1) return(NULL);
294 p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
298 void dfree(struct dnode **dnp)
300 struct dnode *cur, *next;
302 if(dnp == NULL) return;
305 while (cur != NULL) {
306 if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
308 free(cur); /* free the dnode */
311 free(dnp); /* free the array holding the dnode pointers */
314 struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
319 if (dn==NULL || nfiles < 1) return(NULL);
321 /* count how many dirs and regular files there are */
322 if (which == SPLIT_SUBDIR)
323 dncnt = countsubdirs(dn, nfiles);
325 dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
326 if (which == SPLIT_FILE)
327 dncnt= nfiles - dncnt; /* looking for files */
330 /* allocate a file array and a dir array */
333 /* copy the entrys into the file or dir array */
334 for (d= i=0; i<nfiles; i++) {
335 if (which == SPLIT_DIR) {
336 if (S_ISDIR(dn[i]->dstat.st_mode)) {
338 } /* else skip the file */
339 } else if (which == SPLIT_SUBDIR) {
340 if (is_subdir(dn[i])) {
342 } /* else skip the file or dir */
344 if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
346 } /* else skip the dir */
352 /*----------------------------------------------------------------------*/
353 #ifdef BB_FEATURE_LS_SORTFILES
354 int sortcmp(struct dnode *d1, struct dnode *d2)
359 if (sort_opts == SORT_SIZE) {
360 dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
361 } else if (sort_opts == SORT_ATIME) {
362 dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
363 } else if (sort_opts == SORT_CTIME) {
364 dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
365 } else if (sort_opts == SORT_MTIME) {
366 dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
367 } else if (sort_opts == SORT_DIR) {
368 dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
369 /* } else if (sort_opts == SORT_VERSION) { */
370 /* } else if (sort_opts == SORT_EXT) { */
371 } else { /* assume SORT_NAME */
375 if (dif > 0) cmp= -1;
378 /* sort by name- may be a tie_breaker for time or size cmp */
379 dif= strcmp(d1->name, d2->name);
381 if (dif < 0) cmp= -1;
384 if (sort_order == SORT_REVERSE) {
390 /*----------------------------------------------------------------------*/
391 void shellsort(struct dnode **dn, int size)
396 /* shell short the array */
397 if(dn==NULL || size < 2) return;
399 for (gap= size/2; gap>0; gap /=2) {
400 for (i=gap; i<size; i++) {
401 for (j= i-gap; j>=0; j-=gap) {
402 if (sortcmp(dn[j], dn[j+gap]) <= 0)
404 /* they are out of order, swap them */
414 /*----------------------------------------------------------------------*/
415 void showfiles(struct dnode **dn, int nfiles)
417 int i, ncols, nrows, row, nc;
418 #ifdef BB_FEATURE_AUTOWIDTH
422 if(dn==NULL || nfiles < 1) return;
424 #ifdef BB_FEATURE_AUTOWIDTH
425 /* find the longest file name- use that as the column width */
427 for (i=0; i<nfiles; i++) {
428 len= strlen(dn[i]->name) +
429 ((list_fmt & LIST_INO) ? 8 : 0) +
430 ((list_fmt & LIST_BLOCKS) ? 5 : 0)
432 if (column_width < len) column_width= len;
434 ncols= (int)(terminal_width / (column_width + COLUMN_GAP));
436 ncols= TERMINAL_WIDTH;
439 case STYLE_LONG: /* one record per line, extended info */
440 case STYLE_SINGLE: /* one record per line */
445 nrows= nfiles / ncols;
446 if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
448 if (nrows > nfiles) nrows= nfiles;
449 for (row=0; row<nrows; row++) {
450 for (nc=0; nc<ncols; nc++) {
451 /* reach into the array based on the column and row */
452 i= (nc * nrows) + row; /* assume display by column */
453 if (disp_opts & DISP_ROWS)
454 i= (row * ncols) + nc; /* display across row */
464 /*----------------------------------------------------------------------*/
465 void showdirs(struct dnode **dn, int ndirs)
468 struct dnode **subdnp;
469 #ifdef BB_FEATURE_LS_RECURSIVE
474 if (dn==NULL || ndirs < 1) return;
476 for (i=0; i<ndirs; i++) {
477 if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
478 printf("\n%s:\n", dn[i]->fullname);
480 subdnp= list_dir(dn[i]->fullname);
481 nfiles= countfiles(subdnp);
483 /* list all files at this level */
484 #ifdef BB_FEATURE_LS_SORTFILES
485 shellsort(subdnp, nfiles);
487 showfiles(subdnp, nfiles);
488 #ifdef BB_FEATURE_LS_RECURSIVE
489 if (disp_opts & DISP_RECURSIVE) {
490 /* recursive- list the sub-dirs */
491 dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
492 dndirs= countsubdirs(subdnp, nfiles);
494 #ifdef BB_FEATURE_LS_SORTFILES
495 shellsort(dnd, dndirs);
497 showdirs(dnd, dndirs);
498 free(dnd); /* free the array of dnode pointers to the dirs */
501 dfree(subdnp); /* free the dnodes and the fullname mem */
507 /*----------------------------------------------------------------------*/
508 struct dnode **list_dir(char *path)
510 struct dnode *dn, *cur, **dnp;
511 struct dirent *entry;
515 if (path==NULL) return(NULL);
521 perror_msg("%s", path);
522 status = EXIT_FAILURE;
523 return(NULL); /* could not open the dir */
525 while ((entry = readdir(dir)) != NULL) {
526 /* are we going to list the file- it may be . or .. or a hidden file */
527 if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT)) continue;
528 if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT)) continue;
529 if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN)) continue;
530 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
531 cur->fullname = xmalloc(strlen(path)+1+strlen(entry->d_name)+1);
532 strcpy(cur->fullname, path);
533 if (cur->fullname[strlen(cur->fullname)-1] != '/')
534 strcat(cur->fullname, "/");
535 cur->name= cur->fullname + strlen(cur->fullname);
536 strcat(cur->fullname, entry->d_name);
545 /* now that we know how many files there are
546 ** allocate memory for an array to hold dnode pointers
548 if (nfiles < 1) return(NULL);
549 dnp= dnalloc(nfiles);
550 for (i=0, cur=dn; i<nfiles; i++) {
551 dnp[i]= cur; /* save pointer to node in array */
558 /*----------------------------------------------------------------------*/
559 int list_single(struct dnode *dn)
562 char scratch[BUFSIZ + 1];
563 #ifdef BB_FEATURE_LS_TIMESTAMPS
567 #if defined (BB_FEATURE_LS_FILETYPES)
570 #ifdef BB_FEATURE_LS_FILETYPES
574 if (dn==NULL || dn->fullname==NULL) return(0);
576 #ifdef BB_FEATURE_LS_TIMESTAMPS
577 ttime= dn->dstat.st_mtime; /* the default time */
578 if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
579 if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
580 filetime= ctime(&ttime);
582 #ifdef BB_FEATURE_LS_FILETYPES
583 append = append_char(dn->dstat.st_mode);
586 for (i=0; i<=31; i++) {
587 switch (list_fmt & (1<<i)) {
589 printf("%7ld ", dn->dstat.st_ino);
593 #ifdef BB_FEATURE_HUMAN_READABLE
594 fprintf(stdout, "%5s ", format(dn->dstat.st_size, ls_disp_hr));
596 #if _FILE_OFFSET_BITS == 64
597 printf("%4lld ", dn->dstat.st_blocks>>1);
599 printf("%4ld ", dn->dstat.st_blocks>>1);
605 printf("%10s", (char *)mode_string(dn->dstat.st_mode));
609 printf("%4d ", dn->dstat.st_nlink);
613 #ifdef BB_FEATURE_LS_USERNAME
614 my_getpwuid(scratch, dn->dstat.st_uid);
616 printf("%-8.8s ", scratch);
618 printf("%-8d ", dn->dstat.st_uid);
619 my_getgrgid(scratch, dn->dstat.st_gid);
621 printf("%-8.8s", scratch);
623 printf("%-8d", dn->dstat.st_gid);
627 case LIST_ID_NUMERIC:
628 printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
633 if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
634 printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
636 #ifdef BB_FEATURE_HUMAN_READABLE
637 fprintf(stdout, "%9s ", format(dn->dstat.st_size, ls_disp_hr));
639 #if _FILE_OFFSET_BITS == 64
640 printf("%9lld ", dn->dstat.st_size);
642 printf("%9ld ", dn->dstat.st_size);
648 #ifdef BB_FEATURE_LS_TIMESTAMPS
651 if (list_fmt & LIST_FULLTIME) {
652 printf("%24.24s ", filetime);
656 age = time(NULL) - ttime;
657 printf("%6.6s ", filetime+4);
658 if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
659 /* hh:mm if less than 6 months old */
660 printf("%5.5s ", filetime+11);
662 printf(" %4.4s ", filetime+20);
668 printf("%s", dn->name);
669 column += strlen(dn->name);
672 if (S_ISLNK(dn->dstat.st_mode)) {
673 len= readlink(dn->fullname, scratch, (sizeof scratch)-1);
676 printf(" -> %s", scratch);
677 #ifdef BB_FEATURE_LS_FILETYPES
678 if (!stat(dn->fullname, &info)) {
679 append = append_char(info.st_mode);
686 #ifdef BB_FEATURE_LS_FILETYPES
688 if (append != '\0') {
689 printf("%1c", append);
700 /*----------------------------------------------------------------------*/
701 extern int ls_main(int argc, char **argv)
703 struct dnode **dnf, **dnd;
705 struct dnode *dn, *cur, **dnp;
711 disp_opts= DISP_NORMAL;
712 style_fmt= STYLE_AUTO;
713 list_fmt= LIST_SHORT;
714 #ifdef BB_FEATURE_LS_SORTFILES
715 sort_opts= SORT_NAME;
716 sort_order= SORT_FORWARD;
718 #ifdef BB_FEATURE_LS_TIMESTAMPS
721 #ifdef BB_FEATURE_AUTOWIDTH
722 terminal_width = TERMINAL_WIDTH;
723 column_width = COLUMN_WIDTH;
728 /* process options */
729 while ((opt = getopt(argc, argv, "1AaCdgilnsx"
730 #ifdef BB_FEATURE_AUTOWIDTH
733 #ifdef BB_FEATURE_LS_FILETYPES
736 #ifdef BB_FEATURE_LS_RECURSIVE
739 #ifdef BB_FEATURE_LS_SORTFILES
742 #ifdef BB_FEATURE_LS_TIMESTAMPS
745 #ifdef BB_FEATURE_LS_FOLLOWLINKS
748 #ifdef BB_FEATURE_HUMAN_READABLE
753 case '1': style_fmt = STYLE_SINGLE; break;
754 case 'A': disp_opts |= DISP_HIDDEN; break;
755 case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
756 case 'C': style_fmt = STYLE_COLUMNS; break;
757 case 'd': disp_opts |= DISP_NOLIST; break;
758 case 'g': /* ignore -- for ftp servers */ break;
759 case 'i': list_fmt |= LIST_INO; break;
761 style_fmt = STYLE_LONG;
762 list_fmt |= LIST_LONG;
763 #ifdef BB_FEATURE_HUMAN_READABLE
767 case 'n': list_fmt |= LIST_ID_NUMERIC; break;
768 case 's': list_fmt |= LIST_BLOCKS; break;
769 case 'x': disp_opts = DISP_ROWS; break;
770 #ifdef BB_FEATURE_LS_FILETYPES
771 case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
772 case 'p': list_fmt |= LIST_FILETYPE; break;
774 #ifdef BB_FEATURE_LS_RECURSIVE
775 case 'R': disp_opts |= DISP_RECURSIVE; break;
777 #ifdef BB_FEATURE_LS_SORTFILES
778 case 'r': sort_order |= SORT_REVERSE; break;
779 case 'S': sort_opts= SORT_SIZE; break;
780 case 'v': sort_opts= SORT_VERSION; break;
781 case 'X': sort_opts= SORT_EXT; break;
783 #ifdef BB_FEATURE_LS_TIMESTAMPS
784 case 'e': list_fmt |= LIST_FULLTIME; break;
786 time_fmt = TIME_CHANGE;
787 #ifdef BB_FEATURE_LS_SORTFILES
788 sort_opts= SORT_CTIME;
792 time_fmt = TIME_ACCESS;
793 #ifdef BB_FEATURE_LS_SORTFILES
794 sort_opts= SORT_ATIME;
798 #ifdef BB_FEATURE_LS_SORTFILES
799 sort_opts= SORT_MTIME;
803 #ifdef BB_FEATURE_LS_FOLLOWLINKS
804 case 'L': follow_links= TRUE; break;
806 #ifdef BB_FEATURE_AUTOWIDTH
807 case 'T': tabstops= atoi(optarg); break;
808 case 'w': terminal_width= atoi(optarg); break;
810 #ifdef BB_FEATURE_HUMAN_READABLE
811 case 'h': ls_disp_hr = 0; break;
812 case 'k': ls_disp_hr = KILOBYTE; break;
817 goto print_usage_message;
821 /* sort out which command line options take precedence */
822 #ifdef BB_FEATURE_LS_RECURSIVE
823 if (disp_opts & DISP_NOLIST)
824 disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
826 #if defined (BB_FEATURE_LS_TIMESTAMPS) && defined (BB_FEATURE_LS_SORTFILES)
827 if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
828 if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
830 if (style_fmt != STYLE_LONG)
831 list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
832 #ifdef BB_FEATURE_LS_USERNAME
833 if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
834 list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
837 /* choose a display format */
838 if (style_fmt == STYLE_AUTO)
839 style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
842 * when there are no cmd line args we have to supply a default "." arg.
843 * we will create a second argv array, "av" that will hold either
844 * our created "." arg, or the real cmd line args. The av array
845 * just holds the pointers- we don't move the date the pointers
848 ac= argc - optind; /* how many cmd line args are left */
850 av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
854 av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
855 for (oi=0 ; oi < ac; oi++) {
856 av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
860 /* now, everything is in the av array */
862 disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
864 /* stuff the command line file names into an dnode array */
866 for (oi=0 ; oi < ac; oi++) {
867 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
868 cur->fullname= xstrdup(av[oi]);
869 cur->name= cur->fullname;
877 /* now that we know how many files there are
878 ** allocate memory for an array to hold dnode pointers
880 dnp= dnalloc(nfiles);
881 for (i=0, cur=dn; i<nfiles; i++) {
882 dnp[i]= cur; /* save pointer to node in array */
887 if (disp_opts & DISP_NOLIST) {
888 #ifdef BB_FEATURE_LS_SORTFILES
889 shellsort(dnp, nfiles);
891 if (nfiles > 0) showfiles(dnp, nfiles);
893 dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
894 dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
895 dndirs= countdirs(dnp, nfiles);
896 dnfiles= nfiles - dndirs;
898 #ifdef BB_FEATURE_LS_SORTFILES
899 shellsort(dnf, dnfiles);
901 showfiles(dnf, dnfiles);
904 #ifdef BB_FEATURE_LS_SORTFILES
905 shellsort(dnd, dndirs);
907 showdirs(dnd, dndirs);