1/*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. 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
| 1/*
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. 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
|
36#endif /* not lint */
37
38#include <sys/param.h>
39#include <sys/stat.h>
40
41#include <err.h>
42#include <errno.h>
43#include <stdio.h>
44#include <string.h>
45#include <time.h>
46#include <unistd.h>
47#include <utmp.h>
48
49/* Derived from the print routines in the ls(1) source code. */
50
51static void printlink __P((char *));
52static void printtime __P((time_t));
53
54void
55printlong(name, accpath, sb)
56 char *name; /* filename to print */
57 char *accpath; /* current valid path to filename */
58 struct stat *sb; /* stat buffer */
59{
60 char modep[15], *user_from_uid(), *group_from_gid();
61
62 (void)printf("%6lu %4qd ", (u_long)sb->st_ino, sb->st_blocks);
63 (void)strmode(sb->st_mode, modep);
64 (void)printf("%s %3u %-*s %-*s ", modep, sb->st_nlink, UT_NAMESIZE,
65 user_from_uid(sb->st_uid, 0), UT_NAMESIZE,
66 group_from_gid(sb->st_gid, 0));
67
68 if (S_ISCHR(sb->st_mode) || S_ISBLK(sb->st_mode))
69 (void)printf("%3d, %3d ", major(sb->st_rdev),
70 minor(sb->st_rdev));
71 else
72 (void)printf("%8qd ", sb->st_size);
73 printtime(sb->st_mtime);
74 (void)printf("%s", name);
75 if (S_ISLNK(sb->st_mode))
76 printlink(accpath);
77 (void)putchar('\n');
78}
79
80static void
81printtime(ftime)
82 time_t ftime;
83{
84 int i;
85 char longstring[80];
86
87 strftime(longstring, sizeof(longstring), "%c", localtime(&ftime));
88 for (i = 4; i < 11; ++i)
89 (void)putchar(longstring[i]);
90
91#define SIXMONTHS ((365 / 2) * 86400)
92 if (ftime + SIXMONTHS > time((time_t *)NULL))
93 for (i = 11; i < 16; ++i)
94 (void)putchar(longstring[i]);
95 else {
96 (void)putchar(' ');
97 for (i = 20; i < 24; ++i)
98 (void)putchar(longstring[i]);
99 }
100 (void)putchar(' ');
101}
102
103static void
104printlink(name)
105 char *name;
106{
107 int lnklen;
108 char path[MAXPATHLEN + 1];
109
110 if ((lnklen = readlink(name, path, MAXPATHLEN - 1)) == -1) {
111 warn("%s", name);
112 return;
113 }
114 path[lnklen] = '\0';
115 (void)printf(" -> %s", path);
116}
| 41#endif /* not lint */
42
43#include <sys/param.h>
44#include <sys/stat.h>
45
46#include <err.h>
47#include <errno.h>
48#include <stdio.h>
49#include <string.h>
50#include <time.h>
51#include <unistd.h>
52#include <utmp.h>
53
54/* Derived from the print routines in the ls(1) source code. */
55
56static void printlink __P((char *));
57static void printtime __P((time_t));
58
59void
60printlong(name, accpath, sb)
61 char *name; /* filename to print */
62 char *accpath; /* current valid path to filename */
63 struct stat *sb; /* stat buffer */
64{
65 char modep[15], *user_from_uid(), *group_from_gid();
66
67 (void)printf("%6lu %4qd ", (u_long)sb->st_ino, sb->st_blocks);
68 (void)strmode(sb->st_mode, modep);
69 (void)printf("%s %3u %-*s %-*s ", modep, sb->st_nlink, UT_NAMESIZE,
70 user_from_uid(sb->st_uid, 0), UT_NAMESIZE,
71 group_from_gid(sb->st_gid, 0));
72
73 if (S_ISCHR(sb->st_mode) || S_ISBLK(sb->st_mode))
74 (void)printf("%3d, %3d ", major(sb->st_rdev),
75 minor(sb->st_rdev));
76 else
77 (void)printf("%8qd ", sb->st_size);
78 printtime(sb->st_mtime);
79 (void)printf("%s", name);
80 if (S_ISLNK(sb->st_mode))
81 printlink(accpath);
82 (void)putchar('\n');
83}
84
85static void
86printtime(ftime)
87 time_t ftime;
88{
89 int i;
90 char longstring[80];
91
92 strftime(longstring, sizeof(longstring), "%c", localtime(&ftime));
93 for (i = 4; i < 11; ++i)
94 (void)putchar(longstring[i]);
95
96#define SIXMONTHS ((365 / 2) * 86400)
97 if (ftime + SIXMONTHS > time((time_t *)NULL))
98 for (i = 11; i < 16; ++i)
99 (void)putchar(longstring[i]);
100 else {
101 (void)putchar(' ');
102 for (i = 20; i < 24; ++i)
103 (void)putchar(longstring[i]);
104 }
105 (void)putchar(' ');
106}
107
108static void
109printlink(name)
110 char *name;
111{
112 int lnklen;
113 char path[MAXPATHLEN + 1];
114
115 if ((lnklen = readlink(name, path, MAXPATHLEN - 1)) == -1) {
116 warn("%s", name);
117 return;
118 }
119 path[lnklen] = '\0';
120 (void)printf(" -> %s", path);
121}
|