init.c revision 1.257 1 1.257 rillig /* $NetBSD: init.c,v 1.257 2024/02/01 18:37:06 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.246 rillig * This product includes software developed by Jochen Pohl for
19 1.1 cgd * The NetBSD Project.
20 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
21 1.1 cgd * derived from this software without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.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.235 rillig #if defined(__RCSID)
41 1.257 rillig __RCSID("$NetBSD: init.c,v 1.257 2024/02/01 18:37:06 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 * int array_of_unknown_size[] = { 111, 222, 333 };
56 1.119 rillig * struct { int x, y; } point = { .y = 4, .x = 3 };
57 1.93 rillig *
58 1.198 rillig * During an initialization, the grammar parser calls these functions:
59 1.93 rillig *
60 1.119 rillig * begin_initialization
61 1.119 rillig * init_lbrace for each '{'
62 1.157 rillig * add_designator_member for each '.member' before '='
63 1.157 rillig * add_designator_subscript for each '[123]' before '='
64 1.179 rillig * init_expr for each expression
65 1.119 rillig * init_rbrace for each '}'
66 1.119 rillig * end_initialization
67 1.93 rillig *
68 1.139 rillig * Each '{' begins a new brace level, each '}' ends the current brace level.
69 1.198 rillig * Each brace level has an associated "current object", which is the starting
70 1.198 rillig * point for resolving the optional designations such as '.member[3]'.
71 1.93 rillig *
72 1.93 rillig * See also:
73 1.93 rillig * C99 6.7.8 "Initialization"
74 1.220 rillig * C11 6.7.9 "Initialization"
75 1.93 rillig * d_c99_init.c for more examples
76 1.93 rillig */
77 1.93 rillig
78 1.229 rillig
79 1.179 rillig /*
80 1.229 rillig * Everything that happens between a '{' and the corresponding '}', as part
81 1.229 rillig * of an initialization.
82 1.229 rillig *
83 1.253 rillig * Each brace level has a "current object". For the outermost brace level,
84 1.229 rillig * it is the same as the object to be initialized. Each nested '{' begins a
85 1.229 rillig * nested brace level, for the sub-object pointed to by the designator of the
86 1.229 rillig * outer brace level.
87 1.179 rillig *
88 1.220 rillig * C99 6.7.8p17
89 1.179 rillig */
90 1.221 rillig typedef struct brace_level {
91 1.220 rillig /* The type of the "current object". */
92 1.220 rillig const type_t *bl_type;
93 1.220 rillig
94 1.201 rillig /*
95 1.229 rillig * The path from the "current object" to the sub-object that is
96 1.220 rillig * initialized by the next expression.
97 1.220 rillig *
98 1.252 rillig * Initially, the designation is empty. Before handling an expression,
99 1.252 rillig * the designation is updated to point to the corresponding sub-object
100 1.252 rillig * to be initialized. After handling an expression, the designation is
101 1.252 rillig * marked as done. It is later advanced as necessary.
102 1.201 rillig */
103 1.221 rillig designation bl_designation;
104 1.192 rillig
105 1.179 rillig struct brace_level *bl_enclosing;
106 1.221 rillig } brace_level;
107 1.179 rillig
108 1.198 rillig /*
109 1.198 rillig * An ongoing initialization.
110 1.198 rillig *
111 1.229 rillig * In most cases there is only ever a single initialization at a time. See
112 1.229 rillig * pointer_to_compound_literal in msg_171.c for a real-life counterexample.
113 1.198 rillig */
114 1.221 rillig typedef struct initialization {
115 1.193 rillig /* The symbol that is to be initialized. */
116 1.193 rillig sym_t *in_sym;
117 1.193 rillig
118 1.193 rillig /* The innermost brace level. */
119 1.221 rillig brace_level *in_brace_level;
120 1.193 rillig
121 1.110 rillig /*
122 1.229 rillig * The maximum subscript that has ever been seen for an array of
123 1.219 rillig * unknown size, which can only occur at the outermost brace level.
124 1.219 rillig */
125 1.219 rillig size_t in_max_subscript;
126 1.219 rillig
127 1.219 rillig /*
128 1.252 rillig * Is set when a structural error occurred in the initialization. If
129 1.252 rillig * set, the rest of the initialization is still parsed, but the
130 1.229 rillig * initialization assignments are not checked.
131 1.110 rillig */
132 1.176 rillig bool in_err;
133 1.110 rillig
134 1.179 rillig struct initialization *in_enclosing;
135 1.221 rillig } initialization;
136 1.1 cgd
137 1.145 rillig
138 1.175 rillig static void *
139 1.175 rillig unconst_cast(const void *p)
140 1.175 rillig {
141 1.175 rillig void *r;
142 1.175 rillig
143 1.190 rillig memcpy(&r, &p, sizeof(r));
144 1.175 rillig return r;
145 1.175 rillig }
146 1.175 rillig
147 1.177 rillig static bool
148 1.177 rillig has_automatic_storage_duration(const sym_t *sym)
149 1.177 rillig {
150 1.177 rillig
151 1.177 rillig return sym->s_scl == AUTO || sym->s_scl == REG;
152 1.177 rillig }
153 1.177 rillig
154 1.229 rillig /*
155 1.229 rillig * Test whether rn is a string literal that can initialize ltp.
156 1.229 rillig *
157 1.229 rillig * See also:
158 1.229 rillig * C99 6.7.8p14 for plain character strings
159 1.229 rillig * C99 6.7.8p15 for wide character strings
160 1.229 rillig */
161 1.177 rillig static bool
162 1.229 rillig can_init_character_array(const type_t *ltp, const tnode_t *rn)
163 1.177 rillig {
164 1.177 rillig
165 1.229 rillig if (!(ltp != NULL && ltp->t_tspec == ARRAY && rn->tn_op == STRING))
166 1.177 rillig return false;
167 1.177 rillig
168 1.239 rillig tspec_t lst = ltp->t_subt->t_tspec;
169 1.239 rillig tspec_t rst = rn->tn_type->t_subt->t_tspec;
170 1.177 rillig
171 1.229 rillig return rst == CHAR
172 1.229 rillig ? lst == CHAR || lst == UCHAR || lst == SCHAR
173 1.245 rillig : lst == WCHAR_TSPEC;
174 1.177 rillig }
175 1.177 rillig
176 1.243 rillig /*
177 1.243 rillig * C11 6.7.9p9 seems to say that all unnamed members are skipped. C11 6.7.2.1p8
178 1.243 rillig * suggests an exception to that rule, and together with C11 6.7.2.1p13, it
179 1.243 rillig * says that the members from an anonymous struct/union member are "considered
180 1.243 rillig * to be members of the containing structure or union", thereby preventing that
181 1.243 rillig * the containing structure or union has only unnamed members.
182 1.243 rillig */
183 1.179 rillig static const sym_t *
184 1.179 rillig skip_unnamed(const sym_t *m)
185 1.179 rillig {
186 1.179 rillig
187 1.243 rillig while (m != NULL && m->s_name == unnamed
188 1.243 rillig && !is_struct_or_union(m->s_type->t_tspec))
189 1.179 rillig m = m->s_next;
190 1.179 rillig return m;
191 1.179 rillig }
192 1.179 rillig
193 1.177 rillig static const sym_t *
194 1.179 rillig first_named_member(const type_t *tp)
195 1.177 rillig {
196 1.177 rillig
197 1.179 rillig lint_assert(is_struct_or_union(tp->t_tspec));
198 1.241 rillig return skip_unnamed(tp->t_sou->sou_first_member);
199 1.179 rillig }
200 1.179 rillig
201 1.198 rillig /*
202 1.198 rillig * C99 6.7.8p22 says that the type of an array of unknown size becomes known
203 1.198 rillig * at the end of its initializer list.
204 1.198 rillig */
205 1.179 rillig static void
206 1.179 rillig update_type_of_array_of_unknown_size(sym_t *sym, size_t size)
207 1.179 rillig {
208 1.179 rillig
209 1.239 rillig type_t *tp = block_dup_type(sym->s_type);
210 1.179 rillig tp->t_dim = (int)size;
211 1.179 rillig tp->t_incomplete_array = false;
212 1.179 rillig sym->s_type = tp;
213 1.229 rillig debug_step("completed array type is '%s'", type_name(sym->s_type));
214 1.242 rillig outsym(sym, sym->s_scl, sym->s_def);
215 1.179 rillig }
216 1.179 rillig
217 1.167 rillig
218 1.158 rillig /* In traditional C, bit-fields can be initialized only by integer constants. */
219 1.158 rillig static void
220 1.158 rillig check_bit_field_init(const tnode_t *ln, tspec_t lt, tspec_t rt)
221 1.158 rillig {
222 1.175 rillig
223 1.234 rillig if (!allow_c90 &&
224 1.158 rillig is_integer(lt) &&
225 1.158 rillig ln->tn_type->t_bitfield &&
226 1.158 rillig !is_integer(rt)) {
227 1.158 rillig /* bit-field initialization is illegal in traditional C */
228 1.158 rillig warning(186);
229 1.158 rillig }
230 1.158 rillig }
231 1.158 rillig
232 1.158 rillig static void
233 1.177 rillig check_non_constant_initializer(const tnode_t *tn, const sym_t *sym)
234 1.158 rillig {
235 1.175 rillig
236 1.158 rillig if (tn == NULL || tn->tn_op == CON)
237 1.158 rillig return;
238 1.158 rillig
239 1.239 rillig const sym_t *unused_sym;
240 1.239 rillig ptrdiff_t unused_offs;
241 1.177 rillig if (constant_addr(tn, &unused_sym, &unused_offs))
242 1.158 rillig return;
243 1.158 rillig
244 1.177 rillig if (has_automatic_storage_duration(sym)) {
245 1.158 rillig /* non-constant initializer */
246 1.158 rillig c99ism(177);
247 1.158 rillig } else {
248 1.158 rillig /* non-constant initializer */
249 1.158 rillig error(177);
250 1.158 rillig }
251 1.158 rillig }
252 1.158 rillig
253 1.158 rillig static void
254 1.197 rillig check_trad_no_auto_aggregate(const sym_t *sym)
255 1.179 rillig {
256 1.179 rillig
257 1.197 rillig if (has_automatic_storage_duration(sym) &&
258 1.179 rillig !is_scalar(sym->s_type->t_tspec)) {
259 1.209 rillig /* no automatic aggregate initialization in traditional C */
260 1.179 rillig warning(188);
261 1.179 rillig }
262 1.179 rillig }
263 1.179 rillig
264 1.179 rillig static void
265 1.224 rillig check_init_expr(const type_t *ltp, sym_t *lsym, tnode_t *rn)
266 1.158 rillig {
267 1.158 rillig
268 1.239 rillig type_t *lutp = expr_unqualified_type(ltp);
269 1.200 rillig
270 1.158 rillig /* Create a temporary node for the left side. */
271 1.247 rillig tnode_t *ln = expr_zero_alloc(sizeof(*ln), "tnode");
272 1.158 rillig ln->tn_op = NAME;
273 1.224 rillig ln->tn_type = lutp;
274 1.158 rillig ln->tn_lvalue = true;
275 1.224 rillig ln->tn_sym = lsym;
276 1.158 rillig
277 1.224 rillig rn = cconv(rn);
278 1.158 rillig
279 1.239 rillig tspec_t lt = ln->tn_type->t_tspec;
280 1.239 rillig tspec_t rt = rn->tn_type->t_tspec;
281 1.158 rillig
282 1.206 rillig debug_step("typeok '%s', '%s'",
283 1.224 rillig type_name(ln->tn_type), type_name(rn->tn_type));
284 1.224 rillig if (!typeok(INIT, 0, ln, rn))
285 1.158 rillig return;
286 1.158 rillig
287 1.158 rillig /*
288 1.252 rillig * Preserve the tree memory. This is necessary because otherwise expr()
289 1.252 rillig * would free it.
290 1.158 rillig */
291 1.238 rillig memory_pool saved_mem = expr_save_memory();
292 1.224 rillig expr(rn, true, false, true, false);
293 1.238 rillig expr_restore_memory(saved_mem);
294 1.158 rillig
295 1.158 rillig check_bit_field_init(ln, lt, rt);
296 1.158 rillig
297 1.158 rillig /*
298 1.158 rillig * XXX: Is it correct to do this conversion _after_ the typeok above?
299 1.158 rillig */
300 1.224 rillig if (lt != rt || (ltp->t_bitfield && rn->tn_op == CON))
301 1.224 rillig rn = convert(INIT, 0, unconst_cast(ltp), rn);
302 1.158 rillig
303 1.224 rillig check_non_constant_initializer(rn, lsym);
304 1.158 rillig }
305 1.158 rillig
306 1.158 rillig
307 1.179 rillig static const type_t *
308 1.225 rillig designator_type(const designator *dr, const type_t *tp)
309 1.179 rillig {
310 1.239 rillig
311 1.179 rillig switch (tp->t_tspec) {
312 1.179 rillig case STRUCT:
313 1.179 rillig case UNION:
314 1.255 rillig if (dr->dr_kind != DK_MEMBER) {
315 1.229 rillig const sym_t *fmem = first_named_member(tp);
316 1.179 rillig /* syntax error '%s' */
317 1.179 rillig error(249, "designator '[...]' is only for arrays");
318 1.229 rillig return fmem != NULL ? fmem->s_type : NULL;
319 1.179 rillig }
320 1.179 rillig
321 1.229 rillig lint_assert(dr->dr_member != NULL);
322 1.229 rillig return dr->dr_member->s_type;
323 1.179 rillig case ARRAY:
324 1.255 rillig if (dr->dr_kind != DK_SUBSCRIPT) {
325 1.179 rillig /* syntax error '%s' */
326 1.179 rillig error(249,
327 1.181 rillig "designator '.member' is only for struct/union");
328 1.179 rillig }
329 1.229 rillig if (!tp->t_incomplete_array)
330 1.229 rillig lint_assert(dr->dr_subscript < (size_t)tp->t_dim);
331 1.179 rillig return tp->t_subt;
332 1.179 rillig default:
333 1.229 rillig if (dr->dr_kind != DK_SCALAR) {
334 1.229 rillig /* syntax error '%s' */
335 1.229 rillig error(249, "scalar type cannot use designator");
336 1.229 rillig }
337 1.179 rillig return tp;
338 1.179 rillig }
339 1.179 rillig }
340 1.179 rillig
341 1.179 rillig
342 1.159 rillig #ifdef DEBUG
343 1.159 rillig static void
344 1.229 rillig designator_debug(const designator *dr)
345 1.229 rillig {
346 1.229 rillig
347 1.255 rillig if (dr->dr_kind == DK_MEMBER) {
348 1.229 rillig lint_assert(dr->dr_subscript == 0);
349 1.229 rillig debug_printf(".%s",
350 1.229 rillig dr->dr_member != NULL
351 1.229 rillig ? dr->dr_member->s_name
352 1.229 rillig : "<end>");
353 1.255 rillig } else if (dr->dr_kind == DK_SUBSCRIPT) {
354 1.229 rillig lint_assert(dr->dr_member == NULL);
355 1.229 rillig debug_printf("[%zu]", dr->dr_subscript);
356 1.229 rillig } else {
357 1.229 rillig lint_assert(dr->dr_member == NULL);
358 1.229 rillig lint_assert(dr->dr_subscript == 0);
359 1.229 rillig debug_printf("<scalar>");
360 1.229 rillig }
361 1.229 rillig
362 1.229 rillig if (dr->dr_done)
363 1.229 rillig debug_printf(" (done)");
364 1.229 rillig }
365 1.229 rillig
366 1.229 rillig static void
367 1.221 rillig designation_debug(const designation *dn)
368 1.159 rillig {
369 1.159 rillig
370 1.229 rillig if (dn->dn_len == 0) {
371 1.229 rillig debug_step("designation: (empty)");
372 1.159 rillig return;
373 1.229 rillig }
374 1.159 rillig
375 1.159 rillig debug_printf("designation: ");
376 1.239 rillig for (size_t i = 0; i < dn->dn_len; i++)
377 1.229 rillig designator_debug(dn->dn_items + i);
378 1.159 rillig debug_printf("\n");
379 1.159 rillig }
380 1.159 rillig #else
381 1.159 rillig #define designation_debug(dn) do { } while (false)
382 1.159 rillig #endif
383 1.159 rillig
384 1.229 rillig static designator *
385 1.229 rillig designation_last(designation *dn)
386 1.229 rillig {
387 1.229 rillig
388 1.229 rillig lint_assert(dn->dn_len > 0);
389 1.229 rillig return &dn->dn_items[dn->dn_len - 1];
390 1.229 rillig }
391 1.229 rillig
392 1.254 rillig void
393 1.229 rillig designation_push(designation *dn, designator_kind kind,
394 1.229 rillig const sym_t *member, size_t subscript)
395 1.159 rillig {
396 1.179 rillig
397 1.218 rillig if (dn->dn_len == dn->dn_cap) {
398 1.218 rillig dn->dn_cap += 4;
399 1.218 rillig dn->dn_items = xrealloc(dn->dn_items,
400 1.218 rillig dn->dn_cap * sizeof(dn->dn_items[0]));
401 1.218 rillig }
402 1.159 rillig
403 1.239 rillig designator *dr = &dn->dn_items[dn->dn_len++];
404 1.229 rillig dr->dr_kind = kind;
405 1.229 rillig dr->dr_member = member;
406 1.229 rillig dr->dr_subscript = subscript;
407 1.229 rillig dr->dr_done = false;
408 1.229 rillig designation_debug(dn);
409 1.229 rillig }
410 1.229 rillig
411 1.229 rillig /*
412 1.229 rillig * Extend the designation as appropriate for the given type.
413 1.229 rillig *
414 1.229 rillig * C11 6.7.9p17
415 1.229 rillig */
416 1.229 rillig static bool
417 1.229 rillig designation_descend(designation *dn, const type_t *tp)
418 1.229 rillig {
419 1.229 rillig
420 1.229 rillig if (is_struct_or_union(tp->t_tspec)) {
421 1.229 rillig const sym_t *member = first_named_member(tp);
422 1.229 rillig if (member == NULL)
423 1.229 rillig return false;
424 1.255 rillig designation_push(dn, DK_MEMBER, member, 0);
425 1.229 rillig } else if (tp->t_tspec == ARRAY)
426 1.255 rillig designation_push(dn, DK_SUBSCRIPT, NULL, 0);
427 1.229 rillig else
428 1.229 rillig designation_push(dn, DK_SCALAR, NULL, 0);
429 1.229 rillig return true;
430 1.159 rillig }
431 1.159 rillig
432 1.159 rillig /*
433 1.179 rillig * Starting at the type of the current object, resolve the type of the
434 1.179 rillig * sub-object by following each designator in the list.
435 1.198 rillig *
436 1.198 rillig * C99 6.7.8p18
437 1.159 rillig */
438 1.179 rillig static const type_t *
439 1.225 rillig designation_type(const designation *dn, const type_t *tp)
440 1.179 rillig {
441 1.179 rillig
442 1.239 rillig for (size_t i = 0; i < dn->dn_len && tp != NULL; i++)
443 1.225 rillig tp = designator_type(dn->dn_items + i, tp);
444 1.179 rillig return tp;
445 1.179 rillig }
446 1.179 rillig
447 1.229 rillig static const type_t *
448 1.229 rillig designation_parent_type(const designation *dn, const type_t *tp)
449 1.159 rillig {
450 1.159 rillig
451 1.239 rillig for (size_t i = 0; i + 1 < dn->dn_len && tp != NULL; i++)
452 1.229 rillig tp = designator_type(dn->dn_items + i, tp);
453 1.229 rillig return tp;
454 1.159 rillig }
455 1.159 rillig
456 1.159 rillig
457 1.221 rillig static brace_level *
458 1.221 rillig brace_level_new(const type_t *tp, brace_level *enclosing)
459 1.152 rillig {
460 1.152 rillig
461 1.239 rillig brace_level *bl = xcalloc(1, sizeof(*bl));
462 1.179 rillig bl->bl_type = tp;
463 1.178 rillig bl->bl_enclosing = enclosing;
464 1.152 rillig
465 1.178 rillig return bl;
466 1.152 rillig }
467 1.152 rillig
468 1.152 rillig static void
469 1.221 rillig brace_level_free(brace_level *bl)
470 1.152 rillig {
471 1.179 rillig
472 1.229 rillig free(bl->bl_designation.dn_items);
473 1.178 rillig free(bl);
474 1.152 rillig }
475 1.152 rillig
476 1.146 rillig #ifdef DEBUG
477 1.78 rillig static void
478 1.221 rillig brace_level_debug(const brace_level *bl)
479 1.74 rillig {
480 1.78 rillig
481 1.179 rillig lint_assert(bl->bl_type != NULL);
482 1.179 rillig
483 1.229 rillig debug_printf("type '%s'\n", type_name(bl->bl_type));
484 1.229 rillig debug_indent_inc();
485 1.229 rillig designation_debug(&bl->bl_designation);
486 1.229 rillig debug_indent_dec();
487 1.74 rillig }
488 1.146 rillig #else
489 1.179 rillig #define brace_level_debug(level) do { } while (false)
490 1.146 rillig #endif
491 1.146 rillig
492 1.179 rillig /* Return the type of the sub-object that is currently being initialized. */
493 1.179 rillig static const type_t *
494 1.229 rillig brace_level_sub_type(const brace_level *bl)
495 1.172 rillig {
496 1.147 rillig
497 1.229 rillig return designation_type(&bl->bl_designation, bl->bl_type);
498 1.229 rillig }
499 1.174 rillig
500 1.229 rillig /*
501 1.229 rillig * After initializing a sub-object, advance the designation to point after
502 1.229 rillig * the sub-object that has just been initialized.
503 1.229 rillig *
504 1.229 rillig * C99 6.7.8p17
505 1.229 rillig * C11 6.7.9p17
506 1.229 rillig */
507 1.229 rillig static void
508 1.229 rillig brace_level_advance(brace_level *bl, size_t *max_subscript)
509 1.229 rillig {
510 1.229 rillig
511 1.229 rillig debug_enter();
512 1.239 rillig designation *dn = &bl->bl_designation;
513 1.239 rillig const type_t *tp = designation_parent_type(dn, bl->bl_type);
514 1.229 rillig
515 1.229 rillig if (bl->bl_designation.dn_len == 0)
516 1.233 rillig (void)designation_descend(dn, bl->bl_type);
517 1.239 rillig
518 1.239 rillig designator *dr = designation_last(dn);
519 1.229 rillig /* TODO: try to switch on dr->dr_kind instead */
520 1.229 rillig switch (tp->t_tspec) {
521 1.179 rillig case STRUCT:
522 1.229 rillig lint_assert(dr->dr_member != NULL);
523 1.229 rillig dr->dr_member = skip_unnamed(dr->dr_member->s_next);
524 1.229 rillig if (dr->dr_member == NULL)
525 1.229 rillig dr->dr_done = true;
526 1.229 rillig break;
527 1.179 rillig case UNION:
528 1.229 rillig dr->dr_member = NULL;
529 1.229 rillig dr->dr_done = true;
530 1.229 rillig break;
531 1.229 rillig case ARRAY:
532 1.229 rillig dr->dr_subscript++;
533 1.229 rillig if (tp->t_incomplete_array &&
534 1.229 rillig dr->dr_subscript > *max_subscript)
535 1.229 rillig *max_subscript = dr->dr_subscript;
536 1.229 rillig if (!tp->t_incomplete_array &&
537 1.229 rillig dr->dr_subscript >= (size_t)tp->t_dim)
538 1.229 rillig dr->dr_done = true;
539 1.229 rillig break;
540 1.229 rillig default:
541 1.229 rillig dr->dr_done = true;
542 1.229 rillig break;
543 1.229 rillig }
544 1.229 rillig designation_debug(dn);
545 1.229 rillig debug_leave();
546 1.229 rillig }
547 1.216 rillig
548 1.229 rillig static void
549 1.229 rillig warn_too_many_initializers(designator_kind kind, const type_t *tp)
550 1.229 rillig {
551 1.216 rillig
552 1.255 rillig if (kind == DK_MEMBER) {
553 1.229 rillig /* too many struct/union initializers */
554 1.229 rillig error(172);
555 1.255 rillig } else if (kind == DK_SUBSCRIPT) {
556 1.229 rillig lint_assert(tp->t_tspec == ARRAY);
557 1.229 rillig lint_assert(!tp->t_incomplete_array);
558 1.229 rillig /* too many array initializers, expected %d */
559 1.229 rillig error(173, tp->t_dim);
560 1.229 rillig } else {
561 1.229 rillig /* too many initializers */
562 1.229 rillig error(174);
563 1.229 rillig }
564 1.229 rillig }
565 1.216 rillig
566 1.229 rillig static bool
567 1.229 rillig brace_level_pop_done(brace_level *bl, size_t *max_subscript)
568 1.229 rillig {
569 1.229 rillig designation *dn = &bl->bl_designation;
570 1.229 rillig designator_kind dr_kind = designation_last(dn)->dr_kind;
571 1.229 rillig const type_t *sub_type = designation_parent_type(dn, bl->bl_type);
572 1.229 rillig
573 1.229 rillig while (designation_last(dn)->dr_done) {
574 1.229 rillig dn->dn_len--;
575 1.229 rillig designation_debug(dn);
576 1.229 rillig if (dn->dn_len == 0) {
577 1.229 rillig warn_too_many_initializers(dr_kind, sub_type);
578 1.229 rillig return false;
579 1.216 rillig }
580 1.229 rillig brace_level_advance(bl, max_subscript);
581 1.147 rillig }
582 1.229 rillig return true;
583 1.147 rillig }
584 1.147 rillig
585 1.179 rillig static void
586 1.229 rillig brace_level_pop_final(brace_level *bl, size_t *max_subscript)
587 1.155 rillig {
588 1.229 rillig designation *dn = &bl->bl_designation;
589 1.179 rillig
590 1.229 rillig while (dn->dn_len > 0 && designation_last(dn)->dr_done) {
591 1.229 rillig dn->dn_len--;
592 1.229 rillig designation_debug(dn);
593 1.229 rillig if (dn->dn_len == 0)
594 1.229 rillig return;
595 1.229 rillig brace_level_advance(bl, max_subscript);
596 1.155 rillig }
597 1.155 rillig }
598 1.155 rillig
599 1.158 rillig /*
600 1.229 rillig * Make the designation point to the sub-object to be initialized next.
601 1.229 rillig * Initially or after a previous expression, the designation is not advanced
602 1.229 rillig * yet since the place to stop depends on the next expression, especially for
603 1.229 rillig * string literals.
604 1.158 rillig */
605 1.229 rillig static bool
606 1.229 rillig brace_level_goto(brace_level *bl, const tnode_t *rn, size_t *max_subscript)
607 1.158 rillig {
608 1.158 rillig
609 1.239 rillig designation *dn = &bl->bl_designation;
610 1.229 rillig if (dn->dn_len == 0 && can_init_character_array(bl->bl_type, rn))
611 1.229 rillig return true;
612 1.229 rillig if (dn->dn_len == 0 && !designation_descend(dn, bl->bl_type))
613 1.229 rillig return false;
614 1.229 rillig
615 1.229 rillig again:
616 1.229 rillig if (!brace_level_pop_done(bl, max_subscript))
617 1.229 rillig return false;
618 1.229 rillig
619 1.239 rillig const type_t *ltp = brace_level_sub_type(bl);
620 1.237 rillig if (types_compatible(ltp, rn->tn_type, true, false, NULL))
621 1.229 rillig return true;
622 1.229 rillig
623 1.229 rillig if (is_struct_or_union(ltp->t_tspec) || ltp->t_tspec == ARRAY) {
624 1.229 rillig if (can_init_character_array(ltp, rn))
625 1.229 rillig return true;
626 1.229 rillig if (!designation_descend(dn, ltp))
627 1.229 rillig return false;
628 1.229 rillig goto again;
629 1.158 rillig }
630 1.229 rillig
631 1.229 rillig return true;
632 1.160 rillig }
633 1.158 rillig
634 1.146 rillig
635 1.221 rillig static initialization *
636 1.221 rillig initialization_new(sym_t *sym, initialization *enclosing)
637 1.146 rillig {
638 1.146 rillig
639 1.239 rillig initialization *in = xcalloc(1, sizeof(*in));
640 1.176 rillig in->in_sym = sym;
641 1.217 rillig in->in_enclosing = enclosing;
642 1.146 rillig
643 1.146 rillig return in;
644 1.146 rillig }
645 1.74 rillig
646 1.146 rillig static void
647 1.221 rillig initialization_free(initialization *in)
648 1.146 rillig {
649 1.221 rillig brace_level *bl, *next;
650 1.146 rillig
651 1.229 rillig /* TODO: lint_assert(in->in_brace_level == NULL) */
652 1.176 rillig for (bl = in->in_brace_level; bl != NULL; bl = next) {
653 1.176 rillig next = bl->bl_enclosing;
654 1.176 rillig brace_level_free(bl);
655 1.146 rillig }
656 1.146 rillig
657 1.146 rillig free(in);
658 1.146 rillig }
659 1.146 rillig
660 1.146 rillig #ifdef DEBUG
661 1.73 rillig static void
662 1.221 rillig initialization_debug(const initialization *in)
663 1.73 rillig {
664 1.179 rillig
665 1.229 rillig if (in->in_err)
666 1.229 rillig debug_step("initialization error");
667 1.176 rillig if (in->in_brace_level == NULL) {
668 1.179 rillig debug_step("no brace level");
669 1.73 rillig return;
670 1.73 rillig }
671 1.73 rillig
672 1.239 rillig const brace_level *bl;
673 1.239 rillig size_t i = 0;
674 1.179 rillig for (bl = in->in_brace_level; bl != NULL; bl = bl->bl_enclosing) {
675 1.139 rillig debug_printf("brace level %zu: ", i);
676 1.178 rillig brace_level_debug(bl);
677 1.73 rillig i++;
678 1.73 rillig }
679 1.73 rillig }
680 1.146 rillig #else
681 1.146 rillig #define initialization_debug(in) do { } while (false)
682 1.146 rillig #endif
683 1.146 rillig
684 1.1 cgd /*
685 1.179 rillig * Return the type of the object or sub-object that is currently being
686 1.179 rillig * initialized.
687 1.1 cgd */
688 1.179 rillig static const type_t *
689 1.229 rillig initialization_sub_type(initialization *in)
690 1.179 rillig {
691 1.179 rillig
692 1.229 rillig if (in->in_brace_level == NULL)
693 1.229 rillig return in->in_sym->s_type;
694 1.229 rillig
695 1.239 rillig const type_t *tp = brace_level_sub_type(in->in_brace_level);
696 1.179 rillig if (tp == NULL)
697 1.179 rillig in->in_err = true;
698 1.179 rillig return tp;
699 1.179 rillig }
700 1.179 rillig
701 1.158 rillig static void
702 1.225 rillig initialization_lbrace(initialization *in)
703 1.1 cgd {
704 1.179 rillig
705 1.176 rillig if (in->in_err)
706 1.1 cgd return;
707 1.1 cgd
708 1.70 rillig debug_enter();
709 1.38 rillig
710 1.239 rillig const type_t *tp = initialization_sub_type(in);
711 1.229 rillig if (tp == NULL)
712 1.179 rillig goto done;
713 1.1 cgd
714 1.239 rillig brace_level *outer_bl = in->in_brace_level;
715 1.234 rillig if (!allow_c90 && outer_bl == NULL)
716 1.197 rillig check_trad_no_auto_aggregate(in->in_sym);
717 1.70 rillig
718 1.234 rillig if (!allow_c90 && tp->t_tspec == UNION) {
719 1.179 rillig /* initialization of union is illegal in traditional C */
720 1.179 rillig warning(238);
721 1.179 rillig }
722 1.1 cgd
723 1.241 rillig if (is_struct_or_union(tp->t_tspec) && tp->t_sou->sou_incomplete) {
724 1.180 rillig /* initialization of incomplete type '%s' */
725 1.180 rillig error(175, type_name(tp));
726 1.179 rillig in->in_err = true;
727 1.179 rillig goto done;
728 1.104 rillig }
729 1.104 rillig
730 1.229 rillig if (outer_bl != NULL && outer_bl->bl_designation.dn_len == 0) {
731 1.229 rillig designation *dn = &outer_bl->bl_designation;
732 1.233 rillig (void)designation_descend(dn, outer_bl->bl_type);
733 1.229 rillig tp = designation_type(dn, outer_bl->bl_type);
734 1.229 rillig }
735 1.1 cgd
736 1.229 rillig in->in_brace_level = brace_level_new(tp, outer_bl);
737 1.229 rillig if (is_struct_or_union(tp->t_tspec) &&
738 1.229 rillig first_named_member(tp) == NULL) {
739 1.229 rillig /* cannot initialize struct/union with no named member */
740 1.229 rillig error(179);
741 1.229 rillig in->in_err = true;
742 1.229 rillig }
743 1.68 rillig
744 1.179 rillig done:
745 1.153 rillig initialization_debug(in);
746 1.68 rillig debug_leave();
747 1.1 cgd }
748 1.1 cgd
749 1.1 cgd static void
750 1.229 rillig initialization_rbrace(initialization *in)
751 1.1 cgd {
752 1.158 rillig
753 1.229 rillig debug_enter();
754 1.213 rillig
755 1.229 rillig if (in->in_brace_level != NULL)
756 1.229 rillig brace_level_pop_final(in->in_brace_level,
757 1.229 rillig &in->in_max_subscript);
758 1.213 rillig
759 1.229 rillig /* C99 6.7.8p22 */
760 1.229 rillig if (in->in_sym->s_type->t_incomplete_array &&
761 1.229 rillig in->in_brace_level->bl_enclosing == NULL) {
762 1.229 rillig
763 1.236 rillig /* prevent "empty array declaration for '%s' [190]" */
764 1.229 rillig size_t dim = in->in_max_subscript;
765 1.229 rillig if (dim == 0 && in->in_err)
766 1.229 rillig dim = 1;
767 1.158 rillig
768 1.229 rillig update_type_of_array_of_unknown_size(in->in_sym, dim);
769 1.229 rillig }
770 1.158 rillig
771 1.213 rillig if (in->in_err)
772 1.213 rillig goto done;
773 1.179 rillig
774 1.239 rillig brace_level *inner_bl = in->in_brace_level;
775 1.239 rillig brace_level *outer_bl = inner_bl->bl_enclosing;
776 1.222 rillig in->in_brace_level = outer_bl;
777 1.222 rillig brace_level_free(inner_bl);
778 1.222 rillig
779 1.229 rillig if (outer_bl != NULL)
780 1.222 rillig brace_level_advance(outer_bl, &in->in_max_subscript);
781 1.68 rillig
782 1.213 rillig done:
783 1.153 rillig initialization_debug(in);
784 1.68 rillig debug_leave();
785 1.37 rillig }
786 1.37 rillig
787 1.37 rillig static void
788 1.229 rillig initialization_add_designator_member(initialization *in, const char *name)
789 1.164 rillig {
790 1.164 rillig
791 1.176 rillig if (in->in_err)
792 1.1 cgd return;
793 1.1 cgd
794 1.239 rillig brace_level *bl = in->in_brace_level;
795 1.229 rillig lint_assert(bl != NULL);
796 1.229 rillig
797 1.239 rillig const type_t *tp = brace_level_sub_type(bl);
798 1.229 rillig if (is_struct_or_union(tp->t_tspec))
799 1.229 rillig goto proceed;
800 1.248 rillig else if (tp->t_tspec == ARRAY)
801 1.229 rillig /* syntax error '%s' */
802 1.229 rillig error(249, "designator '.member' is only for struct/union");
803 1.248 rillig else
804 1.229 rillig /* syntax error '%s' */
805 1.229 rillig error(249, "scalar type cannot use designator");
806 1.248 rillig in->in_err = true;
807 1.248 rillig return;
808 1.229 rillig
809 1.239 rillig proceed:;
810 1.248 rillig const sym_t *member = find_member(tp->t_sou, name);
811 1.229 rillig if (member == NULL) {
812 1.229 rillig /* type '%s' does not have member '%s' */
813 1.229 rillig error(101, type_name(tp), name);
814 1.229 rillig in->in_err = true;
815 1.229 rillig return;
816 1.229 rillig }
817 1.229 rillig
818 1.255 rillig designation_push(&bl->bl_designation, DK_MEMBER, member, 0);
819 1.229 rillig }
820 1.229 rillig
821 1.229 rillig static void
822 1.229 rillig initialization_add_designator_subscript(initialization *in, size_t subscript)
823 1.229 rillig {
824 1.229 rillig
825 1.229 rillig if (in->in_err)
826 1.229 rillig return;
827 1.229 rillig
828 1.239 rillig brace_level *bl = in->in_brace_level;
829 1.229 rillig lint_assert(bl != NULL);
830 1.229 rillig
831 1.239 rillig const type_t *tp = brace_level_sub_type(bl);
832 1.229 rillig if (tp->t_tspec != ARRAY) {
833 1.229 rillig /* syntax error '%s' */
834 1.229 rillig error(249, "designator '[...]' is only for arrays");
835 1.229 rillig in->in_err = true;
836 1.229 rillig return;
837 1.229 rillig }
838 1.229 rillig
839 1.229 rillig if (!tp->t_incomplete_array && subscript >= (size_t)tp->t_dim) {
840 1.229 rillig /* array subscript cannot be > %d: %ld */
841 1.229 rillig error(168, tp->t_dim - 1, (long)subscript);
842 1.229 rillig subscript = 0; /* suppress further errors */
843 1.229 rillig }
844 1.229 rillig
845 1.229 rillig if (tp->t_incomplete_array && subscript > in->in_max_subscript)
846 1.229 rillig in->in_max_subscript = subscript;
847 1.229 rillig
848 1.255 rillig designation_push(&bl->bl_designation, DK_SUBSCRIPT, NULL, subscript);
849 1.1 cgd }
850 1.1 cgd
851 1.114 rillig /*
852 1.208 rillig * Initialize an object with automatic storage duration that has an
853 1.208 rillig * initializer expression without braces.
854 1.114 rillig */
855 1.179 rillig static bool
856 1.221 rillig initialization_expr_using_op(initialization *in, tnode_t *rn)
857 1.116 rillig {
858 1.179 rillig
859 1.179 rillig if (!has_automatic_storage_duration(in->in_sym))
860 1.179 rillig return false;
861 1.179 rillig if (in->in_brace_level != NULL)
862 1.179 rillig return false;
863 1.179 rillig if (in->in_sym->s_type->t_tspec == ARRAY)
864 1.179 rillig return false;
865 1.1 cgd
866 1.208 rillig debug_step("handing over to INIT");
867 1.55 rillig
868 1.239 rillig tnode_t *ln = build_name(in->in_sym, false);
869 1.204 rillig ln->tn_type = expr_unqualified_type(ln->tn_type);
870 1.1 cgd
871 1.239 rillig tnode_t *tn = build_binary(ln, INIT, false /* XXX */, rn);
872 1.179 rillig expr(tn, false, false, false, false);
873 1.1 cgd
874 1.179 rillig return true;
875 1.1 cgd }
876 1.1 cgd
877 1.82 rillig /* Initialize a character array or wchar_t array with a string literal. */
878 1.62 rillig static bool
879 1.225 rillig initialization_init_array_from_string(initialization *in, tnode_t *tn)
880 1.1 cgd {
881 1.1 cgd
882 1.1 cgd if (tn->tn_op != STRING)
883 1.63 rillig return false;
884 1.1 cgd
885 1.239 rillig const type_t *tp = initialization_sub_type(in);
886 1.213 rillig
887 1.229 rillig if (!can_init_character_array(tp, tn))
888 1.179 rillig return false;
889 1.119 rillig
890 1.257 rillig size_t len = tn->tn_string->len;
891 1.229 rillig if (!tp->t_incomplete_array && (size_t)tp->t_dim < len) {
892 1.228 rillig /* string literal too long (%lu) for target array (%lu) */
893 1.229 rillig warning(187, (unsigned long)len, (unsigned long)tp->t_dim);
894 1.179 rillig }
895 1.119 rillig
896 1.239 rillig brace_level *bl = in->in_brace_level;
897 1.229 rillig if (bl != NULL && bl->bl_designation.dn_len == 0)
898 1.233 rillig (void)designation_descend(&bl->bl_designation, bl->bl_type);
899 1.229 rillig if (bl != NULL)
900 1.229 rillig brace_level_advance(bl, &in->in_max_subscript);
901 1.229 rillig
902 1.230 rillig if (tp->t_incomplete_array)
903 1.229 rillig update_type_of_array_of_unknown_size(in->in_sym, len + 1);
904 1.1 cgd
905 1.63 rillig return true;
906 1.1 cgd }
907 1.158 rillig
908 1.158 rillig /*
909 1.179 rillig * Initialize a single sub-object as part of the currently ongoing
910 1.179 rillig * initialization.
911 1.158 rillig */
912 1.179 rillig static void
913 1.221 rillig initialization_expr(initialization *in, tnode_t *tn)
914 1.158 rillig {
915 1.158 rillig
916 1.229 rillig if (in->in_err || tn == NULL)
917 1.179 rillig return;
918 1.158 rillig
919 1.179 rillig debug_enter();
920 1.158 rillig
921 1.239 rillig brace_level *bl = in->in_brace_level;
922 1.230 rillig if (bl != NULL && !brace_level_goto(bl, tn, &in->in_max_subscript)) {
923 1.229 rillig in->in_err = true;
924 1.229 rillig goto done;
925 1.229 rillig }
926 1.208 rillig if (initialization_expr_using_op(in, tn))
927 1.179 rillig goto done;
928 1.225 rillig if (initialization_init_array_from_string(in, tn))
929 1.229 rillig goto done;
930 1.213 rillig if (in->in_err)
931 1.213 rillig goto done;
932 1.158 rillig
933 1.239 rillig const type_t *tp = initialization_sub_type(in);
934 1.179 rillig if (tp == NULL)
935 1.179 rillig goto done;
936 1.158 rillig
937 1.184 rillig if (bl == NULL && !is_scalar(tp->t_tspec)) {
938 1.249 rillig /* {}-enclosed or constant initializer of type '%s' required */
939 1.249 rillig error(181, type_name(in->in_sym->s_type));
940 1.179 rillig goto done;
941 1.158 rillig }
942 1.158 rillig
943 1.206 rillig debug_step("expecting '%s', expression has '%s'",
944 1.179 rillig type_name(tp), type_name(tn->tn_type));
945 1.179 rillig check_init_expr(tp, in->in_sym, tn);
946 1.184 rillig if (bl != NULL)
947 1.219 rillig brace_level_advance(bl, &in->in_max_subscript);
948 1.229 rillig
949 1.179 rillig done:
950 1.158 rillig initialization_debug(in);
951 1.158 rillig debug_leave();
952 1.158 rillig }
953 1.158 rillig
954 1.158 rillig
955 1.221 rillig static initialization *init;
956 1.158 rillig
957 1.158 rillig
958 1.240 rillig sym_t *
959 1.158 rillig current_initsym(void)
960 1.158 rillig {
961 1.175 rillig
962 1.240 rillig return init->in_sym;
963 1.158 rillig }
964 1.158 rillig
965 1.158 rillig void
966 1.158 rillig begin_initialization(sym_t *sym)
967 1.158 rillig {
968 1.158 rillig
969 1.206 rillig debug_step("begin initialization of '%s'", type_name(sym->s_type));
970 1.205 rillig debug_indent_inc();
971 1.179 rillig
972 1.217 rillig init = initialization_new(sym, init);
973 1.158 rillig }
974 1.158 rillig
975 1.158 rillig void
976 1.158 rillig end_initialization(void)
977 1.158 rillig {
978 1.158 rillig
979 1.239 rillig initialization *in = init;
980 1.179 rillig init = in->in_enclosing;
981 1.158 rillig initialization_free(in);
982 1.179 rillig
983 1.205 rillig debug_indent_dec();
984 1.206 rillig debug_step("end initialization");
985 1.158 rillig }
986 1.158 rillig
987 1.158 rillig void
988 1.223 rillig begin_designation(void)
989 1.223 rillig {
990 1.223 rillig
991 1.239 rillig initialization *in = init;
992 1.227 rillig if (in->in_err)
993 1.227 rillig return;
994 1.227 rillig
995 1.256 rillig designation *dn = &in->in_brace_level->bl_designation;
996 1.256 rillig dn->dn_len = 0;
997 1.256 rillig designation_debug(dn);
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.239 rillig initialization_add_designator_member(init, sb->sb_name);
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.239 rillig initialization_add_designator_subscript(init, 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.239 rillig initialization_lbrace(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.239 rillig initialization_expr(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.239 rillig initialization_rbrace(init);
1033 1.158 rillig }
1034