1/*
2 * Copyright (c) 1985 Sun Microsystems, Inc.
3 * Copyright (c) 1980, 1993
4 * The Regents of the University of California. All rights reserved.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36#ifndef lint
37#if 0
38static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 6/6/93";
39#endif
40static const char rcsid[] =
| 1/*
2 * Copyright (c) 1985 Sun Microsystems, Inc.
3 * Copyright (c) 1980, 1993
4 * The Regents of the University of California. All rights reserved.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36#ifndef lint
37#if 0
38static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 6/6/93";
39#endif
40static const char rcsid[] =
|
41 "$FreeBSD: head/usr.bin/indent/io.c 93440 2002-03-30 17:10:20Z dwmalone $";
| 41 "$FreeBSD: head/usr.bin/indent/io.c 98771 2002-06-24 17:40:27Z jmallett $";
|
42#endif /* not lint */
43
44#include <ctype.h>
45#include <err.h>
46#include <stdio.h>
47#include <stdlib.h>
48#include <string.h>
49#include "indent_globs.h"
50#include "indent.h"
51
52int comment_open;
53static int paren_target;
54static int pad_output(int current, int target);
55
56void
57dump_line(void)
58{ /* dump_line is the routine that actually
59 * effects the printing of the new source. It
60 * prints the label section, followed by the
61 * code section with the appropriate nesting
62 * level, followed by any comments */
| 42#endif /* not lint */
43
44#include <ctype.h>
45#include <err.h>
46#include <stdio.h>
47#include <stdlib.h>
48#include <string.h>
49#include "indent_globs.h"
50#include "indent.h"
51
52int comment_open;
53static int paren_target;
54static int pad_output(int current, int target);
55
56void
57dump_line(void)
58{ /* dump_line is the routine that actually
59 * effects the printing of the new source. It
60 * prints the label section, followed by the
61 * code section with the appropriate nesting
62 * level, followed by any comments */
|
63 register int cur_col,
| 63 int cur_col,
|
64 target_col = 1;
65 static int not_first_line;
66
67 if (ps.procname[0]) {
68 if (troff) {
69 if (comment_open) {
70 comment_open = 0;
71 fprintf(output, ".*/\n");
72 }
73 fprintf(output, ".Pr \"%s\"\n", ps.procname);
74 }
75 ps.ind_level = 0;
76 ps.procname[0] = 0;
77 }
78 if (s_code == e_code && s_lab == e_lab && s_com == e_com) {
79 if (suppress_blanklines > 0)
80 suppress_blanklines--;
81 else {
82 ps.bl_line = true;
83 n_real_blanklines++;
84 }
85 }
86 else if (!inhibit_formatting) {
87 suppress_blanklines = 0;
88 ps.bl_line = false;
89 if (prefix_blankline_requested && not_first_line) {
90 if (swallow_optional_blanklines) {
91 if (n_real_blanklines == 1)
92 n_real_blanklines = 0;
93 }
94 else {
95 if (n_real_blanklines == 0)
96 n_real_blanklines = 1;
97 }
98 }
99 while (--n_real_blanklines >= 0)
100 putc('\n', output);
101 n_real_blanklines = 0;
102 if (ps.ind_level == 0)
103 ps.ind_stmt = 0; /* this is a class A kludge. dont do
104 * additional statement indentation if we are
105 * at bracket level 0 */
106
107 if (e_lab != s_lab || e_code != s_code)
108 ++code_lines; /* keep count of lines with code */
109
110
111 if (e_lab != s_lab) { /* print lab, if any */
112 if (comment_open) {
113 comment_open = 0;
114 fprintf(output, ".*/\n");
115 }
116 while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t'))
117 e_lab--;
118 cur_col = pad_output(1, compute_label_target());
119 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0
120 || strncmp(s_lab, "#endif", 6) == 0)) {
| 64 target_col = 1;
65 static int not_first_line;
66
67 if (ps.procname[0]) {
68 if (troff) {
69 if (comment_open) {
70 comment_open = 0;
71 fprintf(output, ".*/\n");
72 }
73 fprintf(output, ".Pr \"%s\"\n", ps.procname);
74 }
75 ps.ind_level = 0;
76 ps.procname[0] = 0;
77 }
78 if (s_code == e_code && s_lab == e_lab && s_com == e_com) {
79 if (suppress_blanklines > 0)
80 suppress_blanklines--;
81 else {
82 ps.bl_line = true;
83 n_real_blanklines++;
84 }
85 }
86 else if (!inhibit_formatting) {
87 suppress_blanklines = 0;
88 ps.bl_line = false;
89 if (prefix_blankline_requested && not_first_line) {
90 if (swallow_optional_blanklines) {
91 if (n_real_blanklines == 1)
92 n_real_blanklines = 0;
93 }
94 else {
95 if (n_real_blanklines == 0)
96 n_real_blanklines = 1;
97 }
98 }
99 while (--n_real_blanklines >= 0)
100 putc('\n', output);
101 n_real_blanklines = 0;
102 if (ps.ind_level == 0)
103 ps.ind_stmt = 0; /* this is a class A kludge. dont do
104 * additional statement indentation if we are
105 * at bracket level 0 */
106
107 if (e_lab != s_lab || e_code != s_code)
108 ++code_lines; /* keep count of lines with code */
109
110
111 if (e_lab != s_lab) { /* print lab, if any */
112 if (comment_open) {
113 comment_open = 0;
114 fprintf(output, ".*/\n");
115 }
116 while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t'))
117 e_lab--;
118 cur_col = pad_output(1, compute_label_target());
119 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0
120 || strncmp(s_lab, "#endif", 6) == 0)) {
|
121 register char *s = s_lab;
| 121 char *s = s_lab;
|
122 if (e_lab[-1] == '\n') e_lab--;
123 do putc(*s++, output);
124 while (s < e_lab && 'a' <= *s && *s<='z');
125 while ((*s == ' ' || *s == '\t') && s < e_lab)
126 s++;
127 if (s < e_lab)
128 fprintf(output, s[0]=='/' && s[1]=='*' ? "\t%.*s" : "\t/* %.*s */",
129 (int)(e_lab - s), s);
130 }
131 else fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab);
132 cur_col = count_spaces(cur_col, s_lab);
133 }
134 else
135 cur_col = 1; /* there is no label section */
136
137 ps.pcase = false;
138
139 if (s_code != e_code) { /* print code section, if any */
| 122 if (e_lab[-1] == '\n') e_lab--;
123 do putc(*s++, output);
124 while (s < e_lab && 'a' <= *s && *s<='z');
125 while ((*s == ' ' || *s == '\t') && s < e_lab)
126 s++;
127 if (s < e_lab)
128 fprintf(output, s[0]=='/' && s[1]=='*' ? "\t%.*s" : "\t/* %.*s */",
129 (int)(e_lab - s), s);
130 }
131 else fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab);
132 cur_col = count_spaces(cur_col, s_lab);
133 }
134 else
135 cur_col = 1; /* there is no label section */
136
137 ps.pcase = false;
138
139 if (s_code != e_code) { /* print code section, if any */
|
140 register char *p;
| 140 char *p;
|
141
142 if (comment_open) {
143 comment_open = 0;
144 fprintf(output, ".*/\n");
145 }
146 target_col = compute_code_target();
147 {
| 141
142 if (comment_open) {
143 comment_open = 0;
144 fprintf(output, ".*/\n");
145 }
146 target_col = compute_code_target();
147 {
|
148 register int i;
| 148 int i;
|
149
150 for (i = 0; i < ps.p_l_follow; i++)
151 if (ps.paren_indents[i] >= 0)
152 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col);
153 }
154 cur_col = pad_output(cur_col, target_col);
155 for (p = s_code; p < e_code; p++)
156 if (*p == (char) 0200)
157 fprintf(output, "%d", target_col * 7);
158 else
159 putc(*p, output);
160 cur_col = count_spaces(cur_col, s_code);
161 }
162 if (s_com != e_com) {
163 if (troff) {
164 int all_here = 0;
| 149
150 for (i = 0; i < ps.p_l_follow; i++)
151 if (ps.paren_indents[i] >= 0)
152 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col);
153 }
154 cur_col = pad_output(cur_col, target_col);
155 for (p = s_code; p < e_code; p++)
156 if (*p == (char) 0200)
157 fprintf(output, "%d", target_col * 7);
158 else
159 putc(*p, output);
160 cur_col = count_spaces(cur_col, s_code);
161 }
162 if (s_com != e_com) {
163 if (troff) {
164 int all_here = 0;
|
165 register char *p;
| 165 char *p;
|
166
167 if (e_com[-1] == '/' && e_com[-2] == '*')
168 e_com -= 2, all_here++;
169 while (e_com > s_com && e_com[-1] == ' ')
170 e_com--;
171 *e_com = 0;
172 p = s_com;
173 while (*p == ' ')
174 p++;
175 if (p[0] == '/' && p[1] == '*')
176 p += 2, all_here++;
177 else if (p[0] == '*')
178 p += p[1] == '/' ? 2 : 1;
179 while (*p == ' ')
180 p++;
181 if (*p == 0)
182 goto inhibit_newline;
183 if (comment_open < 2 && ps.box_com) {
184 comment_open = 0;
185 fprintf(output, ".*/\n");
186 }
187 if (comment_open == 0) {
188 if ('a' <= *p && *p <= 'z')
189 *p = *p + 'A' - 'a';
190 if (e_com - p < 50 && all_here == 2) {
| 166
167 if (e_com[-1] == '/' && e_com[-2] == '*')
168 e_com -= 2, all_here++;
169 while (e_com > s_com && e_com[-1] == ' ')
170 e_com--;
171 *e_com = 0;
172 p = s_com;
173 while (*p == ' ')
174 p++;
175 if (p[0] == '/' && p[1] == '*')
176 p += 2, all_here++;
177 else if (p[0] == '*')
178 p += p[1] == '/' ? 2 : 1;
179 while (*p == ' ')
180 p++;
181 if (*p == 0)
182 goto inhibit_newline;
183 if (comment_open < 2 && ps.box_com) {
184 comment_open = 0;
185 fprintf(output, ".*/\n");
186 }
187 if (comment_open == 0) {
188 if ('a' <= *p && *p <= 'z')
189 *p = *p + 'A' - 'a';
190 if (e_com - p < 50 && all_here == 2) {
|
191 register char *follow = p;
| 191 char *follow = p;
|
192 fprintf(output, "\n.nr C! \\w\1");
193 while (follow < e_com) {
194 switch (*follow) {
195 case '\n':
196 putc(' ', output);
197 case 1:
198 break;
199 case '\\':
200 putc('\\', output);
201 default:
202 putc(*follow, output);
203 }
204 follow++;
205 }
206 putc(1, output);
207 }
208 fprintf(output, "\n./* %dp %d %dp\n",
209 ps.com_col * 7,
210 (s_code != e_code || s_lab != e_lab) - ps.box_com,
211 target_col * 7);
212 }
213 comment_open = 1 + ps.box_com;
214 while (*p) {
215 if (*p == BACKSLASH)
216 putc(BACKSLASH, output);
217 putc(*p++, output);
218 }
219 }
220 else { /* print comment, if any */
| 192 fprintf(output, "\n.nr C! \\w\1");
193 while (follow < e_com) {
194 switch (*follow) {
195 case '\n':
196 putc(' ', output);
197 case 1:
198 break;
199 case '\\':
200 putc('\\', output);
201 default:
202 putc(*follow, output);
203 }
204 follow++;
205 }
206 putc(1, output);
207 }
208 fprintf(output, "\n./* %dp %d %dp\n",
209 ps.com_col * 7,
210 (s_code != e_code || s_lab != e_lab) - ps.box_com,
211 target_col * 7);
212 }
213 comment_open = 1 + ps.box_com;
214 while (*p) {
215 if (*p == BACKSLASH)
216 putc(BACKSLASH, output);
217 putc(*p++, output);
218 }
219 }
220 else { /* print comment, if any */
|
221 register int target = ps.com_col;
222 register char *com_st = s_com;
| 221 int target = ps.com_col;
222 char *com_st = s_com;
|
223
224 target += ps.comment_delta;
225 while (*com_st == '\t')
226 com_st++, target += 8; /* ? */
227 while (target <= 0)
228 if (*com_st == ' ')
229 target++, com_st++;
230 else if (*com_st == '\t')
231 target = ((target - 1) & ~7) + 9, com_st++;
232 else
233 target = 1;
234 if (cur_col > target) { /* if comment cant fit on this line,
235 * put it on next line */
236 putc('\n', output);
237 cur_col = 1;
238 ++ps.out_lines;
239 }
240 while (e_com > com_st && isspace(e_com[-1]))
241 e_com--;
242 cur_col = pad_output(cur_col, target);
243 if (!ps.box_com) {
244 if (star_comment_cont && (com_st[1] != '*' || e_com <= com_st + 1)) {
245 if (com_st[1] == ' ' && com_st[0] == ' ' && e_com > com_st + 1)
246 com_st[1] = '*';
247 else
248 fwrite(" * ", com_st[0] == '\t' ? 2 : com_st[0] == '*' ? 1 : 3, 1, output);
249 }
250 }
251 fwrite(com_st, e_com - com_st, 1, output);
252 ps.comment_delta = ps.n_comment_delta;
253 cur_col = count_spaces(cur_col, com_st);
254 ++ps.com_lines; /* count lines with comments */
255 }
256 }
257 if (ps.use_ff)
258 putc('\014', output);
259 else
260 putc('\n', output);
261inhibit_newline:
262 ++ps.out_lines;
263 if (ps.just_saw_decl == 1 && blanklines_after_declarations) {
264 prefix_blankline_requested = 1;
265 ps.just_saw_decl = 0;
266 }
267 else
268 prefix_blankline_requested = postfix_blankline_requested;
269 postfix_blankline_requested = 0;
270 }
271 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a
272 * declaration, remember that fact for
273 * proper comment indentation */
274 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be
275 * indented if we have not
276 * completed this stmt and if
277 * we are not in the middle of
278 * a declaration */
279 ps.use_ff = false;
280 ps.dumped_decl_indent = 0;
281 *(e_lab = s_lab) = '\0'; /* reset buffers */
282 *(e_code = s_code) = '\0';
283 *(e_com = s_com) = '\0';
284 ps.ind_level = ps.i_l_follow;
285 ps.paren_level = ps.p_l_follow;
286 paren_target = -ps.paren_indents[ps.paren_level - 1];
287 not_first_line = 1;
288}
289
290int
291compute_code_target(void)
292{
| 223
224 target += ps.comment_delta;
225 while (*com_st == '\t')
226 com_st++, target += 8; /* ? */
227 while (target <= 0)
228 if (*com_st == ' ')
229 target++, com_st++;
230 else if (*com_st == '\t')
231 target = ((target - 1) & ~7) + 9, com_st++;
232 else
233 target = 1;
234 if (cur_col > target) { /* if comment cant fit on this line,
235 * put it on next line */
236 putc('\n', output);
237 cur_col = 1;
238 ++ps.out_lines;
239 }
240 while (e_com > com_st && isspace(e_com[-1]))
241 e_com--;
242 cur_col = pad_output(cur_col, target);
243 if (!ps.box_com) {
244 if (star_comment_cont && (com_st[1] != '*' || e_com <= com_st + 1)) {
245 if (com_st[1] == ' ' && com_st[0] == ' ' && e_com > com_st + 1)
246 com_st[1] = '*';
247 else
248 fwrite(" * ", com_st[0] == '\t' ? 2 : com_st[0] == '*' ? 1 : 3, 1, output);
249 }
250 }
251 fwrite(com_st, e_com - com_st, 1, output);
252 ps.comment_delta = ps.n_comment_delta;
253 cur_col = count_spaces(cur_col, com_st);
254 ++ps.com_lines; /* count lines with comments */
255 }
256 }
257 if (ps.use_ff)
258 putc('\014', output);
259 else
260 putc('\n', output);
261inhibit_newline:
262 ++ps.out_lines;
263 if (ps.just_saw_decl == 1 && blanklines_after_declarations) {
264 prefix_blankline_requested = 1;
265 ps.just_saw_decl = 0;
266 }
267 else
268 prefix_blankline_requested = postfix_blankline_requested;
269 postfix_blankline_requested = 0;
270 }
271 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a
272 * declaration, remember that fact for
273 * proper comment indentation */
274 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be
275 * indented if we have not
276 * completed this stmt and if
277 * we are not in the middle of
278 * a declaration */
279 ps.use_ff = false;
280 ps.dumped_decl_indent = 0;
281 *(e_lab = s_lab) = '\0'; /* reset buffers */
282 *(e_code = s_code) = '\0';
283 *(e_com = s_com) = '\0';
284 ps.ind_level = ps.i_l_follow;
285 ps.paren_level = ps.p_l_follow;
286 paren_target = -ps.paren_indents[ps.paren_level - 1];
287 not_first_line = 1;
288}
289
290int
291compute_code_target(void)
292{
|
293 register int target_col = ps.ind_size * ps.ind_level + 1;
| 293 int target_col = ps.ind_size * ps.ind_level + 1;
|
294
295 if (ps.paren_level)
296 if (!lineup_to_parens)
297 target_col += continuation_indent * ps.paren_level;
298 else {
| 294
295 if (ps.paren_level)
296 if (!lineup_to_parens)
297 target_col += continuation_indent * ps.paren_level;
298 else {
|
299 register int w;
300 register int t = paren_target;
| 299 int w;
300 int t = paren_target;
|
301
302 if ((w = count_spaces(t, s_code) - max_col) > 0
303 && count_spaces(target_col, s_code) <= max_col) {
304 t -= w + 1;
305 if (t > target_col)
306 target_col = t;
307 }
308 else
309 target_col = t;
310 }
311 else if (ps.ind_stmt)
312 target_col += continuation_indent;
313 return target_col;
314}
315
316int
317compute_label_target(void)
318{
319 return
320 ps.pcase ? (int) (case_ind * ps.ind_size) + 1
321 : *s_lab == '#' ? 1
322 : ps.ind_size * (ps.ind_level - label_offset) + 1;
323}
324
325
326/*
327 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
328 *
329 * All rights reserved
330 *
331 *
332 * NAME: fill_buffer
333 *
334 * FUNCTION: Reads one block of input into input_buffer
335 *
336 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A
337 * Willcox of CAC Added check for switch back to partly full input
338 * buffer from temporary buffer
339 *
340 */
341void
342fill_buffer(void)
343{ /* this routine reads stuff from the input */
| 301
302 if ((w = count_spaces(t, s_code) - max_col) > 0
303 && count_spaces(target_col, s_code) <= max_col) {
304 t -= w + 1;
305 if (t > target_col)
306 target_col = t;
307 }
308 else
309 target_col = t;
310 }
311 else if (ps.ind_stmt)
312 target_col += continuation_indent;
313 return target_col;
314}
315
316int
317compute_label_target(void)
318{
319 return
320 ps.pcase ? (int) (case_ind * ps.ind_size) + 1
321 : *s_lab == '#' ? 1
322 : ps.ind_size * (ps.ind_level - label_offset) + 1;
323}
324
325
326/*
327 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
328 *
329 * All rights reserved
330 *
331 *
332 * NAME: fill_buffer
333 *
334 * FUNCTION: Reads one block of input into input_buffer
335 *
336 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A
337 * Willcox of CAC Added check for switch back to partly full input
338 * buffer from temporary buffer
339 *
340 */
341void
342fill_buffer(void)
343{ /* this routine reads stuff from the input */
|
344 register char *p;
345 register int i;
346 register FILE *f = input;
| 344 char *p;
345 int i;
346 FILE *f = input;
|
347
348 if (bp_save != 0) { /* there is a partly filled input buffer left */
349 buf_ptr = bp_save; /* dont read anything, just switch buffers */
350 buf_end = be_save;
351 bp_save = be_save = 0;
352 if (buf_ptr < buf_end)
353 return; /* only return if there is really something in
354 * this buffer */
355 }
356 for (p = in_buffer;;) {
357 if (p >= in_buffer_limit) {
| 347
348 if (bp_save != 0) { /* there is a partly filled input buffer left */
349 buf_ptr = bp_save; /* dont read anything, just switch buffers */
350 buf_end = be_save;
351 bp_save = be_save = 0;
352 if (buf_ptr < buf_end)
353 return; /* only return if there is really something in
354 * this buffer */
355 }
356 for (p = in_buffer;;) {
357 if (p >= in_buffer_limit) {
|
358 register int size = (in_buffer_limit - in_buffer) * 2 + 10;
359 register int offset = p - in_buffer;
| 358 int size = (in_buffer_limit - in_buffer) * 2 + 10;
359 int offset = p - in_buffer;
|
360 in_buffer = realloc(in_buffer, size);
361 if (in_buffer == 0)
362 err(1, "input line too long");
363 p = in_buffer + offset;
364 in_buffer_limit = in_buffer + size - 2;
365 }
366 if ((i = getc(f)) == EOF) {
367 *p++ = ' ';
368 *p++ = '\n';
369 had_eof = true;
370 break;
371 }
372 *p++ = i;
373 if (i == '\n')
374 break;
375 }
376 buf_ptr = in_buffer;
377 buf_end = p;
378 if (p[-2] == '/' && p[-3] == '*') {
379 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0)
380 fill_buffer(); /* flush indent error message */
381 else {
382 int com = 0;
383
384 p = in_buffer;
385 while (*p == ' ' || *p == '\t')
386 p++;
387 if (*p == '/' && p[1] == '*') {
388 p += 2;
389 while (*p == ' ' || *p == '\t')
390 p++;
391 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E'
392 && p[4] == 'N' && p[5] == 'T') {
393 p += 6;
394 while (*p == ' ' || *p == '\t')
395 p++;
396 if (*p == '*')
397 com = 1;
398 else if (*p == 'O') {
399 if (*++p == 'N')
400 p++, com = 1;
401 else if (*p == 'F' && *++p == 'F')
402 p++, com = 2;
403 }
404 while (*p == ' ' || *p == '\t')
405 p++;
406 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) {
407 if (s_com != e_com || s_lab != e_lab || s_code != e_code)
408 dump_line();
409 if (!(inhibit_formatting = com - 1)) {
410 n_real_blanklines = 0;
411 postfix_blankline_requested = 0;
412 prefix_blankline_requested = 0;
413 suppress_blanklines = 1;
414 }
415 }
416 }
417 }
418 }
419 }
420 if (inhibit_formatting) {
421 p = in_buffer;
422 do
423 putc(*p, output);
424 while (*p++ != '\n');
425 }
426}
427
428/*
429 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
430 *
431 * All rights reserved
432 *
433 *
434 * NAME: pad_output
435 *
436 * FUNCTION: Writes tabs and spaces to move the current column up to the desired
437 * position.
438 *
439 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf.
440 *
441 * PARAMETERS: current integer The current column target
442 * nteger The desired column
443 *
444 * RETURNS: Integer value of the new column. (If current >= target, no action is
445 * taken, and current is returned.
446 *
447 * GLOBALS: None
448 *
449 * CALLS: write (sys)
450 *
451 * CALLED BY: dump_line
452 *
453 * HISTORY: initial coding November 1976 D A Willcox of CAC
454 *
455 */
456static int
457pad_output(int current, int target)
458 /* writes tabs and blanks (if necessary) to
459 * get the current output position up to the
460 * target column */
461 /* current: the current column value */
462 /* target: position we want it at */
463{
| 360 in_buffer = realloc(in_buffer, size);
361 if (in_buffer == 0)
362 err(1, "input line too long");
363 p = in_buffer + offset;
364 in_buffer_limit = in_buffer + size - 2;
365 }
366 if ((i = getc(f)) == EOF) {
367 *p++ = ' ';
368 *p++ = '\n';
369 had_eof = true;
370 break;
371 }
372 *p++ = i;
373 if (i == '\n')
374 break;
375 }
376 buf_ptr = in_buffer;
377 buf_end = p;
378 if (p[-2] == '/' && p[-3] == '*') {
379 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0)
380 fill_buffer(); /* flush indent error message */
381 else {
382 int com = 0;
383
384 p = in_buffer;
385 while (*p == ' ' || *p == '\t')
386 p++;
387 if (*p == '/' && p[1] == '*') {
388 p += 2;
389 while (*p == ' ' || *p == '\t')
390 p++;
391 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E'
392 && p[4] == 'N' && p[5] == 'T') {
393 p += 6;
394 while (*p == ' ' || *p == '\t')
395 p++;
396 if (*p == '*')
397 com = 1;
398 else if (*p == 'O') {
399 if (*++p == 'N')
400 p++, com = 1;
401 else if (*p == 'F' && *++p == 'F')
402 p++, com = 2;
403 }
404 while (*p == ' ' || *p == '\t')
405 p++;
406 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) {
407 if (s_com != e_com || s_lab != e_lab || s_code != e_code)
408 dump_line();
409 if (!(inhibit_formatting = com - 1)) {
410 n_real_blanklines = 0;
411 postfix_blankline_requested = 0;
412 prefix_blankline_requested = 0;
413 suppress_blanklines = 1;
414 }
415 }
416 }
417 }
418 }
419 }
420 if (inhibit_formatting) {
421 p = in_buffer;
422 do
423 putc(*p, output);
424 while (*p++ != '\n');
425 }
426}
427
428/*
429 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
430 *
431 * All rights reserved
432 *
433 *
434 * NAME: pad_output
435 *
436 * FUNCTION: Writes tabs and spaces to move the current column up to the desired
437 * position.
438 *
439 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf.
440 *
441 * PARAMETERS: current integer The current column target
442 * nteger The desired column
443 *
444 * RETURNS: Integer value of the new column. (If current >= target, no action is
445 * taken, and current is returned.
446 *
447 * GLOBALS: None
448 *
449 * CALLS: write (sys)
450 *
451 * CALLED BY: dump_line
452 *
453 * HISTORY: initial coding November 1976 D A Willcox of CAC
454 *
455 */
456static int
457pad_output(int current, int target)
458 /* writes tabs and blanks (if necessary) to
459 * get the current output position up to the
460 * target column */
461 /* current: the current column value */
462 /* target: position we want it at */
463{
|
464 register int curr; /* internal column pointer */
465 register int tcur;
| 464 int curr; /* internal column pointer */
465 int tcur;
|
466
467 if (troff)
468 fprintf(output, "\\h'|%dp'", (target - 1) * 7);
469 else {
470 if (current >= target)
471 return (current); /* line is already long enough */
472 curr = current;
473 while ((tcur = ((curr - 1) & tabmask) + tabsize + 1) <= target) {
474 putc('\t', output);
475 curr = tcur;
476 }
477 while (curr++ < target)
478 putc(' ', output); /* pad with final blanks */
479 }
480 return (target);
481}
482
483/*
484 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
485 *
486 * All rights reserved
487 *
488 *
489 * NAME: count_spaces
490 *
491 * FUNCTION: Find out where printing of a given string will leave the current
492 * character position on output.
493 *
494 * ALGORITHM: Run thru input string and add appropriate values to current
495 * position.
496 *
497 * RETURNS: Integer value of position after printing "buffer" starting in column
498 * "current".
499 *
500 * HISTORY: initial coding November 1976 D A Willcox of CAC
501 *
502 */
503int
504count_spaces(int current, char *buffer)
505/*
506 * this routine figures out where the character position will be after
507 * printing the text in buffer starting at column "current"
508 */
509{
| 466
467 if (troff)
468 fprintf(output, "\\h'|%dp'", (target - 1) * 7);
469 else {
470 if (current >= target)
471 return (current); /* line is already long enough */
472 curr = current;
473 while ((tcur = ((curr - 1) & tabmask) + tabsize + 1) <= target) {
474 putc('\t', output);
475 curr = tcur;
476 }
477 while (curr++ < target)
478 putc(' ', output); /* pad with final blanks */
479 }
480 return (target);
481}
482
483/*
484 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
485 *
486 * All rights reserved
487 *
488 *
489 * NAME: count_spaces
490 *
491 * FUNCTION: Find out where printing of a given string will leave the current
492 * character position on output.
493 *
494 * ALGORITHM: Run thru input string and add appropriate values to current
495 * position.
496 *
497 * RETURNS: Integer value of position after printing "buffer" starting in column
498 * "current".
499 *
500 * HISTORY: initial coding November 1976 D A Willcox of CAC
501 *
502 */
503int
504count_spaces(int current, char *buffer)
505/*
506 * this routine figures out where the character position will be after
507 * printing the text in buffer starting at column "current"
508 */
509{
|
510 register char *buf; /* used to look thru buffer */
511 register int cur; /* current character counter */
| 510 char *buf; /* used to look thru buffer */
511 int cur; /* current character counter */
|
512
513 cur = current;
514
515 for (buf = buffer; *buf != '\0'; ++buf) {
516 switch (*buf) {
517
518 case '\n':
519 case 014: /* form feed */
520 cur = 1;
521 break;
522
523 case '\t':
524 cur = ((cur - 1) & tabmask) + tabsize + 1;
525 break;
526
527 case 010: /* backspace */
528 --cur;
529 break;
530
531 default:
532 ++cur;
533 break;
534 } /* end of switch */
535 } /* end of for loop */
536 return (cur);
537}
538
539int found_err;
540
541void
542diag4(int level, const char *msg, int a, int b)
543{
544 if (level)
545 found_err = 1;
546 if (output == stdout) {
547 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
548 fprintf(stdout, msg, a, b);
549 fprintf(stdout, " */\n");
550 }
551 else {
552 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
553 fprintf(stderr, msg, a, b);
554 fprintf(stderr, "\n");
555 }
556}
557
558void
559diag3(int level, const char *msg, int a)
560{
561 if (level)
562 found_err = 1;
563 if (output == stdout) {
564 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
565 fprintf(stdout, msg, a);
566 fprintf(stdout, " */\n");
567 }
568 else {
569 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
570 fprintf(stderr, msg, a);
571 fprintf(stderr, "\n");
572 }
573}
574
575void
576diag2(int level, const char *msg)
577{
578 if (level)
579 found_err = 1;
580 if (output == stdout) {
581 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
582 fprintf(stdout, msg);
583 fprintf(stdout, " */\n");
584 }
585 else {
586 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
587 fprintf(stderr, msg);
588 fprintf(stderr, "\n");
589 }
590}
591
592void
593writefdef(struct fstate *f, int nm)
594{
595 fprintf(output, ".ds f%c %s\n.nr s%c %d\n",
596 nm, f->font, nm, f->size);
597}
598
599char *
600chfont(struct fstate *of, struct fstate *nf, char *s)
601{
602 if (of->font[0] != nf->font[0]
603 || of->font[1] != nf->font[1]) {
604 *s++ = '\\';
605 *s++ = 'f';
606 if (nf->font[1]) {
607 *s++ = '(';
608 *s++ = nf->font[0];
609 *s++ = nf->font[1];
610 }
611 else
612 *s++ = nf->font[0];
613 }
614 if (nf->size != of->size) {
615 *s++ = '\\';
616 *s++ = 's';
617 if (nf->size < of->size) {
618 *s++ = '-';
619 *s++ = '0' + of->size - nf->size;
620 }
621 else {
622 *s++ = '+';
623 *s++ = '0' + nf->size - of->size;
624 }
625 }
626 return s;
627}
628
629void
630parsefont(struct fstate *f, const char *s0)
631{
632 const char *s = s0;
633 int sizedelta = 0;
634
635 bzero(f, sizeof *f);
636 while (*s) {
637 if (isdigit(*s))
638 f->size = f->size * 10 + *s - '0';
639 else if (isupper(*s))
640 if (f->font[0])
641 f->font[1] = *s;
642 else
643 f->font[0] = *s;
644 else if (*s == 'c')
645 f->allcaps = 1;
646 else if (*s == '+')
647 sizedelta++;
648 else if (*s == '-')
649 sizedelta--;
650 else {
651 errx(1, "bad font specification: %s", s0);
652 }
653 s++;
654 }
655 if (f->font[0] == 0)
656 f->font[0] = 'R';
657 if (bodyf.size == 0)
658 bodyf.size = 11;
659 if (f->size == 0)
660 f->size = bodyf.size + sizedelta;
661 else if (sizedelta > 0)
662 f->size += bodyf.size;
663 else
664 f->size = bodyf.size - f->size;
665}
| 512
513 cur = current;
514
515 for (buf = buffer; *buf != '\0'; ++buf) {
516 switch (*buf) {
517
518 case '\n':
519 case 014: /* form feed */
520 cur = 1;
521 break;
522
523 case '\t':
524 cur = ((cur - 1) & tabmask) + tabsize + 1;
525 break;
526
527 case 010: /* backspace */
528 --cur;
529 break;
530
531 default:
532 ++cur;
533 break;
534 } /* end of switch */
535 } /* end of for loop */
536 return (cur);
537}
538
539int found_err;
540
541void
542diag4(int level, const char *msg, int a, int b)
543{
544 if (level)
545 found_err = 1;
546 if (output == stdout) {
547 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
548 fprintf(stdout, msg, a, b);
549 fprintf(stdout, " */\n");
550 }
551 else {
552 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
553 fprintf(stderr, msg, a, b);
554 fprintf(stderr, "\n");
555 }
556}
557
558void
559diag3(int level, const char *msg, int a)
560{
561 if (level)
562 found_err = 1;
563 if (output == stdout) {
564 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
565 fprintf(stdout, msg, a);
566 fprintf(stdout, " */\n");
567 }
568 else {
569 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
570 fprintf(stderr, msg, a);
571 fprintf(stderr, "\n");
572 }
573}
574
575void
576diag2(int level, const char *msg)
577{
578 if (level)
579 found_err = 1;
580 if (output == stdout) {
581 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
582 fprintf(stdout, msg);
583 fprintf(stdout, " */\n");
584 }
585 else {
586 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
587 fprintf(stderr, msg);
588 fprintf(stderr, "\n");
589 }
590}
591
592void
593writefdef(struct fstate *f, int nm)
594{
595 fprintf(output, ".ds f%c %s\n.nr s%c %d\n",
596 nm, f->font, nm, f->size);
597}
598
599char *
600chfont(struct fstate *of, struct fstate *nf, char *s)
601{
602 if (of->font[0] != nf->font[0]
603 || of->font[1] != nf->font[1]) {
604 *s++ = '\\';
605 *s++ = 'f';
606 if (nf->font[1]) {
607 *s++ = '(';
608 *s++ = nf->font[0];
609 *s++ = nf->font[1];
610 }
611 else
612 *s++ = nf->font[0];
613 }
614 if (nf->size != of->size) {
615 *s++ = '\\';
616 *s++ = 's';
617 if (nf->size < of->size) {
618 *s++ = '-';
619 *s++ = '0' + of->size - nf->size;
620 }
621 else {
622 *s++ = '+';
623 *s++ = '0' + nf->size - of->size;
624 }
625 }
626 return s;
627}
628
629void
630parsefont(struct fstate *f, const char *s0)
631{
632 const char *s = s0;
633 int sizedelta = 0;
634
635 bzero(f, sizeof *f);
636 while (*s) {
637 if (isdigit(*s))
638 f->size = f->size * 10 + *s - '0';
639 else if (isupper(*s))
640 if (f->font[0])
641 f->font[1] = *s;
642 else
643 f->font[0] = *s;
644 else if (*s == 'c')
645 f->allcaps = 1;
646 else if (*s == '+')
647 sizedelta++;
648 else if (*s == '-')
649 sizedelta--;
650 else {
651 errx(1, "bad font specification: %s", s0);
652 }
653 s++;
654 }
655 if (f->font[0] == 0)
656 f->font[0] = 'R';
657 if (bodyf.size == 0)
658 bodyf.size = 11;
659 if (f->size == 0)
660 f->size = bodyf.size + sizedelta;
661 else if (sizedelta > 0)
662 f->size += bodyf.size;
663 else
664 f->size = bodyf.size - f->size;
665}
|