io.c revision 1.34 1 1.34 rillig /* $NetBSD: io.c,v 1.34 2021/03/13 00:26:56 rillig Exp $ */
2 1.3 tls
3 1.19 kamil /*-
4 1.19 kamil * SPDX-License-Identifier: BSD-4-Clause
5 1.19 kamil *
6 1.19 kamil * Copyright (c) 1985 Sun Microsystems, Inc.
7 1.4 mrg * Copyright (c) 1980, 1993
8 1.4 mrg * The Regents of the University of California. All rights reserved.
9 1.1 cgd * All rights reserved.
10 1.1 cgd *
11 1.1 cgd * Redistribution and use in source and binary forms, with or without
12 1.1 cgd * modification, are permitted provided that the following conditions
13 1.1 cgd * are met:
14 1.1 cgd * 1. Redistributions of source code must retain the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer.
16 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 cgd * notice, this list of conditions and the following disclaimer in the
18 1.1 cgd * documentation and/or other materials provided with the distribution.
19 1.1 cgd * 3. All advertising materials mentioning features or use of this software
20 1.1 cgd * must display the following acknowledgement:
21 1.1 cgd * This product includes software developed by the University of
22 1.1 cgd * California, Berkeley and its contributors.
23 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
24 1.1 cgd * may be used to endorse or promote products derived from this software
25 1.1 cgd * without specific prior written permission.
26 1.1 cgd *
27 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 1.1 cgd * SUCH DAMAGE.
38 1.1 cgd */
39 1.1 cgd
40 1.19 kamil #if 0
41 1.19 kamil #ifndef lint
42 1.19 kamil static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 6/6/93";
43 1.19 kamil #endif /* not lint */
44 1.19 kamil #endif
45 1.19 kamil
46 1.5 lukem #include <sys/cdefs.h>
47 1.1 cgd #ifndef lint
48 1.19 kamil #if defined(__NetBSD__)
49 1.34 rillig __RCSID("$NetBSD: io.c,v 1.34 2021/03/13 00:26:56 rillig Exp $");
50 1.19 kamil #elif defined(__FreeBSD__)
51 1.19 kamil __FBSDID("$FreeBSD: head/usr.bin/indent/io.c 334927 2018-06-10 16:44:18Z pstef $");
52 1.19 kamil #endif
53 1.4 mrg #endif
54 1.1 cgd
55 1.5 lukem #include <ctype.h>
56 1.5 lukem #include <err.h>
57 1.1 cgd #include <stdio.h>
58 1.1 cgd #include <stdlib.h>
59 1.1 cgd #include <string.h>
60 1.20 christos #include <stdarg.h>
61 1.22 rillig
62 1.19 kamil #include "indent.h"
63 1.1 cgd
64 1.19 kamil int comment_open;
65 1.31 rillig static int paren_indent;
66 1.1 cgd
67 1.28 rillig static void
68 1.28 rillig output_char(char ch)
69 1.28 rillig {
70 1.28 rillig fputc(ch, output);
71 1.28 rillig }
72 1.28 rillig
73 1.28 rillig static void
74 1.28 rillig output_range(const char *s, const char *e)
75 1.28 rillig {
76 1.28 rillig fwrite(s, 1, (size_t)(e - s), output);
77 1.28 rillig }
78 1.28 rillig
79 1.29 rillig static inline void
80 1.28 rillig output_string(const char *s)
81 1.28 rillig {
82 1.28 rillig output_range(s, s + strlen(s));
83 1.28 rillig }
84 1.28 rillig
85 1.28 rillig static void
86 1.28 rillig output_int(int i)
87 1.28 rillig {
88 1.28 rillig fprintf(output, "%d", i);
89 1.28 rillig }
90 1.28 rillig
91 1.34 rillig static int
92 1.34 rillig output_indent(int old_ind, int new_ind)
93 1.34 rillig {
94 1.34 rillig int ind = old_ind;
95 1.34 rillig
96 1.34 rillig if (opt.use_tabs) {
97 1.34 rillig int tabsize = opt.tabsize;
98 1.34 rillig int n = new_ind / tabsize - ind / tabsize;
99 1.34 rillig if (n > 0)
100 1.34 rillig ind -= ind % tabsize;
101 1.34 rillig for (int i = 0; i < n; i++) {
102 1.34 rillig output_char('\t');
103 1.34 rillig ind += tabsize;
104 1.34 rillig }
105 1.34 rillig }
106 1.34 rillig
107 1.34 rillig for (; ind < new_ind; ind++)
108 1.34 rillig output_char(' ');
109 1.34 rillig
110 1.34 rillig return ind;
111 1.34 rillig }
112 1.34 rillig
113 1.26 rillig /*
114 1.26 rillig * dump_line is the routine that actually effects the printing of the new
115 1.26 rillig * source. It prints the label section, followed by the code section with
116 1.26 rillig * the appropriate nesting level, followed by any comments.
117 1.26 rillig */
118 1.5 lukem void
119 1.11 wiz dump_line(void)
120 1.26 rillig {
121 1.27 rillig int cur_col, target_col;
122 1.19 kamil static int not_first_line;
123 1.19 kamil
124 1.19 kamil if (ps.procname[0]) {
125 1.19 kamil ps.ind_level = 0;
126 1.19 kamil ps.procname[0] = 0;
127 1.19 kamil }
128 1.30 rillig
129 1.19 kamil if (s_code == e_code && s_lab == e_lab && s_com == e_com) {
130 1.19 kamil if (suppress_blanklines > 0)
131 1.19 kamil suppress_blanklines--;
132 1.19 kamil else {
133 1.19 kamil ps.bl_line = true;
134 1.19 kamil n_real_blanklines++;
135 1.19 kamil }
136 1.30 rillig } else if (!inhibit_formatting) {
137 1.19 kamil suppress_blanklines = 0;
138 1.19 kamil ps.bl_line = false;
139 1.19 kamil if (prefix_blankline_requested && not_first_line) {
140 1.19 kamil if (opt.swallow_optional_blanklines) {
141 1.19 kamil if (n_real_blanklines == 1)
142 1.19 kamil n_real_blanklines = 0;
143 1.30 rillig } else {
144 1.19 kamil if (n_real_blanklines == 0)
145 1.19 kamil n_real_blanklines = 1;
146 1.19 kamil }
147 1.19 kamil }
148 1.19 kamil while (--n_real_blanklines >= 0)
149 1.28 rillig output_char('\n');
150 1.19 kamil n_real_blanklines = 0;
151 1.19 kamil if (ps.ind_level == 0)
152 1.19 kamil ps.ind_stmt = 0; /* this is a class A kludge. dont do
153 1.19 kamil * additional statement indentation if we are
154 1.19 kamil * at bracket level 0 */
155 1.19 kamil
156 1.19 kamil if (e_lab != s_lab || e_code != s_code)
157 1.19 kamil ++code_lines; /* keep count of lines with code */
158 1.19 kamil
159 1.19 kamil
160 1.19 kamil if (e_lab != s_lab) { /* print lab, if any */
161 1.19 kamil if (comment_open) {
162 1.19 kamil comment_open = 0;
163 1.28 rillig output_string(".*/\n");
164 1.19 kamil }
165 1.19 kamil while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t'))
166 1.19 kamil e_lab--;
167 1.19 kamil *e_lab = '\0';
168 1.34 rillig cur_col = 1 + output_indent(0, compute_label_column() - 1);
169 1.19 kamil if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0
170 1.19 kamil || strncmp(s_lab, "#endif", 6) == 0)) {
171 1.19 kamil char *s = s_lab;
172 1.19 kamil if (e_lab[-1] == '\n') e_lab--;
173 1.25 rillig do {
174 1.28 rillig output_char(*s++);
175 1.25 rillig } while (s < e_lab && 'a' <= *s && *s <= 'z');
176 1.19 kamil while ((*s == ' ' || *s == '\t') && s < e_lab)
177 1.19 kamil s++;
178 1.28 rillig if (s < e_lab) {
179 1.28 rillig if (s[0] == '/' && s[1] == '*') {
180 1.28 rillig output_char('\t');
181 1.28 rillig output_range(s, e_lab);
182 1.28 rillig } else {
183 1.28 rillig output_string("\t/* ");
184 1.28 rillig output_range(s, e_lab);
185 1.28 rillig output_string(" */");
186 1.28 rillig }
187 1.28 rillig }
188 1.28 rillig } else
189 1.28 rillig output_range(s_lab, e_lab);
190 1.19 kamil cur_col = count_spaces(cur_col, s_lab);
191 1.30 rillig } else
192 1.19 kamil cur_col = 1; /* there is no label section */
193 1.19 kamil
194 1.19 kamil ps.pcase = false;
195 1.19 kamil
196 1.19 kamil if (s_code != e_code) { /* print code section, if any */
197 1.19 kamil char *p;
198 1.1 cgd
199 1.19 kamil if (comment_open) {
200 1.19 kamil comment_open = 0;
201 1.28 rillig output_string(".*/\n");
202 1.19 kamil }
203 1.34 rillig target_col = compute_code_column();
204 1.19 kamil {
205 1.19 kamil int i;
206 1.19 kamil
207 1.19 kamil for (i = 0; i < ps.p_l_follow; i++)
208 1.19 kamil if (ps.paren_indents[i] >= 0)
209 1.19 kamil ps.paren_indents[i] = -(ps.paren_indents[i] + target_col);
210 1.19 kamil }
211 1.34 rillig cur_col = 1 + output_indent(cur_col - 1, target_col - 1);
212 1.19 kamil for (p = s_code; p < e_code; p++)
213 1.19 kamil if (*p == (char) 0200)
214 1.28 rillig output_int(target_col * 7);
215 1.19 kamil else
216 1.28 rillig output_char(*p);
217 1.19 kamil cur_col = count_spaces(cur_col, s_code);
218 1.19 kamil }
219 1.19 kamil if (s_com != e_com) { /* print comment, if any */
220 1.19 kamil int target = ps.com_col;
221 1.19 kamil char *com_st = s_com;
222 1.19 kamil
223 1.19 kamil target += ps.comment_delta;
224 1.19 kamil while (*com_st == '\t') /* consider original indentation in
225 1.19 kamil * case this is a box comment */
226 1.19 kamil com_st++, target += opt.tabsize;
227 1.19 kamil while (target <= 0)
228 1.19 kamil if (*com_st == ' ')
229 1.19 kamil target++, com_st++;
230 1.19 kamil else if (*com_st == '\t') {
231 1.19 kamil target = opt.tabsize * (1 + (target - 1) / opt.tabsize) + 1;
232 1.19 kamil com_st++;
233 1.30 rillig } else
234 1.19 kamil target = 1;
235 1.19 kamil if (cur_col > target) { /* if comment can't fit on this line,
236 1.19 kamil * put it on next line */
237 1.28 rillig output_char('\n');
238 1.19 kamil cur_col = 1;
239 1.19 kamil ++ps.out_lines;
240 1.19 kamil }
241 1.19 kamil while (e_com > com_st && isspace((unsigned char)e_com[-1]))
242 1.19 kamil e_com--;
243 1.34 rillig (void)output_indent(cur_col - 1, target - 1);
244 1.28 rillig output_range(com_st, e_com);
245 1.19 kamil ps.comment_delta = ps.n_comment_delta;
246 1.19 kamil ++ps.com_lines; /* count lines with comments */
247 1.19 kamil }
248 1.19 kamil if (ps.use_ff)
249 1.28 rillig output_char('\014');
250 1.19 kamil else
251 1.28 rillig output_char('\n');
252 1.19 kamil ++ps.out_lines;
253 1.19 kamil if (ps.just_saw_decl == 1 && opt.blanklines_after_declarations) {
254 1.19 kamil prefix_blankline_requested = 1;
255 1.19 kamil ps.just_saw_decl = 0;
256 1.30 rillig } else
257 1.19 kamil prefix_blankline_requested = postfix_blankline_requested;
258 1.19 kamil postfix_blankline_requested = 0;
259 1.19 kamil }
260 1.24 rillig
261 1.24 rillig /* keep blank lines after '//' comments */
262 1.24 rillig if (e_com - s_com > 1 && s_com[1] == '/')
263 1.28 rillig output_range(s_token, e_token);
264 1.24 rillig
265 1.19 kamil ps.decl_on_line = ps.in_decl; /* if we are in the middle of a
266 1.1 cgd * declaration, remember that fact for
267 1.1 cgd * proper comment indentation */
268 1.19 kamil ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be
269 1.1 cgd * indented if we have not
270 1.1 cgd * completed this stmt and if
271 1.1 cgd * we are not in the middle of
272 1.1 cgd * a declaration */
273 1.19 kamil ps.use_ff = false;
274 1.19 kamil ps.dumped_decl_indent = 0;
275 1.19 kamil *(e_lab = s_lab) = '\0'; /* reset buffers */
276 1.19 kamil *(e_code = s_code) = '\0';
277 1.19 kamil *(e_com = s_com = combuf + 1) = '\0';
278 1.19 kamil ps.ind_level = ps.i_l_follow;
279 1.19 kamil ps.paren_level = ps.p_l_follow;
280 1.19 kamil if (ps.paren_level > 0)
281 1.31 rillig paren_indent = -ps.paren_indents[ps.paren_level - 1];
282 1.19 kamil not_first_line = 1;
283 1.1 cgd }
284 1.1 cgd
285 1.5 lukem int
286 1.34 rillig compute_code_column(void)
287 1.1 cgd {
288 1.19 kamil int target_col = opt.ind_size * ps.ind_level + 1;
289 1.19 kamil
290 1.30 rillig if (ps.paren_level) {
291 1.19 kamil if (!opt.lineup_to_parens)
292 1.19 kamil target_col += opt.continuation_indent *
293 1.19 kamil (2 * opt.continuation_indent == opt.ind_size ? 1 : ps.paren_level);
294 1.19 kamil else if (opt.lineup_to_parens_always)
295 1.31 rillig target_col = paren_indent;
296 1.19 kamil else {
297 1.19 kamil int w;
298 1.31 rillig int t = paren_indent;
299 1.1 cgd
300 1.19 kamil if ((w = count_spaces(t, s_code) - opt.max_col) > 0
301 1.19 kamil && count_spaces(target_col, s_code) <= opt.max_col) {
302 1.19 kamil t -= w + 1;
303 1.19 kamil if (t > target_col)
304 1.19 kamil target_col = t;
305 1.30 rillig } else
306 1.19 kamil target_col = t;
307 1.19 kamil }
308 1.30 rillig } else if (ps.ind_stmt)
309 1.19 kamil target_col += opt.continuation_indent;
310 1.19 kamil return target_col;
311 1.1 cgd }
312 1.1 cgd
313 1.5 lukem int
314 1.34 rillig compute_label_column(void)
315 1.1 cgd {
316 1.19 kamil return
317 1.19 kamil ps.pcase ? (int) (case_ind * opt.ind_size) + 1
318 1.1 cgd : *s_lab == '#' ? 1
319 1.19 kamil : opt.ind_size * (ps.ind_level - label_offset) + 1;
320 1.1 cgd }
321 1.1 cgd
322 1.1 cgd
323 1.1 cgd /*
324 1.1 cgd * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
325 1.5 lukem *
326 1.1 cgd * All rights reserved
327 1.5 lukem *
328 1.33 rillig * FUNCTION: Reads one block of input into the input buffer
329 1.1 cgd */
330 1.5 lukem void
331 1.11 wiz fill_buffer(void)
332 1.1 cgd { /* this routine reads stuff from the input */
333 1.19 kamil char *p;
334 1.19 kamil int i;
335 1.19 kamil FILE *f = input;
336 1.19 kamil
337 1.19 kamil if (bp_save != NULL) { /* there is a partly filled input buffer left */
338 1.19 kamil buf_ptr = bp_save; /* do not read anything, just switch buffers */
339 1.19 kamil buf_end = be_save;
340 1.19 kamil bp_save = be_save = NULL;
341 1.19 kamil if (buf_ptr < buf_end)
342 1.19 kamil return; /* only return if there is really something in
343 1.1 cgd * this buffer */
344 1.19 kamil }
345 1.19 kamil for (p = in_buffer;;) {
346 1.19 kamil if (p >= in_buffer_limit) {
347 1.19 kamil int size = (in_buffer_limit - in_buffer) * 2 + 10;
348 1.19 kamil int offset = p - in_buffer;
349 1.19 kamil in_buffer = realloc(in_buffer, size);
350 1.19 kamil if (in_buffer == NULL)
351 1.19 kamil errx(1, "input line too long");
352 1.19 kamil p = in_buffer + offset;
353 1.19 kamil in_buffer_limit = in_buffer + size - 2;
354 1.19 kamil }
355 1.19 kamil if ((i = getc(f)) == EOF) {
356 1.19 kamil *p++ = ' ';
357 1.19 kamil *p++ = '\n';
358 1.19 kamil had_eof = true;
359 1.19 kamil break;
360 1.1 cgd }
361 1.19 kamil if (i != '\0')
362 1.19 kamil *p++ = i;
363 1.19 kamil if (i == '\n')
364 1.19 kamil break;
365 1.19 kamil }
366 1.19 kamil buf_ptr = in_buffer;
367 1.19 kamil buf_end = p;
368 1.19 kamil if (p - in_buffer > 2 && p[-2] == '/' && p[-3] == '*') {
369 1.19 kamil if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0)
370 1.19 kamil fill_buffer(); /* flush indent error message */
371 1.19 kamil else {
372 1.19 kamil int com = 0;
373 1.19 kamil
374 1.19 kamil p = in_buffer;
375 1.19 kamil while (*p == ' ' || *p == '\t')
376 1.19 kamil p++;
377 1.19 kamil if (*p == '/' && p[1] == '*') {
378 1.19 kamil p += 2;
379 1.19 kamil while (*p == ' ' || *p == '\t')
380 1.19 kamil p++;
381 1.19 kamil if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E'
382 1.19 kamil && p[4] == 'N' && p[5] == 'T') {
383 1.19 kamil p += 6;
384 1.19 kamil while (*p == ' ' || *p == '\t')
385 1.19 kamil p++;
386 1.19 kamil if (*p == '*')
387 1.19 kamil com = 1;
388 1.19 kamil else if (*p == 'O') {
389 1.19 kamil if (*++p == 'N')
390 1.19 kamil p++, com = 1;
391 1.19 kamil else if (*p == 'F' && *++p == 'F')
392 1.19 kamil p++, com = 2;
393 1.19 kamil }
394 1.19 kamil while (*p == ' ' || *p == '\t')
395 1.19 kamil p++;
396 1.19 kamil if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) {
397 1.19 kamil if (s_com != e_com || s_lab != e_lab || s_code != e_code)
398 1.19 kamil dump_line();
399 1.19 kamil if (!(inhibit_formatting = com - 1)) {
400 1.19 kamil n_real_blanklines = 0;
401 1.19 kamil postfix_blankline_requested = 0;
402 1.19 kamil prefix_blankline_requested = 0;
403 1.19 kamil suppress_blanklines = 1;
404 1.1 cgd }
405 1.19 kamil }
406 1.1 cgd }
407 1.19 kamil }
408 1.1 cgd }
409 1.19 kamil }
410 1.19 kamil if (inhibit_formatting) {
411 1.19 kamil p = in_buffer;
412 1.25 rillig do {
413 1.28 rillig output_char(*p);
414 1.25 rillig } while (*p++ != '\n');
415 1.19 kamil }
416 1.1 cgd }
417 1.19 kamil
418 1.1 cgd /*
419 1.1 cgd * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
420 1.5 lukem *
421 1.1 cgd * All rights reserved
422 1.1 cgd */
423 1.1 cgd int
424 1.32 rillig count_spaces_until(int col, const char *buffer, const char *end)
425 1.1 cgd {
426 1.32 rillig for (const char *p = buffer; *p != '\0' && p != end; ++p) {
427 1.32 rillig switch (*p) {
428 1.1 cgd
429 1.19 kamil case '\n':
430 1.19 kamil case 014: /* form feed */
431 1.32 rillig col = 1;
432 1.19 kamil break;
433 1.19 kamil
434 1.19 kamil case '\t':
435 1.32 rillig col = 1 + opt.tabsize * ((col - 1) / opt.tabsize + 1);
436 1.19 kamil break;
437 1.19 kamil
438 1.19 kamil case 010: /* backspace */
439 1.32 rillig --col;
440 1.19 kamil break;
441 1.19 kamil
442 1.19 kamil default:
443 1.32 rillig ++col;
444 1.19 kamil break;
445 1.19 kamil } /* end of switch */
446 1.19 kamil } /* end of for loop */
447 1.32 rillig return col;
448 1.1 cgd }
449 1.1 cgd
450 1.19 kamil int
451 1.32 rillig count_spaces(int col, const char *buffer)
452 1.1 cgd {
453 1.32 rillig return count_spaces_until(col, buffer, NULL);
454 1.1 cgd }
455 1.1 cgd
456 1.5 lukem void
457 1.20 christos diag(int level, const char *msg, ...)
458 1.1 cgd {
459 1.20 christos va_list ap;
460 1.20 christos const char *s, *e;
461 1.20 christos
462 1.19 kamil if (level)
463 1.19 kamil found_err = 1;
464 1.1 cgd
465 1.19 kamil if (output == stdout) {
466 1.20 christos s = "/**INDENT** ";
467 1.20 christos e = " */";
468 1.20 christos } else {
469 1.20 christos s = e = "";
470 1.19 kamil }
471 1.1 cgd
472 1.20 christos va_start(ap, msg);
473 1.20 christos fprintf(stderr, "%s%s@%d: ", s, level == 0 ? "Warning" : "Error", line_no);
474 1.20 christos vfprintf(stderr, msg, ap);
475 1.20 christos fprintf(stderr, "%s\n", e);
476 1.20 christos va_end(ap);
477 1.1 cgd }
478