print.c revision 1.14 1 1.14 jtc /* $NetBSD: print.c,v 1.14 1995/09/07 06:43:00 jtc Exp $ */
2 1.13 cgd
3 1.1 cgd /*
4 1.11 mycroft * Copyright (c) 1989, 1993, 1994
5 1.11 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Michael Fischbein.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.13 cgd #if 0
41 1.14 jtc static char sccsid[] = "@(#)print.c 8.5 (Berkeley) 7/28/94";
42 1.13 cgd #else
43 1.14 jtc static char rcsid[] = "$NetBSD: print.c,v 1.14 1995/09/07 06:43:00 jtc Exp $";
44 1.13 cgd #endif
45 1.1 cgd #endif /* not lint */
46 1.1 cgd
47 1.1 cgd #include <sys/param.h>
48 1.1 cgd #include <sys/stat.h>
49 1.11 mycroft
50 1.11 mycroft #include <err.h>
51 1.11 mycroft #include <errno.h>
52 1.5 mycroft #include <fts.h>
53 1.1 cgd #include <grp.h>
54 1.1 cgd #include <pwd.h>
55 1.11 mycroft #include <stdio.h>
56 1.5 mycroft #include <stdlib.h>
57 1.5 mycroft #include <string.h>
58 1.11 mycroft #include <time.h>
59 1.11 mycroft #include <tzfile.h>
60 1.11 mycroft #include <unistd.h>
61 1.11 mycroft #include <utmp.h>
62 1.11 mycroft
63 1.1 cgd #include "ls.h"
64 1.5 mycroft #include "extern.h"
65 1.1 cgd
66 1.5 mycroft static int printaname __P((FTSENT *, u_long, u_long));
67 1.5 mycroft static void printlink __P((FTSENT *));
68 1.5 mycroft static void printtime __P((time_t));
69 1.5 mycroft static int printtype __P((u_int));
70 1.5 mycroft
71 1.5 mycroft #define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT)
72 1.5 mycroft
73 1.5 mycroft void
74 1.5 mycroft printscol(dp)
75 1.5 mycroft DISPLAY *dp;
76 1.1 cgd {
77 1.11 mycroft FTSENT *p;
78 1.5 mycroft
79 1.5 mycroft for (p = dp->list; p; p = p->fts_link) {
80 1.5 mycroft if (IS_NOPRINT(p))
81 1.5 mycroft continue;
82 1.5 mycroft (void)printaname(p, dp->s_inode, dp->s_block);
83 1.1 cgd (void)putchar('\n');
84 1.1 cgd }
85 1.1 cgd }
86 1.1 cgd
87 1.5 mycroft void
88 1.5 mycroft printlong(dp)
89 1.5 mycroft DISPLAY *dp;
90 1.5 mycroft {
91 1.11 mycroft struct stat *sp;
92 1.11 mycroft FTSENT *p;
93 1.5 mycroft NAMES *np;
94 1.5 mycroft char buf[20];
95 1.5 mycroft
96 1.5 mycroft if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
97 1.5 mycroft (void)printf("total %lu\n", howmany(dp->btotal, blocksize));
98 1.5 mycroft
99 1.5 mycroft for (p = dp->list; p; p = p->fts_link) {
100 1.5 mycroft if (IS_NOPRINT(p))
101 1.5 mycroft continue;
102 1.5 mycroft sp = p->fts_statp;
103 1.1 cgd if (f_inode)
104 1.5 mycroft (void)printf("%*lu ", dp->s_inode, sp->st_ino);
105 1.1 cgd if (f_size)
106 1.11 mycroft (void)printf("%*qd ",
107 1.11 mycroft dp->s_block, howmany(sp->st_blocks, blocksize));
108 1.5 mycroft (void)strmode(sp->st_mode, buf);
109 1.5 mycroft np = p->fts_pointer;
110 1.5 mycroft (void)printf("%s %*u %-*s %-*s ", buf, dp->s_nlink,
111 1.5 mycroft sp->st_nlink, dp->s_user, np->user, dp->s_group,
112 1.5 mycroft np->group);
113 1.5 mycroft if (f_flags)
114 1.5 mycroft (void)printf("%-*s ", dp->s_flags, np->flags);
115 1.5 mycroft if (S_ISCHR(sp->st_mode) || S_ISBLK(sp->st_mode))
116 1.5 mycroft (void)printf("%3d, %3d ",
117 1.5 mycroft major(sp->st_rdev), minor(sp->st_rdev));
118 1.5 mycroft else if (dp->bcfile)
119 1.5 mycroft (void)printf("%*s%*qd ",
120 1.5 mycroft 8 - dp->s_size, "", dp->s_size, sp->st_size);
121 1.1 cgd else
122 1.5 mycroft (void)printf("%*qd ", dp->s_size, sp->st_size);
123 1.1 cgd if (f_accesstime)
124 1.5 mycroft printtime(sp->st_atime);
125 1.1 cgd else if (f_statustime)
126 1.5 mycroft printtime(sp->st_ctime);
127 1.1 cgd else
128 1.5 mycroft printtime(sp->st_mtime);
129 1.5 mycroft (void)printf("%s", p->fts_name);
130 1.1 cgd if (f_type)
131 1.5 mycroft (void)printtype(sp->st_mode);
132 1.5 mycroft if (S_ISLNK(sp->st_mode))
133 1.5 mycroft printlink(p);
134 1.1 cgd (void)putchar('\n');
135 1.1 cgd }
136 1.1 cgd }
137 1.1 cgd
138 1.1 cgd #define TAB 8
139 1.1 cgd
140 1.5 mycroft void
141 1.5 mycroft printcol(dp)
142 1.5 mycroft DISPLAY *dp;
143 1.1 cgd {
144 1.1 cgd extern int termwidth;
145 1.5 mycroft static FTSENT **array;
146 1.5 mycroft static int lastentries = -1;
147 1.11 mycroft FTSENT *p;
148 1.11 mycroft int base, chcnt, cnt, col, colwidth, num;
149 1.1 cgd int endcol, numcols, numrows, row;
150 1.1 cgd
151 1.5 mycroft /*
152 1.5 mycroft * Have to do random access in the linked list -- build a table
153 1.5 mycroft * of pointers.
154 1.5 mycroft */
155 1.5 mycroft if (dp->entries > lastentries) {
156 1.5 mycroft lastentries = dp->entries;
157 1.5 mycroft if ((array =
158 1.5 mycroft realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) {
159 1.8 cgd warn(NULL);
160 1.5 mycroft printscol(dp);
161 1.5 mycroft }
162 1.5 mycroft }
163 1.5 mycroft for (p = dp->list, num = 0; p; p = p->fts_link)
164 1.5 mycroft if (p->fts_number != NO_PRINT)
165 1.5 mycroft array[num++] = p;
166 1.5 mycroft
167 1.5 mycroft colwidth = dp->maxlen;
168 1.1 cgd if (f_inode)
169 1.5 mycroft colwidth += dp->s_inode + 1;
170 1.1 cgd if (f_size)
171 1.5 mycroft colwidth += dp->s_block + 1;
172 1.1 cgd if (f_type)
173 1.1 cgd colwidth += 1;
174 1.1 cgd
175 1.1 cgd colwidth = (colwidth + TAB) & ~(TAB - 1);
176 1.1 cgd if (termwidth < 2 * colwidth) {
177 1.5 mycroft printscol(dp);
178 1.1 cgd return;
179 1.1 cgd }
180 1.1 cgd
181 1.1 cgd numcols = termwidth / colwidth;
182 1.1 cgd numrows = num / numcols;
183 1.1 cgd if (num % numcols)
184 1.1 cgd ++numrows;
185 1.1 cgd
186 1.5 mycroft if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
187 1.5 mycroft (void)printf("total %lu\n", howmany(dp->btotal, blocksize));
188 1.1 cgd for (row = 0; row < numrows; ++row) {
189 1.1 cgd endcol = colwidth;
190 1.1 cgd for (base = row, chcnt = col = 0; col < numcols; ++col) {
191 1.5 mycroft chcnt += printaname(array[base], dp->s_inode,
192 1.5 mycroft dp->s_block);
193 1.1 cgd if ((base += numrows) >= num)
194 1.1 cgd break;
195 1.1 cgd while ((cnt = (chcnt + TAB & ~(TAB - 1))) <= endcol) {
196 1.1 cgd (void)putchar('\t');
197 1.1 cgd chcnt = cnt;
198 1.1 cgd }
199 1.1 cgd endcol += colwidth;
200 1.1 cgd }
201 1.5 mycroft (void)putchar('\n');
202 1.1 cgd }
203 1.1 cgd }
204 1.1 cgd
205 1.1 cgd /*
206 1.1 cgd * print [inode] [size] name
207 1.5 mycroft * return # of characters printed, no trailing characters.
208 1.1 cgd */
209 1.5 mycroft static int
210 1.5 mycroft printaname(p, inodefield, sizefield)
211 1.11 mycroft FTSENT *p;
212 1.5 mycroft u_long sizefield, inodefield;
213 1.1 cgd {
214 1.5 mycroft struct stat *sp;
215 1.1 cgd int chcnt;
216 1.1 cgd
217 1.5 mycroft sp = p->fts_statp;
218 1.1 cgd chcnt = 0;
219 1.1 cgd if (f_inode)
220 1.11 mycroft chcnt += printf("%*lu ", (int)inodefield, sp->st_ino);
221 1.1 cgd if (f_size)
222 1.11 mycroft chcnt += printf("%*qd ",
223 1.11 mycroft (int)sizefield, howmany(sp->st_blocks, blocksize));
224 1.5 mycroft chcnt += printf("%s", p->fts_name);
225 1.1 cgd if (f_type)
226 1.5 mycroft chcnt += printtype(sp->st_mode);
227 1.5 mycroft return (chcnt);
228 1.1 cgd }
229 1.1 cgd
230 1.5 mycroft static void
231 1.1 cgd printtime(ftime)
232 1.1 cgd time_t ftime;
233 1.1 cgd {
234 1.1 cgd int i;
235 1.5 mycroft char *longstring;
236 1.1 cgd
237 1.5 mycroft longstring = ctime(&ftime);
238 1.1 cgd for (i = 4; i < 11; ++i)
239 1.1 cgd (void)putchar(longstring[i]);
240 1.1 cgd
241 1.1 cgd #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY)
242 1.1 cgd if (f_sectime)
243 1.1 cgd for (i = 11; i < 24; i++)
244 1.1 cgd (void)putchar(longstring[i]);
245 1.5 mycroft else if (ftime + SIXMONTHS > time(NULL))
246 1.1 cgd for (i = 11; i < 16; ++i)
247 1.1 cgd (void)putchar(longstring[i]);
248 1.1 cgd else {
249 1.1 cgd (void)putchar(' ');
250 1.1 cgd for (i = 20; i < 24; ++i)
251 1.1 cgd (void)putchar(longstring[i]);
252 1.1 cgd }
253 1.1 cgd (void)putchar(' ');
254 1.1 cgd }
255 1.1 cgd
256 1.5 mycroft static int
257 1.1 cgd printtype(mode)
258 1.5 mycroft u_int mode;
259 1.1 cgd {
260 1.11 mycroft switch (mode & S_IFMT) {
261 1.1 cgd case S_IFDIR:
262 1.1 cgd (void)putchar('/');
263 1.5 mycroft return (1);
264 1.11 mycroft case S_IFIFO:
265 1.11 mycroft (void)putchar('|');
266 1.11 mycroft return (1);
267 1.1 cgd case S_IFLNK:
268 1.1 cgd (void)putchar('@');
269 1.5 mycroft return (1);
270 1.1 cgd case S_IFSOCK:
271 1.1 cgd (void)putchar('=');
272 1.12 mycroft return (1);
273 1.12 mycroft case S_IFWHT:
274 1.12 mycroft (void)putchar('%');
275 1.6 jtc return (1);
276 1.1 cgd }
277 1.1 cgd if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) {
278 1.1 cgd (void)putchar('*');
279 1.5 mycroft return (1);
280 1.1 cgd }
281 1.5 mycroft return (0);
282 1.1 cgd }
283 1.1 cgd
284 1.5 mycroft static void
285 1.5 mycroft printlink(p)
286 1.5 mycroft FTSENT *p;
287 1.1 cgd {
288 1.1 cgd int lnklen;
289 1.5 mycroft char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1];
290 1.5 mycroft
291 1.5 mycroft if (p->fts_level == FTS_ROOTLEVEL)
292 1.5 mycroft (void)snprintf(name, sizeof(name), "%s", p->fts_name);
293 1.5 mycroft else
294 1.11 mycroft (void)snprintf(name, sizeof(name),
295 1.11 mycroft "%s/%s", p->fts_parent->fts_accpath, p->fts_name);
296 1.11 mycroft if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) {
297 1.1 cgd (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
298 1.1 cgd return;
299 1.1 cgd }
300 1.1 cgd path[lnklen] = '\0';
301 1.1 cgd (void)printf(" -> %s", path);
302 1.1 cgd }
303