xref: /freebsd/usr.bin/find/ls.c (revision 224e0c2f)
1 /*-
2  * SPDX-License-Identifier: BSD-3-Clause
3  *
4  * Copyright (c) 1989, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. Neither the name of the University nor the names of its contributors
16  *    may be used to endorse or promote products derived from this software
17  *    without specific prior written permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29  * SUCH DAMAGE.
30  */
31 
32 #ifndef lint
33 #if 0
34 static char sccsid[] = "@(#)ls.c	8.1 (Berkeley) 6/6/93";
35 #endif
36 #endif /* not lint */
37 
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
40 
41 #include <sys/param.h>
42 #include <sys/stat.h>
43 
44 #include <err.h>
45 #include <errno.h>
46 #include <fts.h>
47 #include <grp.h>
48 #include <inttypes.h>
49 #include <langinfo.h>
50 #include <pwd.h>
51 #include <stdio.h>
52 #include <string.h>
53 #include <time.h>
54 #include <unistd.h>
55 
56 #include "find.h"
57 
58 /* Derived from the print routines in the ls(1) source code. */
59 
60 static void printlink(char *);
61 static void printtime(time_t);
62 
63 void
64 printlong(char *name, char *accpath, struct stat *sb)
65 {
66 	char modep[15];
67 
68 	(void)printf("%6ju %8"PRId64" ", (uintmax_t)sb->st_ino, sb->st_blocks);
69 	(void)strmode(sb->st_mode, modep);
70 	(void)printf("%s %3ju %-*s %-*s ", modep, (uintmax_t)sb->st_nlink,
71 	    MAXLOGNAME - 1,
72 	    user_from_uid(sb->st_uid, 0), MAXLOGNAME - 1,
73 	    group_from_gid(sb->st_gid, 0));
74 
75 	if (S_ISCHR(sb->st_mode) || S_ISBLK(sb->st_mode))
76 		(void)printf("%#8jx ", (uintmax_t)sb->st_rdev);
77 	else
78 		(void)printf("%8"PRId64" ", sb->st_size);
79 	printtime(sb->st_mtime);
80 	(void)printf("%s", name);
81 	if (S_ISLNK(sb->st_mode))
82 		printlink(accpath);
83 	(void)putchar('\n');
84 }
85 
86 static void
87 printtime(time_t ftime)
88 {
89 	char longstring[80];
90 	static time_t lnow;
91 	const char *format;
92 	static int d_first = -1;
93 
94 	if (d_first < 0)
95 		d_first = (*nl_langinfo(D_MD_ORDER) == 'd');
96 	if (lnow == 0)
97 		lnow = time(NULL);
98 
99 #define	SIXMONTHS	((365 / 2) * 86400)
100 	if (ftime + SIXMONTHS > lnow && ftime < lnow + SIXMONTHS)
101 		/* mmm dd hh:mm || dd mmm hh:mm */
102 		format = d_first ? "%e %b %R " : "%b %e %R ";
103 	else
104 		/* mmm dd  yyyy || dd mmm  yyyy */
105 		format = d_first ? "%e %b  %Y " : "%b %e  %Y ";
106 	strftime(longstring, sizeof(longstring), format, localtime(&ftime));
107 	fputs(longstring, stdout);
108 }
109 
110 static void
111 printlink(char *name)
112 {
113 	int lnklen;
114 	char path[MAXPATHLEN];
115 
116 	if ((lnklen = readlink(name, path, MAXPATHLEN - 1)) == -1) {
117 		warn("%s", name);
118 		return;
119 	}
120 	path[lnklen] = '\0';
121 	(void)printf(" -> %s", path);
122 }
123