Commit | Line | Data |
---|---|---|
ca1d1d23 | 1 | /* String search routines for GNU Emacs. |
3a22ee35 | 2 | Copyright (C) 1985, 1986, 1987, 1993, 1994 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 | |
8 | the Free Software Foundation; either version 1, or (at your option) | |
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 | |
18 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
19 | ||
20 | ||
18160b98 | 21 | #include <config.h> |
ca1d1d23 JB |
22 | #include "lisp.h" |
23 | #include "syntax.h" | |
24 | #include "buffer.h" | |
9169c321 | 25 | #include "region-cache.h" |
ca1d1d23 | 26 | #include "commands.h" |
9ac0d9e0 | 27 | #include "blockinput.h" |
4746118a | 28 | |
ca1d1d23 JB |
29 | #include <sys/types.h> |
30 | #include "regex.h" | |
31 | ||
487282dc | 32 | #define REGEXP_CACHE_SIZE 5 |
ca1d1d23 | 33 | |
487282dc KH |
34 | /* If the regexp is non-nil, then the buffer contains the compiled form |
35 | of that regexp, suitable for searching. */ | |
36 | struct regexp_cache { | |
37 | struct regexp_cache *next; | |
38 | Lisp_Object regexp; | |
39 | struct re_pattern_buffer buf; | |
40 | char fastmap[0400]; | |
b819a390 RS |
41 | /* Nonzero means regexp was compiled to do full POSIX backtracking. */ |
42 | char posix; | |
487282dc | 43 | }; |
ca1d1d23 | 44 | |
487282dc KH |
45 | /* The instances of that struct. */ |
46 | struct regexp_cache searchbufs[REGEXP_CACHE_SIZE]; | |
ca1d1d23 | 47 | |
487282dc KH |
48 | /* The head of the linked list; points to the most recently used buffer. */ |
49 | struct regexp_cache *searchbuf_head; | |
ca1d1d23 | 50 | |
ca1d1d23 | 51 | |
4746118a JB |
52 | /* Every call to re_match, etc., must pass &search_regs as the regs |
53 | argument unless you can show it is unnecessary (i.e., if re_match | |
54 | is certainly going to be called again before region-around-match | |
55 | can be called). | |
56 | ||
57 | Since the registers are now dynamically allocated, we need to make | |
58 | sure not to refer to the Nth register before checking that it has | |
1113d9db JB |
59 | been allocated by checking search_regs.num_regs. |
60 | ||
61 | The regex code keeps track of whether it has allocated the search | |
487282dc KH |
62 | buffer using bits in the re_pattern_buffer. This means that whenever |
63 | you compile a new pattern, it completely forgets whether it has | |
1113d9db JB |
64 | allocated any registers, and will allocate new registers the next |
65 | time you call a searching or matching function. Therefore, we need | |
66 | to call re_set_registers after compiling a new pattern or after | |
67 | setting the match registers, so that the regex functions will be | |
68 | able to free or re-allocate it properly. */ | |
ca1d1d23 JB |
69 | static struct re_registers search_regs; |
70 | ||
daa37602 JB |
71 | /* The buffer in which the last search was performed, or |
72 | Qt if the last search was done in a string; | |
73 | Qnil if no searching has been done yet. */ | |
74 | static Lisp_Object last_thing_searched; | |
ca1d1d23 JB |
75 | |
76 | /* error condition signalled when regexp compile_pattern fails */ | |
77 | ||
78 | Lisp_Object Qinvalid_regexp; | |
79 | ||
ca325161 | 80 | static void set_search_regs (); |
044f81f1 | 81 | static void save_search_regs (); |
ca325161 | 82 | |
b819a390 RS |
83 | static int search_buffer (); |
84 | ||
ca1d1d23 JB |
85 | static void |
86 | matcher_overflow () | |
87 | { | |
88 | error ("Stack overflow in regexp matcher"); | |
89 | } | |
90 | ||
91 | #ifdef __STDC__ | |
92 | #define CONST const | |
93 | #else | |
94 | #define CONST | |
95 | #endif | |
96 | ||
b819a390 RS |
97 | /* Compile a regexp and signal a Lisp error if anything goes wrong. |
98 | PATTERN is the pattern to compile. | |
99 | CP is the place to put the result. | |
100 | TRANSLATE is a translation table for ignoring case, or NULL for none. | |
101 | REGP is the structure that says where to store the "register" | |
102 | values that will result from matching this pattern. | |
103 | If it is 0, we should compile the pattern not to record any | |
104 | subexpression bounds. | |
105 | POSIX is nonzero if we want full backtracking (POSIX style) | |
106 | for this pattern. 0 means backtrack only enough to get a valid match. */ | |
ca1d1d23 | 107 | |
487282dc | 108 | static void |
b819a390 | 109 | compile_pattern_1 (cp, pattern, translate, regp, posix) |
487282dc | 110 | struct regexp_cache *cp; |
ca1d1d23 | 111 | Lisp_Object pattern; |
ca1d1d23 | 112 | char *translate; |
487282dc | 113 | struct re_registers *regp; |
b819a390 | 114 | int posix; |
ca1d1d23 JB |
115 | { |
116 | CONST char *val; | |
b819a390 | 117 | reg_syntax_t old; |
ca1d1d23 | 118 | |
487282dc KH |
119 | cp->regexp = Qnil; |
120 | cp->buf.translate = translate; | |
b819a390 | 121 | cp->posix = posix; |
9ac0d9e0 | 122 | BLOCK_INPUT; |
b819a390 RS |
123 | old = re_set_syntax (RE_SYNTAX_EMACS |
124 | | (posix ? 0 : RE_NO_POSIX_BACKTRACKING)); | |
b90d9e80 | 125 | val = (CONST char *) re_compile_pattern ((char *) XSTRING (pattern)->data, |
487282dc | 126 | XSTRING (pattern)->size, &cp->buf); |
b819a390 | 127 | re_set_syntax (old); |
9ac0d9e0 | 128 | UNBLOCK_INPUT; |
ca1d1d23 | 129 | if (val) |
487282dc | 130 | Fsignal (Qinvalid_regexp, Fcons (build_string (val), Qnil)); |
1113d9db | 131 | |
487282dc | 132 | cp->regexp = Fcopy_sequence (pattern); |
487282dc KH |
133 | } |
134 | ||
135 | /* Compile a regexp if necessary, but first check to see if there's one in | |
b819a390 RS |
136 | the cache. |
137 | PATTERN is the pattern to compile. | |
138 | TRANSLATE is a translation table for ignoring case, or NULL for none. | |
139 | REGP is the structure that says where to store the "register" | |
140 | values that will result from matching this pattern. | |
141 | If it is 0, we should compile the pattern not to record any | |
142 | subexpression bounds. | |
143 | POSIX is nonzero if we want full backtracking (POSIX style) | |
144 | for this pattern. 0 means backtrack only enough to get a valid match. */ | |
487282dc KH |
145 | |
146 | struct re_pattern_buffer * | |
b819a390 | 147 | compile_pattern (pattern, regp, translate, posix) |
487282dc KH |
148 | Lisp_Object pattern; |
149 | struct re_registers *regp; | |
150 | char *translate; | |
b819a390 | 151 | int posix; |
487282dc KH |
152 | { |
153 | struct regexp_cache *cp, **cpp; | |
154 | ||
155 | for (cpp = &searchbuf_head; ; cpp = &cp->next) | |
156 | { | |
157 | cp = *cpp; | |
158 | if (!NILP (Fstring_equal (cp->regexp, pattern)) | |
b819a390 RS |
159 | && cp->buf.translate == translate |
160 | && cp->posix == posix) | |
487282dc KH |
161 | break; |
162 | ||
163 | /* If we're at the end of the cache, compile into the last cell. */ | |
164 | if (cp->next == 0) | |
165 | { | |
b819a390 | 166 | compile_pattern_1 (cp, pattern, translate, regp, posix); |
487282dc KH |
167 | break; |
168 | } | |
169 | } | |
170 | ||
171 | /* When we get here, cp (aka *cpp) contains the compiled pattern, | |
172 | either because we found it in the cache or because we just compiled it. | |
173 | Move it to the front of the queue to mark it as most recently used. */ | |
174 | *cpp = cp->next; | |
175 | cp->next = searchbuf_head; | |
176 | searchbuf_head = cp; | |
1113d9db | 177 | |
6639708c RS |
178 | /* Advise the searching functions about the space we have allocated |
179 | for register data. */ | |
180 | if (regp) | |
181 | re_set_registers (&cp->buf, regp, regp->num_regs, regp->start, regp->end); | |
182 | ||
487282dc | 183 | return &cp->buf; |
ca1d1d23 JB |
184 | } |
185 | ||
186 | /* Error condition used for failing searches */ | |
187 | Lisp_Object Qsearch_failed; | |
188 | ||
189 | Lisp_Object | |
190 | signal_failure (arg) | |
191 | Lisp_Object arg; | |
192 | { | |
193 | Fsignal (Qsearch_failed, Fcons (arg, Qnil)); | |
194 | return Qnil; | |
195 | } | |
196 | \f | |
b819a390 RS |
197 | static Lisp_Object |
198 | looking_at_1 (string, posix) | |
ca1d1d23 | 199 | Lisp_Object string; |
b819a390 | 200 | int posix; |
ca1d1d23 JB |
201 | { |
202 | Lisp_Object val; | |
203 | unsigned char *p1, *p2; | |
204 | int s1, s2; | |
205 | register int i; | |
487282dc | 206 | struct re_pattern_buffer *bufp; |
ca1d1d23 | 207 | |
7074fde6 FP |
208 | if (running_asynch_code) |
209 | save_search_regs (); | |
210 | ||
ca1d1d23 | 211 | CHECK_STRING (string, 0); |
487282dc KH |
212 | bufp = compile_pattern (string, &search_regs, |
213 | (!NILP (current_buffer->case_fold_search) | |
b819a390 RS |
214 | ? DOWNCASE_TABLE : 0), |
215 | posix); | |
ca1d1d23 JB |
216 | |
217 | immediate_quit = 1; | |
218 | QUIT; /* Do a pending quit right away, to avoid paradoxical behavior */ | |
219 | ||
220 | /* Get pointers and sizes of the two strings | |
221 | that make up the visible portion of the buffer. */ | |
222 | ||
223 | p1 = BEGV_ADDR; | |
224 | s1 = GPT - BEGV; | |
225 | p2 = GAP_END_ADDR; | |
226 | s2 = ZV - GPT; | |
227 | if (s1 < 0) | |
228 | { | |
229 | p2 = p1; | |
230 | s2 = ZV - BEGV; | |
231 | s1 = 0; | |
232 | } | |
233 | if (s2 < 0) | |
234 | { | |
235 | s1 = ZV - BEGV; | |
236 | s2 = 0; | |
237 | } | |
238 | ||
487282dc | 239 | i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2, |
ca1d1d23 JB |
240 | point - BEGV, &search_regs, |
241 | ZV - BEGV); | |
242 | if (i == -2) | |
243 | matcher_overflow (); | |
244 | ||
245 | val = (0 <= i ? Qt : Qnil); | |
4746118a | 246 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
247 | if (search_regs.start[i] >= 0) |
248 | { | |
249 | search_regs.start[i] += BEGV; | |
250 | search_regs.end[i] += BEGV; | |
251 | } | |
a3668d92 | 252 | XSETBUFFER (last_thing_searched, current_buffer); |
ca1d1d23 JB |
253 | immediate_quit = 0; |
254 | return val; | |
255 | } | |
256 | ||
b819a390 | 257 | DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0, |
94f94972 | 258 | "Return t if text after point matches regular expression REGEXP.\n\ |
b819a390 RS |
259 | This function modifies the match data that `match-beginning',\n\ |
260 | `match-end' and `match-data' access; save and restore the match\n\ | |
261 | data if you want to preserve them.") | |
94f94972 RS |
262 | (regexp) |
263 | Lisp_Object regexp; | |
b819a390 | 264 | { |
94f94972 | 265 | return looking_at_1 (regexp, 0); |
b819a390 RS |
266 | } |
267 | ||
268 | DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0, | |
94f94972 | 269 | "Return t if text after point matches regular expression REGEXP.\n\ |
b819a390 RS |
270 | Find the longest match, in accord with Posix regular expression rules.\n\ |
271 | This function modifies the match data that `match-beginning',\n\ | |
272 | `match-end' and `match-data' access; save and restore the match\n\ | |
273 | data if you want to preserve them.") | |
94f94972 RS |
274 | (regexp) |
275 | Lisp_Object regexp; | |
b819a390 | 276 | { |
94f94972 | 277 | return looking_at_1 (regexp, 1); |
b819a390 RS |
278 | } |
279 | \f | |
280 | static Lisp_Object | |
281 | string_match_1 (regexp, string, start, posix) | |
ca1d1d23 | 282 | Lisp_Object regexp, string, start; |
b819a390 | 283 | int posix; |
ca1d1d23 JB |
284 | { |
285 | int val; | |
286 | int s; | |
487282dc | 287 | struct re_pattern_buffer *bufp; |
ca1d1d23 | 288 | |
7074fde6 FP |
289 | if (running_asynch_code) |
290 | save_search_regs (); | |
291 | ||
ca1d1d23 JB |
292 | CHECK_STRING (regexp, 0); |
293 | CHECK_STRING (string, 1); | |
294 | ||
295 | if (NILP (start)) | |
296 | s = 0; | |
297 | else | |
298 | { | |
299 | int len = XSTRING (string)->size; | |
300 | ||
301 | CHECK_NUMBER (start, 2); | |
302 | s = XINT (start); | |
303 | if (s < 0 && -s <= len) | |
26faf9f4 | 304 | s = len + s; |
ca1d1d23 JB |
305 | else if (0 > s || s > len) |
306 | args_out_of_range (string, start); | |
307 | } | |
308 | ||
487282dc KH |
309 | bufp = compile_pattern (regexp, &search_regs, |
310 | (!NILP (current_buffer->case_fold_search) | |
b819a390 RS |
311 | ? DOWNCASE_TABLE : 0), |
312 | 0); | |
ca1d1d23 | 313 | immediate_quit = 1; |
487282dc | 314 | val = re_search (bufp, (char *) XSTRING (string)->data, |
ca1d1d23 JB |
315 | XSTRING (string)->size, s, XSTRING (string)->size - s, |
316 | &search_regs); | |
317 | immediate_quit = 0; | |
daa37602 | 318 | last_thing_searched = Qt; |
ca1d1d23 JB |
319 | if (val == -2) |
320 | matcher_overflow (); | |
321 | if (val < 0) return Qnil; | |
322 | return make_number (val); | |
323 | } | |
e59a8453 | 324 | |
b819a390 RS |
325 | DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0, |
326 | "Return index of start of first match for REGEXP in STRING, or nil.\n\ | |
327 | If third arg START is non-nil, start search at that index in STRING.\n\ | |
328 | For index of first char beyond the match, do (match-end 0).\n\ | |
329 | `match-end' and `match-beginning' also give indices of substrings\n\ | |
330 | matched by parenthesis constructs in the pattern.") | |
331 | (regexp, string, start) | |
332 | Lisp_Object regexp, string, start; | |
333 | { | |
334 | return string_match_1 (regexp, string, start, 0); | |
335 | } | |
336 | ||
337 | DEFUN ("posix-string-match", Fposix_string_match, Sposix_string_match, 2, 3, 0, | |
338 | "Return index of start of first match for REGEXP in STRING, or nil.\n\ | |
339 | Find the longest match, in accord with Posix regular expression rules.\n\ | |
340 | If third arg START is non-nil, start search at that index in STRING.\n\ | |
341 | For index of first char beyond the match, do (match-end 0).\n\ | |
342 | `match-end' and `match-beginning' also give indices of substrings\n\ | |
343 | matched by parenthesis constructs in the pattern.") | |
344 | (regexp, string, start) | |
345 | Lisp_Object regexp, string, start; | |
346 | { | |
347 | return string_match_1 (regexp, string, start, 1); | |
348 | } | |
349 | ||
e59a8453 RS |
350 | /* Match REGEXP against STRING, searching all of STRING, |
351 | and return the index of the match, or negative on failure. | |
352 | This does not clobber the match data. */ | |
353 | ||
354 | int | |
355 | fast_string_match (regexp, string) | |
356 | Lisp_Object regexp, string; | |
357 | { | |
358 | int val; | |
487282dc | 359 | struct re_pattern_buffer *bufp; |
e59a8453 | 360 | |
b819a390 | 361 | bufp = compile_pattern (regexp, 0, 0, 0); |
e59a8453 | 362 | immediate_quit = 1; |
487282dc | 363 | val = re_search (bufp, (char *) XSTRING (string)->data, |
e59a8453 RS |
364 | XSTRING (string)->size, 0, XSTRING (string)->size, |
365 | 0); | |
366 | immediate_quit = 0; | |
367 | return val; | |
368 | } | |
ca1d1d23 | 369 | \f |
9169c321 JB |
370 | /* max and min. */ |
371 | ||
372 | static int | |
373 | max (a, b) | |
374 | int a, b; | |
375 | { | |
376 | return ((a > b) ? a : b); | |
377 | } | |
378 | ||
379 | static int | |
380 | min (a, b) | |
381 | int a, b; | |
382 | { | |
383 | return ((a < b) ? a : b); | |
384 | } | |
385 | ||
386 | \f | |
387 | /* The newline cache: remembering which sections of text have no newlines. */ | |
388 | ||
389 | /* If the user has requested newline caching, make sure it's on. | |
390 | Otherwise, make sure it's off. | |
391 | This is our cheezy way of associating an action with the change of | |
392 | state of a buffer-local variable. */ | |
393 | static void | |
394 | newline_cache_on_off (buf) | |
395 | struct buffer *buf; | |
396 | { | |
397 | if (NILP (buf->cache_long_line_scans)) | |
398 | { | |
399 | /* It should be off. */ | |
400 | if (buf->newline_cache) | |
401 | { | |
402 | free_region_cache (buf->newline_cache); | |
403 | buf->newline_cache = 0; | |
404 | } | |
405 | } | |
406 | else | |
407 | { | |
408 | /* It should be on. */ | |
409 | if (buf->newline_cache == 0) | |
410 | buf->newline_cache = new_region_cache (); | |
411 | } | |
412 | } | |
413 | ||
414 | \f | |
415 | /* Search for COUNT instances of the character TARGET between START and END. | |
416 | ||
417 | If COUNT is positive, search forwards; END must be >= START. | |
418 | If COUNT is negative, search backwards for the -COUNTth instance; | |
419 | END must be <= START. | |
420 | If COUNT is zero, do anything you please; run rogue, for all I care. | |
421 | ||
422 | If END is zero, use BEGV or ZV instead, as appropriate for the | |
423 | direction indicated by COUNT. | |
ffd56f97 JB |
424 | |
425 | If we find COUNT instances, set *SHORTAGE to zero, and return the | |
5bfe95c9 RS |
426 | position after the COUNTth match. Note that for reverse motion |
427 | this is not the same as the usual convention for Emacs motion commands. | |
ffd56f97 | 428 | |
9169c321 JB |
429 | If we don't find COUNT instances before reaching END, set *SHORTAGE |
430 | to the number of TARGETs left unfound, and return END. | |
ffd56f97 | 431 | |
087a5f81 RS |
432 | If ALLOW_QUIT is non-zero, set immediate_quit. That's good to do |
433 | except when inside redisplay. */ | |
434 | ||
9169c321 JB |
435 | scan_buffer (target, start, end, count, shortage, allow_quit) |
436 | register int target; | |
437 | int start, end; | |
438 | int count; | |
439 | int *shortage; | |
087a5f81 | 440 | int allow_quit; |
ca1d1d23 | 441 | { |
9169c321 JB |
442 | struct region_cache *newline_cache; |
443 | int direction; | |
ffd56f97 | 444 | |
9169c321 JB |
445 | if (count > 0) |
446 | { | |
447 | direction = 1; | |
448 | if (! end) end = ZV; | |
449 | } | |
450 | else | |
451 | { | |
452 | direction = -1; | |
453 | if (! end) end = BEGV; | |
454 | } | |
ffd56f97 | 455 | |
9169c321 JB |
456 | newline_cache_on_off (current_buffer); |
457 | newline_cache = current_buffer->newline_cache; | |
ca1d1d23 JB |
458 | |
459 | if (shortage != 0) | |
460 | *shortage = 0; | |
461 | ||
087a5f81 | 462 | immediate_quit = allow_quit; |
ca1d1d23 | 463 | |
ffd56f97 | 464 | if (count > 0) |
9169c321 | 465 | while (start != end) |
ca1d1d23 | 466 | { |
9169c321 JB |
467 | /* Our innermost scanning loop is very simple; it doesn't know |
468 | about gaps, buffer ends, or the newline cache. ceiling is | |
469 | the position of the last character before the next such | |
470 | obstacle --- the last character the dumb search loop should | |
471 | examine. */ | |
472 | register int ceiling = end - 1; | |
473 | ||
474 | /* If we're looking for a newline, consult the newline cache | |
475 | to see where we can avoid some scanning. */ | |
476 | if (target == '\n' && newline_cache) | |
477 | { | |
478 | int next_change; | |
479 | immediate_quit = 0; | |
480 | while (region_cache_forward | |
481 | (current_buffer, newline_cache, start, &next_change)) | |
482 | start = next_change; | |
cbe0db0d | 483 | immediate_quit = allow_quit; |
9169c321 JB |
484 | |
485 | /* start should never be after end. */ | |
486 | if (start >= end) | |
487 | start = end - 1; | |
488 | ||
489 | /* Now the text after start is an unknown region, and | |
490 | next_change is the position of the next known region. */ | |
491 | ceiling = min (next_change - 1, ceiling); | |
492 | } | |
493 | ||
494 | /* The dumb loop can only scan text stored in contiguous | |
495 | bytes. BUFFER_CEILING_OF returns the last character | |
496 | position that is contiguous, so the ceiling is the | |
497 | position after that. */ | |
498 | ceiling = min (BUFFER_CEILING_OF (start), ceiling); | |
499 | ||
500 | { | |
501 | /* The termination address of the dumb loop. */ | |
502 | register unsigned char *ceiling_addr = &FETCH_CHAR (ceiling) + 1; | |
503 | register unsigned char *cursor = &FETCH_CHAR (start); | |
504 | unsigned char *base = cursor; | |
505 | ||
506 | while (cursor < ceiling_addr) | |
507 | { | |
508 | unsigned char *scan_start = cursor; | |
509 | ||
510 | /* The dumb loop. */ | |
511 | while (*cursor != target && ++cursor < ceiling_addr) | |
512 | ; | |
513 | ||
514 | /* If we're looking for newlines, cache the fact that | |
515 | the region from start to cursor is free of them. */ | |
516 | if (target == '\n' && newline_cache) | |
517 | know_region_cache (current_buffer, newline_cache, | |
518 | start + scan_start - base, | |
519 | start + cursor - base); | |
520 | ||
521 | /* Did we find the target character? */ | |
522 | if (cursor < ceiling_addr) | |
523 | { | |
524 | if (--count == 0) | |
525 | { | |
526 | immediate_quit = 0; | |
527 | return (start + cursor - base + 1); | |
528 | } | |
529 | cursor++; | |
530 | } | |
531 | } | |
532 | ||
533 | start += cursor - base; | |
534 | } | |
ca1d1d23 JB |
535 | } |
536 | else | |
9169c321 JB |
537 | while (start > end) |
538 | { | |
539 | /* The last character to check before the next obstacle. */ | |
540 | register int ceiling = end; | |
541 | ||
542 | /* Consult the newline cache, if appropriate. */ | |
543 | if (target == '\n' && newline_cache) | |
544 | { | |
545 | int next_change; | |
546 | immediate_quit = 0; | |
547 | while (region_cache_backward | |
548 | (current_buffer, newline_cache, start, &next_change)) | |
549 | start = next_change; | |
cbe0db0d | 550 | immediate_quit = allow_quit; |
9169c321 JB |
551 | |
552 | /* Start should never be at or before end. */ | |
553 | if (start <= end) | |
554 | start = end + 1; | |
555 | ||
556 | /* Now the text before start is an unknown region, and | |
557 | next_change is the position of the next known region. */ | |
558 | ceiling = max (next_change, ceiling); | |
559 | } | |
560 | ||
561 | /* Stop scanning before the gap. */ | |
562 | ceiling = max (BUFFER_FLOOR_OF (start - 1), ceiling); | |
563 | ||
564 | { | |
565 | /* The termination address of the dumb loop. */ | |
566 | register unsigned char *ceiling_addr = &FETCH_CHAR (ceiling); | |
567 | register unsigned char *cursor = &FETCH_CHAR (start - 1); | |
568 | unsigned char *base = cursor; | |
569 | ||
570 | while (cursor >= ceiling_addr) | |
571 | { | |
572 | unsigned char *scan_start = cursor; | |
573 | ||
574 | while (*cursor != target && --cursor >= ceiling_addr) | |
575 | ; | |
576 | ||
577 | /* If we're looking for newlines, cache the fact that | |
578 | the region from after the cursor to start is free of them. */ | |
579 | if (target == '\n' && newline_cache) | |
580 | know_region_cache (current_buffer, newline_cache, | |
581 | start + cursor - base, | |
582 | start + scan_start - base); | |
583 | ||
584 | /* Did we find the target character? */ | |
585 | if (cursor >= ceiling_addr) | |
586 | { | |
587 | if (++count >= 0) | |
588 | { | |
589 | immediate_quit = 0; | |
590 | return (start + cursor - base); | |
591 | } | |
592 | cursor--; | |
593 | } | |
594 | } | |
595 | ||
596 | start += cursor - base; | |
597 | } | |
598 | } | |
599 | ||
ca1d1d23 JB |
600 | immediate_quit = 0; |
601 | if (shortage != 0) | |
ffd56f97 | 602 | *shortage = count * direction; |
9169c321 | 603 | return start; |
ca1d1d23 JB |
604 | } |
605 | ||
63fa018d RS |
606 | int |
607 | find_next_newline_no_quit (from, cnt) | |
608 | register int from, cnt; | |
609 | { | |
9169c321 | 610 | return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0); |
63fa018d RS |
611 | } |
612 | ||
ca1d1d23 JB |
613 | int |
614 | find_next_newline (from, cnt) | |
615 | register int from, cnt; | |
616 | { | |
9169c321 JB |
617 | return scan_buffer ('\n', from, 0, cnt, (int *) 0, 1); |
618 | } | |
619 | ||
620 | ||
621 | /* Like find_next_newline, but returns position before the newline, | |
622 | not after, and only search up to TO. This isn't just | |
623 | find_next_newline (...)-1, because you might hit TO. */ | |
624 | int | |
625 | find_before_next_newline (from, to, cnt) | |
cbe0db0d | 626 | int from, to, cnt; |
9169c321 JB |
627 | { |
628 | int shortage; | |
629 | int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1); | |
630 | ||
631 | if (shortage == 0) | |
632 | pos--; | |
633 | ||
634 | return pos; | |
ca1d1d23 JB |
635 | } |
636 | \f | |
c1dc99a1 JB |
637 | Lisp_Object skip_chars (); |
638 | ||
ca1d1d23 | 639 | DEFUN ("skip-chars-forward", Fskip_chars_forward, Sskip_chars_forward, 1, 2, 0, |
3acb9a69 RS |
640 | "Move point forward, stopping before a char not in STRING, or at pos LIM.\n\ |
641 | STRING is like the inside of a `[...]' in a regular expression\n\ | |
ca1d1d23 JB |
642 | except that `]' is never special and `\\' quotes `^', `-' or `\\'.\n\ |
643 | Thus, with arg \"a-zA-Z\", this skips letters stopping before first nonletter.\n\ | |
c1dc99a1 JB |
644 | With arg \"^a-zA-Z\", skips nonletters stopping before first letter.\n\ |
645 | Returns the distance traveled, either zero or positive.") | |
ca1d1d23 JB |
646 | (string, lim) |
647 | Lisp_Object string, lim; | |
648 | { | |
17431c60 | 649 | return skip_chars (1, 0, string, lim); |
ca1d1d23 JB |
650 | } |
651 | ||
652 | DEFUN ("skip-chars-backward", Fskip_chars_backward, Sskip_chars_backward, 1, 2, 0, | |
3acb9a69 | 653 | "Move point backward, stopping after a char not in STRING, or at pos LIM.\n\ |
c1dc99a1 JB |
654 | See `skip-chars-forward' for details.\n\ |
655 | Returns the distance traveled, either zero or negative.") | |
ca1d1d23 JB |
656 | (string, lim) |
657 | Lisp_Object string, lim; | |
658 | { | |
17431c60 RS |
659 | return skip_chars (0, 0, string, lim); |
660 | } | |
661 | ||
662 | DEFUN ("skip-syntax-forward", Fskip_syntax_forward, Sskip_syntax_forward, 1, 2, 0, | |
663 | "Move point forward across chars in specified syntax classes.\n\ | |
664 | SYNTAX is a string of syntax code characters.\n\ | |
665 | Stop before a char whose syntax is not in SYNTAX, or at position LIM.\n\ | |
666 | If SYNTAX starts with ^, skip characters whose syntax is NOT in SYNTAX.\n\ | |
667 | This function returns the distance traveled, either zero or positive.") | |
668 | (syntax, lim) | |
669 | Lisp_Object syntax, lim; | |
670 | { | |
671 | return skip_chars (1, 1, syntax, lim); | |
672 | } | |
673 | ||
674 | DEFUN ("skip-syntax-backward", Fskip_syntax_backward, Sskip_syntax_backward, 1, 2, 0, | |
675 | "Move point backward across chars in specified syntax classes.\n\ | |
676 | SYNTAX is a string of syntax code characters.\n\ | |
677 | Stop on reaching a char whose syntax is not in SYNTAX, or at position LIM.\n\ | |
678 | If SYNTAX starts with ^, skip characters whose syntax is NOT in SYNTAX.\n\ | |
679 | This function returns the distance traveled, either zero or negative.") | |
680 | (syntax, lim) | |
681 | Lisp_Object syntax, lim; | |
682 | { | |
683 | return skip_chars (0, 1, syntax, lim); | |
ca1d1d23 JB |
684 | } |
685 | ||
c1dc99a1 | 686 | Lisp_Object |
17431c60 RS |
687 | skip_chars (forwardp, syntaxp, string, lim) |
688 | int forwardp, syntaxp; | |
ca1d1d23 JB |
689 | Lisp_Object string, lim; |
690 | { | |
691 | register unsigned char *p, *pend; | |
692 | register unsigned char c; | |
693 | unsigned char fastmap[0400]; | |
694 | int negate = 0; | |
695 | register int i; | |
696 | ||
697 | CHECK_STRING (string, 0); | |
698 | ||
699 | if (NILP (lim)) | |
a3668d92 | 700 | XSETINT (lim, forwardp ? ZV : BEGV); |
ca1d1d23 JB |
701 | else |
702 | CHECK_NUMBER_COERCE_MARKER (lim, 1); | |
703 | ||
ca1d1d23 | 704 | /* In any case, don't allow scan outside bounds of buffer. */ |
c5241910 RS |
705 | /* jla turned this off, for no known reason. |
706 | bfox turned the ZV part on, and rms turned the | |
707 | BEGV part back on. */ | |
708 | if (XINT (lim) > ZV) | |
c235cce7 | 709 | XSETFASTINT (lim, ZV); |
c5241910 | 710 | if (XINT (lim) < BEGV) |
c235cce7 | 711 | XSETFASTINT (lim, BEGV); |
ca1d1d23 JB |
712 | |
713 | p = XSTRING (string)->data; | |
714 | pend = p + XSTRING (string)->size; | |
715 | bzero (fastmap, sizeof fastmap); | |
716 | ||
717 | if (p != pend && *p == '^') | |
718 | { | |
719 | negate = 1; p++; | |
720 | } | |
721 | ||
17431c60 RS |
722 | /* Find the characters specified and set their elements of fastmap. |
723 | If syntaxp, each character counts as itself. | |
724 | Otherwise, handle backslashes and ranges specially */ | |
ca1d1d23 JB |
725 | |
726 | while (p != pend) | |
727 | { | |
728 | c = *p++; | |
17431c60 RS |
729 | if (syntaxp) |
730 | fastmap[c] = 1; | |
731 | else | |
ca1d1d23 | 732 | { |
17431c60 | 733 | if (c == '\\') |
ca1d1d23 | 734 | { |
17431c60 RS |
735 | if (p == pend) break; |
736 | c = *p++; | |
737 | } | |
738 | if (p != pend && *p == '-') | |
739 | { | |
740 | p++; | |
741 | if (p == pend) break; | |
742 | while (c <= *p) | |
743 | { | |
744 | fastmap[c] = 1; | |
745 | c++; | |
746 | } | |
747 | p++; | |
ca1d1d23 | 748 | } |
17431c60 RS |
749 | else |
750 | fastmap[c] = 1; | |
ca1d1d23 | 751 | } |
ca1d1d23 JB |
752 | } |
753 | ||
9239c6c1 RS |
754 | if (syntaxp && fastmap['-'] != 0) |
755 | fastmap[' '] = 1; | |
756 | ||
ca1d1d23 JB |
757 | /* If ^ was the first character, complement the fastmap. */ |
758 | ||
759 | if (negate) | |
760 | for (i = 0; i < sizeof fastmap; i++) | |
761 | fastmap[i] ^= 1; | |
762 | ||
c1dc99a1 JB |
763 | { |
764 | int start_point = point; | |
765 | ||
766 | immediate_quit = 1; | |
17431c60 | 767 | if (syntaxp) |
c1dc99a1 | 768 | { |
17431c60 RS |
769 | |
770 | if (forwardp) | |
771 | { | |
772 | while (point < XINT (lim) | |
773 | && fastmap[(unsigned char) syntax_code_spec[(int) SYNTAX (FETCH_CHAR (point))]]) | |
774 | SET_PT (point + 1); | |
775 | } | |
776 | else | |
777 | { | |
778 | while (point > XINT (lim) | |
779 | && fastmap[(unsigned char) syntax_code_spec[(int) SYNTAX (FETCH_CHAR (point - 1))]]) | |
780 | SET_PT (point - 1); | |
781 | } | |
c1dc99a1 JB |
782 | } |
783 | else | |
784 | { | |
17431c60 RS |
785 | if (forwardp) |
786 | { | |
787 | while (point < XINT (lim) && fastmap[FETCH_CHAR (point)]) | |
788 | SET_PT (point + 1); | |
789 | } | |
790 | else | |
791 | { | |
792 | while (point > XINT (lim) && fastmap[FETCH_CHAR (point - 1)]) | |
793 | SET_PT (point - 1); | |
794 | } | |
c1dc99a1 JB |
795 | } |
796 | immediate_quit = 0; | |
797 | ||
798 | return make_number (point - start_point); | |
799 | } | |
ca1d1d23 JB |
800 | } |
801 | \f | |
802 | /* Subroutines of Lisp buffer search functions. */ | |
803 | ||
804 | static Lisp_Object | |
b819a390 | 805 | search_command (string, bound, noerror, count, direction, RE, posix) |
ca1d1d23 JB |
806 | Lisp_Object string, bound, noerror, count; |
807 | int direction; | |
808 | int RE; | |
b819a390 | 809 | int posix; |
ca1d1d23 JB |
810 | { |
811 | register int np; | |
812 | int lim; | |
813 | int n = direction; | |
814 | ||
815 | if (!NILP (count)) | |
816 | { | |
817 | CHECK_NUMBER (count, 3); | |
818 | n *= XINT (count); | |
819 | } | |
820 | ||
821 | CHECK_STRING (string, 0); | |
822 | if (NILP (bound)) | |
823 | lim = n > 0 ? ZV : BEGV; | |
824 | else | |
825 | { | |
826 | CHECK_NUMBER_COERCE_MARKER (bound, 1); | |
827 | lim = XINT (bound); | |
828 | if (n > 0 ? lim < point : lim > point) | |
829 | error ("Invalid search bound (wrong side of point)"); | |
830 | if (lim > ZV) | |
831 | lim = ZV; | |
832 | if (lim < BEGV) | |
833 | lim = BEGV; | |
834 | } | |
835 | ||
836 | np = search_buffer (string, point, lim, n, RE, | |
837 | (!NILP (current_buffer->case_fold_search) | |
838 | ? XSTRING (current_buffer->case_canon_table)->data : 0), | |
839 | (!NILP (current_buffer->case_fold_search) | |
b819a390 RS |
840 | ? XSTRING (current_buffer->case_eqv_table)->data : 0), |
841 | posix); | |
ca1d1d23 JB |
842 | if (np <= 0) |
843 | { | |
844 | if (NILP (noerror)) | |
845 | return signal_failure (string); | |
846 | if (!EQ (noerror, Qt)) | |
847 | { | |
848 | if (lim < BEGV || lim > ZV) | |
849 | abort (); | |
a5f217b8 RS |
850 | SET_PT (lim); |
851 | return Qnil; | |
852 | #if 0 /* This would be clean, but maybe programs depend on | |
853 | a value of nil here. */ | |
481399bf | 854 | np = lim; |
a5f217b8 | 855 | #endif |
ca1d1d23 | 856 | } |
481399bf RS |
857 | else |
858 | return Qnil; | |
ca1d1d23 JB |
859 | } |
860 | ||
861 | if (np < BEGV || np > ZV) | |
862 | abort (); | |
863 | ||
864 | SET_PT (np); | |
865 | ||
866 | return make_number (np); | |
867 | } | |
868 | \f | |
b6d6a51c KH |
869 | static int |
870 | trivial_regexp_p (regexp) | |
871 | Lisp_Object regexp; | |
872 | { | |
873 | int len = XSTRING (regexp)->size; | |
874 | unsigned char *s = XSTRING (regexp)->data; | |
875 | unsigned char c; | |
876 | while (--len >= 0) | |
877 | { | |
878 | switch (*s++) | |
879 | { | |
880 | case '.': case '*': case '+': case '?': case '[': case '^': case '$': | |
881 | return 0; | |
882 | case '\\': | |
883 | if (--len < 0) | |
884 | return 0; | |
885 | switch (*s++) | |
886 | { | |
887 | case '|': case '(': case ')': case '`': case '\'': case 'b': | |
888 | case 'B': case '<': case '>': case 'w': case 'W': case 's': | |
866f60fd KH |
889 | case 'S': case '=': |
890 | case '1': case '2': case '3': case '4': case '5': | |
b6d6a51c KH |
891 | case '6': case '7': case '8': case '9': |
892 | return 0; | |
893 | } | |
894 | } | |
895 | } | |
896 | return 1; | |
897 | } | |
898 | ||
ca325161 | 899 | /* Search for the n'th occurrence of STRING in the current buffer, |
ca1d1d23 | 900 | starting at position POS and stopping at position LIM, |
b819a390 | 901 | treating STRING as a literal string if RE is false or as |
ca1d1d23 JB |
902 | a regular expression if RE is true. |
903 | ||
904 | If N is positive, searching is forward and LIM must be greater than POS. | |
905 | If N is negative, searching is backward and LIM must be less than POS. | |
906 | ||
907 | Returns -x if only N-x occurrences found (x > 0), | |
908 | or else the position at the beginning of the Nth occurrence | |
b819a390 RS |
909 | (if searching backward) or the end (if searching forward). |
910 | ||
911 | POSIX is nonzero if we want full backtracking (POSIX style) | |
912 | for this pattern. 0 means backtrack only enough to get a valid match. */ | |
ca1d1d23 | 913 | |
b819a390 RS |
914 | static int |
915 | search_buffer (string, pos, lim, n, RE, trt, inverse_trt, posix) | |
ca1d1d23 JB |
916 | Lisp_Object string; |
917 | int pos; | |
918 | int lim; | |
919 | int n; | |
920 | int RE; | |
921 | register unsigned char *trt; | |
922 | register unsigned char *inverse_trt; | |
b819a390 | 923 | int posix; |
ca1d1d23 JB |
924 | { |
925 | int len = XSTRING (string)->size; | |
926 | unsigned char *base_pat = XSTRING (string)->data; | |
927 | register int *BM_tab; | |
928 | int *BM_tab_base; | |
929 | register int direction = ((n > 0) ? 1 : -1); | |
930 | register int dirlen; | |
931 | int infinity, limit, k, stride_for_teases; | |
932 | register unsigned char *pat, *cursor, *p_limit; | |
933 | register int i, j; | |
934 | unsigned char *p1, *p2; | |
935 | int s1, s2; | |
936 | ||
7074fde6 FP |
937 | if (running_asynch_code) |
938 | save_search_regs (); | |
939 | ||
ca1d1d23 | 940 | /* Null string is found at starting position. */ |
3f57a499 | 941 | if (len == 0) |
ca325161 RS |
942 | { |
943 | set_search_regs (pos, 0); | |
944 | return pos; | |
945 | } | |
3f57a499 RS |
946 | |
947 | /* Searching 0 times means don't move. */ | |
948 | if (n == 0) | |
ca1d1d23 JB |
949 | return pos; |
950 | ||
b6d6a51c | 951 | if (RE && !trivial_regexp_p (string)) |
ca1d1d23 | 952 | { |
487282dc KH |
953 | struct re_pattern_buffer *bufp; |
954 | ||
b819a390 | 955 | bufp = compile_pattern (string, &search_regs, (char *) trt, posix); |
ca1d1d23 | 956 | |
ca1d1d23 JB |
957 | immediate_quit = 1; /* Quit immediately if user types ^G, |
958 | because letting this function finish | |
959 | can take too long. */ | |
960 | QUIT; /* Do a pending quit right away, | |
961 | to avoid paradoxical behavior */ | |
962 | /* Get pointers and sizes of the two strings | |
963 | that make up the visible portion of the buffer. */ | |
964 | ||
965 | p1 = BEGV_ADDR; | |
966 | s1 = GPT - BEGV; | |
967 | p2 = GAP_END_ADDR; | |
968 | s2 = ZV - GPT; | |
969 | if (s1 < 0) | |
970 | { | |
971 | p2 = p1; | |
972 | s2 = ZV - BEGV; | |
973 | s1 = 0; | |
974 | } | |
975 | if (s2 < 0) | |
976 | { | |
977 | s1 = ZV - BEGV; | |
978 | s2 = 0; | |
979 | } | |
980 | while (n < 0) | |
981 | { | |
42db823b | 982 | int val; |
487282dc | 983 | val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2, |
42db823b RS |
984 | pos - BEGV, lim - pos, &search_regs, |
985 | /* Don't allow match past current point */ | |
986 | pos - BEGV); | |
ca1d1d23 | 987 | if (val == -2) |
b6d6a51c KH |
988 | { |
989 | matcher_overflow (); | |
990 | } | |
ca1d1d23 JB |
991 | if (val >= 0) |
992 | { | |
993 | j = BEGV; | |
4746118a | 994 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
995 | if (search_regs.start[i] >= 0) |
996 | { | |
997 | search_regs.start[i] += j; | |
998 | search_regs.end[i] += j; | |
999 | } | |
a3668d92 | 1000 | XSETBUFFER (last_thing_searched, current_buffer); |
ca1d1d23 JB |
1001 | /* Set pos to the new position. */ |
1002 | pos = search_regs.start[0]; | |
1003 | } | |
1004 | else | |
1005 | { | |
1006 | immediate_quit = 0; | |
1007 | return (n); | |
1008 | } | |
1009 | n++; | |
1010 | } | |
1011 | while (n > 0) | |
1012 | { | |
42db823b | 1013 | int val; |
487282dc | 1014 | val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2, |
42db823b RS |
1015 | pos - BEGV, lim - pos, &search_regs, |
1016 | lim - BEGV); | |
ca1d1d23 | 1017 | if (val == -2) |
b6d6a51c KH |
1018 | { |
1019 | matcher_overflow (); | |
1020 | } | |
ca1d1d23 JB |
1021 | if (val >= 0) |
1022 | { | |
1023 | j = BEGV; | |
4746118a | 1024 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
1025 | if (search_regs.start[i] >= 0) |
1026 | { | |
1027 | search_regs.start[i] += j; | |
1028 | search_regs.end[i] += j; | |
1029 | } | |
a3668d92 | 1030 | XSETBUFFER (last_thing_searched, current_buffer); |
ca1d1d23 JB |
1031 | pos = search_regs.end[0]; |
1032 | } | |
1033 | else | |
1034 | { | |
1035 | immediate_quit = 0; | |
1036 | return (0 - n); | |
1037 | } | |
1038 | n--; | |
1039 | } | |
1040 | immediate_quit = 0; | |
1041 | return (pos); | |
1042 | } | |
1043 | else /* non-RE case */ | |
1044 | { | |
1045 | #ifdef C_ALLOCA | |
1046 | int BM_tab_space[0400]; | |
1047 | BM_tab = &BM_tab_space[0]; | |
1048 | #else | |
1049 | BM_tab = (int *) alloca (0400 * sizeof (int)); | |
1050 | #endif | |
b6d6a51c KH |
1051 | { |
1052 | unsigned char *patbuf = (unsigned char *) alloca (len); | |
1053 | pat = patbuf; | |
1054 | while (--len >= 0) | |
1055 | { | |
1056 | /* If we got here and the RE flag is set, it's because we're | |
1057 | dealing with a regexp known to be trivial, so the backslash | |
1058 | just quotes the next character. */ | |
1059 | if (RE && *base_pat == '\\') | |
1060 | { | |
1061 | len--; | |
1062 | base_pat++; | |
1063 | } | |
1064 | *pat++ = (trt ? trt[*base_pat++] : *base_pat++); | |
1065 | } | |
1066 | len = pat - patbuf; | |
1067 | pat = base_pat = patbuf; | |
1068 | } | |
ca1d1d23 JB |
1069 | /* The general approach is that we are going to maintain that we know */ |
1070 | /* the first (closest to the present position, in whatever direction */ | |
1071 | /* we're searching) character that could possibly be the last */ | |
1072 | /* (furthest from present position) character of a valid match. We */ | |
1073 | /* advance the state of our knowledge by looking at that character */ | |
1074 | /* and seeing whether it indeed matches the last character of the */ | |
1075 | /* pattern. If it does, we take a closer look. If it does not, we */ | |
1076 | /* move our pointer (to putative last characters) as far as is */ | |
1077 | /* logically possible. This amount of movement, which I call a */ | |
1078 | /* stride, will be the length of the pattern if the actual character */ | |
1079 | /* appears nowhere in the pattern, otherwise it will be the distance */ | |
1080 | /* from the last occurrence of that character to the end of the */ | |
1081 | /* pattern. */ | |
1082 | /* As a coding trick, an enormous stride is coded into the table for */ | |
1083 | /* characters that match the last character. This allows use of only */ | |
1084 | /* a single test, a test for having gone past the end of the */ | |
1085 | /* permissible match region, to test for both possible matches (when */ | |
1086 | /* the stride goes past the end immediately) and failure to */ | |
1087 | /* match (where you get nudged past the end one stride at a time). */ | |
1088 | ||
1089 | /* Here we make a "mickey mouse" BM table. The stride of the search */ | |
1090 | /* is determined only by the last character of the putative match. */ | |
1091 | /* If that character does not match, we will stride the proper */ | |
1092 | /* distance to propose a match that superimposes it on the last */ | |
1093 | /* instance of a character that matches it (per trt), or misses */ | |
1094 | /* it entirely if there is none. */ | |
1095 | ||
1096 | dirlen = len * direction; | |
1097 | infinity = dirlen - (lim + pos + len + len) * direction; | |
1098 | if (direction < 0) | |
1099 | pat = (base_pat += len - 1); | |
1100 | BM_tab_base = BM_tab; | |
1101 | BM_tab += 0400; | |
1102 | j = dirlen; /* to get it in a register */ | |
1103 | /* A character that does not appear in the pattern induces a */ | |
1104 | /* stride equal to the pattern length. */ | |
1105 | while (BM_tab_base != BM_tab) | |
1106 | { | |
1107 | *--BM_tab = j; | |
1108 | *--BM_tab = j; | |
1109 | *--BM_tab = j; | |
1110 | *--BM_tab = j; | |
1111 | } | |
1112 | i = 0; | |
1113 | while (i != infinity) | |
1114 | { | |
1115 | j = pat[i]; i += direction; | |
1116 | if (i == dirlen) i = infinity; | |
8d505039 | 1117 | if (trt != 0) |
ca1d1d23 JB |
1118 | { |
1119 | k = (j = trt[j]); | |
1120 | if (i == infinity) | |
1121 | stride_for_teases = BM_tab[j]; | |
1122 | BM_tab[j] = dirlen - i; | |
1123 | /* A translation table is accompanied by its inverse -- see */ | |
1124 | /* comment following downcase_table for details */ | |
1125 | while ((j = inverse_trt[j]) != k) | |
1126 | BM_tab[j] = dirlen - i; | |
1127 | } | |
1128 | else | |
1129 | { | |
1130 | if (i == infinity) | |
1131 | stride_for_teases = BM_tab[j]; | |
1132 | BM_tab[j] = dirlen - i; | |
1133 | } | |
1134 | /* stride_for_teases tells how much to stride if we get a */ | |
1135 | /* match on the far character but are subsequently */ | |
1136 | /* disappointed, by recording what the stride would have been */ | |
1137 | /* for that character if the last character had been */ | |
1138 | /* different. */ | |
1139 | } | |
1140 | infinity = dirlen - infinity; | |
1141 | pos += dirlen - ((direction > 0) ? direction : 0); | |
1142 | /* loop invariant - pos points at where last char (first char if reverse) | |
1143 | of pattern would align in a possible match. */ | |
1144 | while (n != 0) | |
1145 | { | |
b2c71fb4 KH |
1146 | /* It's been reported that some (broken) compiler thinks that |
1147 | Boolean expressions in an arithmetic context are unsigned. | |
1148 | Using an explicit ?1:0 prevents this. */ | |
1149 | if ((lim - pos - ((direction > 0) ? 1 : 0)) * direction < 0) | |
ca1d1d23 JB |
1150 | return (n * (0 - direction)); |
1151 | /* First we do the part we can by pointers (maybe nothing) */ | |
1152 | QUIT; | |
1153 | pat = base_pat; | |
1154 | limit = pos - dirlen + direction; | |
1155 | limit = ((direction > 0) | |
1156 | ? BUFFER_CEILING_OF (limit) | |
1157 | : BUFFER_FLOOR_OF (limit)); | |
1158 | /* LIMIT is now the last (not beyond-last!) value | |
1159 | POS can take on without hitting edge of buffer or the gap. */ | |
1160 | limit = ((direction > 0) | |
1161 | ? min (lim - 1, min (limit, pos + 20000)) | |
1162 | : max (lim, max (limit, pos - 20000))); | |
1163 | if ((limit - pos) * direction > 20) | |
1164 | { | |
1165 | p_limit = &FETCH_CHAR (limit); | |
1166 | p2 = (cursor = &FETCH_CHAR (pos)); | |
1167 | /* In this loop, pos + cursor - p2 is the surrogate for pos */ | |
1168 | while (1) /* use one cursor setting as long as i can */ | |
1169 | { | |
1170 | if (direction > 0) /* worth duplicating */ | |
1171 | { | |
1172 | /* Use signed comparison if appropriate | |
1173 | to make cursor+infinity sure to be > p_limit. | |
1174 | Assuming that the buffer lies in a range of addresses | |
1175 | that are all "positive" (as ints) or all "negative", | |
1176 | either kind of comparison will work as long | |
1177 | as we don't step by infinity. So pick the kind | |
1178 | that works when we do step by infinity. */ | |
8d505039 | 1179 | if ((EMACS_INT) (p_limit + infinity) > (EMACS_INT) p_limit) |
9fa17f93 | 1180 | while ((EMACS_INT) cursor <= (EMACS_INT) p_limit) |
ca1d1d23 JB |
1181 | cursor += BM_tab[*cursor]; |
1182 | else | |
8d505039 | 1183 | while ((unsigned EMACS_INT) cursor <= (unsigned EMACS_INT) p_limit) |
ca1d1d23 JB |
1184 | cursor += BM_tab[*cursor]; |
1185 | } | |
1186 | else | |
1187 | { | |
8d505039 RS |
1188 | if ((EMACS_INT) (p_limit + infinity) < (EMACS_INT) p_limit) |
1189 | while ((EMACS_INT) cursor >= (EMACS_INT) p_limit) | |
ca1d1d23 JB |
1190 | cursor += BM_tab[*cursor]; |
1191 | else | |
8d505039 | 1192 | while ((unsigned EMACS_INT) cursor >= (unsigned EMACS_INT) p_limit) |
ca1d1d23 JB |
1193 | cursor += BM_tab[*cursor]; |
1194 | } | |
1195 | /* If you are here, cursor is beyond the end of the searched region. */ | |
1196 | /* This can happen if you match on the far character of the pattern, */ | |
1197 | /* because the "stride" of that character is infinity, a number able */ | |
1198 | /* to throw you well beyond the end of the search. It can also */ | |
1199 | /* happen if you fail to match within the permitted region and would */ | |
1200 | /* otherwise try a character beyond that region */ | |
1201 | if ((cursor - p_limit) * direction <= len) | |
1202 | break; /* a small overrun is genuine */ | |
1203 | cursor -= infinity; /* large overrun = hit */ | |
1204 | i = dirlen - direction; | |
8d505039 | 1205 | if (trt != 0) |
ca1d1d23 JB |
1206 | { |
1207 | while ((i -= direction) + direction != 0) | |
1208 | if (pat[i] != trt[*(cursor -= direction)]) | |
1209 | break; | |
1210 | } | |
1211 | else | |
1212 | { | |
1213 | while ((i -= direction) + direction != 0) | |
1214 | if (pat[i] != *(cursor -= direction)) | |
1215 | break; | |
1216 | } | |
1217 | cursor += dirlen - i - direction; /* fix cursor */ | |
1218 | if (i + direction == 0) | |
1219 | { | |
1220 | cursor -= direction; | |
1113d9db | 1221 | |
ca325161 RS |
1222 | set_search_regs (pos + cursor - p2 + ((direction > 0) |
1223 | ? 1 - len : 0), | |
1224 | len); | |
1225 | ||
ca1d1d23 JB |
1226 | if ((n -= direction) != 0) |
1227 | cursor += dirlen; /* to resume search */ | |
1228 | else | |
1229 | return ((direction > 0) | |
1230 | ? search_regs.end[0] : search_regs.start[0]); | |
1231 | } | |
1232 | else | |
1233 | cursor += stride_for_teases; /* <sigh> we lose - */ | |
1234 | } | |
1235 | pos += cursor - p2; | |
1236 | } | |
1237 | else | |
1238 | /* Now we'll pick up a clump that has to be done the hard */ | |
1239 | /* way because it covers a discontinuity */ | |
1240 | { | |
1241 | limit = ((direction > 0) | |
1242 | ? BUFFER_CEILING_OF (pos - dirlen + 1) | |
1243 | : BUFFER_FLOOR_OF (pos - dirlen - 1)); | |
1244 | limit = ((direction > 0) | |
1245 | ? min (limit + len, lim - 1) | |
1246 | : max (limit - len, lim)); | |
1247 | /* LIMIT is now the last value POS can have | |
1248 | and still be valid for a possible match. */ | |
1249 | while (1) | |
1250 | { | |
1251 | /* This loop can be coded for space rather than */ | |
1252 | /* speed because it will usually run only once. */ | |
1253 | /* (the reach is at most len + 21, and typically */ | |
1254 | /* does not exceed len) */ | |
1255 | while ((limit - pos) * direction >= 0) | |
1256 | pos += BM_tab[FETCH_CHAR(pos)]; | |
1257 | /* now run the same tests to distinguish going off the */ | |
eb8c3be9 | 1258 | /* end, a match or a phony match. */ |
ca1d1d23 JB |
1259 | if ((pos - limit) * direction <= len) |
1260 | break; /* ran off the end */ | |
1261 | /* Found what might be a match. | |
1262 | Set POS back to last (first if reverse) char pos. */ | |
1263 | pos -= infinity; | |
1264 | i = dirlen - direction; | |
1265 | while ((i -= direction) + direction != 0) | |
1266 | { | |
1267 | pos -= direction; | |
8d505039 | 1268 | if (pat[i] != (trt != 0 |
ca1d1d23 JB |
1269 | ? trt[FETCH_CHAR(pos)] |
1270 | : FETCH_CHAR (pos))) | |
1271 | break; | |
1272 | } | |
1273 | /* Above loop has moved POS part or all the way | |
1274 | back to the first char pos (last char pos if reverse). | |
1275 | Set it once again at the last (first if reverse) char. */ | |
1276 | pos += dirlen - i- direction; | |
1277 | if (i + direction == 0) | |
1278 | { | |
1279 | pos -= direction; | |
1113d9db | 1280 | |
ca325161 RS |
1281 | set_search_regs (pos + ((direction > 0) ? 1 - len : 0), |
1282 | len); | |
1283 | ||
ca1d1d23 JB |
1284 | if ((n -= direction) != 0) |
1285 | pos += dirlen; /* to resume search */ | |
1286 | else | |
1287 | return ((direction > 0) | |
1288 | ? search_regs.end[0] : search_regs.start[0]); | |
1289 | } | |
1290 | else | |
1291 | pos += stride_for_teases; | |
1292 | } | |
1293 | } | |
1294 | /* We have done one clump. Can we continue? */ | |
1295 | if ((lim - pos) * direction < 0) | |
1296 | return ((0 - n) * direction); | |
1297 | } | |
1298 | return pos; | |
1299 | } | |
1300 | } | |
ca325161 RS |
1301 | |
1302 | /* Record beginning BEG and end BEG + LEN | |
1303 | for a match just found in the current buffer. */ | |
1304 | ||
1305 | static void | |
1306 | set_search_regs (beg, len) | |
1307 | int beg, len; | |
1308 | { | |
1309 | /* Make sure we have registers in which to store | |
1310 | the match position. */ | |
1311 | if (search_regs.num_regs == 0) | |
1312 | { | |
2d4a771a RS |
1313 | search_regs.start = (regoff_t *) xmalloc (2 * sizeof (regoff_t)); |
1314 | search_regs.end = (regoff_t *) xmalloc (2 * sizeof (regoff_t)); | |
487282dc | 1315 | search_regs.num_regs = 2; |
ca325161 RS |
1316 | } |
1317 | ||
1318 | search_regs.start[0] = beg; | |
1319 | search_regs.end[0] = beg + len; | |
a3668d92 | 1320 | XSETBUFFER (last_thing_searched, current_buffer); |
ca325161 | 1321 | } |
ca1d1d23 JB |
1322 | \f |
1323 | /* Given a string of words separated by word delimiters, | |
1324 | compute a regexp that matches those exact words | |
1325 | separated by arbitrary punctuation. */ | |
1326 | ||
1327 | static Lisp_Object | |
1328 | wordify (string) | |
1329 | Lisp_Object string; | |
1330 | { | |
1331 | register unsigned char *p, *o; | |
1332 | register int i, len, punct_count = 0, word_count = 0; | |
1333 | Lisp_Object val; | |
1334 | ||
1335 | CHECK_STRING (string, 0); | |
1336 | p = XSTRING (string)->data; | |
1337 | len = XSTRING (string)->size; | |
1338 | ||
1339 | for (i = 0; i < len; i++) | |
1340 | if (SYNTAX (p[i]) != Sword) | |
1341 | { | |
1342 | punct_count++; | |
1343 | if (i > 0 && SYNTAX (p[i-1]) == Sword) word_count++; | |
1344 | } | |
1345 | if (SYNTAX (p[len-1]) == Sword) word_count++; | |
1346 | if (!word_count) return build_string (""); | |
1347 | ||
1348 | val = make_string (p, len - punct_count + 5 * (word_count - 1) + 4); | |
1349 | ||
1350 | o = XSTRING (val)->data; | |
1351 | *o++ = '\\'; | |
1352 | *o++ = 'b'; | |
1353 | ||
1354 | for (i = 0; i < len; i++) | |
1355 | if (SYNTAX (p[i]) == Sword) | |
1356 | *o++ = p[i]; | |
1357 | else if (i > 0 && SYNTAX (p[i-1]) == Sword && --word_count) | |
1358 | { | |
1359 | *o++ = '\\'; | |
1360 | *o++ = 'W'; | |
1361 | *o++ = '\\'; | |
1362 | *o++ = 'W'; | |
1363 | *o++ = '*'; | |
1364 | } | |
1365 | ||
1366 | *o++ = '\\'; | |
1367 | *o++ = 'b'; | |
1368 | ||
1369 | return val; | |
1370 | } | |
1371 | \f | |
1372 | DEFUN ("search-backward", Fsearch_backward, Ssearch_backward, 1, 4, | |
1373 | "sSearch backward: ", | |
1374 | "Search backward from point for STRING.\n\ | |
1375 | Set point to the beginning of the occurrence found, and return point.\n\ | |
1376 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1377 | The match found must not extend before that position.\n\ | |
1378 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1379 | If not nil and not t, position at limit of search and return nil.\n\ | |
1380 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
1381 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
1382 | (string, bound, noerror, count) | |
1383 | Lisp_Object string, bound, noerror, count; | |
1384 | { | |
b819a390 | 1385 | return search_command (string, bound, noerror, count, -1, 0, 0); |
ca1d1d23 JB |
1386 | } |
1387 | ||
1388 | DEFUN ("search-forward", Fsearch_forward, Ssearch_forward, 1, 4, "sSearch: ", | |
1389 | "Search forward from point for STRING.\n\ | |
1390 | Set point to the end of the occurrence found, and return point.\n\ | |
1391 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1392 | The match found must not extend after that position. nil is equivalent\n\ | |
1393 | to (point-max).\n\ | |
1394 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1395 | If not nil and not t, move to limit of search and return nil.\n\ | |
1396 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
1397 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
1398 | (string, bound, noerror, count) | |
1399 | Lisp_Object string, bound, noerror, count; | |
1400 | { | |
b819a390 | 1401 | return search_command (string, bound, noerror, count, 1, 0, 0); |
ca1d1d23 JB |
1402 | } |
1403 | ||
1404 | DEFUN ("word-search-backward", Fword_search_backward, Sword_search_backward, 1, 4, | |
1405 | "sWord search backward: ", | |
1406 | "Search backward from point for STRING, ignoring differences in punctuation.\n\ | |
1407 | Set point to the beginning of the occurrence found, and return point.\n\ | |
1408 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1409 | The match found must not extend before that position.\n\ | |
1410 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1411 | If not nil and not t, move to limit of search and return nil.\n\ | |
1412 | Optional fourth argument is repeat count--search for successive occurrences.") | |
1413 | (string, bound, noerror, count) | |
1414 | Lisp_Object string, bound, noerror, count; | |
1415 | { | |
b819a390 | 1416 | return search_command (wordify (string), bound, noerror, count, -1, 1, 0); |
ca1d1d23 JB |
1417 | } |
1418 | ||
1419 | DEFUN ("word-search-forward", Fword_search_forward, Sword_search_forward, 1, 4, | |
1420 | "sWord search: ", | |
1421 | "Search forward from point for STRING, ignoring differences in punctuation.\n\ | |
1422 | Set point to the end of the occurrence found, and return point.\n\ | |
1423 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1424 | The match found must not extend after that position.\n\ | |
1425 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1426 | If not nil and not t, move to limit of search and return nil.\n\ | |
1427 | Optional fourth argument is repeat count--search for successive occurrences.") | |
1428 | (string, bound, noerror, count) | |
1429 | Lisp_Object string, bound, noerror, count; | |
1430 | { | |
b819a390 | 1431 | return search_command (wordify (string), bound, noerror, count, 1, 1, 0); |
ca1d1d23 JB |
1432 | } |
1433 | ||
1434 | DEFUN ("re-search-backward", Fre_search_backward, Sre_search_backward, 1, 4, | |
1435 | "sRE search backward: ", | |
1436 | "Search backward from point for match for regular expression REGEXP.\n\ | |
1437 | Set point to the beginning of the match, and return point.\n\ | |
1438 | The match found is the one starting last in the buffer\n\ | |
19c0a730 | 1439 | and yet ending before the origin of the search.\n\ |
ca1d1d23 JB |
1440 | An optional second argument bounds the search; it is a buffer position.\n\ |
1441 | The match found must start at or after that position.\n\ | |
1442 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1443 | If not nil and not t, move to limit of search and return nil.\n\ | |
1444 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
1445 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
19c0a730 KH |
1446 | (regexp, bound, noerror, count) |
1447 | Lisp_Object regexp, bound, noerror, count; | |
ca1d1d23 | 1448 | { |
b819a390 | 1449 | return search_command (regexp, bound, noerror, count, -1, 1, 0); |
ca1d1d23 JB |
1450 | } |
1451 | ||
1452 | DEFUN ("re-search-forward", Fre_search_forward, Sre_search_forward, 1, 4, | |
1453 | "sRE search: ", | |
1454 | "Search forward from point for regular expression REGEXP.\n\ | |
1455 | Set point to the end of the occurrence found, and return point.\n\ | |
1456 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1457 | The match found must not extend after that position.\n\ | |
1458 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1459 | If not nil and not t, move to limit of search and return nil.\n\ | |
1460 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
1461 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
19c0a730 KH |
1462 | (regexp, bound, noerror, count) |
1463 | Lisp_Object regexp, bound, noerror, count; | |
ca1d1d23 | 1464 | { |
b819a390 RS |
1465 | return search_command (regexp, bound, noerror, count, 1, 1, 0); |
1466 | } | |
1467 | ||
1468 | DEFUN ("posix-search-backward", Fposix_search_backward, Sposix_search_backward, 1, 4, | |
1469 | "sPosix search backward: ", | |
1470 | "Search backward from point for match for regular expression REGEXP.\n\ | |
1471 | Find the longest match in accord with Posix regular expression rules.\n\ | |
1472 | Set point to the beginning of the match, and return point.\n\ | |
1473 | The match found is the one starting last in the buffer\n\ | |
1474 | and yet ending before the origin of the search.\n\ | |
1475 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1476 | The match found must start at or after that position.\n\ | |
1477 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1478 | If not nil and not t, move to limit of search and return nil.\n\ | |
1479 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
1480 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
1481 | (regexp, bound, noerror, count) | |
1482 | Lisp_Object regexp, bound, noerror, count; | |
1483 | { | |
1484 | return search_command (regexp, bound, noerror, count, -1, 1, 1); | |
1485 | } | |
1486 | ||
1487 | DEFUN ("posix-search-forward", Fposix_search_forward, Sposix_search_forward, 1, 4, | |
1488 | "sPosix search: ", | |
1489 | "Search forward from point for regular expression REGEXP.\n\ | |
1490 | Find the longest match in accord with Posix regular expression rules.\n\ | |
1491 | Set point to the end of the occurrence found, and return point.\n\ | |
1492 | An optional second argument bounds the search; it is a buffer position.\n\ | |
1493 | The match found must not extend after that position.\n\ | |
1494 | Optional third argument, if t, means if fail just return nil (no error).\n\ | |
1495 | If not nil and not t, move to limit of search and return nil.\n\ | |
1496 | Optional fourth argument is repeat count--search for successive occurrences.\n\ | |
1497 | See also the functions `match-beginning', `match-end' and `replace-match'.") | |
1498 | (regexp, bound, noerror, count) | |
1499 | Lisp_Object regexp, bound, noerror, count; | |
1500 | { | |
1501 | return search_command (regexp, bound, noerror, count, 1, 1, 1); | |
ca1d1d23 JB |
1502 | } |
1503 | \f | |
080c45fd | 1504 | DEFUN ("replace-match", Freplace_match, Sreplace_match, 1, 4, 0, |
ca1d1d23 JB |
1505 | "Replace text matched by last search with NEWTEXT.\n\ |
1506 | If second arg FIXEDCASE is non-nil, do not alter case of replacement text.\n\ | |
5b9cf4b2 RS |
1507 | Otherwise maybe capitalize the whole text, or maybe just word initials,\n\ |
1508 | based on the replaced text.\n\ | |
1509 | If the replaced text has only capital letters\n\ | |
1510 | and has at least one multiletter word, convert NEWTEXT to all caps.\n\ | |
1511 | If the replaced text has at least one word starting with a capital letter,\n\ | |
1512 | then capitalize each word in NEWTEXT.\n\n\ | |
ca1d1d23 JB |
1513 | If third arg LITERAL is non-nil, insert NEWTEXT literally.\n\ |
1514 | Otherwise treat `\\' as special:\n\ | |
1515 | `\\&' in NEWTEXT means substitute original matched text.\n\ | |
1516 | `\\N' means substitute what matched the Nth `\\(...\\)'.\n\ | |
1517 | If Nth parens didn't match, substitute nothing.\n\ | |
1518 | `\\\\' means insert one `\\'.\n\ | |
1113d9db | 1519 | FIXEDCASE and LITERAL are optional arguments.\n\ |
080c45fd RS |
1520 | Leaves point at end of replacement text.\n\ |
1521 | \n\ | |
1522 | The optional fourth argument STRING can be a string to modify.\n\ | |
1523 | In that case, this function creates and returns a new string\n\ | |
1524 | which is made by replacing the part of STRING that was matched.") | |
1525 | (newtext, fixedcase, literal, string) | |
1526 | Lisp_Object newtext, fixedcase, literal, string; | |
ca1d1d23 JB |
1527 | { |
1528 | enum { nochange, all_caps, cap_initial } case_action; | |
1529 | register int pos, last; | |
1530 | int some_multiletter_word; | |
97832bd0 | 1531 | int some_lowercase; |
73dc8771 | 1532 | int some_uppercase; |
208767c3 | 1533 | int some_nonuppercase_initial; |
ca1d1d23 JB |
1534 | register int c, prevc; |
1535 | int inslen; | |
1536 | ||
16fdc568 | 1537 | CHECK_STRING (newtext, 0); |
ca1d1d23 | 1538 | |
080c45fd RS |
1539 | if (! NILP (string)) |
1540 | CHECK_STRING (string, 4); | |
1541 | ||
ca1d1d23 JB |
1542 | case_action = nochange; /* We tried an initialization */ |
1543 | /* but some C compilers blew it */ | |
4746118a JB |
1544 | |
1545 | if (search_regs.num_regs <= 0) | |
1546 | error ("replace-match called before any match found"); | |
1547 | ||
080c45fd RS |
1548 | if (NILP (string)) |
1549 | { | |
1550 | if (search_regs.start[0] < BEGV | |
1551 | || search_regs.start[0] > search_regs.end[0] | |
1552 | || search_regs.end[0] > ZV) | |
1553 | args_out_of_range (make_number (search_regs.start[0]), | |
1554 | make_number (search_regs.end[0])); | |
1555 | } | |
1556 | else | |
1557 | { | |
1558 | if (search_regs.start[0] < 0 | |
1559 | || search_regs.start[0] > search_regs.end[0] | |
1560 | || search_regs.end[0] > XSTRING (string)->size) | |
1561 | args_out_of_range (make_number (search_regs.start[0]), | |
1562 | make_number (search_regs.end[0])); | |
1563 | } | |
ca1d1d23 JB |
1564 | |
1565 | if (NILP (fixedcase)) | |
1566 | { | |
1567 | /* Decide how to casify by examining the matched text. */ | |
1568 | ||
1569 | last = search_regs.end[0]; | |
1570 | prevc = '\n'; | |
1571 | case_action = all_caps; | |
1572 | ||
1573 | /* some_multiletter_word is set nonzero if any original word | |
1574 | is more than one letter long. */ | |
1575 | some_multiletter_word = 0; | |
97832bd0 | 1576 | some_lowercase = 0; |
208767c3 | 1577 | some_nonuppercase_initial = 0; |
73dc8771 | 1578 | some_uppercase = 0; |
ca1d1d23 JB |
1579 | |
1580 | for (pos = search_regs.start[0]; pos < last; pos++) | |
1581 | { | |
080c45fd RS |
1582 | if (NILP (string)) |
1583 | c = FETCH_CHAR (pos); | |
1584 | else | |
1585 | c = XSTRING (string)->data[pos]; | |
1586 | ||
ca1d1d23 JB |
1587 | if (LOWERCASEP (c)) |
1588 | { | |
1589 | /* Cannot be all caps if any original char is lower case */ | |
1590 | ||
97832bd0 | 1591 | some_lowercase = 1; |
ca1d1d23 | 1592 | if (SYNTAX (prevc) != Sword) |
208767c3 | 1593 | some_nonuppercase_initial = 1; |
ca1d1d23 JB |
1594 | else |
1595 | some_multiletter_word = 1; | |
1596 | } | |
1597 | else if (!NOCASEP (c)) | |
1598 | { | |
73dc8771 | 1599 | some_uppercase = 1; |
97832bd0 | 1600 | if (SYNTAX (prevc) != Sword) |
c4d460ce | 1601 | ; |
97832bd0 | 1602 | else |
ca1d1d23 JB |
1603 | some_multiletter_word = 1; |
1604 | } | |
208767c3 RS |
1605 | else |
1606 | { | |
1607 | /* If the initial is a caseless word constituent, | |
1608 | treat that like a lowercase initial. */ | |
1609 | if (SYNTAX (prevc) != Sword) | |
1610 | some_nonuppercase_initial = 1; | |
1611 | } | |
ca1d1d23 JB |
1612 | |
1613 | prevc = c; | |
1614 | } | |
1615 | ||
97832bd0 RS |
1616 | /* Convert to all caps if the old text is all caps |
1617 | and has at least one multiletter word. */ | |
1618 | if (! some_lowercase && some_multiletter_word) | |
1619 | case_action = all_caps; | |
c4d460ce | 1620 | /* Capitalize each word, if the old text has all capitalized words. */ |
208767c3 | 1621 | else if (!some_nonuppercase_initial && some_multiletter_word) |
ca1d1d23 | 1622 | case_action = cap_initial; |
208767c3 | 1623 | else if (!some_nonuppercase_initial && some_uppercase) |
73dc8771 KH |
1624 | /* Should x -> yz, operating on X, give Yz or YZ? |
1625 | We'll assume the latter. */ | |
1626 | case_action = all_caps; | |
97832bd0 RS |
1627 | else |
1628 | case_action = nochange; | |
ca1d1d23 JB |
1629 | } |
1630 | ||
080c45fd RS |
1631 | /* Do replacement in a string. */ |
1632 | if (!NILP (string)) | |
1633 | { | |
1634 | Lisp_Object before, after; | |
1635 | ||
1636 | before = Fsubstring (string, make_number (0), | |
1637 | make_number (search_regs.start[0])); | |
1638 | after = Fsubstring (string, make_number (search_regs.end[0]), Qnil); | |
1639 | ||
1640 | /* Do case substitution into NEWTEXT if desired. */ | |
1641 | if (NILP (literal)) | |
1642 | { | |
1643 | int lastpos = -1; | |
1644 | /* We build up the substituted string in ACCUM. */ | |
1645 | Lisp_Object accum; | |
1646 | Lisp_Object middle; | |
1647 | ||
1648 | accum = Qnil; | |
1649 | ||
1650 | for (pos = 0; pos < XSTRING (newtext)->size; pos++) | |
1651 | { | |
1652 | int substart = -1; | |
1653 | int subend; | |
1e79ec24 | 1654 | int delbackslash = 0; |
080c45fd RS |
1655 | |
1656 | c = XSTRING (newtext)->data[pos]; | |
1657 | if (c == '\\') | |
1658 | { | |
1659 | c = XSTRING (newtext)->data[++pos]; | |
1660 | if (c == '&') | |
1661 | { | |
1662 | substart = search_regs.start[0]; | |
1663 | subend = search_regs.end[0]; | |
1664 | } | |
1665 | else if (c >= '1' && c <= '9' && c <= search_regs.num_regs + '0') | |
1666 | { | |
ad10348f | 1667 | if (search_regs.start[c - '0'] >= 0) |
080c45fd RS |
1668 | { |
1669 | substart = search_regs.start[c - '0']; | |
1670 | subend = search_regs.end[c - '0']; | |
1671 | } | |
1672 | } | |
1e79ec24 KH |
1673 | else if (c == '\\') |
1674 | delbackslash = 1; | |
080c45fd RS |
1675 | } |
1676 | if (substart >= 0) | |
1677 | { | |
1678 | if (pos - 1 != lastpos + 1) | |
1e79ec24 KH |
1679 | middle = Fsubstring (newtext, |
1680 | make_number (lastpos + 1), | |
1681 | make_number (pos - 1)); | |
080c45fd RS |
1682 | else |
1683 | middle = Qnil; | |
1684 | accum = concat3 (accum, middle, | |
1685 | Fsubstring (string, make_number (substart), | |
1686 | make_number (subend))); | |
1687 | lastpos = pos; | |
1688 | } | |
1e79ec24 KH |
1689 | else if (delbackslash) |
1690 | { | |
1691 | middle = Fsubstring (newtext, make_number (lastpos + 1), | |
1692 | make_number (pos)); | |
1693 | accum = concat2 (accum, middle); | |
1694 | lastpos = pos; | |
1695 | } | |
080c45fd RS |
1696 | } |
1697 | ||
1698 | if (pos != lastpos + 1) | |
1e79ec24 KH |
1699 | middle = Fsubstring (newtext, make_number (lastpos + 1), |
1700 | make_number (pos)); | |
080c45fd RS |
1701 | else |
1702 | middle = Qnil; | |
1703 | ||
1704 | newtext = concat2 (accum, middle); | |
1705 | } | |
1706 | ||
1707 | if (case_action == all_caps) | |
1708 | newtext = Fupcase (newtext); | |
1709 | else if (case_action == cap_initial) | |
2b2eead9 | 1710 | newtext = Fupcase_initials (newtext); |
080c45fd RS |
1711 | |
1712 | return concat3 (before, newtext, after); | |
1713 | } | |
1714 | ||
9a76659d JB |
1715 | /* We insert the replacement text before the old text, and then |
1716 | delete the original text. This means that markers at the | |
1717 | beginning or end of the original will float to the corresponding | |
1718 | position in the replacement. */ | |
1719 | SET_PT (search_regs.start[0]); | |
ca1d1d23 | 1720 | if (!NILP (literal)) |
16fdc568 | 1721 | Finsert_and_inherit (1, &newtext); |
ca1d1d23 JB |
1722 | else |
1723 | { | |
1724 | struct gcpro gcpro1; | |
16fdc568 | 1725 | GCPRO1 (newtext); |
ca1d1d23 | 1726 | |
16fdc568 | 1727 | for (pos = 0; pos < XSTRING (newtext)->size; pos++) |
ca1d1d23 | 1728 | { |
9a76659d JB |
1729 | int offset = point - search_regs.start[0]; |
1730 | ||
16fdc568 | 1731 | c = XSTRING (newtext)->data[pos]; |
ca1d1d23 JB |
1732 | if (c == '\\') |
1733 | { | |
16fdc568 | 1734 | c = XSTRING (newtext)->data[++pos]; |
ca1d1d23 | 1735 | if (c == '&') |
9a76659d JB |
1736 | Finsert_buffer_substring |
1737 | (Fcurrent_buffer (), | |
1738 | make_number (search_regs.start[0] + offset), | |
1739 | make_number (search_regs.end[0] + offset)); | |
78445046 | 1740 | else if (c >= '1' && c <= '9' && c <= search_regs.num_regs + '0') |
ca1d1d23 JB |
1741 | { |
1742 | if (search_regs.start[c - '0'] >= 1) | |
9a76659d JB |
1743 | Finsert_buffer_substring |
1744 | (Fcurrent_buffer (), | |
1745 | make_number (search_regs.start[c - '0'] + offset), | |
1746 | make_number (search_regs.end[c - '0'] + offset)); | |
ca1d1d23 JB |
1747 | } |
1748 | else | |
1749 | insert_char (c); | |
1750 | } | |
1751 | else | |
1752 | insert_char (c); | |
1753 | } | |
1754 | UNGCPRO; | |
1755 | } | |
1756 | ||
9a76659d JB |
1757 | inslen = point - (search_regs.start[0]); |
1758 | del_range (search_regs.start[0] + inslen, search_regs.end[0] + inslen); | |
ca1d1d23 JB |
1759 | |
1760 | if (case_action == all_caps) | |
1761 | Fupcase_region (make_number (point - inslen), make_number (point)); | |
1762 | else if (case_action == cap_initial) | |
2b2eead9 | 1763 | Fupcase_initials_region (make_number (point - inslen), make_number (point)); |
ca1d1d23 JB |
1764 | return Qnil; |
1765 | } | |
1766 | \f | |
1767 | static Lisp_Object | |
1768 | match_limit (num, beginningp) | |
1769 | Lisp_Object num; | |
1770 | int beginningp; | |
1771 | { | |
1772 | register int n; | |
1773 | ||
1774 | CHECK_NUMBER (num, 0); | |
1775 | n = XINT (num); | |
4746118a JB |
1776 | if (n < 0 || n >= search_regs.num_regs) |
1777 | args_out_of_range (num, make_number (search_regs.num_regs)); | |
1778 | if (search_regs.num_regs <= 0 | |
1779 | || search_regs.start[n] < 0) | |
ca1d1d23 JB |
1780 | return Qnil; |
1781 | return (make_number ((beginningp) ? search_regs.start[n] | |
1782 | : search_regs.end[n])); | |
1783 | } | |
1784 | ||
1785 | DEFUN ("match-beginning", Fmatch_beginning, Smatch_beginning, 1, 1, 0, | |
1786 | "Return position of start of text matched by last search.\n\ | |
16fdc568 BF |
1787 | NUM specifies which parenthesized expression in the last regexp.\n\ |
1788 | Value is nil if NUMth pair didn't match, or there were less than NUM pairs.\n\ | |
ca1d1d23 JB |
1789 | Zero means the entire text matched by the whole regexp or whole string.") |
1790 | (num) | |
1791 | Lisp_Object num; | |
1792 | { | |
1793 | return match_limit (num, 1); | |
1794 | } | |
1795 | ||
1796 | DEFUN ("match-end", Fmatch_end, Smatch_end, 1, 1, 0, | |
1797 | "Return position of end of text matched by last search.\n\ | |
1798 | ARG, a number, specifies which parenthesized expression in the last regexp.\n\ | |
1799 | Value is nil if ARGth pair didn't match, or there were less than ARG pairs.\n\ | |
1800 | Zero means the entire text matched by the whole regexp or whole string.") | |
1801 | (num) | |
1802 | Lisp_Object num; | |
1803 | { | |
1804 | return match_limit (num, 0); | |
1805 | } | |
1806 | ||
1807 | DEFUN ("match-data", Fmatch_data, Smatch_data, 0, 0, 0, | |
1808 | "Return a list containing all info on what the last search matched.\n\ | |
1809 | Element 2N is `(match-beginning N)'; element 2N + 1 is `(match-end N)'.\n\ | |
1810 | All the elements are markers or nil (nil if the Nth pair didn't match)\n\ | |
1811 | if the last match was on a buffer; integers or nil if a string was matched.\n\ | |
1812 | Use `store-match-data' to reinstate the data in this list.") | |
1813 | () | |
1814 | { | |
4746118a | 1815 | Lisp_Object *data; |
ca1d1d23 JB |
1816 | int i, len; |
1817 | ||
daa37602 JB |
1818 | if (NILP (last_thing_searched)) |
1819 | error ("match-data called before any match found"); | |
1820 | ||
4746118a JB |
1821 | data = (Lisp_Object *) alloca ((2 * search_regs.num_regs) |
1822 | * sizeof (Lisp_Object)); | |
1823 | ||
ca1d1d23 | 1824 | len = -1; |
4746118a | 1825 | for (i = 0; i < search_regs.num_regs; i++) |
ca1d1d23 JB |
1826 | { |
1827 | int start = search_regs.start[i]; | |
1828 | if (start >= 0) | |
1829 | { | |
daa37602 | 1830 | if (EQ (last_thing_searched, Qt)) |
ca1d1d23 | 1831 | { |
c235cce7 KH |
1832 | XSETFASTINT (data[2 * i], start); |
1833 | XSETFASTINT (data[2 * i + 1], search_regs.end[i]); | |
ca1d1d23 | 1834 | } |
0ed62dc7 | 1835 | else if (BUFFERP (last_thing_searched)) |
ca1d1d23 JB |
1836 | { |
1837 | data[2 * i] = Fmake_marker (); | |
daa37602 JB |
1838 | Fset_marker (data[2 * i], |
1839 | make_number (start), | |
1840 | last_thing_searched); | |
ca1d1d23 JB |
1841 | data[2 * i + 1] = Fmake_marker (); |
1842 | Fset_marker (data[2 * i + 1], | |
daa37602 JB |
1843 | make_number (search_regs.end[i]), |
1844 | last_thing_searched); | |
ca1d1d23 | 1845 | } |
daa37602 JB |
1846 | else |
1847 | /* last_thing_searched must always be Qt, a buffer, or Qnil. */ | |
1848 | abort (); | |
1849 | ||
ca1d1d23 JB |
1850 | len = i; |
1851 | } | |
1852 | else | |
1853 | data[2 * i] = data [2 * i + 1] = Qnil; | |
1854 | } | |
1855 | return Flist (2 * len + 2, data); | |
1856 | } | |
1857 | ||
1858 | ||
1859 | DEFUN ("store-match-data", Fstore_match_data, Sstore_match_data, 1, 1, 0, | |
1860 | "Set internal data on last search match from elements of LIST.\n\ | |
1861 | LIST should have been created by calling `match-data' previously.") | |
1862 | (list) | |
1863 | register Lisp_Object list; | |
1864 | { | |
1865 | register int i; | |
1866 | register Lisp_Object marker; | |
1867 | ||
7074fde6 FP |
1868 | if (running_asynch_code) |
1869 | save_search_regs (); | |
1870 | ||
ca1d1d23 | 1871 | if (!CONSP (list) && !NILP (list)) |
b37902c8 | 1872 | list = wrong_type_argument (Qconsp, list); |
ca1d1d23 | 1873 | |
daa37602 JB |
1874 | /* Unless we find a marker with a buffer in LIST, assume that this |
1875 | match data came from a string. */ | |
1876 | last_thing_searched = Qt; | |
1877 | ||
4746118a JB |
1878 | /* Allocate registers if they don't already exist. */ |
1879 | { | |
d084e942 | 1880 | int length = XFASTINT (Flength (list)) / 2; |
4746118a JB |
1881 | |
1882 | if (length > search_regs.num_regs) | |
1883 | { | |
1113d9db JB |
1884 | if (search_regs.num_regs == 0) |
1885 | { | |
1886 | search_regs.start | |
1887 | = (regoff_t *) xmalloc (length * sizeof (regoff_t)); | |
1888 | search_regs.end | |
1889 | = (regoff_t *) xmalloc (length * sizeof (regoff_t)); | |
1890 | } | |
4746118a | 1891 | else |
1113d9db JB |
1892 | { |
1893 | search_regs.start | |
1894 | = (regoff_t *) xrealloc (search_regs.start, | |
1895 | length * sizeof (regoff_t)); | |
1896 | search_regs.end | |
1897 | = (regoff_t *) xrealloc (search_regs.end, | |
1898 | length * sizeof (regoff_t)); | |
1899 | } | |
4746118a | 1900 | |
487282dc | 1901 | search_regs.num_regs = length; |
4746118a JB |
1902 | } |
1903 | } | |
1904 | ||
1905 | for (i = 0; i < search_regs.num_regs; i++) | |
ca1d1d23 JB |
1906 | { |
1907 | marker = Fcar (list); | |
1908 | if (NILP (marker)) | |
1909 | { | |
1910 | search_regs.start[i] = -1; | |
1911 | list = Fcdr (list); | |
1912 | } | |
1913 | else | |
1914 | { | |
0ed62dc7 | 1915 | if (MARKERP (marker)) |
daa37602 JB |
1916 | { |
1917 | if (XMARKER (marker)->buffer == 0) | |
c235cce7 | 1918 | XSETFASTINT (marker, 0); |
daa37602 | 1919 | else |
a3668d92 | 1920 | XSETBUFFER (last_thing_searched, XMARKER (marker)->buffer); |
daa37602 | 1921 | } |
ca1d1d23 JB |
1922 | |
1923 | CHECK_NUMBER_COERCE_MARKER (marker, 0); | |
1924 | search_regs.start[i] = XINT (marker); | |
1925 | list = Fcdr (list); | |
1926 | ||
1927 | marker = Fcar (list); | |
0ed62dc7 | 1928 | if (MARKERP (marker) && XMARKER (marker)->buffer == 0) |
c235cce7 | 1929 | XSETFASTINT (marker, 0); |
ca1d1d23 JB |
1930 | |
1931 | CHECK_NUMBER_COERCE_MARKER (marker, 0); | |
1932 | search_regs.end[i] = XINT (marker); | |
1933 | } | |
1934 | list = Fcdr (list); | |
1935 | } | |
1936 | ||
1937 | return Qnil; | |
1938 | } | |
1939 | ||
7074fde6 FP |
1940 | /* If non-zero the match data have been saved in saved_search_regs |
1941 | during the execution of a sentinel or filter. */ | |
75ebf74b | 1942 | static int search_regs_saved; |
7074fde6 FP |
1943 | static struct re_registers saved_search_regs; |
1944 | ||
1945 | /* Called from Flooking_at, Fstring_match, search_buffer, Fstore_match_data | |
1946 | if asynchronous code (filter or sentinel) is running. */ | |
1947 | static void | |
1948 | save_search_regs () | |
1949 | { | |
1950 | if (!search_regs_saved) | |
1951 | { | |
1952 | saved_search_regs.num_regs = search_regs.num_regs; | |
1953 | saved_search_regs.start = search_regs.start; | |
1954 | saved_search_regs.end = search_regs.end; | |
1955 | search_regs.num_regs = 0; | |
2d4a771a RS |
1956 | search_regs.start = 0; |
1957 | search_regs.end = 0; | |
7074fde6 FP |
1958 | |
1959 | search_regs_saved = 1; | |
1960 | } | |
1961 | } | |
1962 | ||
1963 | /* Called upon exit from filters and sentinels. */ | |
1964 | void | |
1965 | restore_match_data () | |
1966 | { | |
1967 | if (search_regs_saved) | |
1968 | { | |
1969 | if (search_regs.num_regs > 0) | |
1970 | { | |
1971 | xfree (search_regs.start); | |
1972 | xfree (search_regs.end); | |
1973 | } | |
1974 | search_regs.num_regs = saved_search_regs.num_regs; | |
1975 | search_regs.start = saved_search_regs.start; | |
1976 | search_regs.end = saved_search_regs.end; | |
1977 | ||
1978 | search_regs_saved = 0; | |
1979 | } | |
1980 | } | |
1981 | ||
ca1d1d23 JB |
1982 | /* Quote a string to inactivate reg-expr chars */ |
1983 | ||
1984 | DEFUN ("regexp-quote", Fregexp_quote, Sregexp_quote, 1, 1, 0, | |
1985 | "Return a regexp string which matches exactly STRING and nothing else.") | |
1986 | (str) | |
1987 | Lisp_Object str; | |
1988 | { | |
1989 | register unsigned char *in, *out, *end; | |
1990 | register unsigned char *temp; | |
1991 | ||
1992 | CHECK_STRING (str, 0); | |
1993 | ||
1994 | temp = (unsigned char *) alloca (XSTRING (str)->size * 2); | |
1995 | ||
1996 | /* Now copy the data into the new string, inserting escapes. */ | |
1997 | ||
1998 | in = XSTRING (str)->data; | |
1999 | end = in + XSTRING (str)->size; | |
2000 | out = temp; | |
2001 | ||
2002 | for (; in != end; in++) | |
2003 | { | |
2004 | if (*in == '[' || *in == ']' | |
2005 | || *in == '*' || *in == '.' || *in == '\\' | |
2006 | || *in == '?' || *in == '+' | |
2007 | || *in == '^' || *in == '$') | |
2008 | *out++ = '\\'; | |
2009 | *out++ = *in; | |
2010 | } | |
2011 | ||
2012 | return make_string (temp, out - temp); | |
2013 | } | |
2014 | \f | |
2015 | syms_of_search () | |
2016 | { | |
2017 | register int i; | |
2018 | ||
487282dc KH |
2019 | for (i = 0; i < REGEXP_CACHE_SIZE; ++i) |
2020 | { | |
2021 | searchbufs[i].buf.allocated = 100; | |
2022 | searchbufs[i].buf.buffer = (unsigned char *) malloc (100); | |
2023 | searchbufs[i].buf.fastmap = searchbufs[i].fastmap; | |
2024 | searchbufs[i].regexp = Qnil; | |
2025 | staticpro (&searchbufs[i].regexp); | |
2026 | searchbufs[i].next = (i == REGEXP_CACHE_SIZE-1 ? 0 : &searchbufs[i+1]); | |
2027 | } | |
2028 | searchbuf_head = &searchbufs[0]; | |
ca1d1d23 JB |
2029 | |
2030 | Qsearch_failed = intern ("search-failed"); | |
2031 | staticpro (&Qsearch_failed); | |
2032 | Qinvalid_regexp = intern ("invalid-regexp"); | |
2033 | staticpro (&Qinvalid_regexp); | |
2034 | ||
2035 | Fput (Qsearch_failed, Qerror_conditions, | |
2036 | Fcons (Qsearch_failed, Fcons (Qerror, Qnil))); | |
2037 | Fput (Qsearch_failed, Qerror_message, | |
2038 | build_string ("Search failed")); | |
2039 | ||
2040 | Fput (Qinvalid_regexp, Qerror_conditions, | |
2041 | Fcons (Qinvalid_regexp, Fcons (Qerror, Qnil))); | |
2042 | Fput (Qinvalid_regexp, Qerror_message, | |
2043 | build_string ("Invalid regexp")); | |
2044 | ||
daa37602 JB |
2045 | last_thing_searched = Qnil; |
2046 | staticpro (&last_thing_searched); | |
2047 | ||
ca1d1d23 | 2048 | defsubr (&Slooking_at); |
b819a390 RS |
2049 | defsubr (&Sposix_looking_at); |
2050 | defsubr (&Sstring_match); | |
2051 | defsubr (&Sposix_string_match); | |
ca1d1d23 JB |
2052 | defsubr (&Sskip_chars_forward); |
2053 | defsubr (&Sskip_chars_backward); | |
17431c60 RS |
2054 | defsubr (&Sskip_syntax_forward); |
2055 | defsubr (&Sskip_syntax_backward); | |
ca1d1d23 JB |
2056 | defsubr (&Ssearch_forward); |
2057 | defsubr (&Ssearch_backward); | |
2058 | defsubr (&Sword_search_forward); | |
2059 | defsubr (&Sword_search_backward); | |
2060 | defsubr (&Sre_search_forward); | |
2061 | defsubr (&Sre_search_backward); | |
b819a390 RS |
2062 | defsubr (&Sposix_search_forward); |
2063 | defsubr (&Sposix_search_backward); | |
ca1d1d23 JB |
2064 | defsubr (&Sreplace_match); |
2065 | defsubr (&Smatch_beginning); | |
2066 | defsubr (&Smatch_end); | |
2067 | defsubr (&Smatch_data); | |
2068 | defsubr (&Sstore_match_data); | |
2069 | defsubr (&Sregexp_quote); | |
2070 | } |