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;
163 static unsigned short column = 0;
164 #ifdef BB_FEATURE_AUTOWIDTH
165 static unsigned short terminal_width = TERMINAL_WIDTH;
166 static unsigned short column_width = COLUMN_WIDTH;
167 static unsigned short tabstops = 8;
169 #define terminal_width TERMINAL_WIDTH
170 #define column_width COLUMN_WIDTH
173 static void newline(void)
176 fprintf(stdout, "\n");
181 /*----------------------------------------------------------------------*/
182 #ifdef BB_FEATURE_LS_FILETYPES
183 static char append_char(mode_t mode)
185 if ( !(list_fmt & LIST_FILETYPE))
187 if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
188 && (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
189 return APPCHAR(mode);
193 /*----------------------------------------------------------------------*/
194 static void nexttabstop( void )
196 static short nexttab= 0;
203 fprintf(stdout, " ");
207 nexttab= column + column_width + COLUMN_GAP ;
210 /*----------------------------------------------------------------------*/
211 int countdirs(struct dnode **dn, int nfiles)
215 /* count how many dirs and regular files there are */
216 if (dn==NULL || nfiles < 1) return(0);
218 for (i=0; i<nfiles; i++) {
219 if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
224 int countfiles(struct dnode **dnp)
229 if (dnp == NULL) return(0);
231 for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
236 /* get memory to hold an array of pointers */
237 struct dnode **dnalloc(int num)
241 if (num < 1) return(NULL);
243 p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
247 void dfree(struct dnode **dnp)
249 struct dnode *cur, *next;
251 if(dnp == NULL) return;
254 while (cur != NULL) {
255 if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
257 free(cur); /* free the dnode */
260 free(dnp); /* free the array holding the dnode pointers */
263 struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
268 if (dn==NULL || nfiles < 1) return(NULL);
270 /* count how many dirs and regular files there are */
271 dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
272 if (which != SPLIT_DIR)
273 dncnt= nfiles - dncnt; /* looking for files */
275 /* allocate a file array and a dir array */
278 /* copy the entrys into the file or dir array */
279 for (d= i=0; i<nfiles; i++) {
280 if (which == SPLIT_DIR) {
281 if (S_ISDIR(dn[i]->dstat.st_mode)) {
283 } /* else skip the file */
285 if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
287 } /* else skip the dir */
293 /*----------------------------------------------------------------------*/
294 #ifdef BB_FEATURE_LS_SORTFILES
295 int sortcmp(struct dnode *d1, struct dnode *d2)
300 if (sort_opts == SORT_SIZE) {
301 dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
302 } else if (sort_opts == SORT_ATIME) {
303 dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
304 } else if (sort_opts == SORT_CTIME) {
305 dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
306 } else if (sort_opts == SORT_MTIME) {
307 dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
308 } else if (sort_opts == SORT_DIR) {
309 dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
310 /* } else if (sort_opts == SORT_VERSION) { */
311 /* } else if (sort_opts == SORT_EXT) { */
312 } else { /* assume SORT_NAME */
316 if (dif > 0) cmp= -1;
319 /* sort by name- may be a tie_breaker for time or size cmp */
320 dif= strcmp(d1->name, d2->name);
322 if (dif < 0) cmp= -1;
325 if (sort_order == SORT_REVERSE) {
331 /*----------------------------------------------------------------------*/
332 void shellsort(struct dnode **dn, int size)
337 /* shell short the array */
338 if(dn==NULL || size < 2) return;
340 for (gap= size/2; gap>0; gap /=2) {
341 for (i=gap; i<size; i++) {
342 for (j= i-gap; j>=0; j-=gap) {
343 if (sortcmp(dn[j], dn[j+gap]) <= 0)
345 /* they are out of order, swap them */
355 /*----------------------------------------------------------------------*/
356 void showfiles(struct dnode **dn, int nfiles)
358 int i, ncols, nrows, row, nc;
359 #ifdef BB_FEATURE_AUTOWIDTH
363 if(dn==NULL || nfiles < 1) return;
365 #ifdef BB_FEATURE_AUTOWIDTH
366 /* find the longest file name- use that as the column width */
368 for (i=0; i<nfiles; i++) {
369 len= strlen(dn[i]->name) +
370 ((list_fmt & LIST_INO) ? 8 : 0) +
371 ((list_fmt & LIST_BLOCKS) ? 5 : 0)
373 if (column_width < len) column_width= len;
376 ncols= (int)(terminal_width / (column_width + COLUMN_GAP));
378 case STYLE_LONG: /* one record per line, extended info */
379 case STYLE_SINGLE: /* one record per line */
384 nrows= nfiles / ncols;
385 if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
387 if (nrows > nfiles) nrows= nfiles;
388 for (row=0; row<nrows; row++) {
389 for (nc=0; nc<ncols; nc++) {
390 /* reach into the array based on the column and row */
391 i= (nc * nrows) + row; /* assume display by column */
392 if (disp_opts & DISP_ROWS)
393 i= (row * ncols) + nc; /* display across row */
403 /*----------------------------------------------------------------------*/
404 void showdirs(struct dnode **dn, int ndirs)
407 struct dnode **subdnp;
408 #ifdef BB_FEATURE_LS_SORTFILES
413 if (dn==NULL || ndirs < 1) return;
415 for (i=0; i<ndirs; i++) {
416 if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
417 fprintf(stdout, "\n%s:\n", dn[i]->fullname);
419 subdnp= list_dir(dn[i]->fullname);
420 nfiles= countfiles(subdnp);
422 /* list all files at this level */
423 #ifdef BB_FEATURE_LS_SORTFILES
424 shellsort(subdnp, nfiles);
426 showfiles(subdnp, nfiles);
427 #ifdef BB_FEATURE_LS_RECURSIVE
428 if (disp_opts & DISP_RECURSIVE) {
429 /* recursive- list the sub-dirs */
430 dnd= splitdnarray(subdnp, nfiles, SPLIT_DIR);
431 dndirs= countdirs(subdnp, nfiles);
433 shellsort(dnd, dndirs);
434 showdirs(dnd, dndirs);
435 free(dnd); /* free the array of dnode pointers to the dirs */
438 dfree(subdnp); /* free the dnodes and the fullname mem */
444 /*----------------------------------------------------------------------*/
445 struct dnode **list_dir(char *path)
447 struct dnode *dn, *cur, **dnp;
448 struct dirent *entry;
450 char *fnend, fullname[BUFSIZ+1] ;
453 if (path==NULL) return(NULL);
454 strcpy(fullname, path);
455 fnend = fullname + strlen(fullname);
456 if (fnend[-1] != '/') {
457 strcat(fullname, "/");
463 dir = opendir(fullname);
465 errorMsg("%s: %s\n", fullname, strerror(errno));
466 return(NULL); /* could not open the dir */
468 while ((entry = readdir(dir)) != NULL) {
469 /* are we going to list the file- it may be . or .. or a hidden file */
470 strcpy(fnend, entry->d_name);
471 if ((strcmp(fnend, ".")==0) && !(disp_opts & DISP_DOT)) continue;
472 if ((strcmp(fnend, "..")==0) && !(disp_opts & DISP_DOT)) continue;
473 if ((fnend[0] == '.') && !(disp_opts & DISP_HIDDEN)) continue;
474 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
475 cur->fullname= xstrdup(fullname);
476 cur->name= cur->fullname + (int)(fnend - fullname) ;
477 if (lstat(fullname, &cur->dstat)) { /* get file stat info into node */
478 errorMsg("%s: %s\n", fullname, strerror(errno));
489 /* now that we know how many files there are
490 ** allocate memory for an array to hold dnode pointers
492 if (nfiles < 1) return(NULL);
493 dnp= dnalloc(nfiles);
494 for (i=0, cur=dn; i<nfiles; i++) {
495 dnp[i]= cur; /* save pointer to node in array */
502 /*----------------------------------------------------------------------*/
503 int list_single(struct dnode *dn)
506 char scratch[BUFSIZ + 1];
507 #ifdef BB_FEATURE_LS_TIMESTAMPS
511 #ifdef BB_FEATURE_LS_FILETYPES
516 if (dn==NULL || dn->fullname==NULL) return(0);
518 #ifdef BB_FEATURE_LS_TIMESTAMPS
519 ttime= dn->dstat.st_mtime; /* the default time */
520 if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
521 if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
522 filetime= ctime(&ttime);
524 #ifdef BB_FEATURE_LS_FILETYPES
525 append = append_char(dn->dstat.st_mode);
528 for (i=0; i<=31; i++) {
529 switch (list_fmt & (1<<i)) {
531 fprintf(stdout, "%7ld ", dn->dstat.st_ino);
535 fprintf(stdout, "%4ld ", dn->dstat.st_blocks>>1);
539 fprintf(stdout, "%10s", (char *)modeString(dn->dstat.st_mode));
543 fprintf(stdout, "%4d ", dn->dstat.st_nlink);
547 #ifdef BB_FEATURE_LS_USERNAME
549 memset(&info, 0, sizeof(struct stat));
550 memset(scratch, 0, sizeof(scratch));
551 if (!stat(dn->fullname, &info)) {
552 my_getpwuid(scratch, info.st_uid);
555 fprintf(stdout, "%-8.8s ", scratch);
557 fprintf(stdout, "%-8d ", dn->dstat.st_uid);
559 memset(scratch, 0, sizeof(scratch));
560 if (info.st_ctime != 0) {
561 my_getgrgid(scratch, info.st_gid);
564 fprintf(stdout, "%-8.8s", scratch);
566 fprintf(stdout, "%-8d", dn->dstat.st_gid);
572 case LIST_ID_NUMERIC:
573 fprintf(stdout, "%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
578 if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
579 fprintf(stdout, "%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
581 fprintf(stdout, "%9ld ", dn->dstat.st_size);
585 #ifdef BB_FEATURE_LS_TIMESTAMPS
588 if (list_fmt & LIST_FULLTIME) {
589 fprintf(stdout, "%24.24s ", filetime);
593 age = time(NULL) - ttime;
594 fprintf(stdout, "%6.6s ", filetime+4);
595 if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
596 /* hh:mm if less than 6 months old */
597 fprintf(stdout, "%5.5s ", filetime+11);
599 fprintf(stdout, " %4.4s ", filetime+20);
605 fprintf(stdout, "%s", dn->name);
606 column += strlen(dn->name);
609 if (S_ISLNK(dn->dstat.st_mode)) {
610 len= readlink(dn->fullname, scratch, (sizeof scratch)-1);
613 fprintf(stdout, " -> %s", scratch);
614 #ifdef BB_FEATURE_LS_FILETYPES
615 if (!stat(dn->fullname, &info)) {
616 append = append_char(info.st_mode);
623 #ifdef BB_FEATURE_LS_FILETYPES
625 if (append != '\0') {
626 fprintf(stdout, "%1c", append);
637 /*----------------------------------------------------------------------*/
638 extern int ls_main(int argc, char **argv)
640 struct dnode **dnf, **dnd;
642 struct dnode *dn, *cur, **dnp;
648 disp_opts= DISP_NORMAL;
649 style_fmt= STYLE_AUTO;
650 list_fmt= LIST_SHORT;
651 #ifdef BB_FEATURE_LS_SORTFILES
652 sort_opts= SORT_NAME;
654 #ifdef BB_FEATURE_LS_TIMESTAMPS
659 applet_name= argv[0];
660 /* process options */
661 while ((opt = getopt(argc, argv, "1AaCdgilnsx"
662 #ifdef BB_FEATURE_AUTOWIDTH
665 #ifdef BB_FEATURE_LS_FILETYPES
668 #ifdef BB_FEATURE_LS_RECURSIVE
671 #ifdef BB_FEATURE_LS_SORTFILES
674 #ifdef BB_FEATURE_LS_TIMESTAMPS
679 case '1': style_fmt = STYLE_SINGLE; break;
680 case 'A': disp_opts |= DISP_HIDDEN; break;
681 case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
682 case 'C': style_fmt = STYLE_COLUMNS; break;
683 case 'd': disp_opts |= DISP_NOLIST; break;
684 case 'e': list_fmt |= LIST_FULLTIME; break;
685 case 'g': /* ignore -- for ftp servers */ break;
686 case 'i': list_fmt |= LIST_INO; break;
687 case 'l': style_fmt = STYLE_LONG; list_fmt |= LIST_LONG; break;
688 case 'n': list_fmt |= LIST_ID_NUMERIC; break;
689 case 's': list_fmt |= LIST_BLOCKS; break;
690 case 'x': disp_opts = DISP_ROWS; break;
691 #ifdef BB_FEATURE_LS_FILETYPES
692 case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
693 case 'p': list_fmt |= LIST_FILETYPE; break;
695 #ifdef BB_FEATURE_LS_RECURSIVE
696 case 'R': disp_opts |= DISP_RECURSIVE; break;
698 #ifdef BB_FEATURE_LS_SORTFILES
699 case 'r': sort_order |= SORT_REVERSE; break;
700 case 'S': sort_opts= SORT_SIZE; break;
701 case 'v': sort_opts= SORT_VERSION; break;
702 case 'X': sort_opts= SORT_EXT; break;
704 #ifdef BB_FEATURE_LS_TIMESTAMPS
705 case 'c': time_fmt = TIME_CHANGE; sort_opts= SORT_CTIME; break;
706 case 't': sort_opts= SORT_MTIME; break;
707 case 'u': time_fmt = TIME_ACCESS; sort_opts= SORT_ATIME; break;
709 #ifdef BB_FEATURE_AUTOWIDTH
710 case 'T': tabstops= atoi(optarg); break;
711 case 'w': terminal_width= atoi(optarg); break;
714 goto print_usage_message;
718 /* sort out which command line options take precedence */
719 #ifdef BB_FEATURE_LS_RECURSIVE
720 if (disp_opts & DISP_NOLIST)
721 disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
723 #ifdef BB_FEATURE_LS_TIMESTAMPS
724 if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
725 if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
727 if (style_fmt != STYLE_LONG)
728 list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
729 #ifdef BB_FEATURE_LS_USERNAME
730 if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
731 list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
734 /* choose a display format */
735 if (style_fmt == STYLE_AUTO)
736 style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
739 * when there are no cmd line args we have to supply a default "." arg.
740 * we will create a second argv array, "av" that will hold either
741 * our created "." arg, or the real cmd line args. The av array
742 * just holds the pointers- we don't move the date the pointers
745 ac= argc - optind; /* how many cmd line args are left */
747 av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
751 av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
752 for (oi=0 ; oi < ac; oi++) {
753 av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
757 /* now, everything is in the av array */
759 disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
761 /* stuff the command line file names into an dnode array */
763 for (oi=0 ; oi < ac; oi++) {
764 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
765 cur->fullname= xstrdup(av[oi]);
766 cur->name= cur->fullname ;
767 if (lstat(av[oi], &cur->dstat)) { /* get file info into node */
768 errorMsg("%s: %s\n", av[oi], strerror(errno));
778 /* now that we know how many files there are
779 ** allocate memory for an array to hold dnode pointers
781 dnp= dnalloc(nfiles);
782 for (i=0, cur=dn; i<nfiles; i++) {
783 dnp[i]= cur; /* save pointer to node in array */
788 if (disp_opts & DISP_NOLIST) {
789 #ifdef BB_FEATURE_LS_SORTFILES
790 shellsort(dnp, nfiles);
792 if (nfiles > 0) showfiles(dnp, nfiles);
794 dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
795 dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
796 dndirs= countdirs(dnp, nfiles);
797 dnfiles= nfiles - dndirs;
799 #ifdef BB_FEATURE_LS_SORTFILES
800 shellsort(dnf, dnfiles);
802 showfiles(dnf, dnfiles);
805 #ifdef BB_FEATURE_LS_SORTFILES
806 shellsort(dnd, dndirs);
808 showdirs(dnd, dndirs);