init.c revision 1.146 1 1.146 rillig /* $NetBSD: init.c,v 1.146 2021/03/28 08:30:22 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.146 rillig __RCSID("$NetBSD: init.c,v 1.146 2021/03/28 08:30:22 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.131 rillig * designation_add_name for each '.member' before '='
76 1.131 rillig * designation_add_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.128 rillig const char *name; /* for struct and union */
220 1.128 rillig /* TODO: add 'subscript' for arrays */
221 1.128 rillig struct designator *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.140 rillig struct designator *head;
233 1.140 rillig struct designator *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.110 rillig bool initerr;
244 1.110 rillig
245 1.139 rillig /* The symbol that is to be initialized. */
246 1.110 rillig sym_t *initsym;
247 1.53 rillig
248 1.139 rillig /* The innermost brace level. */
249 1.139 rillig struct brace_level *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.140 rillig struct designation designation;
256 1.1 cgd
257 1.110 rillig struct initialization *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.145 rillig #ifdef DEBUG
264 1.145 rillig static int debug_ind = 0;
265 1.145 rillig #endif
266 1.145 rillig
267 1.145 rillig
268 1.145 rillig #ifdef DEBUG
269 1.145 rillig
270 1.145 rillig static void __printflike(1, 2)
271 1.145 rillig debug_printf(const char *fmt, ...)
272 1.145 rillig {
273 1.145 rillig va_list va;
274 1.145 rillig
275 1.145 rillig va_start(va, fmt);
276 1.145 rillig vfprintf(stdout, fmt, va);
277 1.145 rillig va_end(va);
278 1.145 rillig }
279 1.145 rillig
280 1.145 rillig static void
281 1.145 rillig debug_indent(void)
282 1.145 rillig {
283 1.145 rillig debug_printf("%*s", 2 * debug_ind, "");
284 1.145 rillig }
285 1.145 rillig
286 1.145 rillig static void
287 1.145 rillig debug_enter(const char *func)
288 1.145 rillig {
289 1.145 rillig printf("%*s+ %s\n", 2 * debug_ind++, "", func);
290 1.145 rillig }
291 1.145 rillig
292 1.145 rillig static void __printflike(1, 2)
293 1.145 rillig debug_step(const char *fmt, ...)
294 1.145 rillig {
295 1.145 rillig va_list va;
296 1.145 rillig
297 1.145 rillig debug_indent();
298 1.145 rillig va_start(va, fmt);
299 1.145 rillig vfprintf(stdout, fmt, va);
300 1.145 rillig va_end(va);
301 1.145 rillig printf("\n");
302 1.145 rillig }
303 1.145 rillig
304 1.145 rillig static void
305 1.145 rillig debug_leave(const char *func)
306 1.145 rillig {
307 1.145 rillig printf("%*s- %s\n", 2 * --debug_ind, "", func);
308 1.145 rillig }
309 1.145 rillig
310 1.145 rillig #else
311 1.145 rillig
312 1.145 rillig #define debug_printf(fmt, ...) do { } while (false)
313 1.145 rillig #define debug_indent() do { } while (false)
314 1.145 rillig #define debug_enter(function) do { } while (false)
315 1.145 rillig #define debug_step(fmt, ...) do { } while (false)
316 1.145 rillig #define debug_leave(function) do { } while (false)
317 1.145 rillig
318 1.145 rillig #endif
319 1.145 rillig
320 1.1 cgd
321 1.146 rillig static struct designator *
322 1.146 rillig designator_new(const char *name)
323 1.135 rillig {
324 1.146 rillig struct designator *d = xcalloc(1, sizeof *d);
325 1.146 rillig d->name = name;
326 1.146 rillig return d;
327 1.135 rillig }
328 1.119 rillig
329 1.146 rillig static void
330 1.146 rillig designator_free(struct designator *d)
331 1.110 rillig {
332 1.146 rillig free(d);
333 1.110 rillig }
334 1.110 rillig
335 1.110 rillig
336 1.146 rillig #ifdef DEBUG
337 1.146 rillig static void
338 1.146 rillig designation_debug(const struct designation *dn)
339 1.110 rillig {
340 1.146 rillig const struct designator *p;
341 1.110 rillig
342 1.146 rillig if (dn->head == NULL)
343 1.146 rillig return;
344 1.123 rillig
345 1.146 rillig debug_indent();
346 1.146 rillig debug_printf("designation: ");
347 1.146 rillig for (p = dn->head; p != NULL; p = p->next)
348 1.146 rillig debug_printf(".%s", p->name);
349 1.146 rillig debug_printf("\n");
350 1.110 rillig }
351 1.146 rillig #else
352 1.146 rillig #define designation_debug(dn) do { } while (false)
353 1.146 rillig #endif
354 1.110 rillig
355 1.121 rillig static void
356 1.146 rillig designation_add(struct designation *dn, struct designator *dr)
357 1.121 rillig {
358 1.121 rillig
359 1.146 rillig if (dn->head != NULL) {
360 1.146 rillig dn->tail->next = dr;
361 1.146 rillig dn->tail = dr;
362 1.146 rillig } else {
363 1.146 rillig dn->head = dr;
364 1.146 rillig dn->tail = dr;
365 1.121 rillig }
366 1.121 rillig
367 1.146 rillig designation_debug(dn);
368 1.121 rillig }
369 1.121 rillig
370 1.146 rillig /* TODO: add support for array subscripts, not only named members */
371 1.146 rillig /*
372 1.146 rillig * TODO: This function should not be necessary at all. There is no need to
373 1.146 rillig * remove the head of the list.
374 1.146 rillig */
375 1.141 rillig static void
376 1.146 rillig designation_shift_level(struct designation *dn)
377 1.141 rillig {
378 1.146 rillig lint_assert(dn->head != NULL);
379 1.141 rillig
380 1.146 rillig if (dn->head == dn->tail) {
381 1.146 rillig designator_free(dn->head);
382 1.146 rillig dn->head = NULL;
383 1.146 rillig dn->tail = NULL;
384 1.146 rillig } else {
385 1.146 rillig struct designator *head = dn->head;
386 1.146 rillig dn->head = dn->head->next;
387 1.146 rillig designator_free(head);
388 1.146 rillig }
389 1.110 rillig
390 1.146 rillig designation_debug(dn);
391 1.146 rillig }
392 1.90 rillig
393 1.1 cgd
394 1.146 rillig #ifdef DEBUG
395 1.119 rillig /*
396 1.119 rillig * TODO: only log the top of the stack after each modifying operation
397 1.119 rillig *
398 1.139 rillig * TODO: wrap all write accesses to brace_level in setter functions
399 1.119 rillig */
400 1.78 rillig static void
401 1.146 rillig brace_level_debug(const struct brace_level *level)
402 1.74 rillig {
403 1.139 rillig if (level->bl_type != NULL)
404 1.139 rillig debug_printf("type '%s'", type_name(level->bl_type));
405 1.139 rillig if (level->bl_type != NULL && level->bl_subtype != NULL)
406 1.120 rillig debug_printf(", ");
407 1.139 rillig if (level->bl_subtype != NULL)
408 1.139 rillig debug_printf("subtype '%s'", type_name(level->bl_subtype));
409 1.78 rillig
410 1.139 rillig if (level->bl_brace)
411 1.120 rillig debug_printf(", needs closing brace");
412 1.139 rillig if (level->bl_array_of_unknown_size)
413 1.120 rillig debug_printf(", array of unknown size");
414 1.139 rillig if (level->bl_seen_named_member)
415 1.120 rillig debug_printf(", seen named member");
416 1.78 rillig
417 1.139 rillig const type_t *eff_type = level->bl_type != NULL
418 1.139 rillig ? level->bl_type : level->bl_subtype;
419 1.139 rillig if (eff_type->t_tspec == STRUCT && level->bl_next_member != NULL)
420 1.125 rillig debug_printf(", next member '%s'",
421 1.139 rillig level->bl_next_member->s_name);
422 1.78 rillig
423 1.139 rillig debug_printf(", remaining %d\n", level->bl_remaining);
424 1.74 rillig }
425 1.146 rillig #else
426 1.146 rillig #define brace_level_debug(level) do { } while (false)
427 1.146 rillig #endif
428 1.146 rillig
429 1.146 rillig
430 1.146 rillig static struct initialization *
431 1.146 rillig initialization_new(sym_t *sym)
432 1.146 rillig {
433 1.146 rillig struct initialization *in = xcalloc(1, sizeof(*in));
434 1.146 rillig
435 1.146 rillig in->initsym = sym;
436 1.146 rillig
437 1.146 rillig return in;
438 1.146 rillig }
439 1.74 rillig
440 1.146 rillig static void
441 1.146 rillig initialization_free(struct initialization *in)
442 1.146 rillig {
443 1.146 rillig struct brace_level *level, *next;
444 1.146 rillig
445 1.146 rillig for (level = in->brace_level; level != NULL; level = next) {
446 1.146 rillig next = level->bl_enclosing;
447 1.146 rillig free(level);
448 1.146 rillig }
449 1.146 rillig
450 1.146 rillig free(in);
451 1.146 rillig }
452 1.146 rillig
453 1.146 rillig #ifdef DEBUG
454 1.119 rillig /*
455 1.119 rillig * TODO: only call debug_initstack after each push/pop.
456 1.119 rillig */
457 1.73 rillig static void
458 1.146 rillig initialization_debug(const struct initialization *in)
459 1.73 rillig {
460 1.146 rillig if (in->brace_level == NULL) {
461 1.139 rillig debug_step("no brace level in the current initialization");
462 1.73 rillig return;
463 1.73 rillig }
464 1.73 rillig
465 1.73 rillig size_t i = 0;
466 1.146 rillig for (const struct brace_level *level = in->brace_level;
467 1.139 rillig level != NULL; level = level->bl_enclosing) {
468 1.120 rillig debug_indent();
469 1.139 rillig debug_printf("brace level %zu: ", i);
470 1.146 rillig brace_level_debug(level);
471 1.73 rillig i++;
472 1.73 rillig }
473 1.73 rillig }
474 1.146 rillig #else
475 1.146 rillig #define initialization_debug(in) do { } while (false)
476 1.146 rillig #endif
477 1.146 rillig
478 1.146 rillig /* XXX: unnecessary prototype since it is not recursive */
479 1.146 rillig static bool init_array_using_string(tnode_t *);
480 1.146 rillig
481 1.146 rillig
482 1.146 rillig static struct initialization *
483 1.146 rillig current_init(void)
484 1.146 rillig {
485 1.146 rillig lint_assert(init != NULL);
486 1.146 rillig return init;
487 1.146 rillig }
488 1.146 rillig
489 1.146 rillig bool *
490 1.146 rillig current_initerr(void)
491 1.146 rillig {
492 1.146 rillig return ¤t_init()->initerr;
493 1.146 rillig }
494 1.146 rillig
495 1.146 rillig sym_t **
496 1.146 rillig current_initsym(void)
497 1.146 rillig {
498 1.146 rillig return ¤t_init()->initsym;
499 1.146 rillig }
500 1.146 rillig
501 1.146 rillig static struct designation *
502 1.146 rillig current_designation_mod(void)
503 1.146 rillig {
504 1.146 rillig return ¤t_init()->designation;
505 1.146 rillig }
506 1.146 rillig
507 1.146 rillig static struct designation
508 1.146 rillig current_designation(void)
509 1.146 rillig {
510 1.146 rillig return *current_designation_mod();
511 1.146 rillig }
512 1.146 rillig
513 1.146 rillig static const struct brace_level *
514 1.146 rillig current_brace_level(void)
515 1.146 rillig {
516 1.146 rillig return current_init()->brace_level;
517 1.146 rillig }
518 1.146 rillig
519 1.146 rillig static struct brace_level **
520 1.146 rillig current_brace_level_lvalue(void)
521 1.146 rillig {
522 1.146 rillig return ¤t_init()->brace_level;
523 1.146 rillig }
524 1.146 rillig
525 1.146 rillig static void
526 1.146 rillig set_initerr(void)
527 1.146 rillig {
528 1.146 rillig current_init()->initerr = true;
529 1.146 rillig }
530 1.146 rillig
531 1.146 rillig #define initerr (*current_initerr())
532 1.146 rillig #define initsym (*current_initsym())
533 1.146 rillig #define brace_level_rvalue (current_brace_level())
534 1.146 rillig #define brace_level_lvalue (*current_brace_level_lvalue())
535 1.146 rillig
536 1.146 rillig #ifndef DEBUG
537 1.146 rillig
538 1.146 rillig #define debug_designation() do { } while (false)
539 1.146 rillig #define debug_brace_level(level) do { } while (false)
540 1.146 rillig #define debug_initstack() do { } while (false)
541 1.146 rillig
542 1.146 rillig #else
543 1.146 rillig
544 1.90 rillig
545 1.90 rillig #define debug_enter() debug_enter(__func__)
546 1.90 rillig #define debug_leave() debug_leave(__func__)
547 1.90 rillig
548 1.73 rillig #endif
549 1.73 rillig
550 1.111 rillig
551 1.111 rillig void
552 1.111 rillig begin_initialization(sym_t *sym)
553 1.111 rillig {
554 1.111 rillig struct initialization *curr_init;
555 1.111 rillig
556 1.118 rillig debug_step("begin initialization of '%s'", type_name(sym->s_type));
557 1.146 rillig curr_init = initialization_new(sym);
558 1.111 rillig curr_init->next = init;
559 1.111 rillig init = curr_init;
560 1.111 rillig }
561 1.111 rillig
562 1.111 rillig void
563 1.111 rillig end_initialization(void)
564 1.111 rillig {
565 1.111 rillig struct initialization *curr_init;
566 1.111 rillig
567 1.111 rillig curr_init = init;
568 1.111 rillig init = init->next;
569 1.146 rillig initialization_free(curr_init);
570 1.111 rillig debug_step("end initialization");
571 1.111 rillig }
572 1.111 rillig
573 1.106 rillig
574 1.90 rillig
575 1.142 rillig void
576 1.142 rillig designation_add_name(sbuf_t *sb)
577 1.142 rillig {
578 1.146 rillig designation_add(current_designation_mod(),
579 1.146 rillig designator_new(sb->sb_name));
580 1.142 rillig }
581 1.142 rillig
582 1.133 rillig /* TODO: Move the function body up here, to avoid the forward declaration. */
583 1.133 rillig static void initstack_pop_nobrace(void);
584 1.133 rillig
585 1.143 rillig static struct brace_level *
586 1.143 rillig brace_level_new(type_t *type, type_t *subtype, int remaining)
587 1.143 rillig {
588 1.143 rillig struct brace_level *level = xcalloc(1, sizeof(*level));
589 1.143 rillig
590 1.143 rillig level->bl_type = type;
591 1.143 rillig level->bl_subtype = subtype;
592 1.143 rillig level->bl_remaining = remaining;
593 1.143 rillig
594 1.143 rillig return level;
595 1.143 rillig }
596 1.143 rillig
597 1.143 rillig static const sym_t *
598 1.143 rillig brace_level_look_up_member(const char *name)
599 1.143 rillig {
600 1.143 rillig const type_t *tp = current_brace_level()->bl_type;
601 1.143 rillig const sym_t *m;
602 1.143 rillig
603 1.143 rillig lint_assert(tp->t_tspec == STRUCT || tp->t_tspec == UNION);
604 1.143 rillig
605 1.143 rillig for (m = tp->t_str->sou_first_member; m != NULL; m = m->s_next) {
606 1.143 rillig if (m->s_bitfield && m->s_name == unnamed)
607 1.143 rillig continue;
608 1.143 rillig if (strcmp(m->s_name, name) == 0)
609 1.143 rillig return m;
610 1.143 rillig }
611 1.143 rillig
612 1.143 rillig return NULL;
613 1.143 rillig }
614 1.143 rillig
615 1.142 rillig static void
616 1.142 rillig brace_level_set_array_dimension(int dim)
617 1.142 rillig {
618 1.142 rillig debug_step("setting the array size to %d", dim);
619 1.142 rillig brace_level_lvalue->bl_type->t_dim = dim;
620 1.142 rillig debug_indent();
621 1.146 rillig brace_level_debug(brace_level_rvalue);
622 1.142 rillig }
623 1.142 rillig
624 1.144 rillig static void
625 1.144 rillig brace_level_next_member(struct brace_level *level)
626 1.144 rillig {
627 1.144 rillig const sym_t *m;
628 1.144 rillig
629 1.144 rillig do {
630 1.144 rillig m = level->bl_next_member = level->bl_next_member->s_next;
631 1.144 rillig /* XXX: can this assertion be made to fail? */
632 1.144 rillig lint_assert(m != NULL);
633 1.144 rillig } while (m->s_bitfield && m->s_name == unnamed);
634 1.144 rillig
635 1.144 rillig debug_indent();
636 1.146 rillig brace_level_debug(level);
637 1.144 rillig }
638 1.144 rillig
639 1.91 rillig /*
640 1.119 rillig * A sub-object of an array is initialized using a designator. This does not
641 1.119 rillig * have to be an array element directly, it can also be used to initialize
642 1.119 rillig * only a sub-object of the array element.
643 1.91 rillig *
644 1.91 rillig * C99 example: struct { int member[4]; } var = { [2] = 12345 };
645 1.91 rillig *
646 1.91 rillig * GNU example: struct { int member[4]; } var = { [1 ... 3] = 12345 };
647 1.119 rillig *
648 1.119 rillig * TODO: test the following initialization with an outer and an inner type:
649 1.119 rillig *
650 1.119 rillig * .deeply[0].nested = {
651 1.119 rillig * .deeply[1].nested = {
652 1.119 rillig * 12345,
653 1.119 rillig * },
654 1.119 rillig * }
655 1.91 rillig */
656 1.91 rillig void
657 1.131 rillig designation_add_subscript(range_t range)
658 1.91 rillig {
659 1.139 rillig struct brace_level *level;
660 1.132 rillig
661 1.91 rillig debug_enter();
662 1.142 rillig if (range.lo == range.hi)
663 1.142 rillig debug_step("subscript is %zu", range.hi);
664 1.142 rillig else
665 1.142 rillig debug_step("subscript range is %zu ... %zu",
666 1.142 rillig range.lo, range.hi);
667 1.132 rillig
668 1.133 rillig initstack_pop_nobrace();
669 1.133 rillig
670 1.139 rillig level = brace_level_lvalue;
671 1.139 rillig if (level->bl_array_of_unknown_size) {
672 1.133 rillig /* No +1 here, extend_if_array_of_unknown_size will add it. */
673 1.133 rillig int auto_dim = (int)range.hi;
674 1.142 rillig if (auto_dim > level->bl_type->t_dim)
675 1.142 rillig brace_level_set_array_dimension(auto_dim);
676 1.132 rillig }
677 1.132 rillig
678 1.91 rillig debug_leave();
679 1.91 rillig }
680 1.91 rillig
681 1.90 rillig
682 1.1 cgd /*
683 1.89 rillig * Initialize the initialization stack by putting an entry for the object
684 1.1 cgd * which is to be initialized on it.
685 1.119 rillig *
686 1.119 rillig * TODO: merge into begin_initialization
687 1.1 cgd */
688 1.1 cgd void
689 1.35 rillig initstack_init(void)
690 1.1 cgd {
691 1.1 cgd
692 1.1 cgd if (initerr)
693 1.1 cgd return;
694 1.1 cgd
695 1.70 rillig debug_enter();
696 1.38 rillig
697 1.1 cgd /*
698 1.77 rillig * If the type which is to be initialized is an incomplete array,
699 1.1 cgd * it must be duplicated.
700 1.1 cgd */
701 1.65 rillig if (initsym->s_type->t_tspec == ARRAY && is_incomplete(initsym->s_type))
702 1.1 cgd initsym->s_type = duptyp(initsym->s_type);
703 1.119 rillig /* TODO: does 'duptyp' create a memory leak? */
704 1.1 cgd
705 1.143 rillig brace_level_lvalue = brace_level_new(NULL, initsym->s_type, 1);
706 1.70 rillig
707 1.146 rillig initialization_debug(current_init());
708 1.70 rillig debug_leave();
709 1.1 cgd }
710 1.1 cgd
711 1.119 rillig /* TODO: document me */
712 1.1 cgd static void
713 1.137 rillig initstack_pop_item_named_member(const char *name)
714 1.1 cgd {
715 1.139 rillig struct brace_level *level = brace_level_lvalue;
716 1.143 rillig const sym_t *m;
717 1.1 cgd
718 1.119 rillig /*
719 1.119 rillig * TODO: fix wording of the debug message; this doesn't seem to be
720 1.119 rillig * related to initializing the named member.
721 1.119 rillig */
722 1.137 rillig debug_step("initializing named member '%s'", name);
723 1.68 rillig
724 1.139 rillig if (level->bl_type->t_tspec != STRUCT &&
725 1.139 rillig level->bl_type->t_tspec != UNION) {
726 1.104 rillig /* syntax error '%s' */
727 1.104 rillig error(249, "named member must only be used with struct/union");
728 1.141 rillig set_initerr();
729 1.104 rillig return;
730 1.104 rillig }
731 1.104 rillig
732 1.143 rillig m = brace_level_look_up_member(name);
733 1.143 rillig if (m == NULL) {
734 1.143 rillig /* TODO: add type information to the message */
735 1.143 rillig /* undefined struct/union member: %s */
736 1.143 rillig error(101, name);
737 1.40 rillig
738 1.146 rillig designation_shift_level(current_designation_mod());
739 1.143 rillig level->bl_seen_named_member = true;
740 1.143 rillig return;
741 1.101 rillig }
742 1.40 rillig
743 1.143 rillig debug_step("found matching member");
744 1.143 rillig level->bl_subtype = m->s_type;
745 1.143 rillig /* XXX: why ++? */
746 1.143 rillig level->bl_remaining++;
747 1.143 rillig /* XXX: why is bl_seen_named_member not set? */
748 1.146 rillig designation_shift_level(current_designation_mod());
749 1.101 rillig }
750 1.80 rillig
751 1.119 rillig /* TODO: think of a better name than 'pop' */
752 1.101 rillig static void
753 1.101 rillig initstack_pop_item_unnamed(void)
754 1.101 rillig {
755 1.139 rillig struct brace_level *level = brace_level_lvalue;
756 1.80 rillig
757 1.1 cgd /*
758 1.1 cgd * If the removed element was a structure member, we must go
759 1.1 cgd * to the next structure member.
760 1.1 cgd */
761 1.139 rillig if (level->bl_remaining > 0 && level->bl_type->t_tspec == STRUCT &&
762 1.139 rillig !level->bl_seen_named_member) {
763 1.144 rillig brace_level_next_member(level);
764 1.144 rillig level->bl_subtype = level->bl_next_member->s_type;
765 1.1 cgd }
766 1.101 rillig }
767 1.101 rillig
768 1.119 rillig /* TODO: think of a better name than 'pop' */
769 1.101 rillig static void
770 1.101 rillig initstack_pop_item(void)
771 1.101 rillig {
772 1.139 rillig struct brace_level *level;
773 1.140 rillig struct designator *first_designator;
774 1.101 rillig
775 1.101 rillig debug_enter();
776 1.101 rillig
777 1.139 rillig level = brace_level_lvalue;
778 1.120 rillig debug_indent();
779 1.120 rillig debug_printf("popping: ");
780 1.146 rillig brace_level_debug(level);
781 1.101 rillig
782 1.139 rillig brace_level_lvalue = level->bl_enclosing;
783 1.139 rillig free(level);
784 1.139 rillig level = brace_level_lvalue;
785 1.139 rillig lint_assert(level != NULL);
786 1.139 rillig
787 1.139 rillig level->bl_remaining--;
788 1.139 rillig lint_assert(level->bl_remaining >= 0);
789 1.139 rillig debug_step("%d elements remaining", level->bl_remaining);
790 1.101 rillig
791 1.137 rillig first_designator = current_designation().head;
792 1.137 rillig if (first_designator != NULL && first_designator->name != NULL)
793 1.137 rillig initstack_pop_item_named_member(first_designator->name);
794 1.101 rillig else
795 1.101 rillig initstack_pop_item_unnamed();
796 1.101 rillig
797 1.146 rillig initialization_debug(current_init());
798 1.68 rillig debug_leave();
799 1.1 cgd }
800 1.1 cgd
801 1.36 rillig /*
802 1.36 rillig * Take all entries, including the first which requires a closing brace,
803 1.36 rillig * from the stack.
804 1.36 rillig */
805 1.36 rillig static void
806 1.36 rillig initstack_pop_brace(void)
807 1.36 rillig {
808 1.62 rillig bool brace;
809 1.36 rillig
810 1.68 rillig debug_enter();
811 1.146 rillig initialization_debug(current_init());
812 1.36 rillig do {
813 1.139 rillig brace = brace_level_rvalue->bl_brace;
814 1.119 rillig /* TODO: improve wording of the debug message */
815 1.68 rillig debug_step("loop brace=%d", brace);
816 1.36 rillig initstack_pop_item();
817 1.36 rillig } while (!brace);
818 1.146 rillig initialization_debug(current_init());
819 1.68 rillig debug_leave();
820 1.36 rillig }
821 1.36 rillig
822 1.36 rillig /*
823 1.36 rillig * Take all entries which cannot be used for further initializers from the
824 1.36 rillig * stack, but do this only if they do not require a closing brace.
825 1.36 rillig */
826 1.119 rillig /* TODO: think of a better name than 'pop' */
827 1.1 cgd static void
828 1.36 rillig initstack_pop_nobrace(void)
829 1.1 cgd {
830 1.7 lukem
831 1.68 rillig debug_enter();
832 1.139 rillig while (!brace_level_rvalue->bl_brace &&
833 1.139 rillig brace_level_rvalue->bl_remaining == 0 &&
834 1.139 rillig !brace_level_rvalue->bl_array_of_unknown_size)
835 1.36 rillig initstack_pop_item();
836 1.68 rillig debug_leave();
837 1.1 cgd }
838 1.1 cgd
839 1.97 rillig /* Extend an array of unknown size by one element */
840 1.97 rillig static void
841 1.97 rillig extend_if_array_of_unknown_size(void)
842 1.97 rillig {
843 1.139 rillig struct brace_level *level = brace_level_lvalue;
844 1.97 rillig
845 1.139 rillig if (level->bl_remaining != 0)
846 1.97 rillig return;
847 1.133 rillig /*
848 1.133 rillig * XXX: According to the function name, there should be a 'return' if
849 1.139 rillig * bl_array_of_unknown_size is false. There's probably a test missing
850 1.133 rillig * for that case.
851 1.133 rillig */
852 1.97 rillig
853 1.97 rillig /*
854 1.97 rillig * The only place where an incomplete array may appear is at the
855 1.97 rillig * outermost aggregate level of the object to be initialized.
856 1.97 rillig */
857 1.139 rillig lint_assert(level->bl_enclosing->bl_enclosing == NULL);
858 1.139 rillig lint_assert(level->bl_type->t_tspec == ARRAY);
859 1.97 rillig
860 1.97 rillig debug_step("extending array of unknown size '%s'",
861 1.139 rillig type_name(level->bl_type));
862 1.139 rillig level->bl_remaining = 1;
863 1.139 rillig level->bl_type->t_dim++;
864 1.139 rillig setcomplete(level->bl_type, true);
865 1.97 rillig
866 1.139 rillig debug_step("extended type is '%s'", type_name(level->bl_type));
867 1.97 rillig }
868 1.97 rillig
869 1.119 rillig /* TODO: document me */
870 1.119 rillig /* TODO: think of a better name than 'push' */
871 1.1 cgd static void
872 1.99 rillig initstack_push_array(void)
873 1.99 rillig {
874 1.139 rillig struct brace_level *level = brace_level_lvalue;
875 1.99 rillig
876 1.139 rillig if (level->bl_enclosing->bl_seen_named_member) {
877 1.139 rillig level->bl_brace = true;
878 1.124 rillig debug_step("ARRAY%s%s",
879 1.139 rillig level->bl_brace ? ", needs closing brace" : "",
880 1.139 rillig /* TODO: this is redundant, always true */
881 1.139 rillig level->bl_enclosing->bl_seen_named_member
882 1.124 rillig ? ", seen named member" : "");
883 1.99 rillig }
884 1.99 rillig
885 1.139 rillig if (is_incomplete(level->bl_type) &&
886 1.139 rillig level->bl_enclosing->bl_enclosing != NULL) {
887 1.99 rillig /* initialization of an incomplete type */
888 1.99 rillig error(175);
889 1.141 rillig set_initerr();
890 1.99 rillig return;
891 1.99 rillig }
892 1.99 rillig
893 1.139 rillig level->bl_subtype = level->bl_type->t_subt;
894 1.139 rillig level->bl_array_of_unknown_size = is_incomplete(level->bl_type);
895 1.139 rillig level->bl_remaining = level->bl_type->t_dim;
896 1.146 rillig designation_debug(current_designation_mod());
897 1.99 rillig debug_step("type '%s' remaining %d",
898 1.139 rillig type_name(level->bl_type), level->bl_remaining);
899 1.99 rillig }
900 1.99 rillig
901 1.138 rillig static sym_t *
902 1.139 rillig look_up_member(struct brace_level *level, int *count)
903 1.99 rillig {
904 1.99 rillig sym_t *m;
905 1.99 rillig
906 1.139 rillig for (m = level->bl_type->t_str->sou_first_member;
907 1.99 rillig m != NULL; m = m->s_next) {
908 1.99 rillig if (m->s_bitfield && m->s_name == unnamed)
909 1.99 rillig continue;
910 1.119 rillig /*
911 1.119 rillig * TODO: split into separate functions:
912 1.119 rillig *
913 1.119 rillig * look_up_array_next
914 1.119 rillig * look_up_array_designator
915 1.119 rillig * look_up_struct_next
916 1.119 rillig * look_up_struct_designator
917 1.119 rillig */
918 1.128 rillig if (current_designation().head != NULL) {
919 1.119 rillig /* XXX: this log entry looks unnecessarily verbose */
920 1.100 rillig debug_step("have member '%s', want member '%s'",
921 1.128 rillig m->s_name, current_designation().head->name);
922 1.128 rillig if (strcmp(m->s_name,
923 1.128 rillig current_designation().head->name) == 0) {
924 1.138 rillig (*count)++;
925 1.99 rillig break;
926 1.99 rillig } else
927 1.99 rillig continue;
928 1.99 rillig }
929 1.138 rillig if (++(*count) == 1) {
930 1.139 rillig level->bl_next_member = m;
931 1.139 rillig level->bl_subtype = m->s_type;
932 1.99 rillig }
933 1.99 rillig }
934 1.100 rillig
935 1.138 rillig return m;
936 1.138 rillig }
937 1.138 rillig
938 1.138 rillig /* TODO: document me */
939 1.138 rillig /* TODO: think of a better name than 'push' */
940 1.138 rillig static bool
941 1.138 rillig initstack_push_struct_or_union(void)
942 1.138 rillig {
943 1.138 rillig /*
944 1.138 rillig * TODO: remove unnecessary 'const' for variables in functions that
945 1.138 rillig * fit on a single screen. Keep it for larger functions.
946 1.138 rillig */
947 1.139 rillig struct brace_level *level = brace_level_lvalue;
948 1.138 rillig int cnt;
949 1.138 rillig sym_t *m;
950 1.138 rillig
951 1.139 rillig if (is_incomplete(level->bl_type)) {
952 1.138 rillig /* initialization of an incomplete type */
953 1.138 rillig error(175);
954 1.141 rillig set_initerr();
955 1.138 rillig return false;
956 1.138 rillig }
957 1.138 rillig
958 1.138 rillig cnt = 0;
959 1.146 rillig designation_debug(current_designation_mod());
960 1.138 rillig debug_step("lookup for '%s'%s",
961 1.139 rillig type_name(level->bl_type),
962 1.139 rillig level->bl_seen_named_member ? ", seen named member" : "");
963 1.138 rillig
964 1.139 rillig m = look_up_member(level, &cnt);
965 1.138 rillig
966 1.128 rillig if (current_designation().head != NULL) {
967 1.99 rillig if (m == NULL) {
968 1.99 rillig debug_step("pop struct");
969 1.99 rillig return true;
970 1.99 rillig }
971 1.139 rillig level->bl_next_member = m;
972 1.139 rillig level->bl_subtype = m->s_type;
973 1.139 rillig level->bl_seen_named_member = true;
974 1.128 rillig debug_step("named member '%s'",
975 1.128 rillig current_designation().head->name);
976 1.146 rillig designation_shift_level(current_designation_mod());
977 1.139 rillig cnt = level->bl_type->t_tspec == STRUCT ? 2 : 1;
978 1.99 rillig }
979 1.139 rillig level->bl_brace = true;
980 1.99 rillig debug_step("unnamed element with type '%s'%s",
981 1.139 rillig type_name(
982 1.139 rillig level->bl_type != NULL ? level->bl_type : level->bl_subtype),
983 1.139 rillig level->bl_brace ? ", needs closing brace" : "");
984 1.99 rillig if (cnt == 0) {
985 1.99 rillig /* cannot init. struct/union with no named member */
986 1.99 rillig error(179);
987 1.141 rillig set_initerr();
988 1.99 rillig return false;
989 1.99 rillig }
990 1.139 rillig level->bl_remaining = level->bl_type->t_tspec == STRUCT ? cnt : 1;
991 1.99 rillig return false;
992 1.99 rillig }
993 1.99 rillig
994 1.119 rillig /* TODO: document me */
995 1.119 rillig /* TODO: think of a better name than 'push' */
996 1.99 rillig static void
997 1.35 rillig initstack_push(void)
998 1.1 cgd {
999 1.139 rillig struct brace_level *level, *enclosing;
1000 1.1 cgd
1001 1.68 rillig debug_enter();
1002 1.68 rillig
1003 1.97 rillig extend_if_array_of_unknown_size();
1004 1.97 rillig
1005 1.139 rillig level = brace_level_lvalue;
1006 1.139 rillig lint_assert(level->bl_remaining > 0);
1007 1.139 rillig lint_assert(level->bl_type == NULL ||
1008 1.139 rillig !is_scalar(level->bl_type->t_tspec));
1009 1.139 rillig
1010 1.139 rillig brace_level_lvalue = xcalloc(1, sizeof *brace_level_lvalue);
1011 1.139 rillig brace_level_lvalue->bl_enclosing = level;
1012 1.139 rillig brace_level_lvalue->bl_type = level->bl_subtype;
1013 1.139 rillig lint_assert(brace_level_lvalue->bl_type->t_tspec != FUNC);
1014 1.1 cgd
1015 1.12 christos again:
1016 1.139 rillig level = brace_level_lvalue;
1017 1.1 cgd
1018 1.139 rillig debug_step("expecting type '%s'", type_name(level->bl_type));
1019 1.139 rillig lint_assert(level->bl_type != NULL);
1020 1.139 rillig switch (level->bl_type->t_tspec) {
1021 1.1 cgd case ARRAY:
1022 1.128 rillig if (current_designation().head != NULL) {
1023 1.124 rillig debug_step("pop array, named member '%s'%s",
1024 1.128 rillig current_designation().head->name,
1025 1.139 rillig level->bl_brace ? ", needs closing brace" : "");
1026 1.19 christos goto pop;
1027 1.98 rillig }
1028 1.98 rillig
1029 1.99 rillig initstack_push_array();
1030 1.99 rillig break;
1031 1.20 christos
1032 1.1 cgd case UNION:
1033 1.1 cgd if (tflag)
1034 1.89 rillig /* initialization of union is illegal in trad. C */
1035 1.1 cgd warning(238);
1036 1.1 cgd /* FALLTHROUGH */
1037 1.1 cgd case STRUCT:
1038 1.99 rillig if (initstack_push_struct_or_union())
1039 1.99 rillig goto pop;
1040 1.1 cgd break;
1041 1.1 cgd default:
1042 1.128 rillig if (current_designation().head != NULL) {
1043 1.100 rillig debug_step("pop scalar");
1044 1.19 christos pop:
1045 1.119 rillig /* TODO: extract this into end_initializer_level */
1046 1.139 rillig enclosing = brace_level_rvalue->bl_enclosing;
1047 1.139 rillig free(level);
1048 1.139 rillig brace_level_lvalue = enclosing;
1049 1.12 christos goto again;
1050 1.12 christos }
1051 1.100 rillig /* The initialization stack now expects a single scalar. */
1052 1.139 rillig level->bl_remaining = 1;
1053 1.1 cgd break;
1054 1.1 cgd }
1055 1.68 rillig
1056 1.146 rillig initialization_debug(current_init());
1057 1.68 rillig debug_leave();
1058 1.1 cgd }
1059 1.1 cgd
1060 1.1 cgd static void
1061 1.84 rillig check_too_many_initializers(void)
1062 1.1 cgd {
1063 1.139 rillig const struct brace_level *level = brace_level_rvalue;
1064 1.139 rillig if (level->bl_remaining > 0)
1065 1.84 rillig return;
1066 1.119 rillig /*
1067 1.119 rillig * FIXME: even with named members, there can be too many initializers
1068 1.119 rillig */
1069 1.139 rillig if (level->bl_array_of_unknown_size || level->bl_seen_named_member)
1070 1.84 rillig return;
1071 1.1 cgd
1072 1.139 rillig tspec_t t = level->bl_type->t_tspec;
1073 1.84 rillig if (t == ARRAY) {
1074 1.84 rillig /* too many array initializers, expected %d */
1075 1.139 rillig error(173, level->bl_type->t_dim);
1076 1.84 rillig } else if (t == STRUCT || t == UNION) {
1077 1.84 rillig /* too many struct/union initializers */
1078 1.84 rillig error(172);
1079 1.84 rillig } else {
1080 1.84 rillig /* too many initializers */
1081 1.84 rillig error(174);
1082 1.1 cgd }
1083 1.141 rillig set_initerr();
1084 1.1 cgd }
1085 1.1 cgd
1086 1.92 rillig /*
1087 1.92 rillig * Process a '{' in an initializer by starting the initialization of the
1088 1.139 rillig * nested data structure, with bl_type being the bl_subtype of the outer
1089 1.92 rillig * initialization level.
1090 1.92 rillig */
1091 1.1 cgd static void
1092 1.37 rillig initstack_next_brace(void)
1093 1.1 cgd {
1094 1.7 lukem
1095 1.68 rillig debug_enter();
1096 1.146 rillig initialization_debug(current_init());
1097 1.68 rillig
1098 1.139 rillig if (brace_level_rvalue->bl_type != NULL &&
1099 1.139 rillig is_scalar(brace_level_rvalue->bl_type->t_tspec)) {
1100 1.49 rillig /* invalid initializer type %s */
1101 1.139 rillig error(176, type_name(brace_level_rvalue->bl_type));
1102 1.141 rillig set_initerr();
1103 1.37 rillig }
1104 1.37 rillig if (!initerr)
1105 1.84 rillig check_too_many_initializers();
1106 1.37 rillig if (!initerr)
1107 1.37 rillig initstack_push();
1108 1.37 rillig if (!initerr) {
1109 1.139 rillig brace_level_lvalue->bl_brace = true;
1110 1.146 rillig designation_debug(current_designation_mod());
1111 1.92 rillig debug_step("expecting type '%s'",
1112 1.139 rillig type_name(brace_level_rvalue->bl_type != NULL
1113 1.139 rillig ? brace_level_rvalue->bl_type
1114 1.139 rillig : brace_level_rvalue->bl_subtype));
1115 1.37 rillig }
1116 1.68 rillig
1117 1.146 rillig initialization_debug(current_init());
1118 1.68 rillig debug_leave();
1119 1.37 rillig }
1120 1.37 rillig
1121 1.119 rillig /* TODO: document me, or think of a better name */
1122 1.37 rillig static void
1123 1.118 rillig initstack_next_nobrace(tnode_t *tn)
1124 1.37 rillig {
1125 1.68 rillig debug_enter();
1126 1.37 rillig
1127 1.139 rillig if (brace_level_rvalue->bl_type == NULL &&
1128 1.139 rillig !is_scalar(brace_level_rvalue->bl_subtype->t_tspec)) {
1129 1.37 rillig /* {}-enclosed initializer required */
1130 1.37 rillig error(181);
1131 1.92 rillig /* XXX: maybe set initerr here */
1132 1.37 rillig }
1133 1.37 rillig
1134 1.84 rillig if (!initerr)
1135 1.84 rillig check_too_many_initializers();
1136 1.84 rillig
1137 1.42 rillig while (!initerr) {
1138 1.139 rillig struct brace_level *level = brace_level_lvalue;
1139 1.118 rillig
1140 1.118 rillig if (tn->tn_type->t_tspec == STRUCT &&
1141 1.139 rillig level->bl_type == tn->tn_type &&
1142 1.139 rillig level->bl_enclosing != NULL &&
1143 1.139 rillig level->bl_enclosing->bl_enclosing != NULL) {
1144 1.139 rillig level->bl_brace = false;
1145 1.139 rillig level->bl_remaining = 1; /* the struct itself */
1146 1.118 rillig break;
1147 1.118 rillig }
1148 1.118 rillig
1149 1.139 rillig if (level->bl_type != NULL &&
1150 1.139 rillig is_scalar(level->bl_type->t_tspec))
1151 1.42 rillig break;
1152 1.42 rillig initstack_push();
1153 1.1 cgd }
1154 1.68 rillig
1155 1.146 rillig initialization_debug(current_init());
1156 1.68 rillig debug_leave();
1157 1.1 cgd }
1158 1.1 cgd
1159 1.119 rillig /* TODO: document me */
1160 1.1 cgd void
1161 1.34 rillig init_lbrace(void)
1162 1.1 cgd {
1163 1.1 cgd if (initerr)
1164 1.1 cgd return;
1165 1.1 cgd
1166 1.68 rillig debug_enter();
1167 1.146 rillig initialization_debug(current_init());
1168 1.68 rillig
1169 1.1 cgd if ((initsym->s_scl == AUTO || initsym->s_scl == REG) &&
1170 1.139 rillig brace_level_rvalue->bl_enclosing == NULL) {
1171 1.139 rillig if (tflag &&
1172 1.139 rillig !is_scalar(brace_level_rvalue->bl_subtype->t_tspec))
1173 1.50 rillig /* no automatic aggregate initialization in trad. C */
1174 1.1 cgd warning(188);
1175 1.1 cgd }
1176 1.1 cgd
1177 1.1 cgd /*
1178 1.1 cgd * Remove all entries which cannot be used for further initializers
1179 1.1 cgd * and do not expect a closing brace.
1180 1.1 cgd */
1181 1.36 rillig initstack_pop_nobrace();
1182 1.1 cgd
1183 1.37 rillig initstack_next_brace();
1184 1.68 rillig
1185 1.146 rillig initialization_debug(current_init());
1186 1.68 rillig debug_leave();
1187 1.1 cgd }
1188 1.1 cgd
1189 1.92 rillig /*
1190 1.92 rillig * Process a '}' in an initializer by finishing the current level of the
1191 1.92 rillig * initialization stack.
1192 1.92 rillig */
1193 1.1 cgd void
1194 1.34 rillig init_rbrace(void)
1195 1.1 cgd {
1196 1.1 cgd if (initerr)
1197 1.1 cgd return;
1198 1.1 cgd
1199 1.68 rillig debug_enter();
1200 1.36 rillig initstack_pop_brace();
1201 1.68 rillig debug_leave();
1202 1.1 cgd }
1203 1.1 cgd
1204 1.86 rillig /* In traditional C, bit-fields can be initialized only by integer constants. */
1205 1.86 rillig static void
1206 1.86 rillig check_bit_field_init(const tnode_t *ln, tspec_t lt, tspec_t rt)
1207 1.86 rillig {
1208 1.86 rillig if (tflag &&
1209 1.86 rillig is_integer(lt) &&
1210 1.86 rillig ln->tn_type->t_bitfield &&
1211 1.86 rillig !is_integer(rt)) {
1212 1.89 rillig /* bit-field initialization is illegal in traditional C */
1213 1.86 rillig warning(186);
1214 1.86 rillig }
1215 1.86 rillig }
1216 1.86 rillig
1217 1.87 rillig static void
1218 1.87 rillig check_non_constant_initializer(const tnode_t *tn, scl_t sclass)
1219 1.87 rillig {
1220 1.119 rillig /* TODO: rename CON to CONSTANT to avoid ambiguity with CONVERT */
1221 1.87 rillig if (tn == NULL || tn->tn_op == CON)
1222 1.87 rillig return;
1223 1.87 rillig
1224 1.87 rillig sym_t *sym;
1225 1.87 rillig ptrdiff_t offs;
1226 1.87 rillig if (constant_addr(tn, &sym, &offs))
1227 1.87 rillig return;
1228 1.87 rillig
1229 1.87 rillig if (sclass == AUTO || sclass == REG) {
1230 1.87 rillig /* non-constant initializer */
1231 1.87 rillig c99ism(177);
1232 1.87 rillig } else {
1233 1.87 rillig /* non-constant initializer */
1234 1.87 rillig error(177);
1235 1.87 rillig }
1236 1.87 rillig }
1237 1.87 rillig
1238 1.114 rillig /*
1239 1.119 rillig * Initialize a non-array object with automatic storage duration and only a
1240 1.119 rillig * single initializer expression without braces by delegating to ASSIGN.
1241 1.114 rillig */
1242 1.114 rillig static bool
1243 1.114 rillig init_using_assign(tnode_t *rn)
1244 1.114 rillig {
1245 1.114 rillig tnode_t *ln, *tn;
1246 1.114 rillig
1247 1.114 rillig if (initsym->s_type->t_tspec == ARRAY)
1248 1.114 rillig return false;
1249 1.139 rillig if (brace_level_rvalue->bl_enclosing != NULL)
1250 1.114 rillig return false;
1251 1.114 rillig
1252 1.114 rillig debug_step("handing over to ASSIGN");
1253 1.119 rillig
1254 1.114 rillig ln = new_name_node(initsym, 0);
1255 1.114 rillig ln->tn_type = tduptyp(ln->tn_type);
1256 1.114 rillig ln->tn_type->t_const = false;
1257 1.119 rillig
1258 1.114 rillig tn = build(ASSIGN, ln, rn);
1259 1.114 rillig expr(tn, false, false, false, false);
1260 1.119 rillig
1261 1.114 rillig /* XXX: why not clean up the initstack here already? */
1262 1.114 rillig return true;
1263 1.114 rillig }
1264 1.114 rillig
1265 1.116 rillig static void
1266 1.116 rillig check_init_expr(tnode_t *tn, scl_t sclass)
1267 1.116 rillig {
1268 1.116 rillig tnode_t *ln;
1269 1.116 rillig tspec_t lt, rt;
1270 1.116 rillig struct mbl *tmem;
1271 1.116 rillig
1272 1.116 rillig /* Create a temporary node for the left side. */
1273 1.134 rillig ln = tgetblk(sizeof *ln);
1274 1.116 rillig ln->tn_op = NAME;
1275 1.139 rillig ln->tn_type = tduptyp(brace_level_rvalue->bl_type);
1276 1.116 rillig ln->tn_type->t_const = false;
1277 1.116 rillig ln->tn_lvalue = true;
1278 1.116 rillig ln->tn_sym = initsym; /* better than nothing */
1279 1.116 rillig
1280 1.116 rillig tn = cconv(tn);
1281 1.116 rillig
1282 1.116 rillig lt = ln->tn_type->t_tspec;
1283 1.116 rillig rt = tn->tn_type->t_tspec;
1284 1.116 rillig
1285 1.116 rillig debug_step("typeok '%s', '%s'",
1286 1.116 rillig type_name(ln->tn_type), type_name(tn->tn_type));
1287 1.116 rillig if (!typeok(INIT, 0, ln, tn))
1288 1.116 rillig return;
1289 1.116 rillig
1290 1.116 rillig /*
1291 1.119 rillig * Preserve the tree memory. This is necessary because otherwise
1292 1.116 rillig * expr() would free it.
1293 1.116 rillig */
1294 1.116 rillig tmem = tsave();
1295 1.116 rillig expr(tn, true, false, true, false);
1296 1.116 rillig trestor(tmem);
1297 1.116 rillig
1298 1.116 rillig check_bit_field_init(ln, lt, rt);
1299 1.116 rillig
1300 1.116 rillig /*
1301 1.116 rillig * XXX: Is it correct to do this conversion _after_ the typeok above?
1302 1.116 rillig */
1303 1.139 rillig if (lt != rt ||
1304 1.139 rillig (brace_level_rvalue->bl_type->t_bitfield && tn->tn_op == CON))
1305 1.139 rillig tn = convert(INIT, 0, brace_level_rvalue->bl_type, tn);
1306 1.116 rillig
1307 1.116 rillig check_non_constant_initializer(tn, sclass);
1308 1.116 rillig }
1309 1.116 rillig
1310 1.1 cgd void
1311 1.69 rillig init_using_expr(tnode_t *tn)
1312 1.1 cgd {
1313 1.81 rillig scl_t sclass;
1314 1.1 cgd
1315 1.68 rillig debug_enter();
1316 1.146 rillig initialization_debug(current_init());
1317 1.146 rillig designation_debug(current_designation_mod());
1318 1.95 rillig debug_step("expr:");
1319 1.95 rillig debug_node(tn, debug_ind + 1);
1320 1.55 rillig
1321 1.113 rillig if (initerr || tn == NULL)
1322 1.113 rillig goto done;
1323 1.1 cgd
1324 1.81 rillig sclass = initsym->s_scl;
1325 1.114 rillig if ((sclass == AUTO || sclass == REG) && init_using_assign(tn))
1326 1.113 rillig goto done;
1327 1.1 cgd
1328 1.36 rillig initstack_pop_nobrace();
1329 1.1 cgd
1330 1.82 rillig if (init_array_using_string(tn)) {
1331 1.82 rillig debug_step("after initializing the string:");
1332 1.82 rillig /* XXX: why not clean up the initstack here already? */
1333 1.113 rillig goto done_initstack;
1334 1.68 rillig }
1335 1.1 cgd
1336 1.118 rillig initstack_next_nobrace(tn);
1337 1.113 rillig if (initerr || tn == NULL)
1338 1.113 rillig goto done_initstack;
1339 1.1 cgd
1340 1.139 rillig brace_level_lvalue->bl_remaining--;
1341 1.139 rillig debug_step("%d elements remaining", brace_level_rvalue->bl_remaining);
1342 1.83 rillig
1343 1.116 rillig check_init_expr(tn, sclass);
1344 1.68 rillig
1345 1.113 rillig done_initstack:
1346 1.146 rillig initialization_debug(current_init());
1347 1.130 rillig
1348 1.113 rillig done:
1349 1.130 rillig while (current_designation().head != NULL)
1350 1.146 rillig designation_shift_level(current_designation_mod());
1351 1.130 rillig
1352 1.68 rillig debug_leave();
1353 1.1 cgd }
1354 1.1 cgd
1355 1.1 cgd
1356 1.82 rillig /* Initialize a character array or wchar_t array with a string literal. */
1357 1.62 rillig static bool
1358 1.82 rillig init_array_using_string(tnode_t *tn)
1359 1.1 cgd {
1360 1.1 cgd tspec_t t;
1361 1.139 rillig struct brace_level *level;
1362 1.1 cgd int len;
1363 1.1 cgd strg_t *strg;
1364 1.1 cgd
1365 1.1 cgd if (tn->tn_op != STRING)
1366 1.63 rillig return false;
1367 1.1 cgd
1368 1.68 rillig debug_enter();
1369 1.146 rillig initialization_debug(current_init());
1370 1.68 rillig
1371 1.139 rillig level = brace_level_lvalue;
1372 1.47 rillig strg = tn->tn_string;
1373 1.1 cgd
1374 1.1 cgd /*
1375 1.1 cgd * Check if we have an array type which can be initialized by
1376 1.1 cgd * the string.
1377 1.1 cgd */
1378 1.139 rillig if (level->bl_subtype != NULL && level->bl_subtype->t_tspec == ARRAY) {
1379 1.68 rillig debug_step("subt array");
1380 1.139 rillig t = level->bl_subtype->t_subt->t_tspec;
1381 1.1 cgd if (!((strg->st_tspec == CHAR &&
1382 1.1 cgd (t == CHAR || t == UCHAR || t == SCHAR)) ||
1383 1.1 cgd (strg->st_tspec == WCHAR && t == WCHAR))) {
1384 1.68 rillig debug_leave();
1385 1.63 rillig return false;
1386 1.1 cgd }
1387 1.82 rillig /* XXX: duplicate code, see below */
1388 1.119 rillig
1389 1.1 cgd /* Put the array at top of stack */
1390 1.35 rillig initstack_push();
1391 1.139 rillig level = brace_level_lvalue;
1392 1.119 rillig
1393 1.139 rillig /* TODO: what if both bl_type and bl_subtype are ARRAY? */
1394 1.119 rillig
1395 1.139 rillig } else if (level->bl_type != NULL && level->bl_type->t_tspec == ARRAY) {
1396 1.68 rillig debug_step("type array");
1397 1.139 rillig t = level->bl_type->t_subt->t_tspec;
1398 1.1 cgd if (!((strg->st_tspec == CHAR &&
1399 1.1 cgd (t == CHAR || t == UCHAR || t == SCHAR)) ||
1400 1.1 cgd (strg->st_tspec == WCHAR && t == WCHAR))) {
1401 1.68 rillig debug_leave();
1402 1.63 rillig return false;
1403 1.1 cgd }
1404 1.82 rillig /* XXX: duplicate code, see above */
1405 1.119 rillig
1406 1.119 rillig /*
1407 1.119 rillig * TODO: is this really not needed in the branch above this
1408 1.119 rillig * one?
1409 1.119 rillig */
1410 1.1 cgd /*
1411 1.1 cgd * If the array is already partly initialized, we are
1412 1.1 cgd * wrong here.
1413 1.1 cgd */
1414 1.139 rillig if (level->bl_remaining != level->bl_type->t_dim) {
1415 1.68 rillig debug_leave();
1416 1.63 rillig return false;
1417 1.115 rillig }
1418 1.1 cgd } else {
1419 1.68 rillig debug_leave();
1420 1.63 rillig return false;
1421 1.1 cgd }
1422 1.1 cgd
1423 1.1 cgd /* Get length without trailing NUL character. */
1424 1.1 cgd len = strg->st_len;
1425 1.1 cgd
1426 1.139 rillig if (level->bl_array_of_unknown_size) {
1427 1.139 rillig level->bl_array_of_unknown_size = false;
1428 1.139 rillig level->bl_type->t_dim = len + 1;
1429 1.139 rillig setcomplete(level->bl_type, true);
1430 1.1 cgd } else {
1431 1.119 rillig /*
1432 1.119 rillig * TODO: check for buffer overflow in the object to be
1433 1.119 rillig * initialized
1434 1.119 rillig */
1435 1.119 rillig /* XXX: double-check for off-by-one error */
1436 1.139 rillig if (level->bl_type->t_dim < len) {
1437 1.1 cgd /* non-null byte ignored in string initializer */
1438 1.1 cgd warning(187);
1439 1.1 cgd }
1440 1.119 rillig
1441 1.119 rillig /*
1442 1.119 rillig * TODO: C99 6.7.8p14 allows a string literal to be enclosed
1443 1.119 rillig * in optional redundant braces, just like scalars. Add tests
1444 1.119 rillig * for this.
1445 1.119 rillig */
1446 1.1 cgd }
1447 1.1 cgd
1448 1.1 cgd /* In every case the array is initialized completely. */
1449 1.139 rillig level->bl_remaining = 0;
1450 1.1 cgd
1451 1.146 rillig initialization_debug(current_init());
1452 1.68 rillig debug_leave();
1453 1.63 rillig return true;
1454 1.1 cgd }
1455