init.c revision 1.43 1 1.43 rillig /* $NetBSD: init.c,v 1.43 2020/12/29 23:12:48 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.43 rillig __RCSID("$NetBSD: init.c,v 1.43 2020/12/29 23:12:48 rillig Exp $");
41 1.1 cgd #endif
42 1.1 cgd
43 1.31 rillig #include <ctype.h>
44 1.1 cgd #include <stdlib.h>
45 1.17 thorpej #include <string.h>
46 1.1 cgd
47 1.1 cgd #include "lint1.h"
48 1.1 cgd
49 1.1 cgd /*
50 1.8 wiz * initerr is set as soon as a fatal error occurred in an initialisation.
51 1.1 cgd * The effect is that the rest of the initialisation is ignored (parsed
52 1.1 cgd * by yacc, expression trees built, but no initialisation takes place).
53 1.1 cgd */
54 1.1 cgd int initerr;
55 1.1 cgd
56 1.1 cgd /* Pointer to the symbol which is to be initialized. */
57 1.1 cgd sym_t *initsym;
58 1.1 cgd
59 1.1 cgd /* Points to the top element of the initialisation stack. */
60 1.1 cgd istk_t *initstk;
61 1.1 cgd
62 1.12 christos typedef struct namlist {
63 1.12 christos const char *n_name;
64 1.12 christos struct namlist *n_prev;
65 1.12 christos struct namlist *n_next;
66 1.12 christos } namlist_t;
67 1.12 christos
68 1.12 christos /* Points to a c9x named member; */
69 1.12 christos namlist_t *namedmem = NULL;
70 1.12 christos
71 1.1 cgd
72 1.35 rillig static int initstack_string(tnode_t *);
73 1.12 christos
74 1.12 christos #ifndef DEBUG
75 1.12 christos #define DPRINTF(a)
76 1.12 christos #else
77 1.12 christos #define DPRINTF(a) printf a
78 1.12 christos #endif
79 1.12 christos
80 1.12 christos void
81 1.34 rillig push_member(sb)
82 1.12 christos sbuf_t *sb;
83 1.12 christos {
84 1.28 rillig namlist_t *nam = xcalloc(1, sizeof (namlist_t));
85 1.12 christos nam->n_name = sb->sb_name;
86 1.27 christos DPRINTF(("%s: %s %p\n", __func__, nam->n_name, nam));
87 1.12 christos if (namedmem == NULL) {
88 1.12 christos nam->n_prev = nam->n_next = nam;
89 1.12 christos namedmem = nam;
90 1.12 christos } else {
91 1.12 christos namedmem->n_prev->n_next = nam;
92 1.12 christos nam->n_prev = namedmem->n_prev;
93 1.12 christos nam->n_next = namedmem;
94 1.12 christos namedmem->n_prev = nam;
95 1.12 christos }
96 1.12 christos }
97 1.12 christos
98 1.12 christos static void
99 1.34 rillig pop_member(void)
100 1.12 christos {
101 1.27 christos DPRINTF(("%s: %s %p\n", __func__, namedmem->n_name, namedmem));
102 1.12 christos if (namedmem->n_next == namedmem) {
103 1.12 christos free(namedmem);
104 1.12 christos namedmem = NULL;
105 1.12 christos } else {
106 1.12 christos namlist_t *nam = namedmem;
107 1.12 christos namedmem = namedmem->n_next;
108 1.27 christos namedmem->n_next = nam->n_next;
109 1.27 christos namedmem->n_prev = nam->n_prev;
110 1.12 christos free(nam);
111 1.12 christos }
112 1.12 christos }
113 1.1 cgd
114 1.1 cgd
115 1.1 cgd /*
116 1.1 cgd * Initialize the initialisation stack by putting an entry for the variable
117 1.1 cgd * which is to be initialized on it.
118 1.1 cgd */
119 1.1 cgd void
120 1.35 rillig initstack_init(void)
121 1.1 cgd {
122 1.1 cgd istk_t *istk;
123 1.1 cgd
124 1.1 cgd if (initerr)
125 1.1 cgd return;
126 1.1 cgd
127 1.1 cgd /* free memory used in last initialisation */
128 1.1 cgd while ((istk = initstk) != NULL) {
129 1.1 cgd initstk = istk->i_nxt;
130 1.1 cgd free(istk);
131 1.1 cgd }
132 1.1 cgd
133 1.38 rillig DPRINTF(("%s\n", __func__));
134 1.38 rillig
135 1.1 cgd /*
136 1.1 cgd * If the type which is to be initialized is an incomplete type,
137 1.1 cgd * it must be duplicated.
138 1.1 cgd */
139 1.1 cgd if (initsym->s_type->t_tspec == ARRAY && incompl(initsym->s_type))
140 1.1 cgd initsym->s_type = duptyp(initsym->s_type);
141 1.1 cgd
142 1.1 cgd istk = initstk = xcalloc(1, sizeof (istk_t));
143 1.1 cgd istk->i_subt = initsym->s_type;
144 1.43 rillig istk->i_remaining = 1;
145 1.1 cgd }
146 1.1 cgd
147 1.1 cgd static void
148 1.35 rillig initstack_pop_item(void)
149 1.1 cgd {
150 1.12 christos #ifdef DEBUG
151 1.12 christos char buf[64];
152 1.12 christos #endif
153 1.1 cgd istk_t *istk;
154 1.1 cgd sym_t *m;
155 1.1 cgd
156 1.41 rillig istk = initstk;
157 1.40 rillig DPRINTF(("%s: pop type=%s, brace=%d remaining=%d named=%d\n", __func__,
158 1.41 rillig tyname(buf, sizeof buf, istk->i_type ? istk->i_type : istk->i_subt),
159 1.43 rillig istk->i_brace, istk->i_remaining, istk->i_namedmem));
160 1.40 rillig
161 1.41 rillig initstk = istk->i_nxt;
162 1.1 cgd free(istk);
163 1.1 cgd istk = initstk;
164 1.26 christos if (istk == NULL)
165 1.35 rillig LERROR("initstack_pop_item()");
166 1.26 christos
167 1.40 rillig DPRINTF(("%s: top type=%s, brace=%d remaining=%d named=%d\n", __func__,
168 1.41 rillig tyname(buf, sizeof buf, istk->i_type ? istk->i_type : istk->i_subt),
169 1.43 rillig istk->i_brace, istk->i_remaining, istk->i_namedmem));
170 1.1 cgd
171 1.43 rillig istk->i_remaining--;
172 1.43 rillig if (istk->i_remaining < 0)
173 1.35 rillig LERROR("initstack_pop_item()");
174 1.1 cgd
175 1.40 rillig DPRINTF(("%s: top remaining=%d rhs.name=%s\n", __func__,
176 1.43 rillig istk->i_remaining, namedmem ? namedmem->n_name : "*null*"));
177 1.40 rillig
178 1.43 rillig if (istk->i_remaining >= 0 && namedmem != NULL) {
179 1.40 rillig
180 1.40 rillig DPRINTF(("%s: named remaining=%d type=%s, rhs.name=%s\n",
181 1.43 rillig __func__, istk->i_remaining,
182 1.40 rillig tyname(buf, sizeof(buf), istk->i_type), namedmem->n_name));
183 1.38 rillig
184 1.12 christos for (m = istk->i_type->t_str->memb; m != NULL; m = m->s_nxt) {
185 1.40 rillig DPRINTF(("%s: pop lhs.name=%s rhs.name=%s\n", __func__,
186 1.40 rillig m->s_name, namedmem->n_name));
187 1.12 christos if (m->s_field && m->s_name == unnamed)
188 1.12 christos continue;
189 1.12 christos if (strcmp(m->s_name, namedmem->n_name) == 0) {
190 1.12 christos istk->i_subt = m->s_type;
191 1.43 rillig istk->i_remaining++;
192 1.34 rillig pop_member();
193 1.12 christos return;
194 1.12 christos }
195 1.12 christos }
196 1.12 christos error(101, namedmem->n_name);
197 1.40 rillig DPRINTF(("%s: end rhs.name=%s\n", __func__, namedmem->n_name));
198 1.34 rillig pop_member();
199 1.12 christos istk->i_namedmem = 1;
200 1.12 christos return;
201 1.12 christos }
202 1.1 cgd /*
203 1.1 cgd * If the removed element was a structure member, we must go
204 1.1 cgd * to the next structure member.
205 1.1 cgd */
206 1.43 rillig if (istk->i_remaining > 0 && istk->i_type->t_tspec == STRUCT &&
207 1.12 christos !istk->i_namedmem) {
208 1.1 cgd do {
209 1.1 cgd m = istk->i_mem = istk->i_mem->s_nxt;
210 1.1 cgd if (m == NULL)
211 1.35 rillig LERROR("initstack_pop_item()");
212 1.40 rillig DPRINTF(("%s: pop %s\n", __func__, m->s_name));
213 1.1 cgd } while (m->s_field && m->s_name == unnamed);
214 1.1 cgd istk->i_subt = m->s_type;
215 1.1 cgd }
216 1.1 cgd }
217 1.1 cgd
218 1.36 rillig /*
219 1.36 rillig * Take all entries, including the first which requires a closing brace,
220 1.36 rillig * from the stack.
221 1.36 rillig */
222 1.36 rillig static void
223 1.36 rillig initstack_pop_brace(void)
224 1.36 rillig {
225 1.36 rillig int brace;
226 1.36 rillig
227 1.36 rillig DPRINTF(("%s\n", __func__));
228 1.36 rillig do {
229 1.36 rillig brace = initstk->i_brace;
230 1.38 rillig DPRINTF(("%s: loop brace=%d\n", __func__, brace));
231 1.36 rillig initstack_pop_item();
232 1.36 rillig } while (!brace);
233 1.36 rillig DPRINTF(("%s: done\n", __func__));
234 1.36 rillig }
235 1.36 rillig
236 1.36 rillig /*
237 1.36 rillig * Take all entries which cannot be used for further initializers from the
238 1.36 rillig * stack, but do this only if they do not require a closing brace.
239 1.36 rillig */
240 1.1 cgd static void
241 1.36 rillig initstack_pop_nobrace(void)
242 1.1 cgd {
243 1.7 lukem
244 1.36 rillig DPRINTF(("%s\n", __func__));
245 1.43 rillig while (!initstk->i_brace && initstk->i_remaining == 0 &&
246 1.43 rillig !initstk->i_nolimit)
247 1.36 rillig initstack_pop_item();
248 1.36 rillig DPRINTF(("%s: done\n", __func__));
249 1.1 cgd }
250 1.1 cgd
251 1.1 cgd static void
252 1.35 rillig initstack_push(void)
253 1.1 cgd {
254 1.12 christos #ifdef DEBUG
255 1.12 christos char buf[64];
256 1.12 christos #endif
257 1.22 ad istk_t *istk, *inxt;
258 1.1 cgd int cnt;
259 1.1 cgd sym_t *m;
260 1.1 cgd
261 1.1 cgd istk = initstk;
262 1.1 cgd
263 1.1 cgd /* Extend an incomplete array type by one element */
264 1.43 rillig if (istk->i_remaining == 0) {
265 1.30 rillig DPRINTF(("%s(extend) %s\n", __func__,
266 1.30 rillig tyname(buf, sizeof(buf), istk->i_type)));
267 1.1 cgd /*
268 1.1 cgd * Inside of other aggregate types must not be an incomplete
269 1.1 cgd * type.
270 1.1 cgd */
271 1.1 cgd if (istk->i_nxt->i_nxt != NULL)
272 1.35 rillig LERROR("initstack_push()");
273 1.43 rillig istk->i_remaining = 1;
274 1.1 cgd if (istk->i_type->t_tspec != ARRAY)
275 1.35 rillig LERROR("initstack_push()");
276 1.1 cgd istk->i_type->t_dim++;
277 1.32 rillig setcomplete(istk->i_type, 1);
278 1.1 cgd }
279 1.1 cgd
280 1.43 rillig if (istk->i_remaining <= 0)
281 1.35 rillig LERROR("initstack_push()");
282 1.29 rillig if (istk->i_type != NULL && tspec_is_scalar(istk->i_type->t_tspec))
283 1.35 rillig LERROR("initstack_push()");
284 1.1 cgd
285 1.1 cgd initstk = xcalloc(1, sizeof (istk_t));
286 1.1 cgd initstk->i_nxt = istk;
287 1.1 cgd initstk->i_type = istk->i_subt;
288 1.1 cgd if (initstk->i_type->t_tspec == FUNC)
289 1.35 rillig LERROR("initstack_push()");
290 1.1 cgd
291 1.12 christos again:
292 1.1 cgd istk = initstk;
293 1.1 cgd
294 1.26 christos DPRINTF(("%s(%s)\n", __func__, tyname(buf, sizeof(buf), istk->i_type)));
295 1.1 cgd switch (istk->i_type->t_tspec) {
296 1.1 cgd case ARRAY:
297 1.16 christos if (namedmem) {
298 1.26 christos DPRINTF(("%s: ARRAY %s brace=%d\n", __func__,
299 1.20 christos namedmem->n_name, istk->i_brace));
300 1.19 christos goto pop;
301 1.20 christos } else if (istk->i_nxt->i_namedmem) {
302 1.26 christos istk->i_brace = 1;
303 1.26 christos DPRINTF(("%s ARRAY brace=%d, namedmem=%d\n", __func__,
304 1.20 christos istk->i_brace, istk->i_nxt->i_namedmem));
305 1.20 christos }
306 1.20 christos
307 1.1 cgd if (incompl(istk->i_type) && istk->i_nxt->i_nxt != NULL) {
308 1.1 cgd /* initialisation of an incomplete type */
309 1.1 cgd error(175);
310 1.1 cgd initerr = 1;
311 1.1 cgd return;
312 1.1 cgd }
313 1.1 cgd istk->i_subt = istk->i_type->t_subt;
314 1.1 cgd istk->i_nolimit = incompl(istk->i_type);
315 1.43 rillig istk->i_remaining = istk->i_type->t_dim;
316 1.26 christos DPRINTF(("%s: elements array %s[%d] %s\n", __func__,
317 1.43 rillig tyname(buf, sizeof(buf), istk->i_subt), istk->i_remaining,
318 1.16 christos namedmem ? namedmem->n_name : "*none*"));
319 1.1 cgd break;
320 1.1 cgd case UNION:
321 1.1 cgd if (tflag)
322 1.1 cgd /* initialisation of union is illegal in trad. C */
323 1.1 cgd warning(238);
324 1.1 cgd /* FALLTHROUGH */
325 1.1 cgd case STRUCT:
326 1.1 cgd if (incompl(istk->i_type)) {
327 1.1 cgd /* initialisation of an incomplete type */
328 1.1 cgd error(175);
329 1.1 cgd initerr = 1;
330 1.1 cgd return;
331 1.1 cgd }
332 1.1 cgd cnt = 0;
333 1.40 rillig DPRINTF(("%s: lookup type=%s, name=%s named=%d\n", __func__,
334 1.16 christos tyname(buf, sizeof(buf), istk->i_type),
335 1.26 christos namedmem ? namedmem->n_name : "*none*", istk->i_namedmem));
336 1.1 cgd for (m = istk->i_type->t_str->memb; m != NULL; m = m->s_nxt) {
337 1.1 cgd if (m->s_field && m->s_name == unnamed)
338 1.1 cgd continue;
339 1.12 christos if (namedmem != NULL) {
340 1.40 rillig DPRINTF(("%s: named lhs.member=%s, rhs.member=%s\n",
341 1.26 christos __func__, m->s_name, namedmem->n_name));
342 1.12 christos if (strcmp(m->s_name, namedmem->n_name) == 0) {
343 1.12 christos cnt++;
344 1.12 christos break;
345 1.12 christos } else
346 1.12 christos continue;
347 1.12 christos }
348 1.1 cgd if (++cnt == 1) {
349 1.1 cgd istk->i_mem = m;
350 1.1 cgd istk->i_subt = m->s_type;
351 1.1 cgd }
352 1.1 cgd }
353 1.12 christos if (namedmem != NULL) {
354 1.12 christos if (m == NULL) {
355 1.40 rillig DPRINTF(("%s: pop struct\n", __func__));
356 1.19 christos goto pop;
357 1.28 rillig }
358 1.26 christos istk->i_mem = m;
359 1.26 christos istk->i_subt = m->s_type;
360 1.19 christos istk->i_namedmem = 1;
361 1.40 rillig DPRINTF(("%s: named name=%s\n", __func__,
362 1.26 christos namedmem->n_name));
363 1.34 rillig pop_member();
364 1.12 christos cnt = istk->i_type->t_tspec == STRUCT ? 2 : 1;
365 1.12 christos }
366 1.26 christos istk->i_brace = 1;
367 1.40 rillig DPRINTF(("%s: unnamed type=%s, brace=%d\n", __func__,
368 1.26 christos tyname(buf, sizeof(buf),
369 1.30 rillig istk->i_type ? istk->i_type : istk->i_subt),
370 1.26 christos istk->i_brace));
371 1.1 cgd if (cnt == 0) {
372 1.1 cgd /* cannot init. struct/union with no named member */
373 1.1 cgd error(179);
374 1.1 cgd initerr = 1;
375 1.1 cgd return;
376 1.1 cgd }
377 1.43 rillig istk->i_remaining = istk->i_type->t_tspec == STRUCT ? cnt : 1;
378 1.1 cgd break;
379 1.1 cgd default:
380 1.12 christos if (namedmem) {
381 1.40 rillig DPRINTF(("%s: pop\n", __func__));
382 1.19 christos pop:
383 1.22 ad inxt = initstk->i_nxt;
384 1.12 christos free(istk);
385 1.22 ad initstk = inxt;
386 1.12 christos goto again;
387 1.12 christos }
388 1.43 rillig istk->i_remaining = 1;
389 1.1 cgd break;
390 1.1 cgd }
391 1.1 cgd }
392 1.1 cgd
393 1.1 cgd static void
394 1.35 rillig initstack_check_too_many(void)
395 1.1 cgd {
396 1.1 cgd istk_t *istk;
397 1.1 cgd
398 1.1 cgd istk = initstk;
399 1.1 cgd
400 1.1 cgd /*
401 1.1 cgd * If a closing brace is expected we have at least one initializer
402 1.1 cgd * too much.
403 1.1 cgd */
404 1.43 rillig if (istk->i_remaining == 0 && !istk->i_nolimit && !istk->i_namedmem) {
405 1.1 cgd switch (istk->i_type->t_tspec) {
406 1.1 cgd case ARRAY:
407 1.1 cgd /* too many array initializers */
408 1.23 christos error(173, istk->i_type->t_dim);
409 1.1 cgd break;
410 1.1 cgd case STRUCT:
411 1.1 cgd case UNION:
412 1.1 cgd /* too many struct/union initializers */
413 1.1 cgd error(172);
414 1.1 cgd break;
415 1.1 cgd default:
416 1.1 cgd /* too many initializers */
417 1.1 cgd error(174);
418 1.1 cgd break;
419 1.1 cgd }
420 1.1 cgd initerr = 1;
421 1.1 cgd }
422 1.1 cgd }
423 1.1 cgd
424 1.1 cgd static void
425 1.37 rillig initstack_next_brace(void)
426 1.1 cgd {
427 1.12 christos char buf[64];
428 1.7 lukem
429 1.37 rillig DPRINTF(("%s\n", __func__));
430 1.37 rillig if (initstk->i_type != NULL &&
431 1.37 rillig tspec_is_scalar(initstk->i_type->t_tspec)) {
432 1.37 rillig /* invalid initializer */
433 1.37 rillig error(176, tyname(buf, sizeof(buf), initstk->i_type));
434 1.37 rillig initerr = 1;
435 1.37 rillig }
436 1.37 rillig if (!initerr)
437 1.37 rillig initstack_check_too_many();
438 1.37 rillig if (!initerr)
439 1.37 rillig initstack_push();
440 1.37 rillig if (!initerr) {
441 1.37 rillig initstk->i_brace = 1;
442 1.40 rillig DPRINTF(("%s: %p %s\n", __func__,
443 1.37 rillig namedmem,
444 1.37 rillig tyname(buf, sizeof(buf),
445 1.40 rillig initstk->i_type ? initstk->i_type : initstk->i_subt)));
446 1.37 rillig }
447 1.37 rillig }
448 1.37 rillig
449 1.37 rillig static void
450 1.37 rillig initstack_next_nobrace(void)
451 1.37 rillig {
452 1.37 rillig
453 1.37 rillig DPRINTF(("%s\n", __func__));
454 1.37 rillig if (initstk->i_type == NULL &&
455 1.37 rillig !tspec_is_scalar(initstk->i_subt->t_tspec)) {
456 1.37 rillig /* {}-enclosed initializer required */
457 1.37 rillig error(181);
458 1.37 rillig }
459 1.37 rillig
460 1.37 rillig /* Make sure an entry with a scalar type is at the top of the stack. */
461 1.37 rillig if (!initerr)
462 1.37 rillig initstack_check_too_many();
463 1.42 rillig while (!initerr) {
464 1.42 rillig if ((initstk->i_type != NULL &&
465 1.42 rillig tspec_is_scalar(initstk->i_type->t_tspec)))
466 1.42 rillig break;
467 1.42 rillig initstack_push();
468 1.1 cgd }
469 1.1 cgd }
470 1.1 cgd
471 1.1 cgd void
472 1.34 rillig init_lbrace(void)
473 1.1 cgd {
474 1.26 christos DPRINTF(("%s\n", __func__));
475 1.7 lukem
476 1.1 cgd if (initerr)
477 1.1 cgd return;
478 1.1 cgd
479 1.1 cgd if ((initsym->s_scl == AUTO || initsym->s_scl == REG) &&
480 1.1 cgd initstk->i_nxt == NULL) {
481 1.29 rillig if (tflag && !tspec_is_scalar(initstk->i_subt->t_tspec))
482 1.1 cgd /* no automatic aggregate initialization in trad. C*/
483 1.1 cgd warning(188);
484 1.1 cgd }
485 1.1 cgd
486 1.1 cgd /*
487 1.1 cgd * Remove all entries which cannot be used for further initializers
488 1.1 cgd * and do not expect a closing brace.
489 1.1 cgd */
490 1.36 rillig initstack_pop_nobrace();
491 1.1 cgd
492 1.37 rillig initstack_next_brace();
493 1.1 cgd }
494 1.1 cgd
495 1.1 cgd void
496 1.34 rillig init_rbrace(void)
497 1.1 cgd {
498 1.26 christos DPRINTF(("%s\n", __func__));
499 1.7 lukem
500 1.1 cgd if (initerr)
501 1.1 cgd return;
502 1.1 cgd
503 1.36 rillig initstack_pop_brace();
504 1.1 cgd }
505 1.1 cgd
506 1.1 cgd void
507 1.7 lukem mkinit(tnode_t *tn)
508 1.1 cgd {
509 1.1 cgd ptrdiff_t offs;
510 1.1 cgd sym_t *sym;
511 1.1 cgd tspec_t lt, rt;
512 1.1 cgd tnode_t *ln;
513 1.1 cgd struct mbl *tmem;
514 1.1 cgd scl_t sc;
515 1.12 christos #ifdef DEBUG
516 1.19 christos char buf[64], sbuf[64];
517 1.12 christos #endif
518 1.1 cgd
519 1.40 rillig DPRINTF(("%s: type=%s, value=%s\n", __func__,
520 1.34 rillig tyname(buf, sizeof(buf), tn->tn_type),
521 1.34 rillig print_tnode(sbuf, sizeof(sbuf), tn)));
522 1.1 cgd if (initerr || tn == NULL)
523 1.25 christos return;
524 1.1 cgd
525 1.1 cgd sc = initsym->s_scl;
526 1.1 cgd
527 1.1 cgd /*
528 1.13 christos * Do not test for automatic aggregate initialisation. If the
529 1.9 wiz * initializer starts with a brace we have the warning already.
530 1.1 cgd * If not, an error will be printed that the initializer must
531 1.1 cgd * be enclosed by braces.
532 1.1 cgd */
533 1.1 cgd
534 1.1 cgd /*
535 1.1 cgd * Local initialisation of non-array-types with only one expression
536 1.1 cgd * without braces is done by ASSIGN
537 1.1 cgd */
538 1.1 cgd if ((sc == AUTO || sc == REG) &&
539 1.1 cgd initsym->s_type->t_tspec != ARRAY && initstk->i_nxt == NULL) {
540 1.1 cgd ln = getnnode(initsym, 0);
541 1.1 cgd ln->tn_type = tduptyp(ln->tn_type);
542 1.1 cgd ln->tn_type->t_const = 0;
543 1.1 cgd tn = build(ASSIGN, ln, tn);
544 1.25 christos expr(tn, 0, 0, 0);
545 1.25 christos return;
546 1.1 cgd }
547 1.1 cgd
548 1.1 cgd /*
549 1.1 cgd * Remove all entries which cannot be used for further initializers
550 1.1 cgd * and do not require a closing brace.
551 1.1 cgd */
552 1.36 rillig initstack_pop_nobrace();
553 1.1 cgd
554 1.35 rillig /* Initialisations by strings are done in initstack_string(). */
555 1.35 rillig if (initstack_string(tn))
556 1.25 christos return;
557 1.1 cgd
558 1.37 rillig initstack_next_nobrace();
559 1.1 cgd if (initerr || tn == NULL)
560 1.25 christos return;
561 1.1 cgd
562 1.43 rillig initstk->i_remaining--;
563 1.43 rillig DPRINTF(("%s: remaining=%d tn=%p\n", __func__,
564 1.43 rillig initstk->i_remaining, tn));
565 1.1 cgd /* Create a temporary node for the left side. */
566 1.1 cgd ln = tgetblk(sizeof (tnode_t));
567 1.1 cgd ln->tn_op = NAME;
568 1.1 cgd ln->tn_type = tduptyp(initstk->i_type);
569 1.1 cgd ln->tn_type->t_const = 0;
570 1.1 cgd ln->tn_lvalue = 1;
571 1.1 cgd ln->tn_sym = initsym; /* better than nothing */
572 1.1 cgd
573 1.1 cgd tn = cconv(tn);
574 1.1 cgd
575 1.1 cgd lt = ln->tn_type->t_tspec;
576 1.1 cgd rt = tn->tn_type->t_tspec;
577 1.1 cgd
578 1.29 rillig if (!tspec_is_scalar(lt))
579 1.11 christos LERROR("mkinit()");
580 1.1 cgd
581 1.1 cgd if (!typeok(INIT, 0, ln, tn))
582 1.25 christos return;
583 1.1 cgd
584 1.1 cgd /*
585 1.38 rillig * Store the tree memory. This is necessary because otherwise
586 1.1 cgd * expr() would free it.
587 1.1 cgd */
588 1.1 cgd tmem = tsave();
589 1.15 christos expr(tn, 1, 0, 1);
590 1.1 cgd trestor(tmem);
591 1.7 lukem
592 1.29 rillig if (tspec_is_int(lt) && ln->tn_type->t_isfield && !tspec_is_int(rt)) {
593 1.1 cgd /*
594 1.1 cgd * Bit-fields can be initialized in trad. C only by integer
595 1.1 cgd * constants.
596 1.1 cgd */
597 1.1 cgd if (tflag)
598 1.1 cgd /* bit-field initialisation is illegal in trad. C */
599 1.1 cgd warning(186);
600 1.1 cgd }
601 1.1 cgd
602 1.1 cgd if (lt != rt || (initstk->i_type->t_isfield && tn->tn_op == CON))
603 1.1 cgd tn = convert(INIT, 0, initstk->i_type, tn);
604 1.1 cgd
605 1.1 cgd if (tn != NULL && tn->tn_op != CON) {
606 1.1 cgd sym = NULL;
607 1.1 cgd offs = 0;
608 1.1 cgd if (conaddr(tn, &sym, &offs) == -1) {
609 1.3 jpo if (sc == AUTO || sc == REG) {
610 1.1 cgd /* non-constant initializer */
611 1.24 christos (void)c99ism(177);
612 1.1 cgd } else {
613 1.1 cgd /* non-constant initializer */
614 1.1 cgd error(177);
615 1.1 cgd }
616 1.1 cgd }
617 1.1 cgd }
618 1.1 cgd }
619 1.1 cgd
620 1.1 cgd
621 1.1 cgd static int
622 1.35 rillig initstack_string(tnode_t *tn)
623 1.1 cgd {
624 1.1 cgd tspec_t t;
625 1.1 cgd istk_t *istk;
626 1.1 cgd int len;
627 1.1 cgd strg_t *strg;
628 1.1 cgd
629 1.1 cgd if (tn->tn_op != STRING)
630 1.33 rillig return 0;
631 1.1 cgd
632 1.1 cgd istk = initstk;
633 1.1 cgd strg = tn->tn_strg;
634 1.1 cgd
635 1.1 cgd /*
636 1.1 cgd * Check if we have an array type which can be initialized by
637 1.1 cgd * the string.
638 1.1 cgd */
639 1.12 christos if (istk->i_subt != NULL && istk->i_subt->t_tspec == ARRAY) {
640 1.26 christos DPRINTF(("%s: subt array\n", __func__));
641 1.1 cgd t = istk->i_subt->t_subt->t_tspec;
642 1.1 cgd if (!((strg->st_tspec == CHAR &&
643 1.1 cgd (t == CHAR || t == UCHAR || t == SCHAR)) ||
644 1.1 cgd (strg->st_tspec == WCHAR && t == WCHAR))) {
645 1.33 rillig return 0;
646 1.1 cgd }
647 1.1 cgd /* Put the array at top of stack */
648 1.35 rillig initstack_push();
649 1.1 cgd istk = initstk;
650 1.1 cgd } else if (istk->i_type != NULL && istk->i_type->t_tspec == ARRAY) {
651 1.26 christos DPRINTF(("%s: type array\n", __func__));
652 1.1 cgd t = istk->i_type->t_subt->t_tspec;
653 1.1 cgd if (!((strg->st_tspec == CHAR &&
654 1.1 cgd (t == CHAR || t == UCHAR || t == SCHAR)) ||
655 1.1 cgd (strg->st_tspec == WCHAR && t == WCHAR))) {
656 1.33 rillig return 0;
657 1.1 cgd }
658 1.1 cgd /*
659 1.1 cgd * If the array is already partly initialized, we are
660 1.1 cgd * wrong here.
661 1.1 cgd */
662 1.43 rillig if (istk->i_remaining != istk->i_type->t_dim)
663 1.33 rillig return 0;
664 1.1 cgd } else {
665 1.33 rillig return 0;
666 1.1 cgd }
667 1.1 cgd
668 1.1 cgd /* Get length without trailing NUL character. */
669 1.1 cgd len = strg->st_len;
670 1.1 cgd
671 1.1 cgd if (istk->i_nolimit) {
672 1.1 cgd istk->i_nolimit = 0;
673 1.1 cgd istk->i_type->t_dim = len + 1;
674 1.32 rillig setcomplete(istk->i_type, 1);
675 1.1 cgd } else {
676 1.1 cgd if (istk->i_type->t_dim < len) {
677 1.1 cgd /* non-null byte ignored in string initializer */
678 1.1 cgd warning(187);
679 1.1 cgd }
680 1.1 cgd }
681 1.1 cgd
682 1.1 cgd /* In every case the array is initialized completely. */
683 1.43 rillig istk->i_remaining = 0;
684 1.1 cgd
685 1.33 rillig return 1;
686 1.1 cgd }
687