]>
git.ipfire.org Git - thirdparty/util-linux.git/blob - text-utils/col.c
2 * Copyright (c) 1990 The Regents of the University of California.
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 * Wed Jun 22 22:15:41 1994, faith@cs.unc.edu: Added internationalization
37 * patches from Andries.Brouwer@cwi.nl
38 * Wed Sep 14 22:31:17 1994: patches from Carl Christofferson
39 * (cchris@connected.com)
44 "@(#) Copyright (c) 1990 The Regents of the University of California.\n\
45 All rights reserved.\n";
49 static char sccsid
[] = "@(#)col.c 5.3 (Berkeley) 2/2/91";
61 #define BS '\b' /* backspace */
62 #define TAB '\t' /* tab */
63 #define SPACE ' ' /* space */
64 #define NL '\n' /* newline */
65 #define CR '\r' /* carriage return */
66 #define ESC '\033' /* escape */
67 #define SI '\017' /* shift in to normal character set */
68 #define SO '\016' /* shift out to alternate character set */
69 #define VT '\013' /* vertical tab (aka reverse line feed) */
70 #define RLF '\007' /* ESC-07 reverse line feed */
71 #define RHLF '\010' /* ESC-010 reverse half-line feed */
72 #define FHLF '\011' /* ESC-011 forward half-line feed */
74 /* build up at least this many lines before flushing them out */
75 #define BUFFER_MARGIN 32
79 typedef struct char_str
{
81 #define CS_ALTERNATE 2
82 short c_column
; /* column character is in */
83 CSET c_set
; /* character set (currently only 2) */
84 char c_char
; /* character in question */
87 typedef struct line_str LINE
;
89 CHAR
*l_line
; /* characters on the line */
90 LINE
*l_prev
; /* previous line */
91 LINE
*l_next
; /* next line */
92 int l_lsize
; /* allocated sizeof l_line */
93 int l_line_len
; /* strlen(l_line) */
94 int l_needs_sort
; /* set if chars went in out of order */
95 int l_max_col
; /* max column in the line */
101 void free_line(LINE
*l
);
102 void flush_line(LINE
*l
);
103 void flush_lines(int);
104 void flush_blanks(void);
105 void *xmalloc(void *p
, size_t size
);
106 LINE
*alloc_line(void);
108 CSET last_set
; /* char_set of last char printed */
110 int compress_spaces
; /* if doing space -> tab conversion */
111 int fine
; /* if `fine' resolution (half lines) */
112 int max_bufd_lines
; /* max # lines to keep in memory */
113 int nblank_lines
; /* # blanks after last flushed line */
114 int no_backspaces
; /* if not to output any backspaces */
117 if (putchar(ch) == EOF) \
120 int main(int argc
, char **argv
)
126 CSET cur_set
; /* current character set */
127 LINE
*l
; /* current line */
128 int extra_lines
; /* # of lines above first line */
129 int cur_col
; /* current column */
130 int cur_line
; /* line number of current position */
131 int max_line
; /* max value of cur_line */
132 int this_line
; /* line l points to */
133 int nflushd_lines
; /* number of lines that were flushed */
134 int adjust
, opt
, warned
;
136 /* we discard characters that do not pass isgraph() */
137 setlocale(LC_CTYPE
, "");
139 max_bufd_lines
= 128;
140 compress_spaces
= 1; /* compress spaces into tabs */
141 while ((opt
= getopt(argc
, argv
, "bfhl:x")) != EOF
)
143 case 'b': /* do not output backspaces */
146 case 'f': /* allow half forward line feeds */
149 case 'h': /* compress spaces into tabs */
152 case 'l': /* buffered line count */
153 if ((max_bufd_lines
= atoi(optarg
)) <= 0) {
154 (void)fprintf(stderr
,
155 "col: bad -l argument %s.\n", optarg
);
159 case 'x': /* do not compress spaces into tabs */
170 /* this value is in half lines */
173 adjust
= cur_col
= extra_lines
= warned
= 0;
174 cur_line
= max_line
= nflushd_lines
= this_line
= 0;
175 cur_set
= last_set
= CS_NORMAL
;
176 lines
= l
= alloc_line();
178 while ((ch
= getchar()) != EOF
) {
181 case BS
: /* can't go back further */
189 case ESC
: /* just ignore EOF */
199 if (cur_line
> max_line
)
205 if (cur_line
> max_line
)
216 cur_set
= CS_ALTERNATE
;
218 case TAB
: /* adjust column */
229 /* Must stuff ch in a line - are we at the right one? */
230 if (cur_line
!= this_line
- adjust
) {
235 nmove
= cur_line
- this_line
;
237 /* round up to next line */
244 for (; nmove
< 0 && l
->l_prev
; nmove
++)
247 if (nflushd_lines
== 0) {
249 * Allow backup past first
250 * line if nothing has been
253 for (; nmove
< 0; nmove
++) {
267 /* may need to allocate here */
268 for (; nmove
> 0 && l
->l_next
; nmove
--)
270 for (; nmove
> 0; nmove
--) {
277 this_line
= cur_line
+ adjust
;
278 nmove
= this_line
- nflushd_lines
;
279 if (nmove
>= max_bufd_lines
+ BUFFER_MARGIN
) {
280 nflushd_lines
+= nmove
- max_bufd_lines
;
281 flush_lines(nmove
- max_bufd_lines
);
284 /* grow line's buffer? */
285 if (l
->l_line_len
+ 1 >= l
->l_lsize
) {
288 need
= l
->l_lsize
? l
->l_lsize
* 2 : 90;
289 l
->l_line
= (CHAR
*)xmalloc((void *) l
->l_line
,
290 (unsigned) need
* sizeof(CHAR
));
293 c
= &l
->l_line
[l
->l_line_len
++];
296 c
->c_column
= cur_col
;
298 * If things are put in out of order, they will need sorting
299 * when it is flushed.
301 if (cur_col
< l
->l_max_col
)
304 l
->l_max_col
= cur_col
;
307 /* goto the last line that had a character on it */
308 for (; l
->l_next
; l
= l
->l_next
)
310 flush_lines(this_line
- nflushd_lines
+ extra_lines
+ 1);
312 /* make sure we leave things in a sane state */
313 if (last_set
!= CS_NORMAL
)
316 /* flush out the last few blank lines */
317 nblank_lines
= max_line
- this_line
;
320 else if (!nblank_lines
)
321 /* missing a \n on the last line? */
327 void flush_lines(int nflush
)
331 while (--nflush
>= 0) {
340 (void)free((void *)l
->l_line
);
344 lines
->l_prev
= NULL
;
348 * Print a number of newline/half newlines. If fine flag is set, nblank_lines
349 * is the number of half line feeds, otherwise it is the number of whole line
365 for (i
= nb
; --i
>= 0;)
377 * Write a line to stdout taking care of space to tab conversion (-h flag)
378 * and character set shifts.
380 void flush_line(LINE
*l
)
383 int nchars
, last_col
, this_col
;
386 nchars
= l
->l_line_len
;
388 if (l
->l_needs_sort
) {
390 static int count_size
, *count
, i
, save
, sorted_size
, tot
;
393 * Do an O(n) sort on l->l_line by column being careful to
394 * preserve the order of characters in the same column.
396 if (l
->l_lsize
> sorted_size
) {
397 sorted_size
= l
->l_lsize
;
398 sorted
= (CHAR
*)xmalloc((void *)sorted
,
399 (unsigned)sizeof(CHAR
) * sorted_size
);
401 if (l
->l_max_col
>= count_size
) {
402 count_size
= l
->l_max_col
+ 1;
403 count
= (int *)xmalloc((void *)count
,
404 (unsigned)sizeof(int) * count_size
);
406 bzero((char *)count
, sizeof(int) * l
->l_max_col
+ 1);
407 for (i
= nchars
, c
= l
->l_line
; --i
>= 0; c
++)
408 count
[c
->c_column
]++;
411 * calculate running total (shifted down by 1) to use as
412 * indices into new line.
414 for (tot
= 0, i
= 0; i
<= l
->l_max_col
; i
++) {
420 for (i
= nchars
, c
= l
->l_line
; --i
>= 0; c
++)
421 sorted
[count
[c
->c_column
]++] = *c
;
426 this_col
= c
->c_column
;
430 } while (--nchars
> 0 && this_col
== endc
->c_column
);
432 /* if -b only print last character */
436 if (this_col
> last_col
) {
437 int nspace
= this_col
- last_col
;
439 if (compress_spaces
&& nspace
> 1) {
442 ntabs
= this_col
/ 8 - last_col
/ 8;
444 nspace
= this_col
& 7;
449 while (--nspace
>= 0)
456 if (c
->c_set
!= last_set
) {
476 static LINE
*line_freelist
;
484 if (!line_freelist
) {
485 l
= (LINE
*)xmalloc((void *)NULL
, sizeof(LINE
) * NALLOC
);
487 for (i
= 1; i
< NALLOC
; i
++, l
++)
492 line_freelist
= l
->l_next
;
494 bzero(l
, sizeof(LINE
));
498 void free_line(LINE
*l
)
500 l
->l_next
= line_freelist
;
505 xmalloc(void *p
, size_t size
)
507 if (!(p
= (void *)realloc(p
, size
))) {
508 (void)fprintf(stderr
, "col: %s.\n", strerror(ENOMEM
));
516 (void)fprintf(stderr
, "usage: col [-bfx] [-l nline]\n");
522 (void)fprintf(stderr
, "col: write error.\n");
528 (void)fprintf(stderr
,
529 "col: warning: can't back up %s.\n", line
< 0 ?
530 "past first line" : "-- line already flushed");