1 /* $NetBSD: print.c,v 1.17 1997/07/30 05:01:04 thorpej 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.17 1997/07/30 05:01:04 thorpej 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 *, u_long, u_long)); 68 static void printlink __P((FTSENT *)); 69 static void printtime __P((time_t)); 70 static int printtype __P((u_int)); 71 72 #define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT) 73 74 void 75 printscol(dp) 76 DISPLAY *dp; 77 { 78 FTSENT *p; 79 80 for (p = dp->list; p; p = p->fts_link) { 81 if (IS_NOPRINT(p)) 82 continue; 83 (void)printaname(p, dp->s_inode, dp->s_block); 84 (void)putchar('\n'); 85 } 86 } 87 88 void 89 printlong(dp) 90 DISPLAY *dp; 91 { 92 struct stat *sp; 93 FTSENT *p; 94 NAMES *np; 95 char buf[20]; 96 97 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 98 (void)printf("total %lu\n", howmany(dp->btotal, blocksize)); 99 100 for (p = dp->list; p; p = p->fts_link) { 101 if (IS_NOPRINT(p)) 102 continue; 103 sp = p->fts_statp; 104 if (f_inode) 105 (void)printf("%*u ", dp->s_inode, sp->st_ino); 106 if (f_size) 107 (void)printf("%*qd ", 108 dp->s_block, 109 (long long)howmany(sp->st_blocks, blocksize)); 110 (void)strmode(sp->st_mode, buf); 111 np = p->fts_pointer; 112 (void)printf("%s %*u %-*s %-*s ", buf, dp->s_nlink, 113 sp->st_nlink, dp->s_user, np->user, dp->s_group, 114 np->group); 115 if (f_flags) 116 (void)printf("%-*s ", dp->s_flags, np->flags); 117 if (S_ISCHR(sp->st_mode) || S_ISBLK(sp->st_mode)) 118 (void)printf("%3d, %3d ", 119 major(sp->st_rdev), minor(sp->st_rdev)); 120 else if (dp->bcfile) 121 (void)printf("%*s%*qd ", 122 8 - dp->s_size, "", dp->s_size, 123 (long long)sp->st_size); 124 else 125 (void)printf("%*qd ", dp->s_size, 126 (long long)sp->st_size); 127 if (f_accesstime) 128 printtime(sp->st_atime); 129 else if (f_statustime) 130 printtime(sp->st_ctime); 131 else 132 printtime(sp->st_mtime); 133 (void)printf("%s", p->fts_name); 134 if (f_type) 135 (void)printtype(sp->st_mode); 136 if (S_ISLNK(sp->st_mode)) 137 printlink(p); 138 (void)putchar('\n'); 139 } 140 } 141 142 void 143 printcol(dp) 144 DISPLAY *dp; 145 { 146 extern int termwidth; 147 static FTSENT **array; 148 static int lastentries = -1; 149 FTSENT *p; 150 int base, chcnt, col, colwidth, num; 151 int numcols, numrows, row; 152 153 /* 154 * Have to do random access in the linked list -- build a table 155 * of pointers. 156 */ 157 if (dp->entries > lastentries) { 158 lastentries = dp->entries; 159 if ((array = 160 realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) { 161 warn("%s", ""); 162 printscol(dp); 163 } 164 } 165 for (p = dp->list, num = 0; p; p = p->fts_link) 166 if (p->fts_number != NO_PRINT) 167 array[num++] = p; 168 169 colwidth = dp->maxlen; 170 if (f_inode) 171 colwidth += dp->s_inode + 1; 172 if (f_size) 173 colwidth += dp->s_block + 1; 174 if (f_type) 175 colwidth += 1; 176 177 colwidth += 1; 178 179 if (termwidth < 2 * colwidth) { 180 printscol(dp); 181 return; 182 } 183 184 numcols = termwidth / colwidth; 185 colwidth = termwidth / numcols; /* spread out if possible */ 186 numrows = num / numcols; 187 if (num % numcols) 188 ++numrows; 189 190 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 191 (void)printf("total %lu\n", howmany(dp->btotal, blocksize)); 192 for (row = 0; row < numrows; ++row) { 193 for (base = row, chcnt = col = 0; col < numcols; ++col) { 194 chcnt = printaname(array[base], dp->s_inode, dp->s_block); 195 if ((base += numrows) >= num) 196 break; 197 while (chcnt++ < colwidth) 198 putchar(' '); 199 } 200 (void)putchar('\n'); 201 } 202 } 203 204 /* 205 * print [inode] [size] name 206 * return # of characters printed, no trailing characters. 207 */ 208 static int 209 printaname(p, inodefield, sizefield) 210 FTSENT *p; 211 u_long sizefield, inodefield; 212 { 213 struct stat *sp; 214 int chcnt; 215 216 sp = p->fts_statp; 217 chcnt = 0; 218 if (f_inode) 219 chcnt += printf("%*u ", (int)inodefield, sp->st_ino); 220 if (f_size) 221 chcnt += printf("%*qd ", 222 (int)sizefield, 223 (long long)howmany(sp->st_blocks, blocksize)); 224 chcnt += printf("%s", p->fts_name); 225 if (f_type) 226 chcnt += printtype(sp->st_mode); 227 return (chcnt); 228 } 229 230 static void 231 printtime(ftime) 232 time_t ftime; 233 { 234 int i; 235 char *longstring; 236 237 longstring = ctime(&ftime); 238 for (i = 4; i < 11; ++i) 239 (void)putchar(longstring[i]); 240 241 #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY) 242 if (f_sectime) 243 for (i = 11; i < 24; i++) 244 (void)putchar(longstring[i]); 245 else if (ftime + SIXMONTHS > time(NULL)) 246 for (i = 11; i < 16; ++i) 247 (void)putchar(longstring[i]); 248 else { 249 (void)putchar(' '); 250 for (i = 20; i < 24; ++i) 251 (void)putchar(longstring[i]); 252 } 253 (void)putchar(' '); 254 } 255 256 static int 257 printtype(mode) 258 u_int mode; 259 { 260 switch (mode & S_IFMT) { 261 case S_IFDIR: 262 (void)putchar('/'); 263 return (1); 264 case S_IFIFO: 265 (void)putchar('|'); 266 return (1); 267 case S_IFLNK: 268 (void)putchar('@'); 269 return (1); 270 case S_IFSOCK: 271 (void)putchar('='); 272 return (1); 273 case S_IFWHT: 274 (void)putchar('%'); 275 return (1); 276 } 277 if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) { 278 (void)putchar('*'); 279 return (1); 280 } 281 return (0); 282 } 283 284 static void 285 printlink(p) 286 FTSENT *p; 287 { 288 int lnklen; 289 char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1]; 290 291 if (p->fts_level == FTS_ROOTLEVEL) 292 (void)snprintf(name, sizeof(name), "%s", p->fts_name); 293 else 294 (void)snprintf(name, sizeof(name), 295 "%s/%s", p->fts_parent->fts_accpath, p->fts_name); 296 if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) { 297 (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno)); 298 return; 299 } 300 path[lnklen] = '\0'; 301 (void)printf(" -> %s", path); 302 } 303