lint1.h revision 1.194 1 1.194 rillig /* $NetBSD: lint1.h,v 1.194 2023/07/15 13:35:24 rillig Exp $ */
2 1.2 cgd
3 1.1 cgd /*
4 1.7 cgd * Copyright (c) 1996 Christopher G. Demetriou. All Rights Reserved.
5 1.1 cgd * Copyright (c) 1994, 1995 Jochen Pohl
6 1.1 cgd * All Rights Reserved.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.189 rillig * This product includes software developed by Jochen Pohl for
19 1.1 cgd * The NetBSD Project.
20 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
21 1.1 cgd * derived from this software without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.1 cgd #include "lint.h"
36 1.49 rillig #include "err-msgs.h"
37 1.1 cgd #include "op.h"
38 1.12 tv
39 1.159 rillig /*
40 1.159 rillig * A memory pool collects allocated objects that must be available until:
41 1.159 rillig * - the end of a block,
42 1.159 rillig * - the end of an expression, or
43 1.159 rillig * - the end of the translation unit.
44 1.159 rillig */
45 1.159 rillig typedef struct memory_pool {
46 1.194 rillig struct memory_pool_item {
47 1.194 rillig void *p;
48 1.194 rillig #ifdef DEBUG_MEM
49 1.194 rillig size_t size;
50 1.194 rillig const char *descr;
51 1.194 rillig #endif
52 1.194 rillig } *items;
53 1.159 rillig size_t len;
54 1.159 rillig size_t cap;
55 1.159 rillig } memory_pool;
56 1.159 rillig
57 1.154 rillig /* See saved_lwarn in cgram.y. */
58 1.53 rillig #define LWARN_ALL (-2)
59 1.53 rillig #define LWARN_NONE (-1)
60 1.27 christos
61 1.1 cgd /*
62 1.1 cgd * Describes the position of a declaration or anything else.
63 1.96 rillig *
64 1.96 rillig * FIXME: Just a single file:lineno pair is not enough to accurately describe
65 1.96 rillig * the position of a symbol. The whole inclusion path at that point must be
66 1.96 rillig * stored as well. This makes a difference for symbols from included
67 1.96 rillig * headers, see print_stack_trace.
68 1.1 cgd */
69 1.1 cgd typedef struct {
70 1.92 rillig const char *p_file;
71 1.1 cgd int p_line;
72 1.7 cgd int p_uniq; /* uniquifier */
73 1.1 cgd } pos_t;
74 1.7 cgd
75 1.1 cgd /*
76 1.125 rillig * Strings cannot be referenced simply by a pointer to their first
77 1.1 cgd * char. This is because strings can contain NUL characters other than the
78 1.1 cgd * trailing NUL.
79 1.1 cgd *
80 1.1 cgd * Strings are stored with a trailing NUL.
81 1.1 cgd */
82 1.1 cgd typedef struct strg {
83 1.142 rillig bool st_char; /* string doesn't have an 'L' prefix */
84 1.142 rillig size_t st_len; /* length without trailing NUL */
85 1.142 rillig void *st_mem; /* char[] for st_char, or wchar_t[] */
86 1.1 cgd } strg_t;
87 1.1 cgd
88 1.191 rillig typedef struct {
89 1.191 rillig bool tq_const:1;
90 1.191 rillig bool tq_restrict:1;
91 1.191 rillig bool tq_volatile:1;
92 1.191 rillig bool tq_atomic:1;
93 1.191 rillig } type_qualifiers;
94 1.1 cgd
95 1.193 rillig /* A bool, integer or floating-point value. */
96 1.1 cgd typedef struct {
97 1.1 cgd tspec_t v_tspec;
98 1.105 rillig /*
99 1.105 rillig * Set if an integer constant is unsigned only in C90 and later, but
100 1.105 rillig * not in traditional C.
101 1.105 rillig *
102 1.105 rillig * See the operators table in ops.def, columns "l r".
103 1.105 rillig */
104 1.105 rillig bool v_unsigned_since_c90;
105 1.166 rillig bool v_char_constant;
106 1.1 cgd union {
107 1.177 rillig int64_t integer;
108 1.177 rillig long double floating;
109 1.177 rillig } u;
110 1.1 cgd } val_t;
111 1.1 cgd
112 1.1 cgd /*
113 1.62 rillig * Structures of type struct_or_union uniquely identify structures. This can't
114 1.174 rillig * be done in structures of type type_t, because these are copied if they must
115 1.174 rillig * be modified. So it would not be possible to check if two structures are
116 1.174 rillig * identical by comparing the pointers to the type structures.
117 1.1 cgd *
118 1.174 rillig * If the structure has no tag name, its first typedef name is used to identify
119 1.174 rillig * the structure in lint2.
120 1.1 cgd */
121 1.1 cgd typedef struct {
122 1.126 rillig unsigned int sou_size_in_bits;
123 1.176 rillig unsigned int sou_align_in_bits;
124 1.132 rillig bool sou_incomplete:1;
125 1.62 rillig struct sym *sou_first_member;
126 1.62 rillig struct sym *sou_tag;
127 1.62 rillig struct sym *sou_first_typedef;
128 1.62 rillig } struct_or_union;
129 1.1 cgd
130 1.1 cgd /*
131 1.1 cgd * same as above for enums
132 1.1 cgd */
133 1.1 cgd typedef struct {
134 1.132 rillig bool en_incomplete:1;
135 1.63 rillig struct sym *en_first_enumerator;
136 1.63 rillig struct sym *en_tag;
137 1.63 rillig struct sym *en_first_typedef;
138 1.63 rillig } enumeration;
139 1.1 cgd
140 1.1 cgd /*
141 1.93 rillig * The type of an expression or object. Complex types are formed via t_subt
142 1.164 rillig * (for arrays, pointers and functions), as well as t_sou.
143 1.1 cgd */
144 1.94 rillig struct lint1_type {
145 1.1 cgd tspec_t t_tspec; /* type specifier */
146 1.132 rillig bool t_incomplete_array:1;
147 1.132 rillig bool t_const:1; /* const modifier */
148 1.132 rillig bool t_volatile:1; /* volatile modifier */
149 1.132 rillig bool t_proto:1; /* function prototype (t_args valid) */
150 1.132 rillig bool t_vararg:1; /* prototype with '...' */
151 1.132 rillig bool t_typedef:1; /* type defined with typedef */
152 1.151 rillig bool t_typeof:1; /* type defined with GCC's __typeof__ */
153 1.132 rillig bool t_bitfield:1;
154 1.109 rillig /*
155 1.109 rillig * Either the type is currently an enum (having t_tspec ENUM), or
156 1.109 rillig * it is an integer type (typically INT) that has been implicitly
157 1.109 rillig * converted from an enum type. In both cases, t_enum is valid.
158 1.109 rillig *
159 1.109 rillig * The information about a former enum type is retained to allow
160 1.109 rillig * type checks in expressions such as ((var1 & 0x0001) == var2), to
161 1.109 rillig * detect when var1 and var2 are from incompatible enum types.
162 1.109 rillig */
163 1.132 rillig bool t_is_enum:1;
164 1.132 rillig bool t_packed:1;
165 1.1 cgd union {
166 1.74 rillig int _t_dim; /* dimension (if ARRAY) */
167 1.164 rillig struct_or_union *_t_sou;
168 1.63 rillig enumeration *_t_enum;
169 1.1 cgd struct sym *_t_args; /* arguments (if t_proto) */
170 1.1 cgd } t_u;
171 1.169 rillig unsigned int t_bit_field_width:8;
172 1.169 rillig unsigned int t_bit_field_offset:24;
173 1.169 rillig struct lint1_type *t_subt; /* element type (if ARRAY),
174 1.169 rillig * return value (if FUNC),
175 1.169 rillig * target type (if PTR) */
176 1.17 christos };
177 1.1 cgd
178 1.1 cgd #define t_dim t_u._t_dim
179 1.164 rillig #define t_sou t_u._t_sou
180 1.1 cgd #define t_enum t_u._t_enum
181 1.1 cgd #define t_args t_u._t_args
182 1.1 cgd
183 1.1 cgd /*
184 1.1 cgd * types of symbols
185 1.1 cgd */
186 1.1 cgd typedef enum {
187 1.1 cgd FVFT, /* variables, functions, type names, enums */
188 1.39 rillig FMEMBER, /* members of structs or unions */
189 1.1 cgd FTAG, /* tags */
190 1.39 rillig FLABEL /* labels */
191 1.1 cgd } symt_t;
192 1.1 cgd
193 1.1 cgd /*
194 1.115 rillig * storage classes and related things
195 1.1 cgd */
196 1.1 cgd typedef enum {
197 1.1 cgd NOSCL,
198 1.115 rillig EXTERN, /* external symbols (independent of decl_t) */
199 1.1 cgd STATIC, /* static symbols (local and global) */
200 1.1 cgd AUTO, /* automatic symbols (except register) */
201 1.1 cgd REG, /* register */
202 1.1 cgd TYPEDEF, /* typedef */
203 1.190 rillig THREAD_LOCAL,
204 1.65 rillig STRUCT_TAG,
205 1.65 rillig UNION_TAG,
206 1.65 rillig ENUM_TAG,
207 1.160 rillig STRUCT_MEMBER,
208 1.160 rillig UNION_MEMBER,
209 1.146 rillig BOOL_CONST,
210 1.146 rillig ENUM_CONST,
211 1.1 cgd ABSTRACT, /* abstract symbol (sizeof, casts, unnamed argument) */
212 1.1 cgd } scl_t;
213 1.1 cgd
214 1.186 rillig /* C23 6.7.4 */
215 1.186 rillig typedef enum {
216 1.187 rillig FS_INLINE, /* since C99 */
217 1.187 rillig FS_NORETURN, /* since C11 */
218 1.186 rillig } function_specifier;
219 1.186 rillig
220 1.1 cgd /*
221 1.1 cgd * symbol table entry
222 1.1 cgd */
223 1.1 cgd typedef struct sym {
224 1.33 rillig const char *s_name;
225 1.9 cgd const char *s_rename; /* renamed symbol's given name */
226 1.44 rillig pos_t s_def_pos; /* position of last (prototype) definition,
227 1.39 rillig prototype declaration, no-prototype-def.,
228 1.1 cgd tentative definition or declaration,
229 1.1 cgd in this order */
230 1.66 rillig pos_t s_set_pos; /* position of first initialization */
231 1.44 rillig pos_t s_use_pos; /* position of first use */
232 1.1 cgd symt_t s_kind; /* type of symbol */
233 1.133 rillig const struct keyword *s_keyword;
234 1.132 rillig bool s_bitfield:1;
235 1.132 rillig bool s_set:1; /* variable set, label defined */
236 1.132 rillig bool s_used:1; /* variable/label used */
237 1.132 rillig bool s_arg:1; /* symbol is function argument */
238 1.141 rillig bool s_register:1; /* symbol is register variable */
239 1.158 rillig bool s_defarg:1; /* undefined symbol in old-style function
240 1.1 cgd definition */
241 1.132 rillig bool s_return_type_implicit_int:1;
242 1.158 rillig bool s_osdef:1; /* symbol stems from old-style function def. */
243 1.132 rillig bool s_inline:1; /* true if this is an inline function */
244 1.141 rillig struct sym *s_ext_sym; /* for locally declared external symbols, the
245 1.141 rillig * pointer to the external symbol with the
246 1.141 rillig * same name */
247 1.1 cgd def_t s_def; /* declared, tentative defined, defined */
248 1.174 rillig scl_t s_scl; /* storage class, more or less */
249 1.71 rillig int s_block_level; /* level of declaration, -1 if not in symbol
250 1.1 cgd table */
251 1.33 rillig type_t *s_type;
252 1.1 cgd union {
253 1.147 rillig bool s_bool_constant;
254 1.147 rillig int s_enum_constant; /* XXX: should be TARG_INT */
255 1.147 rillig struct {
256 1.175 rillig struct_or_union *sm_containing_type;
257 1.147 rillig unsigned int sm_offset_in_bits;
258 1.147 rillig } s_member;
259 1.147 rillig struct {
260 1.147 rillig int sk_token;
261 1.186 rillig union {
262 1.186 rillig /* if T_TYPE or T_STRUCT_OR_UNION */
263 1.186 rillig tspec_t sk_tspec;
264 1.186 rillig /* if T_QUAL */
265 1.191 rillig type_qualifiers sk_type_qualifier;
266 1.186 rillig /* if T_FUNCTION_SPECIFIER */
267 1.186 rillig function_specifier function_specifier;
268 1.186 rillig } u;
269 1.147 rillig } s_keyword;
270 1.147 rillig struct sym *s_old_style_args; /* arguments in an old-style
271 1.147 rillig * function definition */
272 1.1 cgd } u;
273 1.139 rillig struct sym *s_symtab_next; /* next symbol with same hash value */
274 1.139 rillig struct sym **s_symtab_ref; /* pointer to s_symtab_next of the
275 1.139 rillig * previous symbol */
276 1.38 rillig struct sym *s_next; /* next struct/union member, enumerator,
277 1.1 cgd argument */
278 1.139 rillig struct sym *s_level_next; /* next symbol declared on the same
279 1.139 rillig * level */
280 1.1 cgd } sym_t;
281 1.1 cgd
282 1.1 cgd /*
283 1.35 rillig * Used to keep some information about symbols before they are entered
284 1.1 cgd * into the symbol table.
285 1.1 cgd */
286 1.1 cgd typedef struct sbuf {
287 1.1 cgd const char *sb_name; /* name of symbol */
288 1.1 cgd size_t sb_len; /* length (without '\0') */
289 1.1 cgd sym_t *sb_sym; /* symbol table entry */
290 1.1 cgd } sbuf_t;
291 1.1 cgd
292 1.1 cgd
293 1.1 cgd /*
294 1.1 cgd * tree node
295 1.1 cgd */
296 1.1 cgd typedef struct tnode {
297 1.1 cgd op_t tn_op; /* operator */
298 1.1 cgd type_t *tn_type; /* type */
299 1.132 rillig bool tn_lvalue:1; /* node is lvalue */
300 1.132 rillig bool tn_cast:1; /* if tn_op == CVT, it's an explicit cast */
301 1.132 rillig bool tn_parenthesized:1;
302 1.193 rillig bool tn_sys:1; /* the operator comes from a system header;
303 1.193 rillig * used in strict bool mode to allow mixing
304 1.193 rillig * bool and scalar, as these places are not
305 1.193 rillig * considered fixable */
306 1.132 rillig bool tn_system_dependent:1; /* depends on sizeof or offsetof */
307 1.1 cgd union {
308 1.1 cgd struct {
309 1.1 cgd struct tnode *_tn_left; /* (left) operand */
310 1.1 cgd struct tnode *_tn_right; /* right operand */
311 1.1 cgd } tn_s;
312 1.1 cgd sym_t *_tn_sym; /* symbol if op == NAME */
313 1.167 rillig val_t _tn_val; /* value if op == CON */
314 1.42 rillig strg_t *_tn_string; /* string if op == STRING */
315 1.1 cgd } tn_u;
316 1.1 cgd } tnode_t;
317 1.1 cgd
318 1.98 rillig #define tn_left tn_u.tn_s._tn_left
319 1.98 rillig #define tn_right tn_u.tn_s._tn_right
320 1.98 rillig #define tn_sym tn_u._tn_sym
321 1.98 rillig #define tn_val tn_u._tn_val
322 1.42 rillig #define tn_string tn_u._tn_string
323 1.1 cgd
324 1.112 rillig struct generic_association {
325 1.112 rillig type_t *ga_arg; /* NULL means default or error */
326 1.112 rillig tnode_t *ga_result; /* NULL means error */
327 1.112 rillig struct generic_association *ga_prev;
328 1.107 rillig };
329 1.107 rillig
330 1.129 rillig struct array_size {
331 1.129 rillig bool has_dim;
332 1.129 rillig int dim;
333 1.129 rillig };
334 1.129 rillig
335 1.173 rillig typedef enum decl_level_kind {
336 1.173 rillig DLK_EXTERN, /* global types, variables or functions */
337 1.173 rillig DLK_STRUCT, /* members */
338 1.173 rillig DLK_UNION, /* members */
339 1.173 rillig DLK_ENUM, /* constants */
340 1.173 rillig DLK_OLD_STYLE_ARGS, /* arguments in an old-style function
341 1.150 rillig * definition */
342 1.173 rillig DLK_PROTO_PARAMS, /* parameters in a prototype function
343 1.150 rillig * definition */
344 1.173 rillig DLK_AUTO, /* local types or variables */
345 1.173 rillig DLK_ABSTRACT /* abstract (unnamed) declaration; type name;
346 1.173 rillig * used in casts and sizeof */
347 1.173 rillig } decl_level_kind;
348 1.150 rillig
349 1.1 cgd /*
350 1.171 rillig * A declaration level describes a struct, union, enum, block, argument
351 1.171 rillig * declaration list or an abstract (unnamed) type.
352 1.171 rillig *
353 1.171 rillig * For nested declarations, the global 'dcs' holds all information needed for
354 1.171 rillig * the current level, the outer levels are available via 'd_enclosing'.
355 1.1 cgd */
356 1.173 rillig typedef struct decl_level {
357 1.173 rillig decl_level_kind d_kind;
358 1.72 rillig tspec_t d_abstract_type;/* VOID, BOOL, CHAR, INT or COMPLEX */
359 1.72 rillig tspec_t d_complex_mod; /* FLOAT or DOUBLE */
360 1.72 rillig tspec_t d_sign_mod; /* SIGNED or UNSIGN */
361 1.180 rillig tspec_t d_rank_mod; /* SHORT, LONG or LLONG */
362 1.3 jpo scl_t d_scl; /* storage class */
363 1.174 rillig type_t *d_type; /* after dcs_end_type, the pointer to the type
364 1.174 rillig * used for all declarators */
365 1.78 rillig sym_t *d_redeclared_symbol;
366 1.178 rillig unsigned int d_sou_size_in_bits; /* size of the structure or
367 1.178 rillig * union being built, without
368 1.178 rillig * trailing padding */
369 1.178 rillig unsigned int d_sou_align_in_bits; /* alignment of the structure
370 1.178 rillig * or union being built */
371 1.192 rillig type_qualifiers d_qual; /* in declaration specifiers */
372 1.132 rillig bool d_inline:1; /* inline in declaration specifiers */
373 1.157 rillig bool d_multiple_storage_classes:1; /* reported in dcs_end_type */
374 1.132 rillig bool d_invalid_type_combination:1;
375 1.174 rillig bool d_nonempty_decl:1; /* in a function declaration, whether at
376 1.174 rillig * least one tag was declared */
377 1.132 rillig bool d_vararg:1;
378 1.174 rillig bool d_prototype:1; /* in a function declaration, whether the
379 1.174 rillig * function has a prototype */
380 1.170 rillig bool d_no_type_specifier:1;
381 1.132 rillig bool d_asm:1; /* set if d_ctx == AUTO and asm() present */
382 1.132 rillig bool d_packed:1;
383 1.132 rillig bool d_used:1;
384 1.174 rillig type_t *d_tag_type; /* during a member declaration, the tag type to
385 1.174 rillig * which the member belongs */
386 1.174 rillig sym_t *d_func_args; /* during a function declaration, the list of
387 1.174 rillig * arguments */
388 1.174 rillig pos_t d_func_def_pos; /* position of the function definition */
389 1.170 rillig sym_t *d_first_dlsym; /* first symbol declared at this level */
390 1.170 rillig sym_t **d_last_dlsym; /* points to s_level_next in the last symbol
391 1.139 rillig declaration at this level */
392 1.80 rillig sym_t *d_func_proto_syms; /* symbols defined in prototype */
393 1.173 rillig struct decl_level *d_enclosing; /* the enclosing declaration level */
394 1.173 rillig } decl_level;
395 1.1 cgd
396 1.191 rillig /*
397 1.191 rillig * A sequence of asterisks and qualifiers, from right to left. For example,
398 1.191 rillig * 'const ***volatile **const volatile' results in [c-v-, ----, --v-, ----,
399 1.191 rillig * ----]. The leftmost 'const' is not included in this list, it is stored in
400 1.193 rillig * dcs->d_qual instead.
401 1.191 rillig */
402 1.108 rillig typedef struct qual_ptr {
403 1.191 rillig type_qualifiers qualifiers;
404 1.108 rillig struct qual_ptr *p_next;
405 1.108 rillig } qual_ptr;
406 1.1 cgd
407 1.1 cgd /*
408 1.93 rillig * The values of the 'case' labels, linked via cl_next in reverse order of
409 1.93 rillig * appearance in the code, that is from bottom to top.
410 1.1 cgd */
411 1.77 rillig typedef struct case_label {
412 1.1 cgd val_t cl_val;
413 1.77 rillig struct case_label *cl_next;
414 1.77 rillig } case_label_t;
415 1.1 cgd
416 1.88 rillig typedef enum {
417 1.88 rillig CS_DO_WHILE,
418 1.88 rillig CS_FOR,
419 1.88 rillig CS_FUNCTION_BODY,
420 1.88 rillig CS_IF,
421 1.88 rillig CS_SWITCH,
422 1.88 rillig CS_WHILE
423 1.88 rillig } control_statement_kind;
424 1.88 rillig
425 1.1 cgd /*
426 1.35 rillig * Used to keep information about nested control statements.
427 1.1 cgd */
428 1.52 rillig typedef struct control_statement {
429 1.88 rillig control_statement_kind c_kind; /* to ensure proper nesting */
430 1.132 rillig bool c_loop:1; /* 'continue' and 'break' are valid */
431 1.132 rillig bool c_switch:1; /* 'case' and 'break' are valid */
432 1.132 rillig bool c_break:1; /* the loop/switch has a reachable
433 1.89 rillig * 'break' statement */
434 1.132 rillig bool c_continue:1; /* the loop has a reachable 'continue'
435 1.89 rillig * statement */
436 1.132 rillig bool c_default:1; /* the switch has a 'default' label */
437 1.132 rillig bool c_maybe_endless:1; /* the controlling expression is
438 1.82 rillig * always true (as in 'for (;;)' or
439 1.82 rillig * 'while (1)'), there may be break
440 1.82 rillig * statements though */
441 1.132 rillig bool c_always_then:1;
442 1.132 rillig bool c_reached_end_of_then:1;
443 1.132 rillig bool c_had_return_noval:1; /* had "return;" */
444 1.132 rillig bool c_had_return_value:1; /* had "return expr;" */
445 1.89 rillig
446 1.89 rillig type_t *c_switch_type; /* type of switch expression */
447 1.101 rillig tnode_t *c_switch_expr;
448 1.77 rillig case_label_t *c_case_labels; /* list of case values */
449 1.89 rillig
450 1.159 rillig memory_pool c_for_expr3_mem; /* saved memory for end of loop
451 1.89 rillig * expression in for() */
452 1.89 rillig tnode_t *c_for_expr3; /* end of loop expr in for() */
453 1.89 rillig pos_t c_for_expr3_pos; /* position of end of loop expr */
454 1.89 rillig pos_t c_for_expr3_csrc_pos; /* same for csrc_pos */
455 1.89 rillig
456 1.118 rillig struct control_statement *c_surrounding;
457 1.118 rillig } control_statement;
458 1.1 cgd
459 1.18 christos typedef struct {
460 1.70 rillig size_t lo; /* inclusive */
461 1.70 rillig size_t hi; /* inclusive */
462 1.18 christos } range_t;
463 1.18 christos
464 1.188 rillig typedef enum {
465 1.188 rillig LC_ARGSUSED,
466 1.188 rillig LC_BITFIELDTYPE,
467 1.188 rillig LC_CONSTCOND,
468 1.188 rillig LC_FALLTHROUGH,
469 1.188 rillig LC_LINTLIBRARY,
470 1.188 rillig LC_LINTED,
471 1.188 rillig LC_LONGLONG,
472 1.188 rillig LC_NOTREACHED,
473 1.188 rillig LC_PRINTFLIKE,
474 1.188 rillig LC_PROTOLIB,
475 1.188 rillig LC_SCANFLIKE,
476 1.188 rillig LC_VARARGS,
477 1.188 rillig } lint_comment;
478 1.188 rillig
479 1.1 cgd #include "externs1.h"
480 1.11 augustss
481 1.37 rillig #define lint_assert(cond) \
482 1.37 rillig do { \
483 1.37 rillig if (!(cond)) \
484 1.37 rillig assert_failed(__FILE__, __LINE__, __func__, #cond); \
485 1.100 rillig } while (false)
486 1.37 rillig
487 1.49 rillig #ifdef DEBUG
488 1.49 rillig # include "err-msgs.h"
489 1.49 rillig
490 1.49 rillig /* ARGSUSED */
491 1.163 rillig static inline void __printflike(1, 2)
492 1.49 rillig check_printf(const char *fmt, ...)
493 1.49 rillig {
494 1.49 rillig }
495 1.49 rillig
496 1.99 rillig # define wrap_check_printf_at(func, msgid, pos, args...) \
497 1.97 rillig do { \
498 1.99 rillig check_printf(__CONCAT(MSG_, msgid), ##args); \
499 1.99 rillig (func)(msgid, pos, ##args); \
500 1.100 rillig } while (false)
501 1.97 rillig
502 1.99 rillig # define error_at(msgid, pos, args...) \
503 1.99 rillig wrap_check_printf_at(error_at, msgid, pos, ##args)
504 1.99 rillig # define warning_at(msgid, pos, args...) \
505 1.99 rillig wrap_check_printf_at(warning_at, msgid, pos, ##args)
506 1.99 rillig # define message_at(msgid, pos, args...) \
507 1.99 rillig wrap_check_printf_at(message_at, msgid, pos, ##args)
508 1.97 rillig
509 1.168 rillig # define wrap_check_printf(func, cond, msgid, args...) \
510 1.152 rillig ({ \
511 1.168 rillig if (/* CONSTCOND */cond) \
512 1.168 rillig debug_step("%s:%d: %s %d '%s' in %s", \
513 1.168 rillig __FILE__, __LINE__, #func, msgid, \
514 1.168 rillig __CONCAT(MSG_, msgid), __func__); \
515 1.99 rillig check_printf(__CONCAT(MSG_, msgid), ##args); \
516 1.99 rillig (func)(msgid, ##args); \
517 1.152 rillig /* LINTED 129 */ \
518 1.152 rillig })
519 1.49 rillig
520 1.185 rillig # define error(msgid, args...) wrap_check_printf(error, \
521 1.185 rillig true, msgid, ##args)
522 1.185 rillig # define warning(msgid, args...) wrap_check_printf(warning, \
523 1.185 rillig true, msgid, ##args)
524 1.185 rillig # define gnuism(msgid, args...) wrap_check_printf(gnuism, \
525 1.185 rillig !allow_gcc || (!allow_trad && !allow_c99), msgid, ##args)
526 1.185 rillig # define c99ism(msgid, args...) wrap_check_printf(c99ism, \
527 1.185 rillig !allow_c99 && (!allow_gcc || !allow_trad), msgid, ##args)
528 1.185 rillig # define c11ism(msgid, args...) wrap_check_printf(c11ism, \
529 1.185 rillig !allow_c11 && !allow_gcc, msgid, ##args)
530 1.185 rillig # define c23ism(msgid, args...) wrap_check_printf(c23ism, \
531 1.185 rillig !allow_c23, msgid, ##args)
532 1.49 rillig #endif
533 1.54 rillig
534 1.156 rillig #ifdef DEBUG
535 1.156 rillig # define query_message(query_id, args...) \
536 1.156 rillig do { \
537 1.168 rillig debug_step("%s:%d: query %d '%s' in %s", \
538 1.168 rillig __FILE__, __LINE__, \
539 1.168 rillig query_id, __CONCAT(MSG_Q, query_id), __func__); \
540 1.156 rillig check_printf(__CONCAT(MSG_Q, query_id), ##args); \
541 1.156 rillig (query_message)(query_id, ##args); \
542 1.156 rillig } while (false)
543 1.156 rillig #else
544 1.156 rillig # define query_message(...) \
545 1.156 rillig do { \
546 1.156 rillig if (any_query_enabled) \
547 1.156 rillig (query_message)(__VA_ARGS__); \
548 1.156 rillig } while (false)
549 1.156 rillig #endif
550 1.156 rillig
551 1.172 rillig /* Copies curr_pos, keeping things unique. */
552 1.172 rillig static inline pos_t
553 1.172 rillig unique_curr_pos(void)
554 1.172 rillig {
555 1.172 rillig pos_t curr = curr_pos;
556 1.172 rillig curr_pos.p_uniq++;
557 1.172 rillig if (curr_pos.p_file == csrc_pos.p_file)
558 1.172 rillig csrc_pos.p_uniq++;
559 1.172 rillig return curr;
560 1.172 rillig }
561 1.172 rillig
562 1.135 rillig static inline bool
563 1.69 rillig is_nonzero_val(const val_t *val)
564 1.54 rillig {
565 1.69 rillig return is_floating(val->v_tspec)
566 1.177 rillig ? val->u.floating != 0.0
567 1.177 rillig : val->u.integer != 0;
568 1.54 rillig }
569 1.54 rillig
570 1.135 rillig static inline bool
571 1.68 rillig constant_is_nonzero(const tnode_t *tn)
572 1.54 rillig {
573 1.54 rillig lint_assert(tn->tn_op == CON);
574 1.167 rillig lint_assert(tn->tn_type->t_tspec == tn->tn_val.v_tspec);
575 1.167 rillig return is_nonzero_val(&tn->tn_val);
576 1.54 rillig }
577 1.87 rillig
578 1.135 rillig static inline bool
579 1.87 rillig is_zero(const tnode_t *tn)
580 1.87 rillig {
581 1.167 rillig return tn != NULL && tn->tn_op == CON && !is_nonzero_val(&tn->tn_val);
582 1.87 rillig }
583 1.87 rillig
584 1.135 rillig static inline bool
585 1.87 rillig is_nonzero(const tnode_t *tn)
586 1.87 rillig {
587 1.167 rillig return tn != NULL && tn->tn_op == CON && is_nonzero_val(&tn->tn_val);
588 1.87 rillig }
589 1.102 rillig
590 1.184 rillig static inline const char *
591 1.184 rillig op_name(op_t op)
592 1.184 rillig {
593 1.184 rillig return modtab[op].m_name;
594 1.184 rillig }
595 1.184 rillig
596 1.135 rillig static inline bool
597 1.123 rillig is_binary(const tnode_t *tn)
598 1.123 rillig {
599 1.123 rillig return modtab[tn->tn_op].m_binary;
600 1.123 rillig }
601 1.123 rillig
602 1.135 rillig static inline uint64_t
603 1.102 rillig bit(unsigned i)
604 1.102 rillig {
605 1.120 rillig /*
606 1.120 rillig * TODO: Add proper support for INT128.
607 1.120 rillig * This involves changing val_t to 128 bits.
608 1.120 rillig */
609 1.120 rillig if (i >= 64)
610 1.120 rillig return 0; /* XXX: not correct for INT128 and UINT128 */
611 1.120 rillig
612 1.102 rillig lint_assert(i < 64);
613 1.102 rillig return (uint64_t)1 << i;
614 1.102 rillig }
615 1.102 rillig
616 1.135 rillig static inline bool
617 1.177 rillig msb(int64_t si, tspec_t t)
618 1.124 rillig {
619 1.182 rillig return ((uint64_t)si & bit(size_in_bits(t) - 1)) != 0;
620 1.124 rillig }
621 1.124 rillig
622 1.135 rillig static inline uint64_t
623 1.102 rillig value_bits(unsigned bitsize)
624 1.102 rillig {
625 1.102 rillig lint_assert(bitsize > 0);
626 1.102 rillig
627 1.102 rillig /* for long double (80 or 128), double _Complex (128) */
628 1.102 rillig /*
629 1.102 rillig * XXX: double _Complex does not have 128 bits of precision,
630 1.102 rillig * therefore it should never be necessary to query the value bits
631 1.102 rillig * of such a type; see d_c99_complex_split.c to trigger this case.
632 1.102 rillig */
633 1.102 rillig if (bitsize >= 64)
634 1.102 rillig return ~((uint64_t)0);
635 1.102 rillig
636 1.102 rillig return ~(~(uint64_t)0 << bitsize);
637 1.102 rillig }
638 1.103 rillig
639 1.103 rillig /* C99 6.7.8p7 */
640 1.135 rillig static inline bool
641 1.103 rillig is_struct_or_union(tspec_t t)
642 1.103 rillig {
643 1.103 rillig return t == STRUCT || t == UNION;
644 1.103 rillig }
645 1.148 rillig
646 1.148 rillig static inline bool
647 1.148 rillig is_member(const sym_t *sym)
648 1.148 rillig {
649 1.160 rillig return sym->s_scl == STRUCT_MEMBER || sym->s_scl == UNION_MEMBER;
650 1.148 rillig }
651 1.183 rillig
652 1.183 rillig static inline void
653 1.183 rillig set_symtyp(symt_t symt)
654 1.183 rillig {
655 1.183 rillig if (yflag)
656 1.183 rillig debug_step("%s: %s -> %s", __func__,
657 1.183 rillig symt_name(symtyp), symt_name(symt));
658 1.183 rillig symtyp = symt;
659 1.183 rillig }
660