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
36 * @(#) Copyright (c) 1990, 1993, 1994 The Regents of the University of California. All rights reserved.
37 * @(#)col.c 8.5 (Berkeley) 5/4/95
38 * $FreeBSD: src/usr.bin/col/col.c,v 1.6.6.4 2001/08/02 01:27:12 obrien Exp $
39 * $DragonFly: src/usr.bin/col/col.c,v 1.5 2006/08/03 16:40:48 swildner Exp $
50 #define BS '\b' /* backspace */
51 #define TAB '\t' /* tab */
52 #define SPACE ' ' /* space */
53 #define NL '\n' /* newline */
54 #define CR '\r' /* carriage return */
55 #define ESC '\033' /* escape */
56 #define SI '\017' /* shift in to normal character set */
57 #define SO '\016' /* shift out to alternate character set */
58 #define VT '\013' /* vertical tab (aka reverse line feed) */
59 #define RLF '\007' /* ESC-07 reverse line feed */
60 #define RHLF '\010' /* ESC-010 reverse half-line feed */
61 #define FHLF '\011' /* ESC-011 forward half-line feed */
63 /* build up at least this many lines before flushing them out */
64 #define BUFFER_MARGIN 32
68 typedef struct char_str {
70 #define CS_ALTERNATE 2
71 short c_column; /* column character is in */
72 CSET c_set; /* character set (currently only 2) */
73 char c_char; /* character in question */
76 typedef struct line_str LINE;
78 CHAR *l_line; /* characters on the line */
79 LINE *l_prev; /* previous line */
80 LINE *l_next; /* next line */
81 int l_lsize; /* allocated sizeof l_line */
82 int l_line_len; /* strlen(l_line) */
83 int l_needs_sort; /* set if chars went in out of order */
84 int l_max_col; /* max column in the line */
87 LINE *alloc_line(void);
89 void flush_line(LINE *);
90 void flush_lines(int);
91 void flush_blanks(void);
92 void free_line(LINE *);
93 int main(int, char **);
96 CSET last_set; /* char_set of last char printed */
98 int compress_spaces; /* if doing space -> tab conversion */
99 int fine; /* if `fine' resolution (half lines) */
100 int max_bufd_lines; /* max # lines to keep in memory */
101 int nblank_lines; /* # blanks after last flushed line */
102 int no_backspaces; /* if not to output any backspaces */
103 int pass_unknown_seqs; /* pass unknown control sequences */
107 if (putchar(ch) == EOF) \
108 errx(1, "write error"); \
112 main(int argc, char **argv)
116 CSET cur_set; /* current character set */
117 LINE *l; /* current line */
118 int extra_lines; /* # of lines above first line */
119 int cur_col; /* current column */
120 int cur_line; /* line number of current position */
121 int max_line; /* max value of cur_line */
122 int this_line; /* line l points to */
123 int nflushd_lines; /* number of lines that were flushed */
124 int adjust, opt, warned;
126 (void)setlocale(LC_CTYPE, "");
128 max_bufd_lines = 128;
129 compress_spaces = 1; /* compress spaces into tabs */
130 while ((opt = getopt(argc, argv, "bfhl:px")) != -1)
132 case 'b': /* do not output backspaces */
135 case 'f': /* allow half forward line feeds */
138 case 'h': /* compress spaces into tabs */
141 case 'l': /* buffered line count */
142 if ((max_bufd_lines = atoi(optarg)) <= 0)
143 errx(1, "bad -l argument %s", optarg);
145 case 'p': /* pass unknown control sequences */
146 pass_unknown_seqs = 1;
148 case 'x': /* do not compress spaces into tabs */
159 /* this value is in half lines */
162 adjust = cur_col = extra_lines = warned = 0;
163 cur_line = max_line = nflushd_lines = this_line = 0;
164 cur_set = last_set = CS_NORMAL;
165 lines = l = alloc_line();
167 while ((ch = getchar()) != EOF) {
170 case BS: /* can't go back further */
178 case ESC: /* just ignore EOF */
188 if (cur_line > max_line)
194 if (cur_line > max_line)
205 cur_set = CS_ALTERNATE;
207 case TAB: /* adjust column */
215 if (!pass_unknown_seqs)
219 /* Must stuff ch in a line - are we at the right one? */
220 if (cur_line != this_line - adjust) {
225 nmove = cur_line - this_line;
227 /* round up to next line */
234 for (; nmove < 0 && l->l_prev; nmove++)
237 if (nflushd_lines == 0) {
239 * Allow backup past first
240 * line if nothing has been
243 for (; nmove < 0; nmove++) {
257 /* may need to allocate here */
258 for (; nmove > 0 && l->l_next; nmove--)
260 for (; nmove > 0; nmove--) {
267 this_line = cur_line + adjust;
268 nmove = this_line - nflushd_lines;
269 if (nmove >= max_bufd_lines + BUFFER_MARGIN) {
270 nflushd_lines += nmove - max_bufd_lines;
271 flush_lines(nmove - max_bufd_lines);
274 /* grow line's buffer? */
275 if (l->l_line_len + 1 >= l->l_lsize) {
278 need = l->l_lsize ? l->l_lsize * 2 : 90;
279 if ((l->l_line = realloc(l->l_line,
280 (unsigned)need * sizeof(CHAR))) == NULL)
284 c = &l->l_line[l->l_line_len++];
287 c->c_column = cur_col;
289 * If things are put in out of order, they will need sorting
290 * when it is flushed.
292 if (cur_col < l->l_max_col)
295 l->l_max_col = cur_col;
299 exit(0); /* no lines, so just exit */
301 /* goto the last line that had a character on it */
302 for (; l->l_next; l = l->l_next)
304 flush_lines(this_line - nflushd_lines + extra_lines + 1);
306 /* make sure we leave things in a sane state */
307 if (last_set != CS_NORMAL)
310 /* flush out the last few blank lines */
311 nblank_lines = max_line - this_line;
314 else if (!nblank_lines)
315 /* missing a \n on the last line? */
322 flush_lines(int nflush)
326 while (--nflush >= 0) {
335 (void)free(l->l_line);
339 lines->l_prev = NULL;
343 * Print a number of newline/half newlines. If fine flag is set, nblank_lines
344 * is the number of half line feeds, otherwise it is the number of whole line
361 for (i = nb; --i >= 0;)
373 * Write a line to stdout taking care of space to tab conversion (-h flag)
374 * and character set shifts.
380 int nchars, last_col, this_col;
383 nchars = l->l_line_len;
385 if (l->l_needs_sort) {
387 static int count_size, *count, i, save, sorted_size, tot;
390 * Do an O(n) sort on l->l_line by column being careful to
391 * preserve the order of characters in the same column.
393 if (l->l_lsize > sorted_size) {
394 sorted_size = l->l_lsize;
395 if ((sorted = realloc(sorted,
396 (unsigned)sizeof(CHAR) * sorted_size)) == NULL)
399 if (l->l_max_col >= count_size) {
400 count_size = l->l_max_col + 1;
401 if ((count = realloc(count,
402 (unsigned)sizeof(int) * count_size)) == NULL)
405 memset(count, 0, sizeof(int) * l->l_max_col + 1);
406 for (i = nchars, c = l->l_line; --i >= 0; c++)
407 count[c->c_column]++;
410 * calculate running total (shifted down by 1) to use as
411 * indices into new line.
413 for (tot = 0, i = 0; i <= l->l_max_col; i++) {
419 for (i = nchars, c = l->l_line; --i >= 0; c++)
420 sorted[count[c->c_column]++] = *c;
425 this_col = c->c_column;
429 } while (--nchars > 0 && this_col == endc->c_column);
431 /* if -b only print last character */
435 if (this_col > last_col) {
436 int nspace = this_col - last_col;
438 if (compress_spaces && nspace > 1) {
440 int tab_col, tab_size;
442 tab_col = (last_col + 8) & ~7;
443 if (tab_col > this_col)
445 tab_size = tab_col - last_col;
454 while (--nspace >= 0)
461 if (c->c_set != last_set) {
481 static LINE *line_freelist;
489 if (!line_freelist) {
490 if ((l = realloc(NULL, sizeof(LINE) * NALLOC)) == NULL)
493 for (i = 1; i < NALLOC; i++, l++)
498 line_freelist = l->l_next;
500 memset(l, 0, sizeof(LINE));
508 l->l_next = line_freelist;
516 (void)fprintf(stderr, "usage: col [-bfhpx] [-l nline]\n");
524 warnx("warning: can't back up %s",
525 line < 0 ? "past first line" : "-- line already flushed");