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