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
33 * $FreeBSD: src/usr.bin/column/column.c,v 1.4.6.2 2001/08/02 01:34:19 obrien Exp $
34 * $DragonFly: src/usr.bin/column/column.c,v 1.2 2003/06/17 04:29:25 dillon Exp $
36 * @(#) Copyright (c) 1989, 1993, 1994 The Regents of the University of California. All rights reserved.
37 * @(#)column.c 8.4 (Berkeley) 5/4/95
40 #include <sys/types.h>
41 #include <sys/ioctl.h>
53 void c_columnate __P((void));
54 void input __P((FILE *));
55 void maketbl __P((void));
56 void print __P((void));
57 void r_columnate __P((void));
58 void usage __P((void));
60 int termwidth = 80; /* default terminal width */
62 int entries; /* number of records */
63 int eval; /* exit value */
64 int maxlength; /* longest record */
65 char **list; /* array of pointers to records */
66 char *separator = "\t "; /* field separator for table option */
78 if (ioctl(1, TIOCGWINSZ, &win) == -1 || !win.ws_col) {
79 if ((p = getenv("COLUMNS")))
82 termwidth = win.ws_col;
85 while ((ch = getopt(argc, argv, "c:s:tx")) != -1)
88 termwidth = atoi(optarg);
108 else for (; *argv; ++argv)
109 if ((fp = fopen(*argv, "r"))) {
120 maxlength = (maxlength + TAB) & ~(TAB - 1);
123 else if (maxlength >= termwidth)
135 int chcnt, col, cnt, endcol, numcols;
138 numcols = termwidth / maxlength;
140 for (chcnt = col = 0, lp = list;; ++lp) {
141 chcnt += printf("%s", *lp);
144 if (++col == numcols) {
149 while ((cnt = ((chcnt + TAB) & ~(TAB - 1))) <= endcol) {
163 int base, chcnt, cnt, col, endcol, numcols, numrows, row;
165 numcols = termwidth / maxlength;
166 numrows = entries / numcols;
167 if (entries % numcols)
170 for (row = 0; row < numrows; ++row) {
172 for (base = row, chcnt = col = 0; col < numcols; ++col) {
173 chcnt += printf("%s", list[base]);
174 if ((base += numrows) >= entries)
176 while ((cnt = ((chcnt + TAB) & ~(TAB - 1))) <= endcol) {
192 for (cnt = entries, lp = list; cnt--; ++lp)
193 (void)printf("%s\n", *lp);
196 typedef struct _tbl {
212 if ((t = tbl = calloc(entries, sizeof(TBL))) == NULL)
213 err(1, (char *)NULL);
214 if ((cols = calloc((maxcols = DEFCOLS), sizeof(char *))) == NULL)
215 err(1, (char *)NULL);
216 if ((lens = calloc(maxcols, sizeof(int))) == NULL)
217 err(1, (char *)NULL);
218 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) {
219 for (coloff = 0, p = *lp; (cols[coloff] = strtok(p, separator));
221 if (++coloff == maxcols) {
222 if (!(cols = realloc(cols, (u_int)maxcols +
223 DEFCOLS * sizeof(char *))) ||
224 !(lens = realloc(lens,
225 (u_int)maxcols + DEFCOLS * sizeof(int))))
227 memset((char *)lens + maxcols * sizeof(int),
228 0, DEFCOLS * sizeof(int));
231 if ((t->list = calloc(coloff, sizeof(char *))) == NULL)
232 err(1, (char *)NULL);
233 if ((t->len = calloc(coloff, sizeof(int))) == NULL)
234 err(1, (char *)NULL);
235 for (t->cols = coloff; --coloff >= 0;) {
236 t->list[coloff] = cols[coloff];
237 t->len[coloff] = strlen(cols[coloff]);
238 if (t->len[coloff] > lens[coloff])
239 lens[coloff] = t->len[coloff];
242 for (cnt = 0, t = tbl; cnt < entries; ++cnt, ++t) {
243 for (coloff = 0; coloff < t->cols - 1; ++coloff)
244 (void)printf("%s%*s", t->list[coloff],
245 lens[coloff] - t->len[coloff] + 2, " ");
246 (void)printf("%s\n", t->list[coloff]);
251 #define MAXLINELEN (LINE_MAX + 1)
259 char *p, buf[MAXLINELEN];
262 if ((list = calloc((maxentry = DEFNUM), sizeof(char *))) ==
264 err(1, (char *)NULL);
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);
292 (void)fprintf(stderr,
293 "usage: column [-tx] [-c columns] [-s sep] [file ...]\n");