2 * Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 struct symhead symbols;
45 Symbol *s1 = (Symbol *) a;
46 Symbol *s2 = (Symbol *) b;
48 return strcmp(s1->name, s2->name);
54 Symbol *s = (Symbol *) a;
56 return hashjpw(s->name);
62 htab = hashtabnew(101, cmp, hash);
72 if (*p == '-' || *p == '.')
82 s = (Symbol *) hashtabsearch(htab, (void *) &key);
84 s = (Symbol *) ecalloc(1, sizeof(*s));
86 s->gen_name = estrdup(name);
87 output_name(s->gen_name);
88 s->stype = SUndefined;
90 //HEIM_TAILQ_INSERT_TAIL(&symbols, s, symlist);
92 if (((s)->symlist.tqe_next = (&symbols)->tqh_first) != NULL)
93 (&symbols)->tqh_first->symlist.tqe_prev = &(s)->symlist.tqe_next;
95 (&symbols)->tqh_last = &(s)->symlist.tqe_next;
96 (&symbols)->tqh_first = (s);
97 (s)->symlist.tqe_prev = &(&symbols)->tqh_first;
109 return (Symbol *) hashtabsearch(htab, (void *) &key);
113 checkfunc(void *ptr, void *arg)
116 if (s->stype == SUndefined) {
117 lex_error_message("%s is still undefined\n", s->name);
127 hashtabforeach(htab, checkfunc, &f);
133 generate_1type(void *ptr, void *arg)
137 if (s->stype == Stype && s->type)
148 if (checkundefined())
149 errx(1, "Some types are undefined");
150 HEIM_TAILQ_FOREACH_REVERSE(s, &symbols, symhead, symlist) {
151 if (s->stype == Stype && s->type)
154 //hashtabforeach(htab, generate_1type, NULL);
158 emitted_declaration(const Symbol *s)
160 ((Symbol *)(uintptr_t)s)->emitted_declaration = 1;
164 emitted_definition(const Symbol *s)
166 ((Symbol *)(uintptr_t)s)->emitted_definition = 1;
170 emitted_tag_enums(const Symbol *s)
172 ((Symbol *)(uintptr_t)s)->emitted_tag_enums = 1;