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