fmt.c revision 1.10 1 1.10 jdolecek /* $NetBSD: fmt.c,v 1.10 1999/11/02 12:50:04 jdolecek 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.10 jdolecek __RCSID("$NetBSD: fmt.c,v 1.10 1999/11/02 12:50:04 jdolecek 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.10 jdolecek static void fmt __P((FILE *));
81 1.10 jdolecek static int ispref __P((const char *, const char *));
82 1.10 jdolecek static void leadin __P((void));
83 1.10 jdolecek static void oflush __P((void));
84 1.10 jdolecek static void pack __P((const char *, int));
85 1.10 jdolecek static void prefix __P((const char *, int));
86 1.10 jdolecek static char *savestr __P((char *));
87 1.10 jdolecek static void setout __P((void));
88 1.10 jdolecek static void split __P((const char *, int));
89 1.10 jdolecek static void tabulate __P((char *));
90 1.10 jdolecek
91 1.10 jdolecek int ishead __P((const char *));
92 1.6 lukem int main __P((int, char **));
93 1.6 lukem
94 1.1 cgd /*
95 1.1 cgd * Drive the whole formatter by managing input files. Also,
96 1.1 cgd * cause initialization of the output stuff and flush it out
97 1.1 cgd * at the end.
98 1.1 cgd */
99 1.1 cgd
100 1.6 lukem int
101 1.1 cgd main(argc, argv)
102 1.1 cgd int argc;
103 1.1 cgd char **argv;
104 1.1 cgd {
105 1.6 lukem FILE *fi;
106 1.6 lukem int errs = 0;
107 1.1 cgd int number; /* LIZ@UOM 6/18/85 */
108 1.1 cgd
109 1.1 cgd goal_length = GOAL_LENGTH;
110 1.1 cgd max_length = MAX_LENGTH;
111 1.1 cgd setout();
112 1.1 cgd lineno = 1;
113 1.1 cgd mark = -10;
114 1.5 kleink
115 1.5 kleink setlocale(LC_ALL, "");
116 1.5 kleink
117 1.1 cgd /*
118 1.1 cgd * LIZ@UOM 6/18/85 -- Check for goal and max length arguments
119 1.1 cgd */
120 1.1 cgd if (argc > 1 && (1 == (sscanf(argv[1], "%d", &number)))) {
121 1.1 cgd argv++;
122 1.1 cgd argc--;
123 1.8 ross goal_length = abs(number);
124 1.1 cgd if (argc > 1 && (1 == (sscanf(argv[1], "%d", &number)))) {
125 1.1 cgd argv++;
126 1.1 cgd argc--;
127 1.8 ross max_length = abs(number);
128 1.1 cgd }
129 1.1 cgd }
130 1.1 cgd if (max_length <= goal_length) {
131 1.1 cgd fprintf(stderr, "Max length must be greater than %s\n",
132 1.1 cgd "goal length");
133 1.1 cgd exit(1);
134 1.1 cgd }
135 1.1 cgd if (argc < 2) {
136 1.1 cgd fmt(stdin);
137 1.1 cgd oflush();
138 1.1 cgd exit(0);
139 1.1 cgd }
140 1.1 cgd while (--argc) {
141 1.1 cgd if ((fi = fopen(*++argv, "r")) == NULL) {
142 1.1 cgd perror(*argv);
143 1.1 cgd errs++;
144 1.1 cgd continue;
145 1.1 cgd }
146 1.1 cgd fmt(fi);
147 1.1 cgd fclose(fi);
148 1.1 cgd }
149 1.1 cgd oflush();
150 1.1 cgd exit(errs);
151 1.1 cgd }
152 1.1 cgd
153 1.1 cgd /*
154 1.1 cgd * Read up characters from the passed input file, forming lines,
155 1.1 cgd * doing ^H processing, expanding tabs, stripping trailing blanks,
156 1.1 cgd * and sending each line down for analysis.
157 1.1 cgd */
158 1.10 jdolecek static void
159 1.1 cgd fmt(fi)
160 1.1 cgd FILE *fi;
161 1.1 cgd {
162 1.1 cgd char linebuf[BUFSIZ], canonb[BUFSIZ];
163 1.6 lukem char *cp, *cp2;
164 1.10 jdolecek int c, col, add_space;
165 1.1 cgd
166 1.1 cgd c = getc(fi);
167 1.1 cgd while (c != EOF) {
168 1.1 cgd /*
169 1.1 cgd * Collect a line, doing ^H processing.
170 1.1 cgd * Leave tabs for now.
171 1.1 cgd */
172 1.1 cgd cp = linebuf;
173 1.1 cgd while (c != '\n' && c != EOF && cp-linebuf < BUFSIZ-1) {
174 1.1 cgd if (c == '\b') {
175 1.1 cgd if (cp > linebuf)
176 1.1 cgd cp--;
177 1.1 cgd c = getc(fi);
178 1.1 cgd continue;
179 1.1 cgd }
180 1.5 kleink if(!(isprint(c) || c == '\t')) {
181 1.1 cgd c = getc(fi);
182 1.1 cgd continue;
183 1.1 cgd }
184 1.1 cgd *cp++ = c;
185 1.1 cgd c = getc(fi);
186 1.1 cgd }
187 1.1 cgd *cp = '\0';
188 1.1 cgd
189 1.1 cgd /*
190 1.10 jdolecek * By default, add space after the end of current input
191 1.10 jdolecek * (normally end of line)
192 1.10 jdolecek */
193 1.10 jdolecek add_space = 1;
194 1.10 jdolecek
195 1.10 jdolecek /*
196 1.10 jdolecek * If the input line is longer than linebuf buffer can hold,
197 1.10 jdolecek * process the data read so far as if it was a separate line -
198 1.10 jdolecek * if there is any whitespace character in the read data,
199 1.10 jdolecek * process all the data up to it, otherwise process all.
200 1.1 cgd */
201 1.10 jdolecek if (c != '\n' && c != EOF && !isspace(c)) {
202 1.10 jdolecek /*
203 1.10 jdolecek * Find out if any whitespace character has been read.
204 1.10 jdolecek */
205 1.10 jdolecek for(cp2 = cp; cp2 >= linebuf
206 1.10 jdolecek && !isspace((unsigned char)*cp2); cp2--);
207 1.10 jdolecek
208 1.10 jdolecek if (cp2 < linebuf) {
209 1.10 jdolecek /*
210 1.10 jdolecek * ungetc() last read character so that it
211 1.10 jdolecek * won't get lost.
212 1.10 jdolecek */
213 1.10 jdolecek ungetc(c, fi);
214 1.10 jdolecek /*
215 1.10 jdolecek * Don't append space on the end in split().
216 1.10 jdolecek */
217 1.10 jdolecek add_space = 0;
218 1.10 jdolecek } else {
219 1.10 jdolecek /*
220 1.10 jdolecek * To avoid splitting a word in a middle,
221 1.10 jdolecek * ungetc() all characters after last
222 1.10 jdolecek * whitespace char.
223 1.10 jdolecek */
224 1.10 jdolecek while (!isspace(c) && (cp >= linebuf)) {
225 1.10 jdolecek ungetc(c, fi);
226 1.10 jdolecek c = *--cp;
227 1.10 jdolecek }
228 1.10 jdolecek *cp = '\0';
229 1.10 jdolecek }
230 1.10 jdolecek }
231 1.1 cgd
232 1.1 cgd /*
233 1.1 cgd * Expand tabs on the way to canonb.
234 1.1 cgd */
235 1.1 cgd col = 0;
236 1.1 cgd cp = linebuf;
237 1.1 cgd cp2 = canonb;
238 1.6 lukem while ((c = *cp++) != 0) {
239 1.1 cgd if (c != '\t') {
240 1.1 cgd col++;
241 1.1 cgd if (cp2-canonb < BUFSIZ-1)
242 1.1 cgd *cp2++ = c;
243 1.1 cgd continue;
244 1.1 cgd }
245 1.1 cgd do {
246 1.1 cgd if (cp2-canonb < BUFSIZ-1)
247 1.1 cgd *cp2++ = ' ';
248 1.1 cgd col++;
249 1.1 cgd } while ((col & 07) != 0);
250 1.1 cgd }
251 1.1 cgd
252 1.1 cgd /*
253 1.1 cgd * Swipe trailing blanks from the line.
254 1.1 cgd */
255 1.1 cgd for (cp2--; cp2 >= canonb && *cp2 == ' '; cp2--)
256 1.1 cgd ;
257 1.1 cgd *++cp2 = '\0';
258 1.10 jdolecek prefix(canonb, add_space);
259 1.1 cgd if (c != EOF)
260 1.1 cgd c = getc(fi);
261 1.1 cgd }
262 1.1 cgd }
263 1.1 cgd
264 1.1 cgd /*
265 1.1 cgd * Take a line devoid of tabs and other garbage and determine its
266 1.1 cgd * blank prefix. If the indent changes, call for a linebreak.
267 1.1 cgd * If the input line is blank, echo the blank line on the output.
268 1.1 cgd * Finally, if the line minus the prefix is a mail header, try to keep
269 1.1 cgd * it on a line by itself.
270 1.1 cgd */
271 1.10 jdolecek static void
272 1.10 jdolecek prefix(line, add_space)
273 1.10 jdolecek const char line[];
274 1.10 jdolecek int add_space;
275 1.1 cgd {
276 1.10 jdolecek const char *cp;
277 1.10 jdolecek char **hp;
278 1.6 lukem int np, h;
279 1.1 cgd
280 1.1 cgd if (strlen(line) == 0) {
281 1.1 cgd oflush();
282 1.1 cgd putchar('\n');
283 1.1 cgd return;
284 1.1 cgd }
285 1.1 cgd for (cp = line; *cp == ' '; cp++)
286 1.1 cgd ;
287 1.1 cgd np = cp - line;
288 1.1 cgd
289 1.1 cgd /*
290 1.1 cgd * The following horrible expression attempts to avoid linebreaks
291 1.1 cgd * when the indent changes due to a paragraph.
292 1.1 cgd */
293 1.1 cgd if (np != pfx && (np > pfx || abs(pfx-np) > 8))
294 1.1 cgd oflush();
295 1.6 lukem if ((h = ishead(cp)) != 0)
296 1.1 cgd oflush(), mark = lineno;
297 1.1 cgd if (lineno - mark < 3 && lineno - mark > 0)
298 1.1 cgd for (hp = &headnames[0]; *hp != (char *) 0; hp++)
299 1.1 cgd if (ispref(*hp, cp)) {
300 1.1 cgd h = 1;
301 1.1 cgd oflush();
302 1.1 cgd break;
303 1.1 cgd }
304 1.1 cgd if (!h && (h = (*cp == '.')))
305 1.1 cgd oflush();
306 1.1 cgd pfx = np;
307 1.10 jdolecek if (h) {
308 1.4 jtc pack(cp, strlen(cp));
309 1.1 cgd oflush();
310 1.10 jdolecek } else
311 1.10 jdolecek split(cp, add_space);
312 1.1 cgd lineno++;
313 1.1 cgd }
314 1.1 cgd
315 1.1 cgd /*
316 1.1 cgd * Split up the passed line into output "words" which are
317 1.1 cgd * maximal strings of non-blanks with the blank separation
318 1.1 cgd * attached at the end. Pass these words along to the output
319 1.1 cgd * line packer.
320 1.1 cgd */
321 1.10 jdolecek static void
322 1.10 jdolecek split(line, add_space)
323 1.10 jdolecek const char line[];
324 1.10 jdolecek int add_space;
325 1.1 cgd {
326 1.10 jdolecek const char *cp;
327 1.10 jdolecek char *cp2;
328 1.1 cgd char word[BUFSIZ];
329 1.1 cgd int wordl; /* LIZ@UOM 6/18/85 */
330 1.1 cgd
331 1.1 cgd cp = line;
332 1.1 cgd while (*cp) {
333 1.1 cgd cp2 = word;
334 1.1 cgd wordl = 0; /* LIZ@UOM 6/18/85 */
335 1.1 cgd
336 1.1 cgd /*
337 1.1 cgd * Collect a 'word,' allowing it to contain escaped white
338 1.1 cgd * space.
339 1.1 cgd */
340 1.1 cgd while (*cp && *cp != ' ') {
341 1.9 christos if (*cp == '\\' && isspace((unsigned char)cp[1]))
342 1.1 cgd *cp2++ = *cp++;
343 1.1 cgd *cp2++ = *cp++;
344 1.1 cgd wordl++;/* LIZ@UOM 6/18/85 */
345 1.1 cgd }
346 1.1 cgd
347 1.1 cgd /*
348 1.1 cgd * Guarantee a space at end of line. Two spaces after end of
349 1.1 cgd * sentence punctuation.
350 1.1 cgd */
351 1.10 jdolecek if (*cp == '\0' && add_space) {
352 1.1 cgd *cp2++ = ' ';
353 1.7 lukem if (strchr(".:!", cp[-1]))
354 1.1 cgd *cp2++ = ' ';
355 1.1 cgd }
356 1.1 cgd while (*cp == ' ')
357 1.1 cgd *cp2++ = *cp++;
358 1.1 cgd *cp2 = '\0';
359 1.1 cgd /*
360 1.1 cgd * LIZ@UOM 6/18/85 pack(word);
361 1.1 cgd */
362 1.1 cgd pack(word, wordl);
363 1.1 cgd }
364 1.1 cgd }
365 1.1 cgd
366 1.1 cgd /*
367 1.1 cgd * Output section.
368 1.1 cgd * Build up line images from the words passed in. Prefix
369 1.1 cgd * each line with correct number of blanks. The buffer "outbuf"
370 1.1 cgd * contains the current partial line image, including prefixed blanks.
371 1.1 cgd * "outp" points to the next available space therein. When outp is NOSTR,
372 1.1 cgd * there ain't nothing in there yet. At the bottom of this whole mess,
373 1.1 cgd * leading tabs are reinserted.
374 1.1 cgd */
375 1.1 cgd char outbuf[BUFSIZ]; /* Sandbagged output line image */
376 1.1 cgd char *outp; /* Pointer in above */
377 1.1 cgd
378 1.1 cgd /*
379 1.1 cgd * Initialize the output section.
380 1.1 cgd */
381 1.10 jdolecek static void
382 1.1 cgd setout()
383 1.1 cgd {
384 1.1 cgd outp = NOSTR;
385 1.1 cgd }
386 1.1 cgd
387 1.1 cgd /*
388 1.1 cgd * Pack a word onto the output line. If this is the beginning of
389 1.1 cgd * the line, push on the appropriately-sized string of blanks first.
390 1.1 cgd * If the word won't fit on the current line, flush and begin a new
391 1.1 cgd * line. If the word is too long to fit all by itself on a line,
392 1.1 cgd * just give it its own and hope for the best.
393 1.1 cgd *
394 1.1 cgd * LIZ@UOM 6/18/85 -- If the new word will fit in at less than the
395 1.1 cgd * goal length, take it. If not, then check to see if the line
396 1.1 cgd * will be over the max length; if so put the word on the next
397 1.1 cgd * line. If not, check to see if the line will be closer to the
398 1.1 cgd * goal length with or without the word and take it or put it on
399 1.1 cgd * the next line accordingly.
400 1.1 cgd */
401 1.1 cgd
402 1.1 cgd /*
403 1.1 cgd * LIZ@UOM 6/18/85 -- pass in the length of the word as well
404 1.1 cgd * pack(word)
405 1.1 cgd * char word[];
406 1.1 cgd */
407 1.10 jdolecek static void
408 1.1 cgd pack(word,wl)
409 1.10 jdolecek const char word[];
410 1.1 cgd int wl;
411 1.1 cgd {
412 1.10 jdolecek const char *cp;
413 1.6 lukem int s, t;
414 1.1 cgd
415 1.1 cgd if (outp == NOSTR)
416 1.1 cgd leadin();
417 1.1 cgd /*
418 1.1 cgd * LIZ@UOM 6/18/85 -- change condition to check goal_length; s is the
419 1.1 cgd * length of the line before the word is added; t is now the length
420 1.1 cgd * of the line after the word is added
421 1.1 cgd * t = strlen(word);
422 1.1 cgd * if (t+s <= LENGTH)
423 1.1 cgd */
424 1.1 cgd s = outp - outbuf;
425 1.1 cgd t = wl + s;
426 1.1 cgd if ((t <= goal_length) ||
427 1.1 cgd ((t <= max_length) && (t - goal_length <= goal_length - s))) {
428 1.1 cgd /*
429 1.1 cgd * In like flint!
430 1.1 cgd */
431 1.1 cgd for (cp = word; *cp; *outp++ = *cp++);
432 1.1 cgd return;
433 1.1 cgd }
434 1.1 cgd if (s > pfx) {
435 1.1 cgd oflush();
436 1.1 cgd leadin();
437 1.1 cgd }
438 1.1 cgd for (cp = word; *cp; *outp++ = *cp++);
439 1.1 cgd }
440 1.1 cgd
441 1.1 cgd /*
442 1.1 cgd * If there is anything on the current output line, send it on
443 1.1 cgd * its way. Set outp to NOSTR to indicate the absence of the current
444 1.1 cgd * line prefix.
445 1.1 cgd */
446 1.10 jdolecek static void
447 1.1 cgd oflush()
448 1.1 cgd {
449 1.1 cgd if (outp == NOSTR)
450 1.1 cgd return;
451 1.1 cgd *outp = '\0';
452 1.1 cgd tabulate(outbuf);
453 1.1 cgd outp = NOSTR;
454 1.1 cgd }
455 1.1 cgd
456 1.1 cgd /*
457 1.1 cgd * Take the passed line buffer, insert leading tabs where possible, and
458 1.1 cgd * output on standard output (finally).
459 1.1 cgd */
460 1.10 jdolecek static void
461 1.1 cgd tabulate(line)
462 1.1 cgd char line[];
463 1.1 cgd {
464 1.6 lukem char *cp;
465 1.6 lukem int b, t;
466 1.1 cgd
467 1.1 cgd /*
468 1.1 cgd * Toss trailing blanks in the output line.
469 1.1 cgd */
470 1.1 cgd cp = line + strlen(line) - 1;
471 1.1 cgd while (cp >= line && *cp == ' ')
472 1.1 cgd cp--;
473 1.1 cgd *++cp = '\0';
474 1.1 cgd
475 1.1 cgd /*
476 1.1 cgd * Count the leading blank space and tabulate.
477 1.1 cgd */
478 1.1 cgd for (cp = line; *cp == ' '; cp++)
479 1.1 cgd ;
480 1.1 cgd b = cp-line;
481 1.1 cgd t = b >> 3;
482 1.1 cgd b &= 07;
483 1.1 cgd if (t > 0)
484 1.1 cgd do
485 1.1 cgd putc('\t', stdout);
486 1.1 cgd while (--t);
487 1.1 cgd if (b > 0)
488 1.1 cgd do
489 1.1 cgd putc(' ', stdout);
490 1.1 cgd while (--b);
491 1.1 cgd while (*cp)
492 1.1 cgd putc(*cp++, stdout);
493 1.1 cgd putc('\n', stdout);
494 1.1 cgd }
495 1.1 cgd
496 1.1 cgd /*
497 1.1 cgd * Initialize the output line with the appropriate number of
498 1.1 cgd * leading blanks.
499 1.1 cgd */
500 1.10 jdolecek static void
501 1.1 cgd leadin()
502 1.1 cgd {
503 1.6 lukem int b;
504 1.6 lukem char *cp;
505 1.1 cgd
506 1.1 cgd for (b = 0, cp = outbuf; b < pfx; b++)
507 1.1 cgd *cp++ = ' ';
508 1.1 cgd outp = cp;
509 1.1 cgd }
510 1.1 cgd
511 1.1 cgd /*
512 1.1 cgd * Save a string in dynamic space.
513 1.1 cgd * This little goodie is needed for
514 1.1 cgd * a headline detector in head.c
515 1.1 cgd */
516 1.10 jdolecek static char *
517 1.1 cgd savestr(str)
518 1.1 cgd char str[];
519 1.1 cgd {
520 1.6 lukem char *top;
521 1.1 cgd
522 1.1 cgd top = malloc(strlen(str) + 1);
523 1.1 cgd if (top == NOSTR) {
524 1.1 cgd fprintf(stderr, "fmt: Ran out of memory\n");
525 1.1 cgd exit(1);
526 1.1 cgd }
527 1.1 cgd strcpy(top, str);
528 1.1 cgd return (top);
529 1.1 cgd }
530 1.1 cgd
531 1.1 cgd /*
532 1.1 cgd * Is s1 a prefix of s2??
533 1.1 cgd */
534 1.10 jdolecek static int
535 1.1 cgd ispref(s1, s2)
536 1.10 jdolecek const char *s1, *s2;
537 1.1 cgd {
538 1.1 cgd
539 1.1 cgd while (*s1++ == *s2)
540 1.1 cgd ;
541 1.1 cgd return (*s1 == '\0');
542 1.1 cgd }
543