1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
|
/*
This is part of pyahocorasick Python module.
AutomatonItemsIter implementation
Author : Wojciech Muła, wojciech_mula@poczta.onet.pl
WWW : http://0x80.pl
License : BSD-3-Clause (see LICENSE)
*/
#include "AutomatonItemsIter.h"
static PyTypeObject automaton_items_iter_type;
typedef struct AutomatonItemsStackItem {
LISTITEM_data;
struct TrieNode* node;
TRIE_LETTER_TYPE letter;
size_t depth;
} AutomatonItemsStackItem;
#define StackItem AutomatonItemsStackItem
static PyObject*
automaton_items_iter_new(
Automaton* automaton,
const TRIE_LETTER_TYPE* word,
const ssize_t wordlen,
const bool use_wildcard,
const TRIE_LETTER_TYPE wildcard,
const PatternMatchType matchtype
) {
AutomatonItemsIter* iter;
StackItem* new_item;
iter = (AutomatonItemsIter*)F(PyObject_New)(AutomatonItemsIter, &automaton_items_iter_type);
if (iter == NULL)
return NULL;
iter->automaton = automaton;
iter->version = automaton->version;
iter->state = NULL;
iter->type = ITER_KEYS;
iter->buffer = NULL;
#ifndef AHOCORASICK_UNICODE
iter->char_buffer = NULL;
#endif
iter->pattern = NULL;
iter->use_wildcard = use_wildcard;
iter->wildcard = wildcard;
iter->matchtype = matchtype;
list_init(&iter->stack);
Py_INCREF((PyObject*)iter->automaton);
iter->buffer = memory_alloc((automaton->longest_word + 1) * TRIE_LETTER_SIZE);
if (iter->buffer == NULL) {
goto no_memory;
}
#ifndef AHOCORASICK_UNICODE
iter->char_buffer = memory_alloc(automaton->longest_word + 1);
if (iter->char_buffer == NULL) {
goto no_memory;
}
#endif
if (word) {
iter->pattern = (TRIE_LETTER_TYPE*)memory_alloc(wordlen * TRIE_LETTER_SIZE);
if (UNLIKELY(iter->pattern == NULL)) {
goto no_memory;
}
else {
iter->pattern_length = wordlen;
memcpy(iter->pattern, word, wordlen * TRIE_LETTER_SIZE);
}
}
else
iter->pattern_length = 0;
new_item = (StackItem*)list_item_new(sizeof(StackItem));
if (UNLIKELY(new_item == NULL)) {
goto no_memory;
}
new_item->node = automaton->root;
new_item->depth = 0;
list_push_front(&iter->stack, (ListItem*)new_item);
return (PyObject*)iter;
no_memory:
Py_DECREF((PyObject*)iter);
PyErr_NoMemory();
return NULL;
}
#define iter ((AutomatonItemsIter*)self)
static void
automaton_items_iter_del(PyObject* self) {
memory_safefree(iter->buffer);
memory_safefree(iter->pattern);
#ifndef AHOCORASICK_UNICODE
memory_safefree(iter->char_buffer);
#endif
list_delete(&iter->stack);
Py_DECREF(iter->automaton);
PyObject_Del(self);
}
static PyObject*
automaton_items_iter_iter(PyObject* self) {
Py_INCREF(self);
return self;
}
static PyObject*
automaton_items_iter_next(PyObject* self) {
bool output;
TrieNode* node;
TRIE_LETTER_TYPE letter;
size_t depth;
if (UNLIKELY(iter->version != iter->automaton->version)) {
PyErr_SetString(PyExc_ValueError, "The underlying automaton has changed: this iterator is no longer valid.");
return NULL;
}
while (true) {
StackItem* top = (StackItem*)list_pop_first(&iter->stack);
if (top == NULL)
return NULL; /* Stop iteration */
if (top->node == NULL) {
memory_free(top);
return NULL; /* Stop iteration */
}
node = top->node;
letter = top->letter;
depth = top->depth;
memory_free(top);
if (iter->matchtype != MATCH_AT_LEAST_PREFIX and depth > iter->pattern_length)
continue;
switch (iter->matchtype) {
case MATCH_EXACT_LENGTH:
output = (depth == iter->pattern_length);
break;
case MATCH_AT_MOST_PREFIX:
output = (depth <= iter->pattern_length);
break;
case MATCH_AT_LEAST_PREFIX:
default:
output = (depth >= iter->pattern_length);
break;
}
iter->state = node;
iter->letter = letter;
if ((depth >= iter->pattern_length) or
(iter->use_wildcard and iter->pattern[depth] == iter->wildcard)) {
// process all
const int n = iter->state->n;
int i;
for (i=0; i < n; i++) {
StackItem* new_item = (StackItem*)list_item_new(sizeof(StackItem));
if (UNLIKELY(new_item == NULL)) {
PyErr_NoMemory();
return NULL;
}
new_item->node = trienode_get_ith_unsafe(iter->state, i);
new_item->letter = trieletter_get_ith_unsafe(iter->state, i);
new_item->depth = depth + 1;
list_push_front(&iter->stack, (ListItem*)new_item);
}
}
else {
// process single letter
TrieNode* node = trienode_get_next(iter->state, iter->pattern[depth]);
if (node) {
StackItem* new_item = (StackItem*)list_item_new(sizeof(StackItem));
if (UNLIKELY(new_item == NULL)) {
PyErr_NoMemory();
return NULL;
}
new_item->node = node;
new_item->letter = iter->pattern[depth];
new_item->depth = depth + 1;
list_push_front(&iter->stack, (ListItem*)new_item);
}
}
if (iter->type != ITER_VALUES) {
// update keys when needed
iter->buffer[depth] = iter->letter;
#ifndef AHOCORASICK_UNICODE
iter->char_buffer[depth] = (char)iter->letter;
#endif
}
if (output and iter->state->eow) {
PyObject* val;
switch (iter->type) {
case ITER_KEYS:
#if defined PEP393_UNICODE
return F(PyUnicode_FromKindAndData)(PyUnicode_4BYTE_KIND, (void*)(iter->buffer + 1), depth);
#elif defined AHOCORASICK_UNICODE
return PyUnicode_FromUnicode((Py_UNICODE*)(iter->buffer + 1), depth);
#else
return PyBytes_FromStringAndSize(iter->char_buffer + 1, depth);
#endif
case ITER_VALUES:
switch (iter->automaton->store) {
case STORE_ANY:
val = iter->state->output.object;
Py_INCREF(val);
break;
case STORE_LENGTH:
case STORE_INTS:
return F(Py_BuildValue)("i", iter->state->output.integer);
default:
PyErr_SetString(PyExc_SystemError, "Incorrect 'store' attribute.");
return NULL;
}
return val;
case ITER_ITEMS:
switch (iter->automaton->store) {
case STORE_ANY:
return F(Py_BuildValue)(
#ifdef PY3K
#ifdef AHOCORASICK_UNICODE
"(u#O)", /*key*/ iter->buffer + 1, depth,
#else
"(y#O)", /*key*/ iter->buffer + 1, depth,
#endif
#else
"(s#O)", /*key*/ iter->char_buffer + 1, depth,
#endif
/*val*/ iter->state->output.object
);
case STORE_LENGTH:
case STORE_INTS:
return F(Py_BuildValue)(
#ifdef PY3K
#ifdef AHOCORASICK_UNICODE
"(u#i)", /*key*/ iter->buffer + 1, depth,
#else
"(y#i)", /*key*/ iter->buffer + 1, depth,
#endif
#else
"(s#i)", /*key*/ iter->char_buffer + 1, depth,
#endif
/*val*/ iter->state->output.integer
);
default:
PyErr_SetString(PyExc_SystemError, "Incorrect 'store' attribute.");
return NULL;
} // switch
}
}
}
}
#undef StackItem
#undef iter
static PyTypeObject automaton_items_iter_type = {
PY_OBJECT_HEAD_INIT
"AutomatonItemsIter", /* tp_name */
sizeof(AutomatonItemsIter), /* tp_size */
0, /* tp_itemsize? */
(destructor)automaton_items_iter_del, /* tp_dealloc */
0, /* tp_print */
0, /* tp_getattr */
0, /* tp_setattr */
0, /* tp_reserved */
0, /* tp_repr */
0, /* tp_as_number */
0, /* tp_as_sequence */
0, /* tp_as_mapping */
0, /* tp_hash */
0, /* tp_call */
0, /* tp_str */
PyObject_GenericGetAttr, /* tp_getattro */
0, /* tp_setattro */
0, /* tp_as_buffer */
Py_TPFLAGS_DEFAULT, /* tp_flags */
0, /* tp_doc */
0, /* tp_traverse */
0, /* tp_clear */
0, /* tp_richcompare */
0, /* tp_weaklistoffset */
automaton_items_iter_iter, /* tp_iter */
automaton_items_iter_next, /* tp_iternext */
0, /* tp_methods */
0, /* tp_members */
0, /* tp_getset */
0, /* tp_base */
0, /* tp_dict */
0, /* tp_descr_get */
0, /* tp_descr_set */
0, /* tp_dictoffset */
0, /* tp_init */
0, /* tp_alloc */
0, /* tp_new */
};
|
