print.c revision 1.34 1 1.34 grant /* $NetBSD: print.c,v 1.34 2003/05/07 13:00:24 grant 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.16 christos #include <sys/cdefs.h>
40 1.1 cgd #ifndef lint
41 1.13 cgd #if 0
42 1.14 jtc static char sccsid[] = "@(#)print.c 8.5 (Berkeley) 7/28/94";
43 1.13 cgd #else
44 1.34 grant __RCSID("$NetBSD: print.c,v 1.34 2003/05/07 13:00:24 grant Exp $");
45 1.13 cgd #endif
46 1.1 cgd #endif /* not lint */
47 1.1 cgd
48 1.1 cgd #include <sys/param.h>
49 1.1 cgd #include <sys/stat.h>
50 1.11 mycroft
51 1.11 mycroft #include <err.h>
52 1.11 mycroft #include <errno.h>
53 1.5 mycroft #include <fts.h>
54 1.1 cgd #include <grp.h>
55 1.1 cgd #include <pwd.h>
56 1.11 mycroft #include <stdio.h>
57 1.5 mycroft #include <stdlib.h>
58 1.5 mycroft #include <string.h>
59 1.11 mycroft #include <time.h>
60 1.11 mycroft #include <tzfile.h>
61 1.11 mycroft #include <unistd.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.31 christos extern int termwidth;
67 1.31 christos
68 1.30 lukem static int printaname(FTSENT *, int, int);
69 1.30 lukem static void printlink(FTSENT *);
70 1.30 lukem static void printtime(time_t);
71 1.30 lukem static int printtype(u_int);
72 1.5 mycroft
73 1.20 mycroft static time_t now;
74 1.20 mycroft
75 1.5 mycroft #define IS_NOPRINT(p) ((p)->fts_number == NO_PRINT)
76 1.5 mycroft
77 1.5 mycroft void
78 1.30 lukem printscol(DISPLAY *dp)
79 1.1 cgd {
80 1.11 mycroft FTSENT *p;
81 1.5 mycroft
82 1.5 mycroft for (p = dp->list; p; p = p->fts_link) {
83 1.5 mycroft if (IS_NOPRINT(p))
84 1.5 mycroft continue;
85 1.5 mycroft (void)printaname(p, dp->s_inode, dp->s_block);
86 1.1 cgd (void)putchar('\n');
87 1.1 cgd }
88 1.1 cgd }
89 1.1 cgd
90 1.5 mycroft void
91 1.30 lukem printlong(DISPLAY *dp)
92 1.5 mycroft {
93 1.11 mycroft struct stat *sp;
94 1.11 mycroft FTSENT *p;
95 1.5 mycroft NAMES *np;
96 1.5 mycroft char buf[20];
97 1.5 mycroft
98 1.22 mycroft now = time(NULL);
99 1.20 mycroft
100 1.5 mycroft if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
101 1.24 christos (void)printf("total %llu\n",
102 1.21 lukem (long long)(howmany(dp->btotal, blocksize)));
103 1.5 mycroft
104 1.5 mycroft for (p = dp->list; p; p = p->fts_link) {
105 1.5 mycroft if (IS_NOPRINT(p))
106 1.5 mycroft continue;
107 1.5 mycroft sp = p->fts_statp;
108 1.1 cgd if (f_inode)
109 1.23 christos (void)printf("%*lu ", dp->s_inode,
110 1.23 christos (unsigned long)sp->st_ino);
111 1.1 cgd if (f_size)
112 1.24 christos (void)printf("%*llu ", dp->s_block,
113 1.17 thorpej (long long)howmany(sp->st_blocks, blocksize));
114 1.5 mycroft (void)strmode(sp->st_mode, buf);
115 1.5 mycroft np = p->fts_pointer;
116 1.34 grant (void)printf("%s %*lu ", buf, dp->s_nlink,
117 1.34 grant (unsigned long)sp->st_nlink);
118 1.34 grant if (!f_grouponly)
119 1.34 grant (void)printf("%-*s ", dp->s_user, np->user);
120 1.34 grant (void)printf("%-*s ", dp->s_group, np->group);
121 1.5 mycroft if (f_flags)
122 1.5 mycroft (void)printf("%-*s ", dp->s_flags, np->flags);
123 1.5 mycroft if (S_ISCHR(sp->st_mode) || S_ISBLK(sp->st_mode))
124 1.18 mycroft (void)printf("%*u, %*u ",
125 1.18 mycroft dp->s_major, major(sp->st_rdev), dp->s_minor,
126 1.18 mycroft minor(sp->st_rdev));
127 1.1 cgd else
128 1.24 christos (void)printf("%*llu ", dp->s_size,
129 1.17 thorpej (long long)sp->st_size);
130 1.1 cgd if (f_accesstime)
131 1.5 mycroft printtime(sp->st_atime);
132 1.1 cgd else if (f_statustime)
133 1.5 mycroft printtime(sp->st_ctime);
134 1.1 cgd else
135 1.5 mycroft printtime(sp->st_mtime);
136 1.28 assar if (f_nonprint)
137 1.29 assar (void)printescaped(p->fts_name);
138 1.28 assar else
139 1.28 assar (void)printf("%s", p->fts_name);
140 1.28 assar
141 1.26 kleink if (f_type || (f_typedir && S_ISDIR(sp->st_mode)))
142 1.5 mycroft (void)printtype(sp->st_mode);
143 1.5 mycroft if (S_ISLNK(sp->st_mode))
144 1.5 mycroft printlink(p);
145 1.1 cgd (void)putchar('\n');
146 1.1 cgd }
147 1.1 cgd }
148 1.1 cgd
149 1.5 mycroft void
150 1.30 lukem printcol(DISPLAY *dp)
151 1.1 cgd {
152 1.5 mycroft static FTSENT **array;
153 1.5 mycroft static int lastentries = -1;
154 1.11 mycroft FTSENT *p;
155 1.16 christos int base, chcnt, col, colwidth, num;
156 1.15 thorpej int numcols, numrows, row;
157 1.1 cgd
158 1.19 lukem colwidth = dp->maxlen;
159 1.19 lukem if (f_inode)
160 1.19 lukem colwidth += dp->s_inode + 1;
161 1.19 lukem if (f_size)
162 1.19 lukem colwidth += dp->s_block + 1;
163 1.26 kleink if (f_type || f_typedir)
164 1.19 lukem colwidth += 1;
165 1.19 lukem
166 1.19 lukem colwidth += 1;
167 1.19 lukem
168 1.19 lukem if (termwidth < 2 * colwidth) {
169 1.19 lukem printscol(dp);
170 1.19 lukem return;
171 1.19 lukem }
172 1.19 lukem
173 1.5 mycroft /*
174 1.5 mycroft * Have to do random access in the linked list -- build a table
175 1.5 mycroft * of pointers.
176 1.5 mycroft */
177 1.5 mycroft if (dp->entries > lastentries) {
178 1.5 mycroft lastentries = dp->entries;
179 1.5 mycroft if ((array =
180 1.5 mycroft realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) {
181 1.27 drochner warn(NULL);
182 1.5 mycroft printscol(dp);
183 1.5 mycroft }
184 1.5 mycroft }
185 1.5 mycroft for (p = dp->list, num = 0; p; p = p->fts_link)
186 1.5 mycroft if (p->fts_number != NO_PRINT)
187 1.5 mycroft array[num++] = p;
188 1.5 mycroft
189 1.19 lukem numcols = termwidth / colwidth;
190 1.19 lukem colwidth = termwidth / numcols; /* spread out if possible */
191 1.19 lukem numrows = num / numcols;
192 1.19 lukem if (num % numcols)
193 1.19 lukem ++numrows;
194 1.19 lukem
195 1.19 lukem if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
196 1.24 christos (void)printf("total %llu\n",
197 1.21 lukem (long long)(howmany(dp->btotal, blocksize)));
198 1.19 lukem for (row = 0; row < numrows; ++row) {
199 1.19 lukem for (base = row, chcnt = col = 0; col < numcols; ++col) {
200 1.19 lukem chcnt = printaname(array[base], dp->s_inode,
201 1.19 lukem dp->s_block);
202 1.19 lukem if ((base += numrows) >= num)
203 1.19 lukem break;
204 1.19 lukem while (chcnt++ < colwidth)
205 1.22 mycroft (void)putchar(' ');
206 1.19 lukem }
207 1.19 lukem (void)putchar('\n');
208 1.19 lukem }
209 1.19 lukem }
210 1.19 lukem
211 1.19 lukem void
212 1.30 lukem printacol(DISPLAY *dp)
213 1.19 lukem {
214 1.19 lukem FTSENT *p;
215 1.19 lukem int chcnt, col, colwidth;
216 1.19 lukem int numcols;
217 1.19 lukem
218 1.5 mycroft colwidth = dp->maxlen;
219 1.1 cgd if (f_inode)
220 1.5 mycroft colwidth += dp->s_inode + 1;
221 1.1 cgd if (f_size)
222 1.5 mycroft colwidth += dp->s_block + 1;
223 1.26 kleink if (f_type || f_typedir)
224 1.1 cgd colwidth += 1;
225 1.1 cgd
226 1.15 thorpej colwidth += 1;
227 1.15 thorpej
228 1.1 cgd if (termwidth < 2 * colwidth) {
229 1.5 mycroft printscol(dp);
230 1.1 cgd return;
231 1.1 cgd }
232 1.1 cgd
233 1.1 cgd numcols = termwidth / colwidth;
234 1.15 thorpej colwidth = termwidth / numcols; /* spread out if possible */
235 1.1 cgd
236 1.5 mycroft if (dp->list->fts_level != FTS_ROOTLEVEL && (f_longform || f_size))
237 1.33 enami (void)printf("total %llu\n",
238 1.21 lukem (long long)(howmany(dp->btotal, blocksize)));
239 1.19 lukem chcnt = col = 0;
240 1.19 lukem for (p = dp->list; p; p = p->fts_link) {
241 1.19 lukem if (IS_NOPRINT(p))
242 1.19 lukem continue;
243 1.19 lukem if (col >= numcols) {
244 1.19 lukem chcnt = col = 0;
245 1.22 mycroft (void)putchar('\n');
246 1.1 cgd }
247 1.19 lukem chcnt = printaname(p, dp->s_inode, dp->s_block);
248 1.19 lukem while (chcnt++ < colwidth)
249 1.22 mycroft (void)putchar(' ');
250 1.19 lukem col++;
251 1.25 kleink }
252 1.25 kleink (void)putchar('\n');
253 1.25 kleink }
254 1.25 kleink
255 1.25 kleink void
256 1.30 lukem printstream(DISPLAY *dp)
257 1.25 kleink {
258 1.25 kleink FTSENT *p;
259 1.25 kleink int col;
260 1.25 kleink int extwidth;
261 1.25 kleink
262 1.25 kleink extwidth = 0;
263 1.25 kleink if (f_inode)
264 1.25 kleink extwidth += dp->s_inode + 1;
265 1.25 kleink if (f_size)
266 1.25 kleink extwidth += dp->s_block + 1;
267 1.25 kleink if (f_type)
268 1.25 kleink extwidth += 1;
269 1.25 kleink
270 1.25 kleink for (col = 0, p = dp->list; p != NULL; p = p->fts_link) {
271 1.25 kleink if (IS_NOPRINT(p))
272 1.25 kleink continue;
273 1.25 kleink if (col > 0) {
274 1.25 kleink (void)putchar(','), col++;
275 1.25 kleink if (col + 1 + extwidth + p->fts_namelen >= termwidth)
276 1.25 kleink (void)putchar('\n'), col = 0;
277 1.25 kleink else
278 1.25 kleink (void)putchar(' '), col++;
279 1.25 kleink }
280 1.25 kleink col += printaname(p, dp->s_inode, dp->s_block);
281 1.1 cgd }
282 1.22 mycroft (void)putchar('\n');
283 1.1 cgd }
284 1.1 cgd
285 1.1 cgd /*
286 1.1 cgd * print [inode] [size] name
287 1.5 mycroft * return # of characters printed, no trailing characters.
288 1.1 cgd */
289 1.5 mycroft static int
290 1.30 lukem printaname(FTSENT *p, int inodefield, int sizefield)
291 1.1 cgd {
292 1.5 mycroft struct stat *sp;
293 1.1 cgd int chcnt;
294 1.1 cgd
295 1.5 mycroft sp = p->fts_statp;
296 1.1 cgd chcnt = 0;
297 1.1 cgd if (f_inode)
298 1.23 christos chcnt += printf("%*lu ", inodefield, (unsigned long)sp->st_ino);
299 1.1 cgd if (f_size)
300 1.24 christos chcnt += printf("%*llu ", sizefield,
301 1.17 thorpej (long long)howmany(sp->st_blocks, blocksize));
302 1.29 assar if (f_nonprint)
303 1.29 assar chcnt += printescaped(p->fts_name);
304 1.29 assar else
305 1.29 assar chcnt += printf("%s", p->fts_name);
306 1.26 kleink if (f_type || (f_typedir && S_ISDIR(sp->st_mode)))
307 1.5 mycroft chcnt += printtype(sp->st_mode);
308 1.5 mycroft return (chcnt);
309 1.1 cgd }
310 1.1 cgd
311 1.5 mycroft static void
312 1.30 lukem printtime(time_t ftime)
313 1.1 cgd {
314 1.1 cgd int i;
315 1.5 mycroft char *longstring;
316 1.1 cgd
317 1.5 mycroft longstring = ctime(&ftime);
318 1.1 cgd for (i = 4; i < 11; ++i)
319 1.1 cgd (void)putchar(longstring[i]);
320 1.1 cgd
321 1.1 cgd #define SIXMONTHS ((DAYSPERNYEAR / 2) * SECSPERDAY)
322 1.1 cgd if (f_sectime)
323 1.1 cgd for (i = 11; i < 24; i++)
324 1.1 cgd (void)putchar(longstring[i]);
325 1.20 mycroft else if (ftime + SIXMONTHS > now && ftime - SIXMONTHS < now)
326 1.1 cgd for (i = 11; i < 16; ++i)
327 1.1 cgd (void)putchar(longstring[i]);
328 1.1 cgd else {
329 1.1 cgd (void)putchar(' ');
330 1.1 cgd for (i = 20; i < 24; ++i)
331 1.1 cgd (void)putchar(longstring[i]);
332 1.1 cgd }
333 1.1 cgd (void)putchar(' ');
334 1.1 cgd }
335 1.1 cgd
336 1.5 mycroft static int
337 1.30 lukem printtype(u_int mode)
338 1.1 cgd {
339 1.11 mycroft switch (mode & S_IFMT) {
340 1.1 cgd case S_IFDIR:
341 1.1 cgd (void)putchar('/');
342 1.5 mycroft return (1);
343 1.11 mycroft case S_IFIFO:
344 1.11 mycroft (void)putchar('|');
345 1.11 mycroft return (1);
346 1.1 cgd case S_IFLNK:
347 1.1 cgd (void)putchar('@');
348 1.5 mycroft return (1);
349 1.1 cgd case S_IFSOCK:
350 1.1 cgd (void)putchar('=');
351 1.12 mycroft return (1);
352 1.12 mycroft case S_IFWHT:
353 1.12 mycroft (void)putchar('%');
354 1.6 jtc return (1);
355 1.1 cgd }
356 1.1 cgd if (mode & (S_IXUSR | S_IXGRP | S_IXOTH)) {
357 1.1 cgd (void)putchar('*');
358 1.5 mycroft return (1);
359 1.1 cgd }
360 1.5 mycroft return (0);
361 1.1 cgd }
362 1.1 cgd
363 1.5 mycroft static void
364 1.30 lukem printlink(FTSENT *p)
365 1.1 cgd {
366 1.1 cgd int lnklen;
367 1.5 mycroft char name[MAXPATHLEN + 1], path[MAXPATHLEN + 1];
368 1.5 mycroft
369 1.5 mycroft if (p->fts_level == FTS_ROOTLEVEL)
370 1.5 mycroft (void)snprintf(name, sizeof(name), "%s", p->fts_name);
371 1.33 enami else
372 1.11 mycroft (void)snprintf(name, sizeof(name),
373 1.11 mycroft "%s/%s", p->fts_parent->fts_accpath, p->fts_name);
374 1.11 mycroft if ((lnklen = readlink(name, path, sizeof(path) - 1)) == -1) {
375 1.1 cgd (void)fprintf(stderr, "\nls: %s: %s\n", name, strerror(errno));
376 1.1 cgd return;
377 1.1 cgd }
378 1.1 cgd path[lnklen] = '\0';
379 1.28 assar (void)printf(" -> ");
380 1.28 assar if (f_nonprint)
381 1.28 assar printescaped(path);
382 1.28 assar else
383 1.28 assar (void)printf("%s", path);
384 1.1 cgd }
385