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