2 * Knuth-Morris-Pratt's Substring Search for N given strings
4 * (c) 1999--2005, Robert Spalek <robert@ucw.cz>
5 * (c) 2006, Pavel Charvat <pchar@ucw.cz>
7 * (In fact, the algorithm is usually referred to as Aho-McCorasick,
8 * but that's just an extension of KMP to multiple strings.)
12 * This is not a normal header file, it's a generator of KMP algorithm.
13 * Each time you include it with parameters set in the corresponding
14 * preprocessor macros, it generates KMP structures and functions
15 * with the parameters given.
19 * KMP_PREFIX(x) macro to add a name prefix (used on all global names
20 * defined by the KMP generator); mandatory
22 * KMP_CHAR alphabet type, the default is u16
24 * KMP_SOURCE user-defined text source; KMP_GET_CHAR must
25 * KMP_GET_CHAR(kmp,src,c) return next character from the input or zero at the end;
26 * if not defined, zero-terminated array of bytes is used as the input
28 * KMP_VARS user-defined data in main structure (a structure describing
29 * the whole automaton)
30 * KMP_STATE_VARS user-defined data in each state of the automaton
32 * Parameters which select how the input is interpreted (if KMP_SOURCE is unset):
33 * KMP_USE_ASCII reads single bytes from the input (default)
34 * KMP_USE_UTF8 reads UTF-8 characters from the input (valid UTF-8 needed)
35 * KMP_TOLOWER converts all to lowercase
36 * KMP_UNACCENT removes accents
37 * KMP_ONLYALPHA converts non-alphas to KMP_CONTROL_CHAR
38 * KMP_CONTROL_CHAR special control character (default is ':')
40 * Parameters controlling add():
41 * KMP_ADD_EXTRA_ARGS extra arguments
42 * KMP_ADD_INIT(kmp,src)
43 * KMP_ADD_NEW(kmp,src,s)
44 * KMP_ADD_DUP(kmp,src,s)
46 * Parameters to build():
47 * KMP_BUILD_STATE(kmp,s) called for all states (including null) in order of non-decreasing tree depth
50 * KMP_WANT_CLEANUP define cleanup()
51 * KMP_WANT_SEARCH includes lib/kmp-search.h with the same prefix;
52 * there can be multiple search variants for a single KMP structure
54 * KMP_USE_POOL allocates in a given pool
62 #error Missing KMP_PREFIX
65 #include "lib/mempool.h"
69 #define P(x) KMP_PREFIX(x)
72 typedef KMP_CHAR P(char_t);
74 typedef u16 P(char_t);
80 typedef KMP_NODE P(node_t);
82 typedef struct {} P(node_t);
88 struct P(state) *from; /* state with previous character */
89 struct P(state) *back; /* backwards edge to the largest shorter state */
90 struct P(state) *next; /* largest shorter match */
91 P(len_t) len; /* largest match, zero otherwise */
92 P(char_t) c; /* last character */
94 # ifdef KMP_STATE_VARS
97 } u; /* user-defined data*/
101 static inline P(char_t)
104 # ifdef KMP_CONTROL_CHAR
105 return KMP_CONTROL_CHAR;
111 /* User-defined source */
112 struct P(hash_table);
114 #define HASH_GIVE_HASHFN
115 #ifdef KMP_GIVE_HASHFN
117 P(hash_hash) (struct P(hash_table) *t, struct P(state) *f, P(char_t) c)
119 return P(hash) ((struct P(struct) *) t, f, c);
123 P(hash_hash) (struct P(hash_table) *t UNUSED, struct P(state) *f, P(char_t) c)
125 return (((uns)c) << 16) + (uns)(addr_int_t)f;
131 P(eq) (struct P(struct) *kmp UNUSED, P(char_t) c1, P(char_t) c2)
138 P(is_control) (struct P(struct) *kmp, P(char_t) c)
140 return P(eq) (kmp, c, P(control)());
145 P(hash_eq) (struct P(hash_table) *t, struct P(state) *f1, P(char_t) c1, struct P(state) *f2, P(char_t) c2)
147 return f1 == f2 && P(eq)((struct P(struct) *) t, c1, c2);
150 #ifdef KMP_GIVE_ALLOC
151 #define HASH_GIVE_ALLOC
153 P(hash_alloc) (struct P(hash_table) *t, uns size)
155 return P(alloc) ((struct P(struct) *) t, size);
159 P(hash_free) (struct P(hash_table) *t, void *ptr)
161 P(free) ((struct P(struct) *) t, ptr);
165 #define HASH_GIVE_INIT_KEY
167 P(hash_init_key) (struct P(hash_table) *t UNUSED, struct P(state) *s, struct P(state) *f, P(char_t) c)
169 bzero(s, sizeof(*s));
172 s->next = f->back; /* the pointers hold the link-list of sons... changed in build() */
177 #define HASH_PREFIX(x) KMP_PREFIX(GLUE(hash_,x))
178 #define HASH_NODE struct KMP_PREFIX(state)
179 #define HASH_KEY_COMPLEX(x) x from, x c
180 #define HASH_KEY_DECL struct KMP_PREFIX(state) *from, KMP_PREFIX(char_t) c
181 #define HASH_WANT_NEW
182 #define HASH_WANT_FIND
183 #ifdef KMP_WANT_CLEANUP
184 #define HASH_WANT_CLEANUP
186 #if defined(KMP_USE_POOL)
187 #define HASH_USE_POOL KMP_USE_POOL
189 #define HASH_AUTO_POOL 4096
191 #define HASH_CONSERVE_SPACE
192 #define HASH_TABLE_DYNAMIC
193 #include "lib/hashtable.h"
194 #define P(x) KMP_PREFIX(x)
197 struct P(hash_table) hash; /* hash table of state transitions */
198 struct P(state) null; /* null state */
203 } u; /* user-defined data */
207 typedef KMP_SOURCE P(source_t);
209 typedef byte *P(source_t);
214 P(get_char) (struct P(struct) *kmp UNUSED, P(source_t) *src UNUSED, P(char_t) *c UNUSED)
216 return KMP_GET_CHAR(kmp, (*src), (*c));
219 # if defined(KMP_USE_UTF8)
220 # include "lib/unicode.h"
221 # if defined(KMP_ONLYALPHA) || defined(KMP_TOLOWER) || defined(KMP_UNACCENT)
222 # include "charset/unicat.h"
224 # elif defined(KMP_USE_ASCII)
225 # if defined(KMP_ONLYALPHA) || defined(KMP_TOLOWER)
226 # include "lib/chartype.h"
230 P(get_char) (struct P(struct) *kmp UNUSED, P(source_t) *src, P(char_t) *c)
234 *src = (byte *)utf8_get(*src, &cc);
235 # ifdef KMP_ONLYALPHA
237 else if (!Ualpha(cc))
251 # ifdef KMP_ONLYALPHA
253 else if (!Calpha(cc))
261 # error Do not know how to unaccent ASCII characters
269 static struct P(state) *
270 P(add) (struct P(struct) *kmp, P(source_t) src
271 # ifdef KMP_ADD_EXTRA_ARGS
277 { KMP_ADD_INIT(kmp, src); }
281 if (!P(get_char)(kmp, &src, &c))
283 struct P(state) *p = &kmp->null, *s;
287 s = P(hash_find)(&kmp->hash, p, c);
291 s = P(hash_new)(&kmp->hash, p, c);
293 if (!(P(get_char)(kmp, &src, &c)))
300 while (P(get_char)(kmp, &src, &c));
304 { KMP_ADD_DUP(kmp, src, s); }
311 { KMP_ADD_NEW(kmp, src, s); }
317 P(init) (struct P(struct) *kmp)
319 bzero(&kmp->null, sizeof(struct P(state)));
320 P(hash_init)(&kmp->hash);
323 #ifdef KMP_WANT_CLEANUP
325 P(cleanup) (struct P(struct) *kmp)
327 P(hash_cleanup)(&kmp->hash);
332 P(empty) (struct P(struct) *kmp)
334 return !kmp->hash.hash_count;
337 static inline struct P(state) *
338 P(chain_start) (struct P(state) *s)
340 return s->len ? s : s->next;
344 P(build) (struct P(struct) *kmp)
348 uns read = 0, write = 0;
349 struct P(state) *fifo[kmp->hash.hash_count], *null = &kmp->null;
350 for (struct P(state) *s = null->back; s; s = s->next)
353 # ifdef KMP_BUILD_STATE
354 { KMP_BUILD_STATE(kmp, null); }
356 while (read != write)
358 struct P(state) *s = fifo[read++], *t;
359 for (t = s->back; t; t = t->next)
361 for (t = s->from->back; 1; t = t->back)
369 s->back = P(hash_find)(&kmp->hash, t, s->c);
372 s->next = s->back->len ? s->back : s->back->next;
376 # ifdef KMP_BUILD_STATE
377 { KMP_BUILD_STATE(kmp, s); }
387 #undef KMP_STATE_VARS
394 #undef KMP_CONTROL_CHAR
395 #undef KMP_ADD_EXTRA_ARGS
399 #undef KMP_BUILD_STATE
401 #undef KMP_GIVE_ALLOC
402 #undef KMP_GIVE_HASHFN
405 #ifdef KMP_WANT_SEARCH
406 # undef KMP_WANT_SEARCH
407 # define KMPS_PREFIX(x) KMP_PREFIX(x)
408 # define KMPS_KMP_PREFIX(x) KMP_PREFIX(x)
409 # include "lib/kmp-search.h"