| 1 |
– |
/* Copyright 1988 Regents of the University of California */ |
| 2 |
– |
|
| 1 |
|
#ifndef lint |
| 2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
| 2 |
> |
static const char RCSid[] = "$Id$"; |
| 3 |
|
#endif |
| 6 |
– |
|
| 4 |
|
/* |
| 5 |
|
* savestr.c - routines for efficient string storage. |
| 6 |
|
* |
| 9 |
|
* All strings must be null-terminated. There is |
| 10 |
|
* no imposed length limit. |
| 11 |
|
* Strings stored with savestr(s) can be equated |
| 12 |
< |
* reliably using their pointer values. A tailored version |
| 16 |
< |
* of strcmp(s1,s2) is included. |
| 12 |
> |
* reliably using their pointer values. |
| 13 |
|
* Calls to savestr(s) and freestr(s) should be |
| 14 |
|
* balanced (obviously). The last call to freestr(s) |
| 15 |
|
* frees memory associated with the string; it should |
| 16 |
|
* never be referenced again. |
| 17 |
|
* |
| 18 |
< |
* 5/14/87 |
| 18 |
> |
* External symbols declared in standard.h |
| 19 |
|
*/ |
| 20 |
|
|
| 21 |
+ |
#include "copyright.h" |
| 22 |
+ |
|
| 23 |
+ |
#include <string.h> |
| 24 |
+ |
#include <stdlib.h> |
| 25 |
+ |
|
| 26 |
+ |
#include "rtmisc.h" |
| 27 |
+ |
|
| 28 |
|
#ifndef NHASH |
| 29 |
|
#define NHASH 509 /* hash table size (prime!) */ |
| 30 |
|
#endif |
| 36 |
|
|
| 37 |
|
static S_HEAD *stab[NHASH]; |
| 38 |
|
|
| 39 |
< |
static int shash(); |
| 39 |
> |
#define hash(s) (shash(s)%NHASH) |
| 40 |
|
|
| 38 |
– |
extern char *savestr(), *strcpy(), *malloc(); |
| 39 |
– |
|
| 40 |
– |
#define NULL 0 |
| 41 |
– |
|
| 41 |
|
#define string(sp) ((char *)((sp)+1)) |
| 42 |
|
|
| 43 |
|
#define salloc(str) (S_HEAD *)malloc(sizeof(S_HEAD)+1+strlen(str)) |
| 44 |
|
|
| 45 |
< |
#define sfree(sp) free((char *)(sp)) |
| 45 |
> |
#define sfree(sp) free((void *)(sp)) |
| 46 |
|
|
| 47 |
|
|
| 48 |
|
char * |
| 54 |
|
|
| 55 |
|
if (str == NULL) |
| 56 |
|
return(NULL); |
| 57 |
< |
hval = shash(str); |
| 57 |
> |
hval = hash(str); |
| 58 |
|
for (sp = stab[hval]; sp != NULL; sp = sp->next) |
| 59 |
|
if (!strcmp(str, string(sp))) { |
| 60 |
|
sp->nl++; |
| 72 |
|
} |
| 73 |
|
|
| 74 |
|
|
| 75 |
+ |
void |
| 76 |
|
freestr(s) /* free a string */ |
| 77 |
|
char *s; |
| 78 |
|
{ |
| 81 |
|
|
| 82 |
|
if (s == NULL) |
| 83 |
|
return; |
| 84 |
< |
hval = shash(s); |
| 84 |
> |
hval = hash(s); |
| 85 |
|
for (spl = NULL, sp = stab[hval]; sp != NULL; spl = sp, sp = sp->next) |
| 86 |
|
if (s == string(sp)) { |
| 87 |
|
if (--sp->nl > 0) |
| 96 |
|
} |
| 97 |
|
|
| 98 |
|
|
| 99 |
< |
static int |
| 100 |
< |
shash(s) /* hash a string */ |
| 99 |
> |
int |
| 100 |
> |
shash(s) |
| 101 |
|
register char *s; |
| 102 |
|
{ |
| 103 |
|
register int h = 0; |
| 104 |
|
|
| 105 |
|
while (*s) |
| 106 |
< |
h += *s++; |
| 107 |
< |
|
| 108 |
< |
return(h % NHASH); |
| 106 |
> |
h = (h<<1 & 0x7fff) ^ (*s++ & 0xff); |
| 107 |
> |
return(h); |
| 108 |
|
} |
