Annotation of src/usr.bin/m4/look.c, Revision 1.10
1.10 ! espie 1: /* $OpenBSD: look.c,v 1.9 2002/02/16 21:27:48 millert 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:
1.9 millert 58: static void freent(ndptr);
1.5 espie 59:
1.10 ! espie 60: unsigned int
! 61: hash(const char *name)
1.1 deraadt 62: {
1.7 millert 63: unsigned int h = 0;
1.1 deraadt 64: while (*name)
65: h = (h << 5) + h + *name++;
1.6 espie 66: return (h);
1.1 deraadt 67: }
68:
69: /*
70: * find name in the hash table
71: */
72: ndptr
1.10 ! espie 73: lookup(const char *name)
1.1 deraadt 74: {
1.4 espie 75: ndptr p;
1.7 millert 76: unsigned int h;
1.1 deraadt 77:
1.6 espie 78: h = hash(name);
79: for (p = hashtab[h % HASHSIZE]; p != nil; p = p->nxtptr)
80: if (h == p->hv && STREQ(name, p->name))
1.1 deraadt 81: break;
82: return (p);
83: }
84:
85: /*
86: * hash and create an entry in the hash table.
87: * The new entry is added in front of a hash bucket.
88: */
89: ndptr
1.10 ! espie 90: addent(const char *name)
1.1 deraadt 91: {
1.7 millert 92: unsigned int h;
1.1 deraadt 93: ndptr p;
94:
95: h = hash(name);
96: p = (ndptr) xalloc(sizeof(struct ndblock));
1.6 espie 97: p->nxtptr = hashtab[h % HASHSIZE];
98: hashtab[h % HASHSIZE] = p;
1.1 deraadt 99: p->name = xstrdup(name);
1.6 espie 100: p->hv = h;
1.1 deraadt 101: return p;
102: }
103:
104: static void
1.10 ! espie 105: freent(ndptr p)
1.1 deraadt 106: {
1.8 espie 107: free((char *) p->name);
108: if (p->defn != null)
109: free((char *) p->defn);
1.1 deraadt 110: free((char *) p);
111: }
112:
113: /*
114: * remove an entry from the hashtable
115: */
116: void
1.10 ! espie 117: remhash(const char *name, int all)
1.1 deraadt 118: {
1.7 millert 119: unsigned int h;
1.4 espie 120: ndptr xp, tp, mp;
1.1 deraadt 121:
122: h = hash(name);
1.6 espie 123: mp = hashtab[h % HASHSIZE];
1.1 deraadt 124: tp = nil;
125: while (mp != nil) {
1.6 espie 126: if (mp->hv == h && STREQ(mp->name, name)) {
1.1 deraadt 127: mp = mp->nxtptr;
128: if (tp == nil) {
1.6 espie 129: freent(hashtab[h % HASHSIZE]);
130: hashtab[h % HASHSIZE] = mp;
1.1 deraadt 131: }
132: else {
133: xp = tp->nxtptr;
134: tp->nxtptr = mp;
135: freent(xp);
136: }
137: if (!all)
138: break;
139: }
140: else {
141: tp = mp;
142: mp = mp->nxtptr;
143: }
144: }
145: }
![[BACK]](/icons/back.gif){kind=icon}
Return to look.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / m4