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