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