init.c revision 1.226 1 1.226 rillig /* $NetBSD: init.c,v 1.226 2021/12/21 21:04:08 rillig Exp $ */
2 1.2 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1994, 1995 Jochen Pohl
5 1.179 rillig * Copyright (c) 2021 Roland Illig
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.18 jmc #if HAVE_NBTOOL_CONFIG_H
36 1.18 jmc #include "nbtool_config.h"
37 1.18 jmc #endif
38 1.18 jmc
39 1.5 christos #include <sys/cdefs.h>
40 1.10 tv #if defined(__RCSID) && !defined(lint)
41 1.226 rillig __RCSID("$NetBSD: init.c,v 1.226 2021/12/21 21:04:08 rillig Exp $");
42 1.1 cgd #endif
43 1.1 cgd
44 1.1 cgd #include <stdlib.h>
45 1.17 thorpej #include <string.h>
46 1.1 cgd
47 1.1 cgd #include "lint1.h"
48 1.1 cgd
49 1.53 rillig
50 1.53 rillig /*
51 1.179 rillig * Initialization of global or local objects, like in:
52 1.93 rillig *
53 1.93 rillig * int number = 12345;
54 1.93 rillig * int number_with_braces = { 12345 };
55 1.93 rillig *
56 1.93 rillig * int array_of_unknown_size[] = { 111, 222, 333 };
57 1.93 rillig * int array_flat[2][2] = { 11, 12, 21, 22 };
58 1.93 rillig * int array_nested[2][2] = { { 11, 12 }, { 21, 22 } };
59 1.93 rillig *
60 1.93 rillig * struct { int x, y; } point = { 3, 4 };
61 1.119 rillig * struct { int x, y; } point = { .y = 4, .x = 3 };
62 1.93 rillig *
63 1.220 rillig * Any scalar expression or string in the initializer may be surrounded by
64 1.220 rillig * additional pairs of braces.
65 1.119 rillig *
66 1.220 rillig * For nested aggregate objects, the inner braces may be omitted like in
67 1.179 rillig * array_flat or spelled out like in array_nested. This is unusual in
68 1.179 rillig * practice and therefore only supported very basically.
69 1.93 rillig *
70 1.198 rillig * During an initialization, the grammar parser calls these functions:
71 1.93 rillig *
72 1.119 rillig * begin_initialization
73 1.119 rillig * init_lbrace for each '{'
74 1.157 rillig * add_designator_member for each '.member' before '='
75 1.157 rillig * add_designator_subscript for each '[123]' before '='
76 1.179 rillig * init_expr for each expression
77 1.119 rillig * init_rbrace for each '}'
78 1.119 rillig * end_initialization
79 1.93 rillig *
80 1.139 rillig * Each '{' begins a new brace level, each '}' ends the current brace level.
81 1.198 rillig * Each brace level has an associated "current object", which is the starting
82 1.198 rillig * point for resolving the optional designations such as '.member[3]'.
83 1.93 rillig *
84 1.93 rillig * See also:
85 1.93 rillig * C99 6.7.8 "Initialization"
86 1.220 rillig * C11 6.7.9 "Initialization"
87 1.93 rillig * d_c99_init.c for more examples
88 1.93 rillig */
89 1.93 rillig
90 1.55 rillig /*
91 1.135 rillig * A single component on the path to the sub-object that is initialized by an
92 1.135 rillig * initializer expression. Either a struct or union member, or an array
93 1.135 rillig * subscript.
94 1.55 rillig *
95 1.179 rillig * C99 6.7.8p6, 6.7.8p7
96 1.128 rillig */
97 1.221 rillig typedef struct designator {
98 1.179 rillig const char *dr_name; /* for struct and union */
99 1.179 rillig size_t dr_subscript; /* for array */
100 1.221 rillig } designator;
101 1.128 rillig
102 1.128 rillig /*
103 1.220 rillig * The path from the "current object" of a brace level to the sub-object that
104 1.220 rillig * will be initialized by the next expression. Examples for designations are
105 1.220 rillig * '.member' or '.member[123].member.member[1][1]'.
106 1.135 rillig *
107 1.179 rillig * C99 6.7.8p6, 6.7.8p7
108 1.55 rillig */
109 1.221 rillig typedef struct designation {
110 1.221 rillig designator *dn_items;
111 1.220 rillig size_t dn_len;
112 1.220 rillig size_t dn_cap;
113 1.221 rillig } designation;
114 1.53 rillig
115 1.179 rillig /*
116 1.220 rillig * Everything that happens between a '{' and the corresponding '}' of an
117 1.220 rillig * initialization.
118 1.179 rillig *
119 1.220 rillig * C99 6.7.8p17
120 1.179 rillig */
121 1.221 rillig typedef struct brace_level {
122 1.220 rillig /* The type of the "current object". */
123 1.220 rillig const type_t *bl_type;
124 1.220 rillig
125 1.201 rillig /*
126 1.220 rillig * The path to the sub-object of the "current object" that is
127 1.220 rillig * initialized by the next expression.
128 1.220 rillig *
129 1.220 rillig * TODO: use this not only for explicit designations but also for
130 1.220 rillig * implicit designations, like in C90.
131 1.201 rillig */
132 1.221 rillig designation bl_designation;
133 1.192 rillig
134 1.201 rillig /*
135 1.201 rillig * The next member of the struct or union that is to be initialized,
136 1.201 rillig * unless a specific member is selected by a designator.
137 1.220 rillig *
138 1.220 rillig * TODO: use bl_designation instead.
139 1.201 rillig */
140 1.201 rillig const sym_t *bl_member;
141 1.201 rillig /*
142 1.201 rillig * The subscript of the next array element that is to be initialized,
143 1.201 rillig * unless a specific subscript is selected by a designator.
144 1.220 rillig *
145 1.220 rillig * TODO: use bl_designation instead.
146 1.201 rillig */
147 1.201 rillig size_t bl_subscript;
148 1.220 rillig
149 1.220 rillig /*
150 1.220 rillig * Whether the designation is used up, that is, there is no next
151 1.220 rillig * sub-object left to be initialized.
152 1.220 rillig */
153 1.220 rillig bool bl_scalar_done:1; /* for scalars */
154 1.220 rillig
155 1.220 rillig /*
156 1.220 rillig * Whether lint has been confused by allowed but extra or omitted
157 1.220 rillig * braces. In such a case, lint skips further type checks on the
158 1.220 rillig * initializer expressions.
159 1.220 rillig *
160 1.220 rillig * TODO: properly handle the omitted braces.
161 1.220 rillig */
162 1.220 rillig bool bl_confused:1;
163 1.192 rillig
164 1.179 rillig struct brace_level *bl_enclosing;
165 1.221 rillig } brace_level;
166 1.179 rillig
167 1.198 rillig /*
168 1.198 rillig * An ongoing initialization.
169 1.198 rillig *
170 1.198 rillig * In most cases there is only ever a single initialization going on. See
171 1.198 rillig * pointer_to_compound_literal in msg_171.c for an exception.
172 1.198 rillig */
173 1.221 rillig typedef struct initialization {
174 1.193 rillig /* The symbol that is to be initialized. */
175 1.193 rillig sym_t *in_sym;
176 1.193 rillig
177 1.193 rillig /* The innermost brace level. */
178 1.221 rillig brace_level *in_brace_level;
179 1.193 rillig
180 1.110 rillig /*
181 1.219 rillig * The maximum subscript that has ever be seen for an array of
182 1.219 rillig * unknown size, which can only occur at the outermost brace level.
183 1.219 rillig */
184 1.219 rillig size_t in_max_subscript;
185 1.219 rillig
186 1.219 rillig /*
187 1.214 rillig * Is set when a structural error occurred in the initialization.
188 1.111 rillig * The effect is that the rest of the initialization is ignored
189 1.111 rillig * (parsed by yacc, expression trees built, but no initialization
190 1.111 rillig * takes place).
191 1.110 rillig */
192 1.176 rillig bool in_err;
193 1.110 rillig
194 1.179 rillig struct initialization *in_enclosing;
195 1.221 rillig } initialization;
196 1.1 cgd
197 1.145 rillig
198 1.175 rillig static void *
199 1.175 rillig unconst_cast(const void *p)
200 1.175 rillig {
201 1.175 rillig void *r;
202 1.175 rillig
203 1.190 rillig memcpy(&r, &p, sizeof(r));
204 1.175 rillig return r;
205 1.175 rillig }
206 1.175 rillig
207 1.177 rillig static bool
208 1.177 rillig has_automatic_storage_duration(const sym_t *sym)
209 1.177 rillig {
210 1.177 rillig
211 1.177 rillig return sym->s_scl == AUTO || sym->s_scl == REG;
212 1.177 rillig }
213 1.177 rillig
214 1.177 rillig /* C99 6.7.8p14, 6.7.8p15 */
215 1.177 rillig static bool
216 1.212 rillig is_character_array(const type_t *tp, tspec_t t)
217 1.177 rillig {
218 1.177 rillig tspec_t st;
219 1.177 rillig
220 1.177 rillig if (tp == NULL || tp->t_tspec != ARRAY)
221 1.177 rillig return false;
222 1.177 rillig
223 1.177 rillig st = tp->t_subt->t_tspec;
224 1.177 rillig return t == CHAR
225 1.177 rillig ? st == CHAR || st == UCHAR || st == SCHAR
226 1.177 rillig : st == WCHAR;
227 1.177 rillig }
228 1.177 rillig
229 1.177 rillig /* C99 6.7.8p9 */
230 1.177 rillig static bool
231 1.179 rillig is_unnamed(const sym_t *m)
232 1.177 rillig {
233 1.177 rillig
234 1.177 rillig return m->s_bitfield && m->s_name == unnamed;
235 1.177 rillig }
236 1.177 rillig
237 1.179 rillig /* C99 6.7.8p9 */
238 1.179 rillig static const sym_t *
239 1.179 rillig skip_unnamed(const sym_t *m)
240 1.179 rillig {
241 1.179 rillig
242 1.179 rillig while (m != NULL && is_unnamed(m))
243 1.179 rillig m = m->s_next;
244 1.179 rillig return m;
245 1.179 rillig }
246 1.179 rillig
247 1.177 rillig static const sym_t *
248 1.179 rillig first_named_member(const type_t *tp)
249 1.177 rillig {
250 1.177 rillig
251 1.179 rillig lint_assert(is_struct_or_union(tp->t_tspec));
252 1.179 rillig return skip_unnamed(tp->t_str->sou_first_member);
253 1.179 rillig }
254 1.179 rillig
255 1.179 rillig static const sym_t *
256 1.179 rillig look_up_member(const type_t *tp, const char *name)
257 1.179 rillig {
258 1.179 rillig const sym_t *m;
259 1.179 rillig
260 1.179 rillig lint_assert(is_struct_or_union(tp->t_tspec));
261 1.179 rillig for (m = tp->t_str->sou_first_member; m != NULL; m = m->s_next)
262 1.179 rillig if (!is_unnamed(m) && strcmp(m->s_name, name) == 0)
263 1.177 rillig return m;
264 1.177 rillig return NULL;
265 1.177 rillig }
266 1.177 rillig
267 1.179 rillig static const type_t *
268 1.179 rillig sym_type(const sym_t *sym)
269 1.179 rillig {
270 1.179 rillig
271 1.179 rillig return sym != NULL ? sym->s_type : NULL;
272 1.179 rillig }
273 1.179 rillig
274 1.179 rillig static const type_t *
275 1.179 rillig look_up_member_type(const type_t *tp, const char *name)
276 1.179 rillig {
277 1.179 rillig const sym_t *member;
278 1.179 rillig
279 1.179 rillig member = look_up_member(tp, name);
280 1.179 rillig if (member == NULL) {
281 1.182 rillig /* type '%s' does not have member '%s' */
282 1.182 rillig error(101, type_name(tp), name);
283 1.179 rillig }
284 1.179 rillig
285 1.179 rillig return sym_type(member);
286 1.179 rillig }
287 1.179 rillig
288 1.198 rillig /*
289 1.198 rillig * C99 6.7.8p22 says that the type of an array of unknown size becomes known
290 1.198 rillig * at the end of its initializer list.
291 1.198 rillig */
292 1.179 rillig static void
293 1.179 rillig update_type_of_array_of_unknown_size(sym_t *sym, size_t size)
294 1.179 rillig {
295 1.179 rillig type_t *tp;
296 1.179 rillig
297 1.189 rillig tp = dup_type(sym->s_type);
298 1.179 rillig tp->t_dim = (int)size;
299 1.179 rillig tp->t_incomplete_array = false;
300 1.179 rillig sym->s_type = tp;
301 1.179 rillig }
302 1.179 rillig
303 1.167 rillig
304 1.158 rillig /* In traditional C, bit-fields can be initialized only by integer constants. */
305 1.158 rillig static void
306 1.158 rillig check_bit_field_init(const tnode_t *ln, tspec_t lt, tspec_t rt)
307 1.158 rillig {
308 1.175 rillig
309 1.158 rillig if (tflag &&
310 1.158 rillig is_integer(lt) &&
311 1.158 rillig ln->tn_type->t_bitfield &&
312 1.158 rillig !is_integer(rt)) {
313 1.158 rillig /* bit-field initialization is illegal in traditional C */
314 1.158 rillig warning(186);
315 1.158 rillig }
316 1.158 rillig }
317 1.158 rillig
318 1.158 rillig static void
319 1.177 rillig check_non_constant_initializer(const tnode_t *tn, const sym_t *sym)
320 1.158 rillig {
321 1.177 rillig const sym_t *unused_sym;
322 1.177 rillig ptrdiff_t unused_offs;
323 1.175 rillig
324 1.158 rillig if (tn == NULL || tn->tn_op == CON)
325 1.158 rillig return;
326 1.158 rillig
327 1.177 rillig if (constant_addr(tn, &unused_sym, &unused_offs))
328 1.158 rillig return;
329 1.158 rillig
330 1.177 rillig if (has_automatic_storage_duration(sym)) {
331 1.158 rillig /* non-constant initializer */
332 1.158 rillig c99ism(177);
333 1.158 rillig } else {
334 1.158 rillig /* non-constant initializer */
335 1.158 rillig error(177);
336 1.158 rillig }
337 1.158 rillig }
338 1.158 rillig
339 1.158 rillig static void
340 1.197 rillig check_trad_no_auto_aggregate(const sym_t *sym)
341 1.179 rillig {
342 1.179 rillig
343 1.197 rillig if (has_automatic_storage_duration(sym) &&
344 1.179 rillig !is_scalar(sym->s_type->t_tspec)) {
345 1.209 rillig /* no automatic aggregate initialization in traditional C */
346 1.179 rillig warning(188);
347 1.179 rillig }
348 1.179 rillig }
349 1.179 rillig
350 1.179 rillig static void
351 1.224 rillig check_init_expr(const type_t *ltp, sym_t *lsym, tnode_t *rn)
352 1.158 rillig {
353 1.158 rillig tnode_t *ln;
354 1.224 rillig type_t *lutp;
355 1.158 rillig tspec_t lt, rt;
356 1.187 rillig struct memory_block *tmem;
357 1.158 rillig
358 1.224 rillig lutp = expr_unqualified_type(ltp);
359 1.200 rillig
360 1.158 rillig /* Create a temporary node for the left side. */
361 1.190 rillig ln = expr_zalloc(sizeof(*ln));
362 1.158 rillig ln->tn_op = NAME;
363 1.224 rillig ln->tn_type = lutp;
364 1.158 rillig ln->tn_lvalue = true;
365 1.224 rillig ln->tn_sym = lsym;
366 1.158 rillig
367 1.224 rillig rn = cconv(rn);
368 1.158 rillig
369 1.158 rillig lt = ln->tn_type->t_tspec;
370 1.224 rillig rt = rn->tn_type->t_tspec;
371 1.158 rillig
372 1.206 rillig debug_step("typeok '%s', '%s'",
373 1.224 rillig type_name(ln->tn_type), type_name(rn->tn_type));
374 1.224 rillig if (!typeok(INIT, 0, ln, rn))
375 1.158 rillig return;
376 1.158 rillig
377 1.158 rillig /*
378 1.158 rillig * Preserve the tree memory. This is necessary because otherwise
379 1.158 rillig * expr() would free it.
380 1.158 rillig */
381 1.188 rillig tmem = expr_save_memory();
382 1.224 rillig expr(rn, true, false, true, false);
383 1.188 rillig expr_restore_memory(tmem);
384 1.158 rillig
385 1.158 rillig check_bit_field_init(ln, lt, rt);
386 1.158 rillig
387 1.158 rillig /*
388 1.158 rillig * XXX: Is it correct to do this conversion _after_ the typeok above?
389 1.158 rillig */
390 1.224 rillig if (lt != rt || (ltp->t_bitfield && rn->tn_op == CON))
391 1.224 rillig rn = convert(INIT, 0, unconst_cast(ltp), rn);
392 1.158 rillig
393 1.224 rillig check_non_constant_initializer(rn, lsym);
394 1.158 rillig }
395 1.158 rillig
396 1.158 rillig
397 1.179 rillig static const type_t *
398 1.225 rillig designator_type(const designator *dr, const type_t *tp)
399 1.179 rillig {
400 1.179 rillig switch (tp->t_tspec) {
401 1.179 rillig case STRUCT:
402 1.179 rillig case UNION:
403 1.179 rillig if (dr->dr_name == NULL) {
404 1.179 rillig /* syntax error '%s' */
405 1.179 rillig error(249, "designator '[...]' is only for arrays");
406 1.179 rillig return sym_type(first_named_member(tp));
407 1.179 rillig }
408 1.179 rillig
409 1.179 rillig return look_up_member_type(tp, dr->dr_name);
410 1.179 rillig case ARRAY:
411 1.179 rillig if (dr->dr_name != NULL) {
412 1.179 rillig /* syntax error '%s' */
413 1.179 rillig error(249,
414 1.181 rillig "designator '.member' is only for struct/union");
415 1.179 rillig }
416 1.183 rillig if (!tp->t_incomplete_array &&
417 1.183 rillig dr->dr_subscript >= (size_t)tp->t_dim) {
418 1.183 rillig /* array subscript cannot be > %d: %ld */
419 1.183 rillig error(168, tp->t_dim - 1, (long)dr->dr_subscript);
420 1.183 rillig }
421 1.179 rillig return tp->t_subt;
422 1.179 rillig default:
423 1.179 rillig /* syntax error '%s' */
424 1.179 rillig error(249, "scalar type cannot use designator");
425 1.179 rillig return tp;
426 1.179 rillig }
427 1.179 rillig }
428 1.179 rillig
429 1.179 rillig
430 1.159 rillig #ifdef DEBUG
431 1.159 rillig static void
432 1.221 rillig designation_debug(const designation *dn)
433 1.159 rillig {
434 1.218 rillig size_t i;
435 1.159 rillig
436 1.218 rillig if (dn->dn_len == 0)
437 1.159 rillig return;
438 1.159 rillig
439 1.226 rillig debug_print_indent();
440 1.159 rillig debug_printf("designation: ");
441 1.218 rillig for (i = 0; i < dn->dn_len; i++) {
442 1.221 rillig const designator *dr = dn->dn_items + i;
443 1.179 rillig if (dr->dr_name != NULL) {
444 1.179 rillig debug_printf(".%s", dr->dr_name);
445 1.179 rillig lint_assert(dr->dr_subscript == 0);
446 1.179 rillig } else
447 1.179 rillig debug_printf("[%zu]", dr->dr_subscript);
448 1.179 rillig }
449 1.159 rillig debug_printf("\n");
450 1.159 rillig }
451 1.159 rillig #else
452 1.159 rillig #define designation_debug(dn) do { } while (false)
453 1.159 rillig #endif
454 1.159 rillig
455 1.159 rillig static void
456 1.221 rillig designation_add(designation *dn, const char *name, size_t subscript)
457 1.159 rillig {
458 1.179 rillig
459 1.218 rillig if (dn->dn_len == dn->dn_cap) {
460 1.218 rillig dn->dn_cap += 4;
461 1.218 rillig dn->dn_items = xrealloc(dn->dn_items,
462 1.218 rillig dn->dn_cap * sizeof(dn->dn_items[0]));
463 1.218 rillig }
464 1.159 rillig
465 1.218 rillig dn->dn_items[dn->dn_len].dr_name = name;
466 1.218 rillig dn->dn_items[dn->dn_len].dr_subscript = subscript;
467 1.218 rillig dn->dn_len++;
468 1.159 rillig }
469 1.159 rillig
470 1.159 rillig /*
471 1.179 rillig * Starting at the type of the current object, resolve the type of the
472 1.179 rillig * sub-object by following each designator in the list.
473 1.198 rillig *
474 1.198 rillig * C99 6.7.8p18
475 1.159 rillig */
476 1.179 rillig static const type_t *
477 1.225 rillig designation_type(const designation *dn, const type_t *tp)
478 1.179 rillig {
479 1.218 rillig size_t i;
480 1.179 rillig
481 1.218 rillig for (i = 0; i < dn->dn_len && tp != NULL; i++)
482 1.225 rillig tp = designator_type(dn->dn_items + i, tp);
483 1.179 rillig return tp;
484 1.179 rillig }
485 1.179 rillig
486 1.159 rillig static void
487 1.221 rillig designation_reset(designation *dn)
488 1.159 rillig {
489 1.159 rillig
490 1.218 rillig dn->dn_len = 0;
491 1.218 rillig }
492 1.218 rillig
493 1.218 rillig static void
494 1.221 rillig designation_free(designation *dn)
495 1.218 rillig {
496 1.184 rillig
497 1.218 rillig free(dn->dn_items);
498 1.159 rillig }
499 1.159 rillig
500 1.159 rillig
501 1.221 rillig static brace_level *
502 1.221 rillig brace_level_new(const type_t *tp, brace_level *enclosing)
503 1.152 rillig {
504 1.221 rillig brace_level *bl;
505 1.152 rillig
506 1.179 rillig bl = xcalloc(1, sizeof(*bl));
507 1.179 rillig bl->bl_type = tp;
508 1.178 rillig bl->bl_enclosing = enclosing;
509 1.179 rillig if (is_struct_or_union(tp->t_tspec))
510 1.192 rillig bl->bl_member = first_named_member(tp);
511 1.152 rillig
512 1.178 rillig return bl;
513 1.152 rillig }
514 1.152 rillig
515 1.152 rillig static void
516 1.221 rillig brace_level_free(brace_level *bl)
517 1.152 rillig {
518 1.179 rillig
519 1.218 rillig designation_free(&bl->bl_designation);
520 1.178 rillig free(bl);
521 1.152 rillig }
522 1.152 rillig
523 1.146 rillig #ifdef DEBUG
524 1.78 rillig static void
525 1.221 rillig brace_level_debug(const brace_level *bl)
526 1.74 rillig {
527 1.78 rillig
528 1.179 rillig lint_assert(bl->bl_type != NULL);
529 1.192 rillig lint_assert(bl->bl_member == NULL || !is_unnamed(bl->bl_member));
530 1.179 rillig
531 1.179 rillig debug_printf("type '%s'", type_name(bl->bl_type));
532 1.179 rillig
533 1.192 rillig if (is_struct_or_union(bl->bl_type->t_tspec) && bl->bl_member != NULL)
534 1.192 rillig debug_printf(", member '%s'", bl->bl_member->s_name);
535 1.179 rillig if (bl->bl_type->t_tspec == ARRAY)
536 1.192 rillig debug_printf(", subscript %zu", bl->bl_subscript);
537 1.78 rillig
538 1.179 rillig debug_printf("\n");
539 1.74 rillig }
540 1.146 rillig #else
541 1.179 rillig #define brace_level_debug(level) do { } while (false)
542 1.146 rillig #endif
543 1.146 rillig
544 1.179 rillig /* Return the type of the sub-object that is currently being initialized. */
545 1.179 rillig static const type_t *
546 1.221 rillig brace_level_sub_type(const brace_level *bl, bool is_string)
547 1.172 rillig {
548 1.147 rillig
549 1.218 rillig if (bl->bl_designation.dn_len > 0)
550 1.225 rillig return designation_type(&bl->bl_designation, bl->bl_type);
551 1.174 rillig
552 1.179 rillig switch (bl->bl_type->t_tspec) {
553 1.179 rillig case STRUCT:
554 1.179 rillig case UNION:
555 1.216 rillig if (bl->bl_member == NULL) {
556 1.216 rillig /* too many struct/union initializers */
557 1.216 rillig error(172);
558 1.216 rillig return NULL;
559 1.216 rillig }
560 1.216 rillig
561 1.216 rillig lint_assert(!is_unnamed(bl->bl_member));
562 1.216 rillig return sym_type(bl->bl_member);
563 1.216 rillig
564 1.179 rillig case ARRAY:
565 1.216 rillig if (!bl->bl_confused && !bl->bl_type->t_incomplete_array &&
566 1.216 rillig bl->bl_subscript >= (size_t)bl->bl_type->t_dim) {
567 1.216 rillig /* too many array initializers, expected %d */
568 1.216 rillig error(173, bl->bl_type->t_dim);
569 1.216 rillig }
570 1.216 rillig
571 1.216 rillig if (is_string && bl->bl_subscript == 0 &&
572 1.216 rillig bl->bl_type->t_subt->t_tspec != ARRAY)
573 1.216 rillig return bl->bl_type;
574 1.216 rillig return bl->bl_type->t_subt;
575 1.216 rillig
576 1.179 rillig default:
577 1.216 rillig if (bl->bl_scalar_done) {
578 1.216 rillig /* too many initializers */
579 1.216 rillig error(174);
580 1.216 rillig }
581 1.216 rillig
582 1.216 rillig return bl->bl_type;
583 1.147 rillig }
584 1.147 rillig }
585 1.147 rillig
586 1.192 rillig /* C99 6.7.8p17 */
587 1.179 rillig static void
588 1.221 rillig brace_level_apply_designation(brace_level *bl)
589 1.155 rillig {
590 1.221 rillig const designator *dr;
591 1.179 rillig
592 1.218 rillig if (bl->bl_designation.dn_len == 0)
593 1.179 rillig return;
594 1.218 rillig dr = &bl->bl_designation.dn_items[0];
595 1.174 rillig
596 1.179 rillig designation_debug(&bl->bl_designation);
597 1.155 rillig
598 1.179 rillig switch (bl->bl_type->t_tspec) {
599 1.179 rillig case STRUCT:
600 1.179 rillig case UNION:
601 1.179 rillig if (dr->dr_name == NULL)
602 1.179 rillig return; /* error, silently ignored */
603 1.192 rillig bl->bl_member = look_up_member(bl->bl_type, dr->dr_name);
604 1.179 rillig break;
605 1.179 rillig case ARRAY:
606 1.179 rillig if (dr->dr_name != NULL)
607 1.179 rillig return; /* error, silently ignored */
608 1.192 rillig bl->bl_subscript = dr->dr_subscript;
609 1.179 rillig break;
610 1.179 rillig default:
611 1.179 rillig break; /* error, silently ignored */
612 1.155 rillig }
613 1.155 rillig }
614 1.155 rillig
615 1.158 rillig /*
616 1.179 rillig * After initializing a sub-object, advance to the next sub-object.
617 1.158 rillig *
618 1.179 rillig * C99 6.7.8p17
619 1.158 rillig */
620 1.158 rillig static void
621 1.221 rillig brace_level_advance(brace_level *bl, size_t *max_subscript)
622 1.158 rillig {
623 1.158 rillig
624 1.179 rillig switch (bl->bl_type->t_tspec) {
625 1.179 rillig case STRUCT:
626 1.192 rillig lint_assert(bl->bl_member != NULL);
627 1.192 rillig bl->bl_member = skip_unnamed(bl->bl_member->s_next);
628 1.179 rillig break;
629 1.179 rillig case UNION:
630 1.192 rillig bl->bl_member = NULL;
631 1.179 rillig break;
632 1.179 rillig case ARRAY:
633 1.192 rillig bl->bl_subscript++;
634 1.219 rillig if (bl->bl_subscript > *max_subscript)
635 1.219 rillig *max_subscript = bl->bl_subscript;
636 1.179 rillig break;
637 1.179 rillig default:
638 1.179 rillig bl->bl_scalar_done = true;
639 1.179 rillig break;
640 1.158 rillig }
641 1.160 rillig }
642 1.158 rillig
643 1.146 rillig
644 1.221 rillig static initialization *
645 1.221 rillig initialization_new(sym_t *sym, initialization *enclosing)
646 1.146 rillig {
647 1.221 rillig initialization *in;
648 1.146 rillig
649 1.179 rillig in = xcalloc(1, sizeof(*in));
650 1.176 rillig in->in_sym = sym;
651 1.217 rillig in->in_enclosing = enclosing;
652 1.146 rillig
653 1.146 rillig return in;
654 1.146 rillig }
655 1.74 rillig
656 1.146 rillig static void
657 1.221 rillig initialization_free(initialization *in)
658 1.146 rillig {
659 1.221 rillig brace_level *bl, *next;
660 1.146 rillig
661 1.176 rillig for (bl = in->in_brace_level; bl != NULL; bl = next) {
662 1.176 rillig next = bl->bl_enclosing;
663 1.176 rillig brace_level_free(bl);
664 1.146 rillig }
665 1.146 rillig
666 1.146 rillig free(in);
667 1.146 rillig }
668 1.146 rillig
669 1.146 rillig #ifdef DEBUG
670 1.73 rillig static void
671 1.221 rillig initialization_debug(const initialization *in)
672 1.73 rillig {
673 1.179 rillig size_t i;
674 1.221 rillig const brace_level *bl;
675 1.179 rillig
676 1.176 rillig if (in->in_brace_level == NULL) {
677 1.179 rillig debug_step("no brace level");
678 1.73 rillig return;
679 1.73 rillig }
680 1.73 rillig
681 1.179 rillig i = 0;
682 1.179 rillig for (bl = in->in_brace_level; bl != NULL; bl = bl->bl_enclosing) {
683 1.226 rillig debug_print_indent();
684 1.139 rillig debug_printf("brace level %zu: ", i);
685 1.178 rillig brace_level_debug(bl);
686 1.73 rillig i++;
687 1.73 rillig }
688 1.73 rillig }
689 1.146 rillig #else
690 1.146 rillig #define initialization_debug(in) do { } while (false)
691 1.146 rillig #endif
692 1.146 rillig
693 1.1 cgd /*
694 1.179 rillig * Return the type of the object or sub-object that is currently being
695 1.179 rillig * initialized.
696 1.1 cgd */
697 1.179 rillig static const type_t *
698 1.221 rillig initialization_sub_type(initialization *in, bool is_string)
699 1.179 rillig {
700 1.179 rillig const type_t *tp;
701 1.179 rillig
702 1.179 rillig tp = in->in_brace_level != NULL
703 1.194 rillig ? brace_level_sub_type(in->in_brace_level, is_string)
704 1.179 rillig : in->in_sym->s_type;
705 1.179 rillig if (tp == NULL)
706 1.179 rillig in->in_err = true;
707 1.179 rillig return tp;
708 1.179 rillig }
709 1.179 rillig
710 1.158 rillig static void
711 1.225 rillig initialization_lbrace(initialization *in)
712 1.1 cgd {
713 1.179 rillig const type_t *tp;
714 1.179 rillig
715 1.176 rillig if (in->in_err)
716 1.1 cgd return;
717 1.1 cgd
718 1.70 rillig debug_enter();
719 1.38 rillig
720 1.194 rillig tp = initialization_sub_type(in, false);
721 1.179 rillig if (tp == NULL) {
722 1.179 rillig in->in_err = true;
723 1.179 rillig goto done;
724 1.179 rillig }
725 1.1 cgd
726 1.179 rillig if (tflag && in->in_brace_level == NULL)
727 1.197 rillig check_trad_no_auto_aggregate(in->in_sym);
728 1.70 rillig
729 1.179 rillig if (tflag && tp->t_tspec == UNION) {
730 1.179 rillig /* initialization of union is illegal in traditional C */
731 1.179 rillig warning(238);
732 1.179 rillig }
733 1.1 cgd
734 1.179 rillig if (tp->t_tspec == STRUCT && tp->t_str->sou_incomplete) {
735 1.180 rillig /* initialization of incomplete type '%s' */
736 1.180 rillig error(175, type_name(tp));
737 1.179 rillig in->in_err = true;
738 1.179 rillig goto done;
739 1.104 rillig }
740 1.104 rillig
741 1.179 rillig if (in->in_brace_level != NULL)
742 1.179 rillig brace_level_apply_designation(in->in_brace_level);
743 1.1 cgd
744 1.179 rillig in->in_brace_level = brace_level_new(tp, in->in_brace_level);
745 1.68 rillig
746 1.179 rillig done:
747 1.153 rillig initialization_debug(in);
748 1.68 rillig debug_leave();
749 1.1 cgd }
750 1.1 cgd
751 1.179 rillig /* C99 6.7.8p22 */
752 1.1 cgd static void
753 1.221 rillig initialization_set_size_of_unknown_array(initialization *in)
754 1.1 cgd {
755 1.213 rillig size_t dim;
756 1.158 rillig
757 1.213 rillig if (!(in->in_sym->s_type->t_incomplete_array &&
758 1.213 rillig in->in_brace_level->bl_enclosing == NULL))
759 1.213 rillig return;
760 1.213 rillig
761 1.219 rillig dim = in->in_max_subscript;
762 1.214 rillig if (dim == 0 && (in->in_err || in->in_brace_level->bl_confused))
763 1.213 rillig dim = 1; /* prevent "empty array declaration: %s" */
764 1.213 rillig
765 1.213 rillig update_type_of_array_of_unknown_size(in->in_sym, dim);
766 1.158 rillig }
767 1.158 rillig
768 1.158 rillig static void
769 1.225 rillig initialization_rbrace(initialization *in)
770 1.158 rillig {
771 1.222 rillig brace_level *inner_bl, *outer_bl;
772 1.158 rillig
773 1.158 rillig debug_enter();
774 1.158 rillig
775 1.179 rillig initialization_set_size_of_unknown_array(in);
776 1.213 rillig if (in->in_err)
777 1.213 rillig goto done;
778 1.179 rillig
779 1.222 rillig inner_bl = in->in_brace_level;
780 1.222 rillig outer_bl = inner_bl->bl_enclosing;
781 1.222 rillig in->in_brace_level = outer_bl;
782 1.222 rillig brace_level_free(inner_bl);
783 1.222 rillig
784 1.222 rillig if (outer_bl != NULL) {
785 1.222 rillig brace_level_advance(outer_bl, &in->in_max_subscript);
786 1.222 rillig designation_reset(&outer_bl->bl_designation);
787 1.222 rillig }
788 1.68 rillig
789 1.213 rillig done:
790 1.153 rillig initialization_debug(in);
791 1.68 rillig debug_leave();
792 1.37 rillig }
793 1.37 rillig
794 1.37 rillig static void
795 1.221 rillig initialization_add_designator(initialization *in,
796 1.179 rillig const char *name, size_t subscript)
797 1.164 rillig {
798 1.164 rillig
799 1.176 rillig if (in->in_err)
800 1.1 cgd return;
801 1.1 cgd
802 1.179 rillig lint_assert(in->in_brace_level != NULL);
803 1.179 rillig designation_add(&in->in_brace_level->bl_designation, name, subscript);
804 1.1 cgd }
805 1.1 cgd
806 1.114 rillig /*
807 1.208 rillig * Initialize an object with automatic storage duration that has an
808 1.208 rillig * initializer expression without braces.
809 1.114 rillig */
810 1.179 rillig static bool
811 1.221 rillig initialization_expr_using_op(initialization *in, tnode_t *rn)
812 1.116 rillig {
813 1.179 rillig tnode_t *ln, *tn;
814 1.179 rillig
815 1.179 rillig if (!has_automatic_storage_duration(in->in_sym))
816 1.179 rillig return false;
817 1.179 rillig if (in->in_brace_level != NULL)
818 1.179 rillig return false;
819 1.179 rillig if (in->in_sym->s_type->t_tspec == ARRAY)
820 1.179 rillig return false;
821 1.1 cgd
822 1.208 rillig debug_step("handing over to INIT");
823 1.55 rillig
824 1.211 rillig ln = build_name(in->in_sym, false);
825 1.204 rillig ln->tn_type = expr_unqualified_type(ln->tn_type);
826 1.1 cgd
827 1.210 rillig tn = build_binary(ln, INIT, false /* XXX */, rn);
828 1.179 rillig expr(tn, false, false, false, false);
829 1.1 cgd
830 1.179 rillig return true;
831 1.1 cgd }
832 1.1 cgd
833 1.82 rillig /* Initialize a character array or wchar_t array with a string literal. */
834 1.62 rillig static bool
835 1.225 rillig initialization_init_array_from_string(initialization *in, tnode_t *tn)
836 1.1 cgd {
837 1.221 rillig brace_level *bl;
838 1.179 rillig const type_t *tp;
839 1.1 cgd strg_t *strg;
840 1.1 cgd
841 1.1 cgd if (tn->tn_op != STRING)
842 1.63 rillig return false;
843 1.1 cgd
844 1.178 rillig bl = in->in_brace_level;
845 1.194 rillig tp = initialization_sub_type(in, true);
846 1.47 rillig strg = tn->tn_string;
847 1.1 cgd
848 1.213 rillig if (!is_character_array(tp, strg->st_tspec)) {
849 1.213 rillig /* TODO: recursively try first member or [0] */
850 1.213 rillig if (is_struct_or_union(tp->t_tspec) ||
851 1.213 rillig (tp->t_tspec == ARRAY &&
852 1.213 rillig is_struct_or_union(tp->t_subt->t_tspec)))
853 1.213 rillig in->in_err = true;
854 1.179 rillig return false;
855 1.213 rillig }
856 1.213 rillig
857 1.192 rillig if (bl != NULL && tp->t_tspec != ARRAY && bl->bl_subscript != 0)
858 1.179 rillig return false;
859 1.119 rillig
860 1.194 rillig if (!tp->t_incomplete_array && tp->t_dim < (int)strg->st_len) {
861 1.179 rillig /* non-null byte ignored in string initializer */
862 1.179 rillig warning(187);
863 1.179 rillig }
864 1.119 rillig
865 1.179 rillig if (tp == in->in_sym->s_type && tp->t_incomplete_array) {
866 1.179 rillig if (bl != NULL) {
867 1.194 rillig bl->bl_subscript = strg->st_len;
868 1.194 rillig /* see brace_level_advance for the +1 */
869 1.179 rillig /* see initialization_set_size_of_unknown_array */
870 1.179 rillig } else
871 1.179 rillig update_type_of_array_of_unknown_size(in->in_sym,
872 1.179 rillig strg->st_len + 1);
873 1.1 cgd }
874 1.1 cgd
875 1.63 rillig return true;
876 1.1 cgd }
877 1.158 rillig
878 1.158 rillig /*
879 1.179 rillig * Initialize a single sub-object as part of the currently ongoing
880 1.179 rillig * initialization.
881 1.158 rillig */
882 1.179 rillig static void
883 1.221 rillig initialization_expr(initialization *in, tnode_t *tn)
884 1.158 rillig {
885 1.221 rillig brace_level *bl;
886 1.179 rillig const type_t *tp;
887 1.158 rillig
888 1.179 rillig if (in->in_err)
889 1.179 rillig return;
890 1.158 rillig
891 1.184 rillig bl = in->in_brace_level;
892 1.185 rillig if (bl != NULL && bl->bl_confused)
893 1.179 rillig return;
894 1.158 rillig
895 1.179 rillig debug_enter();
896 1.158 rillig
897 1.179 rillig if (tn == NULL)
898 1.179 rillig goto advance;
899 1.208 rillig if (initialization_expr_using_op(in, tn))
900 1.179 rillig goto done;
901 1.225 rillig if (initialization_init_array_from_string(in, tn))
902 1.179 rillig goto advance;
903 1.213 rillig if (in->in_err)
904 1.213 rillig goto done;
905 1.158 rillig
906 1.184 rillig if (bl != NULL)
907 1.184 rillig brace_level_apply_designation(bl);
908 1.194 rillig tp = initialization_sub_type(in, false);
909 1.179 rillig if (tp == NULL)
910 1.179 rillig goto done;
911 1.158 rillig
912 1.184 rillig if (bl == NULL && !is_scalar(tp->t_tspec)) {
913 1.158 rillig /* {}-enclosed initializer required */
914 1.158 rillig error(181);
915 1.179 rillig goto done;
916 1.158 rillig }
917 1.158 rillig
918 1.179 rillig /*
919 1.179 rillig * Hack to accept initializations with omitted braces, see
920 1.179 rillig * c99_6_7_8_p28_example5 in test d_c99_init.c. Since both GCC and
921 1.179 rillig * Clang already warn about this at level -Wall, there is no point
922 1.185 rillig * in repeating the same check in lint. If needed, support for these
923 1.185 rillig * edge cases could be added, but that would increase the complexity.
924 1.179 rillig */
925 1.215 rillig if ((is_scalar(tn->tn_type->t_tspec) ||
926 1.215 rillig tn->tn_type->t_tspec == FUNC) &&
927 1.185 rillig (tp->t_tspec == ARRAY || is_struct_or_union(tp->t_tspec)) &&
928 1.184 rillig bl != NULL) {
929 1.185 rillig bl->bl_confused = true;
930 1.179 rillig goto done;
931 1.158 rillig }
932 1.158 rillig
933 1.206 rillig debug_step("expecting '%s', expression has '%s'",
934 1.179 rillig type_name(tp), type_name(tn->tn_type));
935 1.179 rillig check_init_expr(tp, in->in_sym, tn);
936 1.179 rillig
937 1.179 rillig advance:
938 1.184 rillig if (bl != NULL)
939 1.219 rillig brace_level_advance(bl, &in->in_max_subscript);
940 1.179 rillig done:
941 1.184 rillig if (bl != NULL)
942 1.184 rillig designation_reset(&bl->bl_designation);
943 1.184 rillig
944 1.158 rillig initialization_debug(in);
945 1.158 rillig debug_leave();
946 1.158 rillig }
947 1.158 rillig
948 1.158 rillig
949 1.221 rillig static initialization *init;
950 1.158 rillig
951 1.158 rillig
952 1.221 rillig static initialization *
953 1.158 rillig current_init(void)
954 1.158 rillig {
955 1.175 rillig
956 1.158 rillig lint_assert(init != NULL);
957 1.158 rillig return init;
958 1.158 rillig }
959 1.158 rillig
960 1.158 rillig sym_t **
961 1.158 rillig current_initsym(void)
962 1.158 rillig {
963 1.175 rillig
964 1.176 rillig return ¤t_init()->in_sym;
965 1.158 rillig }
966 1.158 rillig
967 1.158 rillig void
968 1.158 rillig begin_initialization(sym_t *sym)
969 1.158 rillig {
970 1.158 rillig
971 1.206 rillig debug_step("begin initialization of '%s'", type_name(sym->s_type));
972 1.205 rillig debug_indent_inc();
973 1.179 rillig
974 1.217 rillig init = initialization_new(sym, init);
975 1.158 rillig }
976 1.158 rillig
977 1.158 rillig void
978 1.158 rillig end_initialization(void)
979 1.158 rillig {
980 1.221 rillig initialization *in;
981 1.158 rillig
982 1.158 rillig in = init;
983 1.179 rillig init = in->in_enclosing;
984 1.158 rillig initialization_free(in);
985 1.179 rillig
986 1.205 rillig debug_indent_dec();
987 1.206 rillig debug_step("end initialization");
988 1.158 rillig }
989 1.158 rillig
990 1.158 rillig void
991 1.223 rillig begin_designation(void)
992 1.223 rillig {
993 1.223 rillig brace_level *bl;
994 1.223 rillig
995 1.223 rillig bl = current_init()->in_brace_level;
996 1.223 rillig lint_assert(bl != NULL);
997 1.223 rillig designation_reset(&bl->bl_designation);
998 1.223 rillig }
999 1.223 rillig
1000 1.223 rillig void
1001 1.158 rillig add_designator_member(sbuf_t *sb)
1002 1.158 rillig {
1003 1.175 rillig
1004 1.179 rillig initialization_add_designator(current_init(), sb->sb_name, 0);
1005 1.158 rillig }
1006 1.158 rillig
1007 1.158 rillig void
1008 1.158 rillig add_designator_subscript(range_t range)
1009 1.158 rillig {
1010 1.175 rillig
1011 1.179 rillig initialization_add_designator(current_init(), NULL, range.hi);
1012 1.158 rillig }
1013 1.158 rillig
1014 1.158 rillig void
1015 1.158 rillig init_lbrace(void)
1016 1.158 rillig {
1017 1.175 rillig
1018 1.225 rillig initialization_lbrace(current_init());
1019 1.158 rillig }
1020 1.158 rillig
1021 1.158 rillig void
1022 1.179 rillig init_expr(tnode_t *tn)
1023 1.158 rillig {
1024 1.175 rillig
1025 1.158 rillig initialization_expr(current_init(), tn);
1026 1.158 rillig }
1027 1.158 rillig
1028 1.158 rillig void
1029 1.158 rillig init_rbrace(void)
1030 1.158 rillig {
1031 1.175 rillig
1032 1.225 rillig initialization_rbrace(current_init());
1033 1.158 rillig }
1034