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.14 1997/08/07 22:28:24 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 if (f_octal) (void)prn_octal(p->fts_name); 131 else (void)printf("%s", p->fts_name); 132 if (f_type) 133 (void)printtype(sp->st_mode); 134 if (S_ISLNK(sp->st_mode)) 135 printlink(p); 136 (void)putchar('\n'); 137 } 138 } 139 140 #define TAB 8 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, cnt, col, colwidth, num; 151 int endcol, 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(NULL); 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 = (colwidth + TAB) & ~(TAB - 1); 178 if (termwidth < 2 * colwidth) { 179 printscol(dp); 180 return; 181 } 182 183 numcols = termwidth / colwidth; 184 numrows = num / numcols; 185 if (num % numcols) 186 ++numrows; 187 188 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 189 (void)printf("total %lu\n", howmany(dp->btotal, blocksize)); 190 for (row = 0; row < numrows; ++row) { 191 endcol = colwidth; 192 for (base = row, chcnt = col = 0; col < numcols; ++col) { 193 chcnt += printaname(array[base], dp->s_inode, 194 dp->s_block); 195 if ((base += numrows) >= num) 196 break; 197 while ((cnt = ((chcnt + TAB) & ~(TAB - 1))) <= endcol){ 198 (void)putchar('\t'); 199 chcnt = cnt; 200 } 201 endcol += colwidth; 202 } 203 (void)putchar('\n'); 204 } 205 } 206 207 /* 208 * print [inode] [size] name 209 * return # of characters printed, no trailing characters. 210 */ 211 static int 212 printaname(p, inodefield, sizefield) 213 FTSENT *p; 214 u_long sizefield, inodefield; 215 { 216 struct stat *sp; 217 int chcnt; 218 219 sp = p->fts_statp; 220 chcnt = 0; 221 if (f_inode) 222 chcnt += printf("%*lu ", (int)inodefield, (u_long)sp->st_ino); 223 if (f_size) 224 chcnt += printf("%*qd ", 225 (int)sizefield, howmany(sp->st_blocks, blocksize)); 226 chcnt += f_octal ? prn_octal(p->fts_name) : printf("%s", p->fts_name); 227 if (f_type) 228 chcnt += printtype(sp->st_mode); 229 return (chcnt); 230 } 231 232 static void 233 printtime(ftime) 234 time_t ftime; 235 { 236 int i; 237 char longstring[80]; 238 static time_t now; 239 240 if (now == 0) 241 now = time(NULL); 242 243 strftime(longstring, sizeof(longstring), "%c", localtime(&ftime)); 244 for (i = 4; i < 11; ++i) 245 (void)putchar(longstring[i]); 246 247 #define SIXMONTHS ((365 / 2) * 86400) 248 if (f_sectime) 249 for (i = 11; i < 24; i++) 250 (void)putchar(longstring[i]); 251 else if (ftime + SIXMONTHS > now && ftime < now + SIXMONTHS) 252 for (i = 11; i < 16; ++i) 253 (void)putchar(longstring[i]); 254 else { 255 (void)putchar(' '); 256 for (i = 20; i < 24; ++i) 257 (void)putchar(longstring[i]); 258 } 259 (void)putchar(' '); 260 } 261 262 static int 263 printtype(mode) 264 u_int mode; 265 { 266 switch (mode & S_IFMT) { 267 case S_IFDIR: 268 (void)putchar('/'); 269 return (1); 270 case S_IFIFO: 271 (void)putchar('|'); 272 return (1); 273 case S_IFLNK: 274 (void)putchar('@'); 275 return (1); 276 case S_IFSOCK: 277 (void)putchar('='); 278 return (1); 279 case S_IFWHT: 280 (void)putchar('%'); 281 return (1); 282 } 283 if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) { 284 (void)putchar('*'); 285 return (1); 286 } 287 return (0); 288 } 289 290 static void 291 printlink(p) 292 FTSENT *p; 293 { 294 int lnklen; 295 char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1]; 296 297 if (p->fts_level == FTS_ROOTLEVEL) 298 (void)snprintf(name, sizeof(name), "%s", p->fts_name); 299 else 300 (void)snprintf(name, sizeof(name), 301 "%s/%s", p->fts_parent->fts_accpath, p->fts_name); 302 if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) { 303 (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno)); 304 return; 305 } 306 path[lnklen] = '\0'; 307 if (f_octal) { 308 (void)printf(" -> "); 309 (void)prn_octal(path); 310 } 311 else (void)printf(" -> %s", path); 312 } 313