fold.c revision 1.8 1 1.8 mrg /* $NetBSD: fold.c,v 1.8 1997/10/20 10:20:52 mrg Exp $ */
2 1.6 jtc
3 1.1 cgd /*-
4 1.6 jtc * Copyright (c) 1990, 1993
5 1.6 jtc * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Kevin Ruddy.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.1 cgd * 3. All advertising materials mentioning features or use of this software
19 1.1 cgd * must display the following acknowledgement:
20 1.1 cgd * This product includes software developed by the University of
21 1.1 cgd * California, Berkeley and its contributors.
22 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
23 1.1 cgd * may be used to endorse or promote products derived from this software
24 1.1 cgd * without specific prior written permission.
25 1.1 cgd *
26 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 1.1 cgd * SUCH DAMAGE.
37 1.1 cgd */
38 1.1 cgd
39 1.7 lukem #include <sys/cdefs.h>
40 1.1 cgd #ifndef lint
41 1.7 lukem __COPYRIGHT("@(#) Copyright (c) 1990, 1993\n\
42 1.7 lukem The Regents of the University of California. All rights reserved.\n");
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #ifndef lint
46 1.6 jtc #if 0
47 1.6 jtc static char sccsid[] = "@(#)fold.c 8.1 (Berkeley) 6/6/93";
48 1.6 jtc #endif
49 1.8 mrg __RCSID("$NetBSD: fold.c,v 1.8 1997/10/20 10:20:52 mrg Exp $");
50 1.1 cgd #endif /* not lint */
51 1.1 cgd
52 1.1 cgd #include <stdio.h>
53 1.2 jtc #include <stdlib.h>
54 1.1 cgd #include <string.h>
55 1.5 jtc #include <unistd.h>
56 1.4 jtc #include <err.h>
57 1.1 cgd
58 1.1 cgd #define DEFLINEWIDTH 80
59 1.1 cgd
60 1.7 lukem int main __P((int, char **));
61 1.7 lukem static void fold __P((int));
62 1.7 lukem static int new_column_position __P((int, int));
63 1.7 lukem
64 1.2 jtc int count_bytes = 0;
65 1.2 jtc int split_words = 0;
66 1.2 jtc
67 1.2 jtc int
68 1.1 cgd main(argc, argv)
69 1.1 cgd int argc;
70 1.1 cgd char **argv;
71 1.1 cgd {
72 1.7 lukem int ch;
73 1.1 cgd int width;
74 1.1 cgd char *p;
75 1.1 cgd
76 1.1 cgd width = -1;
77 1.4 jtc while ((ch = getopt(argc, argv, "0123456789bsw:")) != -1)
78 1.1 cgd switch (ch) {
79 1.2 jtc case 'b':
80 1.2 jtc count_bytes = 1;
81 1.2 jtc break;
82 1.2 jtc case 's':
83 1.2 jtc split_words = 1;
84 1.2 jtc break;
85 1.1 cgd case 'w':
86 1.1 cgd if ((width = atoi(optarg)) <= 0) {
87 1.1 cgd (void)fprintf(stderr,
88 1.1 cgd "fold: illegal width value.\n");
89 1.1 cgd exit(1);
90 1.1 cgd }
91 1.1 cgd break;
92 1.1 cgd case '0': case '1': case '2': case '3': case '4':
93 1.1 cgd case '5': case '6': case '7': case '8': case '9':
94 1.1 cgd if (width == -1) {
95 1.1 cgd p = argv[optind - 1];
96 1.1 cgd if (p[0] == '-' && p[1] == ch && !p[2])
97 1.1 cgd width = atoi(++p);
98 1.1 cgd else
99 1.1 cgd width = atoi(argv[optind] + 1);
100 1.1 cgd }
101 1.1 cgd break;
102 1.1 cgd default:
103 1.1 cgd (void)fprintf(stderr,
104 1.4 jtc "usage: fold [-bs] [-w width] [file ...]\n");
105 1.1 cgd exit(1);
106 1.1 cgd }
107 1.1 cgd argv += optind;
108 1.1 cgd argc -= optind;
109 1.1 cgd
110 1.1 cgd if (width == -1)
111 1.1 cgd width = DEFLINEWIDTH;
112 1.2 jtc
113 1.1 cgd if (!*argv)
114 1.1 cgd fold(width);
115 1.1 cgd else for (; *argv; ++argv)
116 1.1 cgd if (!freopen(*argv, "r", stdin)) {
117 1.4 jtc err (1, "%s", *argv);
118 1.4 jtc /* NOTREACHED */
119 1.1 cgd } else
120 1.1 cgd fold(width);
121 1.1 cgd exit(0);
122 1.1 cgd }
123 1.1 cgd
124 1.2 jtc /*
125 1.2 jtc * Fold the contents of standard input to fit within WIDTH columns
126 1.2 jtc * (or bytes) and write to standard output.
127 1.2 jtc *
128 1.2 jtc * If split_words is set, split the line at the last space character
129 1.2 jtc * on the line. This flag necessitates storing the line in a buffer
130 1.2 jtc * until the current column > width, or a newline or EOF is read.
131 1.2 jtc *
132 1.2 jtc * The buffer can grow larger than WIDTH due to backspaces and carriage
133 1.2 jtc * returns embedded in the input stream.
134 1.2 jtc */
135 1.2 jtc static void
136 1.1 cgd fold(width)
137 1.7 lukem int width;
138 1.1 cgd {
139 1.2 jtc static char *buf = NULL;
140 1.2 jtc static int buf_max = 0;
141 1.7 lukem int ch, col;
142 1.7 lukem int indx;
143 1.2 jtc
144 1.2 jtc col = indx = 0;
145 1.2 jtc while ((ch = getchar()) != EOF) {
146 1.2 jtc if (ch == '\n') {
147 1.2 jtc if (indx != 0)
148 1.2 jtc fwrite (buf, 1, indx, stdout);
149 1.2 jtc putchar('\n');
150 1.2 jtc col = indx = 0;
151 1.2 jtc continue;
152 1.2 jtc }
153 1.2 jtc
154 1.2 jtc col = new_column_position (col, ch);
155 1.2 jtc if (col > width) {
156 1.2 jtc int i, last_space;
157 1.2 jtc
158 1.8 mrg #ifdef __GNUC__
159 1.8 mrg last_space = 0; /* XXX gcc */
160 1.8 mrg #endif
161 1.2 jtc if (split_words) {
162 1.2 jtc for (i = 0, last_space = -1; i < indx; i++)
163 1.8 mrg if (buf[i] == ' ')
164 1.8 mrg last_space = i;
165 1.2 jtc }
166 1.1 cgd
167 1.2 jtc if (split_words && last_space != -1) {
168 1.2 jtc last_space++;
169 1.2 jtc
170 1.2 jtc fwrite (buf, 1, last_space, stdout);
171 1.2 jtc memmove (buf, buf+last_space, indx-last_space);
172 1.2 jtc
173 1.2 jtc indx -= last_space;
174 1.2 jtc col = 0;
175 1.2 jtc for (i = 0; i < indx; i++) {
176 1.2 jtc col = new_column_position (col, ch);
177 1.2 jtc }
178 1.2 jtc } else {
179 1.2 jtc fwrite (buf, 1, indx, stdout);
180 1.2 jtc col = indx = 0;
181 1.2 jtc }
182 1.2 jtc putchar('\n');
183 1.2 jtc
184 1.2 jtc /* calculate the column position for the next line. */
185 1.2 jtc col = new_column_position (col, ch);
186 1.1 cgd }
187 1.1 cgd
188 1.2 jtc if (indx + 1 > buf_max) {
189 1.2 jtc /* Allocate buffer in LINE_MAX increments */
190 1.2 jtc buf_max += 2048;
191 1.2 jtc if((buf = realloc (buf, buf_max)) == NULL) {
192 1.7 lukem err (1, "realloc");
193 1.4 jtc /* NOTREACHED */
194 1.2 jtc }
195 1.1 cgd }
196 1.2 jtc buf[indx++] = ch;
197 1.2 jtc }
198 1.2 jtc
199 1.2 jtc if (indx != 0)
200 1.2 jtc fwrite (buf, 1, indx, stdout);
201 1.2 jtc }
202 1.1 cgd
203 1.2 jtc /*
204 1.2 jtc * calculate the column position
205 1.2 jtc */
206 1.2 jtc static int
207 1.2 jtc new_column_position (col, ch)
208 1.2 jtc int col;
209 1.2 jtc int ch;
210 1.2 jtc {
211 1.2 jtc if (!count_bytes) {
212 1.1 cgd switch (ch) {
213 1.1 cgd case '\b':
214 1.1 cgd if (col > 0)
215 1.1 cgd --col;
216 1.1 cgd break;
217 1.1 cgd case '\r':
218 1.1 cgd col = 0;
219 1.1 cgd break;
220 1.1 cgd case '\t':
221 1.2 jtc col = (col + 8) & ~7;
222 1.1 cgd break;
223 1.1 cgd default:
224 1.1 cgd ++col;
225 1.1 cgd break;
226 1.1 cgd }
227 1.2 jtc } else {
228 1.2 jtc ++col;
229 1.1 cgd }
230 1.2 jtc
231 1.2 jtc return col;
232 1.1 cgd }
233