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