lint1.h revision 1.178 1 1.178 rillig /* $NetBSD: lint1.h,v 1.178 2023/07/02 18:28:15 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.1 cgd * 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.159 rillig void **items;
47 1.159 rillig size_t len;
48 1.159 rillig size_t cap;
49 1.159 rillig } memory_pool;
50 1.159 rillig
51 1.154 rillig /* See saved_lwarn in cgram.y. */
52 1.53 rillig #define LWARN_ALL (-2)
53 1.53 rillig #define LWARN_NONE (-1)
54 1.27 christos
55 1.1 cgd /*
56 1.1 cgd * Describes the position of a declaration or anything else.
57 1.96 rillig *
58 1.96 rillig * FIXME: Just a single file:lineno pair is not enough to accurately describe
59 1.96 rillig * the position of a symbol. The whole inclusion path at that point must be
60 1.96 rillig * stored as well. This makes a difference for symbols from included
61 1.96 rillig * headers, see print_stack_trace.
62 1.1 cgd */
63 1.1 cgd typedef struct {
64 1.92 rillig const char *p_file;
65 1.1 cgd int p_line;
66 1.7 cgd int p_uniq; /* uniquifier */
67 1.1 cgd } pos_t;
68 1.7 cgd
69 1.1 cgd /*
70 1.125 rillig * Strings cannot be referenced simply by a pointer to their first
71 1.1 cgd * char. This is because strings can contain NUL characters other than the
72 1.1 cgd * trailing NUL.
73 1.1 cgd *
74 1.1 cgd * Strings are stored with a trailing NUL.
75 1.1 cgd */
76 1.1 cgd typedef struct strg {
77 1.142 rillig bool st_char; /* string doesn't have an 'L' prefix */
78 1.142 rillig size_t st_len; /* length without trailing NUL */
79 1.142 rillig void *st_mem; /* char[] for st_char, or wchar_t[] */
80 1.1 cgd } strg_t;
81 1.1 cgd
82 1.1 cgd /*
83 1.1 cgd * qualifiers (only for lex/yacc interface)
84 1.1 cgd */
85 1.1 cgd typedef enum {
86 1.161 rillig CONST,
87 1.161 rillig VOLATILE,
88 1.161 rillig RESTRICT,
89 1.161 rillig THREAD, /* XXX: storage-class-qualifier */
90 1.161 rillig ATOMIC,
91 1.1 cgd } tqual_t;
92 1.1 cgd
93 1.104 rillig /* An integer or floating-point value. */
94 1.1 cgd typedef struct {
95 1.1 cgd tspec_t v_tspec;
96 1.105 rillig /*
97 1.105 rillig * Set if an integer constant is unsigned only in C90 and later, but
98 1.105 rillig * not in traditional C.
99 1.105 rillig *
100 1.105 rillig * See the operators table in ops.def, columns "l r".
101 1.105 rillig */
102 1.105 rillig bool v_unsigned_since_c90;
103 1.166 rillig bool v_char_constant;
104 1.1 cgd union {
105 1.177 rillig int64_t integer;
106 1.177 rillig long double floating;
107 1.177 rillig } u;
108 1.1 cgd } val_t;
109 1.1 cgd
110 1.1 cgd /*
111 1.62 rillig * Structures of type struct_or_union uniquely identify structures. This can't
112 1.174 rillig * be done in structures of type type_t, because these are copied if they must
113 1.174 rillig * be modified. So it would not be possible to check if two structures are
114 1.174 rillig * identical by comparing the pointers to the type structures.
115 1.1 cgd *
116 1.174 rillig * If the structure has no tag name, its first typedef name is used to identify
117 1.174 rillig * the structure in lint2.
118 1.1 cgd */
119 1.1 cgd typedef struct {
120 1.126 rillig unsigned int sou_size_in_bits;
121 1.176 rillig unsigned int sou_align_in_bits;
122 1.132 rillig bool sou_incomplete:1;
123 1.62 rillig struct sym *sou_first_member;
124 1.62 rillig struct sym *sou_tag;
125 1.62 rillig struct sym *sou_first_typedef;
126 1.62 rillig } struct_or_union;
127 1.1 cgd
128 1.1 cgd /*
129 1.1 cgd * same as above for enums
130 1.1 cgd */
131 1.1 cgd typedef struct {
132 1.132 rillig bool en_incomplete:1;
133 1.63 rillig struct sym *en_first_enumerator;
134 1.63 rillig struct sym *en_tag;
135 1.63 rillig struct sym *en_first_typedef;
136 1.63 rillig } enumeration;
137 1.1 cgd
138 1.1 cgd /*
139 1.93 rillig * The type of an expression or object. Complex types are formed via t_subt
140 1.164 rillig * (for arrays, pointers and functions), as well as t_sou.
141 1.1 cgd */
142 1.94 rillig struct lint1_type {
143 1.1 cgd tspec_t t_tspec; /* type specifier */
144 1.132 rillig bool t_incomplete_array:1;
145 1.132 rillig bool t_const:1; /* const modifier */
146 1.132 rillig bool t_volatile:1; /* volatile modifier */
147 1.132 rillig bool t_proto:1; /* function prototype (t_args valid) */
148 1.132 rillig bool t_vararg:1; /* prototype with '...' */
149 1.132 rillig bool t_typedef:1; /* type defined with typedef */
150 1.151 rillig bool t_typeof:1; /* type defined with GCC's __typeof__ */
151 1.132 rillig bool t_bitfield:1;
152 1.109 rillig /*
153 1.109 rillig * Either the type is currently an enum (having t_tspec ENUM), or
154 1.109 rillig * it is an integer type (typically INT) that has been implicitly
155 1.109 rillig * converted from an enum type. In both cases, t_enum is valid.
156 1.109 rillig *
157 1.109 rillig * The information about a former enum type is retained to allow
158 1.109 rillig * type checks in expressions such as ((var1 & 0x0001) == var2), to
159 1.109 rillig * detect when var1 and var2 are from incompatible enum types.
160 1.109 rillig */
161 1.132 rillig bool t_is_enum:1;
162 1.132 rillig bool t_packed:1;
163 1.1 cgd union {
164 1.74 rillig int _t_dim; /* dimension (if ARRAY) */
165 1.164 rillig struct_or_union *_t_sou;
166 1.63 rillig enumeration *_t_enum;
167 1.1 cgd struct sym *_t_args; /* arguments (if t_proto) */
168 1.1 cgd } t_u;
169 1.169 rillig unsigned int t_bit_field_width:8;
170 1.169 rillig unsigned int t_bit_field_offset:24;
171 1.169 rillig struct lint1_type *t_subt; /* element type (if ARRAY),
172 1.169 rillig * return value (if FUNC),
173 1.169 rillig * target type (if PTR) */
174 1.17 christos };
175 1.1 cgd
176 1.1 cgd #define t_dim t_u._t_dim
177 1.164 rillig #define t_sou t_u._t_sou
178 1.1 cgd #define t_enum t_u._t_enum
179 1.1 cgd #define t_args t_u._t_args
180 1.1 cgd
181 1.1 cgd /*
182 1.1 cgd * types of symbols
183 1.1 cgd */
184 1.1 cgd typedef enum {
185 1.1 cgd FVFT, /* variables, functions, type names, enums */
186 1.39 rillig FMEMBER, /* members of structs or unions */
187 1.1 cgd FTAG, /* tags */
188 1.39 rillig FLABEL /* labels */
189 1.1 cgd } symt_t;
190 1.1 cgd
191 1.1 cgd /*
192 1.115 rillig * storage classes and related things
193 1.1 cgd */
194 1.1 cgd typedef enum {
195 1.1 cgd NOSCL,
196 1.115 rillig EXTERN, /* external symbols (independent of decl_t) */
197 1.1 cgd STATIC, /* static symbols (local and global) */
198 1.1 cgd AUTO, /* automatic symbols (except register) */
199 1.1 cgd REG, /* register */
200 1.1 cgd TYPEDEF, /* typedef */
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.1 cgd ABSTRACT, /* abstract symbol (sizeof, casts, unnamed argument) */
209 1.4 jpo INLINE /* only used by the parser */
210 1.1 cgd } scl_t;
211 1.1 cgd
212 1.1 cgd /*
213 1.1 cgd * symbol table entry
214 1.1 cgd */
215 1.1 cgd typedef struct sym {
216 1.33 rillig const char *s_name;
217 1.9 cgd const char *s_rename; /* renamed symbol's given name */
218 1.44 rillig pos_t s_def_pos; /* position of last (prototype) definition,
219 1.39 rillig prototype declaration, no-prototype-def.,
220 1.1 cgd tentative definition or declaration,
221 1.1 cgd in this order */
222 1.66 rillig pos_t s_set_pos; /* position of first initialization */
223 1.44 rillig pos_t s_use_pos; /* position of first use */
224 1.1 cgd symt_t s_kind; /* type of symbol */
225 1.133 rillig const struct keyword *s_keyword;
226 1.132 rillig bool s_bitfield:1;
227 1.132 rillig bool s_set:1; /* variable set, label defined */
228 1.132 rillig bool s_used:1; /* variable/label used */
229 1.132 rillig bool s_arg:1; /* symbol is function argument */
230 1.141 rillig bool s_register:1; /* symbol is register variable */
231 1.158 rillig bool s_defarg:1; /* undefined symbol in old-style function
232 1.1 cgd definition */
233 1.132 rillig bool s_return_type_implicit_int:1;
234 1.158 rillig bool s_osdef:1; /* symbol stems from old-style function def. */
235 1.132 rillig bool s_inline:1; /* true if this is an inline function */
236 1.141 rillig struct sym *s_ext_sym; /* for locally declared external symbols, the
237 1.141 rillig * pointer to the external symbol with the
238 1.141 rillig * same name */
239 1.1 cgd def_t s_def; /* declared, tentative defined, defined */
240 1.174 rillig scl_t s_scl; /* storage class, more or less */
241 1.71 rillig int s_block_level; /* level of declaration, -1 if not in symbol
242 1.1 cgd table */
243 1.33 rillig type_t *s_type;
244 1.1 cgd union {
245 1.147 rillig bool s_bool_constant;
246 1.147 rillig int s_enum_constant; /* XXX: should be TARG_INT */
247 1.147 rillig struct {
248 1.175 rillig struct_or_union *sm_containing_type;
249 1.147 rillig unsigned int sm_offset_in_bits;
250 1.147 rillig } s_member;
251 1.147 rillig struct {
252 1.147 rillig int sk_token;
253 1.147 rillig tspec_t sk_tspec; /* only for types */
254 1.147 rillig tqual_t sk_qualifier; /* only for qualifiers */
255 1.147 rillig } s_keyword;
256 1.147 rillig struct sym *s_old_style_args; /* arguments in an old-style
257 1.147 rillig * function definition */
258 1.1 cgd } u;
259 1.139 rillig struct sym *s_symtab_next; /* next symbol with same hash value */
260 1.139 rillig struct sym **s_symtab_ref; /* pointer to s_symtab_next of the
261 1.139 rillig * previous symbol */
262 1.38 rillig struct sym *s_next; /* next struct/union member, enumerator,
263 1.1 cgd argument */
264 1.139 rillig struct sym *s_level_next; /* next symbol declared on the same
265 1.139 rillig * level */
266 1.1 cgd } sym_t;
267 1.1 cgd
268 1.1 cgd /*
269 1.35 rillig * Used to keep some information about symbols before they are entered
270 1.1 cgd * into the symbol table.
271 1.1 cgd */
272 1.1 cgd typedef struct sbuf {
273 1.1 cgd const char *sb_name; /* name of symbol */
274 1.1 cgd size_t sb_len; /* length (without '\0') */
275 1.1 cgd sym_t *sb_sym; /* symbol table entry */
276 1.1 cgd } sbuf_t;
277 1.1 cgd
278 1.1 cgd
279 1.1 cgd /*
280 1.1 cgd * tree node
281 1.1 cgd */
282 1.1 cgd typedef struct tnode {
283 1.1 cgd op_t tn_op; /* operator */
284 1.1 cgd type_t *tn_type; /* type */
285 1.132 rillig bool tn_lvalue:1; /* node is lvalue */
286 1.132 rillig bool tn_cast:1; /* if tn_op == CVT, it's an explicit cast */
287 1.132 rillig bool tn_parenthesized:1;
288 1.132 rillig bool tn_sys:1; /* in strict bool mode, allow mixture between
289 1.131 rillig * bool and scalar, for code from system
290 1.131 rillig * headers that may be a mixture between
291 1.131 rillig * scalar types and bool
292 1.110 rillig */
293 1.132 rillig bool tn_system_dependent:1; /* depends on sizeof or offsetof */
294 1.1 cgd union {
295 1.1 cgd struct {
296 1.1 cgd struct tnode *_tn_left; /* (left) operand */
297 1.1 cgd struct tnode *_tn_right; /* right operand */
298 1.1 cgd } tn_s;
299 1.1 cgd sym_t *_tn_sym; /* symbol if op == NAME */
300 1.167 rillig val_t _tn_val; /* value if op == CON */
301 1.42 rillig strg_t *_tn_string; /* string if op == STRING */
302 1.1 cgd } tn_u;
303 1.1 cgd } tnode_t;
304 1.1 cgd
305 1.98 rillig #define tn_left tn_u.tn_s._tn_left
306 1.98 rillig #define tn_right tn_u.tn_s._tn_right
307 1.98 rillig #define tn_sym tn_u._tn_sym
308 1.98 rillig #define tn_val tn_u._tn_val
309 1.42 rillig #define tn_string tn_u._tn_string
310 1.1 cgd
311 1.112 rillig struct generic_association {
312 1.112 rillig type_t *ga_arg; /* NULL means default or error */
313 1.112 rillig tnode_t *ga_result; /* NULL means error */
314 1.112 rillig struct generic_association *ga_prev;
315 1.107 rillig };
316 1.107 rillig
317 1.129 rillig struct array_size {
318 1.129 rillig bool has_dim;
319 1.129 rillig int dim;
320 1.129 rillig };
321 1.129 rillig
322 1.173 rillig typedef enum decl_level_kind {
323 1.173 rillig DLK_EXTERN, /* global types, variables or functions */
324 1.173 rillig DLK_STRUCT, /* members */
325 1.173 rillig DLK_UNION, /* members */
326 1.173 rillig DLK_ENUM, /* constants */
327 1.173 rillig DLK_OLD_STYLE_ARGS, /* arguments in an old-style function
328 1.150 rillig * definition */
329 1.173 rillig DLK_PROTO_PARAMS, /* parameters in a prototype function
330 1.150 rillig * definition */
331 1.173 rillig DLK_AUTO, /* local types or variables */
332 1.173 rillig DLK_ABSTRACT /* abstract (unnamed) declaration; type name;
333 1.173 rillig * used in casts and sizeof */
334 1.173 rillig } decl_level_kind;
335 1.150 rillig
336 1.1 cgd /*
337 1.171 rillig * A declaration level describes a struct, union, enum, block, argument
338 1.171 rillig * declaration list or an abstract (unnamed) type.
339 1.171 rillig *
340 1.171 rillig * For nested declarations, the global 'dcs' holds all information needed for
341 1.171 rillig * the current level, the outer levels are available via 'd_enclosing'.
342 1.1 cgd */
343 1.173 rillig typedef struct decl_level {
344 1.173 rillig decl_level_kind d_kind;
345 1.72 rillig tspec_t d_abstract_type;/* VOID, BOOL, CHAR, INT or COMPLEX */
346 1.72 rillig tspec_t d_complex_mod; /* FLOAT or DOUBLE */
347 1.72 rillig tspec_t d_sign_mod; /* SIGNED or UNSIGN */
348 1.72 rillig tspec_t d_rank_mod; /* SHORT, LONG or QUAD */
349 1.3 jpo scl_t d_scl; /* storage class */
350 1.174 rillig type_t *d_type; /* after dcs_end_type, the pointer to the type
351 1.174 rillig * used for all declarators */
352 1.78 rillig sym_t *d_redeclared_symbol;
353 1.178 rillig unsigned int d_sou_size_in_bits; /* size of the structure or
354 1.178 rillig * union being built, without
355 1.178 rillig * trailing padding */
356 1.178 rillig unsigned int d_sou_align_in_bits; /* alignment of the structure
357 1.178 rillig * or union being built */
358 1.132 rillig bool d_const:1; /* const in declaration specifiers */
359 1.132 rillig bool d_volatile:1; /* volatile in declaration specifiers */
360 1.132 rillig bool d_inline:1; /* inline in declaration specifiers */
361 1.157 rillig bool d_multiple_storage_classes:1; /* reported in dcs_end_type */
362 1.132 rillig bool d_invalid_type_combination:1;
363 1.174 rillig bool d_nonempty_decl:1; /* in a function declaration, whether at
364 1.174 rillig * least one tag was declared */
365 1.132 rillig bool d_vararg:1;
366 1.174 rillig bool d_prototype:1; /* in a function declaration, whether the
367 1.174 rillig * function has a prototype */
368 1.170 rillig bool d_no_type_specifier:1;
369 1.132 rillig bool d_asm:1; /* set if d_ctx == AUTO and asm() present */
370 1.132 rillig bool d_packed:1;
371 1.132 rillig bool d_used:1;
372 1.174 rillig type_t *d_tag_type; /* during a member declaration, the tag type to
373 1.174 rillig * which the member belongs */
374 1.174 rillig sym_t *d_func_args; /* during a function declaration, the list of
375 1.174 rillig * arguments */
376 1.174 rillig pos_t d_func_def_pos; /* position of the function definition */
377 1.170 rillig sym_t *d_first_dlsym; /* first symbol declared at this level */
378 1.170 rillig sym_t **d_last_dlsym; /* points to s_level_next in the last symbol
379 1.139 rillig declaration at this level */
380 1.80 rillig sym_t *d_func_proto_syms; /* symbols defined in prototype */
381 1.173 rillig struct decl_level *d_enclosing; /* the enclosing declaration level */
382 1.173 rillig } decl_level;
383 1.1 cgd
384 1.108 rillig /* One level of pointer indirection in declarators, including qualifiers. */
385 1.108 rillig typedef struct qual_ptr {
386 1.170 rillig bool p_const:1;
387 1.170 rillig bool p_volatile:1;
388 1.170 rillig bool p_pointer:1;
389 1.108 rillig struct qual_ptr *p_next;
390 1.108 rillig } qual_ptr;
391 1.1 cgd
392 1.1 cgd /*
393 1.93 rillig * The values of the 'case' labels, linked via cl_next in reverse order of
394 1.93 rillig * appearance in the code, that is from bottom to top.
395 1.1 cgd */
396 1.77 rillig typedef struct case_label {
397 1.1 cgd val_t cl_val;
398 1.77 rillig struct case_label *cl_next;
399 1.77 rillig } case_label_t;
400 1.1 cgd
401 1.88 rillig typedef enum {
402 1.88 rillig CS_DO_WHILE,
403 1.88 rillig CS_FOR,
404 1.88 rillig CS_FUNCTION_BODY,
405 1.88 rillig CS_IF,
406 1.88 rillig CS_SWITCH,
407 1.88 rillig CS_WHILE
408 1.88 rillig } control_statement_kind;
409 1.88 rillig
410 1.1 cgd /*
411 1.35 rillig * Used to keep information about nested control statements.
412 1.1 cgd */
413 1.52 rillig typedef struct control_statement {
414 1.88 rillig control_statement_kind c_kind; /* to ensure proper nesting */
415 1.132 rillig bool c_loop:1; /* 'continue' and 'break' are valid */
416 1.132 rillig bool c_switch:1; /* 'case' and 'break' are valid */
417 1.132 rillig bool c_break:1; /* the loop/switch has a reachable
418 1.89 rillig * 'break' statement */
419 1.132 rillig bool c_continue:1; /* the loop has a reachable 'continue'
420 1.89 rillig * statement */
421 1.132 rillig bool c_default:1; /* the switch has a 'default' label */
422 1.132 rillig bool c_maybe_endless:1; /* the controlling expression is
423 1.82 rillig * always true (as in 'for (;;)' or
424 1.82 rillig * 'while (1)'), there may be break
425 1.82 rillig * statements though */
426 1.132 rillig bool c_always_then:1;
427 1.132 rillig bool c_reached_end_of_then:1;
428 1.132 rillig bool c_had_return_noval:1; /* had "return;" */
429 1.132 rillig bool c_had_return_value:1; /* had "return expr;" */
430 1.89 rillig
431 1.89 rillig type_t *c_switch_type; /* type of switch expression */
432 1.101 rillig tnode_t *c_switch_expr;
433 1.77 rillig case_label_t *c_case_labels; /* list of case values */
434 1.89 rillig
435 1.159 rillig memory_pool c_for_expr3_mem; /* saved memory for end of loop
436 1.89 rillig * expression in for() */
437 1.89 rillig tnode_t *c_for_expr3; /* end of loop expr in for() */
438 1.89 rillig pos_t c_for_expr3_pos; /* position of end of loop expr */
439 1.89 rillig pos_t c_for_expr3_csrc_pos; /* same for csrc_pos */
440 1.89 rillig
441 1.118 rillig struct control_statement *c_surrounding;
442 1.118 rillig } control_statement;
443 1.1 cgd
444 1.18 christos typedef struct {
445 1.70 rillig size_t lo; /* inclusive */
446 1.70 rillig size_t hi; /* inclusive */
447 1.18 christos } range_t;
448 1.18 christos
449 1.1 cgd #include "externs1.h"
450 1.11 augustss
451 1.37 rillig #define lint_assert(cond) \
452 1.37 rillig do { \
453 1.37 rillig if (!(cond)) \
454 1.37 rillig assert_failed(__FILE__, __LINE__, __func__, #cond); \
455 1.100 rillig } while (false)
456 1.37 rillig
457 1.49 rillig #ifdef DEBUG
458 1.49 rillig # include "err-msgs.h"
459 1.49 rillig
460 1.49 rillig /* ARGSUSED */
461 1.163 rillig static inline void __printflike(1, 2)
462 1.49 rillig check_printf(const char *fmt, ...)
463 1.49 rillig {
464 1.49 rillig }
465 1.49 rillig
466 1.99 rillig # define wrap_check_printf_at(func, msgid, pos, args...) \
467 1.97 rillig do { \
468 1.99 rillig check_printf(__CONCAT(MSG_, msgid), ##args); \
469 1.99 rillig (func)(msgid, pos, ##args); \
470 1.100 rillig } while (false)
471 1.97 rillig
472 1.99 rillig # define error_at(msgid, pos, args...) \
473 1.99 rillig wrap_check_printf_at(error_at, msgid, pos, ##args)
474 1.99 rillig # define warning_at(msgid, pos, args...) \
475 1.99 rillig wrap_check_printf_at(warning_at, msgid, pos, ##args)
476 1.99 rillig # define message_at(msgid, pos, args...) \
477 1.99 rillig wrap_check_printf_at(message_at, msgid, pos, ##args)
478 1.97 rillig
479 1.168 rillig # define wrap_check_printf(func, cond, msgid, args...) \
480 1.152 rillig ({ \
481 1.168 rillig if (/* CONSTCOND */cond) \
482 1.168 rillig debug_step("%s:%d: %s %d '%s' in %s", \
483 1.168 rillig __FILE__, __LINE__, #func, msgid, \
484 1.168 rillig __CONCAT(MSG_, msgid), __func__); \
485 1.99 rillig check_printf(__CONCAT(MSG_, msgid), ##args); \
486 1.99 rillig (func)(msgid, ##args); \
487 1.152 rillig /* LINTED 129 */ \
488 1.152 rillig })
489 1.49 rillig
490 1.168 rillig # define error(msgid, args...) wrap_check_printf(error, true, msgid, ##args)
491 1.168 rillig # define warning(msgid, args...) wrap_check_printf(warning, true, msgid, ##args)
492 1.168 rillig # define gnuism(msgid, args...) wrap_check_printf(gnuism, !allow_gcc || (!allow_trad && !allow_c99), msgid, ##args)
493 1.168 rillig # define c99ism(msgid, args...) wrap_check_printf(c99ism, !allow_c99 && (!allow_gcc || !allow_trad), msgid, ##args)
494 1.168 rillig # define c11ism(msgid, args...) wrap_check_printf(c11ism, !allow_c11 && !allow_gcc, msgid, ##args)
495 1.49 rillig #endif
496 1.54 rillig
497 1.156 rillig #ifdef DEBUG
498 1.156 rillig # define query_message(query_id, args...) \
499 1.156 rillig do { \
500 1.168 rillig debug_step("%s:%d: query %d '%s' in %s", \
501 1.168 rillig __FILE__, __LINE__, \
502 1.168 rillig query_id, __CONCAT(MSG_Q, query_id), __func__); \
503 1.156 rillig check_printf(__CONCAT(MSG_Q, query_id), ##args); \
504 1.156 rillig (query_message)(query_id, ##args); \
505 1.156 rillig } while (false)
506 1.156 rillig #else
507 1.156 rillig # define query_message(...) \
508 1.156 rillig do { \
509 1.156 rillig if (any_query_enabled) \
510 1.156 rillig (query_message)(__VA_ARGS__); \
511 1.156 rillig } while (false)
512 1.156 rillig #endif
513 1.156 rillig
514 1.172 rillig /* Copies curr_pos, keeping things unique. */
515 1.172 rillig static inline pos_t
516 1.172 rillig unique_curr_pos(void)
517 1.172 rillig {
518 1.172 rillig pos_t curr = curr_pos;
519 1.172 rillig curr_pos.p_uniq++;
520 1.172 rillig if (curr_pos.p_file == csrc_pos.p_file)
521 1.172 rillig csrc_pos.p_uniq++;
522 1.172 rillig return curr;
523 1.172 rillig }
524 1.172 rillig
525 1.135 rillig static inline bool
526 1.69 rillig is_nonzero_val(const val_t *val)
527 1.54 rillig {
528 1.69 rillig return is_floating(val->v_tspec)
529 1.177 rillig ? val->u.floating != 0.0
530 1.177 rillig : val->u.integer != 0;
531 1.54 rillig }
532 1.54 rillig
533 1.135 rillig static inline bool
534 1.68 rillig constant_is_nonzero(const tnode_t *tn)
535 1.54 rillig {
536 1.54 rillig lint_assert(tn->tn_op == CON);
537 1.167 rillig lint_assert(tn->tn_type->t_tspec == tn->tn_val.v_tspec);
538 1.167 rillig return is_nonzero_val(&tn->tn_val);
539 1.54 rillig }
540 1.87 rillig
541 1.135 rillig static inline bool
542 1.87 rillig is_zero(const tnode_t *tn)
543 1.87 rillig {
544 1.167 rillig return tn != NULL && tn->tn_op == CON && !is_nonzero_val(&tn->tn_val);
545 1.87 rillig }
546 1.87 rillig
547 1.135 rillig static inline bool
548 1.87 rillig is_nonzero(const tnode_t *tn)
549 1.87 rillig {
550 1.167 rillig return tn != NULL && tn->tn_op == CON && is_nonzero_val(&tn->tn_val);
551 1.87 rillig }
552 1.102 rillig
553 1.135 rillig static inline bool
554 1.123 rillig is_binary(const tnode_t *tn)
555 1.123 rillig {
556 1.123 rillig return modtab[tn->tn_op].m_binary;
557 1.123 rillig }
558 1.123 rillig
559 1.135 rillig static inline uint64_t
560 1.102 rillig bit(unsigned i)
561 1.102 rillig {
562 1.120 rillig /*
563 1.120 rillig * TODO: Add proper support for INT128.
564 1.120 rillig * This involves changing val_t to 128 bits.
565 1.120 rillig */
566 1.120 rillig if (i >= 64)
567 1.120 rillig return 0; /* XXX: not correct for INT128 and UINT128 */
568 1.120 rillig
569 1.102 rillig lint_assert(i < 64);
570 1.102 rillig return (uint64_t)1 << i;
571 1.102 rillig }
572 1.102 rillig
573 1.135 rillig static inline bool
574 1.177 rillig msb(int64_t si, tspec_t t)
575 1.124 rillig {
576 1.177 rillig return (si & bit((unsigned int)size_in_bits(t) - 1)) != 0;
577 1.124 rillig }
578 1.124 rillig
579 1.135 rillig static inline uint64_t
580 1.102 rillig value_bits(unsigned bitsize)
581 1.102 rillig {
582 1.102 rillig lint_assert(bitsize > 0);
583 1.102 rillig
584 1.102 rillig /* for long double (80 or 128), double _Complex (128) */
585 1.102 rillig /*
586 1.102 rillig * XXX: double _Complex does not have 128 bits of precision,
587 1.102 rillig * therefore it should never be necessary to query the value bits
588 1.102 rillig * of such a type; see d_c99_complex_split.c to trigger this case.
589 1.102 rillig */
590 1.102 rillig if (bitsize >= 64)
591 1.102 rillig return ~((uint64_t)0);
592 1.102 rillig
593 1.102 rillig return ~(~(uint64_t)0 << bitsize);
594 1.102 rillig }
595 1.103 rillig
596 1.103 rillig /* C99 6.7.8p7 */
597 1.135 rillig static inline bool
598 1.103 rillig is_struct_or_union(tspec_t t)
599 1.103 rillig {
600 1.103 rillig return t == STRUCT || t == UNION;
601 1.103 rillig }
602 1.148 rillig
603 1.148 rillig static inline bool
604 1.148 rillig is_member(const sym_t *sym)
605 1.148 rillig {
606 1.160 rillig return sym->s_scl == STRUCT_MEMBER || sym->s_scl == UNION_MEMBER;
607 1.148 rillig }
608