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
|
#include <stdlib.h>
#include <string.h>
#include <wchar.h>
#include <errno.h>
#include "text-regex.h"
#include "text-motions.h"
struct Regex {
regex_t regex;
tre_str_source str_source;
Text *text;
Iterator it;
size_t end;
};
size_t text_regex_nsub(Regex *r) {
if (!r)
return 0;
return r->regex.re_nsub;
}
static int str_next_char(tre_char_t *c, unsigned int *pos_add, void *context) {
Regex *r = context;
Iterator *it = &r->it;
if (TRE_WCHAR) {
mbstate_t ps = { 0 };
bool eof = false;
size_t start = it->pos;
for (;;) {
if (it->pos >= r->end) {
eof = true;
break;
}
size_t rem = r->end - it->pos;
size_t plen = it->end - it->text;
size_t len = rem < plen ? rem : plen;
size_t wclen = mbrtowc(c, it->text, len, &ps);
if (wclen == (size_t)-1 && errno == EILSEQ) {
ps = (mbstate_t){0};
*c = L'\0';
text_iterator_codepoint_next(it, NULL);
break;
} else if (wclen == (size_t)-2) {
if (!text_iterator_next(it)) {
eof = true;
break;
}
} else if (wclen == 0) {
text_iterator_byte_next(it, NULL);
break;
} else {
if (wclen < plen) {
it->text += wclen;
it->pos += wclen;
} else {
text_iterator_next(it);
}
break;
}
}
if (eof) {
*c = L'\0';
*pos_add = 1;
return 1;
} else {
*pos_add = it->pos - start;
return 0;
}
} else {
*pos_add = 1;
if (it->pos < r->end && text_iterator_byte_get(it, (char*)c)) {
text_iterator_byte_next(it, NULL);
return 0;
} else {
*c = '\0';
return 1;
}
}
}
static void str_rewind(size_t pos, void *context) {
Regex *r = context;
r->it = text_iterator_get(r->text, pos);
}
static int str_compare(size_t pos1, size_t pos2, size_t len, void *context) {
Regex *r = context;
int ret = 1;
void *buf1 = malloc(len), *buf2 = malloc(len);
if (!buf1 || !buf2)
goto err;
text_bytes_get(r->text, pos1, len, buf1);
text_bytes_get(r->text, pos2, len, buf2);
ret = memcmp(buf1, buf2, len);
err:
free(buf1);
free(buf2);
return ret;
}
Regex *text_regex_new(void) {
Regex *r = calloc(1, sizeof(*r));
if (!r)
return NULL;
r->str_source = (tre_str_source) {
.get_next_char = str_next_char,
.rewind = str_rewind,
.compare = str_compare,
.context = r,
};
return r;
}
void text_regex_free(Regex *r) {
if (!r)
return;
tre_regfree(&r->regex);
free(r);
}
int text_regex_compile(Regex *regex, const char *string, int cflags) {
int r = tre_regcomp(®ex->regex, string, cflags);
if (r)
tre_regcomp(®ex->regex, "\0\0", 0);
return r;
}
int text_regex_match(Regex *r, const char *data, int eflags) {
return tre_regexec(&r->regex, data, 0, NULL, eflags);
}
int text_search_range_forward(Text *txt, size_t pos, size_t len, Regex *r, size_t nmatch, RegexMatch pmatch[], int eflags) {
r->text = txt;
r->it = text_iterator_get(txt, pos);
r->end = pos+len;
regmatch_t match[MAX_REGEX_SUB];
int ret = tre_reguexec(&r->regex, &r->str_source, nmatch, match, eflags);
if (!ret) {
for (size_t i = 0; i < nmatch; i++) {
pmatch[i].start = match[i].rm_so == -1 ? EPOS : pos + match[i].rm_so;
pmatch[i].end = match[i].rm_eo == -1 ? EPOS : pos + match[i].rm_eo;
}
}
return ret;
}
int text_search_range_backward(Text *txt, size_t pos, size_t len, Regex *r, size_t nmatch, RegexMatch pmatch[], int eflags) {
int ret = REG_NOMATCH;
size_t end = pos + len;
while (pos < end && !text_search_range_forward(txt, pos, len, r, nmatch, pmatch, eflags)) {
ret = 0;
// FIXME: assumes nmatch >= 1
size_t next = pmatch[0].end;
if (next == pos) {
next = text_line_next(txt, pos);
if (next == pos)
break;
}
pos = next;
len = end - pos;
char c;
if (text_byte_get(txt, pos-1, &c) && c == '\n')
eflags &= ~REG_NOTBOL;
else
eflags |= REG_NOTBOL;
}
return ret;
}
|
