1 /* Part of CPP library. (Macro hash table support.)
2 Copyright (C) 1986, 87, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
3 Written by Per Bothner, 1994.
4 Based on CCCP program by by Paul Rubin, June 1986
5 Adapted to ANSI C, Richard Stallman, Jan 1987
7 This program is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 2, or (at your option) any
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
21 In other words, you are welcome to use, share and improve this program.
22 You are forbidden to forbid anyone else to use, share and improve
23 what you give them. Help stamp out software-hoarding! */
28 extern char *xmalloc
PARAMS ((unsigned));
30 /* Define a generic NULL if one hasn't already been defined. */
42 * return hash function on name. must be compatible with the one
43 * computed a step at a time, elsewhere
46 hashf (name
, len
, hashsize
)
47 register const U_CHAR
*name
;
54 r
= HASHSTEP (r
, *name
++);
56 return MAKE_POS (r
) % hashsize
;
60 * find the most recent hash node for name name (ending with first
61 * non-identifier char) installed by install
63 * If LEN is >= 0, it is the length of the name.
64 * Otherwise, compute the length by scanning the entire name.
66 * If HASH is >= 0, it is the precomputed hash code.
67 * Otherwise, compute the hash code.
70 cpp_lookup (pfile
, name
, len
, hash
)
71 struct parse_file
*pfile
;
76 register const U_CHAR
*bp
;
77 register HASHNODE
*bucket
;
81 for (bp
= name
; is_idchar
[*bp
]; bp
++) ;
86 hash
= hashf (name
, len
, HASHSIZE
);
88 bucket
= hashtab
[hash
];
90 if (bucket
->length
== len
&& strncmp (bucket
->name
, name
, len
) == 0)
92 bucket
= bucket
->next
;
98 * Delete a hash node. Some weirdness to free junk from macros.
99 * More such weirdness will have to be added if you define more hash
100 * types that need it.
103 /* Note that the DEFINITION of a macro is removed from the hash table
104 but its storage is not freed. This would be a storage leak
105 except that it is not reasonable to keep undefining and redefining
106 large numbers of macros many times.
107 In any case, this is necessary, because a macro can be #undef'd
108 in the middle of reading the arguments to a call to it.
109 If #undef freed the DEFINITION, that would crash. */
116 if (hp
->prev
!= NULL
)
117 hp
->prev
->next
= hp
->next
;
118 if (hp
->next
!= NULL
)
119 hp
->next
->prev
= hp
->prev
;
121 /* make sure that the bucket chain header that
122 the deleted guy was on points to the right thing afterwards. */
123 if (hp
== *hp
->bucket_hdr
)
124 *hp
->bucket_hdr
= hp
->next
;
126 if (hp
->type
== T_MACRO
)
128 DEFINITION
*d
= hp
->value
.defn
;
129 struct reflist
*ap
, *nextap
;
131 for (ap
= d
->pattern
; ap
!= NULL
; ap
= nextap
)
137 free (d
->args
.argnames
);
144 * install a name in the main hash table, even if it is already there.
145 * name stops with first non alphanumeric, except leading '#'.
146 * caller must check against redefinition if that is desired.
147 * delete_macro () removes things installed by install () in fifo order.
148 * this is important because of the `defined' special symbol used
149 * in #if, and also if pushdef/popdef directives are ever implemented.
151 * If LEN is >= 0, it is the length of the name.
152 * Otherwise, compute the length by scanning the entire name.
154 * If HASH is >= 0, it is the precomputed hash code.
155 * Otherwise, compute the hash code.
158 install (name
, len
, type
, ivalue
, value
, hash
)
166 register HASHNODE
*hp
;
167 register int i
, bucket
;
168 register U_CHAR
*p
, *q
;
172 while (is_idchar
[*p
])
178 hash
= hashf (name
, len
, HASHSIZE
);
180 i
= sizeof (HASHNODE
) + len
+ 1;
181 hp
= (HASHNODE
*) xmalloc (i
);
183 hp
->bucket_hdr
= &hashtab
[bucket
];
184 hp
->next
= hashtab
[bucket
];
185 hashtab
[bucket
] = hp
;
187 if (hp
->next
!= NULL
)
191 if (hp
->type
== T_CONST
)
192 hp
->value
.ival
= ivalue
;
194 hp
->value
.cpval
= value
;
195 hp
->name
= ((U_CHAR
*) hp
) + sizeof (HASHNODE
);
198 for (i
= 0; i
< len
; i
++)
205 cpp_hash_cleanup (pfile
)
209 for (i
= HASHSIZE
; --i
>= 0; )
212 delete_macro (hashtab
[i
]);