/* [<][>][^][v][top][bottom][index][help] */
DEFINITIONS
This source file includes following definitions.
- cmp
- hash
- initsym
- output_name
- addsym
- checkfunc
- checkundefined
1 /*
2 * Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 *
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.
16 *
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34 #include "gen_locl.h"
35 #include "lex.h"
36
37 RCSID("$Id$");
38
39 static Hashtab *htab;
40
41 static int
42 cmp(void *a, void *b)
/* [<][>][^][v][top][bottom][index][help] */
43 {
44 Symbol *s1 = (Symbol *) a;
45 Symbol *s2 = (Symbol *) b;
46
47 return strcmp(s1->name, s2->name);
48 }
49
50 static unsigned
51 hash(void *a)
/* [<][>][^][v][top][bottom][index][help] */
52 {
53 Symbol *s = (Symbol *) a;
54
55 return hashjpw(s->name);
56 }
57
58 void
59 initsym(void)
/* [<][>][^][v][top][bottom][index][help] */
60 {
61 htab = hashtabnew(101, cmp, hash);
62 }
63
64
65 void
66 output_name(char *s)
/* [<][>][^][v][top][bottom][index][help] */
67 {
68 char *p;
69
70 for (p = s; *p; ++p)
71 if (*p == '-')
72 *p = '_';
73 }
74
75 Symbol *
76 addsym(char *name)
/* [<][>][^][v][top][bottom][index][help] */
77 {
78 Symbol key, *s;
79
80 key.name = name;
81 s = (Symbol *) hashtabsearch(htab, (void *) &key);
82 if (s == NULL) {
83 s = (Symbol *) emalloc(sizeof(*s));
84 s->name = name;
85 s->gen_name = estrdup(name);
86 output_name(s->gen_name);
87 s->stype = SUndefined;
88 hashtabadd(htab, s);
89 }
90 return s;
91 }
92
93 static int
94 checkfunc(void *ptr, void *arg)
/* [<][>][^][v][top][bottom][index][help] */
95 {
96 Symbol *s = ptr;
97 if (s->stype == SUndefined) {
98 error_message("%s is still undefined\n", s->name);
99 *(int *) arg = 1;
100 }
101 return 0;
102 }
103
104 int
105 checkundefined(void)
/* [<][>][^][v][top][bottom][index][help] */
106 {
107 int f = 0;
108 hashtabforeach(htab, checkfunc, &f);
109 return f;
110 }