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