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 "$FreeBSD$"; 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 || minor(sp->st_rdev) < 0) 114 (void)printf("%3d, 0x%08x ", 115 major(sp->st_rdev), 116 (u_int)minor(sp->st_rdev)); 117 else 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, sp->st_size); 123 else 124 (void)printf("%*qd ", dp->s_size, sp->st_size); 125 if (f_accesstime) 126 printtime(sp->st_atime); 127 else if (f_statustime) 128 printtime(sp->st_ctime); 129 else 130 printtime(sp->st_mtime); 131 if (f_octal || f_octal_escape) (void)prn_octal(p->fts_name); 132 else (void)printf("%s", p->fts_name); 133 if (f_type) 134 (void)printtype(sp->st_mode); 135 if (S_ISLNK(sp->st_mode)) 136 printlink(p); 137 (void)putchar('\n'); 138 } 139 } 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 int tabwidth; 152 153 if (f_notabs) 154 tabwidth = 1; 155 else 156 tabwidth = 8; 157 158 /* 159 * Have to do random access in the linked list -- build a table 160 * of pointers. 161 */ 162 if (dp->entries > lastentries) { 163 lastentries = dp->entries; 164 if ((array = 165 realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) { 166 warn(NULL); 167 printscol(dp); 168 } 169 } 170 for (p = dp->list, num = 0; p; p = p->fts_link) 171 if (p->fts_number != NO_PRINT) 172 array[num++] = p; 173 174 colwidth = dp->maxlen; 175 if (f_inode) 176 colwidth += dp->s_inode + 1; 177 if (f_size) 178 colwidth += dp->s_block + 1; 179 if (f_type) 180 colwidth += 1; 181 182 colwidth = (colwidth + tabwidth) & ~(tabwidth - 1); 183 if (termwidth < 2 * colwidth) { 184 printscol(dp); 185 return; 186 } 187 188 numcols = termwidth / colwidth; 189 numrows = num / numcols; 190 if (num % numcols) 191 ++numrows; 192 193 if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size)) 194 (void)printf("total %lu\n", howmany(dp->btotal, blocksize)); 195 for (row = 0; row < numrows; ++row) { 196 endcol = colwidth; 197 for (base = row, chcnt = col = 0; col < numcols; ++col) { 198 chcnt += printaname(array[base], dp->s_inode, 199 dp->s_block); 200 if ((base += numrows) >= num) 201 break; 202 while ((cnt = ((chcnt + tabwidth) & ~(tabwidth - 1))) 203 <= endcol){ 204 (void)putchar(f_notabs ? ' ' : '\t'); 205 chcnt = cnt; 206 } 207 endcol += colwidth; 208 } 209 (void)putchar('\n'); 210 } 211 } 212 213 /* 214 * print [inode] [size] name 215 * return # of characters printed, no trailing characters. 216 */ 217 static int 218 printaname(p, inodefield, sizefield) 219 FTSENT *p; 220 u_long sizefield, inodefield; 221 { 222 struct stat *sp; 223 int chcnt; 224 225 sp = p->fts_statp; 226 chcnt = 0; 227 if (f_inode) 228 chcnt += printf("%*lu ", (int)inodefield, (u_long)sp->st_ino); 229 if (f_size) 230 chcnt += printf("%*qd ", 231 (int)sizefield, howmany(sp->st_blocks, blocksize)); 232 chcnt += (f_octal || f_octal_escape) ? prn_octal(p->fts_name) 233 : printf("%s", p->fts_name); 234 if (f_type) 235 chcnt += printtype(sp->st_mode); 236 return (chcnt); 237 } 238 239 static void 240 printtime(ftime) 241 time_t ftime; 242 { 243 int i; 244 char longstring[80]; 245 static time_t now; 246 247 if (now == 0) 248 now = time(NULL); 249 250 strftime(longstring, sizeof(longstring), "%c", localtime(&ftime)); 251 for (i = 4; i < 11; ++i) 252 (void)putchar(longstring[i]); 253 254 #define SIXMONTHS ((365 / 2) * 86400) 255 if (f_sectime) 256 for (i = 11; i < 24; i++) 257 (void)putchar(longstring[i]); 258 else if (ftime + SIXMONTHS > now && ftime < now + SIXMONTHS) 259 for (i = 11; i < 16; ++i) 260 (void)putchar(longstring[i]); 261 else { 262 (void)putchar(' '); 263 for (i = 20; i < 24; ++i) 264 (void)putchar(longstring[i]); 265 } 266 (void)putchar(' '); 267 } 268 269 static int 270 printtype(mode) 271 u_int mode; 272 { 273 switch (mode & S_IFMT) { 274 case S_IFDIR: 275 (void)putchar('/'); 276 return (1); 277 case S_IFIFO: 278 (void)putchar('|'); 279 return (1); 280 case S_IFLNK: 281 (void)putchar('@'); 282 return (1); 283 case S_IFSOCK: 284 (void)putchar('='); 285 return (1); 286 case S_IFWHT: 287 (void)putchar('%'); 288 return (1); 289 } 290 if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) { 291 (void)putchar('*'); 292 return (1); 293 } 294 return (0); 295 } 296 297 static void 298 printlink(p) 299 FTSENT *p; 300 { 301 int lnklen; 302 char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1]; 303 304 if (p->fts_level == FTS_ROOTLEVEL) 305 (void)snprintf(name, sizeof(name), "%s", p->fts_name); 306 else 307 (void)snprintf(name, sizeof(name), 308 "%s/%s", p->fts_parent->fts_accpath, p->fts_name); 309 if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) { 310 (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno)); 311 return; 312 } 313 path[lnklen] = '\0'; 314 if (f_octal || f_octal_escape) { 315 (void)printf(" -> "); 316 (void)prn_octal(path); 317 } 318 else (void)printf(" -> %s", path); 319 } 320