/* $OpenBSD: init.c,v 1.10 2006/05/29 20:47:22 cloder Exp $ */ /* $NetBSD: init.c,v 1.4 1995/10/02 17:21:37 jpo Exp $ */ /* * Copyright (c) 1994, 1995 Jochen Pohl * All Rights Reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by Jochen Pohl for * The NetBSD Project. * 4. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef lint static char rcsid[] = "$OpenBSD: init.c,v 1.10 2006/05/29 20:47:22 cloder Exp $"; #endif #include #include "lint1.h" /* * initerr is set as soon as a fatal error occurred in an initialisation. * The effect is that the rest of the initialisation is ignored (parsed * by yacc, expression trees built, but no initialisation takes place). */ int initerr; /* Pointer to the symbol which is to be initialized. */ sym_t *initsym; /* Points to the top element of the initialisation stack. */ istk_t *initstk; static void popi2(void); static void popinit(int); static void pushinit(void); static void testinit(void); static void nextinit(int); static int strginit(tnode_t *); /* * Initialize the initialisation stack by putting an entry for the variable * which is to be initialized on it. */ void prepinit(void) { istk_t *istk; if (initerr) return; /* free memory used in last initialisation */ while ((istk = initstk) != NULL) { initstk = istk->i_nxt; free(istk); } /* * If the type which is to be initialized is an incomplete type, * it must be duplicated. */ if (initsym->s_type->t_tspec == ARRAY && incompl(initsym->s_type)) initsym->s_type = duptyp(initsym->s_type); istk = initstk = xcalloc(1, sizeof (istk_t)); istk->i_subt = initsym->s_type; istk->i_cnt = 1; } static void popi2(void) { istk_t *istk; sym_t *m; initstk = (istk = initstk)->i_nxt; if (initstk == NULL) lerror("popi2() 1"); free(istk); istk = initstk; istk->i_cnt--; if (istk->i_cnt < 0) lerror("popi2() 3"); /* * If the removed element was a structure member, we must go * to the next structure member. */ if (istk->i_cnt > 0 && istk->i_type->t_tspec == STRUCT) { do { m = istk->i_mem = istk->i_mem->s_nxt; if (m == NULL) lerror("popi2() 2"); } while (m->s_field && m->s_name == unnamed); istk->i_subt = m->s_type; } } static void popinit(int brace) { if (brace) { /* * Take all entries, including the first which requires * a closing brace, from the stack. */ do { brace = initstk->i_brace; popi2(); } while (!brace); } else { /* * Take all entries which cannot be used for further * initializers from the stack, but do this only if * they do not require a closing brace. */ while (!initstk->i_brace && initstk->i_cnt == 0 && !initstk->i_nolimit) { popi2(); } } } static void pushinit(void) { istk_t *istk; int cnt; sym_t *m; istk = initstk; /* Extend an incomplete array type by one element */ if (istk->i_cnt == 0) { /* * Inside of other aggregate types must not be an incomplete * type. */ if (istk->i_nxt->i_nxt != NULL) lerror("pushinit() 1"); istk->i_cnt = 1; if (istk->i_type->t_tspec != ARRAY) lerror("pushinit() 2"); istk->i_type->t_dim++; /* from now its an complete type */ setcompl(istk->i_type, 0); } if (istk->i_cnt <= 0) lerror("pushinit() 3"); if (istk->i_type != NULL && issclt(istk->i_type->t_tspec)) lerror("pushinit() 4"); initstk = xcalloc(1, sizeof (istk_t)); initstk->i_nxt = istk; initstk->i_type = istk->i_subt; if (initstk->i_type->t_tspec == FUNC) lerror("pushinit() 5"); istk = initstk; switch (istk->i_type->t_tspec) { case ARRAY: if (incompl(istk->i_type) && istk->i_nxt->i_nxt != NULL) { /* initialisation of an incomplete type */ error(175); initerr = 1; return; } istk->i_subt = istk->i_type->t_subt; istk->i_nolimit = incompl(istk->i_type); istk->i_cnt = istk->i_type->t_dim; break; case UNION: /* FALLTHROUGH */ case STRUCT: if (incompl(istk->i_type)) { /* initialisation of an incomplete type */ error(175); initerr = 1; return; } cnt = 0; for (m = istk->i_type->t_str->memb; m != NULL; m = m->s_nxt) { if (m->s_field && m->s_name == unnamed) continue; if (++cnt == 1) { istk->i_mem = m; istk->i_subt = m->s_type; } } if (cnt == 0) { /* cannot init. struct/union with no named member */ error(179); initerr = 1; return; } istk->i_cnt = istk->i_type->t_tspec == STRUCT ? cnt : 1; break; default: istk->i_cnt = 1; break; } } static void testinit(void) { istk_t *istk; istk = initstk; /* * If a closing brace is expected we have at least one initializer * too much. */ if (istk->i_cnt == 0 && !istk->i_nolimit) { switch (istk->i_type->t_tspec) { case ARRAY: /* too many array initializers */ error(173); break; case STRUCT: case UNION: /* too many struct/union initializers */ error(172); break; default: /* too many initializers */ error(174); break; } initerr = 1; } } static void nextinit(int brace) { if (!brace) { if (initstk->i_type == NULL && !issclt(initstk->i_subt->t_tspec)) { /* {}-enclosed initializer required */ error(181); } /* * Make sure an entry with a scalar type is at the top * of the stack. */ if (!initerr) testinit(); while (!initerr && (initstk->i_type == NULL || !issclt(initstk->i_type->t_tspec))) { if (!initerr) pushinit(); } } else { if (initstk->i_type != NULL && issclt(initstk->i_type->t_tspec)) { /* invalid initializer */ error(176); initerr = 1; } if (!initerr) testinit(); if (!initerr) pushinit(); if (!initerr) initstk->i_brace = 1; } } void initlbr(void) { if (initerr) return; /* * Remove all entries which cannot be used for further initializers * and do not expect a closing brace. */ popinit(0); nextinit(1); } void initrbr(void) { if (initerr) return; popinit(1); } void mkinit(tnode_t *tn) { ptrdiff_t offs; sym_t *sym; tspec_t lt, rt; tnode_t *ln; struct mbl *tmem; scl_t sc; if (initerr || tn == NULL) goto end; sc = initsym->s_scl; /* * Do not test for automatic aggregate initialisation. If the * initalizer starts with a brace we have the warning already. * If not, an error will be printed that the initializer must * be enclosed by braces. */ /* * Local initialisation of non-array-types with only one expression * without braces is done by ASSIGN */ if ((sc == AUTO || sc == REG) && initsym->s_type->t_tspec != ARRAY && initstk->i_nxt == NULL) { ln = getnnode(initsym, 0); ln->tn_type = tduptyp(ln->tn_type); ln->tn_type->t_const = 0; tn = build(ASSIGN, ln, tn); expr(tn, 0, 0); goto end; } /* * Remove all entries which cannot be used for further initializers * and do not require a closing brace. */ popinit(0); /* Initialisations by strings are done in strginit(). */ if (strginit(tn)) goto end; nextinit(0); if (initerr || tn == NULL) goto end; initstk->i_cnt--; /* Create a temporary node for the left side. */ ln = tgetblk(sizeof (tnode_t)); ln->tn_op = NAME; ln->tn_type = tduptyp(initstk->i_type); ln->tn_type->t_const = 0; ln->tn_lvalue = 1; ln->tn_sym = initsym; /* better than nothing */ tn = cconv(tn); lt = ln->tn_type->t_tspec; rt = tn->tn_type->t_tspec; if (!issclt(lt)) lerror("mkinit() 1"); if (!typeok(INIT, NULL, ln, tn)) goto end; /* * Store the tree memory. This is nessesary because otherwise * expr() would free it. */ tmem = tsave(); expr(tn, 1, 0); trestor(tmem); if (lt != rt || (initstk->i_type->t_isfield && tn->tn_op == CON)) tn = convert(INIT, NULL, initstk->i_type, tn); if (tn != NULL && tn->tn_op != CON) { sym = NULL; offs = 0; if (conaddr(tn, &sym, &offs) == -1) { if (sc == AUTO || sc == REG) { /* non-constant initializer */ (void)gnuism(177); } else { /* non-constant initializer */ error(177); } } } end: tfreeblk(); } static int strginit(tnode_t *tn) { tspec_t t; istk_t *istk; int len; strg_t *strg; if (tn->tn_op != STRING) return (0); istk = initstk; strg = tn->tn_strg; /* * Check if we have an array type which can be initialized by * the string. */ if (istk->i_subt != NULL && istk->i_subt->t_tspec == ARRAY) { t = istk->i_subt->t_subt->t_tspec; if (!((strg->st_tspec == CHAR && (t == CHAR || t == UCHAR || t == SCHAR)) || (strg->st_tspec == WCHAR && t == WCHAR))) { return (0); } /* Put the array at top of stack */ pushinit(); istk = initstk; } else if (istk->i_type != NULL && istk->i_type->t_tspec == ARRAY) { t = istk->i_type->t_subt->t_tspec; if (!((strg->st_tspec == CHAR && (t == CHAR || t == UCHAR || t == SCHAR)) || (strg->st_tspec == WCHAR && t == WCHAR))) { return (0); } /* * If the array is already partly initialized, we are * wrong here. */ if (istk->i_cnt != istk->i_type->t_dim) return (0); } else { return (0); } /* Get length without trailing NUL character. */ len = strg->st_len; if (istk->i_nolimit) { istk->i_nolimit = 0; istk->i_type->t_dim = len + 1; /* from now complete type */ setcompl(istk->i_type, 0); } else { if (istk->i_type->t_dim < len) { /* non-null byte ignored in string initializer */ warning(187); } } /* In every case the array is initialized completely. */ istk->i_cnt = 0; return (1); }