1 /* 2 * Copyright (c) 1989 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Michael Fischbein. 7 * 8 * %sccs.include.redist.c% 9 */ 10 11 #ifndef lint 12 static char copyright[] = 13 "@(#) Copyright (c) 1989 The Regents of the University of California.\n\ 14 All rights reserved.\n"; 15 #endif /* not lint */ 16 17 #ifndef lint 18 static char sccsid[] = "@(#)ls.c 5.71 (Berkeley) 03/03/93"; 19 #endif /* not lint */ 20 21 #include <sys/types.h> 22 #include <sys/stat.h> 23 #include <sys/ioctl.h> 24 #include <dirent.h> 25 #include <unistd.h> 26 #include <fts.h> 27 #include <stdlib.h> 28 #include <string.h> 29 #include <errno.h> 30 #include <stdio.h> 31 #include "ls.h" 32 #include "extern.h" 33 34 char *getbsize __P((char *, int *, long *)); 35 char *group_from_gid __P((u_int, int)); 36 char *user_from_uid __P((u_int, int)); 37 38 static void display __P((FTSENT *, FTSENT *)); 39 static int mastercmp __P((const FTSENT **, const FTSENT **)); 40 static void traverse __P((int, char **, int)); 41 42 static void (*printfcn) __P((DISPLAY *)); 43 static int (*sortfcn) __P((const FTSENT *, const FTSENT *)); 44 45 long blocksize; /* block size units */ 46 int termwidth = 80; /* default terminal width */ 47 48 /* flags */ 49 int f_accesstime; /* use time of last access */ 50 int f_column; /* columnated format */ 51 int f_flags; /* show flags associated with a file */ 52 int f_inode; /* print inode */ 53 int f_listdir; /* list actual directory, not contents */ 54 int f_listdot; /* list files beginning with . */ 55 int f_longform; /* long listing format */ 56 int f_newline; /* if precede with newline */ 57 int f_nonprint; /* show unprintables as ? */ 58 int f_nosort; /* don't sort output */ 59 int f_recursive; /* ls subdirectories also */ 60 int f_reversesort; /* reverse whatever sort is used */ 61 int f_sectime; /* print the real time for all files */ 62 int f_singlecol; /* use single column output */ 63 int f_size; /* list size in short listing */ 64 int f_statustime; /* use time of last mode change */ 65 int f_dirname; /* if precede with directory name */ 66 int f_timesort; /* sort by time vice name */ 67 int f_type; /* add type character for non-regular files */ 68 69 int 70 main(argc, argv) 71 int argc; 72 char *argv[]; 73 { 74 static char dot[] = ".", *dotav[] = { dot, NULL }; 75 struct winsize win; 76 int ch, fts_options, notused; 77 char *p; 78 79 /* Terminal defaults to -Cq, non-terminal defaults to -1. */ 80 if (isatty(STDOUT_FILENO)) { 81 if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &win) == -1 || 82 !win.ws_col) { 83 if (p = getenv("COLUMNS")) 84 termwidth = atoi(p); 85 } 86 else 87 termwidth = win.ws_col; 88 f_column = f_nonprint = 1; 89 } else 90 f_singlecol = 1; 91 92 /* Root is -A automatically. */ 93 if (!getuid()) 94 f_listdot = 1; 95 96 fts_options = FTS_PHYSICAL; 97 while ((ch = getopt(argc, argv, "1ACFLRTacdfgikloqrstu")) != EOF) { 98 switch (ch) { 99 /* 100 * The -1, -C and -l options all override each other so shell 101 * aliasing works right. 102 */ 103 case '1': 104 f_singlecol = 1; 105 f_column = f_longform = 0; 106 break; 107 case 'C': 108 f_column = 1; 109 f_longform = f_singlecol = 0; 110 break; 111 case 'l': 112 f_longform = 1; 113 f_column = f_singlecol = 0; 114 break; 115 /* The -c and -u options override each other. */ 116 case 'c': 117 f_statustime = 1; 118 f_accesstime = 0; 119 break; 120 case 'u': 121 f_accesstime = 1; 122 f_statustime = 0; 123 break; 124 case 'F': 125 f_type = 1; 126 break; 127 case 'L': 128 fts_options &= ~FTS_PHYSICAL; 129 fts_options |= FTS_LOGICAL; 130 break; 131 case 'R': 132 f_recursive = 1; 133 break; 134 case 'a': 135 fts_options |= FTS_SEEDOT; 136 /* FALLTHROUGH */ 137 case 'A': 138 f_listdot = 1; 139 break; 140 /* The -d option turns off the -R option. */ 141 case 'd': 142 f_listdir = 1; 143 f_recursive = 0; 144 break; 145 case 'f': 146 f_nosort = 1; 147 break; 148 case 'g': /* Compatibility with 4.3BSD. */ 149 break; 150 case 'i': 151 f_inode = 1; 152 break; 153 case 'k': /* Delete before 4.4BSD. */ 154 (void)fprintf(stderr, "ls: -k no longer supported\n"); 155 break; 156 case 'o': 157 f_flags = 1; 158 break; 159 case 'q': 160 f_nonprint = 1; 161 break; 162 case 'r': 163 f_reversesort = 1; 164 break; 165 case 's': 166 f_size = 1; 167 break; 168 case 'T': 169 f_sectime = 1; 170 break; 171 case 't': 172 f_timesort = 1; 173 break; 174 default: 175 case '?': 176 usage(); 177 } 178 } 179 argc -= optind; 180 argv += optind; 181 182 /* 183 * If not -F, -i, -l, -s or -t options, don't require stat 184 * information. 185 */ 186 if (!f_inode && !f_longform && !f_size && !f_timesort && !f_type) 187 fts_options |= FTS_NOSTAT; 188 189 /* 190 * If not -F, -d or -l options, follow any symbolic links listed on 191 * the command line. 192 */ 193 if (!f_longform && !f_listdir && !f_type) 194 fts_options |= FTS_COMFOLLOW; 195 196 /* If -l or -s, figure out block size. */ 197 if (f_longform || f_size) { 198 (void)getbsize("ls", ¬used, &blocksize); 199 blocksize /= 512; 200 } 201 202 /* Select a sort function. */ 203 if (f_reversesort) { 204 if (!f_timesort) 205 sortfcn = revnamecmp; 206 else if (f_accesstime) 207 sortfcn = revacccmp; 208 else if (f_statustime) 209 sortfcn = revstatcmp; 210 else /* Use modification time. */ 211 sortfcn = revmodcmp; 212 } else { 213 if (!f_timesort) 214 sortfcn = namecmp; 215 else if (f_accesstime) 216 sortfcn = acccmp; 217 else if (f_statustime) 218 sortfcn = statcmp; 219 else /* Use modification time. */ 220 sortfcn = modcmp; 221 } 222 223 /* Select a print function. */ 224 if (f_singlecol) 225 printfcn = printscol; 226 else if (f_longform) 227 printfcn = printlong; 228 else 229 printfcn = printcol; 230 231 if (argc) 232 traverse(argc, argv, fts_options); 233 else 234 traverse(1, dotav, fts_options); 235 exit(0); 236 } 237 238 static int output; /* If anything output. */ 239 240 /* 241 * Traverse() walks the logical directory structure specified by the argv list 242 * in the order specified by the mastercmp() comparison function. During the 243 * traversal it passes linked lists of structures to display() which represent 244 * a superset (may be exact set) of the files to be displayed. 245 */ 246 static void 247 traverse(argc, argv, options) 248 int argc, options; 249 char *argv[]; 250 { 251 register FTS *ftsp; 252 register FTSENT *p, *chp; 253 int ch_options; 254 255 if ((ftsp = 256 fts_open(argv, options, f_nosort ? NULL : mastercmp)) == NULL) 257 err(1, "%s", strerror(errno)); 258 259 display(NULL, fts_children(ftsp, 0)); 260 if (f_listdir) 261 return; 262 263 /* 264 * If not recursing down this tree and don't need stat info, just get 265 * the names. 266 */ 267 ch_options = !f_recursive && options & FTS_NOSTAT ? FTS_NAMEONLY : 0; 268 269 while (p = fts_read(ftsp)) 270 switch(p->fts_info) { 271 case FTS_DC: 272 err(0, "%s: directory causes a cycle", p->fts_name); 273 break; 274 case FTS_DNR: 275 case FTS_ERR: 276 err(0, "%s: %s", 277 p->fts_name, strerror(p->fts_errno)); 278 break; 279 case FTS_D: 280 if (p->fts_level != FTS_ROOTLEVEL && 281 p->fts_name[0] == '.' && !f_listdot) 282 break; 283 284 /* 285 * If already output something, put out a newline as 286 * a separator. If multiple arguments, precede each 287 * directory with its name. 288 */ 289 if (output) 290 (void)printf("\n%s:\n", p->fts_path); 291 else if (argc > 1) { 292 (void)printf("%s:\n", p->fts_path); 293 output = 1; 294 } 295 296 chp = fts_children(ftsp, ch_options); 297 display(p, chp); 298 299 if (!f_recursive && chp != NULL) 300 (void)fts_set(ftsp, p, FTS_SKIP); 301 break; 302 } 303 (void)fts_close(ftsp); 304 } 305 306 /* 307 * Display() takes a linked list of FTSENT structures and passes the list 308 * along with any other necessary information to the print function. P 309 * points to the parent directory of the display list. 310 */ 311 static void 312 display(p, list) 313 register FTSENT *p; 314 FTSENT *list; 315 { 316 register FTSENT *cur; 317 struct stat *sp; 318 DISPLAY d; 319 NAMES *np; 320 u_long btotal, maxblock, maxinode, maxlen, maxnlink; 321 u_quad_t maxsize; 322 int bcfile, flen, glen, ulen, maxflags, maxgroup, maxuser; 323 int entries, needstats; 324 char *user, *group, *flags, buf[20]; /* 32 bits == 10 digits */ 325 326 /* 327 * If list is NULL there are two possibilities: that the parent 328 * directory p has no children, or that fts_children() returned an 329 * error. We ignore the error case since it will be replicated 330 * on the next call to fts_read() on the post-order visit to the 331 * directory p, and will be signalled in traverse(). 332 */ 333 if (list == NULL) 334 return; 335 336 needstats = f_inode || f_longform || f_size; 337 flen = 0; 338 btotal = maxblock = maxinode = maxlen = maxnlink = 0; 339 bcfile = 0; 340 maxuser = maxgroup = maxflags = 0; 341 maxsize = 0; 342 for (cur = list, entries = 0; cur; cur = cur->fts_link) { 343 if (cur->fts_info == FTS_ERR || cur->fts_info == FTS_NS) { 344 err(0, "%s: %s", 345 cur->fts_name, strerror(cur->fts_errno)); 346 cur->fts_number = NO_PRINT; 347 continue; 348 } 349 350 /* 351 * P is NULL if list is the argv list, to which different rules 352 * apply. 353 */ 354 if (p == NULL) { 355 /* Directories will be displayed later. */ 356 if (cur->fts_info == FTS_D && !f_listdir) { 357 cur->fts_number = NO_PRINT; 358 continue; 359 } 360 } else { 361 /* Only display dot file if -a/-A set. */ 362 if (cur->fts_name[0] == '.' && !f_listdot) { 363 cur->fts_number = NO_PRINT; 364 continue; 365 } 366 } 367 if (f_nonprint) 368 prcopy(cur->fts_name, cur->fts_name, cur->fts_namelen); 369 if (cur->fts_namelen > maxlen) 370 maxlen = cur->fts_namelen; 371 if (needstats) { 372 sp = cur->fts_statp; 373 if (sp->st_blocks > maxblock) 374 maxblock = sp->st_blocks; 375 if (sp->st_ino > maxinode) 376 maxinode = sp->st_ino; 377 if (sp->st_nlink > maxnlink) 378 maxnlink = sp->st_nlink; 379 if (sp->st_size > maxsize) 380 maxsize = sp->st_size; 381 382 btotal += sp->st_blocks; 383 if (f_longform) { 384 user = user_from_uid(sp->st_uid, 0); 385 if ((ulen = strlen(user)) > maxuser) 386 maxuser = ulen; 387 group = group_from_gid(sp->st_gid, 0); 388 if ((glen = strlen(group)) > maxgroup) 389 maxgroup = glen; 390 if (f_flags) { 391 flags = 392 flags_to_string(sp->st_flags, "-"); 393 if ((flen = strlen(flags)) > maxflags) 394 maxflags = flen; 395 } else 396 flen = 0; 397 398 if ((np = malloc(sizeof(NAMES) + 399 ulen + glen + flen + 3)) == NULL) 400 err(1, "%s", strerror(errno)); 401 402 np->user = &np->data[0]; 403 (void)strcpy(np->user, user); 404 np->group = &np->data[ulen + 1]; 405 (void)strcpy(np->group, group); 406 407 if (S_ISCHR(sp->st_mode) || 408 S_ISBLK(sp->st_mode)) 409 bcfile = 1; 410 411 if (f_flags) { 412 np->flags = &np->data[ulen + glen + 2]; 413 (void)strcpy(np->flags, flags); 414 } 415 cur->fts_pointer = np; 416 } 417 } 418 ++entries; 419 } 420 421 if (!entries) 422 return; 423 424 d.list = list; 425 d.entries = entries; 426 d.maxlen = maxlen; 427 if (needstats) { 428 d.bcfile = bcfile; 429 d.btotal = btotal; 430 (void)snprintf(buf, sizeof(buf), "%lu", maxblock); 431 d.s_block = strlen(buf); 432 d.s_flags = maxflags; 433 d.s_group = maxgroup; 434 (void)snprintf(buf, sizeof(buf), "%lu", maxinode); 435 d.s_inode = strlen(buf); 436 (void)snprintf(buf, sizeof(buf), "%lu", maxnlink); 437 d.s_nlink = strlen(buf); 438 (void)snprintf(buf, sizeof(buf), "%qu", maxsize); 439 d.s_size = strlen(buf); 440 d.s_user = maxuser; 441 } 442 443 printfcn(&d); 444 output = 1; 445 446 if (f_longform) 447 for (cur = list; cur; cur = cur->fts_link) 448 free(cur->fts_pointer); 449 } 450 451 /* 452 * Ordering for mastercmp: 453 * If ordering the argv (fts_level = FTS_ROOTLEVEL) return non-directories 454 * as larger than directories. Within either group, use the sort function. 455 * All other levels use the sort function. Error entries remain unsorted. 456 */ 457 static int 458 mastercmp(a, b) 459 const FTSENT **a, **b; 460 { 461 register int a_info, b_info; 462 463 a_info = (*a)->fts_info; 464 if (a_info == FTS_ERR) 465 return (0); 466 b_info = (*b)->fts_info; 467 if (b_info == FTS_ERR) 468 return (0); 469 470 if (a_info == FTS_NS || b_info == FTS_NS) 471 return (namecmp(*a, *b)); 472 473 if (a_info == b_info) 474 return (sortfcn(*a, *b)); 475 476 if ((*a)->fts_level == FTS_ROOTLEVEL) 477 if (a_info == FTS_D) 478 return (1); 479 else if (b_info == FTS_D) 480 return (-1); 481 else 482 return (sortfcn(*a, *b)); 483 else 484 return (sortfcn(*a, *b)); 485 } 486