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