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
|
/* kwsearch.c - searching subroutines using kwset for grep.
Copyright 1992, 1998, 2000, 2007, 2009-2012 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
02110-1301, USA. */
/* Written August 1992 by Mike Haertel. */
#include <config.h>
#include "search.h"
/* For -w, we also consider _ to be word constituent. */
#define WCHAR(C) (isalnum (C) || (C) == '_')
/* KWset compiled pattern. For Ecompile and Gcompile, we compile
a list of strings, at least one of which is known to occur in
any string matching the regexp. */
static kwset_t kwset;
void
Fcompile (char const *pattern, size_t size)
{
char const *err;
size_t psize = size;
char const *pat = (match_icase && MB_CUR_MAX > 1
? mbtolower (pattern, &psize)
: pattern);
kwsinit (&kwset);
char const *beg = pat;
do
{
char const *lim;
char const *end;
for (lim = beg;; ++lim)
{
end = lim;
if (lim >= pat + psize)
break;
if (*lim == '\n')
{
lim++;
break;
}
#if HAVE_DOS_FILE_CONTENTS
if (*lim == '\r' && lim + 1 < pat + psize && lim[1] == '\n')
{
lim += 2;
break;
}
#endif
}
if ((err = kwsincr (kwset, beg, end - beg)) != NULL)
error (EXIT_TROUBLE, 0, "%s", err);
beg = lim;
}
while (beg < pat + psize);
if ((err = kwsprep (kwset)) != NULL)
error (EXIT_TROUBLE, 0, "%s", err);
}
size_t
Fexecute (char const *buf, size_t size, size_t *match_size,
char const *start_ptr)
{
char const *beg, *try, *end, *mb_start;
size_t len;
char eol = eolbyte;
struct kwsmatch kwsmatch;
size_t ret_val;
if (MB_CUR_MAX > 1)
{
if (match_icase)
{
char *case_buf = mbtolower (buf, &size);
if (start_ptr)
start_ptr = case_buf + (start_ptr - buf);
buf = case_buf;
}
}
for (mb_start = beg = start_ptr ? start_ptr : buf; beg <= buf + size; beg++)
{
size_t offset = kwsexec (kwset, beg, buf + size - beg, &kwsmatch);
if (offset == (size_t) -1)
goto failure;
len = kwsmatch.size[0];
if (MB_CUR_MAX > 1
&& is_mb_middle (&mb_start, beg + offset, buf + size, len))
{
/* The match was a part of multibyte character, advance at least
one byte to ensure no infinite loop happens. */
mbstate_t s;
memset (&s, 0, sizeof s);
size_t mb_len = mbrlen (mb_start, (buf + size) - (beg + offset), &s);
if (mb_len == (size_t) -2)
goto failure;
beg = mb_start;
if (mb_len != (size_t) -1)
beg += mb_len - 1;
continue;
}
beg += offset;
if (start_ptr && !match_words)
goto success_in_beg_and_len;
if (match_lines)
{
if (beg > buf && beg[-1] != eol)
continue;
if (beg + len < buf + size && beg[len] != eol)
continue;
goto success;
}
else if (match_words)
for (try = beg; ; )
{
if (try > buf && WCHAR((unsigned char) try[-1]))
break;
if (try + len < buf + size && WCHAR((unsigned char) try[len]))
{
if (!len)
break;
offset = kwsexec (kwset, beg, --len, &kwsmatch);
if (offset == (size_t) -1)
break;
try = beg + offset;
len = kwsmatch.size[0];
}
else if (!start_ptr)
goto success;
else
goto success_in_beg_and_len;
} /* for (try) */
else
goto success;
} /* for (beg in buf) */
failure:
ret_val = -1;
goto out;
success:
if ((end = memchr (beg + len, eol, (buf + size) - (beg + len))) != NULL)
end++;
else
end = buf + size;
while (buf < beg && beg[-1] != eol)
--beg;
len = end - beg;
success_in_beg_and_len:
*match_size = len;
ret_val = beg - buf;
out:
return ret_val;
}
|
