2 * Copyright (c) 2007, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
12 #define STRING_BLOCK 2047
13 #define STRINGSPACE_BLOCK 65535
16 stringpool_init(Stringpool *ss, const char *strs[])
18 unsigned totalsize = 0;
21 memset(ss, 0, sizeof(*ss));
22 // count number and total size of predefined strings
23 for (count = 0; strs[count]; count++)
24 totalsize += strlen(strs[count]) + 1;
26 // alloc appropriate space
27 ss->stringspace = sat_extend_resize(0, totalsize, 1, STRINGSPACE_BLOCK);
28 ss->strings = sat_extend_resize(0, count, sizeof(Offset), STRING_BLOCK);
30 // now copy predefined strings into allocated space
32 for (count = 0; strs[count]; count++)
34 strcpy(ss->stringspace + ss->sstrings, strs[count]);
35 ss->strings[count] = ss->sstrings;
36 ss->sstrings += strlen(strs[count]) + 1;
42 stringpool_free(Stringpool *ss)
44 sat_free(ss->strings);
45 sat_free(ss->stringspace);
46 sat_free(ss->stringhashtbl);
50 stringpool_freehash(Stringpool *ss)
52 ss->stringhashtbl = sat_free(ss->stringhashtbl);
53 ss->stringhashmask = 0;
57 stringpool_init_empty(Stringpool *ss)
59 const char *emptystrs[] = {
64 stringpool_init(ss, emptystrs);
68 stringpool_clone(Stringpool *ss, Stringpool *from)
70 memset(ss, 0, sizeof(*ss));
71 ss->strings = sat_extend_resize(0, from->nstrings, sizeof(Offset), STRING_BLOCK);
72 memcpy(ss->strings, from->strings, from->nstrings * sizeof(Offset));
73 ss->stringspace = sat_extend_resize(0, from->sstrings, 1, STRINGSPACE_BLOCK);
74 memcpy(ss->stringspace, from->stringspace, from->sstrings);
75 ss->nstrings = from->nstrings;
76 ss->sstrings = from->sstrings;
80 stringpool_strn2id(Stringpool *ss, const char *str, unsigned int len, int create)
95 hashmask = ss->stringhashmask;
96 hashtbl = ss->stringhashtbl;
98 // expand hashtable if needed
99 if (ss->nstrings * 2 > hashmask)
103 // realloc hash table
104 ss->stringhashmask = hashmask = mkmask(ss->nstrings + STRING_BLOCK);
105 ss->stringhashtbl = hashtbl = (Hashtable)sat_calloc(hashmask + 1, sizeof(Id));
107 // rehash all strings into new hashtable
108 for (i = 1; i < ss->nstrings; i++)
110 h = strhash(ss->stringspace + ss->strings[i]) & hashmask;
111 hh = HASHCHAIN_START;
112 while (hashtbl[h] != 0) // follow overflow chain
113 h = HASHCHAIN_NEXT(h, hh, hashmask);
118 // compute hash and check for match
119 h = strnhash(str, len) & hashmask;
120 hh = HASHCHAIN_START;
121 while ((id = hashtbl[h]) != 0) // follow hash overflow chain
123 // break if string already hashed
124 if(!memcmp(ss->stringspace + ss->strings[id], str, len)
125 && ss->stringspace[ss->strings[id] + len] == 0)
127 h = HASHCHAIN_NEXT(h, hh, hashmask);
129 if (id || !create) // exit here if string found
132 // generate next id and save in table
136 ss->strings = sat_extend(ss->strings, id, 1, sizeof(Offset), STRING_BLOCK);
137 ss->strings[id] = ss->sstrings; /* we will append to the end */
139 // append string to stringspace
140 ss->stringspace = sat_extend(ss->stringspace, ss->sstrings, len + 1, 1, STRINGSPACE_BLOCK);
141 memcpy(ss->stringspace + ss->sstrings, str, len);
142 ss->stringspace[ss->sstrings + len] = 0;
143 ss->sstrings += len + 1;
148 stringpool_str2id(Stringpool *ss, const char *str, int create)
154 return stringpool_strn2id(ss, str, (unsigned int)strlen(str), create);
158 stringpool_shrink(Stringpool *ss)
160 ss->stringspace = sat_extend_resize(ss->stringspace, ss->sstrings, 1, STRINGSPACE_BLOCK);
161 ss->strings = sat_extend_resize(ss->strings, ss->nstrings, sizeof(Offset), STRING_BLOCK);