fpr.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1989 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Robert Corbett.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #ifndef lint
38 1.1 cgd char copyright[] =
39 1.1 cgd "@(#) Copyright (c) 1989 The Regents of the University of California.\n\
40 1.1 cgd All rights reserved.\n";
41 1.1 cgd #endif /* not lint */
42 1.1 cgd
43 1.1 cgd #ifndef lint
44 1.2 mycroft /*static char sccsid[] = "from: @(#)fpr.c 5.4 (Berkeley) 2/6/91";*/
45 1.2 mycroft static char rcsid[] = "$Id: fpr.c,v 1.2 1993/08/01 18:15:47 mycroft Exp $";
46 1.1 cgd #endif /* not lint */
47 1.1 cgd
48 1.1 cgd #include <stdio.h>
49 1.1 cgd
50 1.1 cgd #define BLANK ' '
51 1.1 cgd #define TAB '\t'
52 1.1 cgd #define NUL '\000'
53 1.1 cgd #define FF '\f'
54 1.1 cgd #define BS '\b'
55 1.1 cgd #define CR '\r'
56 1.1 cgd #define VTAB '\013'
57 1.1 cgd #define EOL '\n'
58 1.1 cgd
59 1.1 cgd #define TRUE 1
60 1.1 cgd #define FALSE 0
61 1.1 cgd
62 1.1 cgd #define MAXCOL 170
63 1.1 cgd #define TABSIZE 8
64 1.1 cgd #define INITWIDTH 8
65 1.1 cgd
66 1.1 cgd typedef
67 1.1 cgd struct column
68 1.1 cgd {
69 1.1 cgd int count;
70 1.1 cgd int width;
71 1.1 cgd char *str;
72 1.1 cgd }
73 1.1 cgd COLUMN;
74 1.1 cgd
75 1.1 cgd char cc;
76 1.1 cgd char saved;
77 1.1 cgd int length;
78 1.1 cgd char *text;
79 1.1 cgd int highcol;
80 1.1 cgd COLUMN *line;
81 1.1 cgd int maxpos;
82 1.1 cgd int maxcol;
83 1.1 cgd
84 1.1 cgd extern char *malloc();
85 1.1 cgd extern char *calloc();
86 1.1 cgd extern char *realloc();
87 1.1 cgd
88 1.1 cgd
89 1.1 cgd
91 1.1 cgd main()
92 1.1 cgd {
93 1.1 cgd register int ch;
94 1.1 cgd register char ateof;
95 1.1 cgd register int i;
96 1.1 cgd register int errorcount;
97 1.1 cgd
98 1.1 cgd
99 1.1 cgd init();
100 1.1 cgd errorcount = 0;
101 1.1 cgd ateof = FALSE;
102 1.1 cgd
103 1.1 cgd ch = getchar();
104 1.1 cgd if (ch == EOF)
105 1.1 cgd exit(0);
106 1.1 cgd
107 1.1 cgd if (ch == EOL)
108 1.1 cgd {
109 1.1 cgd cc = NUL;
110 1.1 cgd ungetc((int) EOL, stdin);
111 1.1 cgd }
112 1.1 cgd else if (ch == BLANK)
113 1.1 cgd cc = NUL;
114 1.1 cgd else if (ch == '1')
115 1.1 cgd cc = FF;
116 1.1 cgd else if (ch == '0')
117 1.1 cgd cc = EOL;
118 1.1 cgd else if (ch == '+')
119 1.1 cgd cc = CR;
120 1.1 cgd else
121 1.1 cgd {
122 1.1 cgd errorcount = 1;
123 1.1 cgd cc = NUL;
124 1.1 cgd ungetc(ch, stdin);
125 1.1 cgd }
126 1.1 cgd
127 1.1 cgd while ( ! ateof)
128 1.1 cgd {
129 1.1 cgd gettext();
130 1.1 cgd ch = getchar();
131 1.1 cgd if (ch == EOF)
132 1.1 cgd {
133 1.1 cgd flush();
134 1.1 cgd ateof = TRUE;
135 1.1 cgd }
136 1.1 cgd else if (ch == EOL)
137 1.1 cgd {
138 1.1 cgd flush();
139 1.1 cgd cc = NUL;
140 1.1 cgd ungetc((int) EOL, stdin);
141 1.1 cgd }
142 1.1 cgd else if (ch == BLANK)
143 1.1 cgd {
144 1.1 cgd flush();
145 1.1 cgd cc = NUL;
146 1.1 cgd }
147 1.1 cgd else if (ch == '1')
148 1.1 cgd {
149 1.1 cgd flush();
150 1.1 cgd cc = FF;
151 1.1 cgd }
152 1.1 cgd else if (ch == '0')
153 1.1 cgd {
154 1.1 cgd flush();
155 1.1 cgd cc = EOL;
156 1.1 cgd }
157 1.1 cgd else if (ch == '+')
158 1.1 cgd {
159 1.1 cgd for (i = 0; i < length; i++)
160 1.1 cgd savech(i);
161 1.1 cgd }
162 1.1 cgd else
163 1.1 cgd {
164 1.1 cgd errorcount++;
165 1.1 cgd flush();
166 1.1 cgd cc = NUL;
167 1.1 cgd ungetc(ch, stdin);
168 1.1 cgd }
169 1.1 cgd }
170 1.1 cgd
171 1.1 cgd if (errorcount == 1)
172 1.1 cgd fprintf(stderr, "Illegal carriage control - 1 line.\n");
173 1.1 cgd else if (errorcount > 1)
174 1.1 cgd fprintf(stderr, "Illegal carriage control - %d lines.\n", errorcount);
175 1.1 cgd
176 1.1 cgd exit(0);
177 1.1 cgd }
178 1.1 cgd
179 1.1 cgd
180 1.1 cgd
182 1.1 cgd init()
183 1.1 cgd {
184 1.1 cgd register COLUMN *cp;
185 1.1 cgd register COLUMN *cend;
186 1.1 cgd register char *sp;
187 1.1 cgd
188 1.1 cgd
189 1.1 cgd length = 0;
190 1.1 cgd maxpos = MAXCOL;
191 1.1 cgd sp = malloc((unsigned) maxpos);
192 1.1 cgd if (sp == NULL)
193 1.1 cgd nospace();
194 1.1 cgd text = sp;
195 1.1 cgd
196 1.1 cgd highcol = -1;
197 1.1 cgd maxcol = MAXCOL;
198 1.1 cgd line = (COLUMN *) calloc(maxcol, (unsigned) sizeof(COLUMN));
199 1.1 cgd if (line == NULL)
200 1.1 cgd nospace();
201 1.1 cgd cp = line;
202 1.1 cgd cend = line + (maxcol-1);
203 1.1 cgd while (cp <= cend)
204 1.1 cgd {
205 1.1 cgd cp->width = INITWIDTH;
206 1.1 cgd sp = calloc(INITWIDTH, (unsigned) sizeof(char));
207 1.1 cgd if (sp == NULL)
208 1.1 cgd nospace();
209 1.1 cgd cp->str = sp;
210 1.1 cgd cp++;
211 1.1 cgd }
212 1.1 cgd }
213 1.1 cgd
214 1.1 cgd
215 1.1 cgd
217 1.1 cgd gettext()
218 1.1 cgd {
219 1.1 cgd register int i;
220 1.1 cgd register char ateol;
221 1.1 cgd register int ch;
222 1.1 cgd register int pos;
223 1.1 cgd
224 1.1 cgd
225 1.1 cgd i = 0;
226 1.1 cgd ateol = FALSE;
227 1.1 cgd
228 1.1 cgd while ( ! ateol)
229 1.1 cgd {
230 1.1 cgd ch = getchar();
231 1.1 cgd if (ch == EOL || ch == EOF)
232 1.1 cgd ateol = TRUE;
233 1.1 cgd else if (ch == TAB)
234 1.1 cgd {
235 1.1 cgd pos = (1 + i/TABSIZE) * TABSIZE;
236 1.1 cgd if (pos > maxpos)
237 1.1 cgd {
238 1.1 cgd maxpos = pos + 10;
239 1.1 cgd text = realloc(text, (unsigned) maxpos);
240 1.1 cgd if (text == NULL)
241 1.1 cgd nospace();
242 1.1 cgd }
243 1.1 cgd while (i < pos)
244 1.1 cgd {
245 1.1 cgd text[i] = BLANK;
246 1.1 cgd i++;
247 1.1 cgd }
248 1.1 cgd }
249 1.1 cgd else if (ch == BS)
250 1.1 cgd {
251 1.1 cgd if (i > 0)
252 1.1 cgd {
253 1.1 cgd i--;
254 1.1 cgd savech(i);
255 1.1 cgd }
256 1.1 cgd }
257 1.1 cgd else if (ch == CR)
258 1.1 cgd {
259 1.1 cgd while (i > 0)
260 1.1 cgd {
261 1.1 cgd i--;
262 1.1 cgd savech(i);
263 1.1 cgd }
264 1.1 cgd }
265 1.1 cgd else if (ch == FF || ch == VTAB)
266 1.1 cgd {
267 1.1 cgd flush();
268 1.1 cgd cc = ch;
269 1.1 cgd i = 0;
270 1.1 cgd }
271 1.1 cgd else
272 1.1 cgd {
273 1.1 cgd if (i >= maxpos)
274 1.1 cgd {
275 1.1 cgd maxpos = i + 10;
276 1.1 cgd text = realloc(text, (unsigned) maxpos);
277 1.1 cgd if (text == NULL)
278 1.1 cgd nospace();
279 1.1 cgd }
280 1.1 cgd text[i] = ch;
281 1.1 cgd i++;
282 1.1 cgd }
283 1.1 cgd }
284 1.1 cgd
285 1.1 cgd length = i;
286 1.1 cgd }
287 1.1 cgd
288 1.1 cgd
289 1.1 cgd
291 1.1 cgd savech(col)
292 1.1 cgd int col;
293 1.1 cgd {
294 1.1 cgd register char ch;
295 1.1 cgd register int oldmax;
296 1.1 cgd register COLUMN *cp;
297 1.1 cgd register COLUMN *cend;
298 1.1 cgd register char *sp;
299 1.1 cgd register int newcount;
300 1.1 cgd
301 1.1 cgd
302 1.1 cgd ch = text[col];
303 1.1 cgd if (ch == BLANK)
304 1.1 cgd return;
305 1.1 cgd
306 1.1 cgd saved = TRUE;
307 1.1 cgd
308 1.1 cgd if (col >= highcol)
309 1.1 cgd highcol = col;
310 1.1 cgd
311 1.1 cgd if (col >= maxcol)
312 1.1 cgd {
313 1.1 cgd oldmax = maxcol;
314 1.1 cgd maxcol = col + 10;
315 1.1 cgd line = (COLUMN *) realloc(line, (unsigned) maxcol*sizeof(COLUMN));
316 1.1 cgd if (line == NULL)
317 1.1 cgd nospace();
318 1.1 cgd cp = line + oldmax;
319 1.1 cgd cend = line + (maxcol - 1);
320 1.1 cgd while (cp <= cend)
321 1.1 cgd {
322 1.1 cgd cp->width = INITWIDTH;
323 1.1 cgd cp->count = 0;
324 1.1 cgd sp = calloc(INITWIDTH, (unsigned) sizeof(char));
325 1.1 cgd if (sp == NULL)
326 1.1 cgd nospace();
327 1.1 cgd cp->str = sp;
328 1.1 cgd cp++;
329 1.1 cgd }
330 1.1 cgd }
331 1.1 cgd
332 1.1 cgd cp = line + col;
333 1.1 cgd newcount = cp->count + 1;
334 1.1 cgd if (newcount > cp->width)
335 1.1 cgd {
336 1.1 cgd cp->width = newcount;
337 1.1 cgd sp = realloc(cp->str, (unsigned) newcount*sizeof(char));
338 1.1 cgd if (sp == NULL)
339 1.1 cgd nospace();
340 1.1 cgd cp->str = sp;
341 1.1 cgd }
342 1.1 cgd cp->count = newcount;
343 1.1 cgd cp->str[newcount-1] = ch;
344 1.1 cgd }
345 1.1 cgd
346 1.1 cgd
347 1.1 cgd
349 1.1 cgd flush()
350 1.1 cgd {
351 1.1 cgd register int i;
352 1.1 cgd register int anchor;
353 1.1 cgd register int height;
354 1.1 cgd register int j;
355 1.1 cgd
356 1.1 cgd
357 1.1 cgd if (cc != NUL)
358 1.1 cgd putchar(cc);
359 1.1 cgd
360 1.1 cgd if ( ! saved)
361 1.1 cgd {
362 1.1 cgd i = length;
363 1.1 cgd while (i > 0 && text[i-1] == BLANK)
364 1.1 cgd i--;
365 1.1 cgd length = i;
366 1.1 cgd for (i = 0; i < length; i++)
367 1.1 cgd putchar(text[i]);
368 1.1 cgd putchar(EOL);
369 1.1 cgd return;
370 1.1 cgd }
371 1.1 cgd
372 1.1 cgd for (i =0; i < length; i++)
373 1.1 cgd savech(i);
374 1.1 cgd
375 1.1 cgd anchor = 0;
376 1.1 cgd while (anchor <= highcol)
377 1.1 cgd {
378 1.1 cgd height = line[anchor].count;
379 1.1 cgd if (height == 0)
380 1.1 cgd {
381 1.1 cgd putchar(BLANK);
382 1.1 cgd anchor++;
383 1.1 cgd }
384 1.1 cgd else if (height == 1)
385 1.1 cgd {
386 1.1 cgd putchar( *(line[anchor].str) );
387 1.1 cgd line[anchor].count = 0;
388 1.1 cgd anchor++;
389 1.1 cgd }
390 1.1 cgd else
391 1.1 cgd {
392 1.1 cgd i = anchor;
393 1.1 cgd while (i < highcol && line[i+1].count > 1)
394 1.1 cgd i++;
395 1.1 cgd for (j = anchor; j <= i; j++)
396 1.1 cgd {
397 1.1 cgd height = line[j].count - 1;
398 1.1 cgd putchar(line[j].str[height]);
399 1.1 cgd line[j].count = height;
400 1.1 cgd }
401 1.1 cgd for (j = anchor; j <= i; j++)
402 1.1 cgd putchar(BS);
403 1.1 cgd }
404 1.1 cgd }
405 1.1 cgd
406 1.1 cgd putchar(EOL);
407 1.1 cgd highcol = -1;
408 1.1 cgd }
409 1.1 cgd
410 1.1 cgd
411 1.1 cgd
413 nospace()
414 {
415 fputs("Storage limit exceeded.\n", stderr);
416 exit(1);
417 }
418