lint1.h revision 1.215 1 1.215 rillig /* $NetBSD: lint1.h,v 1.215 2024/03/03 16:09:01 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.1 cgd #include "op.h"
37 1.12 tv
38 1.159 rillig /*
39 1.159 rillig * A memory pool collects allocated objects that must be available until:
40 1.159 rillig * - the end of a block,
41 1.159 rillig * - the end of an expression, or
42 1.159 rillig * - the end of the translation unit.
43 1.159 rillig */
44 1.159 rillig typedef struct memory_pool {
45 1.194 rillig struct memory_pool_item {
46 1.194 rillig void *p;
47 1.194 rillig #ifdef DEBUG_MEM
48 1.194 rillig size_t size;
49 1.194 rillig const char *descr;
50 1.194 rillig #endif
51 1.194 rillig } *items;
52 1.159 rillig size_t len;
53 1.159 rillig size_t cap;
54 1.159 rillig } memory_pool;
55 1.159 rillig
56 1.154 rillig /* See saved_lwarn in cgram.y. */
57 1.53 rillig #define LWARN_ALL (-2)
58 1.53 rillig #define LWARN_NONE (-1)
59 1.27 christos
60 1.1 cgd /*
61 1.1 cgd * Describes the position of a declaration or anything else.
62 1.96 rillig *
63 1.96 rillig * FIXME: Just a single file:lineno pair is not enough to accurately describe
64 1.96 rillig * the position of a symbol. The whole inclusion path at that point must be
65 1.96 rillig * stored as well. This makes a difference for symbols from included
66 1.96 rillig * headers, see print_stack_trace.
67 1.1 cgd */
68 1.1 cgd typedef struct {
69 1.205 rillig const char *p_file;
70 1.1 cgd int p_line;
71 1.7 cgd int p_uniq; /* uniquifier */
72 1.1 cgd } pos_t;
73 1.7 cgd
74 1.195 rillig // TODO: Use bit-fields instead of plain bool, but keep an eye on arm and
75 1.200 rillig // powerpc, on which NetBSD's GCC 10.5.0 (but not the upstream GCC) generates
76 1.200 rillig // code that leads to extra 327 warnings, even in msg_327.c, which does not
77 1.200 rillig // contain any type qualifier at all.
78 1.200 rillig //
79 1.200 rillig // A possible starting point for continuing the investigation is that
80 1.195 rillig // type_qualifiers is a very small struct that contains only bool bit-fields,
81 1.195 rillig // and this struct is a member of the parser's union.
82 1.195 rillig //
83 1.195 rillig // Instead of using plain bool instead of bit-fields, an alternative workaround
84 1.195 rillig // is to compile cgram.c with -Os or -O1 instead of -O2. The generated code
85 1.195 rillig // between -Os and -O2 differs too much though to give a hint at the root
86 1.195 rillig // cause.
87 1.191 rillig typedef struct {
88 1.195 rillig bool tq_const;
89 1.195 rillig bool tq_restrict;
90 1.195 rillig bool tq_volatile;
91 1.195 rillig bool tq_atomic;
92 1.191 rillig } type_qualifiers;
93 1.1 cgd
94 1.193 rillig /* A bool, integer or floating-point value. */
95 1.1 cgd typedef struct {
96 1.1 cgd tspec_t v_tspec;
97 1.105 rillig /*
98 1.105 rillig * Set if an integer constant is unsigned only in C90 and later, but
99 1.105 rillig * not in traditional C.
100 1.105 rillig *
101 1.202 rillig * See the operators table in oper.c, columns "l r".
102 1.105 rillig */
103 1.105 rillig bool v_unsigned_since_c90;
104 1.166 rillig bool v_char_constant;
105 1.1 cgd union {
106 1.177 rillig int64_t integer;
107 1.177 rillig long double floating;
108 1.177 rillig } u;
109 1.1 cgd } val_t;
110 1.1 cgd
111 1.1 cgd /*
112 1.62 rillig * Structures of type struct_or_union uniquely identify structures. This can't
113 1.174 rillig * be done in structures of type type_t, because these are copied if they must
114 1.174 rillig * be modified. So it would not be possible to check if two structures are
115 1.174 rillig * identical by comparing the pointers to the type structures.
116 1.1 cgd *
117 1.174 rillig * If the structure has no tag name, its first typedef name is used to identify
118 1.174 rillig * the structure in lint2.
119 1.1 cgd */
120 1.205 rillig typedef struct {
121 1.126 rillig unsigned int sou_size_in_bits;
122 1.176 rillig unsigned int sou_align_in_bits;
123 1.132 rillig bool sou_incomplete:1;
124 1.205 rillig struct sym *sou_first_member;
125 1.205 rillig struct sym *sou_tag;
126 1.205 rillig struct sym *sou_first_typedef;
127 1.62 rillig } struct_or_union;
128 1.1 cgd
129 1.1 cgd /*
130 1.1 cgd * same as above for enums
131 1.1 cgd */
132 1.205 rillig typedef struct {
133 1.132 rillig bool en_incomplete:1;
134 1.205 rillig struct sym *en_first_enumerator;
135 1.205 rillig struct sym *en_tag;
136 1.205 rillig struct sym *en_first_typedef;
137 1.63 rillig } enumeration;
138 1.1 cgd
139 1.1 cgd /*
140 1.93 rillig * The type of an expression or object. Complex types are formed via t_subt
141 1.164 rillig * (for arrays, pointers and functions), as well as t_sou.
142 1.1 cgd */
143 1.94 rillig struct lint1_type {
144 1.1 cgd tspec_t t_tspec; /* type specifier */
145 1.132 rillig bool t_incomplete_array:1;
146 1.132 rillig bool t_const:1; /* const modifier */
147 1.132 rillig bool t_volatile:1; /* volatile modifier */
148 1.199 rillig bool t_proto:1; /* function prototype (t_params valid) */
149 1.132 rillig bool t_vararg:1; /* prototype with '...' */
150 1.132 rillig bool t_typedef:1; /* type defined with typedef */
151 1.151 rillig bool t_typeof:1; /* type defined with GCC's __typeof__ */
152 1.132 rillig bool t_bitfield:1;
153 1.109 rillig /*
154 1.204 rillig * Either the type is currently an enum (having t_tspec ENUM), or it is
155 1.204 rillig * an integer type (typically INT) that has been implicitly converted
156 1.204 rillig * from an enum type. In both cases, t_enum is valid.
157 1.109 rillig *
158 1.204 rillig * The information about a former enum type is retained to allow type
159 1.204 rillig * checks in expressions such as ((var1 & 0x0001) == var2), to detect
160 1.204 rillig * when var1 and var2 are from incompatible enum types.
161 1.109 rillig */
162 1.132 rillig bool t_is_enum:1;
163 1.132 rillig bool t_packed:1;
164 1.1 cgd union {
165 1.205 rillig int _t_dim; /* dimension (if ARRAY) */
166 1.164 rillig struct_or_union *_t_sou;
167 1.63 rillig enumeration *_t_enum;
168 1.205 rillig struct sym *_t_params; /* parameters (if t_proto) */
169 1.1 cgd } t_u;
170 1.169 rillig unsigned int t_bit_field_width:8;
171 1.169 rillig unsigned int t_bit_field_offset:24;
172 1.205 rillig struct lint1_type *t_subt; /*- element type (if ARRAY),
173 1.169 rillig * return value (if FUNC),
174 1.169 rillig * target type (if PTR) */
175 1.17 christos };
176 1.1 cgd
177 1.1 cgd #define t_dim t_u._t_dim
178 1.164 rillig #define t_sou t_u._t_sou
179 1.1 cgd #define t_enum t_u._t_enum
180 1.199 rillig #define t_params t_u._t_params
181 1.1 cgd
182 1.209 rillig
183 1.205 rillig typedef enum {
184 1.209 rillig SK_VCFT, /* variable, constant, function, type */
185 1.209 rillig SK_MEMBER, /* member of a struct or union */
186 1.209 rillig SK_TAG,
187 1.209 rillig SK_LABEL
188 1.209 rillig } symbol_kind;
189 1.1 cgd
190 1.1 cgd /*
191 1.115 rillig * storage classes and related things
192 1.1 cgd */
193 1.1 cgd typedef enum {
194 1.203 rillig NO_SCL,
195 1.204 rillig EXTERN, /* external symbols (independent of decl_t) */
196 1.204 rillig STATIC, /* static symbols (local and global) */
197 1.204 rillig AUTO, /* automatic symbols (except register) */
198 1.204 rillig REG, /* register */
199 1.204 rillig TYPEDEF, /* typedef */
200 1.190 rillig THREAD_LOCAL,
201 1.65 rillig STRUCT_TAG,
202 1.65 rillig UNION_TAG,
203 1.65 rillig ENUM_TAG,
204 1.160 rillig STRUCT_MEMBER,
205 1.160 rillig UNION_MEMBER,
206 1.146 rillig BOOL_CONST,
207 1.146 rillig ENUM_CONST,
208 1.204 rillig ABSTRACT, /* abstract symbol (sizeof, casts, unnamed
209 1.204 rillig * argument) */
210 1.1 cgd } scl_t;
211 1.1 cgd
212 1.186 rillig /* C23 6.7.4 */
213 1.186 rillig typedef enum {
214 1.187 rillig FS_INLINE, /* since C99 */
215 1.187 rillig FS_NORETURN, /* since C11 */
216 1.186 rillig } function_specifier;
217 1.186 rillig
218 1.1 cgd /*
219 1.1 cgd * symbol table entry
220 1.1 cgd */
221 1.205 rillig typedef struct sym {
222 1.205 rillig const char *s_name;
223 1.205 rillig const char *s_rename; /* renamed symbol's given name */
224 1.44 rillig pos_t s_def_pos; /* position of last (prototype) definition,
225 1.204 rillig * prototype declaration, no-prototype-def.,
226 1.204 rillig * tentative definition or declaration, in this
227 1.204 rillig * order */
228 1.66 rillig pos_t s_set_pos; /* position of first initialization */
229 1.44 rillig pos_t s_use_pos; /* position of first use */
230 1.209 rillig symbol_kind s_kind;
231 1.133 rillig const struct keyword *s_keyword;
232 1.132 rillig bool s_bitfield:1;
233 1.132 rillig bool s_set:1; /* variable set, label defined */
234 1.132 rillig bool s_used:1; /* variable/label used */
235 1.199 rillig bool s_param:1; /* symbol is function parameter */
236 1.141 rillig bool s_register:1; /* symbol is register variable */
237 1.199 rillig bool s_defparam:1; /* undefined symbol in old-style function
238 1.204 rillig * definition */
239 1.132 rillig bool s_return_type_implicit_int:1;
240 1.158 rillig bool s_osdef:1; /* symbol stems from old-style function def. */
241 1.132 rillig bool s_inline:1; /* true if this is an inline function */
242 1.205 rillig struct sym *s_ext_sym; /* for locally declared external symbols, the
243 1.204 rillig * pointer to the external symbol with the same
244 1.204 rillig * name */
245 1.1 cgd def_t s_def; /* declared, tentative defined, defined */
246 1.174 rillig scl_t s_scl; /* storage class, more or less */
247 1.71 rillig int s_block_level; /* level of declaration, -1 if not in symbol
248 1.204 rillig * table */
249 1.33 rillig type_t *s_type;
250 1.1 cgd union {
251 1.147 rillig bool s_bool_constant;
252 1.147 rillig int s_enum_constant; /* XXX: should be TARG_INT */
253 1.147 rillig struct {
254 1.205 rillig struct_or_union *sm_containing_type;
255 1.147 rillig unsigned int sm_offset_in_bits;
256 1.147 rillig } s_member;
257 1.147 rillig struct {
258 1.147 rillig int sk_token;
259 1.186 rillig union {
260 1.186 rillig /* if T_TYPE or T_STRUCT_OR_UNION */
261 1.186 rillig tspec_t sk_tspec;
262 1.186 rillig /* if T_QUAL */
263 1.191 rillig type_qualifiers sk_type_qualifier;
264 1.186 rillig /* if T_FUNCTION_SPECIFIER */
265 1.186 rillig function_specifier function_specifier;
266 1.186 rillig } u;
267 1.147 rillig } s_keyword;
268 1.205 rillig struct sym *s_old_style_params; /* parameters in an old-style
269 1.147 rillig * function definition */
270 1.1 cgd } u;
271 1.205 rillig struct sym *s_symtab_next; /* next symbol with same hash value */
272 1.205 rillig struct sym **s_symtab_ref; /* pointer to s_symtab_next of the
273 1.139 rillig * previous symbol */
274 1.205 rillig struct sym *s_next; /* next struct/union member, enumerator,
275 1.204 rillig * parameter */
276 1.205 rillig struct sym *s_level_next; /* next symbol declared on the same
277 1.139 rillig * level */
278 1.1 cgd } sym_t;
279 1.1 cgd
280 1.1 cgd /*
281 1.35 rillig * Used to keep some information about symbols before they are entered
282 1.1 cgd * into the symbol table.
283 1.1 cgd */
284 1.205 rillig typedef struct sbuf {
285 1.205 rillig const char *sb_name; /* name of symbol */
286 1.1 cgd size_t sb_len; /* length (without '\0') */
287 1.1 cgd sym_t *sb_sym; /* symbol table entry */
288 1.1 cgd } sbuf_t;
289 1.1 cgd
290 1.1 cgd
291 1.214 rillig typedef struct {
292 1.214 rillig struct tnode *func;
293 1.214 rillig struct tnode **args;
294 1.214 rillig size_t args_len;
295 1.214 rillig size_t args_cap;
296 1.214 rillig } function_call;
297 1.214 rillig
298 1.1 cgd /*
299 1.1 cgd * tree node
300 1.1 cgd */
301 1.205 rillig typedef struct tnode {
302 1.1 cgd op_t tn_op; /* operator */
303 1.1 cgd type_t *tn_type; /* type */
304 1.132 rillig bool tn_lvalue:1; /* node is lvalue */
305 1.132 rillig bool tn_cast:1; /* if tn_op == CVT, it's an explicit cast */
306 1.132 rillig bool tn_parenthesized:1;
307 1.193 rillig bool tn_sys:1; /* the operator comes from a system header;
308 1.193 rillig * used in strict bool mode to allow mixing
309 1.193 rillig * bool and scalar, as these places are not
310 1.193 rillig * considered fixable */
311 1.132 rillig bool tn_system_dependent:1; /* depends on sizeof or offsetof */
312 1.1 cgd union {
313 1.1 cgd struct {
314 1.205 rillig struct tnode *_tn_left; /* (left) operand */
315 1.205 rillig struct tnode *_tn_right; /* right operand */
316 1.1 cgd } tn_s;
317 1.1 cgd sym_t *_tn_sym; /* symbol if op == NAME */
318 1.167 rillig val_t _tn_val; /* value if op == CON */
319 1.212 rillig buffer *_tn_string; /* string if op == STRING; for
320 1.212 rillig * character strings, 'data' points to
321 1.212 rillig * the concatenated string literals in
322 1.212 rillig * source form, and 'len' is the
323 1.212 rillig * length of the concatenation; for
324 1.212 rillig * wide strings, 'data' is NULL and
325 1.212 rillig * 'len' is the number of resulting
326 1.212 rillig * characters */
327 1.214 rillig function_call *_tn_call;
328 1.1 cgd } tn_u;
329 1.1 cgd } tnode_t;
330 1.1 cgd
331 1.98 rillig #define tn_left tn_u.tn_s._tn_left
332 1.98 rillig #define tn_right tn_u.tn_s._tn_right
333 1.98 rillig #define tn_sym tn_u._tn_sym
334 1.98 rillig #define tn_val tn_u._tn_val
335 1.42 rillig #define tn_string tn_u._tn_string
336 1.214 rillig #define tn_call tn_u._tn_call
337 1.1 cgd
338 1.112 rillig struct generic_association {
339 1.112 rillig type_t *ga_arg; /* NULL means default or error */
340 1.112 rillig tnode_t *ga_result; /* NULL means error */
341 1.112 rillig struct generic_association *ga_prev;
342 1.107 rillig };
343 1.107 rillig
344 1.129 rillig struct array_size {
345 1.129 rillig bool has_dim;
346 1.129 rillig int dim;
347 1.129 rillig };
348 1.129 rillig
349 1.173 rillig typedef enum decl_level_kind {
350 1.173 rillig DLK_EXTERN, /* global types, variables or functions */
351 1.173 rillig DLK_STRUCT, /* members */
352 1.173 rillig DLK_UNION, /* members */
353 1.173 rillig DLK_ENUM, /* constants */
354 1.199 rillig DLK_OLD_STYLE_PARAMS, /* parameters in an old-style function
355 1.150 rillig * definition */
356 1.173 rillig DLK_PROTO_PARAMS, /* parameters in a prototype function
357 1.150 rillig * definition */
358 1.173 rillig DLK_AUTO, /* local types or variables */
359 1.173 rillig DLK_ABSTRACT /* abstract (unnamed) declaration; type name;
360 1.173 rillig * used in casts and sizeof */
361 1.173 rillig } decl_level_kind;
362 1.150 rillig
363 1.1 cgd /*
364 1.199 rillig * A declaration level collects information for a declarator in a struct,
365 1.199 rillig * union or enum declaration, a parameter declaration list, or a plain
366 1.199 rillig * declaration in or outside a function body.
367 1.171 rillig *
368 1.171 rillig * For nested declarations, the global 'dcs' holds all information needed for
369 1.171 rillig * the current level, the outer levels are available via 'd_enclosing'.
370 1.1 cgd */
371 1.205 rillig typedef struct decl_level {
372 1.173 rillig decl_level_kind d_kind;
373 1.72 rillig tspec_t d_abstract_type;/* VOID, BOOL, CHAR, INT or COMPLEX */
374 1.72 rillig tspec_t d_complex_mod; /* FLOAT or DOUBLE */
375 1.72 rillig tspec_t d_sign_mod; /* SIGNED or UNSIGN */
376 1.180 rillig tspec_t d_rank_mod; /* SHORT, LONG or LLONG */
377 1.3 jpo scl_t d_scl; /* storage class */
378 1.174 rillig type_t *d_type; /* after dcs_end_type, the pointer to the type
379 1.174 rillig * used for all declarators */
380 1.78 rillig sym_t *d_redeclared_symbol;
381 1.178 rillig unsigned int d_sou_size_in_bits; /* size of the structure or
382 1.178 rillig * union being built, without
383 1.178 rillig * trailing padding */
384 1.178 rillig unsigned int d_sou_align_in_bits; /* alignment of the structure
385 1.178 rillig * or union being built */
386 1.192 rillig type_qualifiers d_qual; /* in declaration specifiers */
387 1.132 rillig bool d_inline:1; /* inline in declaration specifiers */
388 1.157 rillig bool d_multiple_storage_classes:1; /* reported in dcs_end_type */
389 1.132 rillig bool d_invalid_type_combination:1;
390 1.174 rillig bool d_nonempty_decl:1; /* in a function declaration, whether at
391 1.174 rillig * least one tag was declared */
392 1.170 rillig bool d_no_type_specifier:1;
393 1.132 rillig bool d_asm:1; /* set if d_ctx == AUTO and asm() present */
394 1.132 rillig bool d_packed:1;
395 1.132 rillig bool d_used:1;
396 1.174 rillig type_t *d_tag_type; /* during a member declaration, the tag type to
397 1.174 rillig * which the member belongs */
398 1.199 rillig sym_t *d_func_params; /* during a function declaration, the
399 1.198 rillig * parameters, stored in the enclosing level */
400 1.174 rillig pos_t d_func_def_pos; /* position of the function definition */
401 1.170 rillig sym_t *d_first_dlsym; /* first symbol declared at this level */
402 1.170 rillig sym_t **d_last_dlsym; /* points to s_level_next in the last symbol
403 1.139 rillig declaration at this level */
404 1.198 rillig sym_t *d_func_proto_syms; /* symbols defined in prototype, such
405 1.198 rillig * as tagged types or parameter names,
406 1.199 rillig * may overlap d_func_params */
407 1.173 rillig struct decl_level *d_enclosing; /* the enclosing declaration level */
408 1.173 rillig } decl_level;
409 1.1 cgd
410 1.196 rillig struct parameter_list {
411 1.196 rillig sym_t *first;
412 1.196 rillig bool vararg:1;
413 1.196 rillig bool prototype:1;
414 1.196 rillig };
415 1.196 rillig
416 1.191 rillig /*
417 1.191 rillig * A sequence of asterisks and qualifiers, from right to left. For example,
418 1.191 rillig * 'const ***volatile **const volatile' results in [c-v-, ----, --v-, ----,
419 1.191 rillig * ----]. The leftmost 'const' is not included in this list, it is stored in
420 1.193 rillig * dcs->d_qual instead.
421 1.191 rillig */
422 1.205 rillig typedef struct qual_ptr {
423 1.191 rillig type_qualifiers qualifiers;
424 1.205 rillig struct qual_ptr *p_next;
425 1.108 rillig } qual_ptr;
426 1.1 cgd
427 1.1 cgd /*
428 1.93 rillig * The values of the 'case' labels, linked via cl_next in reverse order of
429 1.93 rillig * appearance in the code, that is from bottom to top.
430 1.1 cgd */
431 1.205 rillig typedef struct case_label {
432 1.1 cgd val_t cl_val;
433 1.77 rillig struct case_label *cl_next;
434 1.77 rillig } case_label_t;
435 1.1 cgd
436 1.88 rillig typedef enum {
437 1.88 rillig CS_DO_WHILE,
438 1.88 rillig CS_FOR,
439 1.88 rillig CS_FUNCTION_BODY,
440 1.88 rillig CS_IF,
441 1.88 rillig CS_SWITCH,
442 1.88 rillig CS_WHILE
443 1.88 rillig } control_statement_kind;
444 1.88 rillig
445 1.1 cgd /*
446 1.35 rillig * Used to keep information about nested control statements.
447 1.1 cgd */
448 1.52 rillig typedef struct control_statement {
449 1.88 rillig control_statement_kind c_kind; /* to ensure proper nesting */
450 1.204 rillig bool c_loop:1; /* 'continue' and 'break' are valid */
451 1.204 rillig bool c_switch:1; /* 'case' and 'break' are valid */
452 1.204 rillig bool c_break:1; /* the loop/switch has a reachable 'break'
453 1.204 rillig * statement */
454 1.204 rillig bool c_continue:1; /* the loop has a reachable 'continue'
455 1.204 rillig * statement */
456 1.204 rillig bool c_default:1; /* the switch has a 'default' label */
457 1.132 rillig bool c_maybe_endless:1; /* the controlling expression is
458 1.82 rillig * always true (as in 'for (;;)' or
459 1.82 rillig * 'while (1)'), there may be break
460 1.82 rillig * statements though */
461 1.132 rillig bool c_always_then:1;
462 1.132 rillig bool c_reached_end_of_then:1;
463 1.132 rillig bool c_had_return_noval:1; /* had "return;" */
464 1.132 rillig bool c_had_return_value:1; /* had "return expr;" */
465 1.89 rillig
466 1.204 rillig type_t *c_switch_type; /* type of switch expression */
467 1.101 rillig tnode_t *c_switch_expr;
468 1.77 rillig case_label_t *c_case_labels; /* list of case values */
469 1.89 rillig
470 1.159 rillig memory_pool c_for_expr3_mem; /* saved memory for end of loop
471 1.89 rillig * expression in for() */
472 1.204 rillig tnode_t *c_for_expr3; /* end of loop expr in for() */
473 1.89 rillig pos_t c_for_expr3_pos; /* position of end of loop expr */
474 1.89 rillig pos_t c_for_expr3_csrc_pos; /* same for csrc_pos */
475 1.89 rillig
476 1.118 rillig struct control_statement *c_surrounding;
477 1.118 rillig } control_statement;
478 1.1 cgd
479 1.18 christos typedef struct {
480 1.204 rillig size_t lo; /* inclusive */
481 1.204 rillig size_t hi; /* inclusive */
482 1.18 christos } range_t;
483 1.18 christos
484 1.207 rillig typedef enum designator_kind {
485 1.208 rillig DK_MEMBER, /* .member */
486 1.208 rillig DK_SUBSCRIPT, /* [subscript] */
487 1.207 rillig DK_SCALAR /* no textual representation, not generated by
488 1.208 rillig * the parser; used for scalar initializer
489 1.208 rillig * expressions surrounded by braces */
490 1.207 rillig } designator_kind;
491 1.207 rillig
492 1.207 rillig /*
493 1.207 rillig * A single component on the path from the "current object" of a brace level
494 1.207 rillig * to the sub-object that is initialized by an expression.
495 1.207 rillig *
496 1.207 rillig * C99 6.7.8p6, 6.7.8p7
497 1.207 rillig */
498 1.207 rillig typedef struct designator {
499 1.207 rillig designator_kind dr_kind;
500 1.208 rillig const sym_t *dr_member; /* for DK_MEMBER */
501 1.208 rillig size_t dr_subscript; /* for DK_SUBSCRIPT */
502 1.207 rillig bool dr_done;
503 1.207 rillig } designator;
504 1.207 rillig
505 1.207 rillig /*
506 1.207 rillig * The path from the "current object" of a brace level to the sub-object that
507 1.207 rillig * is initialized by an expression. Examples of designations are '.member'
508 1.207 rillig * or '.member[123].member.member[1][1]'.
509 1.207 rillig *
510 1.207 rillig * C99 6.7.8p6, 6.7.8p7
511 1.207 rillig */
512 1.207 rillig typedef struct designation {
513 1.207 rillig designator *dn_items;
514 1.207 rillig size_t dn_len;
515 1.207 rillig size_t dn_cap;
516 1.207 rillig } designation;
517 1.207 rillig
518 1.188 rillig typedef enum {
519 1.188 rillig LC_ARGSUSED,
520 1.188 rillig LC_BITFIELDTYPE,
521 1.188 rillig LC_CONSTCOND,
522 1.188 rillig LC_FALLTHROUGH,
523 1.188 rillig LC_LINTLIBRARY,
524 1.188 rillig LC_LINTED,
525 1.188 rillig LC_LONGLONG,
526 1.188 rillig LC_NOTREACHED,
527 1.188 rillig LC_PRINTFLIKE,
528 1.188 rillig LC_PROTOLIB,
529 1.188 rillig LC_SCANFLIKE,
530 1.188 rillig LC_VARARGS,
531 1.188 rillig } lint_comment;
532 1.188 rillig
533 1.212 rillig typedef struct {
534 1.212 rillig size_t start;
535 1.215 rillig size_t end;
536 1.212 rillig uint64_t value;
537 1.212 rillig bool escaped; /* \n, \003, \x24 */
538 1.212 rillig bool named_escape; /* \a, \n, etc. */
539 1.212 rillig bool literal_escape; /* \?, \\, etc. */
540 1.212 rillig uint8_t octal_digits; /* 1 to 3; 0 means not applicable */
541 1.212 rillig uint8_t hex_digits; /* 1 to 3; 0 means not applicable */
542 1.212 rillig bool next_literal; /* when a new string literal begins */
543 1.212 rillig bool invalid_escape; /* single-character escape, recoverable */
544 1.212 rillig bool overflow; /* for octal and hex escapes */
545 1.212 rillig bool missing_hex_digits;
546 1.212 rillig bool unescaped_newline; /* stops iterating */
547 1.212 rillig } quoted_iterator;
548 1.212 rillig
549 1.1 cgd #include "externs1.h"
550 1.11 augustss
551 1.37 rillig #define lint_assert(cond) \
552 1.37 rillig do { \
553 1.37 rillig if (!(cond)) \
554 1.37 rillig assert_failed(__FILE__, __LINE__, __func__, #cond); \
555 1.100 rillig } while (false)
556 1.37 rillig
557 1.201 rillig static inline tnode_t *
558 1.201 rillig tn_ck_left(const tnode_t *tn)
559 1.201 rillig {
560 1.201 rillig lint_assert(has_operands(tn));
561 1.201 rillig return tn->tn_left;
562 1.201 rillig }
563 1.201 rillig
564 1.201 rillig static inline tnode_t *
565 1.201 rillig tn_ck_right(const tnode_t *tn)
566 1.201 rillig {
567 1.201 rillig lint_assert(has_operands(tn));
568 1.201 rillig return tn->tn_right;
569 1.201 rillig }
570 1.201 rillig
571 1.49 rillig #ifdef DEBUG
572 1.49 rillig # include "err-msgs.h"
573 1.49 rillig
574 1.49 rillig /* ARGSUSED */
575 1.163 rillig static inline void __printflike(1, 2)
576 1.49 rillig check_printf(const char *fmt, ...)
577 1.49 rillig {
578 1.49 rillig }
579 1.49 rillig
580 1.99 rillig # define wrap_check_printf_at(func, msgid, pos, args...) \
581 1.97 rillig do { \
582 1.99 rillig check_printf(__CONCAT(MSG_, msgid), ##args); \
583 1.99 rillig (func)(msgid, pos, ##args); \
584 1.100 rillig } while (false)
585 1.97 rillig
586 1.99 rillig # define error_at(msgid, pos, args...) \
587 1.99 rillig wrap_check_printf_at(error_at, msgid, pos, ##args)
588 1.99 rillig # define warning_at(msgid, pos, args...) \
589 1.99 rillig wrap_check_printf_at(warning_at, msgid, pos, ##args)
590 1.99 rillig # define message_at(msgid, pos, args...) \
591 1.99 rillig wrap_check_printf_at(message_at, msgid, pos, ##args)
592 1.97 rillig
593 1.168 rillig # define wrap_check_printf(func, cond, msgid, args...) \
594 1.152 rillig ({ \
595 1.168 rillig if (/* CONSTCOND */cond) \
596 1.168 rillig debug_step("%s:%d: %s %d '%s' in %s", \
597 1.168 rillig __FILE__, __LINE__, #func, msgid, \
598 1.168 rillig __CONCAT(MSG_, msgid), __func__); \
599 1.99 rillig check_printf(__CONCAT(MSG_, msgid), ##args); \
600 1.99 rillig (func)(msgid, ##args); \
601 1.152 rillig /* LINTED 129 */ \
602 1.152 rillig })
603 1.49 rillig
604 1.185 rillig # define error(msgid, args...) wrap_check_printf(error, \
605 1.185 rillig true, msgid, ##args)
606 1.185 rillig # define warning(msgid, args...) wrap_check_printf(warning, \
607 1.185 rillig true, msgid, ##args)
608 1.185 rillig # define gnuism(msgid, args...) wrap_check_printf(gnuism, \
609 1.185 rillig !allow_gcc || (!allow_trad && !allow_c99), msgid, ##args)
610 1.185 rillig # define c99ism(msgid, args...) wrap_check_printf(c99ism, \
611 1.185 rillig !allow_c99 && (!allow_gcc || !allow_trad), msgid, ##args)
612 1.185 rillig # define c11ism(msgid, args...) wrap_check_printf(c11ism, \
613 1.185 rillig !allow_c11 && !allow_gcc, msgid, ##args)
614 1.185 rillig # define c23ism(msgid, args...) wrap_check_printf(c23ism, \
615 1.185 rillig !allow_c23, msgid, ##args)
616 1.49 rillig #endif
617 1.54 rillig
618 1.156 rillig #ifdef DEBUG
619 1.156 rillig # define query_message(query_id, args...) \
620 1.156 rillig do { \
621 1.168 rillig debug_step("%s:%d: query %d '%s' in %s", \
622 1.168 rillig __FILE__, __LINE__, \
623 1.168 rillig query_id, __CONCAT(MSG_Q, query_id), __func__); \
624 1.156 rillig check_printf(__CONCAT(MSG_Q, query_id), ##args); \
625 1.156 rillig (query_message)(query_id, ##args); \
626 1.156 rillig } while (false)
627 1.156 rillig #else
628 1.156 rillig # define query_message(...) \
629 1.156 rillig do { \
630 1.156 rillig if (any_query_enabled) \
631 1.156 rillig (query_message)(__VA_ARGS__); \
632 1.156 rillig } while (false)
633 1.156 rillig #endif
634 1.156 rillig
635 1.172 rillig /* Copies curr_pos, keeping things unique. */
636 1.172 rillig static inline pos_t
637 1.172 rillig unique_curr_pos(void)
638 1.172 rillig {
639 1.172 rillig pos_t curr = curr_pos;
640 1.172 rillig curr_pos.p_uniq++;
641 1.172 rillig if (curr_pos.p_file == csrc_pos.p_file)
642 1.172 rillig csrc_pos.p_uniq++;
643 1.172 rillig return curr;
644 1.172 rillig }
645 1.172 rillig
646 1.135 rillig static inline bool
647 1.69 rillig is_nonzero_val(const val_t *val)
648 1.54 rillig {
649 1.69 rillig return is_floating(val->v_tspec)
650 1.177 rillig ? val->u.floating != 0.0
651 1.177 rillig : val->u.integer != 0;
652 1.54 rillig }
653 1.54 rillig
654 1.135 rillig static inline bool
655 1.68 rillig constant_is_nonzero(const tnode_t *tn)
656 1.54 rillig {
657 1.54 rillig lint_assert(tn->tn_op == CON);
658 1.167 rillig lint_assert(tn->tn_type->t_tspec == tn->tn_val.v_tspec);
659 1.167 rillig return is_nonzero_val(&tn->tn_val);
660 1.54 rillig }
661 1.87 rillig
662 1.135 rillig static inline bool
663 1.87 rillig is_zero(const tnode_t *tn)
664 1.87 rillig {
665 1.167 rillig return tn != NULL && tn->tn_op == CON && !is_nonzero_val(&tn->tn_val);
666 1.87 rillig }
667 1.87 rillig
668 1.135 rillig static inline bool
669 1.87 rillig is_nonzero(const tnode_t *tn)
670 1.87 rillig {
671 1.167 rillig return tn != NULL && tn->tn_op == CON && is_nonzero_val(&tn->tn_val);
672 1.87 rillig }
673 1.102 rillig
674 1.184 rillig static inline const char *
675 1.184 rillig op_name(op_t op)
676 1.184 rillig {
677 1.184 rillig return modtab[op].m_name;
678 1.184 rillig }
679 1.184 rillig
680 1.135 rillig static inline bool
681 1.123 rillig is_binary(const tnode_t *tn)
682 1.123 rillig {
683 1.123 rillig return modtab[tn->tn_op].m_binary;
684 1.123 rillig }
685 1.123 rillig
686 1.135 rillig static inline uint64_t
687 1.102 rillig bit(unsigned i)
688 1.102 rillig {
689 1.120 rillig /*
690 1.204 rillig * TODO: Add proper support for INT128. This involves changing val_t to
691 1.204 rillig * 128 bits.
692 1.120 rillig */
693 1.120 rillig if (i >= 64)
694 1.120 rillig return 0; /* XXX: not correct for INT128 and UINT128 */
695 1.120 rillig
696 1.102 rillig lint_assert(i < 64);
697 1.102 rillig return (uint64_t)1 << i;
698 1.102 rillig }
699 1.102 rillig
700 1.135 rillig static inline bool
701 1.177 rillig msb(int64_t si, tspec_t t)
702 1.124 rillig {
703 1.182 rillig return ((uint64_t)si & bit(size_in_bits(t) - 1)) != 0;
704 1.124 rillig }
705 1.124 rillig
706 1.135 rillig static inline uint64_t
707 1.102 rillig value_bits(unsigned bitsize)
708 1.102 rillig {
709 1.102 rillig lint_assert(bitsize > 0);
710 1.102 rillig
711 1.102 rillig /* for long double (80 or 128), double _Complex (128) */
712 1.102 rillig /*
713 1.204 rillig * XXX: double _Complex does not have 128 bits of precision, therefore
714 1.204 rillig * it should never be necessary to query the value bits of such a type;
715 1.204 rillig * see d_c99_complex_split.c to trigger this case.
716 1.102 rillig */
717 1.102 rillig if (bitsize >= 64)
718 1.206 rillig return ~(uint64_t)0;
719 1.102 rillig
720 1.102 rillig return ~(~(uint64_t)0 << bitsize);
721 1.102 rillig }
722 1.103 rillig
723 1.103 rillig /* C99 6.7.8p7 */
724 1.135 rillig static inline bool
725 1.103 rillig is_struct_or_union(tspec_t t)
726 1.103 rillig {
727 1.103 rillig return t == STRUCT || t == UNION;
728 1.103 rillig }
729 1.148 rillig
730 1.148 rillig static inline bool
731 1.148 rillig is_member(const sym_t *sym)
732 1.148 rillig {
733 1.160 rillig return sym->s_scl == STRUCT_MEMBER || sym->s_scl == UNION_MEMBER;
734 1.148 rillig }
735 1.183 rillig
736 1.183 rillig static inline void
737 1.209 rillig set_sym_kind(symbol_kind kind)
738 1.183 rillig {
739 1.183 rillig if (yflag)
740 1.183 rillig debug_step("%s: %s -> %s", __func__,
741 1.209 rillig symbol_kind_name(sym_kind), symbol_kind_name(kind));
742 1.209 rillig sym_kind = kind;
743 1.183 rillig }
744