1 /* $NetBSD: print.c,v 1.31 2001/02/04 19:34:08 christos 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.31 2001/02/04 19:34:08 christos 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 extern int termwidth; 68 69 static int printaname(FTSENT *, int, int); 70 static void printlink(FTSENT *); 71 static void printtime(time_t); 72 static int printtype(u_int); 73 74 static time_t now; 75 76 #define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT) 77 78 void 79 printscol(DISPLAY *dp) 80 { 81 FTSENT *p; 82 83 for (p = dp->list; p; p = p->fts_link) { 84 if (IS_NOPRINT(p)) 85 continue; 86 (void)printaname(p, dp->s_inode, dp->s_block); 87 (void)putchar('\n'); 88 } 89 } 90 91 void 92 printlong(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(DISPLAY *dp) 150 { 151 static FTSENT **array; 152 static int lastentries = -1; 153 FTSENT *p; 154 int base, chcnt, col, colwidth, num; 155 int numcols, numrows, row; 156 157 colwidth = dp->maxlen; 158 if (f_inode) 159 colwidth += dp->s_inode + 1; 160 if (f_size) 161 colwidth += dp->s_block + 1; 162 if (f_type || f_typedir) 163 colwidth += 1; 164 165 colwidth += 1; 166 167 if (termwidth < 2 * colwidth) { 168 printscol(dp); 169 return; 170 } 171 172 /* 173 * Have to do random access in the linked list -- build a table 174 * of pointers. 175 */ 176 if (dp->entries > lastentries) { 177 lastentries = dp->entries; 178 if ((array = 179 realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) { 180 warn(NULL); 181 printscol(dp); 182 } 183 } 184 for (p = dp->list, num = 0; p; p = p->fts_link) 185 if (p->fts_number != NO_PRINT) 186 array[num++] = p; 187 188 numcols = termwidth / colwidth; 189 colwidth = termwidth / numcols; /* spread out if possible */ 190 numrows = num / numcols; 191 if (num % numcols) 192 ++numrows; 193 194 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 195 (void)printf("total %llu\n", 196 (long long)(howmany(dp->btotal, blocksize))); 197 for (row = 0; row < numrows; ++row) { 198 for (base = row, chcnt = col = 0; col < numcols; ++col) { 199 chcnt = printaname(array[base], dp->s_inode, 200 dp->s_block); 201 if ((base += numrows) >= num) 202 break; 203 while (chcnt++ < colwidth) 204 (void)putchar(' '); 205 } 206 (void)putchar('\n'); 207 } 208 } 209 210 void 211 printacol(DISPLAY *dp) 212 { 213 FTSENT *p; 214 int chcnt, col, colwidth; 215 int numcols; 216 217 colwidth = dp->maxlen; 218 if (f_inode) 219 colwidth += dp->s_inode + 1; 220 if (f_size) 221 colwidth += dp->s_block + 1; 222 if (f_type || f_typedir) 223 colwidth += 1; 224 225 colwidth += 1; 226 227 if (termwidth < 2 * colwidth) { 228 printscol(dp); 229 return; 230 } 231 232 numcols = termwidth / colwidth; 233 colwidth = termwidth / numcols; /* spread out if possible */ 234 235 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 236 (void)printf("total %llu\n", 237 (long long)(howmany(dp->btotal, blocksize))); 238 chcnt = col = 0; 239 for (p = dp->list; p; p = p->fts_link) { 240 if (IS_NOPRINT(p)) 241 continue; 242 if (col >= numcols) { 243 chcnt = col = 0; 244 (void)putchar('\n'); 245 } 246 chcnt = printaname(p, dp->s_inode, dp->s_block); 247 while (chcnt++ < colwidth) 248 (void)putchar(' '); 249 col++; 250 } 251 (void)putchar('\n'); 252 } 253 254 void 255 printstream(DISPLAY *dp) 256 { 257 FTSENT *p; 258 int col; 259 int extwidth; 260 261 extwidth = 0; 262 if (f_inode) 263 extwidth += dp->s_inode + 1; 264 if (f_size) 265 extwidth += dp->s_block + 1; 266 if (f_type) 267 extwidth += 1; 268 269 for (col = 0, p = dp->list; p != NULL; p = p->fts_link) { 270 if (IS_NOPRINT(p)) 271 continue; 272 if (col > 0) { 273 (void)putchar(','), col++; 274 if (col + 1 + extwidth + p->fts_namelen >= termwidth) 275 (void)putchar('\n'), col = 0; 276 else 277 (void)putchar(' '), col++; 278 } 279 col += printaname(p, dp->s_inode, dp->s_block); 280 } 281 (void)putchar('\n'); 282 } 283 284 /* 285 * print [inode] [size] name 286 * return # of characters printed, no trailing characters. 287 */ 288 static int 289 printaname(FTSENT *p, int inodefield, int sizefield) 290 { 291 struct stat *sp; 292 int chcnt; 293 294 sp = p->fts_statp; 295 chcnt = 0; 296 if (f_inode) 297 chcnt += printf("%*lu ", inodefield, (unsigned long)sp->st_ino); 298 if (f_size) 299 chcnt += printf("%*llu ", sizefield, 300 (long long)howmany(sp->st_blocks, blocksize)); 301 if (f_nonprint) 302 chcnt += printescaped(p->fts_name); 303 else 304 chcnt += printf("%s", p->fts_name); 305 if (f_type || (f_typedir && S_ISDIR(sp->st_mode))) 306 chcnt += printtype(sp->st_mode); 307 return (chcnt); 308 } 309 310 static void 311 printtime(time_t ftime) 312 { 313 int i; 314 char *longstring; 315 316 longstring = ctime(&ftime); 317 for (i = 4; i < 11; ++i) 318 (void)putchar(longstring[i]); 319 320 #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY) 321 if (f_sectime) 322 for (i = 11; i < 24; i++) 323 (void)putchar(longstring[i]); 324 else if (ftime + SIXMONTHS > now && ftime - SIXMONTHS < now) 325 for (i = 11; i < 16; ++i) 326 (void)putchar(longstring[i]); 327 else { 328 (void)putchar(' '); 329 for (i = 20; i < 24; ++i) 330 (void)putchar(longstring[i]); 331 } 332 (void)putchar(' '); 333 } 334 335 static int 336 printtype(u_int mode) 337 { 338 switch (mode & S_IFMT) { 339 case S_IFDIR: 340 (void)putchar('/'); 341 return (1); 342 case S_IFIFO: 343 (void)putchar('|'); 344 return (1); 345 case S_IFLNK: 346 (void)putchar('@'); 347 return (1); 348 case S_IFSOCK: 349 (void)putchar('='); 350 return (1); 351 case S_IFWHT: 352 (void)putchar('%'); 353 return (1); 354 } 355 if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) { 356 (void)putchar('*'); 357 return (1); 358 } 359 return (0); 360 } 361 362 static void 363 printlink(FTSENT *p) 364 { 365 int lnklen; 366 char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1]; 367 368 if (p->fts_level == FTS_ROOTLEVEL) 369 (void)snprintf(name, sizeof(name), "%s", p->fts_name); 370 else 371 (void)snprintf(name, sizeof(name), 372 "%s/%s", p->fts_parent->fts_accpath, p->fts_name); 373 if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) { 374 (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno)); 375 return; 376 } 377 path[lnklen] = '\0'; 378 (void)printf(" -> "); 379 if (f_nonprint) 380 printescaped(path); 381 else 382 (void)printf("%s", path); 383 } 384