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. 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.
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
33 * @(#)io.c 8.1 (Berkeley) 6/6/93
34 * $FreeBSD: head/usr.bin/indent/io.c 334927 2018-06-10 16:44:18Z pstef $
42 #include "indent_globs.h"
46 static int paren_target;
47 static int pad_output(int current, int target);
51 { /* dump_line is the routine that actually
52 * effects the printing of the new source. It
53 * prints the label section, followed by the
54 * code section with the appropriate nesting
55 * level, followed by any comments */
58 static int not_first_line;
64 if (s_code == e_code && s_lab == e_lab && s_com == e_com) {
65 if (suppress_blanklines > 0)
66 suppress_blanklines--;
72 else if (!inhibit_formatting) {
73 suppress_blanklines = 0;
75 if (prefix_blankline_requested && not_first_line) {
76 if (opt.swallow_optional_blanklines) {
77 if (n_real_blanklines == 1)
78 n_real_blanklines = 0;
81 if (n_real_blanklines == 0)
82 n_real_blanklines = 1;
85 while (--n_real_blanklines >= 0)
87 n_real_blanklines = 0;
88 if (ps.ind_level == 0)
89 ps.ind_stmt = 0; /* this is a class A kludge. dont do
90 * additional statement indentation if we are
91 * at bracket level 0 */
93 if (e_lab != s_lab || e_code != s_code)
94 ++code_lines; /* keep count of lines with code */
97 if (e_lab != s_lab) { /* print lab, if any */
100 fprintf(output, ".*/\n");
102 while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t'))
105 cur_col = pad_output(1, compute_label_target());
106 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0
107 || strncmp(s_lab, "#endif", 6) == 0)) {
109 if (e_lab[-1] == '\n') e_lab--;
110 do putc(*s++, output);
111 while (s < e_lab && 'a' <= *s && *s<='z');
112 while ((*s == ' ' || *s == '\t') && s < e_lab)
115 fprintf(output, s[0]=='/' && s[1]=='*' ? "\t%.*s" : "\t/* %.*s */",
116 (int)(e_lab - s), s);
118 else fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab);
119 cur_col = count_spaces(cur_col, s_lab);
122 cur_col = 1; /* there is no label section */
126 if (s_code != e_code) { /* print code section, if any */
131 fprintf(output, ".*/\n");
133 target_col = compute_code_target();
137 for (i = 0; i < ps.p_l_follow; i++)
138 if (ps.paren_indents[i] >= 0)
139 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col);
141 cur_col = pad_output(cur_col, target_col);
142 for (p = s_code; p < e_code; p++)
143 if (*p == (char) 0200)
144 fprintf(output, "%d", target_col * 7);
147 cur_col = count_spaces(cur_col, s_code);
149 if (s_com != e_com) { /* print comment, if any */
150 int target = ps.com_col;
151 char *com_st = s_com;
153 target += ps.comment_delta;
154 while (*com_st == '\t') /* consider original indentation in
155 * case this is a box comment */
156 com_st++, target += opt.tabsize;
160 else if (*com_st == '\t') {
161 target = opt.tabsize * (1 + (target - 1) / opt.tabsize) + 1;
166 if (cur_col > target) { /* if comment can't fit on this line,
167 * put it on next line */
172 while (e_com > com_st && isspace((unsigned char)e_com[-1]))
174 (void)pad_output(cur_col, target);
175 fwrite(com_st, e_com - com_st, 1, output);
176 ps.comment_delta = ps.n_comment_delta;
177 ++ps.com_lines; /* count lines with comments */
180 putc('\014', output);
184 if (ps.just_saw_decl == 1 && opt.blanklines_after_declarations) {
185 prefix_blankline_requested = 1;
186 ps.just_saw_decl = 0;
189 prefix_blankline_requested = postfix_blankline_requested;
190 postfix_blankline_requested = 0;
192 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a
193 * declaration, remember that fact for
194 * proper comment indentation */
195 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be
196 * indented if we have not
197 * completed this stmt and if
198 * we are not in the middle of
201 ps.dumped_decl_indent = 0;
202 *(e_lab = s_lab) = '\0'; /* reset buffers */
203 *(e_code = s_code) = '\0';
204 *(e_com = s_com = combuf + 1) = '\0';
205 ps.ind_level = ps.i_l_follow;
206 ps.paren_level = ps.p_l_follow;
207 if (ps.paren_level > 0)
208 paren_target = -ps.paren_indents[ps.paren_level - 1];
213 compute_code_target(void)
215 int target_col = opt.ind_size * ps.ind_level + 1;
218 if (!opt.lineup_to_parens)
219 target_col += opt.continuation_indent *
220 (2 * opt.continuation_indent == opt.ind_size ? 1 : ps.paren_level);
221 else if (opt.lineup_to_parens_always)
222 target_col = paren_target;
225 int t = paren_target;
227 if ((w = count_spaces(t, s_code) - opt.max_col) > 0
228 && count_spaces(target_col, s_code) <= opt.max_col) {
236 else if (ps.ind_stmt)
237 target_col += opt.continuation_indent;
242 compute_label_target(void)
245 ps.pcase ? (int) (case_ind * opt.ind_size) + 1
247 : opt.ind_size * (ps.ind_level - label_offset) + 1;
252 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
254 * All rights reserved
259 * FUNCTION: Reads one block of input into input_buffer
261 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A
262 * Willcox of CAC Added check for switch back to partly full input
263 * buffer from temporary buffer
268 { /* this routine reads stuff from the input */
273 if (bp_save != NULL) { /* there is a partly filled input buffer left */
274 buf_ptr = bp_save; /* do not read anything, just switch buffers */
276 bp_save = be_save = NULL;
277 if (buf_ptr < buf_end)
278 return; /* only return if there is really something in
281 for (p = in_buffer;;) {
282 if (p >= in_buffer_limit) {
283 int size = (in_buffer_limit - in_buffer) * 2 + 10;
284 int offset = p - in_buffer;
285 in_buffer = realloc(in_buffer, size);
286 if (in_buffer == NULL)
287 errx(1, "input line too long");
288 p = in_buffer + offset;
289 in_buffer_limit = in_buffer + size - 2;
291 if ((i = getc(f)) == EOF) {
304 if (p - in_buffer > 2 && p[-2] == '/' && p[-3] == '*') {
305 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0)
306 fill_buffer(); /* flush indent error message */
311 while (*p == ' ' || *p == '\t')
313 if (*p == '/' && p[1] == '*') {
315 while (*p == ' ' || *p == '\t')
317 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E'
318 && p[4] == 'N' && p[5] == 'T') {
320 while (*p == ' ' || *p == '\t')
324 else if (*p == 'O') {
327 else if (*p == 'F' && *++p == 'F')
330 while (*p == ' ' || *p == '\t')
332 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) {
333 if (s_com != e_com || s_lab != e_lab || s_code != e_code)
335 if (!(inhibit_formatting = com - 1)) {
336 n_real_blanklines = 0;
337 postfix_blankline_requested = 0;
338 prefix_blankline_requested = 0;
339 suppress_blanklines = 1;
346 if (inhibit_formatting) {
350 while (*p++ != '\n');
355 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
357 * All rights reserved
362 * FUNCTION: Writes tabs and spaces to move the current column up to the desired
365 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf.
367 * PARAMETERS: current integer The current column target
368 * nteger The desired column
370 * RETURNS: Integer value of the new column. (If current >= target, no action is
371 * taken, and current is returned.
377 * CALLED BY: dump_line
379 * HISTORY: initial coding November 1976 D A Willcox of CAC
383 pad_output(int current, int target)
384 /* writes tabs and blanks (if necessary) to
385 * get the current output position up to the
387 /* current: the current column value */
388 /* target: position we want it at */
390 int curr; /* internal column pointer */
392 if (current >= target)
393 return (current); /* line is already long enough */
398 while ((tcur = opt.tabsize * (1 + (curr - 1) / opt.tabsize) + 1) <= target) {
403 while (curr++ < target)
404 putc(' ', output); /* pad with final blanks */
410 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois
412 * All rights reserved
417 * FUNCTION: Find out where printing of a given string will leave the current
418 * character position on output.
420 * ALGORITHM: Run thru input string and add appropriate values to current
423 * RETURNS: Integer value of position after printing "buffer" starting in column
426 * HISTORY: initial coding November 1976 D A Willcox of CAC
430 count_spaces_until(int cur, char *buffer, char *end)
432 * this routine figures out where the character position will be after
433 * printing the text in buffer starting at column "current"
436 char *buf; /* used to look thru buffer */
438 for (buf = buffer; *buf != '\0' && buf != end; ++buf) {
442 case 014: /* form feed */
447 cur = opt.tabsize * (1 + (cur - 1) / opt.tabsize) + 1;
450 case 010: /* backspace */
457 } /* end of switch */
458 } /* end of for loop */
463 count_spaces(int cur, char *buffer)
465 return (count_spaces_until(cur, buffer, NULL));
469 diag4(int level, const char *msg, int a, int b)
473 if (output == stdout) {
474 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
475 fprintf(stdout, msg, a, b);
476 fprintf(stdout, " */\n");
479 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
480 fprintf(stderr, msg, a, b);
481 fprintf(stderr, "\n");
486 diag3(int level, const char *msg, int a)
490 if (output == stdout) {
491 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
492 fprintf(stdout, msg, a);
493 fprintf(stdout, " */\n");
496 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
497 fprintf(stderr, msg, a);
498 fprintf(stderr, "\n");
503 diag2(int level, const char *msg)
507 if (output == stdout) {
508 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no);
509 fprintf(stdout, "%s", msg);
510 fprintf(stdout, " */\n");
513 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no);
514 fprintf(stderr, "%s", msg);
515 fprintf(stderr, "\n");