Home | History | Annotate | Line # | Download | only in find
ls.c revision 1.3
      1  1.1      cgd /*
      2  1.3      jtc  * Copyright (c) 1989, 1993
      3  1.3      jtc  *	The Regents of the University of California.  All rights reserved.
      4  1.1      cgd  *
      5  1.1      cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1      cgd  * modification, are permitted provided that the following conditions
      7  1.1      cgd  * are met:
      8  1.1      cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1      cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1      cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1      cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1      cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1      cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1      cgd  *    must display the following acknowledgement:
     15  1.1      cgd  *	This product includes software developed by the University of
     16  1.1      cgd  *	California, Berkeley and its contributors.
     17  1.1      cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1      cgd  *    may be used to endorse or promote products derived from this software
     19  1.1      cgd  *    without specific prior written permission.
     20  1.1      cgd  *
     21  1.1      cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1      cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1      cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1      cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1      cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1      cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1      cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1      cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1      cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1      cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1      cgd  * SUCH DAMAGE.
     32  1.1      cgd  */
     33  1.1      cgd 
     34  1.1      cgd #ifndef lint
     35  1.3      jtc /*static char sccsid[] = "from: @(#)ls.c	8.1 (Berkeley) 6/6/93";*/
     36  1.2  mycroft static char rcsid[] = "$Id: ls.c,v 1.3 1993/12/30 21:15:26 jtc Exp $";
     37  1.1      cgd #endif /* not lint */
     38  1.1      cgd 
     39  1.1      cgd #include <sys/param.h>
     40  1.1      cgd #include <sys/stat.h>
     41  1.3      jtc 
     42  1.3      jtc #include <err.h>
     43  1.3      jtc #include <errno.h>
     44  1.3      jtc #include <stdio.h>
     45  1.3      jtc #include <string.h>
     46  1.1      cgd #include <time.h>
     47  1.1      cgd #include <tzfile.h>
     48  1.3      jtc #include <unistd.h>
     49  1.1      cgd #include <utmp.h>
     50  1.1      cgd 
     51  1.1      cgd /* Derived from the print routines in the ls(1) source code. */
     52  1.1      cgd 
     53  1.3      jtc static void printlink __P((char *));
     54  1.3      jtc static void printtime __P((time_t));
     55  1.3      jtc 
     56  1.1      cgd void
     57  1.1      cgd printlong(name, accpath, sb)
     58  1.1      cgd 	char *name;			/* filename to print */
     59  1.1      cgd 	char *accpath;			/* current valid path to filename */
     60  1.1      cgd 	struct stat *sb;		/* stat buffer */
     61  1.1      cgd {
     62  1.1      cgd 	char modep[15], *user_from_uid(), *group_from_gid();
     63  1.1      cgd 
     64  1.3      jtc 	(void)printf("%6lu %4qd ", sb->st_ino, sb->st_blocks);
     65  1.1      cgd 	(void)strmode(sb->st_mode, modep);
     66  1.1      cgd 	(void)printf("%s %3u %-*s %-*s ", modep, sb->st_nlink, UT_NAMESIZE,
     67  1.1      cgd 	    user_from_uid(sb->st_uid, 0), UT_NAMESIZE,
     68  1.1      cgd 	    group_from_gid(sb->st_gid, 0));
     69  1.1      cgd 
     70  1.1      cgd 	if (S_ISCHR(sb->st_mode) || S_ISBLK(sb->st_mode))
     71  1.1      cgd 		(void)printf("%3d, %3d ", major(sb->st_rdev),
     72  1.1      cgd 		    minor(sb->st_rdev));
     73  1.1      cgd 	else
     74  1.3      jtc 		(void)printf("%8qd ", sb->st_size);
     75  1.1      cgd 	printtime(sb->st_mtime);
     76  1.1      cgd 	(void)printf("%s", name);
     77  1.1      cgd 	if (S_ISLNK(sb->st_mode))
     78  1.1      cgd 		printlink(accpath);
     79  1.1      cgd 	(void)putchar('\n');
     80  1.1      cgd }
     81  1.1      cgd 
     82  1.3      jtc static void
     83  1.1      cgd printtime(ftime)
     84  1.1      cgd 	time_t ftime;
     85  1.1      cgd {
     86  1.1      cgd 	int i;
     87  1.1      cgd 	char *longstring, *ctime();
     88  1.1      cgd 	time_t time();
     89  1.1      cgd 
     90  1.1      cgd 	longstring = ctime((long *)&ftime);
     91  1.1      cgd 	for (i = 4; i < 11; ++i)
     92  1.1      cgd 		(void)putchar(longstring[i]);
     93  1.1      cgd 
     94  1.1      cgd #define	SIXMONTHS	((DAYSPERNYEAR / 2) * SECSPERDAY)
     95  1.1      cgd 	if (ftime + SIXMONTHS > time((time_t *)NULL))
     96  1.1      cgd 		for (i = 11; i < 16; ++i)
     97  1.1      cgd 			(void)putchar(longstring[i]);
     98  1.1      cgd 	else {
     99  1.1      cgd 		(void)putchar(' ');
    100  1.1      cgd 		for (i = 20; i < 24; ++i)
    101  1.1      cgd 			(void)putchar(longstring[i]);
    102  1.1      cgd 	}
    103  1.1      cgd 	(void)putchar(' ');
    104  1.1      cgd }
    105  1.1      cgd 
    106  1.3      jtc static void
    107  1.1      cgd printlink(name)
    108  1.1      cgd 	char *name;
    109  1.1      cgd {
    110  1.1      cgd 	int lnklen;
    111  1.1      cgd 	char path[MAXPATHLEN + 1];
    112  1.1      cgd 
    113  1.1      cgd 	if ((lnklen = readlink(name, path, MAXPATHLEN)) == -1) {
    114  1.3      jtc 		warn("%s", name);
    115  1.1      cgd 		return;
    116  1.1      cgd 	}
    117  1.1      cgd 	path[lnklen] = '\0';
    118  1.1      cgd 	(void)printf(" -> %s", path);
    119  1.1      cgd }
    120