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;
176 static int status = EXIT_SUCCESS;
178 #ifdef BB_FEATURE_HUMAN_READABLE
179 unsigned long ls_disp_hr = KILOBYTE;
182 static int my_stat(struct dnode *cur)
184 #ifdef BB_FEATURE_LS_FOLLOWLINKS
185 if (follow_links == TRUE) {
186 if (stat(cur->fullname, &cur->dstat)) {
187 perror_msg("%s", cur->fullname);
188 status = EXIT_FAILURE;
195 if (lstat(cur->fullname, &cur->dstat)) {
196 perror_msg("%s", cur->fullname);
197 status = EXIT_FAILURE;
205 static void newline(void)
213 /*----------------------------------------------------------------------*/
214 #ifdef BB_FEATURE_LS_FILETYPES
215 static char append_char(mode_t mode)
217 if ( !(list_fmt & LIST_FILETYPE))
219 if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
220 && (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
221 return APPCHAR(mode);
225 /*----------------------------------------------------------------------*/
226 static void nexttabstop( void )
228 static short nexttab= 0;
239 nexttab= column + column_width + COLUMN_GAP ;
242 /*----------------------------------------------------------------------*/
243 static int is_subdir(struct dnode *dn)
245 return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
246 strcmp(dn->name, "..") != 0);
249 int countdirs(struct dnode **dn, int nfiles)
253 if (dn==NULL || nfiles < 1) return(0);
255 for (i=0; i<nfiles; i++) {
256 if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
261 int countsubdirs(struct dnode **dn, int nfiles)
265 if (dn == NULL || nfiles < 1) return 0;
267 for (i = 0; i < nfiles; i++)
268 if (is_subdir(dn[i]))
273 int countfiles(struct dnode **dnp)
278 if (dnp == NULL) return(0);
280 for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
285 /* get memory to hold an array of pointers */
286 struct dnode **dnalloc(int num)
290 if (num < 1) return(NULL);
292 p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
296 void dfree(struct dnode **dnp)
298 struct dnode *cur, *next;
300 if(dnp == NULL) return;
303 while (cur != NULL) {
304 if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
306 free(cur); /* free the dnode */
309 free(dnp); /* free the array holding the dnode pointers */
312 struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
317 if (dn==NULL || nfiles < 1) return(NULL);
319 /* count how many dirs and regular files there are */
320 if (which == SPLIT_SUBDIR)
321 dncnt = countsubdirs(dn, nfiles);
323 dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
324 if (which == SPLIT_FILE)
325 dncnt= nfiles - dncnt; /* looking for files */
328 /* allocate a file array and a dir array */
331 /* copy the entrys into the file or dir array */
332 for (d= i=0; i<nfiles; i++) {
333 if (which == SPLIT_DIR) {
334 if (S_ISDIR(dn[i]->dstat.st_mode)) {
336 } /* else skip the file */
337 } else if (which == SPLIT_SUBDIR) {
338 if (is_subdir(dn[i])) {
340 } /* else skip the file or dir */
342 if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
344 } /* else skip the dir */
350 /*----------------------------------------------------------------------*/
351 #ifdef BB_FEATURE_LS_SORTFILES
352 int sortcmp(struct dnode *d1, struct dnode *d2)
357 if (sort_opts == SORT_SIZE) {
358 dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
359 } else if (sort_opts == SORT_ATIME) {
360 dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
361 } else if (sort_opts == SORT_CTIME) {
362 dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
363 } else if (sort_opts == SORT_MTIME) {
364 dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
365 } else if (sort_opts == SORT_DIR) {
366 dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
367 /* } else if (sort_opts == SORT_VERSION) { */
368 /* } else if (sort_opts == SORT_EXT) { */
369 } else { /* assume SORT_NAME */
373 if (dif > 0) cmp= -1;
376 /* sort by name- may be a tie_breaker for time or size cmp */
377 dif= strcmp(d1->name, d2->name);
379 if (dif < 0) cmp= -1;
382 if (sort_order == SORT_REVERSE) {
388 /*----------------------------------------------------------------------*/
389 void shellsort(struct dnode **dn, int size)
394 /* shell short the array */
395 if(dn==NULL || size < 2) return;
397 for (gap= size/2; gap>0; gap /=2) {
398 for (i=gap; i<size; i++) {
399 for (j= i-gap; j>=0; j-=gap) {
400 if (sortcmp(dn[j], dn[j+gap]) <= 0)
402 /* they are out of order, swap them */
412 /*----------------------------------------------------------------------*/
413 void showfiles(struct dnode **dn, int nfiles)
415 int i, ncols, nrows, row, nc;
416 #ifdef BB_FEATURE_AUTOWIDTH
420 if(dn==NULL || nfiles < 1) return;
422 #ifdef BB_FEATURE_AUTOWIDTH
423 /* find the longest file name- use that as the column width */
425 for (i=0; i<nfiles; i++) {
426 len= strlen(dn[i]->name) +
427 ((list_fmt & LIST_INO) ? 8 : 0) +
428 ((list_fmt & LIST_BLOCKS) ? 5 : 0)
430 if (column_width < len) column_width= len;
433 ncols= (int)(terminal_width / (column_width + COLUMN_GAP));
435 case STYLE_LONG: /* one record per line, extended info */
436 case STYLE_SINGLE: /* one record per line */
441 nrows= nfiles / ncols;
442 if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
444 if (nrows > nfiles) nrows= nfiles;
445 for (row=0; row<nrows; row++) {
446 for (nc=0; nc<ncols; nc++) {
447 /* reach into the array based on the column and row */
448 i= (nc * nrows) + row; /* assume display by column */
449 if (disp_opts & DISP_ROWS)
450 i= (row * ncols) + nc; /* display across row */
460 /*----------------------------------------------------------------------*/
461 void showdirs(struct dnode **dn, int ndirs)
464 struct dnode **subdnp;
465 #ifdef BB_FEATURE_LS_RECURSIVE
470 if (dn==NULL || ndirs < 1) return;
472 for (i=0; i<ndirs; i++) {
473 if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
474 printf("\n%s:\n", dn[i]->fullname);
476 subdnp= list_dir(dn[i]->fullname);
477 nfiles= countfiles(subdnp);
479 /* list all files at this level */
480 #ifdef BB_FEATURE_LS_SORTFILES
481 shellsort(subdnp, nfiles);
483 showfiles(subdnp, nfiles);
484 #ifdef BB_FEATURE_LS_RECURSIVE
485 if (disp_opts & DISP_RECURSIVE) {
486 /* recursive- list the sub-dirs */
487 dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
488 dndirs= countsubdirs(subdnp, nfiles);
490 #ifdef BB_FEATURE_LS_SORTFILES
491 shellsort(dnd, dndirs);
493 showdirs(dnd, dndirs);
494 free(dnd); /* free the array of dnode pointers to the dirs */
497 dfree(subdnp); /* free the dnodes and the fullname mem */
503 /*----------------------------------------------------------------------*/
504 struct dnode **list_dir(char *path)
506 struct dnode *dn, *cur, **dnp;
507 struct dirent *entry;
511 if (path==NULL) return(NULL);
517 perror_msg("%s", path);
518 status = EXIT_FAILURE;
519 return(NULL); /* could not open the dir */
521 while ((entry = readdir(dir)) != NULL) {
522 /* are we going to list the file- it may be . or .. or a hidden file */
523 if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT)) continue;
524 if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT)) continue;
525 if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN)) continue;
526 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
527 cur->fullname = xmalloc(strlen(path)+1+strlen(entry->d_name)+1);
528 strcpy(cur->fullname, path);
529 if (cur->fullname[strlen(cur->fullname)-1] != '/')
530 strcat(cur->fullname, "/");
531 cur->name= cur->fullname + strlen(cur->fullname);
532 strcat(cur->fullname, entry->d_name);
541 /* now that we know how many files there are
542 ** allocate memory for an array to hold dnode pointers
544 if (nfiles < 1) return(NULL);
545 dnp= dnalloc(nfiles);
546 for (i=0, cur=dn; i<nfiles; i++) {
547 dnp[i]= cur; /* save pointer to node in array */
554 /*----------------------------------------------------------------------*/
555 int list_single(struct dnode *dn)
558 char scratch[BUFSIZ + 1];
559 #ifdef BB_FEATURE_LS_TIMESTAMPS
563 #if defined (BB_FEATURE_LS_FILETYPES)
566 #ifdef BB_FEATURE_LS_FILETYPES
570 if (dn==NULL || dn->fullname==NULL) return(0);
572 #ifdef BB_FEATURE_LS_TIMESTAMPS
573 ttime= dn->dstat.st_mtime; /* the default time */
574 if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
575 if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
576 filetime= ctime(&ttime);
578 #ifdef BB_FEATURE_LS_FILETYPES
579 append = append_char(dn->dstat.st_mode);
582 for (i=0; i<=31; i++) {
583 switch (list_fmt & (1<<i)) {
585 printf("%7ld ", dn->dstat.st_ino);
589 #ifdef BB_FEATURE_HUMAN_READABLE
590 fprintf(stdout, "%5s ", format(dn->dstat.st_size, ls_disp_hr));
592 #if _FILE_OFFSET_BITS == 64
593 printf("%4lld ", dn->dstat.st_blocks>>1);
595 printf("%4ld ", dn->dstat.st_blocks>>1);
601 printf("%10s", (char *)mode_string(dn->dstat.st_mode));
605 printf("%4d ", dn->dstat.st_nlink);
609 #ifdef BB_FEATURE_LS_USERNAME
610 my_getpwuid(scratch, dn->dstat.st_uid);
612 printf("%-8.8s ", scratch);
614 printf("%-8d ", dn->dstat.st_uid);
615 my_getgrgid(scratch, dn->dstat.st_gid);
617 printf("%-8.8s", scratch);
619 printf("%-8d", dn->dstat.st_gid);
623 case LIST_ID_NUMERIC:
624 printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
629 if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
630 printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
632 #ifdef BB_FEATURE_HUMAN_READABLE
633 fprintf(stdout, "%9s ", format(dn->dstat.st_size, ls_disp_hr));
635 #if _FILE_OFFSET_BITS == 64
636 printf("%9lld ", dn->dstat.st_size);
638 printf("%9ld ", dn->dstat.st_size);
644 #ifdef BB_FEATURE_LS_TIMESTAMPS
647 if (list_fmt & LIST_FULLTIME) {
648 printf("%24.24s ", filetime);
652 age = time(NULL) - ttime;
653 printf("%6.6s ", filetime+4);
654 if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
655 /* hh:mm if less than 6 months old */
656 printf("%5.5s ", filetime+11);
658 printf(" %4.4s ", filetime+20);
664 printf("%s", dn->name);
665 column += strlen(dn->name);
668 if (S_ISLNK(dn->dstat.st_mode)) {
669 len= readlink(dn->fullname, scratch, (sizeof scratch)-1);
672 printf(" -> %s", scratch);
673 #ifdef BB_FEATURE_LS_FILETYPES
674 if (!stat(dn->fullname, &info)) {
675 append = append_char(info.st_mode);
682 #ifdef BB_FEATURE_LS_FILETYPES
684 if (append != '\0') {
685 printf("%1c", append);
696 /*----------------------------------------------------------------------*/
697 extern int ls_main(int argc, char **argv)
699 struct dnode **dnf, **dnd;
701 struct dnode *dn, *cur, **dnp;
707 disp_opts= DISP_NORMAL;
708 style_fmt= STYLE_AUTO;
709 list_fmt= LIST_SHORT;
710 #ifdef BB_FEATURE_LS_SORTFILES
711 sort_opts= SORT_NAME;
712 sort_order= SORT_FORWARD;
714 #ifdef BB_FEATURE_LS_TIMESTAMPS
717 #ifdef BB_FEATURE_AUTOWIDTH
718 terminal_width = TERMINAL_WIDTH;
719 column_width = COLUMN_WIDTH;
724 /* process options */
725 while ((opt = getopt(argc, argv, "1AaCdgilnsx"
726 #ifdef BB_FEATURE_AUTOWIDTH
729 #ifdef BB_FEATURE_LS_FILETYPES
732 #ifdef BB_FEATURE_LS_RECURSIVE
735 #ifdef BB_FEATURE_LS_SORTFILES
738 #ifdef BB_FEATURE_LS_TIMESTAMPS
741 #ifdef BB_FEATURE_LS_FOLLOWLINKS
744 #ifdef BB_FEATURE_HUMAN_READABLE
749 case '1': style_fmt = STYLE_SINGLE; break;
750 case 'A': disp_opts |= DISP_HIDDEN; break;
751 case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
752 case 'C': style_fmt = STYLE_COLUMNS; break;
753 case 'd': disp_opts |= DISP_NOLIST; break;
754 case 'g': /* ignore -- for ftp servers */ break;
755 case 'i': list_fmt |= LIST_INO; break;
757 style_fmt = STYLE_LONG;
758 list_fmt |= LIST_LONG;
759 #ifdef BB_FEATURE_HUMAN_READABLE
763 case 'n': list_fmt |= LIST_ID_NUMERIC; break;
764 case 's': list_fmt |= LIST_BLOCKS; break;
765 case 'x': disp_opts = DISP_ROWS; break;
766 #ifdef BB_FEATURE_LS_FILETYPES
767 case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
768 case 'p': list_fmt |= LIST_FILETYPE; break;
770 #ifdef BB_FEATURE_LS_RECURSIVE
771 case 'R': disp_opts |= DISP_RECURSIVE; break;
773 #ifdef BB_FEATURE_LS_SORTFILES
774 case 'r': sort_order |= SORT_REVERSE; break;
775 case 'S': sort_opts= SORT_SIZE; break;
776 case 'v': sort_opts= SORT_VERSION; break;
777 case 'X': sort_opts= SORT_EXT; break;
779 #ifdef BB_FEATURE_LS_TIMESTAMPS
780 case 'e': list_fmt |= LIST_FULLTIME; break;
782 time_fmt = TIME_CHANGE;
783 #ifdef BB_FEATURE_LS_SORTFILES
784 sort_opts= SORT_CTIME;
788 time_fmt = TIME_ACCESS;
789 #ifdef BB_FEATURE_LS_SORTFILES
790 sort_opts= SORT_ATIME;
794 #ifdef BB_FEATURE_LS_SORTFILES
795 sort_opts= SORT_MTIME;
799 #ifdef BB_FEATURE_LS_FOLLOWLINKS
800 case 'L': follow_links= TRUE; break;
802 #ifdef BB_FEATURE_AUTOWIDTH
803 case 'T': tabstops= atoi(optarg); break;
804 case 'w': terminal_width= atoi(optarg); break;
806 #ifdef BB_FEATURE_HUMAN_READABLE
807 case 'h': ls_disp_hr = 0; break;
808 case 'k': ls_disp_hr = KILOBYTE; break;
813 goto print_usage_message;
817 /* sort out which command line options take precedence */
818 #ifdef BB_FEATURE_LS_RECURSIVE
819 if (disp_opts & DISP_NOLIST)
820 disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
822 #if defined (BB_FEATURE_LS_TIMESTAMPS) && defined (BB_FEATURE_LS_SORTFILES)
823 if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
824 if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
826 if (style_fmt != STYLE_LONG)
827 list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
828 #ifdef BB_FEATURE_LS_USERNAME
829 if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
830 list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
833 /* choose a display format */
834 if (style_fmt == STYLE_AUTO)
835 style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
838 * when there are no cmd line args we have to supply a default "." arg.
839 * we will create a second argv array, "av" that will hold either
840 * our created "." arg, or the real cmd line args. The av array
841 * just holds the pointers- we don't move the date the pointers
844 ac= argc - optind; /* how many cmd line args are left */
846 av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
850 av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
851 for (oi=0 ; oi < ac; oi++) {
852 av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
856 /* now, everything is in the av array */
858 disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
860 /* stuff the command line file names into an dnode array */
862 for (oi=0 ; oi < ac; oi++) {
863 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
864 cur->fullname= xstrdup(av[oi]);
865 cur->name= cur->fullname;
873 /* now that we know how many files there are
874 ** allocate memory for an array to hold dnode pointers
876 dnp= dnalloc(nfiles);
877 for (i=0, cur=dn; i<nfiles; i++) {
878 dnp[i]= cur; /* save pointer to node in array */
883 if (disp_opts & DISP_NOLIST) {
884 #ifdef BB_FEATURE_LS_SORTFILES
885 shellsort(dnp, nfiles);
887 if (nfiles > 0) showfiles(dnp, nfiles);
889 dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
890 dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
891 dndirs= countdirs(dnp, nfiles);
892 dnfiles= nfiles - dndirs;
894 #ifdef BB_FEATURE_LS_SORTFILES
895 shellsort(dnf, dnfiles);
897 showfiles(dnf, dnfiles);
900 #ifdef BB_FEATURE_LS_SORTFILES
901 shellsort(dnd, dndirs);
903 showdirs(dnd, dndirs);