fmt.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1980 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd char copyright[] =
36 1.1 cgd "@(#) Copyright (c) 1980 Regents of the University of California.\n\
37 1.1 cgd All rights reserved.\n";
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.1 cgd #ifndef lint
41 1.1 cgd static char sccsid[] = "@(#)fmt.c 5.10 (Berkeley) 6/1/90";
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd #include <stdio.h>
45 1.1 cgd #include <ctype.h>
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd * fmt -- format the concatenation of input files or standard input
49 1.1 cgd * onto standard output. Designed for use with Mail ~|
50 1.1 cgd *
51 1.1 cgd * Syntax : fmt [ goal [ max ] ] [ name ... ]
52 1.1 cgd * Authors: Kurt Shoens (UCB) 12/7/78;
53 1.1 cgd * Liz Allen (UMCP) 2/24/83 [Addition of goal length concept].
54 1.1 cgd */
55 1.1 cgd
56 1.1 cgd /* LIZ@UOM 6/18/85 -- Don't need LENGTH any more.
57 1.1 cgd * #define LENGTH 72 Max line length in output
58 1.1 cgd */
59 1.1 cgd #define NOSTR ((char *) 0) /* Null string pointer for lint */
60 1.1 cgd
61 1.1 cgd /* LIZ@UOM 6/18/85 --New variables goal_length and max_length */
62 1.1 cgd #define GOAL_LENGTH 65
63 1.1 cgd #define MAX_LENGTH 75
64 1.1 cgd int goal_length; /* Target or goal line length in output */
65 1.1 cgd int max_length; /* Max line length in output */
66 1.1 cgd int pfx; /* Current leading blank count */
67 1.1 cgd int lineno; /* Current input line */
68 1.1 cgd int mark; /* Last place we saw a head line */
69 1.1 cgd
70 1.1 cgd char *malloc(); /* for lint . . . */
71 1.1 cgd char *headnames[] = {"To", "Subject", "Cc", 0};
72 1.1 cgd
73 1.1 cgd /*
74 1.1 cgd * Drive the whole formatter by managing input files. Also,
75 1.1 cgd * cause initialization of the output stuff and flush it out
76 1.1 cgd * at the end.
77 1.1 cgd */
78 1.1 cgd
79 1.1 cgd main(argc, argv)
80 1.1 cgd int argc;
81 1.1 cgd char **argv;
82 1.1 cgd {
83 1.1 cgd register FILE *fi;
84 1.1 cgd register int errs = 0;
85 1.1 cgd int number; /* LIZ@UOM 6/18/85 */
86 1.1 cgd
87 1.1 cgd goal_length = GOAL_LENGTH;
88 1.1 cgd max_length = MAX_LENGTH;
89 1.1 cgd setout();
90 1.1 cgd lineno = 1;
91 1.1 cgd mark = -10;
92 1.1 cgd /*
93 1.1 cgd * LIZ@UOM 6/18/85 -- Check for goal and max length arguments
94 1.1 cgd */
95 1.1 cgd if (argc > 1 && (1 == (sscanf(argv[1], "%d", &number)))) {
96 1.1 cgd argv++;
97 1.1 cgd argc--;
98 1.1 cgd goal_length = number;
99 1.1 cgd if (argc > 1 && (1 == (sscanf(argv[1], "%d", &number)))) {
100 1.1 cgd argv++;
101 1.1 cgd argc--;
102 1.1 cgd max_length = number;
103 1.1 cgd }
104 1.1 cgd }
105 1.1 cgd if (max_length <= goal_length) {
106 1.1 cgd fprintf(stderr, "Max length must be greater than %s\n",
107 1.1 cgd "goal length");
108 1.1 cgd exit(1);
109 1.1 cgd }
110 1.1 cgd if (argc < 2) {
111 1.1 cgd fmt(stdin);
112 1.1 cgd oflush();
113 1.1 cgd exit(0);
114 1.1 cgd }
115 1.1 cgd while (--argc) {
116 1.1 cgd if ((fi = fopen(*++argv, "r")) == NULL) {
117 1.1 cgd perror(*argv);
118 1.1 cgd errs++;
119 1.1 cgd continue;
120 1.1 cgd }
121 1.1 cgd fmt(fi);
122 1.1 cgd fclose(fi);
123 1.1 cgd }
124 1.1 cgd oflush();
125 1.1 cgd exit(errs);
126 1.1 cgd }
127 1.1 cgd
128 1.1 cgd /*
129 1.1 cgd * Read up characters from the passed input file, forming lines,
130 1.1 cgd * doing ^H processing, expanding tabs, stripping trailing blanks,
131 1.1 cgd * and sending each line down for analysis.
132 1.1 cgd */
133 1.1 cgd fmt(fi)
134 1.1 cgd FILE *fi;
135 1.1 cgd {
136 1.1 cgd char linebuf[BUFSIZ], canonb[BUFSIZ];
137 1.1 cgd register char *cp, *cp2;
138 1.1 cgd register int c, col;
139 1.1 cgd
140 1.1 cgd c = getc(fi);
141 1.1 cgd while (c != EOF) {
142 1.1 cgd /*
143 1.1 cgd * Collect a line, doing ^H processing.
144 1.1 cgd * Leave tabs for now.
145 1.1 cgd */
146 1.1 cgd cp = linebuf;
147 1.1 cgd while (c != '\n' && c != EOF && cp-linebuf < BUFSIZ-1) {
148 1.1 cgd if (c == '\b') {
149 1.1 cgd if (cp > linebuf)
150 1.1 cgd cp--;
151 1.1 cgd c = getc(fi);
152 1.1 cgd continue;
153 1.1 cgd }
154 1.1 cgd if ((c < ' ' || c >= 0177) && c != '\t') {
155 1.1 cgd c = getc(fi);
156 1.1 cgd continue;
157 1.1 cgd }
158 1.1 cgd *cp++ = c;
159 1.1 cgd c = getc(fi);
160 1.1 cgd }
161 1.1 cgd *cp = '\0';
162 1.1 cgd
163 1.1 cgd /*
164 1.1 cgd * Toss anything remaining on the input line.
165 1.1 cgd */
166 1.1 cgd while (c != '\n' && c != EOF)
167 1.1 cgd c = getc(fi);
168 1.1 cgd
169 1.1 cgd /*
170 1.1 cgd * Expand tabs on the way to canonb.
171 1.1 cgd */
172 1.1 cgd col = 0;
173 1.1 cgd cp = linebuf;
174 1.1 cgd cp2 = canonb;
175 1.1 cgd while (c = *cp++) {
176 1.1 cgd if (c != '\t') {
177 1.1 cgd col++;
178 1.1 cgd if (cp2-canonb < BUFSIZ-1)
179 1.1 cgd *cp2++ = c;
180 1.1 cgd continue;
181 1.1 cgd }
182 1.1 cgd do {
183 1.1 cgd if (cp2-canonb < BUFSIZ-1)
184 1.1 cgd *cp2++ = ' ';
185 1.1 cgd col++;
186 1.1 cgd } while ((col & 07) != 0);
187 1.1 cgd }
188 1.1 cgd
189 1.1 cgd /*
190 1.1 cgd * Swipe trailing blanks from the line.
191 1.1 cgd */
192 1.1 cgd for (cp2--; cp2 >= canonb && *cp2 == ' '; cp2--)
193 1.1 cgd ;
194 1.1 cgd *++cp2 = '\0';
195 1.1 cgd prefix(canonb);
196 1.1 cgd if (c != EOF)
197 1.1 cgd c = getc(fi);
198 1.1 cgd }
199 1.1 cgd }
200 1.1 cgd
201 1.1 cgd /*
202 1.1 cgd * Take a line devoid of tabs and other garbage and determine its
203 1.1 cgd * blank prefix. If the indent changes, call for a linebreak.
204 1.1 cgd * If the input line is blank, echo the blank line on the output.
205 1.1 cgd * Finally, if the line minus the prefix is a mail header, try to keep
206 1.1 cgd * it on a line by itself.
207 1.1 cgd */
208 1.1 cgd prefix(line)
209 1.1 cgd char line[];
210 1.1 cgd {
211 1.1 cgd register char *cp, **hp;
212 1.1 cgd register int np, h;
213 1.1 cgd
214 1.1 cgd if (strlen(line) == 0) {
215 1.1 cgd oflush();
216 1.1 cgd putchar('\n');
217 1.1 cgd return;
218 1.1 cgd }
219 1.1 cgd for (cp = line; *cp == ' '; cp++)
220 1.1 cgd ;
221 1.1 cgd np = cp - line;
222 1.1 cgd
223 1.1 cgd /*
224 1.1 cgd * The following horrible expression attempts to avoid linebreaks
225 1.1 cgd * when the indent changes due to a paragraph.
226 1.1 cgd */
227 1.1 cgd if (np != pfx && (np > pfx || abs(pfx-np) > 8))
228 1.1 cgd oflush();
229 1.1 cgd if (h = ishead(cp))
230 1.1 cgd oflush(), mark = lineno;
231 1.1 cgd if (lineno - mark < 3 && lineno - mark > 0)
232 1.1 cgd for (hp = &headnames[0]; *hp != (char *) 0; hp++)
233 1.1 cgd if (ispref(*hp, cp)) {
234 1.1 cgd h = 1;
235 1.1 cgd oflush();
236 1.1 cgd break;
237 1.1 cgd }
238 1.1 cgd if (!h && (h = (*cp == '.')))
239 1.1 cgd oflush();
240 1.1 cgd pfx = np;
241 1.1 cgd if (h)
242 1.1 cgd pack(cp);
243 1.1 cgd else split(cp);
244 1.1 cgd if (h)
245 1.1 cgd oflush();
246 1.1 cgd lineno++;
247 1.1 cgd }
248 1.1 cgd
249 1.1 cgd /*
250 1.1 cgd * Split up the passed line into output "words" which are
251 1.1 cgd * maximal strings of non-blanks with the blank separation
252 1.1 cgd * attached at the end. Pass these words along to the output
253 1.1 cgd * line packer.
254 1.1 cgd */
255 1.1 cgd split(line)
256 1.1 cgd char line[];
257 1.1 cgd {
258 1.1 cgd register char *cp, *cp2;
259 1.1 cgd char word[BUFSIZ];
260 1.1 cgd int wordl; /* LIZ@UOM 6/18/85 */
261 1.1 cgd
262 1.1 cgd cp = line;
263 1.1 cgd while (*cp) {
264 1.1 cgd cp2 = word;
265 1.1 cgd wordl = 0; /* LIZ@UOM 6/18/85 */
266 1.1 cgd
267 1.1 cgd /*
268 1.1 cgd * Collect a 'word,' allowing it to contain escaped white
269 1.1 cgd * space.
270 1.1 cgd */
271 1.1 cgd while (*cp && *cp != ' ') {
272 1.1 cgd if (*cp == '\\' && isspace(cp[1]))
273 1.1 cgd *cp2++ = *cp++;
274 1.1 cgd *cp2++ = *cp++;
275 1.1 cgd wordl++;/* LIZ@UOM 6/18/85 */
276 1.1 cgd }
277 1.1 cgd
278 1.1 cgd /*
279 1.1 cgd * Guarantee a space at end of line. Two spaces after end of
280 1.1 cgd * sentence punctuation.
281 1.1 cgd */
282 1.1 cgd if (*cp == '\0') {
283 1.1 cgd *cp2++ = ' ';
284 1.1 cgd if (index(".:!", cp[-1]))
285 1.1 cgd *cp2++ = ' ';
286 1.1 cgd }
287 1.1 cgd while (*cp == ' ')
288 1.1 cgd *cp2++ = *cp++;
289 1.1 cgd *cp2 = '\0';
290 1.1 cgd /*
291 1.1 cgd * LIZ@UOM 6/18/85 pack(word);
292 1.1 cgd */
293 1.1 cgd pack(word, wordl);
294 1.1 cgd }
295 1.1 cgd }
296 1.1 cgd
297 1.1 cgd /*
298 1.1 cgd * Output section.
299 1.1 cgd * Build up line images from the words passed in. Prefix
300 1.1 cgd * each line with correct number of blanks. The buffer "outbuf"
301 1.1 cgd * contains the current partial line image, including prefixed blanks.
302 1.1 cgd * "outp" points to the next available space therein. When outp is NOSTR,
303 1.1 cgd * there ain't nothing in there yet. At the bottom of this whole mess,
304 1.1 cgd * leading tabs are reinserted.
305 1.1 cgd */
306 1.1 cgd char outbuf[BUFSIZ]; /* Sandbagged output line image */
307 1.1 cgd char *outp; /* Pointer in above */
308 1.1 cgd
309 1.1 cgd /*
310 1.1 cgd * Initialize the output section.
311 1.1 cgd */
312 1.1 cgd setout()
313 1.1 cgd {
314 1.1 cgd outp = NOSTR;
315 1.1 cgd }
316 1.1 cgd
317 1.1 cgd /*
318 1.1 cgd * Pack a word onto the output line. If this is the beginning of
319 1.1 cgd * the line, push on the appropriately-sized string of blanks first.
320 1.1 cgd * If the word won't fit on the current line, flush and begin a new
321 1.1 cgd * line. If the word is too long to fit all by itself on a line,
322 1.1 cgd * just give it its own and hope for the best.
323 1.1 cgd *
324 1.1 cgd * LIZ@UOM 6/18/85 -- If the new word will fit in at less than the
325 1.1 cgd * goal length, take it. If not, then check to see if the line
326 1.1 cgd * will be over the max length; if so put the word on the next
327 1.1 cgd * line. If not, check to see if the line will be closer to the
328 1.1 cgd * goal length with or without the word and take it or put it on
329 1.1 cgd * the next line accordingly.
330 1.1 cgd */
331 1.1 cgd
332 1.1 cgd /*
333 1.1 cgd * LIZ@UOM 6/18/85 -- pass in the length of the word as well
334 1.1 cgd * pack(word)
335 1.1 cgd * char word[];
336 1.1 cgd */
337 1.1 cgd pack(word,wl)
338 1.1 cgd char word[];
339 1.1 cgd int wl;
340 1.1 cgd {
341 1.1 cgd register char *cp;
342 1.1 cgd register int s, t;
343 1.1 cgd
344 1.1 cgd if (outp == NOSTR)
345 1.1 cgd leadin();
346 1.1 cgd /*
347 1.1 cgd * LIZ@UOM 6/18/85 -- change condition to check goal_length; s is the
348 1.1 cgd * length of the line before the word is added; t is now the length
349 1.1 cgd * of the line after the word is added
350 1.1 cgd * t = strlen(word);
351 1.1 cgd * if (t+s <= LENGTH)
352 1.1 cgd */
353 1.1 cgd s = outp - outbuf;
354 1.1 cgd t = wl + s;
355 1.1 cgd if ((t <= goal_length) ||
356 1.1 cgd ((t <= max_length) && (t - goal_length <= goal_length - s))) {
357 1.1 cgd /*
358 1.1 cgd * In like flint!
359 1.1 cgd */
360 1.1 cgd for (cp = word; *cp; *outp++ = *cp++);
361 1.1 cgd return;
362 1.1 cgd }
363 1.1 cgd if (s > pfx) {
364 1.1 cgd oflush();
365 1.1 cgd leadin();
366 1.1 cgd }
367 1.1 cgd for (cp = word; *cp; *outp++ = *cp++);
368 1.1 cgd }
369 1.1 cgd
370 1.1 cgd /*
371 1.1 cgd * If there is anything on the current output line, send it on
372 1.1 cgd * its way. Set outp to NOSTR to indicate the absence of the current
373 1.1 cgd * line prefix.
374 1.1 cgd */
375 1.1 cgd oflush()
376 1.1 cgd {
377 1.1 cgd if (outp == NOSTR)
378 1.1 cgd return;
379 1.1 cgd *outp = '\0';
380 1.1 cgd tabulate(outbuf);
381 1.1 cgd outp = NOSTR;
382 1.1 cgd }
383 1.1 cgd
384 1.1 cgd /*
385 1.1 cgd * Take the passed line buffer, insert leading tabs where possible, and
386 1.1 cgd * output on standard output (finally).
387 1.1 cgd */
388 1.1 cgd tabulate(line)
389 1.1 cgd char line[];
390 1.1 cgd {
391 1.1 cgd register char *cp;
392 1.1 cgd register int b, t;
393 1.1 cgd
394 1.1 cgd /*
395 1.1 cgd * Toss trailing blanks in the output line.
396 1.1 cgd */
397 1.1 cgd cp = line + strlen(line) - 1;
398 1.1 cgd while (cp >= line && *cp == ' ')
399 1.1 cgd cp--;
400 1.1 cgd *++cp = '\0';
401 1.1 cgd
402 1.1 cgd /*
403 1.1 cgd * Count the leading blank space and tabulate.
404 1.1 cgd */
405 1.1 cgd for (cp = line; *cp == ' '; cp++)
406 1.1 cgd ;
407 1.1 cgd b = cp-line;
408 1.1 cgd t = b >> 3;
409 1.1 cgd b &= 07;
410 1.1 cgd if (t > 0)
411 1.1 cgd do
412 1.1 cgd putc('\t', stdout);
413 1.1 cgd while (--t);
414 1.1 cgd if (b > 0)
415 1.1 cgd do
416 1.1 cgd putc(' ', stdout);
417 1.1 cgd while (--b);
418 1.1 cgd while (*cp)
419 1.1 cgd putc(*cp++, stdout);
420 1.1 cgd putc('\n', stdout);
421 1.1 cgd }
422 1.1 cgd
423 1.1 cgd /*
424 1.1 cgd * Initialize the output line with the appropriate number of
425 1.1 cgd * leading blanks.
426 1.1 cgd */
427 1.1 cgd leadin()
428 1.1 cgd {
429 1.1 cgd register int b;
430 1.1 cgd register char *cp;
431 1.1 cgd
432 1.1 cgd for (b = 0, cp = outbuf; b < pfx; b++)
433 1.1 cgd *cp++ = ' ';
434 1.1 cgd outp = cp;
435 1.1 cgd }
436 1.1 cgd
437 1.1 cgd /*
438 1.1 cgd * Save a string in dynamic space.
439 1.1 cgd * This little goodie is needed for
440 1.1 cgd * a headline detector in head.c
441 1.1 cgd */
442 1.1 cgd char *
443 1.1 cgd savestr(str)
444 1.1 cgd char str[];
445 1.1 cgd {
446 1.1 cgd register char *top;
447 1.1 cgd
448 1.1 cgd top = malloc(strlen(str) + 1);
449 1.1 cgd if (top == NOSTR) {
450 1.1 cgd fprintf(stderr, "fmt: Ran out of memory\n");
451 1.1 cgd exit(1);
452 1.1 cgd }
453 1.1 cgd strcpy(top, str);
454 1.1 cgd return (top);
455 1.1 cgd }
456 1.1 cgd
457 1.1 cgd /*
458 1.1 cgd * Is s1 a prefix of s2??
459 1.1 cgd */
460 1.1 cgd ispref(s1, s2)
461 1.1 cgd register char *s1, *s2;
462 1.1 cgd {
463 1.1 cgd
464 1.1 cgd while (*s1++ == *s2)
465 1.1 cgd ;
466 1.1 cgd return (*s1 == '\0');
467 1.1 cgd }
468