init.c revision 1.177 1 1.177 rillig /* $NetBSD: init.c,v 1.177 2021/03/29 21:09:21 rillig Exp $ */
2 1.2 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1994, 1995 Jochen Pohl
5 1.1 cgd * All Rights Reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by Jochen Pohl for
18 1.1 cgd * The NetBSD Project.
19 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
20 1.1 cgd * derived from this software without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.18 jmc #if HAVE_NBTOOL_CONFIG_H
35 1.18 jmc #include "nbtool_config.h"
36 1.18 jmc #endif
37 1.18 jmc
38 1.5 christos #include <sys/cdefs.h>
39 1.10 tv #if defined(__RCSID) && !defined(lint)
40 1.177 rillig __RCSID("$NetBSD: init.c,v 1.177 2021/03/29 21:09:21 rillig Exp $");
41 1.1 cgd #endif
42 1.1 cgd
43 1.1 cgd #include <stdlib.h>
44 1.17 thorpej #include <string.h>
45 1.1 cgd
46 1.1 cgd #include "lint1.h"
47 1.1 cgd
48 1.53 rillig
49 1.53 rillig /*
50 1.93 rillig * Initialization
51 1.93 rillig *
52 1.93 rillig * Handles initializations of global or local objects, like in:
53 1.93 rillig *
54 1.93 rillig * int number = 12345;
55 1.93 rillig * int number_with_braces = { 12345 };
56 1.93 rillig *
57 1.93 rillig * int array_of_unknown_size[] = { 111, 222, 333 };
58 1.93 rillig * int array_flat[2][2] = { 11, 12, 21, 22 };
59 1.93 rillig * int array_nested[2][2] = { { 11, 12 }, { 21, 22 } };
60 1.93 rillig *
61 1.93 rillig * struct { int x, y; } point = { 3, 4 };
62 1.119 rillig * struct { int x, y; } point = { .y = 4, .x = 3 };
63 1.93 rillig *
64 1.119 rillig * Any scalar expression in the initializer may be surrounded by arbitrarily
65 1.119 rillig * many extra pairs of braces, like in the example 'number_with_braces' (C99
66 1.119 rillig * 6.7.8p11).
67 1.119 rillig *
68 1.119 rillig * For multi-dimensional arrays, the inner braces may be omitted like in
69 1.112 rillig * array_flat or spelled out like in array_nested.
70 1.93 rillig *
71 1.93 rillig * For the initializer, the grammar parser calls these functions:
72 1.93 rillig *
73 1.119 rillig * begin_initialization
74 1.119 rillig * init_lbrace for each '{'
75 1.157 rillig * add_designator_member for each '.member' before '='
76 1.157 rillig * add_designator_subscript for each '[123]' before '='
77 1.119 rillig * init_using_expr for each expression
78 1.119 rillig * init_rbrace for each '}'
79 1.119 rillig * end_initialization
80 1.93 rillig *
81 1.139 rillig * Each '{' begins a new brace level, each '}' ends the current brace level.
82 1.139 rillig * Each brace level has an associated "current object".
83 1.93 rillig *
84 1.139 rillig * Most of the time, the topmost level of brace_level contains a scalar type,
85 1.139 rillig * and its remaining count toggles between 1 and 0.
86 1.93 rillig *
87 1.93 rillig * See also:
88 1.93 rillig * C99 6.7.8 "Initialization"
89 1.93 rillig * d_c99_init.c for more examples
90 1.93 rillig */
91 1.93 rillig
92 1.93 rillig
93 1.93 rillig /*
94 1.139 rillig * Describes a single brace level of an ongoing initialization.
95 1.54 rillig *
96 1.119 rillig * XXX: Since C99, the initializers can be listed in arbitrary order by using
97 1.119 rillig * designators to specify the sub-object to be initialized. The member names
98 1.54 rillig * of non-leaf structs may thus appear repeatedly, as demonstrated in
99 1.54 rillig * d_init_pop_member.c.
100 1.54 rillig *
101 1.54 rillig * See C99 6.7.8, which spans 6 pages full of tricky details and carefully
102 1.54 rillig * selected examples.
103 1.53 rillig */
104 1.139 rillig struct brace_level {
105 1.77 rillig
106 1.92 rillig /*
107 1.139 rillig * The type of the current object that is initialized at this brace
108 1.139 rillig * level.
109 1.102 rillig *
110 1.102 rillig * On the outermost element, this is always NULL since the outermost
111 1.102 rillig * initializer-expression may be enclosed in an optional pair of
112 1.119 rillig * braces, as of the current implementation.
113 1.119 rillig *
114 1.119 rillig * FIXME: This approach is wrong. It's not that the outermost
115 1.119 rillig * initializer may be enclosed in additional braces, it's every scalar
116 1.119 rillig * that may be enclosed in additional braces, as of C99 6.7.8p11.
117 1.102 rillig *
118 1.102 rillig * Everywhere else it is nonnull.
119 1.92 rillig */
120 1.139 rillig type_t *bl_type;
121 1.102 rillig
122 1.92 rillig /*
123 1.102 rillig * The type that will be initialized at the next initialization level,
124 1.102 rillig * usually enclosed by another pair of braces.
125 1.92 rillig *
126 1.102 rillig * For an array, it is the element type, but without 'const'.
127 1.102 rillig *
128 1.102 rillig * For a struct or union type, it is one of the member types, but
129 1.102 rillig * without 'const'.
130 1.102 rillig *
131 1.139 rillig * The outermost stack element has no bl_type but nevertheless has
132 1.139 rillig * bl_subtype. For example, in 'int var = { 12345 }', initially there
133 1.139 rillig * is a brace_level with bl_subtype 'int'. When the '{' is processed,
134 1.139 rillig * an element with bl_type 'int' is pushed to the stack. When the
135 1.92 rillig * corresponding '}' is processed, the inner element is popped again.
136 1.92 rillig *
137 1.92 rillig * During initialization, only the top 2 elements of the stack are
138 1.92 rillig * looked at.
139 1.119 rillig *
140 1.139 rillig * XXX: Having bl_subtype here is the wrong approach, it should not be
141 1.139 rillig * necessary at all; see bl_type.
142 1.92 rillig */
143 1.139 rillig type_t *bl_subtype;
144 1.77 rillig
145 1.82 rillig /*
146 1.119 rillig * Whether this level of the initializer requires a '}' to be
147 1.119 rillig * completed.
148 1.82 rillig *
149 1.82 rillig * Multidimensional arrays do not need a closing brace to complete
150 1.82 rillig * an inner array; for example, { 1, 2, 3, 4 } is a valid initializer
151 1.119 rillig * for 'int arr[2][2]'.
152 1.82 rillig *
153 1.119 rillig * XXX: Double-check whether this is the correct approach at all; see
154 1.139 rillig * bl_type.
155 1.82 rillig */
156 1.139 rillig bool bl_brace: 1;
157 1.82 rillig
158 1.139 rillig /* Whether bl_type is an array of unknown size. */
159 1.139 rillig bool bl_array_of_unknown_size: 1;
160 1.119 rillig
161 1.119 rillig /*
162 1.119 rillig * XXX: This feels wrong. Whether or not there has been a named
163 1.119 rillig * initializer (called 'designation' since C99) should not matter at
164 1.119 rillig * all. Even after an initializer with designation, counting of the
165 1.119 rillig * remaining elements continues, see C99 6.7.8p17.
166 1.119 rillig */
167 1.139 rillig bool bl_seen_named_member: 1;
168 1.77 rillig
169 1.77 rillig /*
170 1.125 rillig * For structs, the next member to be initialized by a designator-less
171 1.125 rillig * initializer.
172 1.77 rillig */
173 1.139 rillig sym_t *bl_next_member;
174 1.125 rillig
175 1.139 rillig /* TODO: Add bl_next_subscript for arrays. */
176 1.125 rillig
177 1.125 rillig /* TODO: Understand C99 6.7.8p17 and footnote 128 for unions. */
178 1.77 rillig
179 1.77 rillig /*
180 1.102 rillig * The number of remaining elements to be used by expressions without
181 1.102 rillig * designator.
182 1.102 rillig *
183 1.102 rillig * This says nothing about which members have been initialized or not
184 1.102 rillig * since starting with C99, members may be initialized in arbitrary
185 1.102 rillig * order by using designators.
186 1.77 rillig *
187 1.93 rillig * For an array of unknown size, this is always 0 and thus irrelevant.
188 1.93 rillig *
189 1.77 rillig * XXX: for scalars?
190 1.77 rillig * XXX: for structs?
191 1.77 rillig * XXX: for unions?
192 1.77 rillig * XXX: for arrays?
193 1.119 rillig *
194 1.119 rillig * XXX: Having the count of remaining objects should not be necessary.
195 1.139 rillig * It is probably clearer to use bl_next_member and bl_next_subscript
196 1.125 rillig * for this purpose.
197 1.77 rillig */
198 1.139 rillig int bl_remaining;
199 1.77 rillig
200 1.77 rillig /*
201 1.77 rillig * The initialization state of the enclosing data structure
202 1.77 rillig * (struct, union, array).
203 1.119 rillig *
204 1.119 rillig * XXX: Or for a scalar, for the top-level element, or for expressions
205 1.119 rillig * in redundant braces such as '{{{{ 0 }}}}' (not yet implemented as
206 1.119 rillig * of 2021-03-25).
207 1.77 rillig */
208 1.139 rillig struct brace_level *bl_enclosing;
209 1.139 rillig };
210 1.53 rillig
211 1.55 rillig /*
212 1.135 rillig * A single component on the path to the sub-object that is initialized by an
213 1.135 rillig * initializer expression. Either a struct or union member, or an array
214 1.135 rillig * subscript.
215 1.55 rillig *
216 1.128 rillig * See also: C99 6.7.8 "Initialization"
217 1.128 rillig */
218 1.140 rillig struct designator {
219 1.176 rillig const char *dr_name; /* for struct and union */
220 1.176 rillig /* TODO: add 'dr_subscript' for arrays */
221 1.176 rillig struct designator *dr_next;
222 1.140 rillig };
223 1.128 rillig
224 1.128 rillig /*
225 1.135 rillig * The optional designation for an initializer, saying which sub-object to
226 1.135 rillig * initialize. Examples for designations are '.member' or
227 1.135 rillig * '.member[123].member.member[1][1]'.
228 1.135 rillig *
229 1.128 rillig * See also: C99 6.7.8 "Initialization"
230 1.55 rillig */
231 1.140 rillig struct designation {
232 1.176 rillig struct designator *dn_head;
233 1.176 rillig struct designator *dn_tail;
234 1.140 rillig };
235 1.53 rillig
236 1.110 rillig struct initialization {
237 1.110 rillig /*
238 1.111 rillig * is set as soon as a fatal error occurred in the initialization.
239 1.111 rillig * The effect is that the rest of the initialization is ignored
240 1.111 rillig * (parsed by yacc, expression trees built, but no initialization
241 1.111 rillig * takes place).
242 1.110 rillig */
243 1.176 rillig bool in_err;
244 1.110 rillig
245 1.139 rillig /* The symbol that is to be initialized. */
246 1.176 rillig sym_t *in_sym;
247 1.53 rillig
248 1.139 rillig /* The innermost brace level. */
249 1.176 rillig struct brace_level *in_brace_level;
250 1.1 cgd
251 1.124 rillig /*
252 1.124 rillig * The C99 designator, if any, for the current initialization
253 1.124 rillig * expression.
254 1.124 rillig */
255 1.176 rillig struct designation in_designation;
256 1.1 cgd
257 1.176 rillig struct initialization *in_next;
258 1.110 rillig };
259 1.1 cgd
260 1.145 rillig
261 1.111 rillig static struct initialization *init;
262 1.12 christos
263 1.175 rillig
264 1.145 rillig #ifdef DEBUG
265 1.145 rillig static int debug_ind = 0;
266 1.145 rillig #endif
267 1.145 rillig
268 1.145 rillig
269 1.145 rillig #ifdef DEBUG
270 1.145 rillig
271 1.145 rillig static void __printflike(1, 2)
272 1.145 rillig debug_printf(const char *fmt, ...)
273 1.145 rillig {
274 1.145 rillig va_list va;
275 1.145 rillig
276 1.145 rillig va_start(va, fmt);
277 1.145 rillig vfprintf(stdout, fmt, va);
278 1.145 rillig va_end(va);
279 1.145 rillig }
280 1.145 rillig
281 1.145 rillig static void
282 1.145 rillig debug_indent(void)
283 1.145 rillig {
284 1.175 rillig
285 1.145 rillig debug_printf("%*s", 2 * debug_ind, "");
286 1.145 rillig }
287 1.145 rillig
288 1.145 rillig static void
289 1.145 rillig debug_enter(const char *func)
290 1.145 rillig {
291 1.175 rillig
292 1.145 rillig printf("%*s+ %s\n", 2 * debug_ind++, "", func);
293 1.145 rillig }
294 1.145 rillig
295 1.145 rillig static void __printflike(1, 2)
296 1.145 rillig debug_step(const char *fmt, ...)
297 1.145 rillig {
298 1.145 rillig va_list va;
299 1.145 rillig
300 1.145 rillig debug_indent();
301 1.145 rillig va_start(va, fmt);
302 1.145 rillig vfprintf(stdout, fmt, va);
303 1.145 rillig va_end(va);
304 1.145 rillig printf("\n");
305 1.145 rillig }
306 1.145 rillig
307 1.145 rillig static void
308 1.145 rillig debug_leave(const char *func)
309 1.145 rillig {
310 1.175 rillig
311 1.145 rillig printf("%*s- %s\n", 2 * --debug_ind, "", func);
312 1.145 rillig }
313 1.145 rillig
314 1.175 rillig #define debug_enter() (debug_enter)(__func__)
315 1.175 rillig #define debug_leave() (debug_leave)(__func__)
316 1.151 rillig
317 1.145 rillig #else
318 1.145 rillig
319 1.145 rillig #define debug_printf(fmt, ...) do { } while (false)
320 1.145 rillig #define debug_indent() do { } while (false)
321 1.151 rillig #define debug_enter() do { } while (false)
322 1.145 rillig #define debug_step(fmt, ...) do { } while (false)
323 1.151 rillig #define debug_leave() do { } while (false)
324 1.145 rillig
325 1.145 rillig #endif
326 1.145 rillig
327 1.1 cgd
328 1.175 rillig static void *
329 1.175 rillig unconst_cast(const void *p)
330 1.175 rillig {
331 1.175 rillig void *r;
332 1.175 rillig
333 1.175 rillig memcpy(&r, &p, sizeof r);
334 1.175 rillig return r;
335 1.175 rillig }
336 1.175 rillig
337 1.167 rillig static bool
338 1.167 rillig is_struct_or_union(tspec_t t)
339 1.167 rillig {
340 1.175 rillig
341 1.167 rillig return t == STRUCT || t == UNION;
342 1.167 rillig }
343 1.167 rillig
344 1.177 rillig static bool
345 1.177 rillig has_automatic_storage_duration(const sym_t *sym)
346 1.177 rillig {
347 1.177 rillig
348 1.177 rillig return sym->s_scl == AUTO || sym->s_scl == REG;
349 1.177 rillig }
350 1.177 rillig
351 1.177 rillig /* C99 6.7.8p14, 6.7.8p15 */
352 1.177 rillig static bool
353 1.177 rillig is_string_array(const type_t *tp, tspec_t t)
354 1.177 rillig {
355 1.177 rillig tspec_t st;
356 1.177 rillig
357 1.177 rillig if (tp == NULL || tp->t_tspec != ARRAY)
358 1.177 rillig return false;
359 1.177 rillig
360 1.177 rillig st = tp->t_subt->t_tspec;
361 1.177 rillig return t == CHAR
362 1.177 rillig ? st == CHAR || st == UCHAR || st == SCHAR
363 1.177 rillig : st == WCHAR;
364 1.177 rillig }
365 1.177 rillig
366 1.177 rillig /* C99 6.7.8p9 */
367 1.177 rillig static bool
368 1.177 rillig is_unnamed_member(const sym_t *m)
369 1.177 rillig {
370 1.177 rillig
371 1.177 rillig return m->s_bitfield && m->s_name == unnamed;
372 1.177 rillig }
373 1.177 rillig
374 1.177 rillig static const sym_t *
375 1.177 rillig look_up_member(const sym_t *m, const char *name)
376 1.177 rillig {
377 1.177 rillig
378 1.177 rillig for (; m != NULL; m = m->s_next)
379 1.177 rillig if (!is_unnamed_member(m) && strcmp(m->s_name, name) == 0)
380 1.177 rillig return m;
381 1.177 rillig return NULL;
382 1.177 rillig }
383 1.177 rillig
384 1.167 rillig
385 1.158 rillig /* In traditional C, bit-fields can be initialized only by integer constants. */
386 1.158 rillig static void
387 1.158 rillig check_bit_field_init(const tnode_t *ln, tspec_t lt, tspec_t rt)
388 1.158 rillig {
389 1.175 rillig
390 1.158 rillig if (tflag &&
391 1.158 rillig is_integer(lt) &&
392 1.158 rillig ln->tn_type->t_bitfield &&
393 1.158 rillig !is_integer(rt)) {
394 1.158 rillig /* bit-field initialization is illegal in traditional C */
395 1.158 rillig warning(186);
396 1.158 rillig }
397 1.158 rillig }
398 1.158 rillig
399 1.158 rillig static void
400 1.177 rillig check_non_constant_initializer(const tnode_t *tn, const sym_t *sym)
401 1.158 rillig {
402 1.177 rillig const sym_t *unused_sym;
403 1.177 rillig ptrdiff_t unused_offs;
404 1.175 rillig
405 1.158 rillig if (tn == NULL || tn->tn_op == CON)
406 1.158 rillig return;
407 1.158 rillig
408 1.177 rillig if (constant_addr(tn, &unused_sym, &unused_offs))
409 1.158 rillig return;
410 1.158 rillig
411 1.177 rillig if (has_automatic_storage_duration(sym)) {
412 1.158 rillig /* non-constant initializer */
413 1.158 rillig c99ism(177);
414 1.158 rillig } else {
415 1.158 rillig /* non-constant initializer */
416 1.158 rillig error(177);
417 1.158 rillig }
418 1.158 rillig }
419 1.158 rillig
420 1.158 rillig static void
421 1.177 rillig check_init_expr(const type_t *tp, sym_t *sym, tnode_t *tn)
422 1.158 rillig {
423 1.158 rillig tnode_t *ln;
424 1.158 rillig tspec_t lt, rt;
425 1.158 rillig struct mbl *tmem;
426 1.158 rillig
427 1.158 rillig /* Create a temporary node for the left side. */
428 1.158 rillig ln = tgetblk(sizeof *ln);
429 1.158 rillig ln->tn_op = NAME;
430 1.158 rillig ln->tn_type = tduptyp(tp);
431 1.158 rillig ln->tn_type->t_const = false;
432 1.158 rillig ln->tn_lvalue = true;
433 1.158 rillig ln->tn_sym = sym;
434 1.158 rillig
435 1.158 rillig tn = cconv(tn);
436 1.158 rillig
437 1.158 rillig lt = ln->tn_type->t_tspec;
438 1.158 rillig rt = tn->tn_type->t_tspec;
439 1.158 rillig
440 1.158 rillig debug_step("typeok '%s', '%s'",
441 1.158 rillig type_name(ln->tn_type), type_name(tn->tn_type));
442 1.158 rillig if (!typeok(INIT, 0, ln, tn))
443 1.158 rillig return;
444 1.158 rillig
445 1.158 rillig /*
446 1.158 rillig * Preserve the tree memory. This is necessary because otherwise
447 1.158 rillig * expr() would free it.
448 1.158 rillig */
449 1.158 rillig tmem = tsave();
450 1.158 rillig expr(tn, true, false, true, false);
451 1.158 rillig trestor(tmem);
452 1.158 rillig
453 1.158 rillig check_bit_field_init(ln, lt, rt);
454 1.158 rillig
455 1.158 rillig /*
456 1.158 rillig * XXX: Is it correct to do this conversion _after_ the typeok above?
457 1.158 rillig */
458 1.158 rillig if (lt != rt || (tp->t_bitfield && tn->tn_op == CON))
459 1.175 rillig tn = convert(INIT, 0, unconst_cast(tp), tn);
460 1.158 rillig
461 1.177 rillig check_non_constant_initializer(tn, sym);
462 1.158 rillig }
463 1.158 rillig
464 1.158 rillig
465 1.159 rillig static struct designator *
466 1.159 rillig designator_new(const char *name)
467 1.159 rillig {
468 1.176 rillig struct designator *dr;
469 1.176 rillig
470 1.176 rillig dr = xcalloc(1, sizeof *dr);
471 1.176 rillig dr->dr_name = name;
472 1.176 rillig return dr;
473 1.159 rillig }
474 1.159 rillig
475 1.159 rillig static void
476 1.176 rillig designator_free(struct designator *dr)
477 1.159 rillig {
478 1.175 rillig
479 1.176 rillig free(dr);
480 1.159 rillig }
481 1.159 rillig
482 1.159 rillig
483 1.159 rillig #ifdef DEBUG
484 1.159 rillig static void
485 1.159 rillig designation_debug(const struct designation *dn)
486 1.159 rillig {
487 1.176 rillig const struct designator *dr;
488 1.159 rillig
489 1.176 rillig if (dn->dn_head == NULL)
490 1.159 rillig return;
491 1.159 rillig
492 1.159 rillig debug_indent();
493 1.159 rillig debug_printf("designation: ");
494 1.176 rillig for (dr = dn->dn_head; dr != NULL; dr = dr->dr_next)
495 1.176 rillig debug_printf(".%s", dr->dr_name);
496 1.159 rillig debug_printf("\n");
497 1.159 rillig }
498 1.159 rillig #else
499 1.159 rillig #define designation_debug(dn) do { } while (false)
500 1.159 rillig #endif
501 1.159 rillig
502 1.159 rillig static void
503 1.159 rillig designation_add(struct designation *dn, struct designator *dr)
504 1.159 rillig {
505 1.159 rillig
506 1.176 rillig if (dn->dn_head != NULL) {
507 1.176 rillig dn->dn_tail->dr_next = dr;
508 1.176 rillig dn->dn_tail = dr;
509 1.159 rillig } else {
510 1.176 rillig dn->dn_head = dr;
511 1.176 rillig dn->dn_tail = dr;
512 1.159 rillig }
513 1.159 rillig
514 1.159 rillig designation_debug(dn);
515 1.159 rillig }
516 1.159 rillig
517 1.159 rillig /* TODO: add support for array subscripts, not only named members */
518 1.159 rillig /*
519 1.159 rillig * TODO: This function should not be necessary at all. There is no need to
520 1.159 rillig * remove the head of the list.
521 1.159 rillig */
522 1.159 rillig static void
523 1.159 rillig designation_shift_level(struct designation *dn)
524 1.159 rillig {
525 1.176 rillig lint_assert(dn->dn_head != NULL);
526 1.159 rillig
527 1.176 rillig if (dn->dn_head == dn->dn_tail) {
528 1.176 rillig designator_free(dn->dn_head);
529 1.176 rillig dn->dn_head = NULL;
530 1.176 rillig dn->dn_tail = NULL;
531 1.159 rillig } else {
532 1.176 rillig struct designator *head = dn->dn_head;
533 1.176 rillig dn->dn_head = dn->dn_head->dr_next;
534 1.159 rillig designator_free(head);
535 1.159 rillig }
536 1.159 rillig
537 1.159 rillig designation_debug(dn);
538 1.159 rillig }
539 1.159 rillig
540 1.159 rillig
541 1.152 rillig static struct brace_level *
542 1.166 rillig brace_level_new(type_t *type, type_t *subtype, int remaining,
543 1.166 rillig struct brace_level *enclosing)
544 1.152 rillig {
545 1.152 rillig struct brace_level *level = xcalloc(1, sizeof(*level));
546 1.152 rillig
547 1.152 rillig level->bl_type = type;
548 1.152 rillig level->bl_subtype = subtype;
549 1.152 rillig level->bl_remaining = remaining;
550 1.166 rillig level->bl_enclosing = enclosing;
551 1.152 rillig
552 1.152 rillig return level;
553 1.152 rillig }
554 1.152 rillig
555 1.152 rillig static void
556 1.152 rillig brace_level_free(struct brace_level *level)
557 1.152 rillig {
558 1.152 rillig free(level);
559 1.152 rillig }
560 1.152 rillig
561 1.146 rillig #ifdef DEBUG
562 1.119 rillig /*
563 1.119 rillig * TODO: only log the top of the stack after each modifying operation
564 1.119 rillig *
565 1.139 rillig * TODO: wrap all write accesses to brace_level in setter functions
566 1.119 rillig */
567 1.78 rillig static void
568 1.146 rillig brace_level_debug(const struct brace_level *level)
569 1.74 rillig {
570 1.139 rillig if (level->bl_type != NULL)
571 1.139 rillig debug_printf("type '%s'", type_name(level->bl_type));
572 1.139 rillig if (level->bl_type != NULL && level->bl_subtype != NULL)
573 1.120 rillig debug_printf(", ");
574 1.139 rillig if (level->bl_subtype != NULL)
575 1.139 rillig debug_printf("subtype '%s'", type_name(level->bl_subtype));
576 1.78 rillig
577 1.139 rillig if (level->bl_brace)
578 1.120 rillig debug_printf(", needs closing brace");
579 1.139 rillig if (level->bl_array_of_unknown_size)
580 1.120 rillig debug_printf(", array of unknown size");
581 1.139 rillig if (level->bl_seen_named_member)
582 1.120 rillig debug_printf(", seen named member");
583 1.78 rillig
584 1.139 rillig const type_t *eff_type = level->bl_type != NULL
585 1.139 rillig ? level->bl_type : level->bl_subtype;
586 1.139 rillig if (eff_type->t_tspec == STRUCT && level->bl_next_member != NULL)
587 1.125 rillig debug_printf(", next member '%s'",
588 1.139 rillig level->bl_next_member->s_name);
589 1.78 rillig
590 1.139 rillig debug_printf(", remaining %d\n", level->bl_remaining);
591 1.74 rillig }
592 1.146 rillig #else
593 1.146 rillig #define brace_level_debug(level) do { } while (false)
594 1.146 rillig #endif
595 1.146 rillig
596 1.174 rillig static void
597 1.174 rillig brace_level_assert_struct_or_union(const struct brace_level *level)
598 1.174 rillig {
599 1.174 rillig lint_assert(is_struct_or_union(level->bl_type->t_tspec));
600 1.174 rillig }
601 1.174 rillig
602 1.174 rillig static void
603 1.174 rillig brace_level_assert_array(const struct brace_level *level)
604 1.174 rillig {
605 1.174 rillig lint_assert(level->bl_type->t_tspec == ARRAY);
606 1.174 rillig }
607 1.174 rillig
608 1.166 rillig static type_t *
609 1.166 rillig brace_level_subtype(struct brace_level *level)
610 1.166 rillig {
611 1.166 rillig
612 1.166 rillig if (level->bl_subtype != NULL)
613 1.166 rillig return level->bl_subtype;
614 1.166 rillig
615 1.166 rillig return level->bl_type;
616 1.166 rillig }
617 1.166 rillig
618 1.152 rillig static void
619 1.152 rillig brace_level_set_array_dimension(struct brace_level *level, int dim)
620 1.152 rillig {
621 1.174 rillig brace_level_assert_array(level);
622 1.174 rillig
623 1.152 rillig debug_step("setting the array size to %d", dim);
624 1.152 rillig level->bl_type->t_dim = dim;
625 1.152 rillig debug_indent();
626 1.152 rillig brace_level_debug(level);
627 1.152 rillig }
628 1.152 rillig
629 1.152 rillig static void
630 1.152 rillig brace_level_next_member(struct brace_level *level)
631 1.152 rillig {
632 1.152 rillig const sym_t *m;
633 1.152 rillig
634 1.174 rillig brace_level_assert_struct_or_union(level);
635 1.152 rillig do {
636 1.152 rillig m = level->bl_next_member = level->bl_next_member->s_next;
637 1.152 rillig /* XXX: can this assertion be made to fail? */
638 1.152 rillig lint_assert(m != NULL);
639 1.152 rillig } while (m->s_bitfield && m->s_name == unnamed);
640 1.152 rillig
641 1.152 rillig debug_indent();
642 1.152 rillig brace_level_debug(level);
643 1.152 rillig }
644 1.152 rillig
645 1.147 rillig static const sym_t *
646 1.147 rillig brace_level_look_up_member(const struct brace_level *level, const char *name)
647 1.147 rillig {
648 1.147 rillig
649 1.174 rillig brace_level_assert_struct_or_union(level);
650 1.177 rillig return look_up_member(level->bl_type->t_str->sou_first_member, name);
651 1.147 rillig }
652 1.147 rillig
653 1.147 rillig static sym_t *
654 1.173 rillig brace_level_look_up_first_member_named(struct brace_level *level,
655 1.173 rillig const char *name, int *count)
656 1.147 rillig {
657 1.147 rillig sym_t *m;
658 1.147 rillig
659 1.147 rillig for (m = level->bl_type->t_str->sou_first_member;
660 1.147 rillig m != NULL; m = m->s_next) {
661 1.177 rillig if (is_unnamed_member(m))
662 1.147 rillig continue;
663 1.172 rillig if (strcmp(m->s_name, name) != 0)
664 1.172 rillig continue;
665 1.172 rillig (*count)++;
666 1.172 rillig break;
667 1.172 rillig }
668 1.172 rillig
669 1.172 rillig return m;
670 1.172 rillig }
671 1.172 rillig
672 1.172 rillig static sym_t *
673 1.173 rillig brace_level_look_up_first_member_unnamed(struct brace_level *level, int *count)
674 1.172 rillig {
675 1.172 rillig sym_t *m;
676 1.147 rillig
677 1.174 rillig brace_level_assert_struct_or_union(level);
678 1.174 rillig
679 1.172 rillig for (m = level->bl_type->t_str->sou_first_member;
680 1.172 rillig m != NULL; m = m->s_next) {
681 1.177 rillig if (is_unnamed_member(m))
682 1.172 rillig continue;
683 1.147 rillig /* XXX: What is this code for? */
684 1.147 rillig if (++(*count) == 1) {
685 1.147 rillig level->bl_next_member = m;
686 1.147 rillig level->bl_subtype = m->s_type;
687 1.147 rillig }
688 1.147 rillig }
689 1.147 rillig
690 1.147 rillig return m;
691 1.147 rillig }
692 1.147 rillig
693 1.155 rillig /* TODO: document me */
694 1.155 rillig /* TODO: think of a better name than 'push' */
695 1.155 rillig static bool
696 1.155 rillig brace_level_push_array(struct brace_level *level)
697 1.155 rillig {
698 1.174 rillig brace_level_assert_array(level);
699 1.174 rillig
700 1.155 rillig if (level->bl_enclosing->bl_seen_named_member) {
701 1.155 rillig level->bl_brace = true;
702 1.155 rillig debug_step("ARRAY, seen named member, needs closing brace");
703 1.155 rillig }
704 1.155 rillig
705 1.155 rillig if (is_incomplete(level->bl_type) &&
706 1.155 rillig level->bl_enclosing->bl_enclosing != NULL) {
707 1.155 rillig /* initialization of an incomplete type */
708 1.155 rillig error(175);
709 1.155 rillig return false;
710 1.155 rillig }
711 1.155 rillig
712 1.155 rillig level->bl_subtype = level->bl_type->t_subt;
713 1.155 rillig level->bl_array_of_unknown_size = is_incomplete(level->bl_type);
714 1.155 rillig level->bl_remaining = level->bl_type->t_dim;
715 1.155 rillig debug_step("type '%s' remaining %d",
716 1.155 rillig type_name(level->bl_type), level->bl_remaining);
717 1.155 rillig return true;
718 1.155 rillig }
719 1.155 rillig
720 1.158 rillig /*
721 1.158 rillig * If the removed element was a structure member, we must go
722 1.158 rillig * to the next structure member.
723 1.158 rillig *
724 1.158 rillig * XXX: Nothing should ever be "removed" at this point.
725 1.158 rillig *
726 1.158 rillig * TODO: think of a better name than 'pop'
727 1.158 rillig */
728 1.158 rillig static void
729 1.158 rillig brace_level_pop_item_unnamed(struct brace_level *level)
730 1.158 rillig {
731 1.158 rillig if (level->bl_remaining > 0 && level->bl_type->t_tspec == STRUCT &&
732 1.158 rillig !level->bl_seen_named_member) {
733 1.158 rillig brace_level_next_member(level);
734 1.158 rillig level->bl_subtype = level->bl_next_member->s_type;
735 1.158 rillig }
736 1.158 rillig }
737 1.158 rillig
738 1.158 rillig static bool
739 1.158 rillig brace_level_check_too_many_initializers(struct brace_level *level)
740 1.158 rillig {
741 1.158 rillig if (level->bl_remaining > 0)
742 1.158 rillig return true;
743 1.158 rillig /*
744 1.158 rillig * FIXME: even with named members, there can be too many initializers
745 1.158 rillig */
746 1.158 rillig if (level->bl_array_of_unknown_size || level->bl_seen_named_member)
747 1.158 rillig return true;
748 1.158 rillig
749 1.158 rillig tspec_t t = level->bl_type->t_tspec;
750 1.158 rillig if (t == ARRAY) {
751 1.158 rillig /* too many array initializers, expected %d */
752 1.158 rillig error(173, level->bl_type->t_dim);
753 1.167 rillig } else if (is_struct_or_union(t)) {
754 1.158 rillig /* too many struct/union initializers */
755 1.158 rillig error(172);
756 1.158 rillig } else {
757 1.158 rillig /* too many initializers */
758 1.158 rillig error(174);
759 1.158 rillig }
760 1.158 rillig return false;
761 1.158 rillig }
762 1.158 rillig
763 1.160 rillig /* Extend an array of unknown size by one element */
764 1.160 rillig static void
765 1.160 rillig brace_level_extend_if_array_of_unknown_size(struct brace_level *level)
766 1.160 rillig {
767 1.160 rillig
768 1.160 rillig if (level->bl_remaining != 0)
769 1.160 rillig return;
770 1.160 rillig /*
771 1.160 rillig * XXX: According to the function name, there should be a 'return' if
772 1.160 rillig * bl_array_of_unknown_size is false. There's probably a test missing
773 1.160 rillig * for that case.
774 1.160 rillig */
775 1.160 rillig
776 1.160 rillig /*
777 1.160 rillig * The only place where an incomplete array may appear is at the
778 1.160 rillig * outermost aggregate level of the object to be initialized.
779 1.160 rillig */
780 1.160 rillig lint_assert(level->bl_enclosing->bl_enclosing == NULL);
781 1.160 rillig lint_assert(level->bl_type->t_tspec == ARRAY);
782 1.160 rillig
783 1.160 rillig debug_step("extending array of unknown size '%s'",
784 1.160 rillig type_name(level->bl_type));
785 1.160 rillig level->bl_remaining = 1;
786 1.160 rillig level->bl_type->t_dim++;
787 1.160 rillig setcomplete(level->bl_type, true);
788 1.160 rillig
789 1.160 rillig debug_step("extended type is '%s'", type_name(level->bl_type));
790 1.160 rillig }
791 1.158 rillig
792 1.146 rillig
793 1.146 rillig static struct initialization *
794 1.146 rillig initialization_new(sym_t *sym)
795 1.146 rillig {
796 1.146 rillig struct initialization *in = xcalloc(1, sizeof(*in));
797 1.146 rillig
798 1.176 rillig in->in_sym = sym;
799 1.146 rillig
800 1.146 rillig return in;
801 1.146 rillig }
802 1.74 rillig
803 1.146 rillig static void
804 1.146 rillig initialization_free(struct initialization *in)
805 1.146 rillig {
806 1.176 rillig struct brace_level *bl, *next;
807 1.146 rillig
808 1.176 rillig for (bl = in->in_brace_level; bl != NULL; bl = next) {
809 1.176 rillig next = bl->bl_enclosing;
810 1.176 rillig brace_level_free(bl);
811 1.146 rillig }
812 1.146 rillig
813 1.146 rillig free(in);
814 1.146 rillig }
815 1.146 rillig
816 1.146 rillig #ifdef DEBUG
817 1.119 rillig /*
818 1.119 rillig * TODO: only call debug_initstack after each push/pop.
819 1.119 rillig */
820 1.73 rillig static void
821 1.146 rillig initialization_debug(const struct initialization *in)
822 1.73 rillig {
823 1.176 rillig if (in->in_brace_level == NULL) {
824 1.139 rillig debug_step("no brace level in the current initialization");
825 1.73 rillig return;
826 1.73 rillig }
827 1.73 rillig
828 1.73 rillig size_t i = 0;
829 1.176 rillig for (const struct brace_level *level = in->in_brace_level;
830 1.139 rillig level != NULL; level = level->bl_enclosing) {
831 1.120 rillig debug_indent();
832 1.139 rillig debug_printf("brace level %zu: ", i);
833 1.146 rillig brace_level_debug(level);
834 1.73 rillig i++;
835 1.73 rillig }
836 1.73 rillig }
837 1.146 rillig #else
838 1.146 rillig #define initialization_debug(in) do { } while (false)
839 1.146 rillig #endif
840 1.146 rillig
841 1.1 cgd /*
842 1.89 rillig * Initialize the initialization stack by putting an entry for the object
843 1.1 cgd * which is to be initialized on it.
844 1.119 rillig *
845 1.158 rillig * TODO: merge into initialization_new if possible
846 1.1 cgd */
847 1.158 rillig static void
848 1.158 rillig initialization_init(struct initialization *in)
849 1.1 cgd {
850 1.176 rillig if (in->in_err)
851 1.1 cgd return;
852 1.1 cgd
853 1.70 rillig debug_enter();
854 1.38 rillig
855 1.1 cgd /*
856 1.77 rillig * If the type which is to be initialized is an incomplete array,
857 1.1 cgd * it must be duplicated.
858 1.1 cgd */
859 1.176 rillig if (in->in_sym->s_type->t_tspec == ARRAY && is_incomplete(in->in_sym->s_type))
860 1.176 rillig in->in_sym->s_type = duptyp(in->in_sym->s_type);
861 1.119 rillig /* TODO: does 'duptyp' create a memory leak? */
862 1.1 cgd
863 1.176 rillig in->in_brace_level = brace_level_new(NULL, in->in_sym->s_type, 1, NULL);
864 1.70 rillig
865 1.153 rillig initialization_debug(in);
866 1.70 rillig debug_leave();
867 1.1 cgd }
868 1.1 cgd
869 1.1 cgd static void
870 1.158 rillig initialization_set_error(struct initialization *in)
871 1.1 cgd {
872 1.176 rillig in->in_err = true;
873 1.158 rillig }
874 1.1 cgd
875 1.158 rillig /* TODO: document me */
876 1.158 rillig /* TODO: think of a better name than 'push' */
877 1.158 rillig static bool
878 1.158 rillig initialization_push_struct_or_union(struct initialization *in)
879 1.158 rillig {
880 1.176 rillig struct brace_level *level = in->in_brace_level;
881 1.158 rillig int cnt;
882 1.158 rillig sym_t *m;
883 1.68 rillig
884 1.158 rillig if (is_incomplete(level->bl_type)) {
885 1.158 rillig /* initialization of an incomplete type */
886 1.158 rillig error(175);
887 1.150 rillig initialization_set_error(in);
888 1.158 rillig return false;
889 1.104 rillig }
890 1.104 rillig
891 1.158 rillig cnt = 0;
892 1.176 rillig designation_debug(&in->in_designation);
893 1.158 rillig debug_step("lookup for '%s'%s",
894 1.158 rillig type_name(level->bl_type),
895 1.158 rillig level->bl_seen_named_member ? ", seen named member" : "");
896 1.158 rillig
897 1.176 rillig if (in->in_designation.dn_head != NULL)
898 1.173 rillig m = brace_level_look_up_first_member_named(level,
899 1.176 rillig in->in_designation.dn_head->dr_name, &cnt);
900 1.172 rillig else
901 1.173 rillig m = brace_level_look_up_first_member_unnamed(level, &cnt);
902 1.40 rillig
903 1.176 rillig if (in->in_designation.dn_head != NULL) {
904 1.158 rillig if (m == NULL) {
905 1.158 rillig debug_step("pop struct");
906 1.158 rillig return true;
907 1.158 rillig }
908 1.158 rillig level->bl_next_member = m;
909 1.158 rillig level->bl_subtype = m->s_type;
910 1.158 rillig level->bl_seen_named_member = true;
911 1.158 rillig debug_step("named member '%s'",
912 1.176 rillig in->in_designation.dn_head->dr_name);
913 1.176 rillig designation_shift_level(&in->in_designation);
914 1.158 rillig cnt = level->bl_type->t_tspec == STRUCT ? 2 : 1;
915 1.101 rillig }
916 1.158 rillig level->bl_brace = true;
917 1.158 rillig debug_step("unnamed element with type '%s'%s",
918 1.158 rillig type_name(
919 1.158 rillig level->bl_type != NULL ? level->bl_type : level->bl_subtype),
920 1.158 rillig level->bl_brace ? ", needs closing brace" : "");
921 1.158 rillig if (cnt == 0) {
922 1.158 rillig /* cannot init. struct/union with no named member */
923 1.158 rillig error(179);
924 1.158 rillig initialization_set_error(in);
925 1.158 rillig return false;
926 1.1 cgd }
927 1.158 rillig level->bl_remaining = level->bl_type->t_tspec == STRUCT ? cnt : 1;
928 1.158 rillig return false;
929 1.1 cgd }
930 1.1 cgd
931 1.165 rillig static void
932 1.165 rillig initialization_end_brace_level(struct initialization *in)
933 1.165 rillig {
934 1.176 rillig struct brace_level *level = in->in_brace_level;
935 1.176 rillig in->in_brace_level = level->bl_enclosing;
936 1.165 rillig brace_level_free(level);
937 1.165 rillig }
938 1.165 rillig
939 1.119 rillig /* TODO: document me */
940 1.119 rillig /* TODO: think of a better name than 'push' */
941 1.99 rillig static void
942 1.158 rillig initialization_push(struct initialization *in)
943 1.1 cgd {
944 1.165 rillig struct brace_level *level;
945 1.1 cgd
946 1.68 rillig debug_enter();
947 1.68 rillig
948 1.176 rillig brace_level_extend_if_array_of_unknown_size(in->in_brace_level);
949 1.97 rillig
950 1.176 rillig level = in->in_brace_level;
951 1.139 rillig lint_assert(level->bl_remaining > 0);
952 1.139 rillig
953 1.176 rillig in->in_brace_level = brace_level_new(brace_level_subtype(level), NULL, 0,
954 1.166 rillig level);
955 1.176 rillig lint_assert(in->in_brace_level->bl_type != NULL);
956 1.176 rillig lint_assert(in->in_brace_level->bl_type->t_tspec != FUNC);
957 1.1 cgd
958 1.12 christos again:
959 1.176 rillig level = in->in_brace_level;
960 1.1 cgd
961 1.139 rillig debug_step("expecting type '%s'", type_name(level->bl_type));
962 1.139 rillig lint_assert(level->bl_type != NULL);
963 1.139 rillig switch (level->bl_type->t_tspec) {
964 1.1 cgd case ARRAY:
965 1.176 rillig if (in->in_designation.dn_head != NULL) {
966 1.124 rillig debug_step("pop array, named member '%s'%s",
967 1.176 rillig in->in_designation.dn_head->dr_name,
968 1.139 rillig level->bl_brace ? ", needs closing brace" : "");
969 1.19 christos goto pop;
970 1.98 rillig }
971 1.98 rillig
972 1.155 rillig if (!brace_level_push_array(level))
973 1.155 rillig initialization_set_error(in);
974 1.99 rillig break;
975 1.20 christos
976 1.1 cgd case UNION:
977 1.1 cgd if (tflag)
978 1.89 rillig /* initialization of union is illegal in trad. C */
979 1.1 cgd warning(238);
980 1.1 cgd /* FALLTHROUGH */
981 1.1 cgd case STRUCT:
982 1.158 rillig if (initialization_push_struct_or_union(in))
983 1.99 rillig goto pop;
984 1.1 cgd break;
985 1.1 cgd default:
986 1.176 rillig if (in->in_designation.dn_head != NULL) {
987 1.100 rillig debug_step("pop scalar");
988 1.158 rillig pop:
989 1.165 rillig initialization_end_brace_level(in);
990 1.12 christos goto again;
991 1.12 christos }
992 1.100 rillig /* The initialization stack now expects a single scalar. */
993 1.139 rillig level->bl_remaining = 1;
994 1.1 cgd break;
995 1.1 cgd }
996 1.68 rillig
997 1.153 rillig initialization_debug(in);
998 1.68 rillig debug_leave();
999 1.1 cgd }
1000 1.1 cgd
1001 1.158 rillig /* TODO: document me */
1002 1.1 cgd static void
1003 1.158 rillig initialization_pop_item_named(struct initialization *in, const char *name)
1004 1.1 cgd {
1005 1.176 rillig struct brace_level *level = in->in_brace_level;
1006 1.158 rillig const sym_t *m;
1007 1.150 rillig
1008 1.119 rillig /*
1009 1.158 rillig * TODO: fix wording of the debug message; this doesn't seem to be
1010 1.158 rillig * related to initializing the named member.
1011 1.119 rillig */
1012 1.158 rillig debug_step("initializing named member '%s'", name);
1013 1.158 rillig
1014 1.167 rillig if (!is_struct_or_union(level->bl_type->t_tspec)) {
1015 1.158 rillig /* syntax error '%s' */
1016 1.158 rillig error(249, "named member must only be used with struct/union");
1017 1.158 rillig initialization_set_error(in);
1018 1.84 rillig return;
1019 1.158 rillig }
1020 1.158 rillig
1021 1.158 rillig m = brace_level_look_up_member(level, name);
1022 1.158 rillig if (m == NULL) {
1023 1.158 rillig /* TODO: add type information to the message */
1024 1.158 rillig /* undefined struct/union member: %s */
1025 1.158 rillig error(101, name);
1026 1.1 cgd
1027 1.176 rillig designation_shift_level(&in->in_designation);
1028 1.158 rillig level->bl_seen_named_member = true;
1029 1.158 rillig return;
1030 1.1 cgd }
1031 1.158 rillig
1032 1.158 rillig debug_step("found matching member");
1033 1.158 rillig level->bl_subtype = m->s_type;
1034 1.158 rillig /* XXX: why ++? */
1035 1.158 rillig level->bl_remaining++;
1036 1.158 rillig /* XXX: why is bl_seen_named_member not set? */
1037 1.176 rillig designation_shift_level(&in->in_designation);
1038 1.158 rillig }
1039 1.158 rillig
1040 1.158 rillig /* TODO: think of a better name than 'pop' */
1041 1.158 rillig static void
1042 1.158 rillig initialization_pop_item(struct initialization *in)
1043 1.158 rillig {
1044 1.158 rillig struct brace_level *level;
1045 1.158 rillig
1046 1.158 rillig debug_enter();
1047 1.158 rillig
1048 1.176 rillig level = in->in_brace_level;
1049 1.158 rillig debug_indent();
1050 1.158 rillig debug_printf("popping: ");
1051 1.158 rillig brace_level_debug(level);
1052 1.158 rillig
1053 1.176 rillig in->in_brace_level = level->bl_enclosing;
1054 1.158 rillig brace_level_free(level);
1055 1.176 rillig level = in->in_brace_level;
1056 1.158 rillig lint_assert(level != NULL);
1057 1.158 rillig
1058 1.158 rillig level->bl_remaining--;
1059 1.158 rillig lint_assert(level->bl_remaining >= 0);
1060 1.158 rillig debug_step("%d elements remaining", level->bl_remaining);
1061 1.158 rillig
1062 1.176 rillig if (in->in_designation.dn_head != NULL && in->in_designation.dn_head->dr_name != NULL)
1063 1.176 rillig initialization_pop_item_named(in, in->in_designation.dn_head->dr_name);
1064 1.158 rillig else
1065 1.158 rillig brace_level_pop_item_unnamed(level);
1066 1.158 rillig
1067 1.158 rillig initialization_debug(in);
1068 1.158 rillig debug_leave();
1069 1.158 rillig }
1070 1.158 rillig
1071 1.158 rillig /*
1072 1.158 rillig * Take all entries which cannot be used for further initializers from the
1073 1.158 rillig * stack, but do this only if they do not require a closing brace.
1074 1.158 rillig */
1075 1.158 rillig /* TODO: think of a better name than 'pop' */
1076 1.158 rillig static void
1077 1.158 rillig initialization_pop_nobrace(struct initialization *in)
1078 1.158 rillig {
1079 1.158 rillig
1080 1.158 rillig debug_enter();
1081 1.176 rillig while (!in->in_brace_level->bl_brace &&
1082 1.176 rillig in->in_brace_level->bl_remaining == 0 &&
1083 1.176 rillig !in->in_brace_level->bl_array_of_unknown_size)
1084 1.158 rillig initialization_pop_item(in);
1085 1.158 rillig debug_leave();
1086 1.1 cgd }
1087 1.1 cgd
1088 1.92 rillig /*
1089 1.92 rillig * Process a '{' in an initializer by starting the initialization of the
1090 1.139 rillig * nested data structure, with bl_type being the bl_subtype of the outer
1091 1.92 rillig * initialization level.
1092 1.92 rillig */
1093 1.1 cgd static void
1094 1.158 rillig initialization_next_brace(struct initialization *in)
1095 1.1 cgd {
1096 1.7 lukem
1097 1.68 rillig debug_enter();
1098 1.148 rillig initialization_debug(in);
1099 1.68 rillig
1100 1.176 rillig if (!in->in_err &&
1101 1.176 rillig !brace_level_check_too_many_initializers(in->in_brace_level))
1102 1.158 rillig initialization_set_error(in);
1103 1.158 rillig
1104 1.176 rillig if (!in->in_err)
1105 1.158 rillig initialization_push(in);
1106 1.158 rillig
1107 1.176 rillig if (!in->in_err) {
1108 1.176 rillig in->in_brace_level->bl_brace = true;
1109 1.176 rillig designation_debug(&in->in_designation);
1110 1.176 rillig if (in->in_brace_level->bl_type != NULL)
1111 1.162 rillig debug_step("expecting type '%s'",
1112 1.176 rillig type_name(in->in_brace_level->bl_type));
1113 1.37 rillig }
1114 1.68 rillig
1115 1.153 rillig initialization_debug(in);
1116 1.68 rillig debug_leave();
1117 1.37 rillig }
1118 1.37 rillig
1119 1.37 rillig static void
1120 1.164 rillig check_no_auto_aggregate(scl_t sclass, const struct brace_level *level)
1121 1.164 rillig {
1122 1.164 rillig if (!tflag)
1123 1.164 rillig return;
1124 1.164 rillig if (!(sclass == AUTO || sclass == REG))
1125 1.164 rillig return;
1126 1.164 rillig if (!(level->bl_enclosing == NULL))
1127 1.164 rillig return;
1128 1.164 rillig if (is_scalar(level->bl_subtype->t_tspec))
1129 1.164 rillig return;
1130 1.164 rillig
1131 1.164 rillig /* no automatic aggregate initialization in trad. C */
1132 1.164 rillig warning(188);
1133 1.164 rillig }
1134 1.164 rillig
1135 1.164 rillig static void
1136 1.158 rillig initialization_lbrace(struct initialization *in)
1137 1.37 rillig {
1138 1.176 rillig if (in->in_err)
1139 1.1 cgd return;
1140 1.1 cgd
1141 1.68 rillig debug_enter();
1142 1.148 rillig initialization_debug(in);
1143 1.68 rillig
1144 1.176 rillig check_no_auto_aggregate(in->in_sym->s_scl, in->in_brace_level);
1145 1.1 cgd
1146 1.1 cgd /*
1147 1.1 cgd * Remove all entries which cannot be used for further initializers
1148 1.1 cgd * and do not expect a closing brace.
1149 1.1 cgd */
1150 1.158 rillig initialization_pop_nobrace(in);
1151 1.1 cgd
1152 1.158 rillig initialization_next_brace(in);
1153 1.68 rillig
1154 1.148 rillig initialization_debug(in);
1155 1.68 rillig debug_leave();
1156 1.1 cgd }
1157 1.1 cgd
1158 1.92 rillig /*
1159 1.92 rillig * Process a '}' in an initializer by finishing the current level of the
1160 1.92 rillig * initialization stack.
1161 1.158 rillig *
1162 1.158 rillig * Take all entries, including the first which requires a closing brace,
1163 1.158 rillig * from the stack.
1164 1.92 rillig */
1165 1.158 rillig static void
1166 1.158 rillig initialization_rbrace(struct initialization *in)
1167 1.1 cgd {
1168 1.158 rillig bool brace;
1169 1.150 rillig
1170 1.176 rillig if (in->in_err)
1171 1.1 cgd return;
1172 1.1 cgd
1173 1.68 rillig debug_enter();
1174 1.158 rillig do {
1175 1.176 rillig brace = in->in_brace_level->bl_brace;
1176 1.158 rillig /* TODO: improve wording of the debug message */
1177 1.158 rillig debug_step("loop brace=%d", brace);
1178 1.158 rillig initialization_pop_item(in);
1179 1.158 rillig } while (!brace);
1180 1.158 rillig initialization_debug(in);
1181 1.68 rillig debug_leave();
1182 1.1 cgd }
1183 1.1 cgd
1184 1.114 rillig /*
1185 1.158 rillig * A sub-object of an array is initialized using a designator. This does not
1186 1.158 rillig * have to be an array element directly, it can also be used to initialize
1187 1.158 rillig * only a sub-object of the array element.
1188 1.158 rillig *
1189 1.158 rillig * C99 example: struct { int member[4]; } var = { [2] = 12345 };
1190 1.158 rillig *
1191 1.158 rillig * GNU example: struct { int member[4]; } var = { [1 ... 3] = 12345 };
1192 1.158 rillig *
1193 1.158 rillig * TODO: test the following initialization with an outer and an inner type:
1194 1.158 rillig *
1195 1.158 rillig * .deeply[0].nested = {
1196 1.158 rillig * .deeply[1].nested = {
1197 1.158 rillig * 12345,
1198 1.158 rillig * },
1199 1.158 rillig * }
1200 1.114 rillig */
1201 1.116 rillig static void
1202 1.158 rillig initialization_add_designator_subscript(struct initialization *in,
1203 1.158 rillig range_t range)
1204 1.116 rillig {
1205 1.158 rillig struct brace_level *level;
1206 1.1 cgd
1207 1.68 rillig debug_enter();
1208 1.158 rillig if (range.lo == range.hi)
1209 1.158 rillig debug_step("subscript is %zu", range.hi);
1210 1.158 rillig else
1211 1.158 rillig debug_step("subscript range is %zu ... %zu",
1212 1.158 rillig range.lo, range.hi);
1213 1.55 rillig
1214 1.158 rillig /* XXX: This call is wrong here, it must be somewhere else. */
1215 1.158 rillig initialization_pop_nobrace(in);
1216 1.1 cgd
1217 1.176 rillig level = in->in_brace_level;
1218 1.158 rillig if (level->bl_array_of_unknown_size) {
1219 1.158 rillig /* No +1 here, extend_if_array_of_unknown_size will add it. */
1220 1.158 rillig int auto_dim = (int)range.hi;
1221 1.158 rillig if (auto_dim > level->bl_type->t_dim)
1222 1.158 rillig brace_level_set_array_dimension(level, auto_dim);
1223 1.68 rillig }
1224 1.1 cgd
1225 1.68 rillig debug_leave();
1226 1.1 cgd }
1227 1.1 cgd
1228 1.82 rillig /* Initialize a character array or wchar_t array with a string literal. */
1229 1.62 rillig static bool
1230 1.158 rillig initialization_init_array_using_string(struct initialization *in, tnode_t *tn)
1231 1.1 cgd {
1232 1.139 rillig struct brace_level *level;
1233 1.1 cgd strg_t *strg;
1234 1.1 cgd
1235 1.1 cgd if (tn->tn_op != STRING)
1236 1.63 rillig return false;
1237 1.1 cgd
1238 1.68 rillig debug_enter();
1239 1.68 rillig
1240 1.176 rillig level = in->in_brace_level;
1241 1.47 rillig strg = tn->tn_string;
1242 1.1 cgd
1243 1.1 cgd /*
1244 1.1 cgd * Check if we have an array type which can be initialized by
1245 1.1 cgd * the string.
1246 1.1 cgd */
1247 1.170 rillig if (is_string_array(level->bl_subtype, strg->st_tspec)) {
1248 1.168 rillig debug_step("subtype is an array");
1249 1.119 rillig
1250 1.1 cgd /* Put the array at top of stack */
1251 1.158 rillig initialization_push(in);
1252 1.176 rillig level = in->in_brace_level;
1253 1.119 rillig
1254 1.170 rillig } else if (is_string_array(level->bl_type, strg->st_tspec)) {
1255 1.168 rillig debug_step("type is an array");
1256 1.119 rillig
1257 1.119 rillig /*
1258 1.1 cgd * If the array is already partly initialized, we are
1259 1.1 cgd * wrong here.
1260 1.1 cgd */
1261 1.170 rillig if (level->bl_remaining != level->bl_type->t_dim)
1262 1.170 rillig goto nope;
1263 1.170 rillig } else
1264 1.170 rillig goto nope;
1265 1.1 cgd
1266 1.139 rillig if (level->bl_array_of_unknown_size) {
1267 1.139 rillig level->bl_array_of_unknown_size = false;
1268 1.171 rillig level->bl_type->t_dim = (int)(strg->st_len + 1);
1269 1.139 rillig setcomplete(level->bl_type, true);
1270 1.1 cgd } else {
1271 1.119 rillig /*
1272 1.119 rillig * TODO: check for buffer overflow in the object to be
1273 1.119 rillig * initialized
1274 1.119 rillig */
1275 1.119 rillig /* XXX: double-check for off-by-one error */
1276 1.171 rillig if (level->bl_type->t_dim < (int)strg->st_len) {
1277 1.1 cgd /* non-null byte ignored in string initializer */
1278 1.1 cgd warning(187);
1279 1.1 cgd }
1280 1.119 rillig
1281 1.119 rillig /*
1282 1.119 rillig * TODO: C99 6.7.8p14 allows a string literal to be enclosed
1283 1.119 rillig * in optional redundant braces, just like scalars. Add tests
1284 1.119 rillig * for this.
1285 1.119 rillig */
1286 1.1 cgd }
1287 1.1 cgd
1288 1.1 cgd /* In every case the array is initialized completely. */
1289 1.139 rillig level->bl_remaining = 0;
1290 1.1 cgd
1291 1.153 rillig initialization_debug(in);
1292 1.68 rillig debug_leave();
1293 1.63 rillig return true;
1294 1.170 rillig nope:
1295 1.170 rillig debug_leave();
1296 1.170 rillig return false;
1297 1.1 cgd }
1298 1.158 rillig
1299 1.158 rillig /*
1300 1.158 rillig * Initialize a non-array object with automatic storage duration and only a
1301 1.158 rillig * single initializer expression without braces by delegating to ASSIGN.
1302 1.158 rillig */
1303 1.158 rillig static bool
1304 1.158 rillig initialization_init_using_assign(struct initialization *in, tnode_t *rn)
1305 1.158 rillig {
1306 1.158 rillig tnode_t *ln, *tn;
1307 1.158 rillig
1308 1.176 rillig if (in->in_sym->s_type->t_tspec == ARRAY)
1309 1.158 rillig return false;
1310 1.176 rillig if (in->in_brace_level->bl_enclosing != NULL)
1311 1.158 rillig return false;
1312 1.158 rillig
1313 1.158 rillig debug_step("handing over to ASSIGN");
1314 1.158 rillig
1315 1.176 rillig ln = new_name_node(in->in_sym, 0);
1316 1.158 rillig ln->tn_type = tduptyp(ln->tn_type);
1317 1.158 rillig ln->tn_type->t_const = false;
1318 1.158 rillig
1319 1.158 rillig tn = build(ASSIGN, ln, rn);
1320 1.158 rillig expr(tn, false, false, false, false);
1321 1.158 rillig
1322 1.158 rillig /* XXX: why not clean up the initstack here already? */
1323 1.158 rillig return true;
1324 1.158 rillig }
1325 1.158 rillig
1326 1.158 rillig /* TODO: document me, or think of a better name */
1327 1.158 rillig static void
1328 1.158 rillig initialization_next_nobrace(struct initialization *in, tnode_t *tn)
1329 1.158 rillig {
1330 1.158 rillig debug_enter();
1331 1.158 rillig
1332 1.176 rillig if (in->in_brace_level->bl_type == NULL &&
1333 1.176 rillig !is_scalar(in->in_brace_level->bl_subtype->t_tspec)) {
1334 1.158 rillig /* {}-enclosed initializer required */
1335 1.158 rillig error(181);
1336 1.158 rillig /* XXX: maybe set initerr here */
1337 1.158 rillig }
1338 1.158 rillig
1339 1.176 rillig if (!in->in_err &&
1340 1.176 rillig !brace_level_check_too_many_initializers(in->in_brace_level))
1341 1.158 rillig initialization_set_error(in);
1342 1.158 rillig
1343 1.176 rillig while (!in->in_err) {
1344 1.176 rillig struct brace_level *level = in->in_brace_level;
1345 1.158 rillig
1346 1.158 rillig if (tn->tn_type->t_tspec == STRUCT &&
1347 1.158 rillig level->bl_type == tn->tn_type &&
1348 1.158 rillig level->bl_enclosing != NULL &&
1349 1.158 rillig level->bl_enclosing->bl_enclosing != NULL) {
1350 1.158 rillig level->bl_brace = false;
1351 1.158 rillig level->bl_remaining = 1; /* the struct itself */
1352 1.158 rillig break;
1353 1.158 rillig }
1354 1.158 rillig
1355 1.158 rillig if (level->bl_type != NULL &&
1356 1.158 rillig is_scalar(level->bl_type->t_tspec))
1357 1.158 rillig break;
1358 1.158 rillig initialization_push(in);
1359 1.158 rillig }
1360 1.158 rillig
1361 1.158 rillig initialization_debug(in);
1362 1.158 rillig debug_leave();
1363 1.158 rillig }
1364 1.158 rillig
1365 1.158 rillig static void
1366 1.158 rillig initialization_expr(struct initialization *in, tnode_t *tn)
1367 1.158 rillig {
1368 1.158 rillig
1369 1.158 rillig debug_enter();
1370 1.158 rillig initialization_debug(in);
1371 1.176 rillig designation_debug(&in->in_designation);
1372 1.158 rillig debug_step("expr:");
1373 1.158 rillig debug_node(tn, debug_ind + 1);
1374 1.158 rillig
1375 1.176 rillig if (in->in_err || tn == NULL)
1376 1.158 rillig goto done;
1377 1.158 rillig
1378 1.177 rillig if (has_automatic_storage_duration(in->in_sym) &&
1379 1.158 rillig initialization_init_using_assign(in, tn))
1380 1.158 rillig goto done;
1381 1.158 rillig
1382 1.158 rillig initialization_pop_nobrace(in);
1383 1.158 rillig
1384 1.158 rillig if (initialization_init_array_using_string(in, tn)) {
1385 1.158 rillig debug_step("after initializing the string:");
1386 1.169 rillig goto done_debug;
1387 1.158 rillig }
1388 1.158 rillig
1389 1.158 rillig initialization_next_nobrace(in, tn);
1390 1.176 rillig if (in->in_err || tn == NULL)
1391 1.169 rillig goto done_debug;
1392 1.169 rillig
1393 1.169 rillig /* Using initsym here is better than nothing. */
1394 1.177 rillig check_init_expr(in->in_brace_level->bl_type, in->in_sym, tn);
1395 1.158 rillig
1396 1.176 rillig in->in_brace_level->bl_remaining--;
1397 1.176 rillig debug_step("%d elements remaining", in->in_brace_level->bl_remaining);
1398 1.158 rillig
1399 1.169 rillig done_debug:
1400 1.158 rillig initialization_debug(in);
1401 1.158 rillig
1402 1.158 rillig done:
1403 1.176 rillig while (in->in_designation.dn_head != NULL)
1404 1.176 rillig designation_shift_level(&in->in_designation);
1405 1.158 rillig
1406 1.158 rillig debug_leave();
1407 1.158 rillig }
1408 1.158 rillig
1409 1.158 rillig static struct initialization *
1410 1.158 rillig current_init(void)
1411 1.158 rillig {
1412 1.175 rillig
1413 1.158 rillig lint_assert(init != NULL);
1414 1.158 rillig return init;
1415 1.158 rillig }
1416 1.158 rillig
1417 1.158 rillig bool *
1418 1.158 rillig current_initerr(void)
1419 1.158 rillig {
1420 1.175 rillig
1421 1.176 rillig return ¤t_init()->in_err;
1422 1.158 rillig }
1423 1.158 rillig
1424 1.158 rillig sym_t **
1425 1.158 rillig current_initsym(void)
1426 1.158 rillig {
1427 1.175 rillig
1428 1.176 rillig return ¤t_init()->in_sym;
1429 1.158 rillig }
1430 1.158 rillig
1431 1.158 rillig void
1432 1.158 rillig begin_initialization(sym_t *sym)
1433 1.158 rillig {
1434 1.158 rillig struct initialization *in;
1435 1.158 rillig
1436 1.158 rillig debug_step("begin initialization of '%s'", type_name(sym->s_type));
1437 1.158 rillig in = initialization_new(sym);
1438 1.176 rillig in->in_next = init;
1439 1.158 rillig init = in;
1440 1.158 rillig }
1441 1.158 rillig
1442 1.158 rillig void
1443 1.158 rillig end_initialization(void)
1444 1.158 rillig {
1445 1.158 rillig struct initialization *in;
1446 1.158 rillig
1447 1.158 rillig in = init;
1448 1.176 rillig init = init->in_next;
1449 1.158 rillig initialization_free(in);
1450 1.158 rillig debug_step("end initialization");
1451 1.158 rillig }
1452 1.158 rillig
1453 1.158 rillig void
1454 1.158 rillig add_designator_member(sbuf_t *sb)
1455 1.158 rillig {
1456 1.175 rillig
1457 1.176 rillig designation_add(¤t_init()->in_designation,
1458 1.158 rillig designator_new(sb->sb_name));
1459 1.158 rillig }
1460 1.158 rillig
1461 1.158 rillig void
1462 1.158 rillig add_designator_subscript(range_t range)
1463 1.158 rillig {
1464 1.175 rillig
1465 1.158 rillig initialization_add_designator_subscript(current_init(), range);
1466 1.158 rillig }
1467 1.158 rillig
1468 1.158 rillig void
1469 1.158 rillig initstack_init(void)
1470 1.158 rillig {
1471 1.175 rillig
1472 1.158 rillig initialization_init(current_init());
1473 1.158 rillig }
1474 1.158 rillig
1475 1.158 rillig void
1476 1.158 rillig init_lbrace(void)
1477 1.158 rillig {
1478 1.175 rillig
1479 1.158 rillig initialization_lbrace(current_init());
1480 1.158 rillig }
1481 1.158 rillig
1482 1.158 rillig void
1483 1.158 rillig init_using_expr(tnode_t *tn)
1484 1.158 rillig {
1485 1.175 rillig
1486 1.158 rillig initialization_expr(current_init(), tn);
1487 1.158 rillig }
1488 1.158 rillig
1489 1.158 rillig void
1490 1.158 rillig init_rbrace(void)
1491 1.158 rillig {
1492 1.175 rillig
1493 1.158 rillig initialization_rbrace(current_init());
1494 1.158 rillig }
1495