Commit | Line | Data |
---|---|---|
ca1d1d23 | 1 | /* String search routines for GNU Emacs. |
68c45bf0 | 2 | Copyright (C) 1985, 86,87,93,94,97,98, 1999 Free Software Foundation, Inc. |
ca1d1d23 JB |
3 | |
4 | This file is part of GNU Emacs. | |
5 | ||
6 | GNU Emacs is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
7c938215 | 8 | the Free Software Foundation; either version 2, or (at your option) |
ca1d1d23 JB |
9 | any later version. |
10 | ||
11 | GNU Emacs is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU Emacs; see the file COPYING. If not, write to | |
3b7ad313 EN |
18 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. */ | |
ca1d1d23 JB |
20 | |
21 | ||
18160b98 | 22 | #include <config.h> |
ca1d1d23 JB |
23 | #include "lisp.h" |
24 | #include "syntax.h" | |
5679531d | 25 | #include "category.h" |
ca1d1d23 | 26 | #include "buffer.h" |
5679531d | 27 | #include "charset.h" |
9169c321 | 28 | #include "region-cache.h" |
ca1d1d23 | 29 | #include "commands.h" |
9ac0d9e0 | 30 | #include "blockinput.h" |
bf1760bb | 31 | #include "intervals.h" |
4746118a | 32 | |
ca1d1d23 JB |
33 | #include <sys/types.h> |
34 | #include "regex.h" | |
35 | ||
67ce527d KH |
36 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
37 | #define max(a, b) ((a) > (b) ? (a) : (b)) | |
38 | ||
1d288aef | 39 | #define REGEXP_CACHE_SIZE 20 |
ca1d1d23 | 40 | |
487282dc KH |
41 | /* If the regexp is non-nil, then the buffer contains the compiled form |
42 | of that regexp, suitable for searching. */ | |
1d288aef RS |
43 | struct regexp_cache |
44 | { | |
487282dc KH |
45 | struct regexp_cache *next; |
46 | Lisp_Object regexp; | |
47 | struct re_pattern_buffer buf; | |
48 | char fastmap[0400]; | |
b819a390 RS |
49 | /* Nonzero means regexp was compiled to do full POSIX backtracking. */ |
50 | char posix; | |
487282dc | 51 | }; |
ca1d1d23 | 52 | |
487282dc KH |
53 | /* The instances of that struct. */ |
54 | struct regexp_cache searchbufs[REGEXP_CACHE_SIZE]; | |
ca1d1d23 | 55 | |
487282dc KH |
56 | /* The head of the linked list; points to the most recently used buffer. */ |
57 | struct regexp_cache *searchbuf_head; | |
ca1d1d23 | 58 | |
ca1d1d23 | 59 | |
4746118a JB |
60 | /* Every call to re_match, etc., must pass &search_regs as the regs |
61 | argument unless you can show it is unnecessary (i.e., if re_match | |
62 | is certainly going to be called again before region-around-match | |
63 | can be called). | |
64 | ||
65 | Since the registers are now dynamically allocated, we need to make | |
66 | sure not to refer to the Nth register before checking that it has | |
1113d9db JB |
67 | been allocated by checking search_regs.num_regs. |
68 | ||
69 | The regex code keeps track of whether it has allocated the search | |
487282dc KH |
70 | buffer using bits in the re_pattern_buffer. This means that whenever |
71 | you compile a new pattern, it completely forgets whether it has | |
1113d9db JB |
72 | allocated any registers, and will allocate new registers the next |
73 | time you call a searching or matching function. Therefore, we need | |
74 | to call re_set_registers after compiling a new pattern or after | |
75 | setting the match registers, so that the regex functions will be | |
76 | able to free or re-allocate it properly. */ | |
ca1d1d23 JB |
77 | static struct re_registers search_regs; |
78 | ||
daa37602 JB |
79 | /* The buffer in which the last search was performed, or |
80 | Qt if the last search was done in a string; | |
81 | Qnil if no searching has been done yet. */ | |
82 | static Lisp_Object last_thing_searched; | |
ca1d1d23 | 83 | |
8e6208c5 | 84 | /* error condition signaled when regexp compile_pattern fails */ |
ca1d1d23 JB |
85 | |
86 | Lisp_Object Qinvalid_regexp; | |
87 | ||
ca325161 | 88 | static void set_search_regs (); |
044f81f1 | 89 | static void save_search_regs (); |
facdc750 RS |
90 | static int simple_search (); |
91 | static int boyer_moore (); | |
b819a390 RS |
92 | static int search_buffer (); |
93 | ||
ca1d1d23 JB |
94 | static void |
95 | matcher_overflow () | |
96 | { | |
97 | error ("Stack overflow in regexp matcher"); | |
98 | } | |
99 | ||
b819a390 RS |
100 | /* Compile a regexp and signal a Lisp error if anything goes wrong. |
101 | PATTERN is the pattern to compile. | |
102 | CP is the place to put the result. | |
facdc750 | 103 | TRANSLATE is a translation table for ignoring case, or nil for none. |
b819a390 RS |
104 | REGP is the structure that says where to store the "register" |
105 | values that will result from matching this pattern. | |
106 | If it is 0, we should compile the pattern not to record any | |
107 | subexpression bounds. | |
108 | POSIX is nonzero if we want full backtracking (POSIX style) | |
5679531d KH |
109 | for this pattern. 0 means backtrack only enough to get a valid match. |
110 | MULTIBYTE is nonzero if we want to handle multibyte characters in | |
111 | PATTERN. 0 means all multibyte characters are recognized just as | |
112 | sequences of binary data. */ | |
ca1d1d23 | 113 | |
487282dc | 114 | static void |
5679531d | 115 | compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte) |
487282dc | 116 | struct regexp_cache *cp; |
ca1d1d23 | 117 | Lisp_Object pattern; |
facdc750 | 118 | Lisp_Object translate; |
487282dc | 119 | struct re_registers *regp; |
b819a390 | 120 | int posix; |
5679531d | 121 | int multibyte; |
ca1d1d23 | 122 | { |
7276d3d8 | 123 | unsigned char *raw_pattern; |
f8bd51c4 | 124 | int raw_pattern_size; |
d451e4db | 125 | char *val; |
b819a390 | 126 | reg_syntax_t old; |
ca1d1d23 | 127 | |
f8bd51c4 KH |
128 | /* MULTIBYTE says whether the text to be searched is multibyte. |
129 | We must convert PATTERN to match that, or we will not really | |
130 | find things right. */ | |
131 | ||
132 | if (multibyte == STRING_MULTIBYTE (pattern)) | |
133 | { | |
7276d3d8 | 134 | raw_pattern = (unsigned char *) XSTRING (pattern)->data; |
fc932ac6 | 135 | raw_pattern_size = STRING_BYTES (XSTRING (pattern)); |
f8bd51c4 KH |
136 | } |
137 | else if (multibyte) | |
138 | { | |
139 | raw_pattern_size = count_size_as_multibyte (XSTRING (pattern)->data, | |
140 | XSTRING (pattern)->size); | |
7276d3d8 | 141 | raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1); |
f8bd51c4 KH |
142 | copy_text (XSTRING (pattern)->data, raw_pattern, |
143 | XSTRING (pattern)->size, 0, 1); | |
144 | } | |
145 | else | |
146 | { | |
147 | /* Converting multibyte to single-byte. | |
148 | ||
149 | ??? Perhaps this conversion should be done in a special way | |
150 | by subtracting nonascii-insert-offset from each non-ASCII char, | |
151 | so that only the multibyte chars which really correspond to | |
152 | the chosen single-byte character set can possibly match. */ | |
153 | raw_pattern_size = XSTRING (pattern)->size; | |
7276d3d8 | 154 | raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1); |
f8bd51c4 | 155 | copy_text (XSTRING (pattern)->data, raw_pattern, |
fc932ac6 | 156 | STRING_BYTES (XSTRING (pattern)), 1, 0); |
f8bd51c4 KH |
157 | } |
158 | ||
487282dc | 159 | cp->regexp = Qnil; |
59fab369 | 160 | cp->buf.translate = (! NILP (translate) ? translate : make_number (0)); |
b819a390 | 161 | cp->posix = posix; |
5679531d | 162 | cp->buf.multibyte = multibyte; |
9ac0d9e0 | 163 | BLOCK_INPUT; |
fb4a568d | 164 | old = re_set_syntax (RE_SYNTAX_EMACS |
b819a390 | 165 | | (posix ? 0 : RE_NO_POSIX_BACKTRACKING)); |
7276d3d8 RS |
166 | val = (char *) re_compile_pattern ((char *)raw_pattern, |
167 | raw_pattern_size, &cp->buf); | |
b819a390 | 168 | re_set_syntax (old); |
9ac0d9e0 | 169 | UNBLOCK_INPUT; |
ca1d1d23 | 170 | if (val) |
487282dc | 171 | Fsignal (Qinvalid_regexp, Fcons (build_string (val), Qnil)); |
1113d9db | 172 | |
487282dc | 173 | cp->regexp = Fcopy_sequence (pattern); |
487282dc KH |
174 | } |
175 | ||
6efc7887 RS |
176 | /* Shrink each compiled regexp buffer in the cache |
177 | to the size actually used right now. | |
178 | This is called from garbage collection. */ | |
179 | ||
180 | void | |
181 | shrink_regexp_cache () | |
182 | { | |
183 | struct regexp_cache *cp, **cpp; | |
184 | ||
185 | for (cp = searchbuf_head; cp != 0; cp = cp->next) | |
186 | { | |
187 | cp->buf.allocated = cp->buf.used; | |
188 | cp->buf.buffer | |
189 | = (unsigned char *) realloc (cp->buf.buffer, cp->buf.used); | |
190 | } | |
191 | } | |
192 | ||
487282dc | 193 | /* Compile a regexp if necessary, but first check to see if there's one in |
b819a390 RS |
194 | the cache. |
195 | PATTERN is the pattern to compile. | |
facdc750 | 196 | TRANSLATE is a translation table for ignoring case, or nil for none. |
b819a390 RS |
197 | REGP is the structure that says where to store the "register" |
198 | values that will result from matching this pattern. | |
199 | If it is 0, we should compile the pattern not to record any | |
200 | subexpression bounds. | |
201 | POSIX is nonzero if we want full backtracking (POSIX style) | |
202 | for this pattern. 0 means backtrack only enough to get a valid match. */ | |
487282dc KH |
203 | |
204 | struct re_pattern_buffer * | |
0c8533c6 | 205 | compile_pattern (pattern, regp, translate, posix, multibyte) |
487282dc KH |
206 | Lisp_Object pattern; |
207 | struct re_registers *regp; | |
facdc750 | 208 | Lisp_Object translate; |
0c8533c6 | 209 | int posix, multibyte; |
487282dc KH |
210 | { |
211 | struct regexp_cache *cp, **cpp; | |
212 | ||
213 | for (cpp = &searchbuf_head; ; cpp = &cp->next) | |
214 | { | |
215 | cp = *cpp; | |
f1b9c7c1 KR |
216 | /* Entries are initialized to nil, and may be set to nil by |
217 | compile_pattern_1 if the pattern isn't valid. Don't apply | |
218 | XSTRING in those cases. However, compile_pattern_1 is only | |
219 | applied to the cache entry we pick here to reuse. So nil | |
220 | should never appear before a non-nil entry. */ | |
221 | if (cp->regexp == Qnil) | |
222 | goto compile_it; | |
1d288aef RS |
223 | if (XSTRING (cp->regexp)->size == XSTRING (pattern)->size |
224 | && !NILP (Fstring_equal (cp->regexp, pattern)) | |
59fab369 | 225 | && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0))) |
5679531d KH |
226 | && cp->posix == posix |
227 | && cp->buf.multibyte == multibyte) | |
487282dc KH |
228 | break; |
229 | ||
f1b9c7c1 KR |
230 | /* If we're at the end of the cache, compile into the nil cell |
231 | we found, or the last (least recently used) cell with a | |
232 | string value. */ | |
487282dc KH |
233 | if (cp->next == 0) |
234 | { | |
f1b9c7c1 | 235 | compile_it: |
5679531d | 236 | compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte); |
487282dc KH |
237 | break; |
238 | } | |
239 | } | |
240 | ||
241 | /* When we get here, cp (aka *cpp) contains the compiled pattern, | |
242 | either because we found it in the cache or because we just compiled it. | |
243 | Move it to the front of the queue to mark it as most recently used. */ | |
244 | *cpp = cp->next; | |
245 | cp->next = searchbuf_head; | |
246 | searchbuf_head = cp; | |
1113d9db | 247 | |
6639708c RS |
248 | /* Advise the searching functions about the space we have allocated |
249 | for register data. */ | |
250 | if (regp) | |
251 | re_set_registers (&cp->buf, regp, regp->num_regs, regp->start, regp->end); | |
252 | ||
487282dc | 253 | return &cp->buf; |
ca1d1d23 JB |
254 | } |
255 | ||
256 | /* Error condition used for failing searches */ | |
257 | Lisp_Object Qsearch_failed; | |
258 | ||
259 | Lisp_Object | |
260 | signal_failure (arg) | |
261 | Lisp_Object arg; | |
262 | { | |
263 | Fsignal (Qsearch_failed, Fcons (arg, Qnil)); | |
264 | return Qnil; | |
265 | } | |
266 | \f | |
b819a390 RS |
267 | static Lisp_Object |
268 | looking_at_1 (string, posix) | |
ca1d1d23 | 269 | Lisp_Object string; |
b819a390 | 270 | int posix; |
ca1d1d23 JB |
271 | { |
272 | Lisp_Object val; | |
273 | unsigned char *p1, *p2; | |
274 | int s1, s2; | |
275 | register int i; | |
487282dc | 276 | struct re_pattern_buffer *bufp; |
ca1d1d23 | 277 | |
7074fde6 FP |
278 | if (running_asynch_code) |
279 | save_search_regs (); | |
280 | ||
ca1d1d23 | 281 | CHECK_STRING (string, 0); |
487282dc KH |
282 | bufp = compile_pattern (string, &search_regs, |
283 | (!NILP (current_buffer->case_fold_search) | |
facdc750 | 284 | ? DOWNCASE_TABLE : Qnil), |
0c8533c6 RS |
285 | posix, |
286 | !NILP (current_buffer->enable_multibyte_characters)); | |
ca1d1d23 JB |
287 | |
288 | immediate_quit = 1; | |
289 | QUIT; /* Do a pending quit right away, to avoid paradoxical behavior */ | |
290 | ||
291 | /* Get pointers and sizes of the two strings | |
292 | that make up the visible portion of the buffer. */ | |
293 | ||
294 | p1 = BEGV_ADDR; | |
fa8ed3e0 | 295 | s1 = GPT_BYTE - BEGV_BYTE; |
ca1d1d23 | 296 | p2 = GAP_END_ADDR; |
fa8ed3e0 | 297 | s2 = ZV_BYTE - GPT_BYTE; |
ca1d1d23 JB |
298 | if (s1 < 0) |
299 | { | |
300 | p2 = p1; | |
fa8ed3e0 | 301 | s2 = ZV_BYTE - BEGV_BYTE; |
ca1d1d23 JB |
302 | s1 = 0; |
303 | } | |
304 | if (s2 < 0) | |
305 | { | |
fa8ed3e0 | 306 | s1 = ZV_BYTE - BEGV_BYTE; |
ca1d1d23 JB |
307 | s2 = 0; |
308 | } | |
8bb43c28 RS |
309 | |
310 | re_match_object = Qnil; | |
ca1d1d23 | 311 | |
487282dc | 312 | i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2, |
fa8ed3e0 RS |
313 | PT_BYTE - BEGV_BYTE, &search_regs, |
314 | ZV_BYTE - BEGV_BYTE); | |
de182d70 GM |
315 | immediate_quit = 0; |
316 | ||
ca1d1d23 JB |
317 | if (i == -2) |
318 | matcher_overflow (); | |
319 | ||
320 | val = (0 <= i ? Qt : Qnil); | |
fa8ed3e0 RS |
321 | if (i >= 0) |
322 | for (i = 0; i < search_regs.num_regs; i++) | |
323 | if (search_regs.start[i] >= 0) | |
324 | { | |
325 | search_regs.start[i] | |
326 | = BYTE_TO_CHAR (search_regs.start[i] + BEGV_BYTE); | |
327 | search_regs.end[i] | |
328 | = BYTE_TO_CHAR (search_regs.end[i] + BEGV_BYTE); | |
329 | } | |
a3668d92 | 330 | XSETBUFFER (last_thing_searched, current_buffer); |
ca1d1d23 JB |
331 | return val; |
332 | } | |
333 | ||
b819a390 | 334 | DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0, |
94f94972 | 335 | "Return t if text after point matches regular expression REGEXP.\n\ |
b819a390 RS |
336 | This function modifies the match data that `match-beginning',\n\ |
337 | `match-end' and `match-data' access; save and restore the match\n\ | |
338 | data if you want to preserve them.") | |
94f94972 RS |
339 | (regexp) |
340 | Lisp_Object regexp; | |
b819a390 | 341 | { |
94f94972 | 342 | return looking_at_1 (regexp, 0); |
b819a390 RS |
343 | } |
344 | ||
345 | DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0, | |
94f94972 | 346 | "Return t if text after point matches regular expression REGEXP.\n\ |
b819a390 RS |
347 | Find the longest match, in accord with Posix regular expression rules.\n\ |
348 | This function modifies the match data that `match-beginning',\n\ | |
349 | `match-end' and `match-data' access; save and restore the match\n\ | |
350 | data if you want to preserve them.") | |
94f94972 RS |
351 | (regexp) |
352 | Lisp_Object regexp; | |
b819a390 | 353 | { |
94f94972 | 354 | return looking_at_1 (regexp, 1); |
b819a390 RS |
355 | } |
356 | \f | |
357 | static Lisp_Object | |
358 | string_match_1 (regexp, string, start, posix) | |
ca1d1d23 | 359 | Lisp_Object regexp, string, start; |
b819a390 | 360 | int posix; |
ca1d1d23 JB |
361 | { |
362 | int val; | |
487282dc | 363 | struct re_pattern_buffer *bufp; |
0c8533c6 RS |
364 | int pos, pos_byte; |
365 | int i; | |
ca1d1d23 | 366 | |
7074fde6 FP |
367 | if (running_asynch_code) |
368 | save_search_regs (); | |
369 | ||
ca1d1d23 JB |
370 | CHECK_STRING (regexp, 0); |
371 | CHECK_STRING (string, 1); | |
372 | ||
373 | if (NILP (start)) | |
0c8533c6 | 374 | pos = 0, pos_byte = 0; |
ca1d1d23 JB |
375 | else |
376 | { | |
377 | int len = XSTRING (string)->size; | |
378 | ||
379 | CHECK_NUMBER (start, 2); | |
0c8533c6 RS |
380 | pos = XINT (start); |
381 | if (pos < 0 && -pos <= len) | |
382 | pos = len + pos; | |
383 | else if (0 > pos || pos > len) | |
ca1d1d23 | 384 | args_out_of_range (string, start); |
0c8533c6 | 385 | pos_byte = string_char_to_byte (string, pos); |
ca1d1d23 JB |
386 | } |
387 | ||
487282dc KH |
388 | bufp = compile_pattern (regexp, &search_regs, |
389 | (!NILP (current_buffer->case_fold_search) | |
facdc750 | 390 | ? DOWNCASE_TABLE : Qnil), |
0c8533c6 RS |
391 | posix, |
392 | STRING_MULTIBYTE (string)); | |
ca1d1d23 | 393 | immediate_quit = 1; |
8bb43c28 RS |
394 | re_match_object = string; |
395 | ||
487282dc | 396 | val = re_search (bufp, (char *) XSTRING (string)->data, |
fc932ac6 RS |
397 | STRING_BYTES (XSTRING (string)), pos_byte, |
398 | STRING_BYTES (XSTRING (string)) - pos_byte, | |
ca1d1d23 JB |
399 | &search_regs); |
400 | immediate_quit = 0; | |
daa37602 | 401 | last_thing_searched = Qt; |
ca1d1d23 JB |
402 | if (val == -2) |
403 | matcher_overflow (); | |
404 | if (val < 0) return Qnil; | |
0c8533c6 RS |
405 | |
406 | for (i = 0; i < search_regs.num_regs; i++) | |
407 | if (search_regs.start[i] >= 0) | |
408 | { | |
409 | search_regs.start[i] | |
410 | = string_byte_to_char (string, search_regs.start[i]); | |
411 | search_regs.end[i] | |
412 | = string_byte_to_char (string, search_regs.end[i]); | |
413 | } | |
414 | ||
415 | return make_number (string_byte_to_char (string, val)); | |
ca1d1d23 | 416 | } |
e59a8453 | 417 | |
b819a390 RS |
418 | DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0, |
419 | "Return index of start of first match for REGEXP in STRING, or nil.\n\ | |
21e01890 | 420 | Case is ignored if `case-fold-search' is non-nil in the current buffer.\n\ |
b819a390 RS |
421 | If third arg START is non-nil, start search at that index in STRING.\n\ |
422 | For index of first char beyond the match, do (match-end 0).\n\ | |
423 | `match-end' and `match-beginning' also give indices of substrings\n\ | |
424 | matched by parenthesis constructs in the pattern.") | |
425 | (regexp, string, start) | |
426 | Lisp_Object regexp, string, start; | |
427 | { | |
428 | return string_match_1 (regexp, string, start, 0); | |
429 | } | |
430 | ||
431 | DEFUN ("posix-string-match", Fposix_string_match, Sposix_string_match, 2, 3, 0, | |
432 | "Return index of start of first match for REGEXP in STRING, or nil.\n\ | |
433 | Find the longest match, in accord with Posix regular expression rules.\n\ | |
21e01890 | 434 | Case is ignored if `case-fold-search' is non-nil in the current buffer.\n\ |
b819a390 RS |
435 | If third arg START is non-nil, start search at that index in STRING.\n\ |
436 | For index of first char beyond the match, do (match-end 0).\n\ | |
437 | `match-end' and `match-beginning' also give indices of substrings\n\ | |
438 | matched by parenthesis constructs in the pattern.") | |
439 | (regexp, string, start) | |
440 | Lisp_Object regexp, string, start; | |
441 | { | |
442 | return string_match_1 (regexp, string, start, 1); | |
443 | } | |
444 | ||
e59a8453 RS |
445 | /* Match REGEXP against STRING, searching all of STRING, |
446 | and return the index of the match, or negative on failure. | |
447 | This does not clobber the match data. */ | |
448 | ||
449 | int | |
450 | fast_string_match (regexp, string) | |
451 | Lisp_Object regexp, string; | |
452 | { | |
453 | int val; | |
487282dc | 454 | struct re_pattern_buffer *bufp; |
e59a8453 | 455 | |
facdc750 RS |
456 | bufp = compile_pattern (regexp, 0, Qnil, |
457 | 0, STRING_MULTIBYTE (string)); | |
e59a8453 | 458 | immediate_quit = 1; |
8bb43c28 RS |
459 | re_match_object = string; |
460 | ||
487282dc | 461 | val = re_search (bufp, (char *) XSTRING (string)->data, |
fc932ac6 RS |
462 | STRING_BYTES (XSTRING (string)), 0, |
463 | STRING_BYTES (XSTRING (string)), 0); | |
e59a8453 RS |
464 | immediate_quit = 0; |
465 | return val; | |
466 | } | |
5679531d KH |
467 | |
468 | /* Match REGEXP against STRING, searching all of STRING ignoring case, | |
469 | and return the index of the match, or negative on failure. | |
0c8533c6 RS |
470 | This does not clobber the match data. |
471 | We assume that STRING contains single-byte characters. */ | |
5679531d KH |
472 | |
473 | extern Lisp_Object Vascii_downcase_table; | |
474 | ||
475 | int | |
b4577c63 | 476 | fast_c_string_match_ignore_case (regexp, string) |
5679531d KH |
477 | Lisp_Object regexp; |
478 | char *string; | |
479 | { | |
480 | int val; | |
481 | struct re_pattern_buffer *bufp; | |
482 | int len = strlen (string); | |
483 | ||
0c8533c6 | 484 | regexp = string_make_unibyte (regexp); |
b4577c63 | 485 | re_match_object = Qt; |
5679531d | 486 | bufp = compile_pattern (regexp, 0, |
facdc750 | 487 | Vascii_downcase_table, 0, |
f8bd51c4 | 488 | 0); |
5679531d KH |
489 | immediate_quit = 1; |
490 | val = re_search (bufp, string, len, 0, len, 0); | |
491 | immediate_quit = 0; | |
492 | return val; | |
493 | } | |
ca1d1d23 | 494 | \f |
9169c321 JB |
495 | /* The newline cache: remembering which sections of text have no newlines. */ |
496 | ||
497 | /* If the user has requested newline caching, make sure it's on. | |
498 | Otherwise, make sure it's off. | |
499 | This is our cheezy way of associating an action with the change of | |
500 | state of a buffer-local variable. */ | |
501 | static void | |
502 | newline_cache_on_off (buf) | |
503 | struct buffer *buf; | |
504 | { | |
505 | if (NILP (buf->cache_long_line_scans)) | |
506 | { | |
507 | /* It should be off. */ | |
508 | if (buf->newline_cache) | |
509 | { | |
510 | free_region_cache (buf->newline_cache); | |
511 | buf->newline_cache = 0; | |
512 | } | |
513 | } | |
514 | else | |
515 | { | |
516 | /* It should be on. */ | |
517 | if (buf->newline_cache == 0) | |
518 | buf->newline_cache = new_region_cache (); | |
519 | } | |
520 | } | |
521 | ||
522 | \f | |
523 | /* Search for COUNT instances of the character TARGET between START and END. | |
524 | ||
525 | If COUNT is positive, search forwards; END must be >= START. | |
526 | If COUNT is negative, search backwards for the -COUNTth instance; | |
527 | END must be <= START. | |
528 | If COUNT is zero, do anything you please; run rogue, for all I care. | |
529 | ||
530 | If END is zero, use BEGV or ZV instead, as appropriate for the | |
531 | direction indicated by COUNT. | |
ffd56f97 JB |
532 | |
533 | If we find COUNT instances, set *SHORTAGE to zero, and return the | |
5bfe95c9 RS |
534 | position after the COUNTth match. Note that for reverse motion |
535 | this is not the same as the usual convention for Emacs motion commands. | |
ffd56f97 | 536 | |
9169c321 JB |
537 | If we don't find COUNT instances before reaching END, set *SHORTAGE |
538 | to the number of TARGETs left unfound, and return END. | |
ffd56f97 | 539 | |
087a5f81 RS |
540 | If ALLOW_QUIT is non-zero, set immediate_quit. That's good to do |
541 | except when inside redisplay. */ | |
542 | ||
dfcf069d | 543 | int |
9169c321 JB |
544 | scan_buffer (target, start, end, count, shortage, allow_quit) |
545 | register int target; | |
546 | int start, end; | |
547 | int count; | |
548 | int *shortage; | |
087a5f81 | 549 | int allow_quit; |
ca1d1d23 | 550 | { |
9169c321 JB |
551 | struct region_cache *newline_cache; |
552 | int direction; | |
ffd56f97 | 553 | |
9169c321 JB |
554 | if (count > 0) |
555 | { | |
556 | direction = 1; | |
557 | if (! end) end = ZV; | |
558 | } | |
559 | else | |
560 | { | |
561 | direction = -1; | |
562 | if (! end) end = BEGV; | |
563 | } | |
ffd56f97 | 564 | |
9169c321 JB |
565 | newline_cache_on_off (current_buffer); |
566 | newline_cache = current_buffer->newline_cache; | |
ca1d1d23 JB |
567 | |
568 | if (shortage != 0) | |
569 | *shortage = 0; | |
570 | ||
087a5f81 | 571 | immediate_quit = allow_quit; |
ca1d1d23 | 572 | |
ffd56f97 | 573 | if (count > 0) |
9169c321 | 574 | while (start != end) |
ca1d1d23 | 575 | { |
9169c321 JB |
576 | /* Our innermost scanning loop is very simple; it doesn't know |
577 | about gaps, buffer ends, or the newline cache. ceiling is | |
578 | the position of the last character before the next such | |
579 | obstacle --- the last character the dumb search loop should | |
580 | examine. */ | |
fa8ed3e0 RS |
581 | int ceiling_byte = CHAR_TO_BYTE (end) - 1; |
582 | int start_byte = CHAR_TO_BYTE (start); | |
67ce527d | 583 | int tem; |
9169c321 JB |
584 | |
585 | /* If we're looking for a newline, consult the newline cache | |
586 | to see where we can avoid some scanning. */ | |
587 | if (target == '\n' && newline_cache) | |
588 | { | |
589 | int next_change; | |
590 | immediate_quit = 0; | |
591 | while (region_cache_forward | |
fa8ed3e0 RS |
592 | (current_buffer, newline_cache, start_byte, &next_change)) |
593 | start_byte = next_change; | |
cbe0db0d | 594 | immediate_quit = allow_quit; |
9169c321 | 595 | |
fa8ed3e0 RS |
596 | /* START should never be after END. */ |
597 | if (start_byte > ceiling_byte) | |
598 | start_byte = ceiling_byte; | |
9169c321 JB |
599 | |
600 | /* Now the text after start is an unknown region, and | |
601 | next_change is the position of the next known region. */ | |
fa8ed3e0 | 602 | ceiling_byte = min (next_change - 1, ceiling_byte); |
9169c321 JB |
603 | } |
604 | ||
605 | /* The dumb loop can only scan text stored in contiguous | |
606 | bytes. BUFFER_CEILING_OF returns the last character | |
607 | position that is contiguous, so the ceiling is the | |
608 | position after that. */ | |
67ce527d KH |
609 | tem = BUFFER_CEILING_OF (start_byte); |
610 | ceiling_byte = min (tem, ceiling_byte); | |
9169c321 JB |
611 | |
612 | { | |
613 | /* The termination address of the dumb loop. */ | |
fa8ed3e0 RS |
614 | register unsigned char *ceiling_addr |
615 | = BYTE_POS_ADDR (ceiling_byte) + 1; | |
616 | register unsigned char *cursor | |
617 | = BYTE_POS_ADDR (start_byte); | |
9169c321 JB |
618 | unsigned char *base = cursor; |
619 | ||
620 | while (cursor < ceiling_addr) | |
621 | { | |
622 | unsigned char *scan_start = cursor; | |
623 | ||
624 | /* The dumb loop. */ | |
625 | while (*cursor != target && ++cursor < ceiling_addr) | |
626 | ; | |
627 | ||
628 | /* If we're looking for newlines, cache the fact that | |
629 | the region from start to cursor is free of them. */ | |
630 | if (target == '\n' && newline_cache) | |
631 | know_region_cache (current_buffer, newline_cache, | |
fa8ed3e0 RS |
632 | start_byte + scan_start - base, |
633 | start_byte + cursor - base); | |
9169c321 JB |
634 | |
635 | /* Did we find the target character? */ | |
636 | if (cursor < ceiling_addr) | |
637 | { | |
638 | if (--count == 0) | |
639 | { | |
640 | immediate_quit = 0; | |
fa8ed3e0 | 641 | return BYTE_TO_CHAR (start_byte + cursor - base + 1); |
9169c321 JB |
642 | } |
643 | cursor++; | |
644 | } | |
645 | } | |
646 | ||
fa8ed3e0 | 647 | start = BYTE_TO_CHAR (start_byte + cursor - base); |
9169c321 | 648 | } |
ca1d1d23 JB |
649 | } |
650 | else | |
9169c321 JB |
651 | while (start > end) |
652 | { | |
653 | /* The last character to check before the next obstacle. */ | |
fa8ed3e0 RS |
654 | int ceiling_byte = CHAR_TO_BYTE (end); |
655 | int start_byte = CHAR_TO_BYTE (start); | |
67ce527d | 656 | int tem; |
9169c321 JB |
657 | |
658 | /* Consult the newline cache, if appropriate. */ | |
659 | if (target == '\n' && newline_cache) | |
660 | { | |
661 | int next_change; | |
662 | immediate_quit = 0; | |
663 | while (region_cache_backward | |
fa8ed3e0 RS |
664 | (current_buffer, newline_cache, start_byte, &next_change)) |
665 | start_byte = next_change; | |
cbe0db0d | 666 | immediate_quit = allow_quit; |
9169c321 JB |
667 | |
668 | /* Start should never be at or before end. */ | |
fa8ed3e0 RS |
669 | if (start_byte <= ceiling_byte) |
670 | start_byte = ceiling_byte + 1; | |
9169c321 JB |
671 | |
672 | /* Now the text before start is an unknown region, and | |
673 | next_change is the position of the next known region. */ | |
fa8ed3e0 | 674 | ceiling_byte = max (next_change, ceiling_byte); |
9169c321 JB |
675 | } |
676 | ||
677 | /* Stop scanning before the gap. */ | |
67ce527d KH |
678 | tem = BUFFER_FLOOR_OF (start_byte - 1); |
679 | ceiling_byte = max (tem, ceiling_byte); | |
9169c321 JB |
680 | |
681 | { | |
682 | /* The termination address of the dumb loop. */ | |
fa8ed3e0 RS |
683 | register unsigned char *ceiling_addr = BYTE_POS_ADDR (ceiling_byte); |
684 | register unsigned char *cursor = BYTE_POS_ADDR (start_byte - 1); | |
9169c321 JB |
685 | unsigned char *base = cursor; |
686 | ||
687 | while (cursor >= ceiling_addr) | |
688 | { | |
689 | unsigned char *scan_start = cursor; | |
690 | ||
691 | while (*cursor != target && --cursor >= ceiling_addr) | |
692 | ; | |
693 | ||
694 | /* If we're looking for newlines, cache the fact that | |
695 | the region from after the cursor to start is free of them. */ | |
696 | if (target == '\n' && newline_cache) | |
697 | know_region_cache (current_buffer, newline_cache, | |
fa8ed3e0 RS |
698 | start_byte + cursor - base, |
699 | start_byte + scan_start - base); | |
9169c321 JB |
700 | |
701 | /* Did we find the target character? */ | |
702 | if (cursor >= ceiling_addr) | |
703 | { | |
704 | if (++count >= 0) | |
705 | { | |
706 | immediate_quit = 0; | |
fa8ed3e0 | 707 | return BYTE_TO_CHAR (start_byte + cursor - base); |
9169c321 JB |
708 | } |
709 | cursor--; | |
710 | } | |
711 | } | |
712 | ||
fa8ed3e0 | 713 | start = BYTE_TO_CHAR (start_byte + cursor - base); |
9169c321 JB |
714 | } |
715 | } | |
716 | ||
ca1d1d23 JB |
717 | immediate_quit = 0; |
718 | if (shortage != 0) | |
ffd56f97 | 719 | *shortage = count * direction; |
9169c321 | 720 | return start; |
ca1d1d23 | 721 | } |
fa8ed3e0 RS |
722 | \f |
723 | /* Search for COUNT instances of a line boundary, which means either a | |
724 | newline or (if selective display enabled) a carriage return. | |
725 | Start at START. If COUNT is negative, search backwards. | |
726 | ||
727 | We report the resulting position by calling TEMP_SET_PT_BOTH. | |
728 | ||
729 | If we find COUNT instances. we position after (always after, | |
730 | even if scanning backwards) the COUNTth match, and return 0. | |
731 | ||
732 | If we don't find COUNT instances before reaching the end of the | |
733 | buffer (or the beginning, if scanning backwards), we return | |
734 | the number of line boundaries left unfound, and position at | |
735 | the limit we bumped up against. | |
736 | ||
737 | If ALLOW_QUIT is non-zero, set immediate_quit. That's good to do | |
d5d57b92 | 738 | except in special cases. */ |
ca1d1d23 | 739 | |
63fa018d | 740 | int |
fa8ed3e0 RS |
741 | scan_newline (start, start_byte, limit, limit_byte, count, allow_quit) |
742 | int start, start_byte; | |
743 | int limit, limit_byte; | |
744 | register int count; | |
745 | int allow_quit; | |
63fa018d | 746 | { |
fa8ed3e0 RS |
747 | int direction = ((count > 0) ? 1 : -1); |
748 | ||
749 | register unsigned char *cursor; | |
750 | unsigned char *base; | |
751 | ||
752 | register int ceiling; | |
753 | register unsigned char *ceiling_addr; | |
754 | ||
d5d57b92 RS |
755 | int old_immediate_quit = immediate_quit; |
756 | ||
fa8ed3e0 RS |
757 | /* If we are not in selective display mode, |
758 | check only for newlines. */ | |
759 | int selective_display = (!NILP (current_buffer->selective_display) | |
760 | && !INTEGERP (current_buffer->selective_display)); | |
761 | ||
762 | /* The code that follows is like scan_buffer | |
763 | but checks for either newline or carriage return. */ | |
764 | ||
d5d57b92 RS |
765 | if (allow_quit) |
766 | immediate_quit++; | |
fa8ed3e0 RS |
767 | |
768 | start_byte = CHAR_TO_BYTE (start); | |
769 | ||
770 | if (count > 0) | |
771 | { | |
772 | while (start_byte < limit_byte) | |
773 | { | |
774 | ceiling = BUFFER_CEILING_OF (start_byte); | |
775 | ceiling = min (limit_byte - 1, ceiling); | |
776 | ceiling_addr = BYTE_POS_ADDR (ceiling) + 1; | |
777 | base = (cursor = BYTE_POS_ADDR (start_byte)); | |
778 | while (1) | |
779 | { | |
780 | while (*cursor != '\n' && ++cursor != ceiling_addr) | |
781 | ; | |
782 | ||
783 | if (cursor != ceiling_addr) | |
784 | { | |
785 | if (--count == 0) | |
786 | { | |
d5d57b92 | 787 | immediate_quit = old_immediate_quit; |
fa8ed3e0 RS |
788 | start_byte = start_byte + cursor - base + 1; |
789 | start = BYTE_TO_CHAR (start_byte); | |
790 | TEMP_SET_PT_BOTH (start, start_byte); | |
791 | return 0; | |
792 | } | |
793 | else | |
794 | if (++cursor == ceiling_addr) | |
795 | break; | |
796 | } | |
797 | else | |
798 | break; | |
799 | } | |
800 | start_byte += cursor - base; | |
801 | } | |
802 | } | |
803 | else | |
804 | { | |
fa8ed3e0 RS |
805 | while (start_byte > limit_byte) |
806 | { | |
807 | ceiling = BUFFER_FLOOR_OF (start_byte - 1); | |
808 | ceiling = max (limit_byte, ceiling); | |
809 | ceiling_addr = BYTE_POS_ADDR (ceiling) - 1; | |
810 | base = (cursor = BYTE_POS_ADDR (start_byte - 1) + 1); | |
811 | while (1) | |
812 | { | |
813 | while (--cursor != ceiling_addr && *cursor != '\n') | |
814 | ; | |
815 | ||
816 | if (cursor != ceiling_addr) | |
817 | { | |
818 | if (++count == 0) | |
819 | { | |
d5d57b92 | 820 | immediate_quit = old_immediate_quit; |
fa8ed3e0 RS |
821 | /* Return the position AFTER the match we found. */ |
822 | start_byte = start_byte + cursor - base + 1; | |
823 | start = BYTE_TO_CHAR (start_byte); | |
824 | TEMP_SET_PT_BOTH (start, start_byte); | |
825 | return 0; | |
826 | } | |
827 | } | |
828 | else | |
829 | break; | |
830 | } | |
831 | /* Here we add 1 to compensate for the last decrement | |
832 | of CURSOR, which took it past the valid range. */ | |
833 | start_byte += cursor - base + 1; | |
834 | } | |
835 | } | |
836 | ||
837 | TEMP_SET_PT_BOTH (limit, limit_byte); | |
d5d57b92 | 838 | immediate_quit = old_immediate_quit; |
fa8ed3e0 RS |
839 | |
840 | return count * direction; | |
63fa018d RS |
841 | } |
842 | ||
ca1d1d23 | 843 | int |
fa8ed3e0 | 844 | find_next_newline_no_quit (from, cnt) |
ca1d1d23 JB |
845 | register int from, cnt; |
846 | { | |
fa8ed3e0 | 847 | return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0); |
9169c321 JB |
848 | } |
849 | ||
9169c321 JB |
850 | /* Like find_next_newline, but returns position before the newline, |
851 | not after, and only search up to TO. This isn't just | |
852 | find_next_newline (...)-1, because you might hit TO. */ | |
fa8ed3e0 | 853 | |
9169c321 JB |
854 | int |
855 | find_before_next_newline (from, to, cnt) | |
cbe0db0d | 856 | int from, to, cnt; |
9169c321 JB |
857 | { |
858 | int shortage; | |
859 | int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1); | |
860 | ||
861 | if (shortage == 0) | |
862 | pos--; | |
863 | ||
864 | return pos; | |
ca1d1d23 JB |
865 | } |
866 | \f | |
ca1d1d23 JB |
867 | /* Subroutines of Lisp buffer search functions. */ |
868 | ||
869 | static Lisp_Object | |
b819a390 | 870 | search_command (string, bound, noerror, count, direction, RE, posix) |
ca1d1d23 JB |
871 | Lisp_Object string, bound, noerror, count; |
872 | int direction; | |
873 | int RE; | |
b819a390 | 874 | int posix; |
ca1d1d23 JB |
875 | { |
876 | register int np; | |
9f43ad85 | 877 | int lim, lim_byte; |
ca1d1d23 JB |
878 | int n = direction; |
879 | ||
880 | if (!NILP (count)) | |
881 | { | |
882 | CHECK_NUMBER (count, 3); | |
883 | n *= XINT (count); | |
884 | } | |
885 | ||
886 | CHECK_STRING (string, 0); | |
887 | if (NILP (bound)) | |
9f43ad85 RS |
888 | { |
889 | if (n > 0) | |
890 | lim = ZV, lim_byte = ZV_BYTE; | |
891 | else | |
892 | lim = BEGV, lim_byte = BEGV_BYTE; | |
893 | } | |
ca1d1d23 JB |
894 | else |
895 | { | |
896 | CHECK_NUMBER_COERCE_MARKER (bound, 1); | |
897 | lim = XINT (bound); | |
6ec8bbd2 | 898 | if (n > 0 ? lim < PT : lim > PT) |
ca1d1d23 JB |
899 | error ("Invalid search bound (wrong side of point)"); |
900 | if (lim > ZV) | |
9f43ad85 | 901 | lim = ZV, lim_byte = ZV_BYTE; |
588d2fd5 | 902 | else if (lim < BEGV) |
9f43ad85 | 903 | lim = BEGV, lim_byte = BEGV_BYTE; |
588d2fd5 KH |
904 | else |
905 | lim_byte = CHAR_TO_BYTE (lim); | |
ca1d1d23 JB |
906 | } |
907 | ||
9f43ad85 | 908 | np = search_buffer (string, PT, PT_BYTE, lim, lim_byte, n, RE, |
ca1d1d23 | 909 | (!NILP (current_buffer->case_fold_search) |
facdc750 | 910 | ? current_buffer->case_canon_table |
3135e9fd | 911 | : Qnil), |
ca1d1d23 | 912 | (!NILP (current_buffer->case_fold_search) |
facdc750 | 913 | ? current_buffer->case_eqv_table |
3135e9fd | 914 | : Qnil), |
b819a390 | 915 | posix); |
ca1d1d23 JB |
916 | if (np <= 0) |
917 | { | |
918 | if (NILP (noerror)) | |
919 | return signal_failure (string); | |
920 | if (!EQ (noerror, Qt)) | |
921 | { | |
922 | if (lim < BEGV || lim > ZV) | |
923 | abort (); | |
9f43ad85 | 924 | SET_PT_BOTH (lim, lim_byte); |
a5f217b8 RS |
925 | return Qnil; |
926 | #if 0 /* This would be clean, but maybe programs depend on | |
927 | a value of nil here. */ | |
481399bf | 928 | np = lim; |
a5f217b8 | 929 | #endif |
ca1d1d23 | 930 | } |
481399bf RS |
931 | else |
932 | return Qnil; | |
ca1d1d23 JB |
933 | } |
934 | ||
935 | if (np < BEGV || np > ZV) | |
936 | abort (); | |
937 | ||
938 | SET_PT (np); | |
939 | ||
940 | return make_number (np); | |
941 | } | |
942 | \f | |
fa8ed3e0 RS |
943 | /* Return 1 if REGEXP it matches just one constant string. */ |
944 | ||
b6d6a51c KH |
945 | static int |
946 | trivial_regexp_p (regexp) | |
947 | Lisp_Object regexp; | |
948 | { | |
fc932ac6 | 949 | int len = STRING_BYTES (XSTRING (regexp)); |
b6d6a51c KH |
950 | unsigned char *s = XSTRING (regexp)->data; |
951 | unsigned char c; | |
952 | while (--len >= 0) | |
953 | { | |
954 | switch (*s++) | |
955 | { | |
956 | case '.': case '*': case '+': case '?': case '[': case '^': case '$': | |
957 | return 0; | |
958 | case '\\': | |
959 | if (--len < 0) | |
960 | return 0; | |
961 | switch (*s++) | |
962 | { | |
963 | case '|': case '(': case ')': case '`': case '\'': case 'b': | |
964 | case 'B': case '<': case '>': case 'w': case 'W': case 's': | |
866f60fd | 965 | case 'S': case '=': |
5679531d | 966 | case 'c': case 'C': /* for categoryspec and notcategoryspec */ |
866f60fd | 967 | case '1': case '2': case '3': case '4': case '5': |
b6d6a51c KH |
968 | case '6': case '7': case '8': case '9': |
969 | return 0; | |
970 | } | |
971 | } | |
972 | } | |
973 | return 1; | |
974 | } | |
975 | ||
ca325161 | 976 | /* Search for the n'th occurrence of STRING in the current buffer, |
ca1d1d23 | 977 | starting at position POS and stopping at position LIM, |
b819a390 | 978 | treating STRING as a literal string if RE is false or as |
ca1d1d23 JB |
979 | a regular expression if RE is true. |
980 | ||
981 | If N is positive, searching is forward and LIM must be greater than POS. | |
982 | If N is negative, searching is backward and LIM must be less than POS. | |
983 | ||
facdc750 | 984 | Returns -x if x occurrences remain to be found (x > 0), |
ca1d1d23 | 985 | or else the position at the beginning of the Nth occurrence |
b819a390 RS |
986 | (if searching backward) or the end (if searching forward). |
987 | ||
988 | POSIX is nonzero if we want full backtracking (POSIX style) | |
989 | for this pattern. 0 means backtrack only enough to get a valid match. */ | |
ca1d1d23 | 990 | |
aff2ce94 RS |
991 | #define TRANSLATE(out, trt, d) \ |
992 | do \ | |
993 | { \ | |
994 | if (! NILP (trt)) \ | |
995 | { \ | |
996 | Lisp_Object temp; \ | |
997 | temp = Faref (trt, make_number (d)); \ | |
998 | if (INTEGERP (temp)) \ | |
999 | out = XINT (temp); \ | |
1000 | else \ | |
1001 | out = d; \ | |
1002 | } \ | |
1003 | else \ | |
1004 | out = d; \ | |
1005 | } \ | |
1006 | while (0) | |
facdc750 | 1007 | |
b819a390 | 1008 | static int |
9f43ad85 RS |
1009 | search_buffer (string, pos, pos_byte, lim, lim_byte, n, |
1010 | RE, trt, inverse_trt, posix) | |
ca1d1d23 JB |
1011 | Lisp_Object string; |
1012 | int pos; | |
9f43ad85 | 1013 | int pos_byte; |
ca1d1d23 | 1014 | int lim; |
9f43ad85 | 1015 | int lim_byte; |
ca1d1d23 JB |
1016 | int n; |
1017 | int RE; | |
facdc750 RS |
1018 | Lisp_Object trt; |
1019 | Lisp_Object inverse_trt; | |
b819a390 | 1020 | int posix; |
ca1d1d23 JB |
1021 | { |
1022 | int len = XSTRING (string)->size; | |
fc932ac6 | 1023 | int len_byte = STRING_BYTES (XSTRING (string)); |
facdc750 | 1024 | register int i; |
ca1d1d23 | 1025 | |
7074fde6 FP |
1026 | if (running_asynch_code) |
1027 | save_search_regs (); | |
1028 | ||
a7e4cdde | 1029 | /* Searching 0 times means don't move. */ |
ca1d1d23 | 1030 | /* Null string is found at starting position. */ |
a7e4cdde | 1031 | if (len == 0 || n == 0) |
ca325161 RS |
1032 | { |
1033 | set_search_regs (pos, 0); | |
1034 | return pos; | |
1035 | } | |
3f57a499 | 1036 | |
b6d6a51c | 1037 | if (RE && !trivial_regexp_p (string)) |
ca1d1d23 | 1038 | { |
facdc750 RS |
1039 | unsigned char *p1, *p2; |
1040 | int s1, s2; | |
487282dc KH |
1041 | struct re_pattern_buffer *bufp; |
1042 | ||
0c8533c6 RS |
1043 | bufp = compile_pattern (string, &search_regs, trt, posix, |
1044 | !NILP (current_buffer->enable_multibyte_characters)); | |
ca1d1d23 | 1045 | |
ca1d1d23 JB |
1046 | immediate_quit = 1; /* Quit immediately if user types ^G, |
1047 | because letting this function finish | |
1048 | can take too long. */ | |
1049 | QUIT; /* Do a pending quit right away, | |
1050 | to avoid paradoxical behavior */ | |
1051 | /* Get pointers and sizes of the two strings | |
1052 | that make up the visible portion of the buffer. */ | |
1053 | ||
1054 | p1 = BEGV_ADDR; | |
fa8ed3e0 | 1055 | s1 = GPT_BYTE - BEGV_BYTE; |
ca1d1d23 | 1056 | p2 = GAP_END_ADDR; |
fa8ed3e0 | 1057 | s2 = ZV_BYTE - GPT_BYTE; |
ca1d1d23 JB |
1058 | if (s1 < 0) |
1059 | { | |
1060 | p2 = p1; | |
fa8ed3e0 | 1061 | s2 = ZV_BYTE - BEGV_BYTE; |
ca1d1d23 JB |
1062 | s1 = 0; |
1063 | } | |
1064 | if (s2 < 0) | |
1065 | { | |
fa8ed3e0 | 1066 | s1 = ZV_BYTE - BEGV_BYTE; |
ca1d1d23 JB |
1067 | s2 = 0; |
1068 | } | |
8bb43c28 RS |
1069 | re_match_object = Qnil; |
1070 | ||
ca1d1d23 JB |
1071 | while (n < 0) |
1072 | { | |
42db823b | 1073 | int val; |
487282dc | 1074 | val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2, |
4996330b KH |
1075 | pos_byte - BEGV_BYTE, lim_byte - pos_byte, |
1076 | &search_regs, | |
42db823b | 1077 | /* Don't allow match past current point */ |
4996330b | 1078 | pos_byte - BEGV_BYTE); |
ca1d1d23 | 1079 | if (val == -2) |
b6d6a51c KH |
1080 | { |
1081 | matcher_overflow (); | |
1082 | } | |
ca1d1d23 JB |
1083 | if (val >= 0) |
1084 | { | |
26aff150 | 1085 | pos_byte = search_regs.start[0] + BEGV_BYTE; |
4746118a | 1086 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
1087 | if (search_regs.start[i] >= 0) |
1088 | { | |
fa8ed3e0 RS |
1089 | search_regs.start[i] |
1090 | = BYTE_TO_CHAR (search_regs.start[i] + BEGV_BYTE); | |
1091 | search_regs.end[i] | |
1092 | = BYTE_TO_CHAR (search_regs.end[i] + BEGV_BYTE); | |
ca1d1d23 | 1093 | } |
a3668d92 | 1094 | XSETBUFFER (last_thing_searched, current_buffer); |
ca1d1d23 JB |
1095 | /* Set pos to the new position. */ |
1096 | pos = search_regs.start[0]; | |
1097 | } | |
1098 | else | |
1099 | { | |
1100 | immediate_quit = 0; | |
1101 | return (n); | |
1102 | } | |
1103 | n++; | |
1104 | } | |
1105 | while (n > 0) | |
1106 | { | |
42db823b | 1107 | int val; |
487282dc | 1108 | val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2, |
4996330b KH |
1109 | pos_byte - BEGV_BYTE, lim_byte - pos_byte, |
1110 | &search_regs, | |
1111 | lim_byte - BEGV_BYTE); | |
ca1d1d23 | 1112 | if (val == -2) |
b6d6a51c KH |
1113 | { |
1114 | matcher_overflow (); | |
1115 | } | |
ca1d1d23 JB |
1116 | if (val >= 0) |
1117 | { | |
26aff150 | 1118 | pos_byte = search_regs.end[0] + BEGV_BYTE; |
4746118a | 1119 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
1120 | if (search_regs.start[i] >= 0) |
1121 | { | |
fa8ed3e0 RS |
1122 | search_regs.start[i] |
1123 | = BYTE_TO_CHAR (search_regs.start[i] + BEGV_BYTE); | |
1124 | search_regs.end[i] | |
1125 | = BYTE_TO_CHAR (search_regs.end[i] + BEGV_BYTE); | |
ca1d1d23 | 1126 | } |
a3668d92 | 1127 | XSETBUFFER (last_thing_searched, current_buffer); |
ca1d1d23 JB |
1128 | pos = search_regs.end[0]; |
1129 | } | |
1130 | else | |
1131 | { | |
1132 | immediate_quit = 0; | |
1133 | return (0 - n); | |
1134 | } | |
1135 | n--; | |
1136 | } | |
1137 | immediate_quit = 0; | |
1138 | return (pos); | |
1139 | } | |
1140 | else /* non-RE case */ | |
1141 | { | |
facdc750 RS |
1142 | unsigned char *raw_pattern, *pat; |
1143 | int raw_pattern_size; | |
1144 | int raw_pattern_size_byte; | |
1145 | unsigned char *patbuf; | |
1146 | int multibyte = !NILP (current_buffer->enable_multibyte_characters); | |
1147 | unsigned char *base_pat = XSTRING (string)->data; | |
1148 | int charset_base = -1; | |
040272ce | 1149 | int boyer_moore_ok = 1; |
facdc750 RS |
1150 | |
1151 | /* MULTIBYTE says whether the text to be searched is multibyte. | |
1152 | We must convert PATTERN to match that, or we will not really | |
1153 | find things right. */ | |
1154 | ||
1155 | if (multibyte == STRING_MULTIBYTE (string)) | |
1156 | { | |
7276d3d8 | 1157 | raw_pattern = (unsigned char *) XSTRING (string)->data; |
facdc750 | 1158 | raw_pattern_size = XSTRING (string)->size; |
fc932ac6 | 1159 | raw_pattern_size_byte = STRING_BYTES (XSTRING (string)); |
facdc750 RS |
1160 | } |
1161 | else if (multibyte) | |
1162 | { | |
1163 | raw_pattern_size = XSTRING (string)->size; | |
1164 | raw_pattern_size_byte | |
1165 | = count_size_as_multibyte (XSTRING (string)->data, | |
1166 | raw_pattern_size); | |
7276d3d8 | 1167 | raw_pattern = (unsigned char *) alloca (raw_pattern_size_byte + 1); |
facdc750 RS |
1168 | copy_text (XSTRING (string)->data, raw_pattern, |
1169 | XSTRING (string)->size, 0, 1); | |
1170 | } | |
1171 | else | |
1172 | { | |
1173 | /* Converting multibyte to single-byte. | |
1174 | ||
1175 | ??? Perhaps this conversion should be done in a special way | |
1176 | by subtracting nonascii-insert-offset from each non-ASCII char, | |
1177 | so that only the multibyte chars which really correspond to | |
1178 | the chosen single-byte character set can possibly match. */ | |
1179 | raw_pattern_size = XSTRING (string)->size; | |
1180 | raw_pattern_size_byte = XSTRING (string)->size; | |
7276d3d8 | 1181 | raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1); |
facdc750 | 1182 | copy_text (XSTRING (string)->data, raw_pattern, |
fc932ac6 | 1183 | STRING_BYTES (XSTRING (string)), 1, 0); |
facdc750 RS |
1184 | } |
1185 | ||
1186 | /* Copy and optionally translate the pattern. */ | |
1187 | len = raw_pattern_size; | |
1188 | len_byte = raw_pattern_size_byte; | |
1189 | patbuf = (unsigned char *) alloca (len_byte); | |
1190 | pat = patbuf; | |
1191 | base_pat = raw_pattern; | |
1192 | if (multibyte) | |
1193 | { | |
1194 | while (--len >= 0) | |
1195 | { | |
daaa6ed8 | 1196 | unsigned char str[MAX_MULTIBYTE_LENGTH]; |
aff2ce94 | 1197 | int c, translated, inverse; |
facdc750 RS |
1198 | int in_charlen, charlen; |
1199 | ||
1200 | /* If we got here and the RE flag is set, it's because we're | |
1201 | dealing with a regexp known to be trivial, so the backslash | |
1202 | just quotes the next character. */ | |
1203 | if (RE && *base_pat == '\\') | |
1204 | { | |
1205 | len--; | |
1206 | len_byte--; | |
1207 | base_pat++; | |
1208 | } | |
1209 | ||
1210 | c = STRING_CHAR_AND_LENGTH (base_pat, len_byte, in_charlen); | |
040272ce | 1211 | |
facdc750 | 1212 | /* Translate the character, if requested. */ |
aff2ce94 | 1213 | TRANSLATE (translated, trt, c); |
facdc750 RS |
1214 | /* If translation changed the byte-length, go back |
1215 | to the original character. */ | |
daaa6ed8 | 1216 | charlen = CHAR_STRING (translated, str); |
facdc750 RS |
1217 | if (in_charlen != charlen) |
1218 | { | |
1219 | translated = c; | |
daaa6ed8 | 1220 | charlen = CHAR_STRING (c, str); |
facdc750 RS |
1221 | } |
1222 | ||
5ffaf437 RS |
1223 | /* If we are searching for something strange, |
1224 | an invalid multibyte code, don't use boyer-moore. */ | |
1225 | if (! ASCII_BYTE_P (translated) | |
1226 | && (charlen == 1 /* 8bit code */ | |
1227 | || charlen != in_charlen /* invalid multibyte code */ | |
1228 | )) | |
1229 | boyer_moore_ok = 0; | |
1230 | ||
aff2ce94 RS |
1231 | TRANSLATE (inverse, inverse_trt, c); |
1232 | ||
facdc750 RS |
1233 | /* Did this char actually get translated? |
1234 | Would any other char get translated into it? */ | |
aff2ce94 | 1235 | if (translated != c || inverse != c) |
facdc750 RS |
1236 | { |
1237 | /* Keep track of which character set row | |
1238 | contains the characters that need translation. */ | |
5ffaf437 | 1239 | int charset_base_code = c & ~CHAR_FIELD3_MASK; |
facdc750 RS |
1240 | if (charset_base == -1) |
1241 | charset_base = charset_base_code; | |
1242 | else if (charset_base != charset_base_code) | |
1243 | /* If two different rows appear, needing translation, | |
1244 | then we cannot use boyer_moore search. */ | |
040272ce | 1245 | boyer_moore_ok = 0; |
aff2ce94 | 1246 | } |
facdc750 RS |
1247 | |
1248 | /* Store this character into the translated pattern. */ | |
1249 | bcopy (str, pat, charlen); | |
1250 | pat += charlen; | |
1251 | base_pat += in_charlen; | |
1252 | len_byte -= in_charlen; | |
1253 | } | |
1254 | } | |
1255 | else | |
1256 | { | |
040272ce KH |
1257 | /* Unibyte buffer. */ |
1258 | charset_base = 0; | |
facdc750 RS |
1259 | while (--len >= 0) |
1260 | { | |
040272ce | 1261 | int c, translated; |
facdc750 RS |
1262 | |
1263 | /* If we got here and the RE flag is set, it's because we're | |
1264 | dealing with a regexp known to be trivial, so the backslash | |
1265 | just quotes the next character. */ | |
1266 | if (RE && *base_pat == '\\') | |
1267 | { | |
1268 | len--; | |
1269 | base_pat++; | |
1270 | } | |
1271 | c = *base_pat++; | |
aff2ce94 | 1272 | TRANSLATE (translated, trt, c); |
facdc750 RS |
1273 | *pat++ = translated; |
1274 | } | |
1275 | } | |
1276 | ||
1277 | len_byte = pat - patbuf; | |
1278 | len = raw_pattern_size; | |
1279 | pat = base_pat = patbuf; | |
1280 | ||
040272ce | 1281 | if (boyer_moore_ok) |
facdc750 | 1282 | return boyer_moore (n, pat, len, len_byte, trt, inverse_trt, |
aff2ce94 RS |
1283 | pos, pos_byte, lim, lim_byte, |
1284 | charset_base); | |
facdc750 RS |
1285 | else |
1286 | return simple_search (n, pat, len, len_byte, trt, | |
1287 | pos, pos_byte, lim, lim_byte); | |
1288 | } | |
1289 | } | |
1290 | \f | |
1291 | /* Do a simple string search N times for the string PAT, | |
1292 | whose length is LEN/LEN_BYTE, | |
1293 | from buffer position POS/POS_BYTE until LIM/LIM_BYTE. | |
1294 | TRT is the translation table. | |
f8bd51c4 | 1295 | |
facdc750 RS |
1296 | Return the character position where the match is found. |
1297 | Otherwise, if M matches remained to be found, return -M. | |
f8bd51c4 | 1298 | |
facdc750 RS |
1299 | This kind of search works regardless of what is in PAT and |
1300 | regardless of what is in TRT. It is used in cases where | |
1301 | boyer_moore cannot work. */ | |
1302 | ||
1303 | static int | |
1304 | simple_search (n, pat, len, len_byte, trt, pos, pos_byte, lim, lim_byte) | |
1305 | int n; | |
1306 | unsigned char *pat; | |
1307 | int len, len_byte; | |
1308 | Lisp_Object trt; | |
1309 | int pos, pos_byte; | |
1310 | int lim, lim_byte; | |
1311 | { | |
1312 | int multibyte = ! NILP (current_buffer->enable_multibyte_characters); | |
ab228c24 | 1313 | int forward = n > 0; |
facdc750 RS |
1314 | |
1315 | if (lim > pos && multibyte) | |
1316 | while (n > 0) | |
1317 | { | |
1318 | while (1) | |
f8bd51c4 | 1319 | { |
facdc750 RS |
1320 | /* Try matching at position POS. */ |
1321 | int this_pos = pos; | |
1322 | int this_pos_byte = pos_byte; | |
1323 | int this_len = len; | |
1324 | int this_len_byte = len_byte; | |
1325 | unsigned char *p = pat; | |
1326 | if (pos + len > lim) | |
1327 | goto stop; | |
1328 | ||
1329 | while (this_len > 0) | |
1330 | { | |
1331 | int charlen, buf_charlen; | |
ab228c24 | 1332 | int pat_ch, buf_ch; |
facdc750 | 1333 | |
ab228c24 | 1334 | pat_ch = STRING_CHAR_AND_LENGTH (p, this_len_byte, charlen); |
facdc750 RS |
1335 | buf_ch = STRING_CHAR_AND_LENGTH (BYTE_POS_ADDR (this_pos_byte), |
1336 | ZV_BYTE - this_pos_byte, | |
1337 | buf_charlen); | |
aff2ce94 | 1338 | TRANSLATE (buf_ch, trt, buf_ch); |
facdc750 RS |
1339 | |
1340 | if (buf_ch != pat_ch) | |
1341 | break; | |
ab228c24 RS |
1342 | |
1343 | this_len_byte -= charlen; | |
1344 | this_len--; | |
1345 | p += charlen; | |
1346 | ||
1347 | this_pos_byte += buf_charlen; | |
1348 | this_pos++; | |
facdc750 RS |
1349 | } |
1350 | ||
1351 | if (this_len == 0) | |
1352 | { | |
1353 | pos += len; | |
1354 | pos_byte += len_byte; | |
1355 | break; | |
1356 | } | |
1357 | ||
1358 | INC_BOTH (pos, pos_byte); | |
f8bd51c4 | 1359 | } |
facdc750 RS |
1360 | |
1361 | n--; | |
1362 | } | |
1363 | else if (lim > pos) | |
1364 | while (n > 0) | |
1365 | { | |
1366 | while (1) | |
f8bd51c4 | 1367 | { |
facdc750 RS |
1368 | /* Try matching at position POS. */ |
1369 | int this_pos = pos; | |
1370 | int this_len = len; | |
1371 | unsigned char *p = pat; | |
1372 | ||
1373 | if (pos + len > lim) | |
1374 | goto stop; | |
1375 | ||
1376 | while (this_len > 0) | |
1377 | { | |
1378 | int pat_ch = *p++; | |
1379 | int buf_ch = FETCH_BYTE (this_pos); | |
aff2ce94 | 1380 | TRANSLATE (buf_ch, trt, buf_ch); |
facdc750 RS |
1381 | |
1382 | if (buf_ch != pat_ch) | |
1383 | break; | |
ab228c24 RS |
1384 | |
1385 | this_len--; | |
1386 | this_pos++; | |
facdc750 RS |
1387 | } |
1388 | ||
1389 | if (this_len == 0) | |
1390 | { | |
1391 | pos += len; | |
1392 | break; | |
1393 | } | |
1394 | ||
1395 | pos++; | |
f8bd51c4 | 1396 | } |
facdc750 RS |
1397 | |
1398 | n--; | |
1399 | } | |
1400 | /* Backwards search. */ | |
1401 | else if (lim < pos && multibyte) | |
1402 | while (n < 0) | |
1403 | { | |
1404 | while (1) | |
f8bd51c4 | 1405 | { |
facdc750 RS |
1406 | /* Try matching at position POS. */ |
1407 | int this_pos = pos - len; | |
1408 | int this_pos_byte = pos_byte - len_byte; | |
1409 | int this_len = len; | |
1410 | int this_len_byte = len_byte; | |
1411 | unsigned char *p = pat; | |
1412 | ||
1413 | if (pos - len < lim) | |
1414 | goto stop; | |
1415 | ||
1416 | while (this_len > 0) | |
1417 | { | |
1418 | int charlen, buf_charlen; | |
ab228c24 | 1419 | int pat_ch, buf_ch; |
facdc750 | 1420 | |
ab228c24 | 1421 | pat_ch = STRING_CHAR_AND_LENGTH (p, this_len_byte, charlen); |
facdc750 RS |
1422 | buf_ch = STRING_CHAR_AND_LENGTH (BYTE_POS_ADDR (this_pos_byte), |
1423 | ZV_BYTE - this_pos_byte, | |
1424 | buf_charlen); | |
aff2ce94 | 1425 | TRANSLATE (buf_ch, trt, buf_ch); |
facdc750 RS |
1426 | |
1427 | if (buf_ch != pat_ch) | |
1428 | break; | |
ab228c24 RS |
1429 | |
1430 | this_len_byte -= charlen; | |
1431 | this_len--; | |
1432 | p += charlen; | |
1433 | this_pos_byte += buf_charlen; | |
1434 | this_pos++; | |
facdc750 RS |
1435 | } |
1436 | ||
1437 | if (this_len == 0) | |
1438 | { | |
1439 | pos -= len; | |
1440 | pos_byte -= len_byte; | |
1441 | break; | |
1442 | } | |
1443 | ||
1444 | DEC_BOTH (pos, pos_byte); | |
f8bd51c4 KH |
1445 | } |
1446 | ||
facdc750 RS |
1447 | n++; |
1448 | } | |
1449 | else if (lim < pos) | |
1450 | while (n < 0) | |
1451 | { | |
1452 | while (1) | |
b6d6a51c | 1453 | { |
facdc750 RS |
1454 | /* Try matching at position POS. */ |
1455 | int this_pos = pos - len; | |
1456 | int this_len = len; | |
1457 | unsigned char *p = pat; | |
1458 | ||
1459 | if (pos - len < lim) | |
1460 | goto stop; | |
1461 | ||
1462 | while (this_len > 0) | |
1463 | { | |
1464 | int pat_ch = *p++; | |
1465 | int buf_ch = FETCH_BYTE (this_pos); | |
aff2ce94 | 1466 | TRANSLATE (buf_ch, trt, buf_ch); |
facdc750 RS |
1467 | |
1468 | if (buf_ch != pat_ch) | |
1469 | break; | |
ab228c24 RS |
1470 | this_len--; |
1471 | this_pos++; | |
facdc750 RS |
1472 | } |
1473 | ||
1474 | if (this_len == 0) | |
b6d6a51c | 1475 | { |
facdc750 RS |
1476 | pos -= len; |
1477 | break; | |
b6d6a51c | 1478 | } |
facdc750 RS |
1479 | |
1480 | pos--; | |
b6d6a51c | 1481 | } |
facdc750 RS |
1482 | |
1483 | n++; | |
b6d6a51c | 1484 | } |
facdc750 RS |
1485 | |
1486 | stop: | |
1487 | if (n == 0) | |
aff2ce94 | 1488 | { |
ab228c24 RS |
1489 | if (forward) |
1490 | set_search_regs ((multibyte ? pos_byte : pos) - len_byte, len_byte); | |
1491 | else | |
1492 | set_search_regs (multibyte ? pos_byte : pos, len_byte); | |
aff2ce94 RS |
1493 | |
1494 | return pos; | |
1495 | } | |
facdc750 RS |
1496 | else if (n > 0) |
1497 | return -n; | |
1498 | else | |
1499 | return n; | |
1500 | } | |
1501 | \f | |
1502 | /* Do Boyer-Moore search N times for the string PAT, | |
1503 | whose length is LEN/LEN_BYTE, | |
1504 | from buffer position POS/POS_BYTE until LIM/LIM_BYTE. | |
1505 | DIRECTION says which direction we search in. | |
1506 | TRT and INVERSE_TRT are translation tables. | |
1507 | ||
1508 | This kind of search works if all the characters in PAT that have | |
1509 | nontrivial translation are the same aside from the last byte. This | |
1510 | makes it possible to translate just the last byte of a character, | |
1511 | and do so after just a simple test of the context. | |
1512 | ||
1513 | If that criterion is not satisfied, do not call this function. */ | |
1514 | ||
1515 | static int | |
1516 | boyer_moore (n, base_pat, len, len_byte, trt, inverse_trt, | |
aff2ce94 | 1517 | pos, pos_byte, lim, lim_byte, charset_base) |
facdc750 RS |
1518 | int n; |
1519 | unsigned char *base_pat; | |
1520 | int len, len_byte; | |
1521 | Lisp_Object trt; | |
1522 | Lisp_Object inverse_trt; | |
1523 | int pos, pos_byte; | |
1524 | int lim, lim_byte; | |
aff2ce94 | 1525 | int charset_base; |
facdc750 RS |
1526 | { |
1527 | int direction = ((n > 0) ? 1 : -1); | |
1528 | register int dirlen; | |
1529 | int infinity, limit, k, stride_for_teases; | |
1530 | register int *BM_tab; | |
1531 | int *BM_tab_base; | |
1532 | register unsigned char *cursor, *p_limit; | |
1533 | register int i, j; | |
cb6792d2 | 1534 | unsigned char *pat, *pat_end; |
facdc750 RS |
1535 | int multibyte = ! NILP (current_buffer->enable_multibyte_characters); |
1536 | ||
1537 | unsigned char simple_translate[0400]; | |
1538 | int translate_prev_byte; | |
1539 | int translate_anteprev_byte; | |
1540 | ||
1541 | #ifdef C_ALLOCA | |
1542 | int BM_tab_space[0400]; | |
1543 | BM_tab = &BM_tab_space[0]; | |
1544 | #else | |
1545 | BM_tab = (int *) alloca (0400 * sizeof (int)); | |
1546 | #endif | |
1547 | /* The general approach is that we are going to maintain that we know */ | |
1548 | /* the first (closest to the present position, in whatever direction */ | |
1549 | /* we're searching) character that could possibly be the last */ | |
1550 | /* (furthest from present position) character of a valid match. We */ | |
1551 | /* advance the state of our knowledge by looking at that character */ | |
1552 | /* and seeing whether it indeed matches the last character of the */ | |
1553 | /* pattern. If it does, we take a closer look. If it does not, we */ | |
1554 | /* move our pointer (to putative last characters) as far as is */ | |
1555 | /* logically possible. This amount of movement, which I call a */ | |
1556 | /* stride, will be the length of the pattern if the actual character */ | |
1557 | /* appears nowhere in the pattern, otherwise it will be the distance */ | |
1558 | /* from the last occurrence of that character to the end of the */ | |
1559 | /* pattern. */ | |
1560 | /* As a coding trick, an enormous stride is coded into the table for */ | |
1561 | /* characters that match the last character. This allows use of only */ | |
1562 | /* a single test, a test for having gone past the end of the */ | |
1563 | /* permissible match region, to test for both possible matches (when */ | |
1564 | /* the stride goes past the end immediately) and failure to */ | |
1565 | /* match (where you get nudged past the end one stride at a time). */ | |
1566 | ||
1567 | /* Here we make a "mickey mouse" BM table. The stride of the search */ | |
1568 | /* is determined only by the last character of the putative match. */ | |
1569 | /* If that character does not match, we will stride the proper */ | |
1570 | /* distance to propose a match that superimposes it on the last */ | |
1571 | /* instance of a character that matches it (per trt), or misses */ | |
1572 | /* it entirely if there is none. */ | |
1573 | ||
1574 | dirlen = len_byte * direction; | |
1575 | infinity = dirlen - (lim_byte + pos_byte + len_byte + len_byte) * direction; | |
cb6792d2 RS |
1576 | |
1577 | /* Record position after the end of the pattern. */ | |
1578 | pat_end = base_pat + len_byte; | |
1579 | /* BASE_PAT points to a character that we start scanning from. | |
1580 | It is the first character in a forward search, | |
1581 | the last character in a backward search. */ | |
facdc750 | 1582 | if (direction < 0) |
cb6792d2 RS |
1583 | base_pat = pat_end - 1; |
1584 | ||
facdc750 RS |
1585 | BM_tab_base = BM_tab; |
1586 | BM_tab += 0400; | |
1587 | j = dirlen; /* to get it in a register */ | |
1588 | /* A character that does not appear in the pattern induces a */ | |
1589 | /* stride equal to the pattern length. */ | |
1590 | while (BM_tab_base != BM_tab) | |
1591 | { | |
1592 | *--BM_tab = j; | |
1593 | *--BM_tab = j; | |
1594 | *--BM_tab = j; | |
1595 | *--BM_tab = j; | |
1596 | } | |
1597 | ||
1598 | /* We use this for translation, instead of TRT itself. | |
1599 | We fill this in to handle the characters that actually | |
1600 | occur in the pattern. Others don't matter anyway! */ | |
1601 | bzero (simple_translate, sizeof simple_translate); | |
1602 | for (i = 0; i < 0400; i++) | |
1603 | simple_translate[i] = i; | |
1604 | ||
1605 | i = 0; | |
1606 | while (i != infinity) | |
1607 | { | |
cb6792d2 | 1608 | unsigned char *ptr = base_pat + i; |
facdc750 RS |
1609 | i += direction; |
1610 | if (i == dirlen) | |
1611 | i = infinity; | |
1612 | if (! NILP (trt)) | |
ca1d1d23 | 1613 | { |
facdc750 | 1614 | int ch; |
aff2ce94 | 1615 | int untranslated; |
facdc750 RS |
1616 | int this_translated = 1; |
1617 | ||
1618 | if (multibyte | |
cb6792d2 RS |
1619 | /* Is *PTR the last byte of a character? */ |
1620 | && (pat_end - ptr == 1 || CHAR_HEAD_P (ptr[1]))) | |
ca1d1d23 | 1621 | { |
facdc750 RS |
1622 | unsigned char *charstart = ptr; |
1623 | while (! CHAR_HEAD_P (*charstart)) | |
1624 | charstart--; | |
aff2ce94 | 1625 | untranslated = STRING_CHAR (charstart, ptr - charstart + 1); |
6397418a | 1626 | if (charset_base == (untranslated & ~CHAR_FIELD3_MASK)) |
facdc750 | 1627 | { |
ab228c24 | 1628 | TRANSLATE (ch, trt, untranslated); |
aff2ce94 RS |
1629 | if (! CHAR_HEAD_P (*ptr)) |
1630 | { | |
1631 | translate_prev_byte = ptr[-1]; | |
1632 | if (! CHAR_HEAD_P (translate_prev_byte)) | |
1633 | translate_anteprev_byte = ptr[-2]; | |
1634 | } | |
facdc750 | 1635 | } |
aff2ce94 | 1636 | else |
ab228c24 RS |
1637 | { |
1638 | this_translated = 0; | |
1639 | ch = *ptr; | |
1640 | } | |
ca1d1d23 | 1641 | } |
facdc750 | 1642 | else if (!multibyte) |
aff2ce94 | 1643 | TRANSLATE (ch, trt, *ptr); |
ca1d1d23 JB |
1644 | else |
1645 | { | |
facdc750 RS |
1646 | ch = *ptr; |
1647 | this_translated = 0; | |
ca1d1d23 | 1648 | } |
facdc750 | 1649 | |
ab228c24 RS |
1650 | if (ch > 0400) |
1651 | j = ((unsigned char) ch) | 0200; | |
1652 | else | |
1653 | j = (unsigned char) ch; | |
1654 | ||
facdc750 RS |
1655 | if (i == infinity) |
1656 | stride_for_teases = BM_tab[j]; | |
ab228c24 | 1657 | |
facdc750 RS |
1658 | BM_tab[j] = dirlen - i; |
1659 | /* A translation table is accompanied by its inverse -- see */ | |
1660 | /* comment following downcase_table for details */ | |
1661 | if (this_translated) | |
ab228c24 RS |
1662 | { |
1663 | int starting_ch = ch; | |
1664 | int starting_j = j; | |
1665 | while (1) | |
1666 | { | |
1667 | TRANSLATE (ch, inverse_trt, ch); | |
1668 | if (ch > 0400) | |
1669 | j = ((unsigned char) ch) | 0200; | |
1670 | else | |
1671 | j = (unsigned char) ch; | |
1672 | ||
1673 | /* For all the characters that map into CH, | |
1674 | set up simple_translate to map the last byte | |
1675 | into STARTING_J. */ | |
1676 | simple_translate[j] = starting_j; | |
1677 | if (ch == starting_ch) | |
1678 | break; | |
1679 | BM_tab[j] = dirlen - i; | |
1680 | } | |
1681 | } | |
facdc750 RS |
1682 | } |
1683 | else | |
1684 | { | |
1685 | j = *ptr; | |
1686 | ||
1687 | if (i == infinity) | |
1688 | stride_for_teases = BM_tab[j]; | |
1689 | BM_tab[j] = dirlen - i; | |
ca1d1d23 | 1690 | } |
facdc750 RS |
1691 | /* stride_for_teases tells how much to stride if we get a */ |
1692 | /* match on the far character but are subsequently */ | |
1693 | /* disappointed, by recording what the stride would have been */ | |
1694 | /* for that character if the last character had been */ | |
1695 | /* different. */ | |
1696 | } | |
1697 | infinity = dirlen - infinity; | |
1698 | pos_byte += dirlen - ((direction > 0) ? direction : 0); | |
1699 | /* loop invariant - POS_BYTE points at where last char (first | |
1700 | char if reverse) of pattern would align in a possible match. */ | |
1701 | while (n != 0) | |
1702 | { | |
1703 | int tail_end; | |
1704 | unsigned char *tail_end_ptr; | |
1705 | ||
1706 | /* It's been reported that some (broken) compiler thinks that | |
1707 | Boolean expressions in an arithmetic context are unsigned. | |
1708 | Using an explicit ?1:0 prevents this. */ | |
1709 | if ((lim_byte - pos_byte - ((direction > 0) ? 1 : 0)) * direction | |
1710 | < 0) | |
1711 | return (n * (0 - direction)); | |
1712 | /* First we do the part we can by pointers (maybe nothing) */ | |
1713 | QUIT; | |
1714 | pat = base_pat; | |
1715 | limit = pos_byte - dirlen + direction; | |
67ce527d KH |
1716 | if (direction > 0) |
1717 | { | |
1718 | limit = BUFFER_CEILING_OF (limit); | |
1719 | /* LIMIT is now the last (not beyond-last!) value POS_BYTE | |
1720 | can take on without hitting edge of buffer or the gap. */ | |
1721 | limit = min (limit, pos_byte + 20000); | |
1722 | limit = min (limit, lim_byte - 1); | |
1723 | } | |
1724 | else | |
1725 | { | |
1726 | limit = BUFFER_FLOOR_OF (limit); | |
1727 | /* LIMIT is now the last (not beyond-last!) value POS_BYTE | |
1728 | can take on without hitting edge of buffer or the gap. */ | |
1729 | limit = max (limit, pos_byte - 20000); | |
1730 | limit = max (limit, lim_byte); | |
1731 | } | |
facdc750 RS |
1732 | tail_end = BUFFER_CEILING_OF (pos_byte) + 1; |
1733 | tail_end_ptr = BYTE_POS_ADDR (tail_end); | |
1734 | ||
1735 | if ((limit - pos_byte) * direction > 20) | |
ca1d1d23 | 1736 | { |
facdc750 RS |
1737 | unsigned char *p2; |
1738 | ||
1739 | p_limit = BYTE_POS_ADDR (limit); | |
1740 | p2 = (cursor = BYTE_POS_ADDR (pos_byte)); | |
1741 | /* In this loop, pos + cursor - p2 is the surrogate for pos */ | |
1742 | while (1) /* use one cursor setting as long as i can */ | |
ca1d1d23 | 1743 | { |
facdc750 | 1744 | if (direction > 0) /* worth duplicating */ |
ca1d1d23 | 1745 | { |
facdc750 RS |
1746 | /* Use signed comparison if appropriate |
1747 | to make cursor+infinity sure to be > p_limit. | |
1748 | Assuming that the buffer lies in a range of addresses | |
1749 | that are all "positive" (as ints) or all "negative", | |
1750 | either kind of comparison will work as long | |
1751 | as we don't step by infinity. So pick the kind | |
1752 | that works when we do step by infinity. */ | |
1753 | if ((EMACS_INT) (p_limit + infinity) > (EMACS_INT) p_limit) | |
1754 | while ((EMACS_INT) cursor <= (EMACS_INT) p_limit) | |
1755 | cursor += BM_tab[*cursor]; | |
ca1d1d23 | 1756 | else |
facdc750 RS |
1757 | while ((EMACS_UINT) cursor <= (EMACS_UINT) p_limit) |
1758 | cursor += BM_tab[*cursor]; | |
1759 | } | |
1760 | else | |
1761 | { | |
1762 | if ((EMACS_INT) (p_limit + infinity) < (EMACS_INT) p_limit) | |
1763 | while ((EMACS_INT) cursor >= (EMACS_INT) p_limit) | |
1764 | cursor += BM_tab[*cursor]; | |
1765 | else | |
1766 | while ((EMACS_UINT) cursor >= (EMACS_UINT) p_limit) | |
1767 | cursor += BM_tab[*cursor]; | |
1768 | } | |
ca1d1d23 | 1769 | /* If you are here, cursor is beyond the end of the searched region. */ |
facdc750 RS |
1770 | /* This can happen if you match on the far character of the pattern, */ |
1771 | /* because the "stride" of that character is infinity, a number able */ | |
1772 | /* to throw you well beyond the end of the search. It can also */ | |
1773 | /* happen if you fail to match within the permitted region and would */ | |
1774 | /* otherwise try a character beyond that region */ | |
1775 | if ((cursor - p_limit) * direction <= len_byte) | |
1776 | break; /* a small overrun is genuine */ | |
1777 | cursor -= infinity; /* large overrun = hit */ | |
1778 | i = dirlen - direction; | |
1779 | if (! NILP (trt)) | |
1780 | { | |
1781 | while ((i -= direction) + direction != 0) | |
ca1d1d23 | 1782 | { |
facdc750 RS |
1783 | int ch; |
1784 | cursor -= direction; | |
1785 | /* Translate only the last byte of a character. */ | |
1786 | if (! multibyte | |
1787 | || ((cursor == tail_end_ptr | |
1788 | || CHAR_HEAD_P (cursor[1])) | |
1789 | && (CHAR_HEAD_P (cursor[0]) | |
1790 | || (translate_prev_byte == cursor[-1] | |
1791 | && (CHAR_HEAD_P (translate_prev_byte) | |
1792 | || translate_anteprev_byte == cursor[-2]))))) | |
1793 | ch = simple_translate[*cursor]; | |
1794 | else | |
1795 | ch = *cursor; | |
1796 | if (pat[i] != ch) | |
1797 | break; | |
ca1d1d23 | 1798 | } |
facdc750 RS |
1799 | } |
1800 | else | |
1801 | { | |
1802 | while ((i -= direction) + direction != 0) | |
ca1d1d23 | 1803 | { |
facdc750 RS |
1804 | cursor -= direction; |
1805 | if (pat[i] != *cursor) | |
1806 | break; | |
ca1d1d23 | 1807 | } |
facdc750 RS |
1808 | } |
1809 | cursor += dirlen - i - direction; /* fix cursor */ | |
1810 | if (i + direction == 0) | |
1811 | { | |
1812 | int position; | |
0c8533c6 | 1813 | |
facdc750 | 1814 | cursor -= direction; |
1113d9db | 1815 | |
facdc750 RS |
1816 | position = pos_byte + cursor - p2 + ((direction > 0) |
1817 | ? 1 - len_byte : 0); | |
1818 | set_search_regs (position, len_byte); | |
ca325161 | 1819 | |
facdc750 RS |
1820 | if ((n -= direction) != 0) |
1821 | cursor += dirlen; /* to resume search */ | |
ca1d1d23 | 1822 | else |
facdc750 RS |
1823 | return ((direction > 0) |
1824 | ? search_regs.end[0] : search_regs.start[0]); | |
ca1d1d23 | 1825 | } |
facdc750 RS |
1826 | else |
1827 | cursor += stride_for_teases; /* <sigh> we lose - */ | |
ca1d1d23 | 1828 | } |
facdc750 RS |
1829 | pos_byte += cursor - p2; |
1830 | } | |
1831 | else | |
1832 | /* Now we'll pick up a clump that has to be done the hard */ | |
1833 | /* way because it covers a discontinuity */ | |
1834 | { | |
1835 | limit = ((direction > 0) | |
1836 | ? BUFFER_CEILING_OF (pos_byte - dirlen + 1) | |
1837 | : BUFFER_FLOOR_OF (pos_byte - dirlen - 1)); | |
1838 | limit = ((direction > 0) | |
1839 | ? min (limit + len_byte, lim_byte - 1) | |
1840 | : max (limit - len_byte, lim_byte)); | |
1841 | /* LIMIT is now the last value POS_BYTE can have | |
1842 | and still be valid for a possible match. */ | |
1843 | while (1) | |
ca1d1d23 | 1844 | { |
facdc750 RS |
1845 | /* This loop can be coded for space rather than */ |
1846 | /* speed because it will usually run only once. */ | |
1847 | /* (the reach is at most len + 21, and typically */ | |
1848 | /* does not exceed len) */ | |
1849 | while ((limit - pos_byte) * direction >= 0) | |
1850 | pos_byte += BM_tab[FETCH_BYTE (pos_byte)]; | |
1851 | /* now run the same tests to distinguish going off the */ | |
1852 | /* end, a match or a phony match. */ | |
1853 | if ((pos_byte - limit) * direction <= len_byte) | |
1854 | break; /* ran off the end */ | |
1855 | /* Found what might be a match. | |
1856 | Set POS_BYTE back to last (first if reverse) pos. */ | |
1857 | pos_byte -= infinity; | |
1858 | i = dirlen - direction; | |
1859 | while ((i -= direction) + direction != 0) | |
ca1d1d23 | 1860 | { |
facdc750 RS |
1861 | int ch; |
1862 | unsigned char *ptr; | |
1863 | pos_byte -= direction; | |
1864 | ptr = BYTE_POS_ADDR (pos_byte); | |
1865 | /* Translate only the last byte of a character. */ | |
1866 | if (! multibyte | |
1867 | || ((ptr == tail_end_ptr | |
1868 | || CHAR_HEAD_P (ptr[1])) | |
1869 | && (CHAR_HEAD_P (ptr[0]) | |
1870 | || (translate_prev_byte == ptr[-1] | |
1871 | && (CHAR_HEAD_P (translate_prev_byte) | |
1872 | || translate_anteprev_byte == ptr[-2]))))) | |
1873 | ch = simple_translate[*ptr]; | |
1874 | else | |
1875 | ch = *ptr; | |
1876 | if (pat[i] != ch) | |
1877 | break; | |
1878 | } | |
1879 | /* Above loop has moved POS_BYTE part or all the way | |
1880 | back to the first pos (last pos if reverse). | |
1881 | Set it once again at the last (first if reverse) char. */ | |
1882 | pos_byte += dirlen - i- direction; | |
1883 | if (i + direction == 0) | |
1884 | { | |
1885 | int position; | |
1886 | pos_byte -= direction; | |
1113d9db | 1887 | |
facdc750 | 1888 | position = pos_byte + ((direction > 0) ? 1 - len_byte : 0); |
0c8533c6 | 1889 | |
facdc750 | 1890 | set_search_regs (position, len_byte); |
ca325161 | 1891 | |
facdc750 RS |
1892 | if ((n -= direction) != 0) |
1893 | pos_byte += dirlen; /* to resume search */ | |
ca1d1d23 | 1894 | else |
facdc750 RS |
1895 | return ((direction > 0) |
1896 | ? search_regs.end[0] : search_regs.start[0]); | |
ca1d1d23 | 1897 | } |
facdc750 RS |
1898 | else |
1899 | pos_byte += stride_for_teases; | |
1900 | } | |
1901 | } | |
1902 | /* We have done one clump. Can we continue? */ | |
1903 | if ((lim_byte - pos_byte) * direction < 0) | |
1904 | return ((0 - n) * direction); | |
ca1d1d23 | 1905 | } |
facdc750 | 1906 | return BYTE_TO_CHAR (pos_byte); |
ca1d1d23 | 1907 | } |
ca325161 | 1908 | |
fa8ed3e0 | 1909 | /* Record beginning BEG_BYTE and end BEG_BYTE + NBYTES |
a7e4cdde RS |
1910 | for the overall match just found in the current buffer. |
1911 | Also clear out the match data for registers 1 and up. */ | |
ca325161 RS |
1912 | |
1913 | static void | |
fa8ed3e0 RS |
1914 | set_search_regs (beg_byte, nbytes) |
1915 | int beg_byte, nbytes; | |
ca325161 | 1916 | { |
a7e4cdde RS |
1917 | int i; |
1918 | ||
ca325161 RS |
1919 | /* Make sure we have registers in which to store |
1920 | the match position. */ | |
1921 | if (search_regs.num_regs == 0) | |
1922 | { | |
2d4a771a RS |
1923 | search_regs.start = (regoff_t *) xmalloc (2 * sizeof (regoff_t)); |
1924 | search_regs.end = (regoff_t *) xmalloc (2 * sizeof (regoff_t)); | |
487282dc | 1925 | search_regs.num_regs = 2; |
ca325161 RS |
1926 | } |
1927 | ||
a7e4cdde RS |
1928 | /* Clear out the other registers. */ |
1929 | for (i = 1; i < search_regs.num_regs; i++) | |
1930 | { | |
1931 | search_regs.start[i] = -1; | |
1932 | search_regs.end[i] = -1; | |
1933 | } | |
1934 | ||
fa8ed3e0 RS |
1935 | search_regs.start[0] = BYTE_TO_CHAR (beg_byte); |
1936 | search_regs.end[0] = BYTE_TO_CHAR (beg_byte + nbytes); | |
a3668d92 | 1937 | XSETBUFFER (last_thing_searched, current_buffer); |
ca325161 | 1938 | } |
ca1d1d23 JB |
1939 | \f |
1940 | /* Given a string of words separated by word delimiters, | |
1941 | compute a regexp that matches those exact words | |
1942 | separated by arbitrary punctuation. */ | |
1943 | ||
1944 | static Lisp_Object | |
1945 | wordify (string) | |
1946 | Lisp_Object string; | |
1947 | { | |
1948 | register unsigned char *p, *o; | |
0c8533c6 | 1949 | register int i, i_byte, len, punct_count = 0, word_count = 0; |
ca1d1d23 | 1950 | Lisp_Object val; |
0c8533c6 RS |
1951 | int prev_c = 0; |
1952 | int adjust; | |
ca1d1d23 JB |
1953 | |
1954 | CHECK_STRING (string, 0); | |
1955 | p = XSTRING (string)->data; | |
1956 | len = XSTRING (string)->size; | |
1957 | ||
0c8533c6 RS |
1958 | for (i = 0, i_byte = 0; i < len; ) |
1959 | { | |
1960 | int c; | |
1961 | ||
1962 | if (STRING_MULTIBYTE (string)) | |
1963 | FETCH_STRING_CHAR_ADVANCE (c, string, i, i_byte); | |
1964 | else | |
1965 | c = XSTRING (string)->data[i++]; | |
1966 | ||
1967 | if (SYNTAX (c) != Sword) | |
1968 | { | |
1969 | punct_count++; | |
1970 | if (i > 0 && SYNTAX (prev_c) == Sword) | |
1971 | word_count++; | |
1972 | } | |
ca1d1d23 | 1973 | |
0c8533c6 RS |
1974 | prev_c = c; |
1975 | } | |
1976 | ||
1977 | if (SYNTAX (prev_c) == Sword) | |
1978 | word_count++; | |
1979 | if (!word_count) | |
1980 | return build_string (""); | |
1981 | ||
1982 | adjust = - punct_count + 5 * (word_count - 1) + 4; | |
8a2df937 RS |
1983 | if (STRING_MULTIBYTE (string)) |
1984 | val = make_uninit_multibyte_string (len + adjust, | |
1985 | STRING_BYTES (XSTRING (string)) | |
1986 | + adjust); | |
1987 | else | |
1988 | val = make_uninit_string (len + adjust); | |
ca1d1d23 JB |
1989 | |
1990 | o = XSTRING (val)->data; | |
1991 | *o++ = '\\'; | |
1992 | *o++ = 'b'; | |
1e9582d4 | 1993 | prev_c = 0; |
ca1d1d23 | 1994 | |
1e9582d4 RS |
1995 | for (i = 0, i_byte = 0; i < len; ) |
1996 | { | |
1997 | int c; | |
1998 | int i_byte_orig = i_byte; | |
1999 | ||
2000 | if (STRING_MULTIBYTE (string)) | |
2001 | FETCH_STRING_CHAR_ADVANCE (c, string, i, i_byte); | |
2002 | else | |
8a2df937 RS |
2003 | { |
2004 | c = XSTRING (string)->data[i++]; | |
2005 | i_byte++; | |
2006 | } | |
1e9582d4 RS |
2007 | |
2008 | if (SYNTAX (c) == Sword) | |
2009 | { | |
2010 | bcopy (&XSTRING (string)->data[i_byte_orig], o, | |
2011 | i_byte - i_byte_orig); | |
2012 | o += i_byte - i_byte_orig; | |
2013 | } | |
2014 | else if (i > 0 && SYNTAX (prev_c) == Sword && --word_count) | |
2015 | { | |
2016 | *o++ = '\\'; | |
2017 | *o++ = 'W'; | |
2018 | *o++ = '\\'; | |
2019 | *o++ = 'W'; | |
2020 | *o++ = '*'; | |
2021 | } | |
2022 | ||
2023 | prev_c = c; | |
2024 | } | |
ca1d1d23 JB |
2025 | |
2026 | *o++ = '\\'; | |
2027 | *o++ = 'b'; | |
2028 | ||
2029 | return val; | |
2030 | } | |
2031 | \f | |
2032 | DEFUN ("search-backward", Fsearch_backward, Ssearch_backward, 1, 4, | |
6af43974 | 2033 | "MSearch backward: ", |
ca1d1d23 JB |
2034 | "Search backward from point for STRING.\n\ |
2035 | Set point to the beginning of the occurrence found, and return point.\n\ | |
2036 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2037 | The match found must not extend before that position.\n\ | |
2038 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2039 | If not nil and not t, position at limit of search and return nil.\n\ | |
2040 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
2041 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
2042 | (string, bound, noerror, count) | |
2043 | Lisp_Object string, bound, noerror, count; | |
2044 | { | |
b819a390 | 2045 | return search_command (string, bound, noerror, count, -1, 0, 0); |
ca1d1d23 JB |
2046 | } |
2047 | ||
6af43974 | 2048 | DEFUN ("search-forward", Fsearch_forward, Ssearch_forward, 1, 4, "MSearch: ", |
ca1d1d23 JB |
2049 | "Search forward from point for STRING.\n\ |
2050 | Set point to the end of the occurrence found, and return point.\n\ | |
2051 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2052 | The match found must not extend after that position. nil is equivalent\n\ | |
2053 | to (point-max).\n\ | |
2054 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2055 | If not nil and not t, move to limit of search and return nil.\n\ | |
2056 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
2057 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
2058 | (string, bound, noerror, count) | |
2059 | Lisp_Object string, bound, noerror, count; | |
2060 | { | |
b819a390 | 2061 | return search_command (string, bound, noerror, count, 1, 0, 0); |
ca1d1d23 JB |
2062 | } |
2063 | ||
2064 | DEFUN ("word-search-backward", Fword_search_backward, Sword_search_backward, 1, 4, | |
2065 | "sWord search backward: ", | |
2066 | "Search backward from point for STRING, ignoring differences in punctuation.\n\ | |
2067 | Set point to the beginning of the occurrence found, and return point.\n\ | |
2068 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2069 | The match found must not extend before that position.\n\ | |
2070 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2071 | If not nil and not t, move to limit of search and return nil.\n\ | |
2072 | Optional fourth argument is repeat count--search for successive occurrences.") | |
2073 | (string, bound, noerror, count) | |
2074 | Lisp_Object string, bound, noerror, count; | |
2075 | { | |
b819a390 | 2076 | return search_command (wordify (string), bound, noerror, count, -1, 1, 0); |
ca1d1d23 JB |
2077 | } |
2078 | ||
2079 | DEFUN ("word-search-forward", Fword_search_forward, Sword_search_forward, 1, 4, | |
2080 | "sWord search: ", | |
2081 | "Search forward from point for STRING, ignoring differences in punctuation.\n\ | |
2082 | Set point to the end of the occurrence found, and return point.\n\ | |
2083 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2084 | The match found must not extend after that position.\n\ | |
2085 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2086 | If not nil and not t, move to limit of search and return nil.\n\ | |
2087 | Optional fourth argument is repeat count--search for successive occurrences.") | |
2088 | (string, bound, noerror, count) | |
2089 | Lisp_Object string, bound, noerror, count; | |
2090 | { | |
b819a390 | 2091 | return search_command (wordify (string), bound, noerror, count, 1, 1, 0); |
ca1d1d23 JB |
2092 | } |
2093 | ||
2094 | DEFUN ("re-search-backward", Fre_search_backward, Sre_search_backward, 1, 4, | |
2095 | "sRE search backward: ", | |
2096 | "Search backward from point for match for regular expression REGEXP.\n\ | |
2097 | Set point to the beginning of the match, and return point.\n\ | |
2098 | The match found is the one starting last in the buffer\n\ | |
19c0a730 | 2099 | and yet ending before the origin of the search.\n\ |
ca1d1d23 JB |
2100 | An optional second argument bounds the search; it is a buffer position.\n\ |
2101 | The match found must start at or after that position.\n\ | |
2102 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2103 | If not nil and not t, move to limit of search and return nil.\n\ | |
2104 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
2105 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
19c0a730 KH |
2106 | (regexp, bound, noerror, count) |
2107 | Lisp_Object regexp, bound, noerror, count; | |
ca1d1d23 | 2108 | { |
b819a390 | 2109 | return search_command (regexp, bound, noerror, count, -1, 1, 0); |
ca1d1d23 JB |
2110 | } |
2111 | ||
2112 | DEFUN ("re-search-forward", Fre_search_forward, Sre_search_forward, 1, 4, | |
2113 | "sRE search: ", | |
2114 | "Search forward from point for regular expression REGEXP.\n\ | |
2115 | Set point to the end of the occurrence found, and return point.\n\ | |
2116 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2117 | The match found must not extend after that position.\n\ | |
2118 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2119 | If not nil and not t, move to limit of search and return nil.\n\ | |
2120 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
2121 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
19c0a730 KH |
2122 | (regexp, bound, noerror, count) |
2123 | Lisp_Object regexp, bound, noerror, count; | |
ca1d1d23 | 2124 | { |
b819a390 RS |
2125 | return search_command (regexp, bound, noerror, count, 1, 1, 0); |
2126 | } | |
2127 | ||
2128 | DEFUN ("posix-search-backward", Fposix_search_backward, Sposix_search_backward, 1, 4, | |
2129 | "sPosix search backward: ", | |
2130 | "Search backward from point for match for regular expression REGEXP.\n\ | |
2131 | Find the longest match in accord with Posix regular expression rules.\n\ | |
2132 | Set point to the beginning of the match, and return point.\n\ | |
2133 | The match found is the one starting last in the buffer\n\ | |
2134 | and yet ending before the origin of the search.\n\ | |
2135 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2136 | The match found must start at or after that position.\n\ | |
2137 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2138 | If not nil and not t, move to limit of search and return nil.\n\ | |
2139 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
2140 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
2141 | (regexp, bound, noerror, count) | |
2142 | Lisp_Object regexp, bound, noerror, count; | |
2143 | { | |
2144 | return search_command (regexp, bound, noerror, count, -1, 1, 1); | |
2145 | } | |
2146 | ||
2147 | DEFUN ("posix-search-forward", Fposix_search_forward, Sposix_search_forward, 1, 4, | |
2148 | "sPosix search: ", | |
2149 | "Search forward from point for regular expression REGEXP.\n\ | |
2150 | Find the longest match in accord with Posix regular expression rules.\n\ | |
2151 | Set point to the end of the occurrence found, and return point.\n\ | |
2152 | An optional second argument bounds the search; it is a buffer position.\n\ | |
2153 | The match found must not extend after that position.\n\ | |
2154 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
2155 | If not nil and not t, move to limit of search and return nil.\n\ | |
2156 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
2157 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
2158 | (regexp, bound, noerror, count) | |
2159 | Lisp_Object regexp, bound, noerror, count; | |
2160 | { | |
2161 | return search_command (regexp, bound, noerror, count, 1, 1, 1); | |
ca1d1d23 JB |
2162 | } |
2163 | \f | |
d7a5ad5f | 2164 | DEFUN ("replace-match", Freplace_match, Sreplace_match, 1, 5, 0, |
ca1d1d23 JB |
2165 | "Replace text matched by last search with NEWTEXT.\n\ |
2166 | If second arg FIXEDCASE is non-nil, do not alter case of replacement text.\n\ | |
5b9cf4b2 RS |
2167 | Otherwise maybe capitalize the whole text, or maybe just word initials,\n\ |
2168 | based on the replaced text.\n\ | |
2169 | If the replaced text has only capital letters\n\ | |
2170 | and has at least one multiletter word, convert NEWTEXT to all caps.\n\ | |
2171 | If the replaced text has at least one word starting with a capital letter,\n\ | |
2172 | then capitalize each word in NEWTEXT.\n\n\ | |
ca1d1d23 JB |
2173 | If third arg LITERAL is non-nil, insert NEWTEXT literally.\n\ |
2174 | Otherwise treat `\\' as special:\n\ | |
2175 | `\\&' in NEWTEXT means substitute original matched text.\n\ | |
2176 | `\\N' means substitute what matched the Nth `\\(...\\)'.\n\ | |
2177 | If Nth parens didn't match, substitute nothing.\n\ | |
2178 | `\\\\' means insert one `\\'.\n\ | |
1113d9db | 2179 | FIXEDCASE and LITERAL are optional arguments.\n\ |
080c45fd RS |
2180 | Leaves point at end of replacement text.\n\ |
2181 | \n\ | |
2182 | The optional fourth argument STRING can be a string to modify.\n\ | |
2183 | In that case, this function creates and returns a new string\n\ | |
d7a5ad5f RS |
2184 | which is made by replacing the part of STRING that was matched.\n\ |
2185 | \n\ | |
2186 | The optional fifth argument SUBEXP specifies a subexpression of the match.\n\ | |
2187 | It says to replace just that subexpression instead of the whole match.\n\ | |
2188 | This is useful only after a regular expression search or match\n\ | |
2189 | since only regular expressions have distinguished subexpressions.") | |
2190 | (newtext, fixedcase, literal, string, subexp) | |
2191 | Lisp_Object newtext, fixedcase, literal, string, subexp; | |
ca1d1d23 JB |
2192 | { |
2193 | enum { nochange, all_caps, cap_initial } case_action; | |
ac3b28b1 | 2194 | register int pos, pos_byte; |
ca1d1d23 | 2195 | int some_multiletter_word; |
97832bd0 | 2196 | int some_lowercase; |
73dc8771 | 2197 | int some_uppercase; |
208767c3 | 2198 | int some_nonuppercase_initial; |
ca1d1d23 JB |
2199 | register int c, prevc; |
2200 | int inslen; | |
d7a5ad5f | 2201 | int sub; |
3e18eecf | 2202 | int opoint, newpoint; |
ca1d1d23 | 2203 | |
16fdc568 | 2204 | CHECK_STRING (newtext, 0); |
ca1d1d23 | 2205 | |
080c45fd RS |
2206 | if (! NILP (string)) |
2207 | CHECK_STRING (string, 4); | |
2208 | ||
ca1d1d23 JB |
2209 | case_action = nochange; /* We tried an initialization */ |
2210 | /* but some C compilers blew it */ | |
4746118a JB |
2211 | |
2212 | if (search_regs.num_regs <= 0) | |
2213 | error ("replace-match called before any match found"); | |
2214 | ||
d7a5ad5f RS |
2215 | if (NILP (subexp)) |
2216 | sub = 0; | |
2217 | else | |
2218 | { | |
2219 | CHECK_NUMBER (subexp, 3); | |
2220 | sub = XINT (subexp); | |
2221 | if (sub < 0 || sub >= search_regs.num_regs) | |
2222 | args_out_of_range (subexp, make_number (search_regs.num_regs)); | |
2223 | } | |
2224 | ||
080c45fd RS |
2225 | if (NILP (string)) |
2226 | { | |
d7a5ad5f RS |
2227 | if (search_regs.start[sub] < BEGV |
2228 | || search_regs.start[sub] > search_regs.end[sub] | |
2229 | || search_regs.end[sub] > ZV) | |
2230 | args_out_of_range (make_number (search_regs.start[sub]), | |
2231 | make_number (search_regs.end[sub])); | |
080c45fd RS |
2232 | } |
2233 | else | |
2234 | { | |
d7a5ad5f RS |
2235 | if (search_regs.start[sub] < 0 |
2236 | || search_regs.start[sub] > search_regs.end[sub] | |
2237 | || search_regs.end[sub] > XSTRING (string)->size) | |
2238 | args_out_of_range (make_number (search_regs.start[sub]), | |
2239 | make_number (search_regs.end[sub])); | |
080c45fd | 2240 | } |
ca1d1d23 JB |
2241 | |
2242 | if (NILP (fixedcase)) | |
2243 | { | |
2244 | /* Decide how to casify by examining the matched text. */ | |
ac3b28b1 | 2245 | int last; |
ca1d1d23 | 2246 | |
ac3b28b1 KH |
2247 | pos = search_regs.start[sub]; |
2248 | last = search_regs.end[sub]; | |
fa8ed3e0 RS |
2249 | |
2250 | if (NILP (string)) | |
ac3b28b1 | 2251 | pos_byte = CHAR_TO_BYTE (pos); |
fa8ed3e0 | 2252 | else |
ac3b28b1 | 2253 | pos_byte = string_char_to_byte (string, pos); |
fa8ed3e0 | 2254 | |
ca1d1d23 JB |
2255 | prevc = '\n'; |
2256 | case_action = all_caps; | |
2257 | ||
2258 | /* some_multiletter_word is set nonzero if any original word | |
2259 | is more than one letter long. */ | |
2260 | some_multiletter_word = 0; | |
97832bd0 | 2261 | some_lowercase = 0; |
208767c3 | 2262 | some_nonuppercase_initial = 0; |
73dc8771 | 2263 | some_uppercase = 0; |
ca1d1d23 | 2264 | |
ac3b28b1 | 2265 | while (pos < last) |
ca1d1d23 | 2266 | { |
080c45fd | 2267 | if (NILP (string)) |
ac3b28b1 KH |
2268 | { |
2269 | c = FETCH_CHAR (pos_byte); | |
2270 | INC_BOTH (pos, pos_byte); | |
2271 | } | |
080c45fd | 2272 | else |
ac3b28b1 | 2273 | FETCH_STRING_CHAR_ADVANCE (c, string, pos, pos_byte); |
080c45fd | 2274 | |
ca1d1d23 JB |
2275 | if (LOWERCASEP (c)) |
2276 | { | |
2277 | /* Cannot be all caps if any original char is lower case */ | |
2278 | ||
97832bd0 | 2279 | some_lowercase = 1; |
ca1d1d23 | 2280 | if (SYNTAX (prevc) != Sword) |
208767c3 | 2281 | some_nonuppercase_initial = 1; |
ca1d1d23 JB |
2282 | else |
2283 | some_multiletter_word = 1; | |
2284 | } | |
2285 | else if (!NOCASEP (c)) | |
2286 | { | |
73dc8771 | 2287 | some_uppercase = 1; |
97832bd0 | 2288 | if (SYNTAX (prevc) != Sword) |
c4d460ce | 2289 | ; |
97832bd0 | 2290 | else |
ca1d1d23 JB |
2291 | some_multiletter_word = 1; |
2292 | } | |
208767c3 RS |
2293 | else |
2294 | { | |
2295 | /* If the initial is a caseless word constituent, | |
2296 | treat that like a lowercase initial. */ | |
2297 | if (SYNTAX (prevc) != Sword) | |
2298 | some_nonuppercase_initial = 1; | |
2299 | } | |
ca1d1d23 JB |
2300 | |
2301 | prevc = c; | |
2302 | } | |
2303 | ||
97832bd0 RS |
2304 | /* Convert to all caps if the old text is all caps |
2305 | and has at least one multiletter word. */ | |
2306 | if (! some_lowercase && some_multiletter_word) | |
2307 | case_action = all_caps; | |
c4d460ce | 2308 | /* Capitalize each word, if the old text has all capitalized words. */ |
208767c3 | 2309 | else if (!some_nonuppercase_initial && some_multiletter_word) |
ca1d1d23 | 2310 | case_action = cap_initial; |
208767c3 | 2311 | else if (!some_nonuppercase_initial && some_uppercase) |
73dc8771 KH |
2312 | /* Should x -> yz, operating on X, give Yz or YZ? |
2313 | We'll assume the latter. */ | |
2314 | case_action = all_caps; | |
97832bd0 RS |
2315 | else |
2316 | case_action = nochange; | |
ca1d1d23 JB |
2317 | } |
2318 | ||
080c45fd RS |
2319 | /* Do replacement in a string. */ |
2320 | if (!NILP (string)) | |
2321 | { | |
2322 | Lisp_Object before, after; | |
2323 | ||
2324 | before = Fsubstring (string, make_number (0), | |
d7a5ad5f RS |
2325 | make_number (search_regs.start[sub])); |
2326 | after = Fsubstring (string, make_number (search_regs.end[sub]), Qnil); | |
080c45fd | 2327 | |
636a5e28 RS |
2328 | /* Substitute parts of the match into NEWTEXT |
2329 | if desired. */ | |
080c45fd RS |
2330 | if (NILP (literal)) |
2331 | { | |
d131e79c RS |
2332 | int lastpos = 0; |
2333 | int lastpos_byte = 0; | |
080c45fd RS |
2334 | /* We build up the substituted string in ACCUM. */ |
2335 | Lisp_Object accum; | |
2336 | Lisp_Object middle; | |
ac3b28b1 | 2337 | int length = STRING_BYTES (XSTRING (newtext)); |
080c45fd RS |
2338 | |
2339 | accum = Qnil; | |
2340 | ||
ac3b28b1 | 2341 | for (pos_byte = 0, pos = 0; pos_byte < length;) |
080c45fd RS |
2342 | { |
2343 | int substart = -1; | |
2344 | int subend; | |
1e79ec24 | 2345 | int delbackslash = 0; |
080c45fd | 2346 | |
0c8533c6 RS |
2347 | FETCH_STRING_CHAR_ADVANCE (c, newtext, pos, pos_byte); |
2348 | ||
080c45fd RS |
2349 | if (c == '\\') |
2350 | { | |
0c8533c6 | 2351 | FETCH_STRING_CHAR_ADVANCE (c, newtext, pos, pos_byte); |
080c45fd RS |
2352 | if (c == '&') |
2353 | { | |
d7a5ad5f RS |
2354 | substart = search_regs.start[sub]; |
2355 | subend = search_regs.end[sub]; | |
080c45fd RS |
2356 | } |
2357 | else if (c >= '1' && c <= '9' && c <= search_regs.num_regs + '0') | |
2358 | { | |
ad10348f | 2359 | if (search_regs.start[c - '0'] >= 0) |
080c45fd RS |
2360 | { |
2361 | substart = search_regs.start[c - '0']; | |
2362 | subend = search_regs.end[c - '0']; | |
2363 | } | |
2364 | } | |
1e79ec24 KH |
2365 | else if (c == '\\') |
2366 | delbackslash = 1; | |
636a5e28 RS |
2367 | else |
2368 | error ("Invalid use of `\\' in replacement text"); | |
080c45fd RS |
2369 | } |
2370 | if (substart >= 0) | |
2371 | { | |
d131e79c RS |
2372 | if (pos - 2 != lastpos) |
2373 | middle = substring_both (newtext, lastpos, | |
2374 | lastpos_byte, | |
2375 | pos - 2, pos_byte - 2); | |
080c45fd RS |
2376 | else |
2377 | middle = Qnil; | |
2378 | accum = concat3 (accum, middle, | |
0c8533c6 RS |
2379 | Fsubstring (string, |
2380 | make_number (substart), | |
080c45fd RS |
2381 | make_number (subend))); |
2382 | lastpos = pos; | |
0c8533c6 | 2383 | lastpos_byte = pos_byte; |
080c45fd | 2384 | } |
1e79ec24 KH |
2385 | else if (delbackslash) |
2386 | { | |
d131e79c RS |
2387 | middle = substring_both (newtext, lastpos, |
2388 | lastpos_byte, | |
2389 | pos - 1, pos_byte - 1); | |
0c8533c6 | 2390 | |
1e79ec24 KH |
2391 | accum = concat2 (accum, middle); |
2392 | lastpos = pos; | |
0c8533c6 | 2393 | lastpos_byte = pos_byte; |
1e79ec24 | 2394 | } |
080c45fd RS |
2395 | } |
2396 | ||
d131e79c RS |
2397 | if (pos != lastpos) |
2398 | middle = substring_both (newtext, lastpos, | |
2399 | lastpos_byte, | |
0c8533c6 | 2400 | pos, pos_byte); |
080c45fd RS |
2401 | else |
2402 | middle = Qnil; | |
2403 | ||
2404 | newtext = concat2 (accum, middle); | |
2405 | } | |
2406 | ||
636a5e28 | 2407 | /* Do case substitution in NEWTEXT if desired. */ |
080c45fd RS |
2408 | if (case_action == all_caps) |
2409 | newtext = Fupcase (newtext); | |
2410 | else if (case_action == cap_initial) | |
2b2eead9 | 2411 | newtext = Fupcase_initials (newtext); |
080c45fd RS |
2412 | |
2413 | return concat3 (before, newtext, after); | |
2414 | } | |
2415 | ||
b0eba991 | 2416 | /* Record point, the move (quietly) to the start of the match. */ |
9160906f | 2417 | if (PT >= search_regs.end[sub]) |
b0eba991 | 2418 | opoint = PT - ZV; |
9160906f RS |
2419 | else if (PT > search_regs.start[sub]) |
2420 | opoint = search_regs.end[sub] - ZV; | |
b0eba991 RS |
2421 | else |
2422 | opoint = PT; | |
2423 | ||
fa8ed3e0 | 2424 | TEMP_SET_PT (search_regs.start[sub]); |
b0eba991 | 2425 | |
9a76659d JB |
2426 | /* We insert the replacement text before the old text, and then |
2427 | delete the original text. This means that markers at the | |
2428 | beginning or end of the original will float to the corresponding | |
2429 | position in the replacement. */ | |
ca1d1d23 | 2430 | if (!NILP (literal)) |
16fdc568 | 2431 | Finsert_and_inherit (1, &newtext); |
ca1d1d23 JB |
2432 | else |
2433 | { | |
ac3b28b1 | 2434 | int length = STRING_BYTES (XSTRING (newtext)); |
68e69fbd RS |
2435 | unsigned char *substed; |
2436 | int substed_alloc_size, substed_len; | |
ac3b28b1 | 2437 | |
68e69fbd RS |
2438 | substed_alloc_size = length * 2 + 100; |
2439 | substed = (unsigned char *) xmalloc (substed_alloc_size + 1); | |
2440 | substed_len = 0; | |
2441 | ||
2442 | /* Go thru NEWTEXT, producing the actual text to insert in SUBSTED. */ | |
ca1d1d23 | 2443 | |
ac3b28b1 | 2444 | for (pos_byte = 0, pos = 0; pos_byte < length;) |
ca1d1d23 | 2445 | { |
68e69fbd RS |
2446 | unsigned char str[MAX_MULTIBYTE_LENGTH]; |
2447 | unsigned char *add_stuff; | |
2448 | int add_len; | |
2449 | int idx = -1; | |
9a76659d | 2450 | |
ac3b28b1 KH |
2451 | FETCH_STRING_CHAR_ADVANCE (c, newtext, pos, pos_byte); |
2452 | ||
68e69fbd RS |
2453 | /* Either set ADD_STUFF and ADD_LEN to the text to put in SUBSTED, |
2454 | or set IDX to a match index, which means put that part | |
2455 | of the buffer text into SUBSTED. */ | |
2456 | ||
ca1d1d23 JB |
2457 | if (c == '\\') |
2458 | { | |
ac3b28b1 | 2459 | FETCH_STRING_CHAR_ADVANCE (c, newtext, pos, pos_byte); |
ca1d1d23 | 2460 | if (c == '&') |
68e69fbd | 2461 | idx = sub; |
78445046 | 2462 | else if (c >= '1' && c <= '9' && c <= search_regs.num_regs + '0') |
ca1d1d23 JB |
2463 | { |
2464 | if (search_regs.start[c - '0'] >= 1) | |
68e69fbd | 2465 | idx = c - '0'; |
ca1d1d23 | 2466 | } |
636a5e28 | 2467 | else if (c == '\\') |
68e69fbd | 2468 | add_len = 1, add_stuff = "\\"; |
636a5e28 RS |
2469 | else |
2470 | error ("Invalid use of `\\' in replacement text"); | |
ca1d1d23 JB |
2471 | } |
2472 | else | |
68e69fbd RS |
2473 | { |
2474 | add_len = CHAR_STRING (c, str); | |
2475 | add_stuff = str; | |
2476 | } | |
2477 | ||
2478 | /* If we want to copy part of a previous match, | |
2479 | set up ADD_STUFF and ADD_LEN to point to it. */ | |
2480 | if (idx >= 0) | |
2481 | { | |
2482 | int begbyte = CHAR_TO_BYTE (search_regs.start[idx]); | |
2483 | add_len = CHAR_TO_BYTE (search_regs.end[idx]) - begbyte; | |
2484 | if (search_regs.start[idx] < GPT && GPT < search_regs.end[idx]) | |
2485 | move_gap (search_regs.start[idx]); | |
2486 | add_stuff = BYTE_POS_ADDR (begbyte); | |
2487 | } | |
2488 | ||
2489 | /* Now the stuff we want to add to SUBSTED | |
2490 | is invariably ADD_LEN bytes starting at ADD_STUFF. */ | |
2491 | ||
2492 | /* Make sure SUBSTED is big enough. */ | |
2493 | if (substed_len + add_len >= substed_alloc_size) | |
2494 | { | |
2495 | substed_alloc_size = substed_len + add_len + 500; | |
2496 | substed = (unsigned char *) xrealloc (substed, | |
2497 | substed_alloc_size + 1); | |
2498 | } | |
2499 | ||
2500 | /* Now add to the end of SUBSTED. */ | |
2501 | bcopy (add_stuff, substed + substed_len, add_len); | |
2502 | substed_len += add_len; | |
ca1d1d23 | 2503 | } |
68e69fbd RS |
2504 | |
2505 | /* Now insert what we accumulated. */ | |
2506 | insert_and_inherit (substed, substed_len); | |
2507 | ||
2508 | xfree (substed); | |
ca1d1d23 JB |
2509 | } |
2510 | ||
6ec8bbd2 | 2511 | inslen = PT - (search_regs.start[sub]); |
d7a5ad5f | 2512 | del_range (search_regs.start[sub] + inslen, search_regs.end[sub] + inslen); |
ca1d1d23 JB |
2513 | |
2514 | if (case_action == all_caps) | |
6ec8bbd2 | 2515 | Fupcase_region (make_number (PT - inslen), make_number (PT)); |
ca1d1d23 | 2516 | else if (case_action == cap_initial) |
6ec8bbd2 | 2517 | Fupcase_initials_region (make_number (PT - inslen), make_number (PT)); |
b0eba991 | 2518 | |
3e18eecf RS |
2519 | newpoint = PT; |
2520 | ||
b0eba991 | 2521 | /* Put point back where it was in the text. */ |
8d808a65 | 2522 | if (opoint <= 0) |
fa8ed3e0 | 2523 | TEMP_SET_PT (opoint + ZV); |
b0eba991 | 2524 | else |
fa8ed3e0 | 2525 | TEMP_SET_PT (opoint); |
b0eba991 RS |
2526 | |
2527 | /* Now move point "officially" to the start of the inserted replacement. */ | |
3e18eecf | 2528 | move_if_not_intangible (newpoint); |
b0eba991 | 2529 | |
ca1d1d23 JB |
2530 | return Qnil; |
2531 | } | |
2532 | \f | |
2533 | static Lisp_Object | |
2534 | match_limit (num, beginningp) | |
2535 | Lisp_Object num; | |
2536 | int beginningp; | |
2537 | { | |
2538 | register int n; | |
2539 | ||
2540 | CHECK_NUMBER (num, 0); | |
2541 | n = XINT (num); | |
4746118a JB |
2542 | if (n < 0 || n >= search_regs.num_regs) |
2543 | args_out_of_range (num, make_number (search_regs.num_regs)); | |
2544 | if (search_regs.num_regs <= 0 | |
2545 | || search_regs.start[n] < 0) | |
ca1d1d23 JB |
2546 | return Qnil; |
2547 | return (make_number ((beginningp) ? search_regs.start[n] | |
2548 | : search_regs.end[n])); | |
2549 | } | |
2550 | ||
2551 | DEFUN ("match-beginning", Fmatch_beginning, Smatch_beginning, 1, 1, 0, | |
2552 | "Return position of start of text matched by last search.\n\ | |
5806161b EN |
2553 | SUBEXP, a number, specifies which parenthesized expression in the last\n\ |
2554 | regexp.\n\ | |
2555 | Value is nil if SUBEXPth pair didn't match, or there were less than\n\ | |
2556 | SUBEXP pairs.\n\ | |
ca1d1d23 | 2557 | Zero means the entire text matched by the whole regexp or whole string.") |
5806161b EN |
2558 | (subexp) |
2559 | Lisp_Object subexp; | |
ca1d1d23 | 2560 | { |
5806161b | 2561 | return match_limit (subexp, 1); |
ca1d1d23 JB |
2562 | } |
2563 | ||
2564 | DEFUN ("match-end", Fmatch_end, Smatch_end, 1, 1, 0, | |
2565 | "Return position of end of text matched by last search.\n\ | |
5806161b EN |
2566 | SUBEXP, a number, specifies which parenthesized expression in the last\n\ |
2567 | regexp.\n\ | |
2568 | Value is nil if SUBEXPth pair didn't match, or there were less than\n\ | |
2569 | SUBEXP pairs.\n\ | |
ca1d1d23 | 2570 | Zero means the entire text matched by the whole regexp or whole string.") |
5806161b EN |
2571 | (subexp) |
2572 | Lisp_Object subexp; | |
ca1d1d23 | 2573 | { |
5806161b | 2574 | return match_limit (subexp, 0); |
ca1d1d23 JB |
2575 | } |
2576 | ||
56256c2a | 2577 | DEFUN ("match-data", Fmatch_data, Smatch_data, 0, 2, 0, |
ca1d1d23 JB |
2578 | "Return a list containing all info on what the last search matched.\n\ |
2579 | Element 2N is `(match-beginning N)'; element 2N + 1 is `(match-end N)'.\n\ | |
2580 | All the elements are markers or nil (nil if the Nth pair didn't match)\n\ | |
2581 | if the last match was on a buffer; integers or nil if a string was matched.\n\ | |
56256c2a RS |
2582 | Use `store-match-data' to reinstate the data in this list.\n\ |
2583 | \n\ | |
2584 | If INTEGERS (the optional first argument) is non-nil, always use integers\n\ | |
8ca821e9 | 2585 | \(rather than markers) to represent buffer positions.\n\ |
56256c2a RS |
2586 | If REUSE is a list, reuse it as part of the value. If REUSE is long enough\n\ |
2587 | to hold all the values, and if INTEGERS is non-nil, no consing is done.") | |
2588 | (integers, reuse) | |
2589 | Lisp_Object integers, reuse; | |
ca1d1d23 | 2590 | { |
56256c2a | 2591 | Lisp_Object tail, prev; |
4746118a | 2592 | Lisp_Object *data; |
ca1d1d23 JB |
2593 | int i, len; |
2594 | ||
daa37602 | 2595 | if (NILP (last_thing_searched)) |
c36bcf1b | 2596 | return Qnil; |
daa37602 | 2597 | |
4746118a JB |
2598 | data = (Lisp_Object *) alloca ((2 * search_regs.num_regs) |
2599 | * sizeof (Lisp_Object)); | |
2600 | ||
ca1d1d23 | 2601 | len = -1; |
4746118a | 2602 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
2603 | { |
2604 | int start = search_regs.start[i]; | |
2605 | if (start >= 0) | |
2606 | { | |
56256c2a RS |
2607 | if (EQ (last_thing_searched, Qt) |
2608 | || ! NILP (integers)) | |
ca1d1d23 | 2609 | { |
c235cce7 KH |
2610 | XSETFASTINT (data[2 * i], start); |
2611 | XSETFASTINT (data[2 * i + 1], search_regs.end[i]); | |
ca1d1d23 | 2612 | } |
0ed62dc7 | 2613 | else if (BUFFERP (last_thing_searched)) |
ca1d1d23 JB |
2614 | { |
2615 | data[2 * i] = Fmake_marker (); | |
daa37602 JB |
2616 | Fset_marker (data[2 * i], |
2617 | make_number (start), | |
2618 | last_thing_searched); | |
ca1d1d23 JB |
2619 | data[2 * i + 1] = Fmake_marker (); |
2620 | Fset_marker (data[2 * i + 1], | |
daa37602 JB |
2621 | make_number (search_regs.end[i]), |
2622 | last_thing_searched); | |
ca1d1d23 | 2623 | } |
daa37602 JB |
2624 | else |
2625 | /* last_thing_searched must always be Qt, a buffer, or Qnil. */ | |
2626 | abort (); | |
2627 | ||
ca1d1d23 JB |
2628 | len = i; |
2629 | } | |
2630 | else | |
2631 | data[2 * i] = data [2 * i + 1] = Qnil; | |
2632 | } | |
56256c2a RS |
2633 | |
2634 | /* If REUSE is not usable, cons up the values and return them. */ | |
2635 | if (! CONSP (reuse)) | |
2636 | return Flist (2 * len + 2, data); | |
2637 | ||
2638 | /* If REUSE is a list, store as many value elements as will fit | |
2639 | into the elements of REUSE. */ | |
2640 | for (i = 0, tail = reuse; CONSP (tail); | |
c1d497be | 2641 | i++, tail = XCDR (tail)) |
56256c2a RS |
2642 | { |
2643 | if (i < 2 * len + 2) | |
c1d497be | 2644 | XCAR (tail) = data[i]; |
56256c2a | 2645 | else |
c1d497be | 2646 | XCAR (tail) = Qnil; |
56256c2a RS |
2647 | prev = tail; |
2648 | } | |
2649 | ||
2650 | /* If we couldn't fit all value elements into REUSE, | |
2651 | cons up the rest of them and add them to the end of REUSE. */ | |
2652 | if (i < 2 * len + 2) | |
c1d497be | 2653 | XCDR (prev) = Flist (2 * len + 2 - i, data + i); |
56256c2a RS |
2654 | |
2655 | return reuse; | |
ca1d1d23 JB |
2656 | } |
2657 | ||
2658 | ||
3f1c005b | 2659 | DEFUN ("set-match-data", Fset_match_data, Sset_match_data, 1, 1, 0, |
ca1d1d23 JB |
2660 | "Set internal data on last search match from elements of LIST.\n\ |
2661 | LIST should have been created by calling `match-data' previously.") | |
2662 | (list) | |
2663 | register Lisp_Object list; | |
2664 | { | |
2665 | register int i; | |
2666 | register Lisp_Object marker; | |
2667 | ||
7074fde6 FP |
2668 | if (running_asynch_code) |
2669 | save_search_regs (); | |
2670 | ||
ca1d1d23 | 2671 | if (!CONSP (list) && !NILP (list)) |
b37902c8 | 2672 | list = wrong_type_argument (Qconsp, list); |
ca1d1d23 | 2673 | |
daa37602 JB |
2674 | /* Unless we find a marker with a buffer in LIST, assume that this |
2675 | match data came from a string. */ | |
2676 | last_thing_searched = Qt; | |
2677 | ||
4746118a JB |
2678 | /* Allocate registers if they don't already exist. */ |
2679 | { | |
d084e942 | 2680 | int length = XFASTINT (Flength (list)) / 2; |
4746118a JB |
2681 | |
2682 | if (length > search_regs.num_regs) | |
2683 | { | |
1113d9db JB |
2684 | if (search_regs.num_regs == 0) |
2685 | { | |
2686 | search_regs.start | |
2687 | = (regoff_t *) xmalloc (length * sizeof (regoff_t)); | |
2688 | search_regs.end | |
2689 | = (regoff_t *) xmalloc (length * sizeof (regoff_t)); | |
2690 | } | |
4746118a | 2691 | else |
1113d9db JB |
2692 | { |
2693 | search_regs.start | |
2694 | = (regoff_t *) xrealloc (search_regs.start, | |
2695 | length * sizeof (regoff_t)); | |
2696 | search_regs.end | |
2697 | = (regoff_t *) xrealloc (search_regs.end, | |
2698 | length * sizeof (regoff_t)); | |
2699 | } | |
4746118a | 2700 | |
487282dc | 2701 | search_regs.num_regs = length; |
4746118a JB |
2702 | } |
2703 | } | |
2704 | ||
2705 | for (i = 0; i < search_regs.num_regs; i++) | |
ca1d1d23 JB |
2706 | { |
2707 | marker = Fcar (list); | |
2708 | if (NILP (marker)) | |
2709 | { | |
2710 | search_regs.start[i] = -1; | |
2711 | list = Fcdr (list); | |
2712 | } | |
2713 | else | |
2714 | { | |
0ed62dc7 | 2715 | if (MARKERP (marker)) |
daa37602 JB |
2716 | { |
2717 | if (XMARKER (marker)->buffer == 0) | |
c235cce7 | 2718 | XSETFASTINT (marker, 0); |
daa37602 | 2719 | else |
a3668d92 | 2720 | XSETBUFFER (last_thing_searched, XMARKER (marker)->buffer); |
daa37602 | 2721 | } |
ca1d1d23 JB |
2722 | |
2723 | CHECK_NUMBER_COERCE_MARKER (marker, 0); | |
2724 | search_regs.start[i] = XINT (marker); | |
2725 | list = Fcdr (list); | |
2726 | ||
2727 | marker = Fcar (list); | |
0ed62dc7 | 2728 | if (MARKERP (marker) && XMARKER (marker)->buffer == 0) |
c235cce7 | 2729 | XSETFASTINT (marker, 0); |
ca1d1d23 JB |
2730 | |
2731 | CHECK_NUMBER_COERCE_MARKER (marker, 0); | |
2732 | search_regs.end[i] = XINT (marker); | |
2733 | } | |
2734 | list = Fcdr (list); | |
2735 | } | |
2736 | ||
2737 | return Qnil; | |
2738 | } | |
2739 | ||
7074fde6 FP |
2740 | /* If non-zero the match data have been saved in saved_search_regs |
2741 | during the execution of a sentinel or filter. */ | |
75ebf74b | 2742 | static int search_regs_saved; |
7074fde6 FP |
2743 | static struct re_registers saved_search_regs; |
2744 | ||
2745 | /* Called from Flooking_at, Fstring_match, search_buffer, Fstore_match_data | |
2746 | if asynchronous code (filter or sentinel) is running. */ | |
2747 | static void | |
2748 | save_search_regs () | |
2749 | { | |
2750 | if (!search_regs_saved) | |
2751 | { | |
2752 | saved_search_regs.num_regs = search_regs.num_regs; | |
2753 | saved_search_regs.start = search_regs.start; | |
2754 | saved_search_regs.end = search_regs.end; | |
2755 | search_regs.num_regs = 0; | |
2d4a771a RS |
2756 | search_regs.start = 0; |
2757 | search_regs.end = 0; | |
7074fde6 FP |
2758 | |
2759 | search_regs_saved = 1; | |
2760 | } | |
2761 | } | |
2762 | ||
2763 | /* Called upon exit from filters and sentinels. */ | |
2764 | void | |
2765 | restore_match_data () | |
2766 | { | |
2767 | if (search_regs_saved) | |
2768 | { | |
2769 | if (search_regs.num_regs > 0) | |
2770 | { | |
2771 | xfree (search_regs.start); | |
2772 | xfree (search_regs.end); | |
2773 | } | |
2774 | search_regs.num_regs = saved_search_regs.num_regs; | |
2775 | search_regs.start = saved_search_regs.start; | |
2776 | search_regs.end = saved_search_regs.end; | |
2777 | ||
2778 | search_regs_saved = 0; | |
2779 | } | |
2780 | } | |
2781 | ||
ca1d1d23 JB |
2782 | /* Quote a string to inactivate reg-expr chars */ |
2783 | ||
2784 | DEFUN ("regexp-quote", Fregexp_quote, Sregexp_quote, 1, 1, 0, | |
2785 | "Return a regexp string which matches exactly STRING and nothing else.") | |
5806161b EN |
2786 | (string) |
2787 | Lisp_Object string; | |
ca1d1d23 JB |
2788 | { |
2789 | register unsigned char *in, *out, *end; | |
2790 | register unsigned char *temp; | |
0c8533c6 | 2791 | int backslashes_added = 0; |
ca1d1d23 | 2792 | |
5806161b | 2793 | CHECK_STRING (string, 0); |
ca1d1d23 | 2794 | |
fc932ac6 | 2795 | temp = (unsigned char *) alloca (STRING_BYTES (XSTRING (string)) * 2); |
ca1d1d23 JB |
2796 | |
2797 | /* Now copy the data into the new string, inserting escapes. */ | |
2798 | ||
5806161b | 2799 | in = XSTRING (string)->data; |
fc932ac6 | 2800 | end = in + STRING_BYTES (XSTRING (string)); |
ca1d1d23 JB |
2801 | out = temp; |
2802 | ||
2803 | for (; in != end; in++) | |
2804 | { | |
2805 | if (*in == '[' || *in == ']' | |
2806 | || *in == '*' || *in == '.' || *in == '\\' | |
2807 | || *in == '?' || *in == '+' | |
2808 | || *in == '^' || *in == '$') | |
0c8533c6 | 2809 | *out++ = '\\', backslashes_added++; |
ca1d1d23 JB |
2810 | *out++ = *in; |
2811 | } | |
2812 | ||
3f8100f1 | 2813 | return make_specified_string (temp, |
0c8533c6 | 2814 | XSTRING (string)->size + backslashes_added, |
3f8100f1 RS |
2815 | out - temp, |
2816 | STRING_MULTIBYTE (string)); | |
ca1d1d23 JB |
2817 | } |
2818 | \f | |
dfcf069d | 2819 | void |
ca1d1d23 JB |
2820 | syms_of_search () |
2821 | { | |
2822 | register int i; | |
2823 | ||
487282dc KH |
2824 | for (i = 0; i < REGEXP_CACHE_SIZE; ++i) |
2825 | { | |
2826 | searchbufs[i].buf.allocated = 100; | |
2827 | searchbufs[i].buf.buffer = (unsigned char *) malloc (100); | |
2828 | searchbufs[i].buf.fastmap = searchbufs[i].fastmap; | |
2829 | searchbufs[i].regexp = Qnil; | |
2830 | staticpro (&searchbufs[i].regexp); | |
2831 | searchbufs[i].next = (i == REGEXP_CACHE_SIZE-1 ? 0 : &searchbufs[i+1]); | |
2832 | } | |
2833 | searchbuf_head = &searchbufs[0]; | |
ca1d1d23 JB |
2834 | |
2835 | Qsearch_failed = intern ("search-failed"); | |
2836 | staticpro (&Qsearch_failed); | |
2837 | Qinvalid_regexp = intern ("invalid-regexp"); | |
2838 | staticpro (&Qinvalid_regexp); | |
2839 | ||
2840 | Fput (Qsearch_failed, Qerror_conditions, | |
2841 | Fcons (Qsearch_failed, Fcons (Qerror, Qnil))); | |
2842 | Fput (Qsearch_failed, Qerror_message, | |
2843 | build_string ("Search failed")); | |
2844 | ||
2845 | Fput (Qinvalid_regexp, Qerror_conditions, | |
2846 | Fcons (Qinvalid_regexp, Fcons (Qerror, Qnil))); | |
2847 | Fput (Qinvalid_regexp, Qerror_message, | |
2848 | build_string ("Invalid regexp")); | |
2849 | ||
daa37602 JB |
2850 | last_thing_searched = Qnil; |
2851 | staticpro (&last_thing_searched); | |
2852 | ||
ca1d1d23 | 2853 | defsubr (&Slooking_at); |
b819a390 RS |
2854 | defsubr (&Sposix_looking_at); |
2855 | defsubr (&Sstring_match); | |
2856 | defsubr (&Sposix_string_match); | |
ca1d1d23 JB |
2857 | defsubr (&Ssearch_forward); |
2858 | defsubr (&Ssearch_backward); | |
2859 | defsubr (&Sword_search_forward); | |
2860 | defsubr (&Sword_search_backward); | |
2861 | defsubr (&Sre_search_forward); | |
2862 | defsubr (&Sre_search_backward); | |
b819a390 RS |
2863 | defsubr (&Sposix_search_forward); |
2864 | defsubr (&Sposix_search_backward); | |
ca1d1d23 JB |
2865 | defsubr (&Sreplace_match); |
2866 | defsubr (&Smatch_beginning); | |
2867 | defsubr (&Smatch_end); | |
2868 | defsubr (&Smatch_data); | |
3f1c005b | 2869 | defsubr (&Sset_match_data); |
ca1d1d23 JB |
2870 | defsubr (&Sregexp_quote); |
2871 | } |