2 * SPDX-License-Identifier: BSD-4-Clause
4 * Copyright (c) 1985 Sun Microsystems, Inc.
5 * Copyright (c) 1980, 1993
6 * The Regents of the University of California. All rights reserved.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 6/6/93";
44 #include <sys/cdefs.h>
45 __FBSDID("$FreeBSD$");
52 #include "indent_globs.h"
57 int n_real_blanklines;
58 int prefix_blankline_requested, postfix_blankline_requested;
61 int inhibit_formatting;
62 int suppress_blanklines;
65 static int paren_target;
66 static int pad_output(int current, int target);
70 { /* dump_line is the routine that actually
71 * effects the printing of the new source. It
72 * prints the label section, followed by the
73 * code section with the appropriate nesting
74 * level, followed by any comments */
77 static int not_first_line;
83 if (s_code == e_code && s_lab == e_lab && s_com == e_com) {
84 if (suppress_blanklines > 0)
85 suppress_blanklines--;
91 else if (!inhibit_formatting) {
92 suppress_blanklines = 0;
94 if (prefix_blankline_requested && not_first_line) {
95 if (opt.swallow_optional_blanklines) {
96 if (n_real_blanklines == 1)
97 n_real_blanklines = 0;
100 if (n_real_blanklines == 0)
101 n_real_blanklines = 1;
104 while (--n_real_blanklines >= 0)
106 n_real_blanklines = 0;
107 if (ps.ind_level == 0)
108 ps.ind_stmt = 0; /* this is a class A kludge. dont do
109 * additional statement indentation if we are
110 * at bracket level 0 */
112 if (e_lab != s_lab || e_code != s_code)
113 ++code_lines; /* keep count of lines with code */
116 if (e_lab != s_lab) { /* print lab, if any */
119 fprintf(output, ".*/\n");
121 while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t'))
124 cur_col = pad_output(1, compute_label_target());
125 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0
126 || strncmp(s_lab, "#endif", 6) == 0)) {
128 if (e_lab[-1] == '\n') e_lab--;
129 do putc(*s++, output);
130 while (s < e_lab && 'a' <= *s && *s<='z');
131 while ((*s == ' ' || *s == '\t') && s < e_lab)
134 fprintf(output, s[0]=='/' && s[1]=='*' ? "\t%.*s" : "\t/* %.*s */",
135 (int)(e_lab - s), s);
137 else fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab);
138 cur_col = count_spaces(cur_col, s_lab);
141 cur_col = 1; /* there is no label section */
145 if (s_code != e_code) { /* print code section, if any */
150 fprintf(output, ".*/\n");
152 target_col = compute_code_target();
156 for (i = 0; i < ps.p_l_follow; i++)
157 if (ps.paren_indents[i] >= 0)
158 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col);
160 cur_col = pad_output(cur_col, target_col);
161 for (p = s_code; p < e_code; p++)
162 if (*p == (char) 0200)
163 fprintf(output, "%d", target_col * 7);
166 cur_col = count_spaces(cur_col, s_code);
168 if (s_com != e_com) { /* print comment, if any */
169 int target = ps.com_col;
170 char *com_st = s_com;
172 target += ps.comment_delta;
173 while (*com_st == '\t') /* consider original indentation in
174 * case this is a box comment */
175 com_st++, target += opt.tabsize;
179 else if (*com_st == '\t') {
180 target = opt.tabsize * (1 + (target - 1) / opt.tabsize) + 1;
185 if (cur_col > target) { /* if comment can't fit on this line,
186 * put it on next line */
191 while (e_com > com_st && isspace((unsigned char)e_com[-1]))
193 (void)pad_output(cur_col, target);
194 fwrite(com_st, e_com - com_st, 1, output);
195 ps.comment_delta = ps.n_comment_delta;
196 ++ps.com_lines; /* count lines with comments */
199 putc('\014', output);
203 if (ps.just_saw_decl == 1 && opt.blanklines_after_declarations) {
204 prefix_blankline_requested = 1;
205 ps.just_saw_decl = 0;
208 prefix_blankline_requested = postfix_blankline_requested;
209 postfix_blankline_requested = 0;
211 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a
212 * declaration, remember that fact for
213 * proper comment indentation */
214 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be
215 * indented if we have not
216 * completed this stmt and if
217 * we are not in the middle of
220 ps.dumped_decl_indent = 0;
221 *(e_lab = s_lab) = '\0'; /* reset buffers */
222 *(e_code = s_code) = '\0';
223 *(e_com = s_com = combuf + 1) = '\0';
224 ps.ind_level = ps.i_l_follow;
225 ps.paren_level = ps.p_l_follow;
226 if (ps.paren_level > 0)
227 paren_target = -ps.paren_indents[ps.paren_level - 1];
232 compute_code_target(void)
234 int target_col = opt.ind_size * ps.ind_level + 1;
237 if (!opt.lineup_to_parens)
238 target_col += opt.continuation_indent *
239 (2 * opt.continuation_indent == opt.ind_size ? 1 : ps.paren_level);
240 else if (opt.lineup_to_parens_always)
241 target_col = paren_target;
244 int t = paren_target;
246 if ((w = count_spaces(t, s_code) - opt.max_col) > 0
247 && count_spaces(target_col, s_code) <= opt.max_col) {
255 else if (ps.ind_stmt)
256 target_col += opt.continuation_indent;
261 compute_label_target(void)
264 ps.pcase ? (int) (case_ind * opt.ind_size) + 1
266 : opt.ind_size * (ps.ind_level - label_offset) + 1;
271 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
273 * All rights reserved
278 * FUNCTION: Reads one block of input into input_buffer
280 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A
281 * Willcox of CAC Added check for switch back to partly full input
282 * buffer from temporary buffer
287 { /* this routine reads stuff from the input */
292 if (bp_save != NULL) { /* there is a partly filled input buffer left */
293 buf_ptr = bp_save; /* do not read anything, just switch buffers */
295 bp_save = be_save = NULL;
296 if (buf_ptr < buf_end)
297 return; /* only return if there is really something in
300 for (p = in_buffer;;) {
301 if (p >= in_buffer_limit) {
302 int size = (in_buffer_limit - in_buffer) * 2 + 10;
303 int offset = p - in_buffer;
304 in_buffer = realloc(in_buffer, size);
305 if (in_buffer == NULL)
306 errx(1, "input line too long");
307 p = in_buffer + offset;
308 in_buffer_limit = in_buffer + size - 2;
310 if ((i = getc(f)) == EOF) {
323 if (p - in_buffer > 2 && p[-2] == '/' && p[-3] == '*') {
324 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0)
325 fill_buffer(); /* flush indent error message */
330 while (*p == ' ' || *p == '\t')
332 if (*p == '/' && p[1] == '*') {
334 while (*p == ' ' || *p == '\t')
336 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E'
337 && p[4] == 'N' && p[5] == 'T') {
339 while (*p == ' ' || *p == '\t')
343 else if (*p == 'O') {
346 else if (*p == 'F' && *++p == 'F')
349 while (*p == ' ' || *p == '\t')
351 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) {
352 if (s_com != e_com || s_lab != e_lab || s_code != e_code)
354 if (!(inhibit_formatting = com - 1)) {
355 n_real_blanklines = 0;
356 postfix_blankline_requested = 0;
357 prefix_blankline_requested = 0;
358 suppress_blanklines = 1;
365 if (inhibit_formatting) {
369 while (*p++ != '\n');
374 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
376 * All rights reserved
381 * FUNCTION: Writes tabs and spaces to move the current column up to the desired
384 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf.
386 * PARAMETERS: current integer The current column target
387 * nteger The desired column
389 * RETURNS: Integer value of the new column. (If current >= target, no action is
390 * taken, and current is returned.
396 * CALLED BY: dump_line
398 * HISTORY: initial coding November 1976 D A Willcox of CAC
402 pad_output(int current, int target)
403 /* writes tabs and blanks (if necessary) to
404 * get the current output position up to the
406 /* current: the current column value */
407 /* target: position we want it at */
409 int curr; /* internal column pointer */
411 if (current >= target)
412 return (current); /* line is already long enough */
417 while ((tcur = opt.tabsize * (1 + (curr - 1) / opt.tabsize) + 1) <= target) {
422 while (curr++ < target)
423 putc(' ', output); /* pad with final blanks */
429 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
431 * All rights reserved
436 * FUNCTION: Find out where printing of a given string will leave the current
437 * character position on output.
439 * ALGORITHM: Run thru input string and add appropriate values to current
442 * RETURNS: Integer value of position after printing "buffer" starting in column
445 * HISTORY: initial coding November 1976 D A Willcox of CAC
449 count_spaces_until(int cur, char *buffer, char *end)
451 * this routine figures out where the character position will be after
452 * printing the text in buffer starting at column "current"
455 char *buf; /* used to look thru buffer */
457 for (buf = buffer; *buf != '\0' && buf != end; ++buf) {
461 case 014: /* form feed */
466 cur = opt.tabsize * (1 + (cur - 1) / opt.tabsize) + 1;
469 case 010: /* backspace */
476 } /* end of switch */
477 } /* end of for loop */
482 count_spaces(int cur, char *buffer)
484 return (count_spaces_until(cur, buffer, NULL));
488 diag4(int level, const char *msg, int a, int b)
492 if (output == stdout) {
493 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
494 fprintf(stdout, msg, a, b);
495 fprintf(stdout, " */\n");
498 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
499 fprintf(stderr, msg, a, b);
500 fprintf(stderr, "\n");
505 diag3(int level, const char *msg, int a)
509 if (output == stdout) {
510 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
511 fprintf(stdout, msg, a);
512 fprintf(stdout, " */\n");
515 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
516 fprintf(stderr, msg, a);
517 fprintf(stderr, "\n");
522 diag2(int level, const char *msg)
526 if (output == stdout) {
527 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
528 fprintf(stdout, "%s", msg);
529 fprintf(stdout, " */\n");
532 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
533 fprintf(stderr, "%s", msg);
534 fprintf(stderr, "\n");