1 |
#ifndef lint |
2 |
static const char RCSid[] = "$Id: savestr.c,v 2.10 2004/03/04 16:34:34 greg Exp $"; |
3 |
#endif |
4 |
/* |
5 |
* savestr.c - routines for efficient string storage. |
6 |
* |
7 |
* Savestr(s) stores a shared read-only string. |
8 |
* Freestr(s) indicates a client is finished with a string. |
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. |
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 |
* 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 |
#include "rterror.h" |
28 |
#include "rtio.h" |
29 |
|
30 |
#ifndef NHASH |
31 |
#define NHASH 2039 /* hash table size (prime!) */ |
32 |
#endif |
33 |
|
34 |
typedef struct s_head { |
35 |
struct s_head *next; /* next in hash list */ |
36 |
int nl; /* links count */ |
37 |
} S_HEAD; /* followed by the string itself */ |
38 |
|
39 |
static S_HEAD *stab[NHASH]; |
40 |
|
41 |
#define hash(s) (shash(s)%NHASH) |
42 |
|
43 |
#define string(sp) ((char *)((sp)+1)) |
44 |
|
45 |
#define salloc(str) (S_HEAD *)malloc(sizeof(S_HEAD)+1+strlen(str)) |
46 |
|
47 |
#define sfree(sp) free((void *)(sp)) |
48 |
|
49 |
|
50 |
char * |
51 |
savestr(char *str) /* save a string */ |
52 |
{ |
53 |
int hval; |
54 |
S_HEAD *sp; |
55 |
|
56 |
if (str == NULL) |
57 |
return(NULL); |
58 |
if (!*str) |
59 |
return ""; |
60 |
hval = hash(str); |
61 |
for (sp = stab[hval]; sp != NULL; sp = sp->next) |
62 |
if (!strcmp(str, string(sp))) { |
63 |
sp->nl++; |
64 |
return(string(sp)); |
65 |
} |
66 |
if ((sp = salloc(str)) == NULL) { |
67 |
eputs("Out of memory in savestr\n"); |
68 |
quit(1); |
69 |
} |
70 |
strcpy(string(sp), str); |
71 |
sp->nl = 1; |
72 |
sp->next = stab[hval]; |
73 |
stab[hval] = sp; |
74 |
return(string(sp)); |
75 |
} |
76 |
|
77 |
|
78 |
void |
79 |
freestr(char *s) /* free a string */ |
80 |
{ |
81 |
int hval; |
82 |
S_HEAD *spl, *sp; |
83 |
|
84 |
if (s == NULL || !*s) |
85 |
return; |
86 |
hval = hash(s); |
87 |
for (spl = NULL, sp = stab[hval]; sp != NULL; spl = sp, sp = sp->next) |
88 |
if (s == string(sp)) { |
89 |
if (--sp->nl > 0) |
90 |
return; |
91 |
if (spl != NULL) |
92 |
spl->next = sp->next; |
93 |
else |
94 |
stab[hval] = sp->next; |
95 |
sfree(sp); |
96 |
return; |
97 |
} |
98 |
} |
99 |
|
100 |
|
101 |
int |
102 |
shash(char *s) |
103 |
{ |
104 |
int h = 0; |
105 |
|
106 |
while (*s) |
107 |
h = (h<<1 & 0x7fff) ^ (*s++ & 0xff); |
108 |
return(h); |
109 |
} |