1 /* $NetBSD: print.c,v 1.29 2000/06/22 23:42:22 assar Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993, 1994 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Michael Fischbein. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 #if 0 42 static char sccsid[] = "@(#)print.c 8.5 (Berkeley) 7/28/94"; 43 #else 44 __RCSID("$NetBSD: print.c,v 1.29 2000/06/22 23:42:22 assar Exp $"); 45 #endif 46 #endif /* not lint */ 47 48 #include <sys/param.h> 49 #include <sys/stat.h> 50 51 #include <err.h> 52 #include <errno.h> 53 #include <fts.h> 54 #include <grp.h> 55 #include <pwd.h> 56 #include <stdio.h> 57 #include <stdlib.h> 58 #include <string.h> 59 #include <time.h> 60 #include <tzfile.h> 61 #include <unistd.h> 62 #include <utmp.h> 63 64 #include "ls.h" 65 #include "extern.h" 66 67 static int printaname __P((FTSENT *, int, int)); 68 static void printlink __P((FTSENT *)); 69 static void printtime __P((time_t)); 70 static int printtype __P((u_int)); 71 72 static time_t now; 73 74 #define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT) 75 76 void 77 printscol(dp) 78 DISPLAY *dp; 79 { 80 FTSENT *p; 81 82 for (p = dp->list; p; p = p->fts_link) { 83 if (IS_NOPRINT(p)) 84 continue; 85 (void)printaname(p, dp->s_inode, dp->s_block); 86 (void)putchar('\n'); 87 } 88 } 89 90 void 91 printlong(dp) 92 DISPLAY *dp; 93 { 94 struct stat *sp; 95 FTSENT *p; 96 NAMES *np; 97 char buf[20]; 98 99 now = time(NULL); 100 101 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 102 (void)printf("total %llu\n", 103 (long long)(howmany(dp->btotal, blocksize))); 104 105 for (p = dp->list; p; p = p->fts_link) { 106 if (IS_NOPRINT(p)) 107 continue; 108 sp = p->fts_statp; 109 if (f_inode) 110 (void)printf("%*lu ", dp->s_inode, 111 (unsigned long)sp->st_ino); 112 if (f_size) 113 (void)printf("%*llu ", dp->s_block, 114 (long long)howmany(sp->st_blocks, blocksize)); 115 (void)strmode(sp->st_mode, buf); 116 np = p->fts_pointer; 117 (void)printf("%s %*lu %-*s %-*s ", buf, dp->s_nlink, 118 (unsigned long)sp->st_nlink, dp->s_user, np->user, 119 dp->s_group, np->group); 120 if (f_flags) 121 (void)printf("%-*s ", dp->s_flags, np->flags); 122 if (S_ISCHR(sp->st_mode) || S_ISBLK(sp->st_mode)) 123 (void)printf("%*u, %*u ", 124 dp->s_major, major(sp->st_rdev), dp->s_minor, 125 minor(sp->st_rdev)); 126 else 127 (void)printf("%*llu ", dp->s_size, 128 (long long)sp->st_size); 129 if (f_accesstime) 130 printtime(sp->st_atime); 131 else if (f_statustime) 132 printtime(sp->st_ctime); 133 else 134 printtime(sp->st_mtime); 135 if (f_nonprint) 136 (void)printescaped(p->fts_name); 137 else 138 (void)printf("%s", p->fts_name); 139 140 if (f_type || (f_typedir && S_ISDIR(sp->st_mode))) 141 (void)printtype(sp->st_mode); 142 if (S_ISLNK(sp->st_mode)) 143 printlink(p); 144 (void)putchar('\n'); 145 } 146 } 147 148 void 149 printcol(dp) 150 DISPLAY *dp; 151 { 152 extern int termwidth; 153 static FTSENT **array; 154 static int lastentries = -1; 155 FTSENT *p; 156 int base, chcnt, col, colwidth, num; 157 int numcols, numrows, row; 158 159 colwidth = dp->maxlen; 160 if (f_inode) 161 colwidth += dp->s_inode + 1; 162 if (f_size) 163 colwidth += dp->s_block + 1; 164 if (f_type || f_typedir) 165 colwidth += 1; 166 167 colwidth += 1; 168 169 if (termwidth < 2 * colwidth) { 170 printscol(dp); 171 return; 172 } 173 174 /* 175 * Have to do random access in the linked list -- build a table 176 * of pointers. 177 */ 178 if (dp->entries > lastentries) { 179 lastentries = dp->entries; 180 if ((array = 181 realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) { 182 warn(NULL); 183 printscol(dp); 184 } 185 } 186 for (p = dp->list, num = 0; p; p = p->fts_link) 187 if (p->fts_number != NO_PRINT) 188 array[num++] = p; 189 190 numcols = termwidth / colwidth; 191 colwidth = termwidth / numcols; /* spread out if possible */ 192 numrows = num / numcols; 193 if (num % numcols) 194 ++numrows; 195 196 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 197 (void)printf("total %llu\n", 198 (long long)(howmany(dp->btotal, blocksize))); 199 for (row = 0; row < numrows; ++row) { 200 for (base = row, chcnt = col = 0; col < numcols; ++col) { 201 chcnt = printaname(array[base], dp->s_inode, 202 dp->s_block); 203 if ((base += numrows) >= num) 204 break; 205 while (chcnt++ < colwidth) 206 (void)putchar(' '); 207 } 208 (void)putchar('\n'); 209 } 210 } 211 212 void 213 printacol(dp) 214 DISPLAY *dp; 215 { 216 extern int termwidth; 217 FTSENT *p; 218 int chcnt, col, colwidth; 219 int numcols; 220 221 colwidth = dp->maxlen; 222 if (f_inode) 223 colwidth += dp->s_inode + 1; 224 if (f_size) 225 colwidth += dp->s_block + 1; 226 if (f_type || f_typedir) 227 colwidth += 1; 228 229 colwidth += 1; 230 231 if (termwidth < 2 * colwidth) { 232 printscol(dp); 233 return; 234 } 235 236 numcols = termwidth / colwidth; 237 colwidth = termwidth / numcols; /* spread out if possible */ 238 239 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 240 (void)printf("total %llu\n", 241 (long long)(howmany(dp->btotal, blocksize))); 242 chcnt = col = 0; 243 for (p = dp->list; p; p = p->fts_link) { 244 if (IS_NOPRINT(p)) 245 continue; 246 if (col >= numcols) { 247 chcnt = col = 0; 248 (void)putchar('\n'); 249 } 250 chcnt = printaname(p, dp->s_inode, dp->s_block); 251 while (chcnt++ < colwidth) 252 (void)putchar(' '); 253 col++; 254 } 255 (void)putchar('\n'); 256 } 257 258 void 259 printstream(dp) 260 DISPLAY *dp; 261 { 262 extern int termwidth; 263 FTSENT *p; 264 int col; 265 int extwidth; 266 267 extwidth = 0; 268 if (f_inode) 269 extwidth += dp->s_inode + 1; 270 if (f_size) 271 extwidth += dp->s_block + 1; 272 if (f_type) 273 extwidth += 1; 274 275 for (col = 0, p = dp->list; p != NULL; p = p->fts_link) { 276 if (IS_NOPRINT(p)) 277 continue; 278 if (col > 0) { 279 (void)putchar(','), col++; 280 if (col + 1 + extwidth + p->fts_namelen >= termwidth) 281 (void)putchar('\n'), col = 0; 282 else 283 (void)putchar(' '), col++; 284 } 285 col += printaname(p, dp->s_inode, dp->s_block); 286 } 287 (void)putchar('\n'); 288 } 289 290 /* 291 * print [inode] [size] name 292 * return # of characters printed, no trailing characters. 293 */ 294 static int 295 printaname(p, inodefield, sizefield) 296 FTSENT *p; 297 int sizefield, inodefield; 298 { 299 struct stat *sp; 300 int chcnt; 301 302 sp = p->fts_statp; 303 chcnt = 0; 304 if (f_inode) 305 chcnt += printf("%*lu ", inodefield, (unsigned long)sp->st_ino); 306 if (f_size) 307 chcnt += printf("%*llu ", sizefield, 308 (long long)howmany(sp->st_blocks, blocksize)); 309 if (f_nonprint) 310 chcnt += printescaped(p->fts_name); 311 else 312 chcnt += printf("%s", p->fts_name); 313 if (f_type || (f_typedir && S_ISDIR(sp->st_mode))) 314 chcnt += printtype(sp->st_mode); 315 return (chcnt); 316 } 317 318 static void 319 printtime(ftime) 320 time_t ftime; 321 { 322 int i; 323 char *longstring; 324 325 longstring = ctime(&ftime); 326 for (i = 4; i < 11; ++i) 327 (void)putchar(longstring[i]); 328 329 #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY) 330 if (f_sectime) 331 for (i = 11; i < 24; i++) 332 (void)putchar(longstring[i]); 333 else if (ftime + SIXMONTHS > now && ftime - SIXMONTHS < now) 334 for (i = 11; i < 16; ++i) 335 (void)putchar(longstring[i]); 336 else { 337 (void)putchar(' '); 338 for (i = 20; i < 24; ++i) 339 (void)putchar(longstring[i]); 340 } 341 (void)putchar(' '); 342 } 343 344 static int 345 printtype(mode) 346 u_int mode; 347 { 348 switch (mode & S_IFMT) { 349 case S_IFDIR: 350 (void)putchar('/'); 351 return (1); 352 case S_IFIFO: 353 (void)putchar('|'); 354 return (1); 355 case S_IFLNK: 356 (void)putchar('@'); 357 return (1); 358 case S_IFSOCK: 359 (void)putchar('='); 360 return (1); 361 case S_IFWHT: 362 (void)putchar('%'); 363 return (1); 364 } 365 if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) { 366 (void)putchar('*'); 367 return (1); 368 } 369 return (0); 370 } 371 372 static void 373 printlink(p) 374 FTSENT *p; 375 { 376 int lnklen; 377 char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1]; 378 379 if (p->fts_level == FTS_ROOTLEVEL) 380 (void)snprintf(name, sizeof(name), "%s", p->fts_name); 381 else 382 (void)snprintf(name, sizeof(name), 383 "%s/%s", p->fts_parent->fts_accpath, p->fts_name); 384 if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) { 385 (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno)); 386 return; 387 } 388 path[lnklen] = '\0'; 389 (void)printf(" -> "); 390 if (f_nonprint) 391 printescaped(path); 392 else 393 (void)printf("%s", path); 394 } 395