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