1 /* sym - symbol table routines */
4 * Copyright (c) 1990 The Regents of the University of California.
7 * This code is derived from software contributed to Berkeley by
10 * The United States Government has rights in this work pursuant
11 * to contract no. DE-AC03-76SF00098 between the United States
12 * Department of Energy and the University of California.
14 * Redistribution and use in source and binary forms are permitted provided
15 * that: (1) source distributions retain this entire copyright notice and
16 * comment, and (2) distributions including binaries display the following
17 * acknowledgement: ``This product includes software developed by the
18 * University of California, Berkeley and its contributors'' in the
19 * documentation or other materials provided with the distribution and in
20 * all advertising materials mentioning features or use of this software.
21 * Neither the name of the University nor the names of its contributors may
22 * be used to endorse or promote products derived from this software without
23 * specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
25 * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
26 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
29 /* $Header: /home/daffy/u0/vern/flex/RCS/sym.c,v 2.19 95/03/04 16:11:04 vern Exp $ */
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
36 /* declare functions that have forward references */
38 int hashfunct PROTO((char[], int));
41 struct hash_entry *ndtbl[NAME_TABLE_HASH_SIZE];
42 struct hash_entry *sctbl[START_COND_HASH_SIZE];
43 struct hash_entry *ccltab[CCL_HASH_SIZE];
45 struct hash_entry *findsym();
48 /* addsym - add symbol and definitions to symbol table
50 * -1 is returned if the symbol already exists, and the change not made.
53 int addsym( sym, str_def, int_def, table, table_size )
60 int hash_val = hashfunct( sym, table_size );
61 struct hash_entry *sym_entry = table[hash_val];
62 struct hash_entry *new_entry;
63 struct hash_entry *successor;
67 if ( ! strcmp( sym, sym_entry->name ) )
68 { /* entry already exists */
72 sym_entry = sym_entry->next;
75 /* create new entry */
76 new_entry = (struct hash_entry *)
77 flex_alloc( sizeof( struct hash_entry ) );
79 if ( new_entry == NULL )
80 flexfatal( _( "symbol table memory allocation failed" ) );
82 if ( (successor = table[hash_val]) != 0 )
84 new_entry->next = successor;
85 successor->prev = new_entry;
88 new_entry->next = NULL;
90 new_entry->prev = NULL;
91 new_entry->name = sym;
92 new_entry->str_val = str_def;
93 new_entry->int_val = int_def;
95 table[hash_val] = new_entry;
101 /* cclinstal - save the text of a character class */
103 void cclinstal( ccltxt, cclnum )
107 /* We don't bother checking the return status because we are not
108 * called unless the symbol is new.
110 Char *copy_unsigned_string();
112 (void) addsym( (char *) copy_unsigned_string( ccltxt ),
114 ccltab, CCL_HASH_SIZE );
118 /* ccllookup - lookup the number associated with character class text
120 * Returns 0 if there's no CCL associated with the text.
123 int ccllookup( ccltxt )
126 return findsym( (char *) ccltxt, ccltab, CCL_HASH_SIZE )->int_val;
130 /* findsym - find symbol in symbol table */
132 struct hash_entry *findsym( sym, table, table_size )
137 static struct hash_entry empty_entry =
139 (struct hash_entry *) 0, (struct hash_entry *) 0,
140 (char *) 0, (char *) 0, 0,
142 struct hash_entry *sym_entry =
143 table[hashfunct( sym, table_size )];
147 if ( ! strcmp( sym, sym_entry->name ) )
149 sym_entry = sym_entry->next;
156 /* hashfunct - compute the hash value for "str" and hash size "hash_size" */
158 int hashfunct( str, hash_size )
168 while ( str[locstr] )
170 hashval = (hashval << 1) + (unsigned char) str[locstr++];
171 hashval %= hash_size;
178 /* ndinstal - install a name definition */
180 void ndinstal( name, definition )
185 Char *copy_unsigned_string();
187 if ( addsym( copy_string( name ),
188 (char *) copy_unsigned_string( definition ), 0,
189 ndtbl, NAME_TABLE_HASH_SIZE ) )
190 synerr( _( "name defined twice" ) );
194 /* ndlookup - lookup a name definition
196 * Returns a nil pointer if the name definition does not exist.
202 return (Char *) findsym( nd, ndtbl, NAME_TABLE_HASH_SIZE )->str_val;
206 /* scextend - increase the maximum number of start conditions */
210 current_max_scs += MAX_SCS_INCREMENT;
214 scset = reallocate_integer_array( scset, current_max_scs );
215 scbol = reallocate_integer_array( scbol, current_max_scs );
216 scxclu = reallocate_integer_array( scxclu, current_max_scs );
217 sceof = reallocate_integer_array( sceof, current_max_scs );
218 scname = reallocate_char_ptr_array( scname, current_max_scs );
222 /* scinstal - make a start condition
225 * The start condition is "exclusive" if xcluflg is true.
228 void scinstal( str, xcluflg )
234 /* Generate start condition definition, for use in BEGIN et al. */
235 action_define( str, lastsc );
237 if ( ++lastsc >= current_max_scs )
240 scname[lastsc] = copy_string( str );
242 if ( addsym( scname[lastsc], (char *) 0, lastsc,
243 sctbl, START_COND_HASH_SIZE ) )
244 format_pinpoint_message(
245 _( "start condition %s declared twice" ),
248 scset[lastsc] = mkstate( SYM_EPSILON );
249 scbol[lastsc] = mkstate( SYM_EPSILON );
250 scxclu[lastsc] = xcluflg;
251 sceof[lastsc] = false;
255 /* sclookup - lookup the number associated with a start condition
257 * Returns 0 if no such start condition.
263 return findsym( str, sctbl, START_COND_HASH_SIZE )->int_val;