Home | History | Annotate | Line # | Download | only in ls
print.c revision 1.9 
      1 /*
      2  * Copyright (c) 1989 The Regents of the University of California.
      3  * 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 /*static char sccsid[] = "from: @(#)print.c	5.37 (Berkeley) 7/20/92";*/
     39 static char rcsid[] = "$Id: print.c,v 1.9 1994/03/27 09:29:04 cgd Exp $";
     40 #endif /* not lint */
     41 
     42 #include <sys/param.h>
     43 #include <sys/stat.h>
     44 #include <fts.h>
     45 #include <time.h>
     46 #include <errno.h>
     47 #include <grp.h>
     48 #include <pwd.h>
     49 #include <utmp.h>
     50 #include <unistd.h>
     51 #include <tzfile.h>
     52 #include <stdlib.h>
     53 #include <stdio.h>
     54 #include <string.h>
     55 #include <err.h>
     56 #include "ls.h"
     57 #include "extern.h"
     58 
     59 static int	printaname __P((FTSENT *, u_long, u_long));
     60 static void	printlink __P((FTSENT *));
     61 static void	printtime __P((time_t));
     62 static int	printtype __P((u_int));
     63 
     64 #define	IS_NOPRINT(p)	((p)->fts_number == NO_PRINT)
     65 
     66 void
     67 printscol(dp)
     68 	DISPLAY *dp;
     69 {
     70 	register FTSENT *p;
     71 
     72 	for (p = dp->list; p; p = p->fts_link) {
     73 		if (IS_NOPRINT(p))
     74 			continue;
     75 		(void)printaname(p, dp->s_inode, dp->s_block);
     76 		(void)putchar('\n');
     77 	}
     78 }
     79 
     80 void
     81 printlong(dp)
     82 	DISPLAY *dp;
     83 {
     84 	register FTSENT *p;
     85 	register struct stat *sp;
     86 	NAMES *np;
     87 	char buf[20];
     88 
     89 	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
     90 		(void)printf("total %lu\n", howmany(dp->btotal, blocksize));
     91 
     92 	for (p = dp->list; p; p = p->fts_link) {
     93 		if (IS_NOPRINT(p))
     94 			continue;
     95 		sp = p->fts_statp;
     96 		if (f_inode)
     97 			(void)printf("%*lu ", dp->s_inode, sp->st_ino);
     98 		if (f_size)
     99 #ifdef notyet
    100 			(void)printf("%*qd ",
    101 #else
    102 			(void)printf("%*ld ",
    103 #endif
    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 			(void)printf("%3d, %3d ",
    114 			    major(sp->st_rdev), minor(sp->st_rdev));
    115 		else if (dp->bcfile)
    116 			(void)printf("%*s%*qd ",
    117 			    8 - dp->s_size, "", dp->s_size, sp->st_size);
    118 		else
    119 			(void)printf("%*qd ", dp->s_size, sp->st_size);
    120 		if (f_accesstime)
    121 			printtime(sp->st_atime);
    122 		else if (f_statustime)
    123 			printtime(sp->st_ctime);
    124 		else
    125 			printtime(sp->st_mtime);
    126 		(void)printf("%s", p->fts_name);
    127 		if (f_type)
    128 			(void)printtype(sp->st_mode);
    129 		if (S_ISLNK(sp->st_mode))
    130 			printlink(p);
    131 		(void)putchar('\n');
    132 	}
    133 }
    134 
    135 #define	TAB	8
    136 
    137 void
    138 printcol(dp)
    139 	DISPLAY *dp;
    140 {
    141 	extern int termwidth;
    142 	static FTSENT **array;
    143 	static int lastentries = -1;
    144 	register FTSENT *p;
    145 	register int base, chcnt, cnt, col, colwidth, num;
    146 	int endcol, numcols, numrows, row;
    147 
    148 	/*
    149 	 * Have to do random access in the linked list -- build a table
    150 	 * of pointers.
    151 	 */
    152 	if (dp->entries > lastentries) {
    153 		lastentries = dp->entries;
    154 		if ((array =
    155 		    realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) {
    156 			warn(NULL);
    157 			printscol(dp);
    158 		}
    159 	}
    160 	for (p = dp->list, num = 0; p; p = p->fts_link)
    161 		if (p->fts_number != NO_PRINT)
    162 			array[num++] = p;
    163 
    164 	colwidth = dp->maxlen;
    165 	if (f_inode)
    166 		colwidth += dp->s_inode + 1;
    167 	if (f_size)
    168 		colwidth += dp->s_block + 1;
    169 	if (f_type)
    170 		colwidth += 1;
    171 
    172 	colwidth = (colwidth + TAB) & ~(TAB - 1);
    173 	if (termwidth < 2 * colwidth) {
    174 		printscol(dp);
    175 		return;
    176 	}
    177 
    178 	numcols = termwidth / colwidth;
    179 	numrows = num / numcols;
    180 	if (num % numcols)
    181 		++numrows;
    182 
    183 	if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
    184 		(void)printf("total %lu\n", howmany(dp->btotal, blocksize));
    185 	for (row = 0; row < numrows; ++row) {
    186 		endcol = colwidth;
    187 		for (base = row, chcnt = col = 0; col < numcols; ++col) {
    188 			chcnt += printaname(array[base], dp->s_inode,
    189 			    dp->s_block);
    190 			if ((base += numrows) >= num)
    191 				break;
    192 			while ((cnt = (chcnt + TAB & ~(TAB - 1))) <= endcol) {
    193 				(void)putchar('\t');
    194 				chcnt = cnt;
    195 			}
    196 			endcol += colwidth;
    197 		}
    198 		(void)putchar('\n');
    199 	}
    200 }
    201 
    202 /*
    203  * print [inode] [size] name
    204  * return # of characters printed, no trailing characters.
    205  */
    206 static int
    207 printaname(p, inodefield, sizefield)
    208 	register FTSENT *p;
    209 	u_long sizefield, inodefield;
    210 {
    211 	struct stat *sp;
    212 	int chcnt;
    213 
    214 	sp = p->fts_statp;
    215 	chcnt = 0;
    216 	if (f_inode)
    217 		chcnt += printf("%*lu ", inodefield, sp->st_ino);
    218 	if (f_size)
    219 #ifdef notyet
    220 		chcnt += printf("%*qd ",
    221 #else
    222 		chcnt += printf("%*ld ",
    223 #endif
    224 		    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;
    237 
    238 	longstring = ctime(&ftime);
    239 	for (i = 4; i < 11; ++i)
    240 		(void)putchar(longstring[i]);
    241 
    242 #define	SIXMONTHS	((DAYSPERNYEAR / 2) * SECSPERDAY)
    243 	if (f_sectime)
    244 		for (i = 11; i < 24; i++)
    245 			(void)putchar(longstring[i]);
    246 	else if (ftime + SIXMONTHS > time(NULL))
    247 		for (i = 11; i < 16; ++i)
    248 			(void)putchar(longstring[i]);
    249 	else {
    250 		(void)putchar(' ');
    251 		for (i = 20; i < 24; ++i)
    252 			(void)putchar(longstring[i]);
    253 	}
    254 	(void)putchar(' ');
    255 }
    256 
    257 static int
    258 printtype(mode)
    259 	u_int mode;
    260 {
    261 	switch(mode & S_IFMT) {
    262 	case S_IFDIR:
    263 		(void)putchar('/');
    264 		return (1);
    265 	case S_IFLNK:
    266 		(void)putchar('@');
    267 		return (1);
    268 	case S_IFSOCK:
    269 		(void)putchar('=');
    270 		return (1);
    271 	case S_IFIFO:
    272 		(void)putchar('|');
    273 		return (1);
    274 	}
    275 	if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) {
    276 		(void)putchar('*');
    277 		return (1);
    278 	}
    279 	return (0);
    280 }
    281 
    282 static void
    283 printlink(p)
    284 	FTSENT *p;
    285 {
    286 	int lnklen;
    287 	char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1];
    288 
    289 
    290 	if (p->fts_level == FTS_ROOTLEVEL)
    291 		(void)snprintf(name, sizeof(name), "%s", p->fts_name);
    292 	else
    293 		(void)snprintf(name, sizeof(name), "%s/%s",
    294 		    p->fts_parent->fts_accpath, p->fts_name);
    295 	if ((lnklen = readlink(name, path, sizeof(name) - 1)) == -1) {
    296 		(void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
    297 		return;
    298 	}
    299 	path[lnklen] = '\0';
    300 	(void)printf(" -> %s", path);
    301 }
    302