indent.h revision 1.68 1 1.68 rillig /* $NetBSD: indent.h,v 1.68 2021/10/31 09:52:37 rillig Exp $ */
2 1.1 kamil
3 1.1 kamil /*-
4 1.1 kamil * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
5 1.1 kamil *
6 1.1 kamil * Copyright (c) 2001 Jens Schweikhardt
7 1.1 kamil * All rights reserved.
8 1.1 kamil *
9 1.1 kamil * Redistribution and use in source and binary forms, with or without
10 1.1 kamil * modification, are permitted provided that the following conditions
11 1.1 kamil * are met:
12 1.1 kamil * 1. Redistributions of source code must retain the above copyright
13 1.1 kamil * notice, this list of conditions and the following disclaimer.
14 1.1 kamil * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 kamil * notice, this list of conditions and the following disclaimer in the
16 1.1 kamil * documentation and/or other materials provided with the distribution.
17 1.1 kamil *
18 1.1 kamil * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
19 1.1 kamil * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 1.1 kamil * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 1.1 kamil * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE
22 1.1 kamil * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 1.1 kamil * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 1.1 kamil * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 1.1 kamil * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 1.1 kamil * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 1.1 kamil * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 1.1 kamil * SUCH DAMAGE.
29 1.1 kamil */
30 1.31 rillig /*-
31 1.31 rillig * SPDX-License-Identifier: BSD-4-Clause
32 1.31 rillig *
33 1.31 rillig * Copyright (c) 1985 Sun Microsystems, Inc.
34 1.31 rillig * Copyright (c) 1980, 1993
35 1.31 rillig * The Regents of the University of California. All rights reserved.
36 1.31 rillig * All rights reserved.
37 1.31 rillig *
38 1.31 rillig * Redistribution and use in source and binary forms, with or without
39 1.31 rillig * modification, are permitted provided that the following conditions
40 1.31 rillig * are met:
41 1.31 rillig * 1. Redistributions of source code must retain the above copyright
42 1.31 rillig * notice, this list of conditions and the following disclaimer.
43 1.31 rillig * 2. Redistributions in binary form must reproduce the above copyright
44 1.31 rillig * notice, this list of conditions and the following disclaimer in the
45 1.31 rillig * documentation and/or other materials provided with the distribution.
46 1.31 rillig * 3. All advertising materials mentioning features or use of this software
47 1.31 rillig * must display the following acknowledgement:
48 1.31 rillig * This product includes software developed by the University of
49 1.31 rillig * California, Berkeley and its contributors.
50 1.31 rillig * 4. Neither the name of the University nor the names of its contributors
51 1.31 rillig * may be used to endorse or promote products derived from this software
52 1.31 rillig * without specific prior written permission.
53 1.31 rillig *
54 1.31 rillig * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 1.31 rillig * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 1.31 rillig * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 1.31 rillig * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 1.31 rillig * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 1.31 rillig * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 1.31 rillig * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 1.31 rillig * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 1.31 rillig * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 1.31 rillig * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 1.31 rillig * SUCH DAMAGE.
65 1.31 rillig */
66 1.1 kamil
67 1.1 kamil #if 0
68 1.1 kamil __FBSDID("$FreeBSD: head/usr.bin/indent/indent.h 336333 2018-07-16 05:46:50Z pstef $");
69 1.1 kamil #endif
70 1.1 kamil
71 1.20 rillig #include <stdbool.h>
72 1.65 rillig #include <stdio.h>
73 1.20 rillig
74 1.49 rillig typedef enum lexer_symbol {
75 1.49 rillig lsym_eof,
76 1.49 rillig lsym_preprocessing, /* '#' */
77 1.49 rillig lsym_newline,
78 1.49 rillig lsym_form_feed,
79 1.53 rillig lsym_comment, /* the initial '/' '*' or '//' of a comment */
80 1.49 rillig lsym_lparen_or_lbracket,
81 1.49 rillig lsym_rparen_or_rbracket,
82 1.49 rillig lsym_lbrace,
83 1.49 rillig lsym_rbrace,
84 1.49 rillig lsym_period,
85 1.49 rillig lsym_unary_op, /* e.g. '+' or '&' */
86 1.49 rillig lsym_binary_op, /* e.g. '<<' or '+' or '&&' or '/=' */
87 1.49 rillig lsym_postfix_op, /* trailing '++' or '--' */
88 1.49 rillig lsym_question, /* the '?' from a '?:' expression */
89 1.49 rillig lsym_colon,
90 1.49 rillig lsym_comma,
91 1.49 rillig lsym_semicolon,
92 1.49 rillig lsym_typedef,
93 1.49 rillig lsym_storage_class,
94 1.49 rillig lsym_type,
95 1.53 rillig lsym_tag, /* 'struct', 'union' or 'enum' */
96 1.53 rillig lsym_case_label, /* 'case' or 'default' */
97 1.49 rillig lsym_string_prefix, /* 'L' */
98 1.49 rillig lsym_ident, /* identifier, constant or string */
99 1.49 rillig lsym_funcname,
100 1.49 rillig lsym_do,
101 1.49 rillig lsym_else,
102 1.49 rillig lsym_for,
103 1.49 rillig lsym_if,
104 1.49 rillig lsym_switch,
105 1.49 rillig lsym_while,
106 1.49 rillig } lexer_symbol;
107 1.49 rillig
108 1.49 rillig typedef enum parser_symbol {
109 1.49 rillig psym_semicolon, /* rather a placeholder than a semicolon */
110 1.49 rillig psym_lbrace,
111 1.49 rillig psym_rbrace,
112 1.49 rillig psym_decl,
113 1.49 rillig psym_stmt,
114 1.49 rillig psym_stmt_list,
115 1.49 rillig psym_for_exprs, /* 'for' '(' ... ')' */
116 1.49 rillig psym_if_expr, /* 'if' '(' expr ')' */
117 1.49 rillig psym_if_expr_stmt, /* 'if' '(' expr ')' stmt */
118 1.49 rillig psym_if_expr_stmt_else, /* 'if' '(' expr ')' stmt 'else' */
119 1.49 rillig psym_else, /* 'else' */
120 1.49 rillig psym_switch_expr, /* 'switch' '(' expr ')' */
121 1.49 rillig psym_do, /* 'do' */
122 1.49 rillig psym_do_stmt, /* 'do' stmt */
123 1.49 rillig psym_while_expr, /* 'while' '(' expr ')' */
124 1.49 rillig } parser_symbol;
125 1.49 rillig
126 1.49 rillig typedef enum stmt_head {
127 1.49 rillig hd_0, /* placeholder for uninitialized */
128 1.49 rillig hd_for,
129 1.49 rillig hd_if,
130 1.49 rillig hd_switch,
131 1.49 rillig hd_while,
132 1.49 rillig } stmt_head;
133 1.31 rillig
134 1.31 rillig #define sc_size 5000 /* size of save_com buffer */
135 1.31 rillig
136 1.31 rillig
137 1.61 rillig /* A range of characters, in some cases null-terminated. */
138 1.31 rillig struct buffer {
139 1.61 rillig char *s; /* start of the usable text */
140 1.61 rillig char *e; /* end of the usable text */
141 1.61 rillig char *buf; /* start of the allocated memory */
142 1.61 rillig char *l; /* end of the allocated memory */
143 1.31 rillig };
144 1.31 rillig
145 1.34 rillig extern FILE *input;
146 1.34 rillig extern FILE *output;
147 1.31 rillig
148 1.61 rillig extern struct buffer inp; /* one line of input, ready to be split into
149 1.61 rillig * tokens */
150 1.31 rillig
151 1.61 rillig extern struct buffer token; /* the current token to be processed, is
152 1.61 rillig * typically copied to the buffer 'code',
153 1.61 rillig * or in some cases to 'lab'. */
154 1.61 rillig
155 1.61 rillig extern struct buffer lab; /* the label or preprocessor directive */
156 1.61 rillig extern struct buffer code; /* the main part of the current line of code */
157 1.61 rillig extern struct buffer com; /* the trailing comment of the line, or the
158 1.61 rillig * start or end of a multi-line comment */
159 1.31 rillig
160 1.34 rillig extern char sc_buf[sc_size]; /* input text is saved here when looking for
161 1.31 rillig * the brace after an if, while, etc */
162 1.34 rillig extern char *save_com; /* start of the comment stored in sc_buf */
163 1.31 rillig
164 1.34 rillig extern char *saved_inp_s; /* saved value of inp.s when taking input from
165 1.34 rillig * save_com */
166 1.34 rillig extern char *saved_inp_e; /* similarly saved value of inp.e */
167 1.31 rillig
168 1.31 rillig
169 1.31 rillig extern struct options {
170 1.34 rillig bool blanklines_around_conditional_compilation;
171 1.34 rillig bool blanklines_after_decl_at_top; /* this is vaguely similar to
172 1.34 rillig * blanklines_after_decl except that
173 1.34 rillig * it only applies to the first set of
174 1.34 rillig * declarations in a procedure (just
175 1.34 rillig * after the first '{') and it causes
176 1.34 rillig * a blank line to be generated even
177 1.34 rillig * if there are no declarations */
178 1.34 rillig bool blanklines_after_decl;
179 1.34 rillig bool blanklines_after_procs;
180 1.34 rillig bool blanklines_before_block_comments;
181 1.34 rillig bool break_after_comma; /* whether to break declarations after commas */
182 1.34 rillig bool brace_same_line; /* whether brace should be on same line as if,
183 1.34 rillig * while, etc */
184 1.34 rillig bool blank_after_sizeof; /* whether a blank should always be inserted
185 1.34 rillig * after sizeof */
186 1.34 rillig bool comment_delimiter_on_blankline;
187 1.34 rillig int decl_comment_column; /* the column in which comments after
188 1.31 rillig * declarations should be put */
189 1.34 rillig bool cuddle_else; /* whether 'else' should cuddle up to '}' */
190 1.34 rillig int continuation_indent; /* the indentation between the edge of code
191 1.34 rillig * and continuation lines */
192 1.34 rillig float case_indent; /* The distance (measured in indentation
193 1.31 rillig * levels) to indent case labels from the
194 1.31 rillig * switch statement */
195 1.34 rillig int comment_column; /* the column in which comments to the right
196 1.31 rillig * of code should start */
197 1.34 rillig int decl_indent; /* indentation of identifier in declaration */
198 1.34 rillig bool ljust_decl; /* true if declarations should be left
199 1.31 rillig * justified */
200 1.34 rillig int unindent_displace; /* comments not to the right of code will be
201 1.34 rillig * placed this many indentation levels to the
202 1.34 rillig * left of code */
203 1.34 rillig bool extra_expr_indent; /* whether continuation lines from the
204 1.34 rillig * expression part of "if(e)", "while(e)",
205 1.34 rillig * "for(e;e;e)" should be indented an extra
206 1.34 rillig * tab stop so that they don't conflict with
207 1.34 rillig * the code that follows */
208 1.34 rillig bool else_if; /* whether else-if pairs should be handled
209 1.31 rillig * specially */
210 1.34 rillig bool function_brace_split; /* split function declaration and brace onto
211 1.34 rillig * separate lines */
212 1.34 rillig bool format_col1_comments; /* If comments which start in column 1 are to
213 1.34 rillig * be magically reformatted (just like
214 1.34 rillig * comments that begin in later columns) */
215 1.34 rillig bool format_block_comments; /* whether comments beginning with '/ * \n'
216 1.34 rillig * are to be reformatted */
217 1.34 rillig bool indent_parameters;
218 1.34 rillig int indent_size; /* the size of one indentation level */
219 1.34 rillig int block_comment_max_line_length;
220 1.34 rillig int local_decl_indent; /* like decl_indent but for locals */
221 1.34 rillig bool lineup_to_parens_always; /* whether to not(?) attempt to keep
222 1.34 rillig * lined-up code within the margin */
223 1.34 rillig bool lineup_to_parens; /* whether continued code within parens will
224 1.34 rillig * be lined up to the open paren */
225 1.34 rillig bool proc_calls_space; /* whether function calls look like: foo (bar)
226 1.34 rillig * rather than foo(bar) */
227 1.34 rillig bool procnames_start_line; /* whether the names of procedures being
228 1.34 rillig * defined get placed in column 1 (i.e. a
229 1.34 rillig * newline is placed between the type of the
230 1.34 rillig * procedure and its name) */
231 1.34 rillig bool space_after_cast; /* "b = (int) a" vs "b = (int)a" */
232 1.34 rillig bool star_comment_cont; /* whether comment continuation lines should
233 1.34 rillig * have stars at the beginning of each line. */
234 1.34 rillig bool swallow_optional_blanklines;
235 1.34 rillig bool auto_typedefs; /* whether to recognize identifiers ending in
236 1.34 rillig * "_t" like typedefs */
237 1.34 rillig int tabsize; /* the size of a tab */
238 1.34 rillig int max_line_length;
239 1.34 rillig bool use_tabs; /* set true to use tabs for spacing, false
240 1.31 rillig * uses all spaces */
241 1.34 rillig bool verbose; /* whether non-essential error messages are
242 1.34 rillig * printed */
243 1.51 rillig } opt;
244 1.31 rillig
245 1.31 rillig enum keyword_kind {
246 1.31 rillig kw_0,
247 1.31 rillig kw_offsetof,
248 1.31 rillig kw_sizeof,
249 1.68 rillig kw_tag, /* 'struct', 'union', 'enum' */
250 1.31 rillig kw_type,
251 1.47 rillig kw_for,
252 1.47 rillig kw_if,
253 1.47 rillig kw_while,
254 1.46 rillig kw_do,
255 1.46 rillig kw_else,
256 1.31 rillig kw_switch,
257 1.31 rillig kw_case_or_default,
258 1.31 rillig kw_storage_class,
259 1.31 rillig kw_typedef,
260 1.68 rillig kw_other
261 1.31 rillig };
262 1.31 rillig
263 1.31 rillig
264 1.34 rillig extern bool found_err;
265 1.39 rillig extern int blank_lines_to_output;
266 1.40 rillig extern bool blank_line_before;
267 1.40 rillig extern bool blank_line_after;
268 1.56 rillig extern bool break_comma; /* when true and not in parentheses, break
269 1.56 rillig * after a comma */
270 1.34 rillig extern float case_ind; /* indentation level to be used for a "case
271 1.31 rillig * n:" */
272 1.34 rillig extern bool had_eof; /* whether input is exhausted */
273 1.34 rillig extern int line_no; /* the current line number. */
274 1.34 rillig extern bool inhibit_formatting; /* true if INDENT OFF is in effect */
275 1.31 rillig
276 1.31 rillig #define STACKSIZE 256
277 1.31 rillig
278 1.31 rillig extern struct parser_state {
279 1.60 rillig lexer_symbol prev_token;
280 1.59 rillig enum keyword_kind prev_keyword;
281 1.59 rillig enum keyword_kind curr_keyword;
282 1.66 rillig bool curr_newline;
283 1.66 rillig bool curr_col_1; /* whether the current token started in column
284 1.66 rillig * 1 of the unformatted input */
285 1.59 rillig bool next_unary; /* whether the following operator should be
286 1.59 rillig * unary */
287 1.59 rillig
288 1.59 rillig char procname[100]; /* The name of the current procedure */
289 1.59 rillig
290 1.41 rillig
291 1.59 rillig bool want_blank; /* whether the following token should be
292 1.59 rillig * prefixed by a blank. (Said prefixing is
293 1.59 rillig * ignored in some cases.) */
294 1.59 rillig
295 1.59 rillig int paren_level; /* parenthesization level. used to indent
296 1.59 rillig * within statements */
297 1.59 rillig /* TODO: rename to next_line_paren_level */
298 1.59 rillig int p_l_follow; /* how to indent the remaining lines of the
299 1.59 rillig * statement */
300 1.59 rillig short paren_indents[20]; /* indentation of the operand/argument of each
301 1.59 rillig * level of parentheses or brackets, relative
302 1.59 rillig * to the enclosing statement */
303 1.59 rillig int cast_mask; /* indicates which close parentheses
304 1.59 rillig * potentially close off casts */
305 1.59 rillig int not_cast_mask; /* indicates which close parentheses
306 1.59 rillig * definitely close off something else than
307 1.59 rillig * casts */
308 1.41 rillig
309 1.34 rillig int comment_delta; /* used to set up indentation for all lines of
310 1.34 rillig * a boxed comment after the first one */
311 1.34 rillig int n_comment_delta; /* remembers how many columns there were
312 1.31 rillig * before the start of a box comment so that
313 1.31 rillig * forthcoming lines of the comment are
314 1.31 rillig * indented properly */
315 1.59 rillig int com_ind; /* indentation of the current comment */
316 1.59 rillig
317 1.34 rillig bool block_init; /* whether inside a block initialization */
318 1.34 rillig int block_init_level; /* The level of brace nesting in an
319 1.31 rillig * initialization */
320 1.37 rillig bool init_or_struct; /* whether there has been a declarator (e.g.
321 1.37 rillig * int or char) and no left parenthesis since
322 1.37 rillig * the last semicolon. When true, a '{' is
323 1.34 rillig * starting a structure definition or an
324 1.34 rillig * initialization list */
325 1.59 rillig
326 1.59 rillig int ind_level; /* the current indentation level */
327 1.59 rillig int ind_level_follow; /* the level to which ind_level should be set
328 1.59 rillig * after the current line is printed */
329 1.59 rillig
330 1.34 rillig int decl_nest; /* current nesting level for structure or init */
331 1.34 rillig bool decl_on_line; /* whether this line of code has part of a
332 1.34 rillig * declaration on it */
333 1.34 rillig bool in_decl; /* whether we are in a declaration stmt. The
334 1.34 rillig * processing of braces is then slightly
335 1.31 rillig * different */
336 1.59 rillig int just_saw_decl;
337 1.59 rillig bool in_parameter_declaration;
338 1.59 rillig bool decl_indent_done; /* whether the indentation for a declaration
339 1.59 rillig * has been added to the code buffer. */
340 1.59 rillig
341 1.34 rillig bool in_stmt;
342 1.34 rillig bool ind_stmt; /* whether the next line should have an extra
343 1.31 rillig * indentation level because we are in the
344 1.59 rillig * middle of a statement */
345 1.34 rillig bool is_case_label; /* 'case' and 'default' labels are indented
346 1.31 rillig * differently from regular labels */
347 1.59 rillig
348 1.50 rillig bool search_stmt; /* whether it is necessary to buffer up all
349 1.50 rillig * text up to the start of a statement after
350 1.50 rillig * an 'if', 'while', etc. */
351 1.59 rillig
352 1.59 rillig int tos; /* pointer to top of stack */
353 1.59 rillig parser_symbol s_sym[STACKSIZE];
354 1.59 rillig int s_ind_level[STACKSIZE];
355 1.59 rillig float s_case_ind_level[STACKSIZE];
356 1.31 rillig
357 1.31 rillig struct {
358 1.34 rillig int comments;
359 1.34 rillig int lines;
360 1.34 rillig int code_lines;
361 1.34 rillig int comment_lines;
362 1.34 rillig } stats;
363 1.51 rillig } ps;
364 1.31 rillig
365 1.3 rillig
366 1.59 rillig #define array_length(array) (sizeof(array) / sizeof((array)[0]))
367 1.1 kamil
368 1.5 rillig #ifdef debug
369 1.34 rillig void
370 1.34 rillig debug_vis_range(const char *, const char *, const char *,
371 1.34 rillig const char *);
372 1.34 rillig void debug_printf(const char *, ...)__printflike(1, 2);
373 1.34 rillig void debug_println(const char *, ...)__printflike(1, 2);
374 1.9 rillig #else
375 1.16 rillig #define debug_printf(fmt, ...) do { } while (false)
376 1.16 rillig #define debug_println(fmt, ...) do { } while (false)
377 1.16 rillig #define debug_vis_range(prefix, s, e, suffix) do { } while (false)
378 1.5 rillig #endif
379 1.67 rillig
380 1.67 rillig void add_typename(const char *);
381 1.67 rillig int compute_code_indent(void);
382 1.67 rillig int compute_label_indent(void);
383 1.67 rillig int indentation_after_range(int, const char *, const char *);
384 1.67 rillig int indentation_after(int, const char *);
385 1.67 rillig
386 1.34 rillig void inbuf_skip(void);
387 1.34 rillig char inbuf_next(void);
388 1.54 rillig lexer_symbol lexi(void);
389 1.34 rillig void diag(int, const char *, ...)__printflike(2, 3);
390 1.34 rillig void dump_line(void);
391 1.44 rillig void dump_line_ff(void);
392 1.35 rillig void inbuf_read_line(void);
393 1.49 rillig void parse(parser_symbol);
394 1.55 rillig void parse_stmt_head(stmt_head);
395 1.34 rillig void process_comment(void);
396 1.34 rillig void set_option(const char *, const char *);
397 1.34 rillig void load_profiles(const char *);
398 1.34 rillig
399 1.34 rillig void *xmalloc(size_t);
400 1.34 rillig void *xrealloc(void *, size_t);
401 1.34 rillig char *xstrdup(const char *);
402 1.25 rillig
403 1.34 rillig void buf_expand(struct buffer *, size_t);
404 1.29 rillig
405 1.29 rillig static inline bool
406 1.62 rillig ch_isblank(char ch)
407 1.29 rillig {
408 1.29 rillig return ch == ' ' || ch == '\t';
409 1.29 rillig }
410 1.38 rillig
411 1.38 rillig static inline int
412 1.38 rillig next_tab(int ind)
413 1.38 rillig {
414 1.38 rillig return ind - ind % opt.tabsize + opt.tabsize;
415 1.38 rillig }
416