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