3 * Copyright 2012 Andre Renaud <andre@bluewatersys.com>
4 * Copyright 2012 Rob Landley <rob@landley.net>
6 * See http://opengroup.org/onlinepubs/9699919799/utilities/ls.html
8 USE_LS(NEWTOY(ls, "goACFHLRSacdfiklmnpqrstux1[-1Cglmnox][-cu][-ftS][-HL]", TOYFLAG_BIN))
14 usage: ls [-ACFHLRSacdfiklmnpqrstux1] [directory...]
18 -a all files including .hidden -c use ctime for timestamps
19 -d directory, not contents -i inode number
20 -k block sizes in kilobytes -p put a '/' after dir names
21 -q unprintable chars as '?' -s size (in blocks)
22 -u use access time for timestamps -A list all files but . and ..
23 -H follow command line symlinks -L follow symlinks
24 -R recursively list files in subdirs -F append /dir *exe @sym |FIFO
27 -1 list one file per line -C columns (sorted vertically)
28 -g like -l but no owner -l long (show full details)
29 -m comma separated -n like -l but numeric uid/gid
30 -o like -l but no group -x columns (horizontal sort)
32 sorting (default is alphabetical):
33 -f unsorted -r reverse -t timestamp -S size
39 // test sst output (suid/sticky in ls flaglist)
41 // ls -lR starts .: then ./subdir:
44 struct dirtree *files;
46 unsigned screen_width;
49 // group and user can make overlapping use of the utoa() buf, so move it
53 void dlist_to_dirtree(struct dirtree *parent)
55 // Turn double_list into dirtree
56 struct dirtree *dt = parent->child;
58 dt->parent->next = NULL;
66 static char endtype(struct stat *st)
68 mode_t mode = st->st_mode;
69 if ((toys.optflags&(FLAG_F|FLAG_p)) && S_ISDIR(mode)) return '/';
70 if (toys.optflags & FLAG_F) {
71 if (S_ISLNK(mode)) return '@';
72 if (S_ISREG(mode) && (mode&0111)) return '*';
73 if (S_ISFIFO(mode)) return '|';
74 if (S_ISSOCK(mode)) return '=';
79 static char *getusername(uid_t uid)
81 struct passwd *pw = getpwuid(uid);
82 utoa_to_buf(uid, TT.uid_buf, 12);
83 return pw ? pw->pw_name : TT.uid_buf;
86 static char *getgroupname(gid_t gid)
88 struct group *gr = getgrgid(gid);
89 return gr ? gr->gr_name : utoa(gid);
92 // Figure out size of printable entry fields for display indent/wrap
94 static void entrylen(struct dirtree *dt, unsigned *len)
96 struct stat *st = &(dt->st);
97 unsigned flags = toys.optflags;
99 *len = strlen(dt->name);
100 if (endtype(st)) ++*len;
101 if (flags & FLAG_m) ++*len;
103 if (flags & FLAG_i) *len += (len[1] = numlen(st->st_ino));
104 if (flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) {
105 unsigned fn = flags & FLAG_n;
106 len[2] = numlen(st->st_nlink);
107 len[3] = strlen(fn ? utoa(st->st_uid) : getusername(st->st_uid));
108 len[4] = strlen(fn ? utoa(st->st_gid) : getgroupname(st->st_gid));
109 len[5] = numlen(st->st_size);
111 if (flags & FLAG_s) *len += (len[6] = numlen(st->st_blocks));
114 static int compare(void *a, void *b)
116 struct dirtree *dta = *(struct dirtree **)a;
117 struct dirtree *dtb = *(struct dirtree **)b;
118 int ret = 0, reverse = (toys.optflags & FLAG_r) ? -1 : 1;
120 if (toys.optflags & FLAG_S) {
121 if (dta->st.st_size > dtb->st.st_size) ret = -1;
122 else if (dta->st.st_size < dtb->st.st_size) ret = 1;
124 if (toys.optflags & FLAG_t) {
125 if (dta->st.st_mtime > dtb->st.st_mtime) ret = -1;
126 else if (dta->st.st_mtime < dtb->st.st_mtime) ret = 1;
128 if (!ret) ret = strcmp(dta->name, dtb->name);
129 return ret * reverse;
132 // callback from dirtree_recurse() determining how to handle this entry.
134 static int filter(struct dirtree *new)
136 int flags = toys.optflags;
138 // Special case to handle enormous dirs without running out of memory.
139 if (flags == (FLAG_1|FLAG_f)) {
140 xprintf("%s\n", new->name);
144 if (flags & FLAG_u) new->st.st_mtime = new->st.st_atime;
145 if (flags & FLAG_c) new->st.st_mtime = new->st.st_ctime;
146 if (flags & FLAG_k) new->st.st_blocks = (new->st.st_blocks + 1) / 2;
148 if (flags & (FLAG_a|FLAG_f)) return DIRTREE_SAVE;
149 if (!(flags & FLAG_A) && new->name[0]=='.') return 0;
151 return dirtree_notdotdot(new) & DIRTREE_SAVE;
154 // For column view, calculate horizontal position (for padding) and return
155 // index of next entry to display.
157 static unsigned long next_column(unsigned long ul, unsigned long dtlen,
158 unsigned columns, unsigned *xpos)
160 unsigned long transition;
161 unsigned height, widecols;
163 // Horizontal sort is easy
164 if (!(toys.optflags & FLAG_C)) {
165 *xpos = ul % columns;
171 // For -x, calculate height of display, rounded up
172 height = (dtlen+columns-1)/columns;
174 // Sanity check: does wrapping render this column count impossible
175 // due to the right edge wrapping eating a whole row?
176 if (height*columns - dtlen >= height) {
181 // Uneven rounding goes along right edge
182 widecols = dtlen % height;
183 if (!widecols) widecols = height;
184 transition = widecols * columns;
185 if (ul < transition) {
186 *xpos = ul % columns;
187 return (*xpos*height) + (ul/columns);
191 *xpos = ul % (columns-1);
193 return (*xpos*height) + widecols + (ul/(columns-1));
196 // Display a list of dirtree entries, according to current format
197 // Output types -1, -l, -C, or stream
199 static void listfiles(int dirfd, struct dirtree *indir)
201 struct dirtree *dt, **sort = 0;
202 unsigned long dtlen = 0, ul = 0;
203 unsigned width, flags = toys.optflags, totals[7], len[7],
204 *colsizes = (unsigned *)(toybuf+260), columns = (sizeof(toybuf)-260)/4;
206 memset(totals, 0, sizeof(totals));
208 // Silently descend into single directory listed by itself on command line.
209 // In this case only show dirname/total header when given -R.
210 if (!indir->parent) {
211 if (!(dt = indir->child)) return;
212 if (S_ISDIR(dt->st.st_mode) && !dt->next && !(flags & FLAG_d)) {
214 listfiles(open(dt->name, 0), dt);
218 // Read directory contents. We dup() the fd because this will close it.
219 indir->data = dup(dirfd);
220 dirtree_recurse(indir, filter, (flags&FLAG_L));
223 // Copy linked list to array and sort it. Directories go in array because
224 // we visit them in sorted order.
227 for (dt = indir->child; dt; dt = dt->next) {
228 if (sort) sort[dtlen] = dt;
232 sort = xmalloc(dtlen * sizeof(void *));
237 // Label directory if not top of tree, or if -R
238 if (indir->parent && (!indir->extra || (flags & FLAG_R)))
240 char *path = dirtree_path(indir, 0);
242 if (TT.nl_title++) xputc('\n');
243 xprintf("%s:\n", path);
247 if (!(flags & FLAG_f)) qsort(sort, dtlen, sizeof(void *), (void *)compare);
249 // Find largest entry in each field for display alignment
250 if (flags & (FLAG_C|FLAG_x)) {
252 // columns can't be more than toybuf can hold, or more than files,
253 // or > 1/2 screen width (one char filename, one space).
254 if (columns > TT.screen_width/2) columns = TT.screen_width/2;
255 if (columns > dtlen) columns = dtlen;
257 // Try to fit as many columns as we can, dropping down by one each time
258 for (;columns > 1; columns--) {
259 unsigned c, totlen = columns;
261 memset(colsizes, 0, columns*sizeof(unsigned));
262 for (ul=0; ul<dtlen; ul++) {
263 entrylen(sort[next_column(ul, dtlen, columns, &c)], len);
264 if (c == columns) break;
265 // Does this put us over budget?
266 if (*len > colsizes[c]) {
267 totlen += *len-colsizes[c];
269 if (totlen > TT.screen_width) break;
272 // If it fit, stop here
273 if (ul == dtlen) break;
275 } else if (flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g|FLAG_s)) {
276 unsigned long blocks = 0;
278 for (ul = 0; ul<dtlen; ul++)
280 entrylen(sort[ul], len);
281 for (width=0; width<6; width++)
282 if (len[width] > totals[width]) totals[width] = len[width];
283 blocks += sort[ul]->st.st_blocks;
286 if (indir->parent) xprintf("total %lu\n", blocks);
289 // Loop through again to produce output.
290 memset(toybuf, ' ', 256);
292 for (ul = 0; ul<dtlen; ul++) {
294 unsigned long next = next_column(ul, dtlen, columns, &curcol);
295 struct stat *st = &(sort[next]->st);
296 mode_t mode = st->st_mode;
297 char et = endtype(st);
299 // Skip directories at the top of the tree when -d isn't set
300 if (S_ISDIR(mode) && !indir->parent && !(flags & FLAG_d)) continue;
303 // Handle padding and wrapping for display purposes
304 entrylen(sort[next], len);
306 if (flags & FLAG_m) xputc(',');
307 if (flags & (FLAG_C|FLAG_x)) {
308 if (!curcol) xputc('\n');
309 } else if ((flags & FLAG_1) || width+1+*len > TT.screen_width) {
319 if (flags & FLAG_i) xprintf("% *lu ", len[1], (unsigned long)st->st_ino);
320 if (flags & FLAG_s) xprintf("% *lu ", len[6], (unsigned long)st->st_blocks);
322 if (flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) {
324 char perm[11], thyme[64], *usr, *upad, *grp, *grpad;
326 mode_to_string(mode, perm);
328 tm = localtime(&(st->st_mtime));
329 strftime(thyme, sizeof(thyme), "%F %H:%M", tm);
331 if (flags&FLAG_o) grp = grpad = toybuf+256;
333 grp = (flags&FLAG_n) ? utoa(st->st_gid) : getgroupname(st->st_gid);
334 grpad = toybuf+256-(totals[4]-len[4]);
337 if (flags&FLAG_g) usr = upad = toybuf+256;
339 upad = toybuf+255-(totals[3]-len[3]);
342 utoa_to_buf(st->st_uid, TT.uid_buf, 12);
343 } else usr = getusername(st->st_uid);
346 // Coerce the st types into something we know we can print.
347 xprintf("%s% *ld %s%s%s%s% *"PRId64" %s ", perm, totals[2]+1,
348 (long)st->st_nlink, usr, upad, grp, grpad, totals[5]+1,
349 (int64_t)st->st_size, thyme);
352 if (flags & FLAG_q) {
354 for (p=sort[next]->name; *p; p++) xputc(isprint(*p) ? *p : '?');
355 } else xprintf("%s", sort[next]->name);
356 if ((flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) && S_ISLNK(mode))
357 xprintf(" -> %s", sort[next]->symlink);
362 if (flags & (FLAG_C|FLAG_x)) {
363 curcol = colsizes[curcol] - *len;
364 if (curcol < 255) xprintf("%s", toybuf+255-curcol);
368 if (width) xputc('\n');
370 // Free directory entries, recursing first if necessary.
372 for (ul = 0; ul<dtlen; free(sort[ul++])) {
373 if ((flags & FLAG_d) || !S_ISDIR(sort[ul]->st.st_mode)
374 || !dirtree_notdotdot(sort[ul])) continue;
376 // Recurse into dirs if at top of the tree or given -R
377 if (!indir->parent || (flags & FLAG_R))
378 listfiles(openat(dirfd, sort[ul]->name, 0), sort[ul]);
381 if (dirfd != AT_FDCWD) close(indir->data);
386 char **s, *noargs[] = {".", 0};
389 // Do we have an implied -1
390 if (!isatty(1) || (toys.optflags&(FLAG_l|FLAG_o|FLAG_n|FLAG_g)))
391 toys.optflags |= FLAG_1;
393 TT.screen_width = 80;
394 terminal_size(&TT.screen_width, NULL);
395 if (TT.screen_width<2) TT.screen_width = 2;
396 if (!(toys.optflags&(FLAG_1|FLAG_x|FLAG_m))) toys.optflags |= FLAG_C;
398 // The optflags parsing infrastructure should really do this for us,
399 // but currently it has "switch off when this is set", so "-dR" and "-Rd"
400 // behave differently
401 if (toys.optflags & FLAG_d) toys.optflags &= ~FLAG_R;
403 // Iterate through command line arguments, collecting directories and files.
404 // Non-absolute paths are relative to current directory.
405 TT.files = dirtree_add_node(0, 0, 0);
406 for (s = *toys.optargs ? toys.optargs : noargs; *s; s++) {
407 dt = dirtree_add_node(0, *s,
408 (toys.optflags & (FLAG_L|FLAG_H|FLAG_l))^FLAG_l);
415 // Typecast means double_list->prev temporarirly goes in dirtree->parent
416 dlist_add_nomalloc((void *)&TT.files->child, (struct double_list *)dt);
419 // Turn double_list into dirtree
420 dlist_to_dirtree(TT.files);
422 // Display the files we collected
423 listfiles(AT_FDCWD, TT.files);
425 if (CFG_TOYBOX_FREE) free(TT.files);