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