2 * Copyright (c) 1989, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
37 static const char copyright[] =
38 "@(#) Copyright (c) 1989, 1993, 1994\n\
39 The Regents of the University of California. All rights reserved.\n";
43 static const char sccsid[] = "@(#)column.c 8.4 (Berkeley) 5/4/95";
46 #include <sys/types.h>
47 #include <sys/ioctl.h>
59 void c_columnate __P((void));
60 void *emalloc __P((int));
61 void input __P((FILE *));
62 void maketbl __P((void));
63 void print __P((void));
64 void r_columnate __P((void));
65 void usage __P((void));
67 int termwidth = 80; /* default terminal width */
69 int entries; /* number of records */
70 int eval; /* exit value */
71 int maxlength; /* longest record */
72 char **list; /* array of pointers to records */
73 char *separator = "\t "; /* field separator for table option */
85 if (ioctl(1, TIOCGWINSZ, &win) == -1 || !win.ws_col) {
86 if ((p = getenv("COLUMNS")))
89 termwidth = win.ws_col;
92 while ((ch = getopt(argc, argv, "c:s:tx")) != -1)
95 termwidth = atoi(optarg);
115 else for (; *argv; ++argv)
116 if ((fp = fopen(*argv, "r"))) {
127 maxlength = (maxlength + TAB) & ~(TAB - 1);
130 else if (maxlength >= termwidth)
142 int chcnt, col, cnt, endcol, numcols;
145 numcols = termwidth / maxlength;
147 for (chcnt = col = 0, lp = list;; ++lp) {
148 chcnt += printf("%s", *lp);
151 if (++col == numcols) {
156 while ((cnt = ((chcnt + TAB) & ~(TAB - 1))) <= endcol) {
170 int base, chcnt, cnt, col, endcol, numcols, numrows, row;
172 numcols = termwidth / maxlength;
173 numrows = entries / numcols;
174 if (entries % numcols)
177 for (row = 0; row < numrows; ++row) {
179 for (base = row, chcnt = col = 0; col < numcols; ++col) {
180 chcnt += printf("%s", list[base]);
181 if ((base += numrows) >= entries)
183 while ((cnt = ((chcnt + TAB) & ~(TAB - 1))) <= endcol) {
199 for (cnt = entries, lp = list; cnt--; ++lp)
200 (void)printf("%s\n", *lp);
203 typedef struct _tbl {
219 t = tbl = emalloc(entries * sizeof(TBL));
220 cols = emalloc((maxcols = DEFCOLS) * sizeof(char *));
221 lens = emalloc(maxcols * sizeof(int));
222 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) {
223 for (coloff = 0, p = *lp; (cols[coloff] = strtok(p, separator));
225 if (++coloff == maxcols) {
226 if (!(cols = realloc(cols, (u_int)maxcols +
227 DEFCOLS * sizeof(char *))) ||
228 !(lens = realloc(lens,
229 (u_int)maxcols + DEFCOLS * sizeof(int))))
231 memset((char *)lens + maxcols * sizeof(int),
232 0, DEFCOLS * sizeof(int));
235 t->list = emalloc(coloff * sizeof(char *));
236 t->len = emalloc(coloff * sizeof(int));
237 for (t->cols = coloff; --coloff >= 0;) {
238 t->list[coloff] = cols[coloff];
239 t->len[coloff] = strlen(cols[coloff]);
240 if (t->len[coloff] > lens[coloff])
241 lens[coloff] = t->len[coloff];
244 for (cnt = 0, t = tbl; cnt < entries; ++cnt, ++t) {
245 for (coloff = 0; coloff < t->cols - 1; ++coloff)
246 (void)printf("%s%*s", t->list[coloff],
247 lens[coloff] - t->len[coloff] + 2, " ");
248 (void)printf("%s\n", t->list[coloff]);
253 #define MAXLINELEN (LINE_MAX + 1)
261 char *p, buf[MAXLINELEN];
264 list = emalloc((maxentry = DEFNUM) * sizeof(char *));
265 while (fgets(buf, MAXLINELEN, fp)) {
266 for (p = buf; *p && isspace(*p); ++p);
269 if (!(p = strchr(p, '\n'))) {
270 warnx("line too long");
278 if (entries == maxentry) {
280 if (!(list = realloc(list,
281 (u_int)maxentry * sizeof(char *))))
284 list[entries++] = strdup(buf);
294 if (!(p = malloc(size)))
304 (void)fprintf(stderr,
305 "usage: column [-tx] [-c columns] [-s sep] [file ...]\n");