| 1 | /* | 
|---|
| 2 | * Copyright (c) 1989 The Regents of the University of California. | 
|---|
| 3 | * All rights reserved. | 
|---|
| 4 | * | 
|---|
| 5 | * This code is derived from software contributed to Berkeley by | 
|---|
| 6 | * Robert Paul Corbett. | 
|---|
| 7 | * | 
|---|
| 8 | * Redistribution and use in source and binary forms, with or without | 
|---|
| 9 | * modification, are permitted provided that the following conditions | 
|---|
| 10 | * are met: | 
|---|
| 11 | * 1. Redistributions of source code must retain the above copyright | 
|---|
| 12 | *    notice, this list of conditions and the following disclaimer. | 
|---|
| 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 | * 3. All advertising materials mentioning features or use of this software | 
|---|
| 17 | *    must display the following acknowledgement: | 
|---|
| 18 | *      This product includes software developed by the University of | 
|---|
| 19 | *      California, Berkeley and its contributors. | 
|---|
| 20 | * 4. Neither the name of the University nor the names of its contributors | 
|---|
| 21 | *    may be used to endorse or promote products derived from this software | 
|---|
| 22 | *    without specific prior written permission. | 
|---|
| 23 | * | 
|---|
| 24 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | 
|---|
| 25 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 
|---|
| 26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | 
|---|
| 27 | * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | 
|---|
| 28 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | 
|---|
| 29 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | 
|---|
| 30 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | 
|---|
| 31 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | 
|---|
| 32 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | 
|---|
| 33 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | 
|---|
| 34 | * SUCH DAMAGE. | 
|---|
| 35 | */ | 
|---|
| 36 |  | 
|---|
| 37 | #if 0 | 
|---|
| 38 | #ifndef lint | 
|---|
| 39 | static char sccsid[] = "@(#)symtab.c    5.3 (Berkeley) 6/1/90"; | 
|---|
| 40 | #endif | 
|---|
| 41 | #endif | 
|---|
| 42 |  | 
|---|
| 43 | #include <sys/cdefs.h> | 
|---|
| 44 | __FBSDID("$FreeBSD: src/usr.bin/yacc/symtab.c,v 1.12 2002/04/09 11:39:05 ru Exp $"); | 
|---|
| 45 |  | 
|---|
| 46 | #include <stdlib.h> | 
|---|
| 47 | #include <string.h> | 
|---|
| 48 | #include "defs.h" | 
|---|
| 49 |  | 
|---|
| 50 | /* TABLE_SIZE is the number of entries in the symbol table. */ | 
|---|
| 51 | /* TABLE_SIZE must be a power of two.                       */ | 
|---|
| 52 |  | 
|---|
| 53 | #define TABLE_SIZE 1024 | 
|---|
| 54 |  | 
|---|
| 55 | static int hash(const char *); | 
|---|
| 56 |  | 
|---|
| 57 | bucket **symbol_table; | 
|---|
| 58 | bucket *first_symbol; | 
|---|
| 59 | bucket *last_symbol; | 
|---|
| 60 |  | 
|---|
| 61 |  | 
|---|
| 62 | static int | 
|---|
| 63 | hash(name) | 
|---|
| 64 | const char *name; | 
|---|
| 65 | { | 
|---|
| 66 | const char *s; | 
|---|
| 67 | int c, k; | 
|---|
| 68 |  | 
|---|
| 69 | assert(name && *name); | 
|---|
| 70 | s = name; | 
|---|
| 71 | k = *s; | 
|---|
| 72 | while ((c = *++s)) | 
|---|
| 73 | k = (31*k + c) & (TABLE_SIZE - 1); | 
|---|
| 74 |  | 
|---|
| 75 | return (k); | 
|---|
| 76 | } | 
|---|
| 77 |  | 
|---|
| 78 |  | 
|---|
| 79 | bucket * | 
|---|
| 80 | make_bucket(name) | 
|---|
| 81 | const char *name; | 
|---|
| 82 | { | 
|---|
| 83 | bucket *bp; | 
|---|
| 84 |  | 
|---|
| 85 | assert(name); | 
|---|
| 86 | bp = (bucket *) MALLOC(sizeof(bucket)); | 
|---|
| 87 | if (bp == 0) no_space(); | 
|---|
| 88 | bp->link = 0; | 
|---|
| 89 | bp->next = 0; | 
|---|
| 90 | bp->name = MALLOC(strlen(name) + 1); | 
|---|
| 91 | if (bp->name == 0) no_space(); | 
|---|
| 92 | bp->tag = 0; | 
|---|
| 93 | bp->value = UNDEFINED; | 
|---|
| 94 | bp->index = 0; | 
|---|
| 95 | bp->prec = 0; | 
|---|
| 96 | bp-> class = UNKNOWN; | 
|---|
| 97 | bp->assoc = TOKEN; | 
|---|
| 98 |  | 
|---|
| 99 | if (bp->name == 0) no_space(); | 
|---|
| 100 | strcpy(bp->name, name); | 
|---|
| 101 |  | 
|---|
| 102 | return (bp); | 
|---|
| 103 | } | 
|---|
| 104 |  | 
|---|
| 105 |  | 
|---|
| 106 | bucket * | 
|---|
| 107 | lookup(name) | 
|---|
| 108 | char *name; | 
|---|
| 109 | { | 
|---|
| 110 | bucket *bp, **bpp; | 
|---|
| 111 |  | 
|---|
| 112 | bpp = symbol_table + hash(name); | 
|---|
| 113 | bp = *bpp; | 
|---|
| 114 |  | 
|---|
| 115 | while (bp) | 
|---|
| 116 | { | 
|---|
| 117 | if (strcmp(name, bp->name) == 0) return (bp); | 
|---|
| 118 | bpp = &bp->link; | 
|---|
| 119 | bp = *bpp; | 
|---|
| 120 | } | 
|---|
| 121 |  | 
|---|
| 122 | *bpp = bp = make_bucket(name); | 
|---|
| 123 | last_symbol->next = bp; | 
|---|
| 124 | last_symbol = bp; | 
|---|
| 125 |  | 
|---|
| 126 | return (bp); | 
|---|
| 127 | } | 
|---|
| 128 |  | 
|---|
| 129 |  | 
|---|
| 130 | void | 
|---|
| 131 | create_symbol_table() | 
|---|
| 132 | { | 
|---|
| 133 | int i; | 
|---|
| 134 | bucket *bp; | 
|---|
| 135 |  | 
|---|
| 136 | symbol_table = (bucket **) MALLOC(TABLE_SIZE*sizeof(bucket *)); | 
|---|
| 137 | if (symbol_table == 0) no_space(); | 
|---|
| 138 | for (i = 0; i < TABLE_SIZE; i++) | 
|---|
| 139 | symbol_table[i] = 0; | 
|---|
| 140 |  | 
|---|
| 141 | bp = make_bucket("error"); | 
|---|
| 142 | bp->index = 1; | 
|---|
| 143 | bp->class = TERM; | 
|---|
| 144 |  | 
|---|
| 145 | first_symbol = bp; | 
|---|
| 146 | last_symbol = bp; | 
|---|
| 147 | symbol_table[hash("error")] = bp; | 
|---|
| 148 | } | 
|---|
| 149 |  | 
|---|
| 150 |  | 
|---|
| 151 | void | 
|---|
| 152 | free_symbol_table() | 
|---|
| 153 | { | 
|---|
| 154 | FREE(symbol_table); | 
|---|
| 155 | symbol_table = 0; | 
|---|
| 156 | } | 
|---|
| 157 |  | 
|---|
| 158 |  | 
|---|
| 159 | void | 
|---|
| 160 | free_symbols() | 
|---|
| 161 | { | 
|---|
| 162 | bucket *p, *q; | 
|---|
| 163 |  | 
|---|
| 164 | for (p = first_symbol; p; p = q) | 
|---|
| 165 | { | 
|---|
| 166 | q = p->next; | 
|---|
| 167 | FREE(p); | 
|---|
| 168 | } | 
|---|
| 169 | } | 
|---|