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)
131 #define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
132 #define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
133 #ifdef BB_FEATURE_LS_FILETYPES
134 #define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
138 * a directory entry and its stat info are stored here
140 struct dnode { /* the basic node */
141 char *name; /* the dir entry name */
142 char *fullname; /* the dir entry name */
143 struct stat dstat; /* the file stat info */
144 struct dnode *next; /* point at the next node */
146 typedef struct dnode dnode_t;
148 struct dnode **list_dir(char *);
149 struct dnode **dnalloc(int);
150 int list_single(struct dnode *);
152 static unsigned int disp_opts= DISP_NORMAL;
153 static unsigned int style_fmt= STYLE_AUTO ;
154 static unsigned int list_fmt= LIST_SHORT ;
155 #ifdef BB_FEATURE_LS_SORTFILES
156 static unsigned int sort_opts= SORT_FORWARD;
157 static unsigned int sort_order= SORT_FORWARD;
159 #ifdef BB_FEATURE_LS_TIMESTAMPS
160 static unsigned int time_fmt= TIME_MOD;
162 #ifdef BB_FEATURE_LS_FOLLOWLINKS
163 static unsigned int follow_links=FALSE;
166 static unsigned short column = 0;
167 #ifdef BB_FEATURE_AUTOWIDTH
168 static unsigned short terminal_width = TERMINAL_WIDTH;
169 static unsigned short column_width = COLUMN_WIDTH;
170 static unsigned short tabstops = 8;
172 #define terminal_width TERMINAL_WIDTH
173 #define column_width COLUMN_WIDTH
176 static void newline(void)
179 fprintf(stdout, "\n");
184 /*----------------------------------------------------------------------*/
185 #ifdef BB_FEATURE_LS_FILETYPES
186 static char append_char(mode_t mode)
188 if ( !(list_fmt & LIST_FILETYPE))
190 if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
191 && (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
192 return APPCHAR(mode);
196 /*----------------------------------------------------------------------*/
197 static void nexttabstop( void )
199 static short nexttab= 0;
206 fprintf(stdout, " ");
210 nexttab= column + column_width + COLUMN_GAP ;
213 /*----------------------------------------------------------------------*/
214 int countdirs(struct dnode **dn, int nfiles)
218 /* count how many dirs and regular files there are */
219 if (dn==NULL || nfiles < 1) return(0);
221 for (i=0; i<nfiles; i++) {
222 if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
227 int countfiles(struct dnode **dnp)
232 if (dnp == NULL) return(0);
234 for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
239 /* get memory to hold an array of pointers */
240 struct dnode **dnalloc(int num)
244 if (num < 1) return(NULL);
246 p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
250 void dfree(struct dnode **dnp)
252 struct dnode *cur, *next;
254 if(dnp == NULL) return;
257 while (cur != NULL) {
258 if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
260 free(cur); /* free the dnode */
263 free(dnp); /* free the array holding the dnode pointers */
266 struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
271 if (dn==NULL || nfiles < 1) return(NULL);
273 /* count how many dirs and regular files there are */
274 dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
275 if (which != SPLIT_DIR)
276 dncnt= nfiles - dncnt; /* looking for files */
278 /* allocate a file array and a dir array */
281 /* copy the entrys into the file or dir array */
282 for (d= i=0; i<nfiles; i++) {
283 if (which == SPLIT_DIR) {
284 if (S_ISDIR(dn[i]->dstat.st_mode)) {
286 } /* else skip the file */
288 if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
290 } /* else skip the dir */
296 /*----------------------------------------------------------------------*/
297 #ifdef BB_FEATURE_LS_SORTFILES
298 int sortcmp(struct dnode *d1, struct dnode *d2)
303 if (sort_opts == SORT_SIZE) {
304 dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
305 } else if (sort_opts == SORT_ATIME) {
306 dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
307 } else if (sort_opts == SORT_CTIME) {
308 dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
309 } else if (sort_opts == SORT_MTIME) {
310 dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
311 } else if (sort_opts == SORT_DIR) {
312 dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
313 /* } else if (sort_opts == SORT_VERSION) { */
314 /* } else if (sort_opts == SORT_EXT) { */
315 } else { /* assume SORT_NAME */
319 if (dif > 0) cmp= -1;
322 /* sort by name- may be a tie_breaker for time or size cmp */
323 dif= strcmp(d1->name, d2->name);
325 if (dif < 0) cmp= -1;
328 if (sort_order == SORT_REVERSE) {
334 /*----------------------------------------------------------------------*/
335 void shellsort(struct dnode **dn, int size)
340 /* shell short the array */
341 if(dn==NULL || size < 2) return;
343 for (gap= size/2; gap>0; gap /=2) {
344 for (i=gap; i<size; i++) {
345 for (j= i-gap; j>=0; j-=gap) {
346 if (sortcmp(dn[j], dn[j+gap]) <= 0)
348 /* they are out of order, swap them */
358 /*----------------------------------------------------------------------*/
359 void showfiles(struct dnode **dn, int nfiles)
361 int i, ncols, nrows, row, nc;
362 #ifdef BB_FEATURE_AUTOWIDTH
366 if(dn==NULL || nfiles < 1) return;
368 #ifdef BB_FEATURE_AUTOWIDTH
369 /* find the longest file name- use that as the column width */
371 for (i=0; i<nfiles; i++) {
372 len= strlen(dn[i]->name) +
373 ((list_fmt & LIST_INO) ? 8 : 0) +
374 ((list_fmt & LIST_BLOCKS) ? 5 : 0)
376 if (column_width < len) column_width= len;
379 ncols= (int)(terminal_width / (column_width + COLUMN_GAP));
381 case STYLE_LONG: /* one record per line, extended info */
382 case STYLE_SINGLE: /* one record per line */
387 nrows= nfiles / ncols;
388 if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
390 if (nrows > nfiles) nrows= nfiles;
391 for (row=0; row<nrows; row++) {
392 for (nc=0; nc<ncols; nc++) {
393 /* reach into the array based on the column and row */
394 i= (nc * nrows) + row; /* assume display by column */
395 if (disp_opts & DISP_ROWS)
396 i= (row * ncols) + nc; /* display across row */
406 /*----------------------------------------------------------------------*/
407 void showdirs(struct dnode **dn, int ndirs)
410 struct dnode **subdnp;
411 #ifdef BB_FEATURE_LS_SORTFILES
416 if (dn==NULL || ndirs < 1) return;
418 for (i=0; i<ndirs; i++) {
419 if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
420 fprintf(stdout, "\n%s:\n", dn[i]->fullname);
422 subdnp= list_dir(dn[i]->fullname);
423 nfiles= countfiles(subdnp);
425 /* list all files at this level */
426 #ifdef BB_FEATURE_LS_SORTFILES
427 shellsort(subdnp, nfiles);
429 showfiles(subdnp, nfiles);
430 #ifdef BB_FEATURE_LS_RECURSIVE
431 if (disp_opts & DISP_RECURSIVE) {
432 /* recursive- list the sub-dirs */
433 dnd= splitdnarray(subdnp, nfiles, SPLIT_DIR);
434 dndirs= countdirs(subdnp, nfiles);
436 shellsort(dnd, dndirs);
437 showdirs(dnd, dndirs);
438 free(dnd); /* free the array of dnode pointers to the dirs */
441 dfree(subdnp); /* free the dnodes and the fullname mem */
447 /*----------------------------------------------------------------------*/
448 struct dnode **list_dir(char *path)
450 struct dnode *dn, *cur, **dnp;
451 struct dirent *entry;
453 char *fnend, fullname[BUFSIZ+1] ;
456 if (path==NULL) return(NULL);
457 strcpy(fullname, path);
458 fnend = fullname + strlen(fullname);
459 if (fnend[-1] != '/') {
460 strcat(fullname, "/");
466 dir = opendir(fullname);
468 errorMsg("%s: %s\n", fullname, strerror(errno));
469 return(NULL); /* could not open the dir */
471 while ((entry = readdir(dir)) != NULL) {
472 /* are we going to list the file- it may be . or .. or a hidden file */
473 strcpy(fnend, entry->d_name);
474 if ((strcmp(fnend, ".")==0) && !(disp_opts & DISP_DOT)) continue;
475 if ((strcmp(fnend, "..")==0) && !(disp_opts & DISP_DOT)) continue;
476 if ((fnend[0] == '.') && !(disp_opts & DISP_HIDDEN)) continue;
477 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
478 cur->fullname= xstrdup(fullname);
479 cur->name= cur->fullname + (int)(fnend - fullname) ;
480 #ifdef BB_FEATURE_LS_FOLLOWLINKS
481 if (follow_links == TRUE) {
482 if (stat(fullname, &cur->dstat)) {
483 errorMsg("%s: %s\n", fullname, strerror(errno));
490 if (lstat(fullname, &cur->dstat)) { /* get file stat info into node */
491 errorMsg("%s: %s\n", fullname, strerror(errno));
502 /* now that we know how many files there are
503 ** allocate memory for an array to hold dnode pointers
505 if (nfiles < 1) return(NULL);
506 dnp= dnalloc(nfiles);
507 for (i=0, cur=dn; i<nfiles; i++) {
508 dnp[i]= cur; /* save pointer to node in array */
515 /*----------------------------------------------------------------------*/
516 int list_single(struct dnode *dn)
519 char scratch[BUFSIZ + 1];
520 #ifdef BB_FEATURE_LS_TIMESTAMPS
524 #ifdef BB_FEATURE_LS_FILETYPES
529 if (dn==NULL || dn->fullname==NULL) return(0);
531 #ifdef BB_FEATURE_LS_TIMESTAMPS
532 ttime= dn->dstat.st_mtime; /* the default time */
533 if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
534 if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
535 filetime= ctime(&ttime);
537 #ifdef BB_FEATURE_LS_FILETYPES
538 append = append_char(dn->dstat.st_mode);
541 for (i=0; i<=31; i++) {
542 switch (list_fmt & (1<<i)) {
544 fprintf(stdout, "%7ld ", dn->dstat.st_ino);
548 #if _FILE_OFFSET_BITS == 64
549 fprintf(stdout, "%4lld ", dn->dstat.st_blocks>>1);
551 fprintf(stdout, "%4ld ", dn->dstat.st_blocks>>1);
556 fprintf(stdout, "%10s", (char *)modeString(dn->dstat.st_mode));
560 fprintf(stdout, "%4d ", dn->dstat.st_nlink);
564 #ifdef BB_FEATURE_LS_USERNAME
566 memset(&info, 0, sizeof(struct stat));
567 memset(scratch, 0, sizeof(scratch));
568 if (!stat(dn->fullname, &info)) {
569 my_getpwuid(scratch, info.st_uid);
572 fprintf(stdout, "%-8.8s ", scratch);
574 fprintf(stdout, "%-8d ", dn->dstat.st_uid);
576 memset(scratch, 0, sizeof(scratch));
577 if (info.st_ctime != 0) {
578 my_getgrgid(scratch, info.st_gid);
581 fprintf(stdout, "%-8.8s", scratch);
583 fprintf(stdout, "%-8d", dn->dstat.st_gid);
589 case LIST_ID_NUMERIC:
590 fprintf(stdout, "%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
595 if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
596 fprintf(stdout, "%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
598 #if _FILE_OFFSET_BITS == 64
599 fprintf(stdout, "%9lld ", dn->dstat.st_size);
601 fprintf(stdout, "%9ld ", dn->dstat.st_size);
606 #ifdef BB_FEATURE_LS_TIMESTAMPS
609 if (list_fmt & LIST_FULLTIME) {
610 fprintf(stdout, "%24.24s ", filetime);
614 age = time(NULL) - ttime;
615 fprintf(stdout, "%6.6s ", filetime+4);
616 if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
617 /* hh:mm if less than 6 months old */
618 fprintf(stdout, "%5.5s ", filetime+11);
620 fprintf(stdout, " %4.4s ", filetime+20);
626 fprintf(stdout, "%s", dn->name);
627 column += strlen(dn->name);
630 if (S_ISLNK(dn->dstat.st_mode)) {
631 len= readlink(dn->fullname, scratch, (sizeof scratch)-1);
634 fprintf(stdout, " -> %s", scratch);
635 #ifdef BB_FEATURE_LS_FILETYPES
636 if (!stat(dn->fullname, &info)) {
637 append = append_char(info.st_mode);
644 #ifdef BB_FEATURE_LS_FILETYPES
646 if (append != '\0') {
647 fprintf(stdout, "%1c", append);
658 /*----------------------------------------------------------------------*/
659 extern int ls_main(int argc, char **argv)
661 struct dnode **dnf, **dnd;
663 struct dnode *dn, *cur, **dnp;
669 disp_opts= DISP_NORMAL;
670 style_fmt= STYLE_AUTO;
671 list_fmt= LIST_SHORT;
672 #ifdef BB_FEATURE_LS_SORTFILES
673 sort_opts= SORT_NAME;
675 #ifdef BB_FEATURE_LS_TIMESTAMPS
680 applet_name= argv[0];
681 /* process options */
682 while ((opt = getopt(argc, argv, "1AaCdgilnsx"
683 #ifdef BB_FEATURE_AUTOWIDTH
686 #ifdef BB_FEATURE_LS_FILETYPES
689 #ifdef BB_FEATURE_LS_RECURSIVE
692 #ifdef BB_FEATURE_LS_SORTFILES
695 #ifdef BB_FEATURE_LS_TIMESTAMPS
698 #ifdef BB_FEATURE_LS_FOLLOWLINKS
703 case '1': style_fmt = STYLE_SINGLE; break;
704 case 'A': disp_opts |= DISP_HIDDEN; break;
705 case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
706 case 'C': style_fmt = STYLE_COLUMNS; break;
707 case 'd': disp_opts |= DISP_NOLIST; break;
708 case 'e': list_fmt |= LIST_FULLTIME; break;
709 case 'g': /* ignore -- for ftp servers */ break;
710 case 'i': list_fmt |= LIST_INO; break;
711 case 'l': style_fmt = STYLE_LONG; list_fmt |= LIST_LONG; break;
712 case 'n': list_fmt |= LIST_ID_NUMERIC; break;
713 case 's': list_fmt |= LIST_BLOCKS; break;
714 case 'x': disp_opts = DISP_ROWS; break;
715 #ifdef BB_FEATURE_LS_FILETYPES
716 case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
717 case 'p': list_fmt |= LIST_FILETYPE; break;
719 #ifdef BB_FEATURE_LS_RECURSIVE
720 case 'R': disp_opts |= DISP_RECURSIVE; break;
722 #ifdef BB_FEATURE_LS_SORTFILES
723 case 'r': sort_order |= SORT_REVERSE; break;
724 case 'S': sort_opts= SORT_SIZE; break;
725 case 'v': sort_opts= SORT_VERSION; break;
726 case 'X': sort_opts= SORT_EXT; break;
728 #ifdef BB_FEATURE_LS_TIMESTAMPS
729 case 'c': time_fmt = TIME_CHANGE; sort_opts= SORT_CTIME; break;
730 case 't': sort_opts= SORT_MTIME; break;
731 case 'u': time_fmt = TIME_ACCESS; sort_opts= SORT_ATIME; break;
733 #ifdef BB_FEATURE_LS_FOLLOWLINKS
734 case 'L': follow_links= TRUE; break;
736 #ifdef BB_FEATURE_AUTOWIDTH
737 case 'T': tabstops= atoi(optarg); break;
738 case 'w': terminal_width= atoi(optarg); break;
741 goto print_usage_message;
745 /* sort out which command line options take precedence */
746 #ifdef BB_FEATURE_LS_RECURSIVE
747 if (disp_opts & DISP_NOLIST)
748 disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
750 #ifdef BB_FEATURE_LS_TIMESTAMPS
751 if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
752 if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
754 if (style_fmt != STYLE_LONG)
755 list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
756 #ifdef BB_FEATURE_LS_USERNAME
757 if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
758 list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
761 /* choose a display format */
762 if (style_fmt == STYLE_AUTO)
763 style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
766 * when there are no cmd line args we have to supply a default "." arg.
767 * we will create a second argv array, "av" that will hold either
768 * our created "." arg, or the real cmd line args. The av array
769 * just holds the pointers- we don't move the date the pointers
772 ac= argc - optind; /* how many cmd line args are left */
774 av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
778 av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
779 for (oi=0 ; oi < ac; oi++) {
780 av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
784 /* now, everything is in the av array */
786 disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
788 /* stuff the command line file names into an dnode array */
790 for (oi=0 ; oi < ac; oi++) {
791 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
792 cur->fullname= xstrdup(av[oi]);
793 cur->name= cur->fullname;
794 #ifdef BB_FEATURE_LS_FOLLOWLINKS
795 if (follow_links == TRUE) {
796 if (stat(av[oi], &cur->dstat)) {
797 errorMsg("%s: %s\n", av[oi], strerror(errno));
804 if (lstat(av[oi], &cur->dstat)) { /* get file info into node */
805 errorMsg("%s: %s\n", av[oi], strerror(errno));
815 /* now that we know how many files there are
816 ** allocate memory for an array to hold dnode pointers
818 dnp= dnalloc(nfiles);
819 for (i=0, cur=dn; i<nfiles; i++) {
820 dnp[i]= cur; /* save pointer to node in array */
825 if (disp_opts & DISP_NOLIST) {
826 #ifdef BB_FEATURE_LS_SORTFILES
827 shellsort(dnp, nfiles);
829 if (nfiles > 0) showfiles(dnp, nfiles);
831 dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
832 dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
833 dndirs= countdirs(dnp, nfiles);
834 dnfiles= nfiles - dndirs;
836 #ifdef BB_FEATURE_LS_SORTFILES
837 shellsort(dnf, dnfiles);
839 showfiles(dnf, dnfiles);
842 #ifdef BB_FEATURE_LS_SORTFILES
843 shellsort(dnd, dndirs);
845 showdirs(dnd, dndirs);