lpf.c revision 117609 
1/*
2 * Copyright (c) 1983, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35static const char copyright[] =
36"@(#) Copyright (c) 1983, 1993\n\
37	The Regents of the University of California.  All rights reserved.\n";
38#endif /* not lint */
39
40#if 0
41#ifndef lint
42static char sccsid[] = "@(#)lpf.c	8.1 (Berkeley) 6/6/93";
43#endif /* not lint */
44#endif
45
46#include "lp.cdefs.h"		/* A cross-platform version of <sys/cdefs.h> */
47__FBSDID("$FreeBSD: head/usr.sbin/lpr/filters/lpf.c 117609 2003-07-15 07:01:01Z gad $");
48
49/*
50 * 	filter which reads the output of nroff and converts lines
51 *	with ^H's to overwritten lines.  Thus this works like 'ul'
52 *	but is much better: it can handle more than 2 overwrites
53 *	and it is written with some style.
54 *	modified by kls to use register references instead of arrays
55 *	to try to gain a little speed.
56 */
57
58#include <signal.h>
59#include <unistd.h>
60#include <stdlib.h>
61#include <stdio.h>
62
63#define MAXWIDTH  132
64#define MAXREP    10
65
66char	buf[MAXREP][MAXWIDTH];
67int	maxcol[MAXREP] = {-1};
68int	lineno;
69int	width = 132;	/* default line length */
70int	length = 66;	/* page length */
71int	indent;		/* indentation length */
72int	npages = 1;
73int	literal;	/* print control characters */
74char	*name;		/* user's login name */
75char	*host;		/* user's machine name */
76char	*acctfile;	/* accounting information file */
77
78int
79main(int argc, char *argv[])
80{
81	register FILE *p = stdin, *o = stdout;
82	register int i, col;
83	register char *cp;
84	int done, linedone, maxrep;
85	char *limit;
86	int ch;
87
88	while (--argc) {
89		if (*(cp = *++argv) == '-') {
90			switch (cp[1]) {
91			case 'n':
92				argc--;
93				name = *++argv;
94				break;
95
96			case 'h':
97				argc--;
98				host = *++argv;
99				break;
100
101			case 'w':
102				if ((i = atoi(&cp[2])) > 0 && i <= MAXWIDTH)
103					width = i;
104				break;
105
106			case 'l':
107				length = atoi(&cp[2]);
108				break;
109
110			case 'i':
111				indent = atoi(&cp[2]);
112				break;
113
114			case 'c':	/* Print control chars */
115				literal++;
116				break;
117			}
118		} else
119			acctfile = cp;
120	}
121
122	for (cp = buf[0], limit = buf[MAXREP]; cp < limit; *cp++ = ' ');
123	done = 0;
124
125	while (!done) {
126		col = indent;
127		maxrep = -1;
128		linedone = 0;
129		while (!linedone) {
130			switch (ch = getc(p)) {
131			case EOF:
132				linedone = done = 1;
133				ch = '\n';
134				break;
135
136			case '\f':
137				lineno = length;
138			case '\n':
139				if (maxrep < 0)
140					maxrep = 0;
141				linedone = 1;
142				break;
143
144			case '\b':
145				if (--col < indent)
146					col = indent;
147				break;
148
149			case '\r':
150				col = indent;
151				break;
152
153			case '\t':
154				col = ((col - indent) | 07) + indent + 1;
155				break;
156
157			case '\031':
158				/*
159				 * lpd needs to use a different filter to
160				 * print data so stop what we are doing and
161				 * wait for lpd to restart us.
162				 */
163				if ((ch = getchar()) == '\1') {
164					fflush(stdout);
165					kill(getpid(), SIGSTOP);
166					break;
167				} else {
168					ungetc(ch, stdin);
169					ch = '\031';
170				}
171
172			default:
173				if (col >= width || (!literal && ch < ' ')) {
174					col++;
175					break;
176				}
177				cp = &buf[0][col];
178				for (i = 0; i < MAXREP; i++) {
179					if (i > maxrep)
180						maxrep = i;
181					if (*cp == ' ') {
182						*cp = ch;
183						if (col > maxcol[i])
184							maxcol[i] = col;
185						break;
186					}
187					cp += MAXWIDTH;
188				}
189				col++;
190				break;
191			}
192		}
193
194		/* print out lines */
195		for (i = 0; i <= maxrep; i++) {
196			for (cp = buf[i], limit = cp+maxcol[i]; cp <= limit;) {
197				putc(*cp, o);
198				*cp++ = ' ';
199			}
200			if (i < maxrep)
201				putc('\r', o);
202			else
203				putc(ch, o);
204			if (++lineno >= length) {
205				fflush(o);
206				npages++;
207				lineno = 0;
208			}
209			maxcol[i] = -1;
210		}
211	}
212	if (lineno) {		/* be sure to end on a page boundary */
213		putchar('\f');
214		npages++;
215	}
216	if (name && acctfile && access(acctfile, 02) >= 0 &&
217	    freopen(acctfile, "a", stdout) != NULL) {
218		printf("%7.2f\t%s:%s\n", (float)npages, host, name);
219	}
220	exit(0);
221}
222