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?
45 TERMINAL_WIDTH = 80, /* use 79 if terminal has linefold bug */
46 COLUMN_WIDTH = 14, /* default if AUTOWIDTH not defined */
47 COLUMN_GAP = 2, /* includes the file type char */
51 /************************************************************************/
53 #include <sys/types.h>
64 #include <sys/ioctl.h>
67 #ifdef BB_FEATURE_LS_TIMESTAMPS
72 #define MAJOR(dev) (((dev)>>8)&0xff)
73 #define MINOR(dev) ((dev)&0xff)
76 /* what is the overall style of the listing */
79 STYLE_LONG = 1, /* one record per line, extended info */
80 STYLE_SINGLE = 2, /* one record per line */
81 STYLE_COLUMNS = 3 /* fill columns */
84 /* 51306 lrwxrwxrwx 1 root root 2 May 11 01:43 /bin/view -> vi* */
85 /* what file information will be listed */
86 #define LIST_INO (1<<0)
87 #define LIST_BLOCKS (1<<1)
88 #define LIST_MODEBITS (1<<2)
89 #define LIST_NLINKS (1<<3)
90 #define LIST_ID_NAME (1<<4)
91 #define LIST_ID_NUMERIC (1<<5)
92 #define LIST_SIZE (1<<6)
93 #define LIST_DEV (1<<7)
94 #define LIST_DATE_TIME (1<<8)
95 #define LIST_FULLTIME (1<<9)
96 #define LIST_FILENAME (1<<10)
97 #define LIST_SYMLINK (1<<11)
98 #define LIST_FILETYPE (1<<12)
99 #define LIST_EXEC (1<<13)
101 /* what files will be displayed */
102 #define DISP_NORMAL (0) /* show normal filenames */
103 #define DISP_DIRNAME (1<<0) /* 2 or more items? label directories */
104 #define DISP_HIDDEN (1<<1) /* show filenames starting with . */
105 #define DISP_DOT (1<<2) /* show . and .. */
106 #define DISP_NOLIST (1<<3) /* show directory as itself, not contents */
107 #define DISP_RECURSIVE (1<<4) /* show directory and everything below it */
108 #define DISP_ROWS (1<<5) /* print across rows */
110 #ifdef BB_FEATURE_LS_SORTFILES
111 /* how will the files be sorted */
112 static const int SORT_FORWARD = 0; /* sort in reverse order */
113 static const int SORT_REVERSE = 1; /* sort in reverse order */
114 static const int SORT_NAME = 2; /* sort by file name */
115 static const int SORT_SIZE = 3; /* sort by file size */
116 static const int SORT_ATIME = 4; /* sort by last access time */
117 static const int SORT_CTIME = 5; /* sort by last change time */
118 static const int SORT_MTIME = 6; /* sort by last modification time */
119 static const int SORT_VERSION = 7; /* sort by version */
120 static const int SORT_EXT = 8; /* sort by file name extension */
121 static const int SORT_DIR = 9; /* sort by file or directory */
124 #ifdef BB_FEATURE_LS_TIMESTAMPS
125 /* which of the three times will be used */
126 static const int TIME_MOD = 0;
127 static const int TIME_CHANGE = 1;
128 static const int TIME_ACCESS = 2;
131 #define LIST_SHORT (LIST_FILENAME)
132 #define LIST_ISHORT (LIST_INO | LIST_FILENAME)
133 #define LIST_LONG (LIST_MODEBITS | LIST_NLINKS | LIST_ID_NAME | \
134 LIST_SIZE | LIST_DATE_TIME | LIST_FILENAME | \
136 #define LIST_ILONG (LIST_INO | LIST_LONG)
138 static const int SPLIT_DIR = 0;
139 static const int SPLIT_FILE = 1;
140 static const int SPLIT_SUBDIR = 2;
142 #define TYPEINDEX(mode) (((mode) >> 12) & 0x0f)
143 #define TYPECHAR(mode) ("0pcCd?bB-?l?s???" [TYPEINDEX(mode)])
144 #ifdef BB_FEATURE_LS_FILETYPES
145 #define APPCHAR(mode) ("\0|\0\0/\0\0\0\0\0@\0=\0\0\0" [TYPEINDEX(mode)])
149 * a directory entry and its stat info are stored here
151 struct dnode { /* the basic node */
152 char *name; /* the dir entry name */
153 char *fullname; /* the dir entry name */
154 struct stat dstat; /* the file stat info */
155 struct dnode *next; /* point at the next node */
157 typedef struct dnode dnode_t;
159 static struct dnode **list_dir(char *);
160 static struct dnode **dnalloc(int);
161 static int list_single(struct dnode *);
163 static unsigned int disp_opts;
164 static unsigned int style_fmt;
165 static unsigned int list_fmt;
166 #ifdef BB_FEATURE_LS_SORTFILES
167 static unsigned int sort_opts;
168 static unsigned int sort_order;
170 #ifdef BB_FEATURE_LS_TIMESTAMPS
171 static unsigned int time_fmt;
173 #ifdef BB_FEATURE_LS_FOLLOWLINKS
174 static unsigned int follow_links=FALSE;
177 static unsigned short column = 0;
178 #ifdef BB_FEATURE_AUTOWIDTH
179 static unsigned short terminal_width = TERMINAL_WIDTH;
180 static unsigned short column_width = COLUMN_WIDTH;
181 static unsigned short tabstops = COLUMN_GAP;
183 static unsigned short column_width = COLUMN_WIDTH;
186 static int status = EXIT_SUCCESS;
188 #ifdef BB_FEATURE_HUMAN_READABLE
189 static unsigned long ls_disp_hr = 0;
192 static int my_stat(struct dnode *cur)
194 #ifdef BB_FEATURE_LS_FOLLOWLINKS
195 if (follow_links == TRUE) {
196 if (stat(cur->fullname, &cur->dstat)) {
197 perror_msg("%s", cur->fullname);
198 status = EXIT_FAILURE;
205 if (lstat(cur->fullname, &cur->dstat)) {
206 perror_msg("%s", cur->fullname);
207 status = EXIT_FAILURE;
215 static void newline(void)
223 /*----------------------------------------------------------------------*/
224 #ifdef BB_FEATURE_LS_FILETYPES
225 static char append_char(mode_t mode)
227 if ( !(list_fmt & LIST_FILETYPE))
229 if ((list_fmt & LIST_EXEC) && S_ISREG(mode)
230 && (mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return '*';
231 return APPCHAR(mode);
235 /*----------------------------------------------------------------------*/
236 static void nexttabstop( void )
238 static short nexttab= 0;
249 nexttab= column + column_width + COLUMN_GAP;
252 /*----------------------------------------------------------------------*/
253 static int is_subdir(struct dnode *dn)
255 return (S_ISDIR(dn->dstat.st_mode) && strcmp(dn->name, ".") != 0 &&
256 strcmp(dn->name, "..") != 0);
259 static int countdirs(struct dnode **dn, int nfiles)
263 if (dn==NULL || nfiles < 1) return(0);
265 for (i=0; i<nfiles; i++) {
266 if (S_ISDIR(dn[i]->dstat.st_mode)) dirs++;
271 static int countsubdirs(struct dnode **dn, int nfiles)
275 if (dn == NULL || nfiles < 1) return 0;
277 for (i = 0; i < nfiles; i++)
278 if (is_subdir(dn[i]))
283 static int countfiles(struct dnode **dnp)
288 if (dnp == NULL) return(0);
290 for (cur= dnp[0]; cur->next != NULL ; cur= cur->next) nfiles++;
295 /* get memory to hold an array of pointers */
296 static struct dnode **dnalloc(int num)
300 if (num < 1) return(NULL);
302 p= (struct dnode **)xcalloc((size_t)num, (size_t)(sizeof(struct dnode *)));
306 #ifdef BB_FEATURE_LS_RECURSIVE
307 static void dfree(struct dnode **dnp)
309 struct dnode *cur, *next;
311 if(dnp == NULL) return;
314 while (cur != NULL) {
315 if (cur->fullname != NULL) free(cur->fullname); /* free the filename */
317 free(cur); /* free the dnode */
320 free(dnp); /* free the array holding the dnode pointers */
324 static struct dnode **splitdnarray(struct dnode **dn, int nfiles, int which)
329 if (dn==NULL || nfiles < 1) return(NULL);
331 /* count how many dirs and regular files there are */
332 if (which == SPLIT_SUBDIR)
333 dncnt = countsubdirs(dn, nfiles);
335 dncnt= countdirs(dn, nfiles); /* assume we are looking for dirs */
336 if (which == SPLIT_FILE)
337 dncnt= nfiles - dncnt; /* looking for files */
340 /* allocate a file array and a dir array */
343 /* copy the entrys into the file or dir array */
344 for (d= i=0; i<nfiles; i++) {
345 if (which == SPLIT_DIR) {
346 if (S_ISDIR(dn[i]->dstat.st_mode)) {
348 } /* else skip the file */
349 } else if (which == SPLIT_SUBDIR) {
350 if (is_subdir(dn[i])) {
352 } /* else skip the file or dir */
354 if (!(S_ISDIR(dn[i]->dstat.st_mode))) {
356 } /* else skip the dir */
362 /*----------------------------------------------------------------------*/
363 #ifdef BB_FEATURE_LS_SORTFILES
364 static int sortcmp(struct dnode *d1, struct dnode *d2)
369 if (sort_opts == SORT_SIZE) {
370 dif= (int)(d1->dstat.st_size - d2->dstat.st_size);
371 } else if (sort_opts == SORT_ATIME) {
372 dif= (int)(d1->dstat.st_atime - d2->dstat.st_atime);
373 } else if (sort_opts == SORT_CTIME) {
374 dif= (int)(d1->dstat.st_ctime - d2->dstat.st_ctime);
375 } else if (sort_opts == SORT_MTIME) {
376 dif= (int)(d1->dstat.st_mtime - d2->dstat.st_mtime);
377 } else if (sort_opts == SORT_DIR) {
378 dif= S_ISDIR(d1->dstat.st_mode) - S_ISDIR(d2->dstat.st_mode);
379 /* } else if (sort_opts == SORT_VERSION) { */
380 /* } else if (sort_opts == SORT_EXT) { */
381 } else { /* assume SORT_NAME */
385 if (dif > 0) cmp= -1;
388 /* sort by name- may be a tie_breaker for time or size cmp */
389 dif= strcmp(d1->name, d2->name);
391 if (dif < 0) cmp= -1;
394 if (sort_order == SORT_REVERSE) {
400 /*----------------------------------------------------------------------*/
401 static void shellsort(struct dnode **dn, int size)
406 /* shell short the array */
407 if(dn==NULL || size < 2) return;
409 for (gap= size/2; gap>0; gap /=2) {
410 for (i=gap; i<size; i++) {
411 for (j= i-gap; j>=0; j-=gap) {
412 if (sortcmp(dn[j], dn[j+gap]) <= 0)
414 /* they are out of order, swap them */
424 /*----------------------------------------------------------------------*/
425 static void showfiles(struct dnode **dn, int nfiles)
427 int i, ncols, nrows, row, nc;
428 #ifdef BB_FEATURE_AUTOWIDTH
432 if(dn==NULL || nfiles < 1) return;
434 #ifdef BB_FEATURE_AUTOWIDTH
435 /* find the longest file name- use that as the column width */
437 for (i=0; i<nfiles; i++) {
438 len= strlen(dn[i]->name) +
439 ((list_fmt & LIST_INO) ? 8 : 0) +
440 ((list_fmt & LIST_BLOCKS) ? 5 : 0)
442 if (column_width < len)
445 if (column_width >= 6)
446 ncols = (int)(terminal_width / (column_width + COLUMN_GAP));
449 column_width = COLUMN_WIDTH;
452 ncols= TERMINAL_WIDTH;
455 case STYLE_LONG: /* one record per line, extended info */
456 case STYLE_SINGLE: /* one record per line */
462 nrows = nfiles / ncols;
467 if ((nrows * ncols) < nfiles) nrows++; /* round up fractionals */
469 if (nrows > nfiles) nrows= nfiles;
470 for (row=0; row<nrows; row++) {
471 for (nc=0; nc<ncols; nc++) {
472 /* reach into the array based on the column and row */
473 i= (nc * nrows) + row; /* assume display by column */
474 if (disp_opts & DISP_ROWS)
475 i= (row * ncols) + nc; /* display across row */
485 /*----------------------------------------------------------------------*/
486 static void showdirs(struct dnode **dn, int ndirs)
489 struct dnode **subdnp;
490 #ifdef BB_FEATURE_LS_RECURSIVE
495 if (dn==NULL || ndirs < 1) return;
497 for (i=0; i<ndirs; i++) {
498 if (disp_opts & (DISP_DIRNAME | DISP_RECURSIVE)) {
499 printf("\n%s:\n", dn[i]->fullname);
501 subdnp= list_dir(dn[i]->fullname);
502 nfiles= countfiles(subdnp);
504 /* list all files at this level */
505 #ifdef BB_FEATURE_LS_SORTFILES
506 shellsort(subdnp, nfiles);
508 showfiles(subdnp, nfiles);
509 #ifdef BB_FEATURE_LS_RECURSIVE
510 if (disp_opts & DISP_RECURSIVE) {
511 /* recursive- list the sub-dirs */
512 dnd= splitdnarray(subdnp, nfiles, SPLIT_SUBDIR);
513 dndirs= countsubdirs(subdnp, nfiles);
515 #ifdef BB_FEATURE_LS_SORTFILES
516 shellsort(dnd, dndirs);
518 showdirs(dnd, dndirs);
519 free(dnd); /* free the array of dnode pointers to the dirs */
522 dfree(subdnp); /* free the dnodes and the fullname mem */
528 /*----------------------------------------------------------------------*/
529 static struct dnode **list_dir(char *path)
531 struct dnode *dn, *cur, **dnp;
532 struct dirent *entry;
536 if (path==NULL) return(NULL);
542 perror_msg("%s", path);
543 status = EXIT_FAILURE;
544 return(NULL); /* could not open the dir */
546 while ((entry = readdir(dir)) != NULL) {
547 /* are we going to list the file- it may be . or .. or a hidden file */
548 if ((strcmp(entry->d_name, ".")==0) && !(disp_opts & DISP_DOT))
550 if ((strcmp(entry->d_name, "..")==0) && !(disp_opts & DISP_DOT))
552 if ((entry->d_name[0] == '.') && !(disp_opts & DISP_HIDDEN))
554 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
555 cur->fullname = concat_path_file(path, entry->d_name);
556 cur->name = cur->fullname +
557 (strlen(cur->fullname) - strlen(entry->d_name));
566 /* now that we know how many files there are
567 ** allocate memory for an array to hold dnode pointers
569 if (nfiles < 1) return(NULL);
570 dnp= dnalloc(nfiles);
571 for (i=0, cur=dn; i<nfiles; i++) {
572 dnp[i]= cur; /* save pointer to node in array */
579 /*----------------------------------------------------------------------*/
580 static int list_single(struct dnode *dn)
583 char scratch[BUFSIZ + 1];
584 #ifdef BB_FEATURE_LS_TIMESTAMPS
588 #if defined (BB_FEATURE_LS_FILETYPES)
591 #ifdef BB_FEATURE_LS_FILETYPES
595 if (dn==NULL || dn->fullname==NULL) return(0);
597 #ifdef BB_FEATURE_LS_TIMESTAMPS
598 ttime= dn->dstat.st_mtime; /* the default time */
599 if (time_fmt & TIME_ACCESS) ttime= dn->dstat.st_atime;
600 if (time_fmt & TIME_CHANGE) ttime= dn->dstat.st_ctime;
601 filetime= ctime(&ttime);
603 #ifdef BB_FEATURE_LS_FILETYPES
604 append = append_char(dn->dstat.st_mode);
607 for (i=0; i<=31; i++) {
608 switch (list_fmt & (1<<i)) {
610 printf("%7ld ", (long int)dn->dstat.st_ino);
614 #ifdef BB_FEATURE_HUMAN_READABLE
615 fprintf(stdout, "%6s ", make_human_readable_str(dn->dstat.st_blocks>>1,
616 KILOBYTE, (ls_disp_hr==TRUE)? 0: KILOBYTE));
618 #if _FILE_OFFSET_BITS == 64
619 printf("%4lld ", dn->dstat.st_blocks>>1);
621 printf("%4ld ", dn->dstat.st_blocks>>1);
627 printf("%-10s ", (char *)mode_string(dn->dstat.st_mode));
631 printf("%4ld ", (long)dn->dstat.st_nlink);
635 #ifdef BB_FEATURE_LS_USERNAME
636 my_getpwuid(scratch, dn->dstat.st_uid);
637 printf("%-8.8s ", scratch);
638 my_getgrgid(scratch, dn->dstat.st_gid);
639 printf("%-8.8s ", scratch);
643 case LIST_ID_NUMERIC:
644 printf("%-8d %-8d", dn->dstat.st_uid, dn->dstat.st_gid);
649 if (S_ISBLK(dn->dstat.st_mode) || S_ISCHR(dn->dstat.st_mode)) {
650 printf("%4d, %3d ", (int)MAJOR(dn->dstat.st_rdev), (int)MINOR(dn->dstat.st_rdev));
652 #ifdef BB_FEATURE_HUMAN_READABLE
653 if (ls_disp_hr==TRUE) {
654 fprintf(stdout, "%8s ", make_human_readable_str(dn->dstat.st_size, 1, 0));
658 #if _FILE_OFFSET_BITS == 64
659 printf("%9lld ", (long long)dn->dstat.st_size);
661 printf("%9ld ", dn->dstat.st_size);
667 #ifdef BB_FEATURE_LS_TIMESTAMPS
670 if (list_fmt & LIST_FULLTIME) {
671 printf("%24.24s ", filetime);
675 age = time(NULL) - ttime;
676 printf("%6.6s ", filetime+4);
677 if (age < 3600L * 24 * 365 / 2 && age > -15 * 60) {
678 /* hh:mm if less than 6 months old */
679 printf("%5.5s ", filetime+11);
681 printf(" %4.4s ", filetime+20);
687 printf("%s", dn->name);
688 column += strlen(dn->name);
691 if (S_ISLNK(dn->dstat.st_mode)) {
692 char *lpath = xreadlink(dn->fullname);
694 printf(" -> %s", lpath);
695 #ifdef BB_FEATURE_LS_FILETYPES
696 if (!stat(dn->fullname, &info)) {
697 append = append_char(info.st_mode);
700 column += strlen(lpath) + 4;
705 #ifdef BB_FEATURE_LS_FILETYPES
707 if (append != '\0') {
708 printf("%1c", append);
719 /*----------------------------------------------------------------------*/
720 extern int ls_main(int argc, char **argv)
722 struct dnode **dnf, **dnd;
724 struct dnode *dn, *cur, **dnp;
729 #ifdef BB_FEATURE_AUTOWIDTH
730 struct winsize win = { 0, 0, 0, 0 };
733 disp_opts= DISP_NORMAL;
734 style_fmt= STYLE_AUTO;
735 list_fmt= LIST_SHORT;
736 #ifdef BB_FEATURE_LS_SORTFILES
737 sort_opts= SORT_NAME;
738 sort_order= SORT_FORWARD;
740 #ifdef BB_FEATURE_LS_TIMESTAMPS
743 #ifdef BB_FEATURE_AUTOWIDTH
744 ioctl(fileno(stdout), TIOCGWINSZ, &win);
746 column_width = win.ws_row - 2;
748 terminal_width = win.ws_col - 1;
752 /* process options */
753 while ((opt = getopt(argc, argv, "1AaCdgilnsx"
754 #ifdef BB_FEATURE_AUTOWIDTH
757 #ifdef BB_FEATURE_LS_FILETYPES
760 #ifdef BB_FEATURE_LS_RECURSIVE
763 #ifdef BB_FEATURE_LS_SORTFILES
766 #ifdef BB_FEATURE_LS_TIMESTAMPS
769 #ifdef BB_FEATURE_LS_FOLLOWLINKS
772 #ifdef BB_FEATURE_HUMAN_READABLE
777 case '1': style_fmt = STYLE_SINGLE; break;
778 case 'A': disp_opts |= DISP_HIDDEN; break;
779 case 'a': disp_opts |= DISP_HIDDEN | DISP_DOT; break;
780 case 'C': style_fmt = STYLE_COLUMNS; break;
781 case 'd': disp_opts |= DISP_NOLIST; break;
782 case 'g': /* ignore -- for ftp servers */ break;
783 case 'i': list_fmt |= LIST_INO; break;
785 style_fmt = STYLE_LONG;
786 list_fmt |= LIST_LONG;
787 #ifdef BB_FEATURE_HUMAN_READABLE
791 case 'n': list_fmt |= LIST_ID_NUMERIC; break;
792 case 's': list_fmt |= LIST_BLOCKS; break;
793 case 'x': disp_opts = DISP_ROWS; break;
794 #ifdef BB_FEATURE_LS_FILETYPES
795 case 'F': list_fmt |= LIST_FILETYPE | LIST_EXEC; break;
796 case 'p': list_fmt |= LIST_FILETYPE; break;
798 #ifdef BB_FEATURE_LS_RECURSIVE
799 case 'R': disp_opts |= DISP_RECURSIVE; break;
801 #ifdef BB_FEATURE_LS_SORTFILES
802 case 'r': sort_order |= SORT_REVERSE; break;
803 case 'S': sort_opts= SORT_SIZE; break;
804 case 'v': sort_opts= SORT_VERSION; break;
805 case 'X': sort_opts= SORT_EXT; break;
807 #ifdef BB_FEATURE_LS_TIMESTAMPS
808 case 'e': list_fmt |= LIST_FULLTIME; break;
810 time_fmt = TIME_CHANGE;
811 #ifdef BB_FEATURE_LS_SORTFILES
812 sort_opts= SORT_CTIME;
816 time_fmt = TIME_ACCESS;
817 #ifdef BB_FEATURE_LS_SORTFILES
818 sort_opts= SORT_ATIME;
822 #ifdef BB_FEATURE_LS_SORTFILES
823 sort_opts= SORT_MTIME;
827 #ifdef BB_FEATURE_LS_FOLLOWLINKS
828 case 'L': follow_links= TRUE; break;
830 #ifdef BB_FEATURE_AUTOWIDTH
831 case 'T': tabstops= atoi(optarg); break;
832 case 'w': terminal_width= atoi(optarg); break;
834 #ifdef BB_FEATURE_HUMAN_READABLE
835 case 'h': ls_disp_hr = TRUE; break;
839 goto print_usage_message;
843 /* sort out which command line options take precedence */
844 #ifdef BB_FEATURE_LS_RECURSIVE
845 if (disp_opts & DISP_NOLIST)
846 disp_opts &= ~DISP_RECURSIVE; /* no recurse if listing only dir */
848 #if defined (BB_FEATURE_LS_TIMESTAMPS) && defined (BB_FEATURE_LS_SORTFILES)
849 if (time_fmt & TIME_CHANGE) sort_opts= SORT_CTIME;
850 if (time_fmt & TIME_ACCESS) sort_opts= SORT_ATIME;
852 if (style_fmt != STYLE_LONG)
853 list_fmt &= ~LIST_ID_NUMERIC; /* numeric uid only for long list */
854 #ifdef BB_FEATURE_LS_USERNAME
855 if (style_fmt == STYLE_LONG && (list_fmt & LIST_ID_NUMERIC))
856 list_fmt &= ~LIST_ID_NAME; /* don't list names if numeric uid */
859 /* choose a display format */
860 if (style_fmt == STYLE_AUTO)
861 style_fmt = isatty(fileno(stdout)) ? STYLE_COLUMNS : STYLE_SINGLE;
864 * when there are no cmd line args we have to supply a default "." arg.
865 * we will create a second argv array, "av" that will hold either
866 * our created "." arg, or the real cmd line args. The av array
867 * just holds the pointers- we don't move the date the pointers
870 ac= argc - optind; /* how many cmd line args are left */
872 av= (char **)xcalloc((size_t)1, (size_t)(sizeof(char *)));
876 av= (char **)xcalloc((size_t)ac, (size_t)(sizeof(char *)));
877 for (oi=0 ; oi < ac; oi++) {
878 av[oi]= argv[optind++]; /* copy pointer to real cmd line arg */
882 /* now, everything is in the av array */
884 disp_opts |= DISP_DIRNAME; /* 2 or more items? label directories */
886 /* stuff the command line file names into an dnode array */
888 for (oi=0 ; oi < ac; oi++) {
889 cur= (struct dnode *)xmalloc(sizeof(struct dnode));
890 cur->fullname= xstrdup(av[oi]);
891 cur->name= cur->fullname;
899 /* now that we know how many files there are
900 ** allocate memory for an array to hold dnode pointers
902 dnp= dnalloc(nfiles);
903 for (i=0, cur=dn; i<nfiles; i++) {
904 dnp[i]= cur; /* save pointer to node in array */
909 if (disp_opts & DISP_NOLIST) {
910 #ifdef BB_FEATURE_LS_SORTFILES
911 shellsort(dnp, nfiles);
913 if (nfiles > 0) showfiles(dnp, nfiles);
915 dnd= splitdnarray(dnp, nfiles, SPLIT_DIR);
916 dnf= splitdnarray(dnp, nfiles, SPLIT_FILE);
917 dndirs= countdirs(dnp, nfiles);
918 dnfiles= nfiles - dndirs;
920 #ifdef BB_FEATURE_LS_SORTFILES
921 shellsort(dnf, dnfiles);
923 showfiles(dnf, dnfiles);
926 #ifdef BB_FEATURE_LS_SORTFILES
927 shellsort(dnd, dndirs);
929 showdirs(dnd, dndirs);