indent.h revision 1.128 1 1.128 rillig /* $NetBSD: indent.h,v 1.128 2023/05/13 15:34:22 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.98 rillig #include <ctype.h>
72 1.20 rillig #include <stdbool.h>
73 1.65 rillig #include <stdio.h>
74 1.20 rillig
75 1.49 rillig typedef enum lexer_symbol {
76 1.49 rillig lsym_eof,
77 1.49 rillig lsym_preprocessing, /* '#' */
78 1.49 rillig lsym_newline,
79 1.49 rillig lsym_form_feed,
80 1.74 rillig lsym_comment, /* the initial '/ *' or '//' of a comment */
81 1.49 rillig lsym_lparen_or_lbracket,
82 1.49 rillig lsym_rparen_or_rbracket,
83 1.49 rillig lsym_lbrace,
84 1.49 rillig lsym_rbrace,
85 1.49 rillig lsym_period,
86 1.74 rillig lsym_unary_op, /* e.g. '*', '&', '-' or leading '++' */
87 1.74 rillig lsym_binary_op, /* e.g. '*', '&', '<<', '&&' or '/=' */
88 1.49 rillig lsym_postfix_op, /* trailing '++' or '--' */
89 1.49 rillig lsym_question, /* the '?' from a '?:' expression */
90 1.49 rillig lsym_colon,
91 1.49 rillig lsym_comma,
92 1.49 rillig lsym_semicolon,
93 1.49 rillig lsym_typedef,
94 1.49 rillig lsym_storage_class,
95 1.81 rillig lsym_type_outside_parentheses,
96 1.80 rillig lsym_type_in_parentheses,
97 1.53 rillig lsym_tag, /* 'struct', 'union' or 'enum' */
98 1.53 rillig lsym_case_label, /* 'case' or 'default' */
99 1.69 rillig lsym_sizeof,
100 1.70 rillig lsym_offsetof,
101 1.80 rillig lsym_word, /* identifier, constant or string */
102 1.49 rillig lsym_funcname,
103 1.49 rillig lsym_do,
104 1.49 rillig lsym_else,
105 1.49 rillig lsym_for,
106 1.49 rillig lsym_if,
107 1.49 rillig lsym_switch,
108 1.49 rillig lsym_while,
109 1.75 rillig lsym_return
110 1.49 rillig } lexer_symbol;
111 1.49 rillig
112 1.49 rillig typedef enum parser_symbol {
113 1.122 rillig psym_0, /* a placeholder */
114 1.49 rillig psym_lbrace,
115 1.49 rillig psym_rbrace,
116 1.49 rillig psym_decl,
117 1.49 rillig psym_stmt,
118 1.49 rillig psym_stmt_list,
119 1.49 rillig psym_for_exprs, /* 'for' '(' ... ')' */
120 1.49 rillig psym_if_expr, /* 'if' '(' expr ')' */
121 1.49 rillig psym_if_expr_stmt, /* 'if' '(' expr ')' stmt */
122 1.49 rillig psym_if_expr_stmt_else, /* 'if' '(' expr ')' stmt 'else' */
123 1.124 rillig psym_else, /* 'else'; not stored on the stack */
124 1.49 rillig psym_switch_expr, /* 'switch' '(' expr ')' */
125 1.49 rillig psym_do, /* 'do' */
126 1.49 rillig psym_do_stmt, /* 'do' stmt */
127 1.49 rillig psym_while_expr, /* 'while' '(' expr ')' */
128 1.49 rillig } parser_symbol;
129 1.49 rillig
130 1.61 rillig /* A range of characters, in some cases null-terminated. */
131 1.31 rillig struct buffer {
132 1.61 rillig char *s; /* start of the usable text */
133 1.61 rillig char *e; /* end of the usable text */
134 1.125 rillig char *mem; /* start of the allocated memory */
135 1.125 rillig char *limit; /* end of the allocated memory */
136 1.31 rillig };
137 1.31 rillig
138 1.34 rillig extern FILE *input;
139 1.34 rillig extern FILE *output;
140 1.31 rillig
141 1.61 rillig extern struct buffer token; /* the current token to be processed, is
142 1.105 rillig * typically copied to the buffer 'code', or
143 1.105 rillig * in some cases to 'lab'. */
144 1.61 rillig
145 1.61 rillig extern struct buffer lab; /* the label or preprocessor directive */
146 1.61 rillig extern struct buffer code; /* the main part of the current line of code */
147 1.61 rillig extern struct buffer com; /* the trailing comment of the line, or the
148 1.83 rillig * start or end of a multi-line comment, or
149 1.83 rillig * while in process_comment, a single line of
150 1.83 rillig * a multi-line comment */
151 1.31 rillig
152 1.31 rillig extern struct options {
153 1.34 rillig bool blanklines_around_conditional_compilation;
154 1.126 rillig bool blank_line_after_decl_at_top; /* this is vaguely similar to
155 1.126 rillig * blank_line_after_decl except that
156 1.34 rillig * it only applies to the first set of
157 1.34 rillig * declarations in a procedure (just
158 1.34 rillig * after the first '{') and it causes
159 1.34 rillig * a blank line to be generated even
160 1.34 rillig * if there are no declarations */
161 1.126 rillig bool blank_line_after_decl;
162 1.34 rillig bool blanklines_after_procs;
163 1.34 rillig bool blanklines_before_block_comments;
164 1.34 rillig bool break_after_comma; /* whether to break declarations after commas */
165 1.34 rillig bool brace_same_line; /* whether brace should be on same line as if,
166 1.34 rillig * while, etc */
167 1.34 rillig bool blank_after_sizeof; /* whether a blank should always be inserted
168 1.34 rillig * after sizeof */
169 1.34 rillig bool comment_delimiter_on_blankline;
170 1.34 rillig int decl_comment_column; /* the column in which comments after
171 1.31 rillig * declarations should be put */
172 1.34 rillig bool cuddle_else; /* whether 'else' should cuddle up to '}' */
173 1.34 rillig int continuation_indent; /* the indentation between the edge of code
174 1.34 rillig * and continuation lines */
175 1.34 rillig float case_indent; /* The distance (measured in indentation
176 1.31 rillig * levels) to indent case labels from the
177 1.31 rillig * switch statement */
178 1.34 rillig int comment_column; /* the column in which comments to the right
179 1.31 rillig * of code should start */
180 1.34 rillig int decl_indent; /* indentation of identifier in declaration */
181 1.34 rillig bool ljust_decl; /* true if declarations should be left
182 1.31 rillig * justified */
183 1.34 rillig int unindent_displace; /* comments not to the right of code will be
184 1.34 rillig * placed this many indentation levels to the
185 1.34 rillig * left of code */
186 1.34 rillig bool extra_expr_indent; /* whether continuation lines from the
187 1.124 rillig * expression part of "if (e)", "while (e)",
188 1.124 rillig * "for (e; e; e)" should be indented an extra
189 1.34 rillig * tab stop so that they don't conflict with
190 1.34 rillig * the code that follows */
191 1.34 rillig bool else_if; /* whether else-if pairs should be handled
192 1.31 rillig * specially */
193 1.34 rillig bool function_brace_split; /* split function declaration and brace onto
194 1.34 rillig * separate lines */
195 1.34 rillig bool format_col1_comments; /* If comments which start in column 1 are to
196 1.34 rillig * be magically reformatted (just like
197 1.34 rillig * comments that begin in later columns) */
198 1.34 rillig bool format_block_comments; /* whether comments beginning with '/ * \n'
199 1.34 rillig * are to be reformatted */
200 1.34 rillig bool indent_parameters;
201 1.34 rillig int indent_size; /* the size of one indentation level */
202 1.34 rillig int block_comment_max_line_length;
203 1.34 rillig int local_decl_indent; /* like decl_indent but for locals */
204 1.34 rillig bool lineup_to_parens_always; /* whether to not(?) attempt to keep
205 1.34 rillig * lined-up code within the margin */
206 1.34 rillig bool lineup_to_parens; /* whether continued code within parens will
207 1.34 rillig * be lined up to the open paren */
208 1.34 rillig bool proc_calls_space; /* whether function calls look like: foo (bar)
209 1.34 rillig * rather than foo(bar) */
210 1.34 rillig bool procnames_start_line; /* whether the names of procedures being
211 1.34 rillig * defined get placed in column 1 (i.e. a
212 1.34 rillig * newline is placed between the type of the
213 1.34 rillig * procedure and its name) */
214 1.34 rillig bool space_after_cast; /* "b = (int) a" vs "b = (int)a" */
215 1.34 rillig bool star_comment_cont; /* whether comment continuation lines should
216 1.34 rillig * have stars at the beginning of each line. */
217 1.34 rillig bool swallow_optional_blanklines;
218 1.34 rillig bool auto_typedefs; /* whether to recognize identifiers ending in
219 1.34 rillig * "_t" like typedefs */
220 1.34 rillig int tabsize; /* the size of a tab */
221 1.34 rillig int max_line_length;
222 1.34 rillig bool use_tabs; /* set true to use tabs for spacing, false
223 1.31 rillig * uses all spaces */
224 1.34 rillig bool verbose; /* whether non-essential error messages are
225 1.34 rillig * printed */
226 1.51 rillig } opt;
227 1.31 rillig
228 1.34 rillig extern bool found_err;
229 1.56 rillig extern bool break_comma; /* when true and not in parentheses, break
230 1.56 rillig * after a comma */
231 1.34 rillig extern float case_ind; /* indentation level to be used for a "case
232 1.31 rillig * n:" */
233 1.34 rillig extern bool had_eof; /* whether input is exhausted */
234 1.34 rillig extern int line_no; /* the current line number. */
235 1.34 rillig extern bool inhibit_formatting; /* true if INDENT OFF is in effect */
236 1.31 rillig
237 1.31 rillig #define STACKSIZE 256
238 1.31 rillig
239 1.110 rillig /* Properties of each level of parentheses or brackets. */
240 1.110 rillig typedef struct paren_level_props {
241 1.110 rillig short indent; /* indentation of the operand/argument,
242 1.110 rillig * relative to the enclosing statement; if
243 1.110 rillig * negative, reflected at -1 */
244 1.110 rillig bool maybe_cast; /* whether the parentheses may form a type
245 1.110 rillig * cast */
246 1.110 rillig bool no_cast; /* whether the parentheses definitely do not
247 1.110 rillig * form a type cast */
248 1.110 rillig } paren_level_props;
249 1.110 rillig
250 1.31 rillig extern struct parser_state {
251 1.84 rillig lexer_symbol prev_token; /* the previous token, but never comment,
252 1.84 rillig * newline or preprocessing line */
253 1.66 rillig bool curr_col_1; /* whether the current token started in column
254 1.66 rillig * 1 of the unformatted input */
255 1.77 rillig bool next_col_1;
256 1.59 rillig bool next_unary; /* whether the following operator should be
257 1.124 rillig * unary; is used in declarations for '*', as
258 1.124 rillig * well as in expressions */
259 1.59 rillig
260 1.97 rillig bool is_function_definition;
261 1.41 rillig
262 1.59 rillig bool want_blank; /* whether the following token should be
263 1.59 rillig * prefixed by a blank. (Said prefixing is
264 1.59 rillig * ignored in some cases.) */
265 1.59 rillig
266 1.114 rillig bool force_nl; /* when true, the following token goes to the
267 1.114 rillig * next line, unless it is a '{' and
268 1.116 rillig * opt.brace_same_line is set. */
269 1.114 rillig
270 1.111 rillig int line_start_nparen; /* the number of parentheses or brackets that
271 1.111 rillig * were already open at the beginning of the
272 1.111 rillig * current line; used to indent within
273 1.111 rillig * statements, initializers and declarations */
274 1.111 rillig int nparen; /* the number of parentheses or brackets that
275 1.111 rillig * are currently open; used to indent the
276 1.111 rillig * remaining lines of the statement,
277 1.111 rillig * initializer or declaration */
278 1.110 rillig paren_level_props paren[20];
279 1.111 rillig
280 1.34 rillig int comment_delta; /* used to set up indentation for all lines of
281 1.34 rillig * a boxed comment after the first one */
282 1.34 rillig int n_comment_delta; /* remembers how many columns there were
283 1.31 rillig * before the start of a box comment so that
284 1.31 rillig * forthcoming lines of the comment are
285 1.31 rillig * indented properly */
286 1.59 rillig int com_ind; /* indentation of the current comment */
287 1.59 rillig
288 1.34 rillig bool block_init; /* whether inside a block initialization */
289 1.34 rillig int block_init_level; /* The level of brace nesting in an
290 1.31 rillig * initialization */
291 1.37 rillig bool init_or_struct; /* whether there has been a declarator (e.g.
292 1.37 rillig * int or char) and no left parenthesis since
293 1.37 rillig * the last semicolon. When true, a '{' is
294 1.34 rillig * starting a structure definition or an
295 1.34 rillig * initialization list */
296 1.59 rillig
297 1.82 rillig int ind_level; /* the indentation level for the line that is
298 1.82 rillig * currently prepared for output */
299 1.59 rillig int ind_level_follow; /* the level to which ind_level should be set
300 1.59 rillig * after the current line is printed */
301 1.59 rillig
302 1.85 rillig int decl_level; /* current nesting level for a structure
303 1.85 rillig * declaration or an initializer */
304 1.34 rillig bool decl_on_line; /* whether this line of code has part of a
305 1.34 rillig * declaration on it */
306 1.101 rillig bool in_decl; /* whether we are in a declaration. The
307 1.34 rillig * processing of braces is then slightly
308 1.31 rillig * different */
309 1.128 rillig
310 1.127 rillig enum declaration {
311 1.127 rillig decl_no, /* no declaration anywhere nearby */
312 1.127 rillig decl_begin, /* collecting tokens of a declaration */
313 1.127 rillig decl_end, /* finished a declaration */
314 1.127 rillig } declaration;
315 1.128 rillig bool blank_line_after_decl;
316 1.128 rillig
317 1.102 rillig bool in_func_def_params;
318 1.108 rillig enum {
319 1.108 rillig in_enum_no, /* outside any 'enum { ... }' */
320 1.108 rillig in_enum_enum, /* after keyword 'enum' */
321 1.108 rillig in_enum_type, /* after 'enum' or 'enum tag' */
322 1.108 rillig in_enum_brace /* between '{' and '}' */
323 1.108 rillig } in_enum; /* enum { . } */
324 1.59 rillig bool decl_indent_done; /* whether the indentation for a declaration
325 1.59 rillig * has been added to the code buffer. */
326 1.115 rillig int decl_ind; /* current indentation for declarations */
327 1.115 rillig int di_stack[20]; /* a stack of structure indentation levels */
328 1.115 rillig bool tabs_to_var; /* true if using tabs to indent to var name */
329 1.59 rillig
330 1.100 rillig bool in_stmt_or_decl; /* whether in a statement or a struct
331 1.100 rillig * declaration or a plain declaration */
332 1.99 rillig bool in_stmt_cont; /* whether the next line should have an extra
333 1.31 rillig * indentation level because we are in the
334 1.59 rillig * middle of a statement */
335 1.34 rillig bool is_case_label; /* 'case' and 'default' labels are indented
336 1.31 rillig * differently from regular labels */
337 1.115 rillig bool seen_case; /* set to true when we see a 'case', so we
338 1.115 rillig * know what to do with the following colon */
339 1.59 rillig
340 1.59 rillig int tos; /* pointer to top of stack */
341 1.59 rillig parser_symbol s_sym[STACKSIZE];
342 1.59 rillig int s_ind_level[STACKSIZE];
343 1.59 rillig float s_case_ind_level[STACKSIZE];
344 1.31 rillig
345 1.120 rillig parser_symbol spaced_expr_psym; /* the parser symbol to be shifted
346 1.120 rillig * after the parenthesized expression
347 1.120 rillig * from a 'for', 'if', 'switch' or
348 1.122 rillig * 'while'; or psym_0 */
349 1.120 rillig
350 1.115 rillig int quest_level; /* when this is positive, we have seen a '?'
351 1.115 rillig * without the matching ':' in a '?:'
352 1.115 rillig * expression */
353 1.51 rillig } ps;
354 1.31 rillig
355 1.3 rillig
356 1.59 rillig #define array_length(array) (sizeof(array) / sizeof((array)[0]))
357 1.1 kamil
358 1.5 rillig #ifdef debug
359 1.123 rillig void debug_printf(const char *, ...) __printflike(1, 2);
360 1.123 rillig void debug_println(const char *, ...) __printflike(1, 2);
361 1.120 rillig void debug_vis_range(const char *, const char *, const char *, const char *);
362 1.123 rillig void debug_parser_state(lexer_symbol);
363 1.123 rillig void debug_parse_stack(const char *);
364 1.123 rillig void debug_buffers(void);
365 1.123 rillig extern const char *const lsym_name[];
366 1.123 rillig extern const char *const psym_name[];
367 1.9 rillig #else
368 1.123 rillig #define debug_noop() do { } while (false)
369 1.123 rillig #define debug_printf(fmt, ...) debug_noop()
370 1.123 rillig #define debug_println(fmt, ...) debug_noop()
371 1.123 rillig #define debug_vis_range(prefix, s, e, suffix) debug_noop()
372 1.123 rillig #define debug_parser_state() debug_noop()
373 1.123 rillig #define debug_parse_stack(situation) debug_noop()
374 1.123 rillig #define debug_buffers() debug_noop()
375 1.5 rillig #endif
376 1.67 rillig
377 1.74 rillig void register_typename(const char *);
378 1.67 rillig int compute_code_indent(void);
379 1.67 rillig int compute_label_indent(void);
380 1.76 rillig int ind_add(int, const char *, const char *);
381 1.67 rillig
382 1.94 rillig void inp_init(void);
383 1.94 rillig
384 1.91 rillig const char *inp_p(void);
385 1.95 rillig const char *inp_line_start(void);
386 1.91 rillig const char *inp_line_end(void);
387 1.89 rillig char inp_peek(void);
388 1.90 rillig char inp_lookahead(size_t);
389 1.79 rillig void inp_skip(void);
390 1.79 rillig char inp_next(void);
391 1.89 rillig
392 1.54 rillig lexer_symbol lexi(void);
393 1.34 rillig void diag(int, const char *, ...)__printflike(2, 3);
394 1.104 rillig void output_line(void);
395 1.104 rillig void output_line_ff(void);
396 1.79 rillig void inp_read_line(void);
397 1.49 rillig void parse(parser_symbol);
398 1.34 rillig void process_comment(void);
399 1.34 rillig void set_option(const char *, const char *);
400 1.34 rillig void load_profiles(const char *);
401 1.34 rillig
402 1.34 rillig void *xmalloc(size_t);
403 1.34 rillig void *xrealloc(void *, size_t);
404 1.34 rillig char *xstrdup(const char *);
405 1.25 rillig
406 1.34 rillig void buf_expand(struct buffer *, size_t);
407 1.103 rillig void buf_add_char(struct buffer *, char);
408 1.103 rillig void buf_add_range(struct buffer *, const char *, const char *);
409 1.29 rillig
410 1.29 rillig static inline bool
411 1.98 rillig ch_isalnum(char ch)
412 1.98 rillig {
413 1.98 rillig return isalnum((unsigned char)ch) != 0;
414 1.98 rillig }
415 1.98 rillig
416 1.98 rillig static inline bool
417 1.98 rillig ch_isalpha(char ch)
418 1.98 rillig {
419 1.98 rillig return isalpha((unsigned char)ch) != 0;
420 1.98 rillig }
421 1.98 rillig
422 1.98 rillig static inline bool
423 1.62 rillig ch_isblank(char ch)
424 1.29 rillig {
425 1.29 rillig return ch == ' ' || ch == '\t';
426 1.29 rillig }
427 1.38 rillig
428 1.98 rillig static inline bool
429 1.98 rillig ch_isdigit(char ch)
430 1.98 rillig {
431 1.98 rillig return '0' <= ch && ch <= '9';
432 1.98 rillig }
433 1.98 rillig
434 1.98 rillig static inline bool
435 1.98 rillig ch_isspace(char ch)
436 1.98 rillig {
437 1.98 rillig return isspace((unsigned char)ch) != 0;
438 1.98 rillig }
439 1.98 rillig
440 1.38 rillig static inline int
441 1.38 rillig next_tab(int ind)
442 1.38 rillig {
443 1.38 rillig return ind - ind % opt.tabsize + opt.tabsize;
444 1.38 rillig }
445