2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Michael Rendell of the Memorial University of Newfoundland.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 static const char copyright[] =
39 "@(#) Copyright (c) 1990, 1993, 1994\n\
40 The Regents of the University of California. All rights reserved.\n";
45 static char sccsid[] = "@(#)col.c 8.5 (Berkeley) 5/4/95";
49 #include <sys/cdefs.h>
50 __FBSDID("$FreeBSD$");
60 #define BS '\b' /* backspace */
61 #define TAB '\t' /* tab */
62 #define SPACE ' ' /* space */
63 #define NL '\n' /* newline */
64 #define CR '\r' /* carriage return */
65 #define ESC '\033' /* escape */
66 #define SI '\017' /* shift in to normal character set */
67 #define SO '\016' /* shift out to alternate character set */
68 #define VT '\013' /* vertical tab (aka reverse line feed) */
69 #define RLF '\007' /* ESC-07 reverse line feed */
70 #define RHLF '\010' /* ESC-010 reverse half-line feed */
71 #define FHLF '\011' /* ESC-011 forward half-line feed */
73 /* build up at least this many lines before flushing them out */
74 #define BUFFER_MARGIN 32
78 typedef struct char_str {
80 #define CS_ALTERNATE 2
81 short c_column; /* column character is in */
82 CSET c_set; /* character set (currently only 2) */
83 char c_char; /* character in question */
86 typedef struct line_str LINE;
88 CHAR *l_line; /* characters on the line */
89 LINE *l_prev; /* previous line */
90 LINE *l_next; /* next line */
91 int l_lsize; /* allocated sizeof l_line */
92 int l_line_len; /* strlen(l_line) */
93 int l_needs_sort; /* set if chars went in out of order */
94 int l_max_col; /* max column in the line */
97 LINE *alloc_line(void);
99 void flush_line(LINE *);
100 void flush_lines(int);
101 void flush_blanks(void);
102 void free_line(LINE *);
103 int main(int, char **);
106 CSET last_set; /* char_set of last char printed */
108 int compress_spaces; /* if doing space -> tab conversion */
109 int fine; /* if `fine' resolution (half lines) */
110 int max_bufd_lines; /* max # lines to keep in memory */
111 int nblank_lines; /* # blanks after last flushed line */
112 int no_backspaces; /* if not to output any backspaces */
113 int pass_unknown_seqs; /* pass unknown control sequences */
117 if (putchar(ch) == EOF) \
118 errx(1, "write error"); \
128 CSET cur_set; /* current character set */
129 LINE *l; /* current line */
130 int extra_lines; /* # of lines above first line */
131 int cur_col; /* current column */
132 int cur_line; /* line number of current position */
133 int max_line; /* max value of cur_line */
134 int this_line; /* line l points to */
135 int nflushd_lines; /* number of lines that were flushed */
136 int adjust, opt, warned;
138 (void)setlocale(LC_CTYPE, "");
140 max_bufd_lines = 128;
141 compress_spaces = 1; /* compress spaces into tabs */
142 while ((opt = getopt(argc, argv, "bfhl:px")) != -1)
144 case 'b': /* do not output backspaces */
147 case 'f': /* allow half forward line feeds */
150 case 'h': /* compress spaces into tabs */
153 case 'l': /* buffered line count */
154 if ((max_bufd_lines = atoi(optarg)) <= 0)
155 errx(1, "bad -l argument %s", optarg);
157 case 'p': /* pass unknown control sequences */
158 pass_unknown_seqs = 1;
160 case 'x': /* do not compress spaces into tabs */
171 /* this value is in half lines */
174 adjust = cur_col = extra_lines = warned = 0;
175 cur_line = max_line = nflushd_lines = this_line = 0;
176 cur_set = last_set = CS_NORMAL;
177 lines = l = alloc_line();
179 while ((ch = getchar()) != EOF) {
182 case BS: /* can't go back further */
190 case ESC: /* just ignore EOF */
200 if (cur_line > max_line)
206 if (cur_line > max_line)
217 cur_set = CS_ALTERNATE;
219 case TAB: /* adjust column */
227 if (!pass_unknown_seqs)
231 /* Must stuff ch in a line - are we at the right one? */
232 if (cur_line != this_line - adjust) {
237 nmove = cur_line - this_line;
239 /* round up to next line */
246 for (; nmove < 0 && l->l_prev; nmove++)
249 if (nflushd_lines == 0) {
251 * Allow backup past first
252 * line if nothing has been
255 for (; nmove < 0; nmove++) {
269 /* may need to allocate here */
270 for (; nmove > 0 && l->l_next; nmove--)
272 for (; nmove > 0; nmove--) {
279 this_line = cur_line + adjust;
280 nmove = this_line - nflushd_lines;
281 if (nmove >= max_bufd_lines + BUFFER_MARGIN) {
282 nflushd_lines += nmove - max_bufd_lines;
283 flush_lines(nmove - max_bufd_lines);
286 /* grow line's buffer? */
287 if (l->l_line_len + 1 >= l->l_lsize) {
290 need = l->l_lsize ? l->l_lsize * 2 : 90;
291 if ((l->l_line = realloc(l->l_line,
292 (unsigned)need * sizeof(CHAR))) == NULL)
293 err(1, (char *)NULL);
296 c = &l->l_line[l->l_line_len++];
299 c->c_column = cur_col;
301 * If things are put in out of order, they will need sorting
302 * when it is flushed.
304 if (cur_col < l->l_max_col)
307 l->l_max_col = cur_col;
311 exit(0); /* no lines, so just exit */
313 /* goto the last line that had a character on it */
314 for (; l->l_next; l = l->l_next)
316 flush_lines(this_line - nflushd_lines + extra_lines + 1);
318 /* make sure we leave things in a sane state */
319 if (last_set != CS_NORMAL)
322 /* flush out the last few blank lines */
323 nblank_lines = max_line - this_line;
326 else if (!nblank_lines)
327 /* missing a \n on the last line? */
339 while (--nflush >= 0) {
348 (void)free(l->l_line);
352 lines->l_prev = NULL;
356 * Print a number of newline/half newlines. If fine flag is set, nblank_lines
357 * is the number of half line feeds, otherwise it is the number of whole line
374 for (i = nb; --i >= 0;)
386 * Write a line to stdout taking care of space to tab conversion (-h flag)
387 * and character set shifts.
394 int nchars, last_col, this_col;
397 nchars = l->l_line_len;
399 if (l->l_needs_sort) {
401 static int count_size, *count, i, save, sorted_size, tot;
404 * Do an O(n) sort on l->l_line by column being careful to
405 * preserve the order of characters in the same column.
407 if (l->l_lsize > sorted_size) {
408 sorted_size = l->l_lsize;
409 if ((sorted = realloc(sorted,
410 (unsigned)sizeof(CHAR) * sorted_size)) == NULL)
411 err(1, (char *)NULL);
413 if (l->l_max_col >= count_size) {
414 count_size = l->l_max_col + 1;
415 if ((count = realloc(count,
416 (unsigned)sizeof(int) * count_size)) == NULL)
417 err(1, (char *)NULL);
419 memset(count, 0, sizeof(int) * l->l_max_col + 1);
420 for (i = nchars, c = l->l_line; --i >= 0; c++)
421 count[c->c_column]++;
424 * calculate running total (shifted down by 1) to use as
425 * indices into new line.
427 for (tot = 0, i = 0; i <= l->l_max_col; i++) {
433 for (i = nchars, c = l->l_line; --i >= 0; c++)
434 sorted[count[c->c_column]++] = *c;
439 this_col = c->c_column;
443 } while (--nchars > 0 && this_col == endc->c_column);
445 /* if -b only print last character */
449 if (this_col > last_col) {
450 int nspace = this_col - last_col;
452 if (compress_spaces && nspace > 1) {
454 int tab_col, tab_size;;
456 tab_col = (last_col + 8) & ~7;
457 if (tab_col > this_col)
459 tab_size = tab_col - last_col;
468 while (--nspace >= 0)
475 if (c->c_set != last_set) {
495 static LINE *line_freelist;
503 if (!line_freelist) {
504 if ((l = realloc(NULL, sizeof(LINE) * NALLOC)) == NULL)
505 err(1, (char *)NULL);
507 for (i = 1; i < NALLOC; i++, l++)
512 line_freelist = l->l_next;
514 memset(l, 0, sizeof(LINE));
523 l->l_next = line_freelist;
531 (void)fprintf(stderr, "usage: col [-bfhpx] [-l nline]\n");
540 warnx("warning: can't back up %s",
541 line < 0 ? "past first line" : "-- line already flushed");