Return to look.c CVS log

Up to [local] / src / usr.bin / m4

Annotation of src/usr.bin/m4/look.c, Revision 1.4

1.4     ! espie       1: /*     $OpenBSD: look.c,v 1.3 1999/09/06 13:10:48 espie Exp $  */
1.2       deraadt     2:
1.1       deraadt     3: /*
                      4:  * Copyright (c) 1989, 1993
                      5:  *     The Regents of the University of California.  All rights reserved.
                      6:  *
                      7:  * This code is derived from software contributed to Berkeley by
                      8:  * Ozan Yigit at York University.
                      9:  *
                     10:  * Redistribution and use in source and binary forms, with or without
                     11:  * modification, are permitted provided that the following conditions
                     12:  * are met:
                     13:  * 1. Redistributions of source code must retain the above copyright
                     14:  *    notice, this list of conditions and the following disclaimer.
                     15:  * 2. Redistributions in binary form must reproduce the above copyright
                     16:  *    notice, this list of conditions and the following disclaimer in the
                     17:  *    documentation and/or other materials provided with the distribution.
                     18:  * 3. All advertising materials mentioning features or use of this software
                     19:  *    must display the following acknowledgement:
                     20:  *     This product includes software developed by the University of
                     21:  *     California, Berkeley and its contributors.
                     22:  * 4. Neither the name of the University nor the names of its contributors
                     23:  *    may be used to endorse or promote products derived from this software
                     24:  *    without specific prior written permission.
                     25:  *
                     26:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
                     27:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
                     28:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
                     29:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
                     30:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
                     31:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
                     32:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
                     33:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
                     34:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
                     35:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
                     36:  * SUCH DAMAGE.
                     37:  */
                     38:
                     39: #ifndef lint
                     40: static char sccsid[] = "@(#)look.c     8.1 (Berkeley) 6/6/93";
                     41: #endif /* not lint */
                     42:
                     43: /*
                     44:  * look.c
                     45:  * Facility: m4 macro processor
                     46:  * by: oz
                     47:  */
                     48:
                     49: #include <sys/types.h>
                     50: #include <stdio.h>
                     51: #include <stdlib.h>
1.3       espie      52: #include <stddef.h>
1.1       deraadt    53: #include <string.h>
                     54: #include "mdef.h"
                     55: #include "stdd.h"
                     56: #include "extern.h"
                     57:
                     58: int
                     59: hash(name)
1.4     ! espie      60:        char *name;
1.1       deraadt    61: {
1.4     ! espie      62:        unsigned long h = 0;
1.1       deraadt    63:        while (*name)
                     64:                h = (h << 5) + h + *name++;
                     65:        return (h % HASHSIZE);
                     66: }
                     67:
                     68: /*
                     69:  * find name in the hash table
                     70:  */
                     71: ndptr
                     72: lookup(name)
1.4     ! espie      73:        char *name;
1.1       deraadt    74: {
1.4     ! espie      75:        ndptr p;
1.1       deraadt    76:
                     77:        for (p = hashtab[hash(name)]; p != nil; p = p->nxtptr)
                     78:                if (STREQ(name, p->name))
                     79:                        break;
                     80:        return (p);
                     81: }
                     82:
                     83: /*
                     84:  * hash and create an entry in the hash table.
                     85:  * The new entry is added in front of a hash bucket.
                     86:  */
                     87: ndptr
                     88: addent(name)
1.4     ! espie      89:        char *name;
1.1       deraadt    90: {
1.4     ! espie      91:        int h;
1.1       deraadt    92:        ndptr p;
                     93:
                     94:        h = hash(name);
                     95:        p = (ndptr) xalloc(sizeof(struct ndblock));
                     96:        p->nxtptr = hashtab[h];
                     97:        hashtab[h] = p;
                     98:        p->name = xstrdup(name);
                     99:        return p;
                    100: }
                    101:
                    102: static void
                    103: freent(p)
1.4     ! espie     104:        ndptr p;
1.1       deraadt   105: {
                    106:        if (!(p->type & STATIC)) {
                    107:                free((char *) p->name);
                    108:                if (p->defn != null)
                    109:                        free((char *) p->defn);
                    110:        }
                    111:        free((char *) p);
                    112: }
                    113:
                    114: /*
                    115:  * remove an entry from the hashtable
                    116:  */
                    117: void
                    118: remhash(name, all)
1.4     ! espie     119:        char *name;
        !           120:        int all;
1.1       deraadt   121: {
1.4     ! espie     122:        int h;
        !           123:        ndptr xp, tp, mp;
1.1       deraadt   124:
                    125:        h = hash(name);
                    126:        mp = hashtab[h];
                    127:        tp = nil;
                    128:        while (mp != nil) {
                    129:                if (STREQ(mp->name, name)) {
                    130:                        mp = mp->nxtptr;
                    131:                        if (tp == nil) {
                    132:                                freent(hashtab[h]);
                    133:                                hashtab[h] = mp;
                    134:                        }
                    135:                        else {
                    136:                                xp = tp->nxtptr;
                    137:                                tp->nxtptr = mp;
                    138:                                freent(xp);
                    139:                        }
                    140:                        if (!all)
                    141:                                break;
                    142:                }
                    143:                else {
                    144:                        tp = mp;
                    145:                        mp = mp->nxtptr;
                    146:                }
                    147:        }
                    148: }