xref: /freebsd/usr.bin/find/ls.c (revision 6137b5f7b8c183ee8806d79b3f1d8e5e3ddb3df3)
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 #include <sys/param.h>
33 #include <sys/stat.h>
34 
35 #include <err.h>
36 #include <errno.h>
37 #include <fts.h>
38 #include <grp.h>
39 #include <inttypes.h>
40 #include <langinfo.h>
41 #include <pwd.h>
42 #include <stdio.h>
43 #include <string.h>
44 #include <time.h>
45 #include <unistd.h>
46 
47 #include "find.h"
48 
49 /* Derived from the print routines in the ls(1) source code. */
50 
51 static void printlink(char *);
52 static void printtime(time_t);
53 
54 void
55 printlong(char *name, char *accpath, struct stat *sb)
56 {
57 	char modep[15];
58 
59 	(void)printf("%6ju %8"PRId64" ", (uintmax_t)sb->st_ino, sb->st_blocks);
60 	(void)strmode(sb->st_mode, modep);
61 	(void)printf("%s %3ju %-*s %-*s ", modep, (uintmax_t)sb->st_nlink,
62 	    MAXLOGNAME - 1,
63 	    user_from_uid(sb->st_uid, 0), MAXLOGNAME - 1,
64 	    group_from_gid(sb->st_gid, 0));
65 
66 	if (S_ISCHR(sb->st_mode) || S_ISBLK(sb->st_mode))
67 		(void)printf("%#8jx ", (uintmax_t)sb->st_rdev);
68 	else
69 		(void)printf("%8"PRId64" ", sb->st_size);
70 	printtime(sb->st_mtime);
71 	(void)printf("%s", name);
72 	if (S_ISLNK(sb->st_mode))
73 		printlink(accpath);
74 	(void)putchar('\n');
75 }
76 
77 static void
78 printtime(time_t ftime)
79 {
80 	char longstring[80];
81 	static time_t lnow;
82 	const char *format;
83 	static int d_first = -1;
84 	struct tm *tm;
85 
86 #ifdef D_MD_ORDER
87 	if (d_first < 0)
88 		d_first = (*nl_langinfo(D_MD_ORDER) == 'd');
89 #endif
90 	if (lnow == 0)
91 		lnow = time(NULL);
92 
93 #define	SIXMONTHS	((365 / 2) * 86400)
94 	if (ftime + SIXMONTHS > lnow && ftime < lnow + SIXMONTHS)
95 		/* mmm dd hh:mm || dd mmm hh:mm */
96 		format = d_first ? "%e %b %R " : "%b %e %R ";
97 	else
98 		/* mmm dd  yyyy || dd mmm  yyyy */
99 		format = d_first ? "%e %b  %Y " : "%b %e  %Y ";
100 	if ((tm = localtime(&ftime)) != NULL)
101 		strftime(longstring, sizeof(longstring), format, tm);
102 	else
103 		strlcpy(longstring, "bad date val ", sizeof(longstring));
104 	fputs(longstring, stdout);
105 }
106 
107 static void
108 printlink(char *name)
109 {
110 	ssize_t lnklen;
111 	char path[MAXPATHLEN];
112 
113 	if ((lnklen = readlink(name, path, MAXPATHLEN - 1)) == -1) {
114 		warn("%s", name);
115 		return;
116 	}
117 	path[lnklen] = '\0';
118 	(void)printf(" -> %s", path);
119 }
120