1/* ls.c - list files 2 * 3 * Copyright 2012 Andre Renaud <andre@bluewatersys.com> 4 * Copyright 2012 Rob Landley <rob@landley.net> 5 * 6 * See http://opengroup.org/onlinepubs/9699919799/utilities/ls.html 7 * 8 * Deviations from posix: 9 * add -b (and default to it instead of -q for an unambiguous representation 10 * that doesn't cause collisions) 11 * add -Z -ll --color 12 * Posix says the -l date format should vary based on how recent it is 13 * and we do --time-style=long-iso instead 14 15USE_LS(NEWTOY(ls, "(color):;(full-time)(show-control-chars)ZgoACFHLRSabcdfhikl@mnpqrstux1[-Cxm1][-Cxml][-Cxmo][-Cxmg][-cu][-ftS][-HL][!qb]", TOYFLAG_BIN|TOYFLAG_LOCALE)) 16 17config LS 18 bool "ls" 19 default y 20 help 21 usage: ls [-ACFHLRSZacdfhiklmnpqrstux1] [--color[=auto]] [directory...] 22 23 List files. 24 25 what to show: 26 -a all files including .hidden -b escape nongraphic chars 27 -c use ctime for timestamps -d directory, not contents 28 -i inode number -p put a '/' after dir names 29 -q unprintable chars as '?' -s storage used (1024 byte units) 30 -u use access time for timestamps -A list all files but . and .. 31 -H follow command line symlinks -L follow symlinks 32 -R recursively list in subdirs -F append /dir *exe @sym |FIFO 33 -Z security context 34 35 output formats: 36 -1 list one file per line -C columns (sorted vertically) 37 -g like -l but no owner -h human readable sizes 38 -l long (show full details) -m comma separated 39 -n like -l but numeric uid/gid -o like -l but no group 40 -x columns (horizontal sort) -ll long with nanoseconds (--full-time) 41 --color device=yellow symlink=turquoise/red dir=blue socket=purple 42 files: exe=green suid=red suidfile=redback stickydir=greenback 43 =auto means detect if output is a tty. 44 45 sorting (default is alphabetical): 46 -f unsorted -r reverse -t timestamp -S size 47*/ 48 49#define FOR_ls 50#include "toys.h" 51 52// test sst output (suid/sticky in ls flaglist) 53 54// ls -lR starts .: then ./subdir: 55 56GLOBALS( 57 long l; 58 char *color; 59 60 struct dirtree *files, *singledir; 61 unsigned screen_width; 62 int nl_title; 63 char *escmore; 64) 65 66// Callback from crunch_str to represent unprintable chars 67static int crunch_qb(FILE *out, int cols, int wc) 68{ 69 int len = 1; 70 char buf[32]; 71 72 if (FLAG(q)) *buf = '?'; 73 else { 74 if (wc<256) *buf = wc; 75 // scrute the inscrutable, eff the ineffable, print the unprintable 76 else if ((len = wcrtomb(buf, wc, 0) ) == -1) len = 1; 77 if (FLAG(b)) { 78 char *to = buf, *from = buf+24; 79 int i, j; 80 81 memcpy(from, to, 8); 82 for (i = 0; i<len; i++) { 83 *to++ = '\\'; 84 if (strchr(TT.escmore, from[i])) *to++ = from[i]; 85 else if (-1 != (j = stridx("\\\a\b\033\f\n\r\t\v", from[i]))) 86 *to++ = "\\abefnrtv"[j]; 87 else to += sprintf(to, "%03o", from[i]); 88 } 89 len = to-buf; 90 } 91 } 92 93 if (cols<len) len = cols; 94 if (out) fwrite(buf, len, 1, out); 95 96 return len; 97} 98 99// Returns wcwidth(utf8) version of strlen with -qb escapes 100static int strwidth(char *s) 101{ 102 return crunch_str(&s, INT_MAX, 0, TT.escmore, crunch_qb); 103} 104 105static char endtype(struct stat *st) 106{ 107 mode_t mode = st->st_mode; 108 if ((FLAG(F)||FLAG(p)) && S_ISDIR(mode)) return '/'; 109 if (FLAG(F)) { 110 if (S_ISLNK(mode)) return '@'; 111 if (S_ISREG(mode) && (mode&0111)) return '*'; 112 if (S_ISFIFO(mode)) return '|'; 113 if (S_ISSOCK(mode)) return '='; 114 } 115 return 0; 116} 117 118static int numlen(long long ll) 119{ 120 return snprintf(0, 0, "%llu", ll); 121} 122 123static int print_with_h(char *s, long long value, int units) 124{ 125 if (FLAG(h)) return human_readable(s, value*units, 0); 126 else return sprintf(s, "%lld", value); 127} 128 129// Figure out size of printable entry fields for display indent/wrap 130 131static void entrylen(struct dirtree *dt, unsigned *len) 132{ 133 struct stat *st = &(dt->st); 134 unsigned flags = toys.optflags; 135 char tmp[64]; 136 137 *len = strwidth(dt->name); 138 if (endtype(st)) ++*len; 139 if (flags & FLAG_m) ++*len; 140 141 len[1] = (flags & FLAG_i) ? numlen(st->st_ino) : 0; 142 if (flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) { 143 unsigned fn = flags & FLAG_n; 144 145 len[2] = numlen(st->st_nlink); 146 len[3] = fn ? numlen(st->st_uid) : strwidth(getusername(st->st_uid)); 147 len[4] = fn ? numlen(st->st_gid) : strwidth(getgroupname(st->st_gid)); 148 if (S_ISBLK(st->st_mode) || S_ISCHR(st->st_mode)) { 149 // cheating slightly here: assuming minor is always 3 digits to avoid 150 // tracking another column 151 len[5] = numlen(dev_major(st->st_rdev))+5; 152 } else len[5] = print_with_h(tmp, st->st_size, 1); 153 } 154 155 len[6] = (flags & FLAG_s) ? print_with_h(tmp, st->st_blocks, 512) : 0; 156 len[7] = (flags & FLAG_Z) ? strwidth((char *)dt->extra) : 0; 157} 158 159static int compare(void *a, void *b) 160{ 161 struct dirtree *dta = *(struct dirtree **)a; 162 struct dirtree *dtb = *(struct dirtree **)b; 163 int ret = 0, reverse = FLAG(r) ? -1 : 1; 164 165 if (FLAG(S)) { 166 if (dta->st.st_size > dtb->st.st_size) ret = -1; 167 else if (dta->st.st_size < dtb->st.st_size) ret = 1; 168 } 169 if (FLAG(t)) { 170 if (dta->st.st_mtime > dtb->st.st_mtime) ret = -1; 171 else if (dta->st.st_mtime < dtb->st.st_mtime) ret = 1; 172 else if (dta->st.st_mtim.tv_nsec > dtb->st.st_mtim.tv_nsec) ret = -1; 173 else if (dta->st.st_mtim.tv_nsec < dtb->st.st_mtim.tv_nsec) ret = 1; 174 } 175 if (!ret) ret = strcmp(dta->name, dtb->name); 176 return ret * reverse; 177} 178 179// callback from dirtree_recurse() determining how to handle this entry. 180 181static int filter(struct dirtree *new) 182{ 183 int flags = toys.optflags; 184 185 // Special case to handle enormous dirs without running out of memory. 186 if (flags == (FLAG_1|FLAG_f)) { 187 xprintf("%s\n", new->name); 188 return 0; 189 } 190 191 if (flags & FLAG_Z) { 192 if (!CFG_TOYBOX_LSM_NONE) { 193#ifdef CUSTOM_GET_CONTEXT 194 const char * const path = dirtree_path(new, 0); 195 196 if (path) { 197 (FLAG(L) ? lsm_get_context : lsm_lget_context)(path, (char **)&new->extra); 198 } 199#else 200 // (Wouldn't it be nice if the lsm functions worked like openat(), 201 // fchmodat(), mknodat(), readlinkat() so we could do this without 202 // even O_PATH? But no, this is 1990's tech.) 203 int fd = openat(dirtree_parentfd(new), new->name, 204 O_PATH|(O_NOFOLLOW*!FLAG(L))); 205 206 if (fd != -1) { 207 if (-1 == lsm_fget_context(fd, (char **)&new->extra) && errno == EBADF) 208 { 209 char hack[32]; 210 211 // Work around kernel bug that won't let us read this "metadata" from 212 // the filehandle unless we have permission to read the data. (We can 213 // query the same data in by path, but can't do it through an O_PATH 214 // filehandle, because reasons. But for some reason, THIS is ok? If 215 // they ever fix the kernel, this should stop triggering.) 216 217 sprintf(hack, "/proc/self/fd/%d", fd); 218 lsm_lget_context(hack, (char **)&new->extra); 219 } 220 close(fd); 221 } 222#endif 223 } 224 if (CFG_TOYBOX_LSM_NONE || !new->extra) new->extra = (long)xstrdup("?"); 225 } 226 227 if (flags & FLAG_u) new->st.st_mtime = new->st.st_atime; 228 if (flags & FLAG_c) new->st.st_mtime = new->st.st_ctime; 229 // In Linux, the st_block unit of the stat structure is 512B, so we use 512B 230 // rather than 1KiB as blocks unit, which is different from the implementation 231 // logic of the Toybox community. 232 233 if (flags & (FLAG_a|FLAG_f)) return DIRTREE_SAVE; 234 if (!(flags & FLAG_A) && new->name[0]=='.') return 0; 235 236 return dirtree_notdotdot(new) & DIRTREE_SAVE; 237} 238 239// For column view, calculate horizontal position (for padding) and return 240// index of next entry to display. 241 242static unsigned long next_column(unsigned long ul, unsigned long dtlen, 243 unsigned columns, unsigned *xpos) 244{ 245 unsigned long transition; 246 unsigned height, widecols; 247 248 // Horizontal sort is easy 249 if (!FLAG(C)) { 250 *xpos = ul % columns; 251 return ul; 252 } 253 254 // vertical sort 255 256 // For -x, calculate height of display, rounded up 257 height = (dtlen+columns-1)/columns; 258 259 // Sanity check: does wrapping render this column count impossible 260 // due to the right edge wrapping eating a whole row? 261 if (height*columns - dtlen >= height) { 262 *xpos = columns; 263 return 0; 264 } 265 266 // Uneven rounding goes along right edge 267 widecols = dtlen % height; 268 if (!widecols) widecols = height; 269 transition = widecols * columns; 270 if (ul < transition) { 271 *xpos = ul % columns; 272 return (*xpos*height) + (ul/columns); 273 } 274 275 ul -= transition; 276 *xpos = ul % (columns-1); 277 278 return (*xpos*height) + widecols + (ul/(columns-1)); 279} 280 281static int color_from_mode(mode_t mode) 282{ 283 int color = 0; 284 285 if (S_ISDIR(mode)) color = 256+34; 286 else if (S_ISLNK(mode)) color = 256+36; 287 else if (S_ISBLK(mode) || S_ISCHR(mode)) color = 256+33; 288 else if (S_ISREG(mode) && (mode&0111)) color = 256+32; 289 else if (S_ISFIFO(mode)) color = 33; 290 else if (S_ISSOCK(mode)) color = 256+35; 291 292 return color; 293} 294 295static void zprint(int zap, char *pat, int len, unsigned long arg) 296{ 297 char tmp[32]; 298 299 sprintf(tmp, "%%*%s", zap ? "s" : pat); 300 if (zap && pat[strlen(pat)-1]==' ') strcat(tmp, " "); 301 printf(tmp, len, zap ? (unsigned long)"?" : arg); 302} 303 304// Display a list of dirtree entries, according to current format 305// Output types -1, -l, -C, or stream 306 307static void listfiles(int dirfd, struct dirtree *indir) 308{ 309 struct dirtree *dt, **sort; 310 unsigned long dtlen, ul = 0; 311 unsigned width, flags = toys.optflags, totals[8], len[8], totpad = 0, 312 *colsizes = (unsigned *)toybuf, columns = sizeof(toybuf)/4; 313 char tmp[64]; 314 315 if (-1 == dirfd) { 316 perror_msg_raw(indir->name); 317 318 return; 319 } 320 321 memset(totals, 0, sizeof(totals)); 322 if (CFG_TOYBOX_DEBUG) memset(len, 0, sizeof(len)); 323 324 // Top level directory was already populated by main() 325 if (!indir->parent) { 326 // Silently descend into single directory listed by itself on command line. 327 // In this case only show dirname/total header when given -R. 328 dt = indir->child; 329 if (dt && S_ISDIR(dt->st.st_mode) && !dt->next && !(flags&(FLAG_d|FLAG_R))) 330 { 331 listfiles(open(dt->name, 0), TT.singledir = dt); 332 333 return; 334 } 335 336 // Do preprocessing (Dirtree didn't populate, so callback wasn't called.) 337 for (;dt; dt = dt->next) filter(dt); 338 if (flags == (FLAG_1|FLAG_f)) return; 339 // Read directory contents. We dup() the fd because this will close it. 340 // This reads/saves contents to display later, except for in "ls -1f" mode. 341 } else dirtree_recurse(indir, filter, dup(dirfd), 342 DIRTREE_STATLESS|DIRTREE_SYMFOLLOW*!!(flags&FLAG_L)); 343 344 // Copy linked list to array and sort it. Directories go in array because 345 // we visit them in sorted order too. (The nested loops let us measure and 346 // fill with the same inner loop.) 347 for (sort = 0;;sort = xmalloc(dtlen*sizeof(void *))) { 348 for (dtlen = 0, dt = indir->child; dt; dt = dt->next, dtlen++) 349 if (sort) sort[dtlen] = dt; 350 if (sort || !dtlen) break; 351 } 352 353 // Label directory if not top of tree, or if -R 354 if (indir->parent && (TT.singledir!=indir || (flags&FLAG_R))) 355 { 356 char *path = dirtree_path(indir, 0); 357 358 if (TT.nl_title++) xputc('\n'); 359 xprintf("%s:\n", path); 360 free(path); 361 } 362 363 // Measure each entry to work out whitespace padding and total blocks 364 if (!(flags & FLAG_f)) { 365 unsigned long long blocks = 0; 366 367 qsort(sort, dtlen, sizeof(void *), (void *)compare); 368 for (ul = 0; ul<dtlen; ul++) { 369 entrylen(sort[ul], len); 370 for (width = 0; width<8; width++) 371 if (len[width]>totals[width]) totals[width] = len[width]; 372 blocks += sort[ul]->st.st_blocks; 373 } 374 totpad = totals[1]+!!totals[1]+totals[6]+!!totals[6]+totals[7]+!!totals[7]; 375 if ((flags&(FLAG_h|FLAG_l|FLAG_o|FLAG_n|FLAG_g|FLAG_s)) && indir->parent) { 376 print_with_h(tmp, blocks, 512); 377 xprintf("total %s\n", tmp); 378 } 379 } 380 381 // Find largest entry in each field for display alignment 382 if (flags & (FLAG_C|FLAG_x)) { 383 384 // columns can't be more than toybuf can hold, or more than files, 385 // or > 1/2 screen width (one char filename, one space). 386 if (columns > TT.screen_width/2) columns = TT.screen_width/2; 387 if (columns > dtlen) columns = dtlen; 388 389 // Try to fit as many columns as we can, dropping down by one each time 390 for (;columns > 1; columns--) { 391 unsigned c, totlen = columns; 392 393 memset(colsizes, 0, columns*sizeof(unsigned)); 394 for (ul=0; ul<dtlen; ul++) { 395 entrylen(sort[next_column(ul, dtlen, columns, &c)], len); 396 // Add `2` to `totpad` to ensure two spaces between filenames 397 *len += totpad+2; 398 if (c == columns) break; 399 // Expand this column if necessary, break if that puts us over budget 400 if (*len > colsizes[c]) { 401 totlen += (*len)-colsizes[c]; 402 colsizes[c] = *len; 403 if (totlen > TT.screen_width) break; 404 } 405 } 406 // If everything fit, stop here 407 if (ul == dtlen) break; 408 } 409 } 410 411 // Loop through again to produce output. 412 width = 0; 413 for (ul = 0; ul<dtlen; ul++) { 414 int ii, zap; 415 unsigned curcol, color = 0; 416 unsigned long next = next_column(ul, dtlen, columns, &curcol); 417 struct stat *st = &(sort[next]->st); 418 mode_t mode = st->st_mode; 419 char et = endtype(st), *ss; 420 421 // If we couldn't stat, output ? for most fields 422 zap = !st->st_blksize && !st->st_dev && !st->st_ino; 423 424 // Skip directories at the top of the tree when -d isn't set 425 if (S_ISDIR(mode) && !indir->parent && !(flags & FLAG_d)) continue; 426 TT.nl_title=1; 427 428 // Handle padding and wrapping for display purposes 429 entrylen(sort[next], len); 430 if (ul) { 431 int mm = !!(flags & FLAG_m); 432 433 if (mm) xputc(','); 434 if (flags & (FLAG_C|FLAG_x)) { 435 if (!curcol) xputc('\n'); 436 } else if ((flags & FLAG_1) || width+1+*len > TT.screen_width) { 437 xputc('\n'); 438 width = 0; 439 } else { 440 printf(" "+mm, 0); // shut up the stupid compiler 441 width += 2-mm; 442 } 443 } 444 width += *len; 445 446 if (flags & FLAG_i) zprint(zap, "lu ", totals[1], st->st_ino); 447 448 if (flags & FLAG_s) { 449 print_with_h(tmp, st->st_blocks, 512); 450 zprint(zap, "s ", totals[6], (unsigned long)tmp); 451 } 452 453 if (flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) { 454 455 // (long) is to coerce the st types into something we know we can print. 456 mode_to_string(mode, tmp); 457 if (zap) memset(tmp+1, '?', 9); 458 printf("%s", tmp); 459 zprint(zap, "ld", totals[2]+1, st->st_nlink); 460 461 // print user 462 if (!(flags&FLAG_g)) { 463 putchar(' '); 464 ii = -totals[3]; 465 if (zap || (flags&FLAG_n)) zprint(zap, "lu", ii, st->st_uid); 466 else draw_trim_esc(getusername(st->st_uid), ii, abs(ii), TT.escmore, 467 crunch_qb); 468 } 469 470 // print group 471 if (!(flags&FLAG_o)) { 472 putchar(' '); 473 ii = -totals[4]; 474 if (zap || (flags&FLAG_n)) zprint(zap, "lu", ii, st->st_gid); 475 else draw_trim_esc(getgroupname(st->st_gid), ii, abs(ii), TT.escmore, 476 crunch_qb); 477 } 478 } 479 if (FLAG(Z)) 480 printf(" %-*s "+!FLAG(l), -(int)totals[7], (char *)sort[next]->extra); 481 482 if (flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) { 483 struct tm *tm; 484 485 // print major/minor, or size 486 if (!zap && (S_ISCHR(st->st_mode) || S_ISBLK(st->st_mode))) 487 printf("% *d,% 4d", totals[5]-4, dev_major(st->st_rdev), 488 dev_minor(st->st_rdev)); 489 else { 490 print_with_h(tmp, st->st_size, 1); 491 zprint(zap, "s", totals[5]+1, (unsigned long)tmp); 492 } 493 494 // print time, always in --time-style=long-iso 495 tm = localtime(&(st->st_mtime)); 496 strftime(tmp, sizeof(tmp), " %F %H:%M", tm); 497 if (TT.l>1) { 498 char *s = tmp+strlen(tmp); 499 500 s += sprintf(s, ":%02d.%09d ", tm->tm_sec, (int)st->st_mtim.tv_nsec); 501 strftime(s, sizeof(tmp)-(s-tmp), "%z", tm); 502 } 503 zprint(zap, "s ", 17+(TT.l>1)*13, (unsigned long)tmp); 504 } 505 506 if (flags & FLAG_color) { 507 color = color_from_mode(st->st_mode); 508 if (color) printf("\033[%d;%dm", color>>8, color&255); 509 } 510 511 ss = sort[next]->name; 512 crunch_str(&ss, INT_MAX, stdout, TT.escmore, crunch_qb); 513 if (color) printf("\033[0m"); 514 515 if ((flags & (FLAG_l|FLAG_o|FLAG_n|FLAG_g)) && S_ISLNK(mode)) { 516 printf(" -> "); 517 if (!zap && (flags & FLAG_color)) { 518 struct stat st2; 519 520 if (fstatat(dirfd, sort[next]->symlink, &st2, 0)) color = 256+31; 521 else color = color_from_mode(st2.st_mode); 522 523 if (color) printf("\033[%d;%dm", color>>8, color&255); 524 } 525 526 zprint(zap, "s", 0, (unsigned long)sort[next]->symlink); 527 if (!zap && color) printf("\033[0m"); 528 } 529 530 if (et) xputc(et); 531 532 // Pad columns 533 if (flags & (FLAG_C|FLAG_x)) { 534 curcol = colsizes[curcol]-(*len)-totpad; 535 if (curcol < 255) printf("%*c", curcol, ' '); 536 } 537 } 538 539 if (width) xputc('\n'); 540 541 // Free directory entries, recursing first if necessary. 542 543 for (ul = 0; ul<dtlen; free(sort[ul++])) { 544 if ((flags & FLAG_d) || !S_ISDIR(sort[ul]->st.st_mode)) continue; 545 546 // Recurse into dirs if at top of the tree or given -R 547 if (!indir->parent || ((flags&FLAG_R) && dirtree_notdotdot(sort[ul]))) 548 listfiles(openat(dirfd, sort[ul]->name, 0), sort[ul]); 549 free((void *)sort[ul]->extra); 550 } 551 free(sort); 552 if (dirfd != AT_FDCWD) close(dirfd); 553} 554 555void ls_main(void) 556{ 557 char **s, *noargs[] = {".", 0}; 558 struct dirtree *dt; 559 560 if (FLAG(full_time)) { 561 toys.optflags |= FLAG_l; 562 TT.l = 2; 563 } 564 565 // Do we have an implied -1 566 if (isatty(1)) { 567 if (!FLAG(show_control_chars)) toys.optflags |= FLAG_b; 568 if (toys.optflags&(FLAG_l|FLAG_o|FLAG_n|FLAG_g)) toys.optflags |= FLAG_1; 569 else if (!(toys.optflags&(FLAG_1|FLAG_x|FLAG_m))) toys.optflags |= FLAG_C; 570 } else { 571 if (!FLAG(m)) toys.optflags |= FLAG_1; 572 if (TT.color) toys.optflags ^= FLAG_color; 573 } 574 575 TT.screen_width = 80; 576 terminal_size(&TT.screen_width, NULL); 577 if (TT.screen_width<2) TT.screen_width = 2; 578 if (FLAG(b)) TT.escmore = " \\"; 579 580 // The optflags parsing infrastructure should really do this for us, 581 // but currently it has "switch off when this is set", so "-dR" and "-Rd" 582 // behave differently 583 if (FLAG(d)) toys.optflags &= ~FLAG_R; 584 585 // Iterate through command line arguments, collecting directories and files. 586 // Non-absolute paths are relative to current directory. Top of tree is 587 // a dummy node to collect command line arguments into pseudo-directory. 588 TT.files = dirtree_add_node(0, 0, 0); 589 TT.files->dirfd = AT_FDCWD; 590 for (s = *toys.optargs ? toys.optargs : noargs; *s; s++) { 591 int sym = !(toys.optflags&(FLAG_l|FLAG_d|FLAG_F)) 592 || (toys.optflags&(FLAG_L|FLAG_H)); 593 594 dt = dirtree_add_node(0, *s, DIRTREE_STATLESS|DIRTREE_SYMFOLLOW*sym); 595 596 // note: double_list->prev temporarily goes in dirtree->parent 597 if (dt) { 598 if (dt->again&2) { 599 perror_msg_raw(*s); 600 free(dt); 601 } else dlist_add_nomalloc((void *)&TT.files->child, (void *)dt); 602 } else toys.exitval = 1; 603 } 604 605 // Convert double_list into dirtree. 606 dlist_terminate(TT.files->child); 607 for (dt = TT.files->child; dt; dt = dt->next) dt->parent = TT.files; 608 609 // Display the files we collected 610 listfiles(AT_FDCWD, TT.files); 611 612 if (CFG_TOYBOX_FREE) free(TT.files); 613}