NetBSD/usr.bin/fmt/fmt.c

481 lines
11 KiB
C
Raw Normal View History

/* $NetBSD: fmt.c,v 1.24 2006/01/15 14:26:10 christos Exp $ */
1995-09-01 05:29:39 +04:00
1993-03-21 12:45:37 +03:00
/*
1995-09-01 05:29:39 +04:00
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
1993-03-21 12:45:37 +03:00
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
1997-10-18 19:00:11 +04:00
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
1997-10-18 19:00:11 +04:00
__COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
The Regents of the University of California. All rights reserved.\n");
1993-03-21 12:45:37 +03:00
#endif /* not lint */
#ifndef lint
1995-09-01 05:29:39 +04:00
#if 0
static char sccsid[] = "@(#)fmt.c 8.1 (Berkeley) 7/20/93";
#endif
__RCSID("$NetBSD: fmt.c,v 1.24 2006/01/15 14:26:10 christos Exp $");
1993-03-21 12:45:37 +03:00
#endif /* not lint */
2002-03-02 16:55:13 +03:00
#include <ctype.h>
#include <locale.h>
1993-03-21 12:45:37 +03:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "buffer.h"
1993-03-21 12:45:37 +03:00
/*
* fmt -- format the concatenation of input files or standard input
* onto standard output. Designed for use with Mail ~|
*
* Syntax : fmt [ goal [ max ] ] [ name ... ]
* Authors: Kurt Shoens (UCB) 12/7/78;
* Liz Allen (UMCP) 2/24/83 [Addition of goal length concept].
*/
/* LIZ@UOM 6/18/85 --New variables goal_length and max_length */
#define GOAL_LENGTH 65
#define MAX_LENGTH 75
static size_t goal_length; /* Target or goal line length in output */
static size_t max_length; /* Max line length in output */
static size_t pfx; /* Current leading blank count */
static int lineno; /* Current input line */
static int mark; /* Last place we saw a head line */
static int center;
static struct buffer outbuf;
1993-03-21 12:45:37 +03:00
static const char *headnames[] = {"To", "Subject", "Cc", 0};
1993-03-21 12:45:37 +03:00
2002-03-02 16:55:13 +03:00
static void fmt(FILE *);
static int ispref(const char *, const char *);
static void leadin(void);
static void oflush(void);
static void pack(const char *, size_t);
static void prefix(const struct buffer *, int);
2002-03-02 16:55:13 +03:00
static void split(const char *, int);
static void tabulate(struct buffer *);
int ishead(const char *);
1997-10-18 19:00:11 +04:00
1993-03-21 12:45:37 +03:00
/*
* Drive the whole formatter by managing input files. Also,
* cause initialization of the output stuff and flush it out
* at the end.
*/
1997-10-18 19:00:11 +04:00
int
2002-03-02 16:55:13 +03:00
main(int argc, char **argv)
1993-03-21 12:45:37 +03:00
{
1997-10-18 19:00:11 +04:00
FILE *fi;
int errs = 0;
1993-03-21 12:45:37 +03:00
int number; /* LIZ@UOM 6/18/85 */
goal_length = GOAL_LENGTH;
max_length = MAX_LENGTH;
buf_init(&outbuf);
1993-03-21 12:45:37 +03:00
lineno = 1;
mark = -10;
setprogname(*argv);
2006-01-05 05:07:29 +03:00
(void)setlocale(LC_ALL, "");
1993-03-21 12:45:37 +03:00
/*
* LIZ@UOM 6/18/85 -- Check for goal and max length arguments
*/
if (argc > 1 && !strcmp(argv[1], "-C")) {
2000-09-15 15:23:17 +04:00
center++;
argc--;
argv++;
}
1993-03-21 12:45:37 +03:00
if (argc > 1 && (1 == (sscanf(argv[1], "%d", &number)))) {
argv++;
argc--;
goal_length = abs(number);
1993-03-21 12:45:37 +03:00
if (argc > 1 && (1 == (sscanf(argv[1], "%d", &number)))) {
argv++;
argc--;
max_length = abs(number);
1993-03-21 12:45:37 +03:00
}
}
if (max_length <= goal_length) {
errx(1, "Max length (%zu) must be greater than goal "
"length (%zu)", max_length, goal_length);
1993-03-21 12:45:37 +03:00
}
if (argc < 2) {
fmt(stdin);
oflush();
return 0;
1993-03-21 12:45:37 +03:00
}
while (--argc) {
if ((fi = fopen(*++argv, "r")) == NULL) {
warn("Cannot open `%s'", *argv);
1993-03-21 12:45:37 +03:00
errs++;
continue;
}
fmt(fi);
2006-01-05 05:07:29 +03:00
(void)fclose(fi);
1993-03-21 12:45:37 +03:00
}
oflush();
buf_end(&outbuf);
return errs;
1993-03-21 12:45:37 +03:00
}
/*
* Read up characters from the passed input file, forming lines,
* doing ^H processing, expanding tabs, stripping trailing blanks,
* and sending each line down for analysis.
*/
static void
2002-03-02 16:55:13 +03:00
fmt(FILE *fi)
1993-03-21 12:45:37 +03:00
{
struct buffer lbuf, cbuf;
1997-10-18 19:00:11 +04:00
char *cp, *cp2;
int c, add_space;
size_t len, col;
1993-03-21 12:45:37 +03:00
2000-09-15 15:23:17 +04:00
if (center) {
for (;;) {
cp = fgetln(fi, &len);
2000-09-15 15:23:17 +04:00
if (!cp)
return;
cp2 = cp + len - 1;
while (len-- && isspace((unsigned char)*cp))
2000-09-15 15:23:17 +04:00
cp++;
while (cp2 > cp && isspace((unsigned char)*cp2))
2000-09-15 15:23:17 +04:00
cp2--;
if (cp == cp2)
2006-01-05 05:07:29 +03:00
(void)putchar('\n');
2000-09-15 15:23:17 +04:00
col = cp2 - cp;
if (goal_length > col)
for (c = 0; c < (goal_length - col) / 2; c++)
2006-01-05 05:07:29 +03:00
(void)putchar(' ');
2000-09-15 15:23:17 +04:00
while (cp <= cp2)
2006-01-05 05:07:29 +03:00
(void)putchar(*cp++);
(void)putchar('\n');
2000-09-15 15:23:17 +04:00
}
}
buf_init(&lbuf);
buf_init(&cbuf);
1993-03-21 12:45:37 +03:00
c = getc(fi);
1993-03-21 12:45:37 +03:00
while (c != EOF) {
/*
* Collect a line, doing ^H processing.
* Leave tabs for now.
*/
buf_reset(&lbuf);
while (c != '\n' && c != EOF) {
1993-03-21 12:45:37 +03:00
if (c == '\b') {
2006-01-05 05:07:29 +03:00
(void)buf_unputc(&lbuf);
1993-03-21 12:45:37 +03:00
c = getc(fi);
continue;
}
if(!(isprint(c) || c == '\t' || c >= 160)) {
1993-03-21 12:45:37 +03:00
c = getc(fi);
continue;
}
buf_putc(&lbuf, c);
1993-03-21 12:45:37 +03:00
c = getc(fi);
}
buf_putc(&lbuf, '\0');
2006-01-05 05:07:29 +03:00
(void)buf_unputc(&lbuf);
add_space = c != EOF;
/*
* Expand tabs on the way.
1993-03-21 12:45:37 +03:00
*/
col = 0;
cp = lbuf.bptr;
buf_reset(&cbuf);
while ((c = *cp++) != '\0') {
1993-03-21 12:45:37 +03:00
if (c != '\t') {
col++;
buf_putc(&cbuf, c);
1993-03-21 12:45:37 +03:00
continue;
}
do {
buf_putc(&cbuf, ' ');
1993-03-21 12:45:37 +03:00
col++;
} while ((col & 07) != 0);
}
/*
* Swipe trailing blanks from the line.
*/
for (cp2 = cbuf.ptr - 1; cp2 >= cbuf.bptr && *cp2 == ' '; cp2--)
continue;
cbuf.ptr = cp2 + 1;
buf_putc(&cbuf, '\0');
2006-01-05 05:07:29 +03:00
(void)buf_unputc(&cbuf);
prefix(&cbuf, add_space);
1993-03-21 12:45:37 +03:00
if (c != EOF)
c = getc(fi);
}
buf_end(&cbuf);
buf_end(&lbuf);
1993-03-21 12:45:37 +03:00
}
/*
* Take a line devoid of tabs and other garbage and determine its
* blank prefix. If the indent changes, call for a linebreak.
* If the input line is blank, echo the blank line on the output.
* Finally, if the line minus the prefix is a mail header, try to keep
* it on a line by itself.
*/
static void
prefix(const struct buffer *buf, int add_space)
1993-03-21 12:45:37 +03:00
{
const char *cp;
const char **hp;
size_t np;
int h;
1993-03-21 12:45:37 +03:00
if (buf->ptr == buf->bptr) {
1993-03-21 12:45:37 +03:00
oflush();
2006-01-05 05:07:29 +03:00
(void)putchar('\n');
1993-03-21 12:45:37 +03:00
return;
}
for (cp = buf->bptr; *cp == ' '; cp++)
continue;
np = cp - buf->bptr;
1993-03-21 12:45:37 +03:00
/*
* The following horrible expression attempts to avoid linebreaks
* when the indent changes due to a paragraph.
*/
if (np != pfx && (np > pfx || abs((int)(pfx - np)) > 8))
oflush();
if ((h = ishead(cp)) != 0) {
1993-03-21 12:45:37 +03:00
oflush();
mark = lineno;
}
if (lineno - mark < 3 && lineno - mark > 0)
for (hp = &headnames[0]; *hp != NULL; hp++)
1993-03-21 12:45:37 +03:00
if (ispref(*hp, cp)) {
h = 1;
oflush();
break;
}
if (!h && (h = (*cp == '.')))
oflush();
pfx = np;
if (h) {
pack(cp, (size_t)(buf->ptr - cp));
1993-03-21 12:45:37 +03:00
oflush();
} else
split(cp, add_space);
1993-03-21 12:45:37 +03:00
lineno++;
}
/*
* Split up the passed line into output "words" which are
* maximal strings of non-blanks with the blank separation
* attached at the end. Pass these words along to the output
* line packer.
*/
static void
2002-03-02 16:55:13 +03:00
split(const char line[], int add_space)
1993-03-21 12:45:37 +03:00
{
const char *cp;
struct buffer word;
size_t wlen;
1993-03-21 12:45:37 +03:00
buf_init(&word);
1993-03-21 12:45:37 +03:00
cp = line;
while (*cp) {
buf_reset(&word);
wlen = 0;
1993-03-21 12:45:37 +03:00
/*
* Collect a 'word,' allowing it to contain escaped white
* space.
*/
while (*cp && *cp != ' ') {
1998-12-19 19:01:21 +03:00
if (*cp == '\\' && isspace((unsigned char)cp[1]))
buf_putc(&word, *cp++);
buf_putc(&word, *cp++);
wlen++;
1993-03-21 12:45:37 +03:00
}
/*
* Guarantee a space at end of line. Two spaces after end of
* sentence punctuation.
*/
if (*cp == '\0' && add_space) {
buf_putc(&word, ' ');
1997-10-18 19:01:05 +04:00
if (strchr(".:!", cp[-1]))
buf_putc(&word, ' ');
1993-03-21 12:45:37 +03:00
}
while (*cp == ' ')
buf_putc(&word, *cp++);
buf_putc(&word, '\0');
2006-01-05 05:07:29 +03:00
(void)buf_unputc(&word);
pack(word.bptr, wlen);
1993-03-21 12:45:37 +03:00
}
buf_end(&word);
1993-03-21 12:45:37 +03:00
}
/*
* Output section.
* Build up line images from the words passed in. Prefix
2005-12-16 01:37:37 +03:00
* each line with correct number of blanks.
*
* At the bottom of this whole mess, leading tabs are reinserted.
1993-03-21 12:45:37 +03:00
*/
/*
* Pack a word onto the output line. If this is the beginning of
* the line, push on the appropriately-sized string of blanks first.
* If the word won't fit on the current line, flush and begin a new
* line. If the word is too long to fit all by itself on a line,
* just give it its own and hope for the best.
*
* LIZ@UOM 6/18/85 -- If the new word will fit in at less than the
* goal length, take it. If not, then check to see if the line
* will be over the max length; if so put the word on the next
* line. If not, check to see if the line will be closer to the
* goal length with or without the word and take it or put it on
* the next line accordingly.
*/
static void
pack(const char *word, size_t wlen)
1993-03-21 12:45:37 +03:00
{
const char *cp;
size_t s, t;
1993-03-21 12:45:37 +03:00
if (outbuf.bptr == outbuf.ptr)
1993-03-21 12:45:37 +03:00
leadin();
/*
* LIZ@UOM 6/18/85 -- change condition to check goal_length; s is the
* length of the line before the word is added; t is now the length
* of the line after the word is added
*/
s = outbuf.ptr - outbuf.bptr;
t = wlen + s;
if ((t <= goal_length) || ((t <= max_length) &&
(s <= goal_length) && (t - goal_length <= goal_length - s))) {
1993-03-21 12:45:37 +03:00
/*
* In like flint!
*/
for (cp = word; *cp;)
buf_putc(&outbuf, *cp++);
1993-03-21 12:45:37 +03:00
return;
}
if (s > pfx) {
oflush();
leadin();
}
for (cp = word; *cp;)
buf_putc(&outbuf, *cp++);
1993-03-21 12:45:37 +03:00
}
/*
* If there is anything on the current output line, send it on
2005-12-16 01:37:37 +03:00
* its way. Reset outbuf.
1993-03-21 12:45:37 +03:00
*/
static void
2002-03-02 16:55:13 +03:00
oflush(void)
1993-03-21 12:45:37 +03:00
{
if (outbuf.bptr == outbuf.ptr)
1993-03-21 12:45:37 +03:00
return;
buf_putc(&outbuf, '\0');
2006-01-05 05:07:29 +03:00
(void)buf_unputc(&outbuf);
tabulate(&outbuf);
buf_reset(&outbuf);
1993-03-21 12:45:37 +03:00
}
/*
* Take the passed line buffer, insert leading tabs where possible, and
* output on standard output (finally).
*/
static void
tabulate(struct buffer *buf)
1993-03-21 12:45:37 +03:00
{
1997-10-18 19:00:11 +04:00
char *cp;
size_t b, t;
1993-03-21 12:45:37 +03:00
/*
* Toss trailing blanks in the output line.
*/
for (cp = buf->ptr; cp >= buf->bptr && *cp == ' '; cp--)
continue;
*cp = '\0';
1993-03-21 12:45:37 +03:00
/*
* Count the leading blank space and tabulate.
*/
for (cp = buf->bptr; *cp == ' '; cp++)
continue;
b = cp - buf->bptr;
2005-12-16 01:37:37 +03:00
t = b / 8;
b = b % 8;
1993-03-21 12:45:37 +03:00
if (t > 0)
do
2006-01-05 05:07:29 +03:00
(void)putchar('\t');
1993-03-21 12:45:37 +03:00
while (--t);
if (b > 0)
do
2006-01-05 05:07:29 +03:00
(void)putchar(' ');
1993-03-21 12:45:37 +03:00
while (--b);
while (*cp)
2006-01-05 05:07:29 +03:00
(void)putchar(*cp++);
(void)putchar('\n');
1993-03-21 12:45:37 +03:00
}
/*
* Initialize the output line with the appropriate number of
* leading blanks.
*/
static void
2002-03-02 16:55:13 +03:00
leadin(void)
1993-03-21 12:45:37 +03:00
{
size_t b;
buf_reset(&outbuf);
1993-03-21 12:45:37 +03:00
for (b = 0; b < pfx; b++)
buf_putc(&outbuf, ' ');
1993-03-21 12:45:37 +03:00
}
/*
* Is s1 a prefix of s2??
*/
static int
2002-03-02 16:55:13 +03:00
ispref(const char *s1, const char *s2)
1993-03-21 12:45:37 +03:00
{
while (*s1++ == *s2)
continue;
return *s1 == '\0';
1993-03-21 12:45:37 +03:00
}