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 #define TERMINAL_WIDTH 80 /* use 79 if your terminal has linefold bug */
45 #define COLUMN_WIDTH 14 /* default if AUTOWIDTH not defined */
46 #define 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 */
70 #define STYLE_LONG 1 /* one record per line, extended info */
71 #define STYLE_SINGLE 2 /* one record per line */
72 #define STYLE_COLUMNS 3 /* fill columns */
74 /* 51306 lrwxrwxrwx 1 root root 2 May 11 01:43 /bin/view -> vi* */
75 /* what file information will be listed */
76 #define LIST_INO (1<<0)
77 #define LIST_BLOCKS (1<<1)
78 #define LIST_MODEBITS (1<<2)
79 #define LIST_NLINKS (1<<3)
80 #define LIST_ID_NAME (1<<4)
81 #define LIST_ID_NUMERIC (1<<5)
82 #define LIST_SIZE (1<<6)
83 #define LIST_DEV (1<<7)
84 #define LIST_DATE_TIME (1<<8)
85 #define LIST_FULLTIME (1<<9)
86 #define LIST_FILENAME (1<<10)
87 #define LIST_SYMLINK (1<<11)
88 #define LIST_FILETYPE (1<<12)
89 #define LIST_EXEC (1<<13)
91 /* what files will be displayed */
92 #define DISP_NORMAL (0) /* show normal filenames */
93 #define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
94 #define DISP_HIDDEN (1<<1) /* show filenames starting with . */
95 #define DISP_DOT (1<<2) /* show . and .. */
96 #define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
97 #define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
98 #define DISP_ROWS (1<<5) /* print across rows */
100 #ifdef BB_FEATURE_LS_SORTFILES
101 /* how will the files be sorted */
102 #define SORT_FORWARD 0 /* sort in reverse order */
103 #define SORT_REVERSE 1 /* sort in reverse order */
104 #define SORT_NAME 2 /* sort by file name */
105 #define SORT_SIZE 3 /* sort by file size */
106 #define SORT_ATIME 4 /* sort by last access time */
107 #define SORT_CTIME 5 /* sort by last change time */
108 #define SORT_MTIME 6 /* sort by last modification time */
109 #define SORT_VERSION 7 /* sort by version */
110 #define SORT_EXT 8 /* sort by file name extension */
111 #define SORT_DIR 9 /* sort by file or directory */
114 #ifdef BB_FEATURE_LS_TIMESTAMPS
115 /* which of the three times will be used */
117 #define TIME_CHANGE 1
118 #define TIME_ACCESS 2
121 #define LIST_SHORT (LIST_FILENAME)
122 #define LIST_ISHORT (LIST_INO | LIST_FILENAME)
123 #define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
124 LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
126 #define LIST_ILONG (LIST_INO | LIST_LONG)
130 #define SPLIT_SUBDIR 2
132 #define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
133 #define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
134 #ifdef BB_FEATURE_LS_FILETYPES
135 #define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
139 * a directory entry and its stat info are stored here
141 struct dnode { /* the basic node */
142 char *name; /* the dir entry name */
143 char *fullname; /* the dir entry name */
144 struct stat dstat; /* the file stat info */
145 struct dnode *next; /* point at the next node */
147 typedef struct dnode dnode_t;
149 struct dnode **list_dir(char *);
150 struct dnode **dnalloc(int);
151 int list_single(struct dnode *);
153 static unsigned int disp_opts= DISP_NORMAL;
154 static unsigned int style_fmt= STYLE_AUTO ;
155 static unsigned int list_fmt= LIST_SHORT ;
156 #ifdef BB_FEATURE_LS_SORTFILES
157 static unsigned int sort_opts= SORT_FORWARD;
158 static unsigned int sort_order= SORT_FORWARD;
160 #ifdef BB_FEATURE_LS_TIMESTAMPS
161 static unsigned int time_fmt= TIME_MOD;
163 #ifdef BB_FEATURE_LS_FOLLOWLINKS
164 static unsigned int follow_links=FALSE;
167 static unsigned short column = 0;
168 #ifdef BB_FEATURE_AUTOWIDTH
169 static unsigned short terminal_width = TERMINAL_WIDTH;
170 static unsigned short column_width = COLUMN_WIDTH;
171 static unsigned short tabstops = 8;
173 #define terminal_width TERMINAL_WIDTH
174 #define column_width COLUMN_WIDTH
177 static int status = EXIT_SUCCESS;
179 #ifdef BB_FEATURE_HUMAN_READABLE
180 unsigned long ls_disp_hr = KILOBYTE;
183 static int my_stat(struct dnode *cur)
185 #ifdef BB_FEATURE_LS_FOLLOWLINKS
186 if (follow_links == TRUE) {
187 if (stat(cur->fullname, &cur->dstat)) {
188 perror_msg("%s", cur->fullname);
189 status = EXIT_FAILURE;
196 if (lstat(cur->fullname, &cur->dstat)) {
197 perror_msg("%s", cur->fullname);
198 status = EXIT_FAILURE;
206 static void newline(void)
214 /*----------------------------------------------------------------------*/
215 #ifdef BB_FEATURE_LS_FILETYPES
216 static char append_char(mode_t mode)
218 if ( !(list_fmt & LIST_FILETYPE))
220 if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
221 && (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
222 return APPCHAR(mode);
226 /*----------------------------------------------------------------------*/
227 static void nexttabstop( void )
229 static short nexttab= 0;
240 nexttab= column + column_width + COLUMN_GAP ;
243 /*----------------------------------------------------------------------*/
244 static int is_subdir(struct dnode *dn)
246 return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
247 strcmp(dn->name, "..") != 0);
250 int countdirs(struct dnode **dn, int nfiles)
254 if (dn==NULL || nfiles < 1) return(0);
256 for (i=0; i<nfiles; i++) {
257 if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
262 int countsubdirs(struct dnode **dn, int nfiles)
266 if (dn == NULL || nfiles < 1) return 0;
268 for (i = 0; i < nfiles; i++)
269 if (is_subdir(dn[i]))
274 int countfiles(struct dnode **dnp)
279 if (dnp == NULL) return(0);
281 for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
286 /* get memory to hold an array of pointers */
287 struct dnode **dnalloc(int num)
291 if (num < 1) return(NULL);
293 p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
297 void dfree(struct dnode **dnp)
299 struct dnode *cur, *next;
301 if(dnp == NULL) return;
304 while (cur != NULL) {
305 if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
307 free(cur); /* free the dnode */
310 free(dnp); /* free the array holding the dnode pointers */
313 struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
318 if (dn==NULL || nfiles < 1) return(NULL);
320 /* count how many dirs and regular files there are */
321 if (which == SPLIT_SUBDIR)
322 dncnt = countsubdirs(dn, nfiles);
324 dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
325 if (which == SPLIT_FILE)
326 dncnt= nfiles - dncnt; /* looking for files */
329 /* allocate a file array and a dir array */
332 /* copy the entrys into the file or dir array */
333 for (d= i=0; i<nfiles; i++) {
334 if (which == SPLIT_DIR) {
335 if (S_ISDIR(dn[i]->dstat.st_mode)) {
337 } /* else skip the file */
338 } else if (which == SPLIT_SUBDIR) {
339 if (is_subdir(dn[i])) {
341 } /* else skip the file or dir */
343 if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
345 } /* else skip the dir */
351 /*----------------------------------------------------------------------*/
352 #ifdef BB_FEATURE_LS_SORTFILES
353 int sortcmp(struct dnode *d1, struct dnode *d2)
358 if (sort_opts == SORT_SIZE) {
359 dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
360 } else if (sort_opts == SORT_ATIME) {
361 dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
362 } else if (sort_opts == SORT_CTIME) {
363 dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
364 } else if (sort_opts == SORT_MTIME) {
365 dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
366 } else if (sort_opts == SORT_DIR) {
367 dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
368 /* } else if (sort_opts == SORT_VERSION) { */
369 /* } else if (sort_opts == SORT_EXT) { */
370 } else { /* assume SORT_NAME */
374 if (dif > 0) cmp= -1;
377 /* sort by name- may be a tie_breaker for time or size cmp */
378 dif= strcmp(d1->name, d2->name);
380 if (dif < 0) cmp= -1;
383 if (sort_order == SORT_REVERSE) {
389 /*----------------------------------------------------------------------*/
390 void shellsort(struct dnode **dn, int size)
395 /* shell short the array */
396 if(dn==NULL || size < 2) return;
398 for (gap= size/2; gap>0; gap /=2) {
399 for (i=gap; i<size; i++) {
400 for (j= i-gap; j>=0; j-=gap) {
401 if (sortcmp(dn[j], dn[j+gap]) <= 0)
403 /* they are out of order, swap them */
413 /*----------------------------------------------------------------------*/
414 void showfiles(struct dnode **dn, int nfiles)
416 int i, ncols, nrows, row, nc;
417 #ifdef BB_FEATURE_AUTOWIDTH
421 if(dn==NULL || nfiles < 1) return;
423 #ifdef BB_FEATURE_AUTOWIDTH
424 /* find the longest file name- use that as the column width */
426 for (i=0; i<nfiles; i++) {
427 len= strlen(dn[i]->name) +
428 ((list_fmt & LIST_INO) ? 8 : 0) +
429 ((list_fmt & LIST_BLOCKS) ? 5 : 0)
431 if (column_width < len) column_width= len;
434 ncols= (int)(terminal_width / (column_width + COLUMN_GAP));
436 case STYLE_LONG: /* one record per line, extended info */
437 case STYLE_SINGLE: /* one record per line */
442 nrows= nfiles / ncols;
443 if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
445 if (nrows > nfiles) nrows= nfiles;
446 for (row=0; row<nrows; row++) {
447 for (nc=0; nc<ncols; nc++) {
448 /* reach into the array based on the column and row */
449 i= (nc * nrows) + row; /* assume display by column */
450 if (disp_opts & DISP_ROWS)
451 i= (row * ncols) + nc; /* display across row */
461 /*----------------------------------------------------------------------*/
462 void showdirs(struct dnode **dn, int ndirs)
465 struct dnode **subdnp;
466 #ifdef BB_FEATURE_LS_RECURSIVE
471 if (dn==NULL || ndirs < 1) return;
473 for (i=0; i<ndirs; i++) {
474 if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
475 printf("\n%s:\n", dn[i]->fullname);
477 subdnp= list_dir(dn[i]->fullname);
478 nfiles= countfiles(subdnp);
480 /* list all files at this level */
481 #ifdef BB_FEATURE_LS_SORTFILES
482 shellsort(subdnp, nfiles);
484 showfiles(subdnp, nfiles);
485 #ifdef BB_FEATURE_LS_RECURSIVE
486 if (disp_opts & DISP_RECURSIVE) {
487 /* recursive- list the sub-dirs */
488 dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
489 dndirs= countsubdirs(subdnp, nfiles);
491 #ifdef BB_FEATURE_LS_SORTFILES
492 shellsort(dnd, dndirs);
494 showdirs(dnd, dndirs);
495 free(dnd); /* free the array of dnode pointers to the dirs */
498 dfree(subdnp); /* free the dnodes and the fullname mem */
504 /*----------------------------------------------------------------------*/
505 struct dnode **list_dir(char *path)
507 struct dnode *dn, *cur, **dnp;
508 struct dirent *entry;
512 if (path==NULL) return(NULL);
518 perror_msg("%s", path);
519 status = EXIT_FAILURE;
520 return(NULL); /* could not open the dir */
522 while ((entry = readdir(dir)) != NULL) {
523 /* are we going to list the file- it may be . or .. or a hidden file */
524 if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT)) continue;
525 if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT)) continue;
526 if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN)) continue;
527 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
528 cur->fullname = xmalloc(strlen(path)+1+strlen(entry->d_name)+1);
529 strcpy(cur->fullname, path);
530 if (cur->fullname[strlen(cur->fullname)-1] != '/')
531 strcat(cur->fullname, "/");
532 cur->name= cur->fullname + strlen(cur->fullname);
533 strcat(cur->fullname, entry->d_name);
542 /* now that we know how many files there are
543 ** allocate memory for an array to hold dnode pointers
545 if (nfiles < 1) return(NULL);
546 dnp= dnalloc(nfiles);
547 for (i=0, cur=dn; i<nfiles; i++) {
548 dnp[i]= cur; /* save pointer to node in array */
555 /*----------------------------------------------------------------------*/
556 int list_single(struct dnode *dn)
559 char scratch[BUFSIZ + 1];
560 #ifdef BB_FEATURE_LS_TIMESTAMPS
564 #if defined (BB_FEATURE_LS_FILETYPES)
567 #ifdef BB_FEATURE_LS_FILETYPES
571 if (dn==NULL || dn->fullname==NULL) return(0);
573 #ifdef BB_FEATURE_LS_TIMESTAMPS
574 ttime= dn->dstat.st_mtime; /* the default time */
575 if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
576 if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
577 filetime= ctime(&ttime);
579 #ifdef BB_FEATURE_LS_FILETYPES
580 append = append_char(dn->dstat.st_mode);
583 for (i=0; i<=31; i++) {
584 switch (list_fmt & (1<<i)) {
586 printf("%7ld ", dn->dstat.st_ino);
590 #ifdef BB_FEATURE_HUMAN_READABLE
591 fprintf(stdout, "%5s ", format(dn->dstat.st_size, ls_disp_hr));
593 #if _FILE_OFFSET_BITS == 64
594 printf("%4lld ", dn->dstat.st_blocks>>1);
596 printf("%4ld ", dn->dstat.st_blocks>>1);
602 printf("%10s", (char *)mode_string(dn->dstat.st_mode));
606 printf("%4d ", dn->dstat.st_nlink);
610 #ifdef BB_FEATURE_LS_USERNAME
611 my_getpwuid(scratch, dn->dstat.st_uid);
613 printf("%-8.8s ", scratch);
615 printf("%-8d ", dn->dstat.st_uid);
616 my_getgrgid(scratch, dn->dstat.st_gid);
618 printf("%-8.8s", scratch);
620 printf("%-8d", dn->dstat.st_gid);
624 case LIST_ID_NUMERIC:
625 printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
630 if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
631 printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
633 #ifdef BB_FEATURE_HUMAN_READABLE
634 fprintf(stdout, "%9s ", format(dn->dstat.st_size, ls_disp_hr));
636 #if _FILE_OFFSET_BITS == 64
637 printf("%9lld ", dn->dstat.st_size);
639 printf("%9ld ", dn->dstat.st_size);
645 #ifdef BB_FEATURE_LS_TIMESTAMPS
648 if (list_fmt & LIST_FULLTIME) {
649 printf("%24.24s ", filetime);
653 age = time(NULL) - ttime;
654 printf("%6.6s ", filetime+4);
655 if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
656 /* hh:mm if less than 6 months old */
657 printf("%5.5s ", filetime+11);
659 printf(" %4.4s ", filetime+20);
665 printf("%s", dn->name);
666 column += strlen(dn->name);
669 if (S_ISLNK(dn->dstat.st_mode)) {
670 len= readlink(dn->fullname, scratch, (sizeof scratch)-1);
673 printf(" -> %s", scratch);
674 #ifdef BB_FEATURE_LS_FILETYPES
675 if (!stat(dn->fullname, &info)) {
676 append = append_char(info.st_mode);
683 #ifdef BB_FEATURE_LS_FILETYPES
685 if (append != '\0') {
686 printf("%1c", append);
697 /*----------------------------------------------------------------------*/
698 extern int ls_main(int argc, char **argv)
700 struct dnode **dnf, **dnd;
702 struct dnode *dn, *cur, **dnp;
708 disp_opts= DISP_NORMAL;
709 style_fmt= STYLE_AUTO;
710 list_fmt= LIST_SHORT;
711 #ifdef BB_FEATURE_LS_SORTFILES
712 sort_opts= SORT_NAME;
714 #ifdef BB_FEATURE_LS_TIMESTAMPS
719 /* process options */
720 while ((opt = getopt(argc, argv, "1AaCdgilnsx"
721 #ifdef BB_FEATURE_AUTOWIDTH
724 #ifdef BB_FEATURE_LS_FILETYPES
727 #ifdef BB_FEATURE_LS_RECURSIVE
730 #ifdef BB_FEATURE_LS_SORTFILES
733 #ifdef BB_FEATURE_LS_TIMESTAMPS
736 #ifdef BB_FEATURE_LS_FOLLOWLINKS
739 #ifdef BB_FEATURE_HUMAN_READABLE
744 case '1': style_fmt = STYLE_SINGLE; break;
745 case 'A': disp_opts |= DISP_HIDDEN; break;
746 case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
747 case 'C': style_fmt = STYLE_COLUMNS; break;
748 case 'd': disp_opts |= DISP_NOLIST; break;
749 case 'g': /* ignore -- for ftp servers */ break;
750 case 'i': list_fmt |= LIST_INO; break;
752 style_fmt = STYLE_LONG;
753 list_fmt |= LIST_LONG;
754 #ifdef BB_FEATURE_HUMAN_READABLE
758 case 'n': list_fmt |= LIST_ID_NUMERIC; break;
759 case 's': list_fmt |= LIST_BLOCKS; break;
760 case 'x': disp_opts = DISP_ROWS; break;
761 #ifdef BB_FEATURE_LS_FILETYPES
762 case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
763 case 'p': list_fmt |= LIST_FILETYPE; break;
765 #ifdef BB_FEATURE_LS_RECURSIVE
766 case 'R': disp_opts |= DISP_RECURSIVE; break;
768 #ifdef BB_FEATURE_LS_SORTFILES
769 case 'r': sort_order |= SORT_REVERSE; break;
770 case 'S': sort_opts= SORT_SIZE; break;
771 case 'v': sort_opts= SORT_VERSION; break;
772 case 'X': sort_opts= SORT_EXT; break;
774 #ifdef BB_FEATURE_LS_TIMESTAMPS
775 case 'e': list_fmt |= LIST_FULLTIME; break;
777 time_fmt = TIME_CHANGE;
778 #ifdef BB_FEATURE_LS_SORTFILES
779 sort_opts= SORT_CTIME;
783 time_fmt = TIME_ACCESS;
784 #ifdef BB_FEATURE_LS_SORTFILES
785 sort_opts= SORT_ATIME;
789 #ifdef BB_FEATURE_LS_SORTFILES
790 sort_opts= SORT_MTIME;
794 #ifdef BB_FEATURE_LS_FOLLOWLINKS
795 case 'L': follow_links= TRUE; break;
797 #ifdef BB_FEATURE_AUTOWIDTH
798 case 'T': tabstops= atoi(optarg); break;
799 case 'w': terminal_width= atoi(optarg); break;
801 #ifdef BB_FEATURE_HUMAN_READABLE
802 case 'h': ls_disp_hr = 0; break;
803 case 'k': ls_disp_hr = KILOBYTE; break;
808 goto print_usage_message;
812 /* sort out which command line options take precedence */
813 #ifdef BB_FEATURE_LS_RECURSIVE
814 if (disp_opts & DISP_NOLIST)
815 disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
817 #if defined (BB_FEATURE_LS_TIMESTAMPS) && defined (BB_FEATURE_LS_SORTFILES)
818 if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
819 if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
821 if (style_fmt != STYLE_LONG)
822 list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
823 #ifdef BB_FEATURE_LS_USERNAME
824 if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
825 list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
828 /* choose a display format */
829 if (style_fmt == STYLE_AUTO)
830 style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
833 * when there are no cmd line args we have to supply a default "." arg.
834 * we will create a second argv array, "av" that will hold either
835 * our created "." arg, or the real cmd line args. The av array
836 * just holds the pointers- we don't move the date the pointers
839 ac= argc - optind; /* how many cmd line args are left */
841 av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
845 av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
846 for (oi=0 ; oi < ac; oi++) {
847 av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
851 /* now, everything is in the av array */
853 disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
855 /* stuff the command line file names into an dnode array */
857 for (oi=0 ; oi < ac; oi++) {
858 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
859 cur->fullname= xstrdup(av[oi]);
860 cur->name= cur->fullname;
868 /* now that we know how many files there are
869 ** allocate memory for an array to hold dnode pointers
871 dnp= dnalloc(nfiles);
872 for (i=0, cur=dn; i<nfiles; i++) {
873 dnp[i]= cur; /* save pointer to node in array */
878 if (disp_opts & DISP_NOLIST) {
879 #ifdef BB_FEATURE_LS_SORTFILES
880 shellsort(dnp, nfiles);
882 if (nfiles > 0) showfiles(dnp, nfiles);
884 dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
885 dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
886 dndirs= countdirs(dnp, nfiles);
887 dnfiles= nfiles - dndirs;
889 #ifdef BB_FEATURE_LS_SORTFILES
890 shellsort(dnf, dnfiles);
892 showfiles(dnf, dnfiles);
895 #ifdef BB_FEATURE_LS_SORTFILES
896 shellsort(dnd, dndirs);
898 showdirs(dnd, dndirs);