2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)lookup.c 8.1 (Berkeley) 6/9/93
30 * $FreeBSD: src/usr.bin/rdist/lookup.c,v 1.6 1999/08/28 01:05:07 peter Exp $
31 * $DragonFly: src/usr.bin/rdist/lookup.c,v 1.4 2008/10/16 01:52:33 swildner Exp $
43 struct namelist *s_value;
44 struct syment *s_next;
47 static struct syment *hashtab[HASHSIZE];
50 * Define a variable from a command line argument.
57 struct namelist *value;
62 printf("define(%s)\n", name);
64 cp = index(name, '=');
67 else if (cp[1] == '\0') {
70 } else if (cp[1] != '(') {
78 while (*cp == ' ' || *cp == '\t');
88 while (*s == ' ' || *s == '\t')
97 value = nl = makenl(cp);
99 nl->n_next = makenl(cp);
107 lookup(name, REPLACE, value);
111 * Lookup name in the table and return a pointer to it.
112 * LOOKUP - just do lookup, return NULL if not found.
113 * INSERT - insert name with value, error if already defined.
114 * REPLACE - insert or replace name with value.
117 lookup(char *name, int action, struct namelist *value)
125 printf("lookup(%s, %d, %p)\n", name, action, value);
128 for (cp = name; *cp; )
132 for (s = hashtab[n]; s != NULL; s = s->s_next) {
133 if (strcmp(name, s->s_name))
135 if (action != LOOKUP) {
136 if (action != INSERT || s->s_type != CONST) {
137 snprintf(buf, sizeof(buf),"%s redefined", name);
144 if (action == LOOKUP) {
145 snprintf(buf, sizeof(buf), "%s undefined", name);
152 fatal("ran out of memory\n");
153 s->s_next = hashtab[n];
155 s->s_type = action == INSERT ? VAR : CONST;