Repository navigation
Expand file tree
/
Copy pathPatternMatcher.c
More file actions
379 lines (357 loc) · 9.87 KB
/
Copy pathPatternMatcher.c
File metadata and controls
379 lines (357 loc) · 9.87 KB
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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
#define _GNU_SOURCE
#include <string.h>
#include <ctype.h>
#include <stdbool.h>
#include "Prototypes.h"
/*{
typedef int(*Method_PatternMatcher_match)(GraphNode*, const char*, intptr_t*, bool*, bool*);
struct GraphNode_ {
unsigned char min;
unsigned char max;
intptr_t value;
bool endNode;
bool eager;
bool handOver;
union {
GraphNode* simple;
struct {
unsigned char* links;
unsigned char nptrs;
union {
GraphNode* single;
GraphNode** list;
} p;
} l;
} u;
};
struct PatternMatcher_ {
GraphNode* start;
GraphNode* lineStart;
};
}*/
#ifndef MAX
#define MAX(a,b) ((a)>(b)?(a):(b))
#endif
#ifndef MIN
#define MIN(a,b) ((a)<(b)?(a):(b))
#endif
PatternMatcher* PatternMatcher_new() {
PatternMatcher* this = malloc(sizeof(PatternMatcher));
this->start = GraphNode_new();
this->lineStart = NULL;
return this;
}
void PatternMatcher_delete(PatternMatcher* this) {
GraphNode_delete(this->start, NULL);
if (this->lineStart)
GraphNode_delete(this->lineStart, NULL);
free(this);
}
static inline GraphNode* GraphNode_follow(GraphNode* this, unsigned char c) {
assert(this);
if (c < this->min || c > this->max) {
return NULL;
}
if (this->min == this->max) {
assert(c == this->min);
return this->u.simple;
} else {
int id = c - this->min;
int ptrid = this->u.l.links[id];
if (ptrid == 0)
return NULL;
assert(ptrid >= 1 && ptrid <= this->u.l.nptrs);
if (this->u.l.nptrs == 1) {
assert(this->u.l.p.single);
return this->u.l.p.single;
} else {
assert(this->u.l.p.list[ptrid - 1]);
return this->u.l.p.list[ptrid - 1];
}
}
}
void GraphNode_build(GraphNode* current, unsigned char* input, unsigned char* special, intptr_t value, bool eager, bool handOver) {
#define SPECIAL(c) (*special && *input == c)
#define NEXT do { special++; input++; } while (0)
assert(current); assert(input); assert(special);
unsigned char mask[256];
while (*input) {
memset(mask, 0, 256);
assert(*special == 0 || *special == 1);
unsigned char ch = 0;
if (SPECIAL('[')) {
NEXT;
bool invertMask = false;
if (SPECIAL('^')) {
NEXT;
invertMask = true;
}
while (*input && !SPECIAL(']')) {
unsigned char first = *input;
mask[first] = 1;
NEXT;
if (SPECIAL('-')) {
NEXT;
for (int j = first; j <= *input; j++)
mask[j] = 1;
NEXT;
}
if (SPECIAL('|'))
NEXT;
}
if (invertMask) {
for (int i = 0; i < 256; i++) {
mask[i] = (mask[i] == 1 ? 0 : 1);
}
}
if (!*input)
break;
} else if (!*special) {
ch = *input;
mask[ch] = 1;
}
NEXT;
if (SPECIAL('+')) {
NEXT;
GraphNode* next = GraphNode_new();
GraphNode_link(current, mask, next);
current = next;
GraphNode_link(current, mask, current);
} else if (SPECIAL('*')) {
NEXT;
GraphNode_link(current, mask, current);
} else if (SPECIAL('?')) {
NEXT;
GraphNode* next = GraphNode_new();
GraphNode_link(current, mask, next);
GraphNode_build(current, input, special, value, eager, handOver);
current = next;
} else {
GraphNode* next = NULL;
if (ch)
next = GraphNode_follow(current, ch);
if (!next)
next = GraphNode_new();
GraphNode_link(current, mask, next);
current = next;
}
}
current->value = value;
current->eager = eager;
current->handOver = handOver;
current->endNode = true;
#undef SPECIAL
#undef NEXT
}
void PatternMatcher_add(PatternMatcher* this, unsigned char* pattern, intptr_t value, bool eager, bool handOver) {
assert(this); assert(pattern);
int len = strlen((char*)pattern) + 1;
unsigned char input[len];
unsigned char special[len];
int i = 0;
while (*pattern) {
unsigned char ch = *pattern;
special[i] = 0;
if (ch == '`') {
pattern++;
ch = *pattern;
switch (ch) {
case 't': ch = '\t'; break;
case 's': ch = ' '; break;
case '`': break;
default: special[i] = 1;
}
}
input[i] = ch;
pattern++;
i++;
}
input[i] = '\0';
special[i] = '\0';
GraphNode* start = this->start;
if (*special && *input == '^') {
if (!this->lineStart)
this->lineStart = GraphNode_new();
start = this->lineStart;
GraphNode_build(start, input+1, special+1, value, eager, handOver);
} else {
GraphNode_build(start, input, special, value, eager, handOver);
}
}
bool PatternMatcher_partialMatch(GraphNode* node, const char* sinput, int inputLen, char* rest, int restLen) {
const unsigned char* input = (const unsigned char*) sinput;
int i = 0;
while (i < inputLen) {
node = GraphNode_follow(node, input[i]);
if (!node)
break;
i++;
}
if (node) {
for(int r = 0; r < restLen && node->min; r++) {
*rest = node->min;
rest++;
node = GraphNode_follow(node, node->min);
if (node->endNode) {
*rest = '\0';
return true;
}
}
}
return false;
}
int PatternMatcher_match(GraphNode* node, const char* sinput, intptr_t* value, bool* eager, bool* handOver) {
const unsigned char* input = (const unsigned char*) sinput;
int i = 0;
int match = 0;
*value = 0;
while (input[i]) {
node = GraphNode_follow(node, input[i]);
if (!node)
break;
i++;
if (node->endNode) {
match = i;
*value = node->value;
*eager = node->eager;
*handOver = node->handOver;
}
}
return match;
}
int PatternMatcher_match_toLower(GraphNode* node, const char* sinput, intptr_t* value, bool* eager, bool* handOver) {
const unsigned char* input = (const unsigned char*) sinput;
int i = 0;
int match = 0;
*value = 0;
while (input[i]) {
node = GraphNode_follow(node, tolower(input[i]));
if (!node)
break;
i++;
if (node->endNode) {
match = i;
*value = node->value;
*eager = node->eager;
*handOver = node->handOver;
}
}
return match;
}
GraphNode* GraphNode_new() {
GraphNode* this = calloc(sizeof(GraphNode), 1);
return this;
}
void GraphNode_delete(GraphNode* this, GraphNode* prev) {
assert(this);
// Only loops in graph are self-inflicting edges
if (this == prev)
return;
if (this->min) {
if (this->min == this->max) {
GraphNode_delete(this->u.simple, this);
} else {
if (this->u.l.links)
free(this->u.l.links);
if (this->u.l.nptrs == 1) {
GraphNode_delete(this->u.l.p.single, this);
} else {
assert(this->u.l.p.list);
for (int i = 0; i < this->u.l.nptrs; i++) {
assert(this->u.l.p.list[i]);
GraphNode_delete(this->u.l.p.list[i], this);
}
free(this->u.l.p.list);
}
}
} else {
assert (!this->max);
assert (!this->u.l.links);
assert (!this->u.l.p.list);
}
free(this);
}
void GraphNode_link(GraphNode* this, unsigned char* mask, GraphNode* next) {
// Find maskmin and maskmax
int maskmin = 0;
int maskmax = 0;
for (int i = 0; i < 256; i++) {
if (mask[i] == 1) {
maskmin = i;
break;
}
}
for (int i = 255; i >= 0; i--) {
if (mask[i] == 1) {
maskmax = i;
break;
}
}
assert(maskmax >= maskmin);
int newmin = this->min ? MIN(maskmin, this->min) : maskmin;
int newmax = MAX(maskmax, this->max);
assert(newmin && newmax);
// If node should be/stay simple
if (newmin == newmax) {
this->min = newmin;
this->max = newmax;
this->u.simple = next;
return;
}
int id = 0;
// If node is simple, "de-simplify" it
if (this->min == this->max) {
GraphNode* oldNode = this->u.simple;
this->u.l.links = calloc(newmax - newmin + 1, 1);
if (oldNode)
this->u.l.links[this->min - newmin] = 1;
this->u.l.nptrs = 1;
this->u.l.p.single = oldNode;
} else if (maskmin < this->min || maskmax > this->max) {
// Expand the links list if needed
unsigned char* newlinks = calloc(newmax - newmin + 1, 1);
memcpy(newlinks + (this->min - newmin), this->u.l.links, this->max - this->min + 1);
free(this->u.l.links);
this->u.l.links = newlinks;
}
// If node is single-pointer
if (this->u.l.nptrs == 1) {
GraphNode* oldNode = this->u.l.p.single;
// Turn into multi-pointer if needed
if (next == oldNode) {
id = 1;
} else if (oldNode) {
this->u.l.nptrs = 2;
this->u.l.p.list = calloc(sizeof(GraphNode*), 2);
this->u.l.p.list[0] = oldNode;
this->u.l.p.list[1] = next;
id = 2;
} else {
this->u.l.nptrs = 1;
this->u.l.p.single = next;
id = 1;
}
} else {
// Multi-pointer: check if pointer already in list
for (int i = 0; i < this->u.l.nptrs; i++) {
if (this->u.l.p.list[i] == next) {
id = i + 1;
break;
}
}
// Add to list if needed
if (id == 0) {
this->u.l.nptrs++;
id = this->u.l.nptrs;
this->u.l.p.list = realloc(this->u.l.p.list, sizeof(GraphNode*) * this->u.l.nptrs);
this->u.l.p.list[this->u.l.nptrs - 1] = next;
}
}
this->min = newmin;
this->max = newmax;
assert(id > 0);
for (int i = maskmin; i <= maskmax; i++) {
if (mask[i])
this->u.l.links[i - newmin] = id;
}
}