lookup.c revision 1.6 1 1.6 lukem /* $NetBSD: lookup.c,v 1.6 1997/10/19 13:59:04 lukem Exp $ */
2 1.5 thorpej
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1983, 1993
5 1.3 cgd * The Regents of the University of California. 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 the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.6 lukem #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.5 thorpej #if 0
39 1.5 thorpej static char sccsid[] = "@(#)lookup.c 8.1 (Berkeley) 6/9/93";
40 1.5 thorpej #else
41 1.6 lukem __RCSID("$NetBSD: lookup.c,v 1.6 1997/10/19 13:59:04 lukem Exp $");
42 1.5 thorpej #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd #include "defs.h"
46 1.1 cgd
47 1.1 cgd /* symbol types */
48 1.1 cgd #define VAR 1
49 1.1 cgd #define CONST 2
50 1.1 cgd
51 1.1 cgd struct syment {
52 1.1 cgd int s_type;
53 1.1 cgd char *s_name;
54 1.1 cgd struct namelist *s_value;
55 1.1 cgd struct syment *s_next;
56 1.1 cgd };
57 1.1 cgd
58 1.1 cgd static struct syment *hashtab[HASHSIZE];
59 1.1 cgd
60 1.1 cgd /*
61 1.1 cgd * Define a variable from a command line argument.
62 1.1 cgd */
63 1.3 cgd void
64 1.1 cgd define(name)
65 1.1 cgd char *name;
66 1.1 cgd {
67 1.6 lukem char *cp, *s;
68 1.6 lukem struct namelist *nl;
69 1.1 cgd struct namelist *value;
70 1.1 cgd
71 1.6 lukem value = NULL;
72 1.6 lukem
73 1.1 cgd if (debug)
74 1.1 cgd printf("define(%s)\n", name);
75 1.1 cgd
76 1.6 lukem cp = strchr(name, '=');
77 1.1 cgd if (cp == NULL)
78 1.1 cgd value = NULL;
79 1.1 cgd else if (cp[1] == '\0') {
80 1.1 cgd *cp = '\0';
81 1.1 cgd value = NULL;
82 1.1 cgd } else if (cp[1] != '(') {
83 1.1 cgd *cp++ = '\0';
84 1.1 cgd value = makenl(cp);
85 1.1 cgd } else {
86 1.1 cgd nl = NULL;
87 1.1 cgd *cp++ = '\0';
88 1.1 cgd do
89 1.1 cgd cp++;
90 1.1 cgd while (*cp == ' ' || *cp == '\t');
91 1.1 cgd for (s = cp; ; s++) {
92 1.1 cgd switch (*s) {
93 1.1 cgd case ')':
94 1.1 cgd *s = '\0';
95 1.1 cgd case '\0':
96 1.1 cgd break;
97 1.1 cgd case ' ':
98 1.1 cgd case '\t':
99 1.1 cgd *s++ = '\0';
100 1.1 cgd while (*s == ' ' || *s == '\t')
101 1.1 cgd s++;
102 1.1 cgd if (*s == ')')
103 1.1 cgd *s = '\0';
104 1.1 cgd break;
105 1.1 cgd default:
106 1.1 cgd continue;
107 1.1 cgd }
108 1.1 cgd if (nl == NULL)
109 1.1 cgd value = nl = makenl(cp);
110 1.1 cgd else {
111 1.1 cgd nl->n_next = makenl(cp);
112 1.1 cgd nl = nl->n_next;
113 1.1 cgd }
114 1.1 cgd if (*s == '\0')
115 1.1 cgd break;
116 1.1 cgd cp = s;
117 1.1 cgd }
118 1.1 cgd }
119 1.1 cgd (void) lookup(name, REPLACE, value);
120 1.1 cgd }
121 1.1 cgd
122 1.1 cgd /*
123 1.1 cgd * Lookup name in the table and return a pointer to it.
124 1.1 cgd * LOOKUP - just do lookup, return NULL if not found.
125 1.1 cgd * INSERT - insert name with value, error if already defined.
126 1.1 cgd * REPLACE - insert or replace name with value.
127 1.1 cgd */
128 1.1 cgd
129 1.1 cgd struct namelist *
130 1.1 cgd lookup(name, action, value)
131 1.1 cgd char *name;
132 1.1 cgd int action;
133 1.1 cgd struct namelist *value;
134 1.1 cgd {
135 1.6 lukem unsigned n;
136 1.6 lukem char *cp;
137 1.6 lukem struct syment *s;
138 1.1 cgd char buf[256];
139 1.1 cgd
140 1.1 cgd if (debug)
141 1.6 lukem printf("lookup(%s, %d, %lx)\n", name, action, (long)value);
142 1.1 cgd
143 1.1 cgd n = 0;
144 1.1 cgd for (cp = name; *cp; )
145 1.1 cgd n += *cp++;
146 1.1 cgd n %= HASHSIZE;
147 1.1 cgd
148 1.1 cgd for (s = hashtab[n]; s != NULL; s = s->s_next) {
149 1.1 cgd if (strcmp(name, s->s_name))
150 1.1 cgd continue;
151 1.1 cgd if (action != LOOKUP) {
152 1.1 cgd if (action != INSERT || s->s_type != CONST) {
153 1.4 thorpej (void)snprintf(buf, sizeof(buf),
154 1.4 thorpej "%s redefined", name);
155 1.1 cgd yyerror(buf);
156 1.1 cgd }
157 1.1 cgd }
158 1.1 cgd return(s->s_value);
159 1.1 cgd }
160 1.1 cgd
161 1.1 cgd if (action == LOOKUP) {
162 1.4 thorpej (void)snprintf(buf, sizeof(buf), "%s undefined", name);
163 1.1 cgd yyerror(buf);
164 1.1 cgd return(NULL);
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd s = ALLOC(syment);
168 1.1 cgd if (s == NULL)
169 1.1 cgd fatal("ran out of memory\n");
170 1.1 cgd s->s_next = hashtab[n];
171 1.1 cgd hashtab[n] = s;
172 1.1 cgd s->s_type = action == INSERT ? VAR : CONST;
173 1.1 cgd s->s_name = name;
174 1.1 cgd s->s_value = value;
175 1.1 cgd return(value);
176 1.1 cgd }
177