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
|
/* kwsearch.c - searching subroutines using kwset for grep.
Copyright 1992, 1998, 2000, 2007, 2009-2016 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"
/* Whether -w considers WC to be a word constituent. */
static bool
wordchar (wint_t wc)
{
return wc == L'_' || iswalnum (wc);
}
/* 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)
{
size_t total = size;
kwsinit (&kwset);
char const *p = pattern;
do
{
size_t len;
char const *sep = memchr (p, '\n', total);
if (sep)
{
len = sep - p;
sep++;
total -= (len + 1);
}
else
{
len = total;
total = 0;
}
char *buf = NULL;
if (match_lines)
{
buf = xmalloc (len + 2);
buf[0] = eolbyte;
memcpy (buf + 1, p, len);
buf[len + 1] = eolbyte;
p = buf;
len += 2;
}
kwsincr (kwset, p, len);
free (buf);
p = sep;
}
while (p);
kwsprep (kwset);
}
size_t
Fexecute (char *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;
for (mb_start = beg = start_ptr ? start_ptr : buf; beg <= buf + size; beg++)
{
size_t offset = kwsexec (kwset, beg - match_lines,
buf + size - beg + match_lines, &kwsmatch);
if (offset == (size_t) -1)
goto failure;
len = kwsmatch.size[0] - 2 * match_lines;
if (!match_lines && MB_CUR_MAX > 1 && !using_utf8 ()
&& mb_goback (&mb_start, beg + offset, buf + size) != 0)
{
/* We have matched a single byte that is not at the beginning of a
multibyte character. mb_goback has advanced MB_START past that
multibyte character. Now, we want to position BEG so that the
next kwsexec search starts there. Thus, to compensate for the
for-loop's BEG++, above, subtract one here. This code is
unusually hard to reach, and exceptionally, let's show how to
trigger it here:
printf '\203AA\n'|LC_ALL=ja_JP.SHIFT_JIS src/grep -F A
That assumes the named locale is installed.
Note that your system's shift-JIS locale may have a different
name, possibly including "sjis". */
beg = mb_start - 1;
continue;
}
beg += offset;
if (start_ptr && !match_words)
goto success_in_beg_and_len;
if (match_lines)
{
len += start_ptr == NULL;
goto success_in_beg_and_len;
}
if (match_words)
for (try = beg; ; )
{
char const *bol = memrchr (buf, eol, beg - buf);
bol = bol ? bol + 1 : buf;
if (wordchar (mb_prev_wc (bol, try, buf + size)))
break;
if (wordchar (mb_next_wc (try + len, buf + size)))
{
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:
return -1;
success:
end = memchr (beg + len, eol, (buf + size) - (beg + len));
end = end ? end + 1 : buf + size;
beg = memrchr (buf, eol, beg - buf);
beg = beg ? beg + 1 : buf;
len = end - beg;
success_in_beg_and_len:;
size_t off = beg - buf;
*match_size = len;
ret_val = off;
return ret_val;
}
|
