search.c 93.8 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* String search routines for GNU Emacs.
2
   Copyright (C) 1985, 1986, 1987, 1993, 1994, 1997, 1998, 1999, 2001, 2002,
Glenn Morris's avatar
Glenn Morris committed
3 4
                 2003, 2004, 2005, 2006, 2007, 2008
                 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
5 6 7 8 9

This file is part of GNU Emacs.

GNU Emacs is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
10
the Free Software Foundation; either version 3, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
11 12 13 14 15 16 17 18 19
any later version.

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Emacs; see the file COPYING.  If not, write to
Lute Kamstra's avatar
Lute Kamstra committed
20 21
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.  */
Jim Blandy's avatar
Jim Blandy committed
22 23


24
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
25 26
#include "lisp.h"
#include "syntax.h"
Karl Heuer's avatar
Karl Heuer committed
27
#include "category.h"
Jim Blandy's avatar
Jim Blandy committed
28
#include "buffer.h"
29
#include "character.h"
Kenichi Handa's avatar
Kenichi Handa committed
30
#include "charset.h"
31
#include "region-cache.h"
Jim Blandy's avatar
Jim Blandy committed
32
#include "commands.h"
33
#include "blockinput.h"
34
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
35

Jim Blandy's avatar
Jim Blandy committed
36 37 38
#include <sys/types.h>
#include "regex.h"

39
#define REGEXP_CACHE_SIZE 20
Jim Blandy's avatar
Jim Blandy committed
40

41 42
/* If the regexp is non-nil, then the buffer contains the compiled form
   of that regexp, suitable for searching.  */
43 44
struct regexp_cache
{
45
  struct regexp_cache *next;
46
  Lisp_Object regexp, whitespace_regexp;
47
  /* Syntax table for which the regexp applies.  We need this because
48 49
     of character classes.  If this is t, then the compiled pattern is valid
     for any syntax-table.  */
50
  Lisp_Object syntax_table;
51 52
  struct re_pattern_buffer buf;
  char fastmap[0400];
53 54
  /* Nonzero means regexp was compiled to do full POSIX backtracking.  */
  char posix;
55
};
Jim Blandy's avatar
Jim Blandy committed
56

57 58
/* The instances of that struct.  */
struct regexp_cache searchbufs[REGEXP_CACHE_SIZE];
Jim Blandy's avatar
Jim Blandy committed
59

60 61
/* The head of the linked list; points to the most recently used buffer.  */
struct regexp_cache *searchbuf_head;
Jim Blandy's avatar
Jim Blandy committed
62 63


Jim Blandy's avatar
Jim Blandy committed
64 65 66 67 68 69 70
/* Every call to re_match, etc., must pass &search_regs as the regs
   argument unless you can show it is unnecessary (i.e., if re_match
   is certainly going to be called again before region-around-match
   can be called).

   Since the registers are now dynamically allocated, we need to make
   sure not to refer to the Nth register before checking that it has
Jim Blandy's avatar
Jim Blandy committed
71 72 73
   been allocated by checking search_regs.num_regs.

   The regex code keeps track of whether it has allocated the search
74 75
   buffer using bits in the re_pattern_buffer.  This means that whenever
   you compile a new pattern, it completely forgets whether it has
Jim Blandy's avatar
Jim Blandy committed
76 77 78 79 80
   allocated any registers, and will allocate new registers the next
   time you call a searching or matching function.  Therefore, we need
   to call re_set_registers after compiling a new pattern or after
   setting the match registers, so that the regex functions will be
   able to free or re-allocate it properly.  */
Jim Blandy's avatar
Jim Blandy committed
81 82
static struct re_registers search_regs;

Jim Blandy's avatar
Jim Blandy committed
83 84 85 86
/* The buffer in which the last search was performed, or
   Qt if the last search was done in a string;
   Qnil if no searching has been done yet.  */
static Lisp_Object last_thing_searched;
Jim Blandy's avatar
Jim Blandy committed
87

Karl Heuer's avatar
Karl Heuer committed
88
/* error condition signaled when regexp compile_pattern fails */
Jim Blandy's avatar
Jim Blandy committed
89 90 91

Lisp_Object Qinvalid_regexp;

92 93 94
/* Error condition used for failing searches */
Lisp_Object Qsearch_failed;

Richard M. Stallman's avatar
Richard M. Stallman committed
95
Lisp_Object Vsearch_spaces_regexp;
96

97 98 99 100 101
/* If non-nil, the match data will not be changed during call to
   searching or matching functions.  This variable is for internal use
   only.  */
Lisp_Object Vinhibit_changing_match_data;

102
static void set_search_regs ();
103
static void save_search_regs ();
104 105
static int simple_search ();
static int boyer_moore ();
106
static int search_buffer ();
107
static void matcher_overflow () NO_RETURN;
108

Jim Blandy's avatar
Jim Blandy committed
109 110 111 112 113 114
static void
matcher_overflow ()
{
  error ("Stack overflow in regexp matcher");
}

115 116 117
/* Compile a regexp and signal a Lisp error if anything goes wrong.
   PATTERN is the pattern to compile.
   CP is the place to put the result.
118
   TRANSLATE is a translation table for ignoring case, or nil for none.
119 120 121 122 123
   REGP is the structure that says where to store the "register"
   values that will result from matching this pattern.
   If it is 0, we should compile the pattern not to record any
   subexpression bounds.
   POSIX is nonzero if we want full backtracking (POSIX style)
Karl Heuer's avatar
Karl Heuer committed
124
   for this pattern.  0 means backtrack only enough to get a valid match.
125 126

   The behavior also depends on Vsearch_spaces_regexp.  */
Jim Blandy's avatar
Jim Blandy committed
127

128
static void
Kenichi Handa's avatar
Kenichi Handa committed
129
compile_pattern_1 (cp, pattern, translate, regp, posix)
130
     struct regexp_cache *cp;
Jim Blandy's avatar
Jim Blandy committed
131
     Lisp_Object pattern;
132
     Lisp_Object translate;
133
     struct re_registers *regp;
134
     int posix;
Jim Blandy's avatar
Jim Blandy committed
135
{
136
  char *val;
137
  reg_syntax_t old;
Jim Blandy's avatar
Jim Blandy committed
138

139
  cp->regexp = Qnil;
140
  cp->buf.translate = (! NILP (translate) ? translate : make_number (0));
141
  cp->posix = posix;
142
  cp->buf.multibyte = STRING_MULTIBYTE (pattern);
Kenichi Handa's avatar
Kenichi Handa committed
143
  cp->buf.charset_unibyte = charset_unibyte;
144 145 146 147 148
  if (STRINGP (Vsearch_spaces_regexp))
    cp->whitespace_regexp = Vsearch_spaces_regexp;
  else
    cp->whitespace_regexp = Qnil;

149 150 151 152 153
  /* rms: I think BLOCK_INPUT is not needed here any more,
     because regex.c defines malloc to call xmalloc.
     Using BLOCK_INPUT here means the debugger won't run if an error occurs.
     So let's turn it off.  */
  /*  BLOCK_INPUT;  */
154
  old = re_set_syntax (RE_SYNTAX_EMACS
155
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
156 157 158 159 160

  if (STRINGP (Vsearch_spaces_regexp))
    re_set_whitespace_regexp (SDATA (Vsearch_spaces_regexp));
  else
    re_set_whitespace_regexp (NULL);
161

Kenichi Handa's avatar
Kenichi Handa committed
162 163
  val = (char *) re_compile_pattern ((char *) SDATA (pattern),
				     SBYTES (pattern), &cp->buf);
164

165 166 167 168
  /* If the compiled pattern hard codes some of the contents of the
     syntax-table, it can only be reused with *this* syntax table.  */
  cp->syntax_table = cp->buf.used_syntax ? current_buffer->syntax_table : Qt;

169 170
  re_set_whitespace_regexp (NULL);

171
  re_set_syntax (old);
172
  /* UNBLOCK_INPUT;  */
Jim Blandy's avatar
Jim Blandy committed
173
  if (val)
174
    xsignal1 (Qinvalid_regexp, build_string (val));
Jim Blandy's avatar
Jim Blandy committed
175

176 177 178
  cp->regexp = Fcopy_sequence (pattern);
}

179 180 181 182 183 184 185
/* Shrink each compiled regexp buffer in the cache
   to the size actually used right now.
   This is called from garbage collection.  */

void
shrink_regexp_cache ()
{
186
  struct regexp_cache *cp;
187 188 189 190 191

  for (cp = searchbuf_head; cp != 0; cp = cp->next)
    {
      cp->buf.allocated = cp->buf.used;
      cp->buf.buffer
192
	= (unsigned char *) xrealloc (cp->buf.buffer, cp->buf.used);
193 194 195
    }
}

196 197
/* Clear the regexp cache w.r.t. a particular syntax table,
   because it was changed.
198 199 200 201 202 203 204 205 206
   There is no danger of memory leak here because re_compile_pattern
   automagically manages the memory in each re_pattern_buffer struct,
   based on its `allocated' and `buffer' values.  */
void
clear_regexp_cache ()
{
  int i;

  for (i = 0; i < REGEXP_CACHE_SIZE; ++i)
207 208 209 210 211
    /* It's tempting to compare with the syntax-table we've actually changd,
       but it's not sufficient because char-table inheritance mewans that
       modifying one syntax-table can change others at the same time.  */
    if (!EQ (searchbufs[i].syntax_table, Qt))
      searchbufs[i].regexp = Qnil;
212 213
}

214
/* Compile a regexp if necessary, but first check to see if there's one in
215 216
   the cache.
   PATTERN is the pattern to compile.
217
   TRANSLATE is a translation table for ignoring case, or nil for none.
218 219 220 221 222 223
   REGP is the structure that says where to store the "register"
   values that will result from matching this pattern.
   If it is 0, we should compile the pattern not to record any
   subexpression bounds.
   POSIX is nonzero if we want full backtracking (POSIX style)
   for this pattern.  0 means backtrack only enough to get a valid match.  */
224 225

struct re_pattern_buffer *
226
compile_pattern (pattern, regp, translate, posix, multibyte)
227 228
     Lisp_Object pattern;
     struct re_registers *regp;
229
     Lisp_Object translate;
230
     int posix, multibyte;
231 232 233 234 235 236
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
237 238
      /* Entries are initialized to nil, and may be set to nil by
	 compile_pattern_1 if the pattern isn't valid.  Don't apply
Ken Raeburn's avatar
Ken Raeburn committed
239 240 241
	 string accessors in those cases.  However, compile_pattern_1
	 is only applied to the cache entry we pick here to reuse.  So
	 nil should never appear before a non-nil entry.  */
242
      if (NILP (cp->regexp))
243
	goto compile_it;
244
      if (SCHARS (cp->regexp) == SCHARS (pattern)
245
	  && STRING_MULTIBYTE (cp->regexp) == STRING_MULTIBYTE (pattern)
246
	  && !NILP (Fstring_equal (cp->regexp, pattern))
247
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
248
	  && cp->posix == posix
249 250
	  && (EQ (cp->syntax_table, Qt)
	      || EQ (cp->syntax_table, current_buffer->syntax_table))
Kenichi Handa's avatar
Kenichi Handa committed
251 252
	  && !NILP (Fequal (cp->whitespace_regexp, Vsearch_spaces_regexp))
	  && cp->buf.charset_unibyte == charset_unibyte)
253 254
	break;

255 256 257
      /* If we're at the end of the cache, compile into the nil cell
	 we found, or the last (least recently used) cell with a
	 string value.  */
258 259
      if (cp->next == 0)
	{
260
	compile_it:
Kenichi Handa's avatar
Kenichi Handa committed
261
	  compile_pattern_1 (cp, pattern, translate, regp, posix);
262 263 264 265 266 267 268 269 270 271
	  break;
	}
    }

  /* When we get here, cp (aka *cpp) contains the compiled pattern,
     either because we found it in the cache or because we just compiled it.
     Move it to the front of the queue to mark it as most recently used.  */
  *cpp = cp->next;
  cp->next = searchbuf_head;
  searchbuf_head = cp;
Jim Blandy's avatar
Jim Blandy committed
272

273 274 275 276 277
  /* Advise the searching functions about the space we have allocated
     for register data.  */
  if (regp)
    re_set_registers (&cp->buf, regp, regp->num_regs, regp->start, regp->end);

Kenichi Handa's avatar
Kenichi Handa committed
278 279 280 281
  /* The compiled pattern can be used both for mulitbyte and unibyte
     target.  But, we have to tell which the pattern is used for. */
  cp->buf.target_multibyte = multibyte;

282
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
283 284 285
}


286 287
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
288
     Lisp_Object string;
289
     int posix;
Jim Blandy's avatar
Jim Blandy committed
290 291 292 293 294
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
295
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
296

297 298 299
  if (running_asynch_code)
    save_search_regs ();

300 301 302 303
  /* This is so set_image_of_range_1 in regex.c can find the EQV table.  */
  XCHAR_TABLE (current_buffer->case_canon_table)->extras[2]
    = current_buffer->case_eqv_table;

304
  CHECK_STRING (string);
305 306 307
  bufp = compile_pattern (string,
			  (NILP (Vinhibit_changing_match_data)
			   ? &search_regs : NULL),
308
			  (!NILP (current_buffer->case_fold_search)
309
			   ? current_buffer->case_canon_table : Qnil),
310 311
			  posix,
			  !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
312 313 314 315 316 317 318 319

  immediate_quit = 1;
  QUIT;			/* Do a pending quit right away, to avoid paradoxical behavior */

  /* Get pointers and sizes of the two strings
     that make up the visible portion of the buffer. */

  p1 = BEGV_ADDR;
320
  s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
321
  p2 = GAP_END_ADDR;
322
  s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
323 324 325
  if (s1 < 0)
    {
      p2 = p1;
326
      s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
327 328 329 330
      s1 = 0;
    }
  if (s2 < 0)
    {
331
      s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
332 333
      s2 = 0;
    }
334 335

  re_match_object = Qnil;
336

337
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
338 339 340
		  PT_BYTE - BEGV_BYTE,
		  (NILP (Vinhibit_changing_match_data)
		   ? &search_regs : NULL),
341
		  ZV_BYTE - BEGV_BYTE);
342
  immediate_quit = 0;
343

Jim Blandy's avatar
Jim Blandy committed
344 345 346 347
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
348
  if (NILP (Vinhibit_changing_match_data) && i >= 0)
349 350 351 352 353 354 355 356
    for (i = 0; i < search_regs.num_regs; i++)
      if (search_regs.start[i] >= 0)
	{
	  search_regs.start[i]
	    = BYTE_TO_CHAR (search_regs.start[i] + BEGV_BYTE);
	  search_regs.end[i]
	    = BYTE_TO_CHAR (search_regs.end[i] + BEGV_BYTE);
	}
357 358 359 360 361

  /* Set last_thing_searched only when match data is changed.  */
  if (NILP (Vinhibit_changing_match_data))
    XSETBUFFER (last_thing_searched, current_buffer);

Jim Blandy's avatar
Jim Blandy committed
362 363 364
  return val;
}

365
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
366 367 368 369 370
       doc: /* Return t if text after point matches regular expression REGEXP.
This function modifies the match data that `match-beginning',
`match-end' and `match-data' access; save and restore the match
data if you want to preserve them.  */)
     (regexp)
371
     Lisp_Object regexp;
372
{
373
  return looking_at_1 (regexp, 0);
374 375 376
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
377 378 379 380 381 382
       doc: /* Return t if text after point matches regular expression REGEXP.
Find the longest match, in accord with Posix regular expression rules.
This function modifies the match data that `match-beginning',
`match-end' and `match-data' access; save and restore the match
data if you want to preserve them.  */)
     (regexp)
383
     Lisp_Object regexp;
384
{
385
  return looking_at_1 (regexp, 1);
386 387 388 389
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
390
     Lisp_Object regexp, string, start;
391
     int posix;
Jim Blandy's avatar
Jim Blandy committed
392 393
{
  int val;
394
  struct re_pattern_buffer *bufp;
395 396
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
397

398 399 400
  if (running_asynch_code)
    save_search_regs ();

401 402
  CHECK_STRING (regexp);
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
403 404

  if (NILP (start))
405
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
406 407
  else
    {
408
      int len = SCHARS (string);
Jim Blandy's avatar
Jim Blandy committed
409

410
      CHECK_NUMBER (start);
411 412 413 414
      pos = XINT (start);
      if (pos < 0 && -pos <= len)
	pos = len + pos;
      else if (0 > pos || pos > len)
Jim Blandy's avatar
Jim Blandy committed
415
	args_out_of_range (string, start);
416
      pos_byte = string_char_to_byte (string, pos);
Jim Blandy's avatar
Jim Blandy committed
417 418
    }

419 420 421 422
  /* This is so set_image_of_range_1 in regex.c can find the EQV table.  */
  XCHAR_TABLE (current_buffer->case_canon_table)->extras[2]
    = current_buffer->case_eqv_table;

423 424 425
  bufp = compile_pattern (regexp,
			  (NILP (Vinhibit_changing_match_data)
			   ? &search_regs : NULL),
426
			  (!NILP (current_buffer->case_fold_search)
427
			   ? current_buffer->case_canon_table : Qnil),
428 429
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
430
  immediate_quit = 1;
431
  re_match_object = string;
432

433 434 435
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), pos_byte,
		   SBYTES (string) - pos_byte,
436 437
		   (NILP (Vinhibit_changing_match_data)
		    ? &search_regs : NULL));
Jim Blandy's avatar
Jim Blandy committed
438
  immediate_quit = 0;
439 440 441 442 443

  /* Set last_thing_searched only when match data is changed.  */
  if (NILP (Vinhibit_changing_match_data))
    last_thing_searched = Qt;

Jim Blandy's avatar
Jim Blandy committed
444 445 446
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
447

448 449 450 451 452 453 454 455 456
  if (NILP (Vinhibit_changing_match_data))
    for (i = 0; i < search_regs.num_regs; i++)
      if (search_regs.start[i] >= 0)
	{
	  search_regs.start[i]
	    = string_byte_to_char (string, search_regs.start[i]);
	  search_regs.end[i]
	    = string_byte_to_char (string, search_regs.end[i]);
	}
457 458

  return make_number (string_byte_to_char (string, val));
Jim Blandy's avatar
Jim Blandy committed
459
}
Richard M. Stallman's avatar
Richard M. Stallman committed
460

461
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
462
       doc: /* Return index of start of first match for REGEXP in STRING, or nil.
Richard M. Stallman's avatar
Richard M. Stallman committed
463
Matching ignores case if `case-fold-search' is non-nil.
464 465 466
If third arg START is non-nil, start search at that index in STRING.
For index of first char beyond the match, do (match-end 0).
`match-end' and `match-beginning' also give indices of substrings
467 468 469 470
matched by parenthesis constructs in the pattern.

You can use the function `match-string' to extract the substrings
matched by the parenthesis constructions in REGEXP. */)
471
     (regexp, string, start)
472 473 474 475 476 477
     Lisp_Object regexp, string, start;
{
  return string_match_1 (regexp, string, start, 0);
}

DEFUN ("posix-string-match", Fposix_string_match, Sposix_string_match, 2, 3, 0,
478 479 480 481 482 483 484 485
       doc: /* Return index of start of first match for REGEXP in STRING, or nil.
Find the longest match, in accord with Posix regular expression rules.
Case is ignored if `case-fold-search' is non-nil in the current buffer.
If third arg START is non-nil, start search at that index in STRING.
For index of first char beyond the match, do (match-end 0).
`match-end' and `match-beginning' also give indices of substrings
matched by parenthesis constructs in the pattern.  */)
     (regexp, string, start)
486 487 488 489 490
     Lisp_Object regexp, string, start;
{
  return string_match_1 (regexp, string, start, 1);
}

Richard M. Stallman's avatar
Richard M. Stallman committed
491 492 493 494 495 496 497 498 499
/* Match REGEXP against STRING, searching all of STRING,
   and return the index of the match, or negative on failure.
   This does not clobber the match data.  */

int
fast_string_match (regexp, string)
     Lisp_Object regexp, string;
{
  int val;
500
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
501

502 503
  bufp = compile_pattern (regexp, 0, Qnil,
			  0, STRING_MULTIBYTE (string));
Richard M. Stallman's avatar
Richard M. Stallman committed
504
  immediate_quit = 1;
505
  re_match_object = string;
506

507 508 509
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), 0,
		   SBYTES (string), 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
510 511 512
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
513 514 515

/* Match REGEXP against STRING, searching all of STRING ignoring case,
   and return the index of the match, or negative on failure.
516 517
   This does not clobber the match data.
   We assume that STRING contains single-byte characters.  */
Karl Heuer's avatar
Karl Heuer committed
518 519 520 521

extern Lisp_Object Vascii_downcase_table;

int
522
fast_c_string_match_ignore_case (regexp, string)
Karl Heuer's avatar
Karl Heuer committed
523
     Lisp_Object regexp;
524
     const char *string;
Karl Heuer's avatar
Karl Heuer committed
525 526 527 528 529
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

530
  regexp = string_make_unibyte (regexp);
531
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
532
  bufp = compile_pattern (regexp, 0,
533
			  Vascii_canon_table, 0,
534
			  0);
Karl Heuer's avatar
Karl Heuer committed
535 536 537 538 539
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
540 541 542 543 544 545 546 547 548 549

/* Like fast_string_match but ignore case.  */

int
fast_string_match_ignore_case (regexp, string)
     Lisp_Object regexp, string;
{
  int val;
  struct re_pattern_buffer *bufp;

550
  bufp = compile_pattern (regexp, 0, Vascii_canon_table,
551 552 553 554 555 556 557 558 559 560
			  0, STRING_MULTIBYTE (string));
  immediate_quit = 1;
  re_match_object = string;

  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), 0,
		   SBYTES (string), 0);
  immediate_quit = 0;
  return val;
}
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598

/* The newline cache: remembering which sections of text have no newlines.  */

/* If the user has requested newline caching, make sure it's on.
   Otherwise, make sure it's off.
   This is our cheezy way of associating an action with the change of
   state of a buffer-local variable.  */
static void
newline_cache_on_off (buf)
     struct buffer *buf;
{
  if (NILP (buf->cache_long_line_scans))
    {
      /* It should be off.  */
      if (buf->newline_cache)
        {
          free_region_cache (buf->newline_cache);
          buf->newline_cache = 0;
        }
    }
  else
    {
      /* It should be on.  */
      if (buf->newline_cache == 0)
        buf->newline_cache = new_region_cache ();
    }
}


/* Search for COUNT instances of the character TARGET between START and END.

   If COUNT is positive, search forwards; END must be >= START.
   If COUNT is negative, search backwards for the -COUNTth instance;
      END must be <= START.
   If COUNT is zero, do anything you please; run rogue, for all I care.

   If END is zero, use BEGV or ZV instead, as appropriate for the
   direction indicated by COUNT.
Jim Blandy's avatar
Jim Blandy committed
599 600

   If we find COUNT instances, set *SHORTAGE to zero, and return the
Richard M. Stallman's avatar
Richard M. Stallman committed
601
   position past the COUNTth match.  Note that for reverse motion
Richard M. Stallman's avatar
Richard M. Stallman committed
602
   this is not the same as the usual convention for Emacs motion commands.
Jim Blandy's avatar
Jim Blandy committed
603

604 605
   If we don't find COUNT instances before reaching END, set *SHORTAGE
   to the number of TARGETs left unfound, and return END.
Jim Blandy's avatar
Jim Blandy committed
606

607 608 609
   If ALLOW_QUIT is non-zero, set immediate_quit.  That's good to do
   except when inside redisplay.  */

Andreas Schwab's avatar
Andreas Schwab committed
610
int
611 612 613 614 615
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
616
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
617
{
618
  struct region_cache *newline_cache;
619
  int direction;
Jim Blandy's avatar
Jim Blandy committed
620

621 622 623 624 625 626 627 628 629 630
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
631

632 633
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
634 635 636 637

  if (shortage != 0)
    *shortage = 0;

638
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
639

Jim Blandy's avatar
Jim Blandy committed
640
  if (count > 0)
641
    while (start != end)
Jim Blandy's avatar
Jim Blandy committed
642
      {
643 644 645 646 647
        /* Our innermost scanning loop is very simple; it doesn't know
           about gaps, buffer ends, or the newline cache.  ceiling is
           the position of the last character before the next such
           obstacle --- the last character the dumb search loop should
           examine.  */
648 649
	int ceiling_byte = CHAR_TO_BYTE (end) - 1;
	int start_byte = CHAR_TO_BYTE (start);
650
	int tem;
651 652 653 654 655 656 657 658

        /* If we're looking for a newline, consult the newline cache
           to see where we can avoid some scanning.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_forward
659 660
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
661
            immediate_quit = allow_quit;
662

663 664 665
            /* START should never be after END.  */
            if (start_byte > ceiling_byte)
              start_byte = ceiling_byte;
666 667 668

            /* Now the text after start is an unknown region, and
               next_change is the position of the next known region. */
669
            ceiling_byte = min (next_change - 1, ceiling_byte);
670 671 672 673 674 675
          }

        /* The dumb loop can only scan text stored in contiguous
           bytes. BUFFER_CEILING_OF returns the last character
           position that is contiguous, so the ceiling is the
           position after that.  */
676 677
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
678 679

        {
680
          /* The termination address of the dumb loop.  */
681 682 683 684
          register unsigned char *ceiling_addr
	    = BYTE_POS_ADDR (ceiling_byte) + 1;
          register unsigned char *cursor
	    = BYTE_POS_ADDR (start_byte);
685 686 687 688 689 690 691 692 693 694 695 696 697 698
          unsigned char *base = cursor;

          while (cursor < ceiling_addr)
            {
              unsigned char *scan_start = cursor;

              /* The dumb loop.  */
              while (*cursor != target && ++cursor < ceiling_addr)
                ;

              /* If we're looking for newlines, cache the fact that
                 the region from start to cursor is free of them. */
              if (target == '\n' && newline_cache)
                know_region_cache (current_buffer, newline_cache,
699 700
                                   start_byte + scan_start - base,
                                   start_byte + cursor - base);
701 702 703 704 705 706 707

              /* Did we find the target character?  */
              if (cursor < ceiling_addr)
                {
                  if (--count == 0)
                    {
                      immediate_quit = 0;
708
                      return BYTE_TO_CHAR (start_byte + cursor - base + 1);
709 710 711 712 713
                    }
                  cursor++;
                }
            }

714
          start = BYTE_TO_CHAR (start_byte + cursor - base);
715
        }
Jim Blandy's avatar
Jim Blandy committed
716 717
      }
  else
718 719 720
    while (start > end)
      {
        /* The last character to check before the next obstacle.  */
721 722
	int ceiling_byte = CHAR_TO_BYTE (end);
	int start_byte = CHAR_TO_BYTE (start);
723
	int tem;
724 725 726 727 728 729 730

        /* Consult the newline cache, if appropriate.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_backward
731 732
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
733
            immediate_quit = allow_quit;
734 735

            /* Start should never be at or before end.  */
736 737
            if (start_byte <= ceiling_byte)
              start_byte = ceiling_byte + 1;
738 739 740

            /* Now the text before start is an unknown region, and
               next_change is the position of the next known region. */
741
            ceiling_byte = max (next_change, ceiling_byte);
742 743 744
          }

        /* Stop scanning before the gap.  */
745 746
	tem = BUFFER_FLOOR_OF (start_byte - 1);
	ceiling_byte = max (tem, ceiling_byte);
747 748 749

        {
          /* The termination address of the dumb loop.  */
750 751
          register unsigned char *ceiling_addr = BYTE_POS_ADDR (ceiling_byte);
          register unsigned char *cursor = BYTE_POS_ADDR (start_byte - 1);
752 753 754 755 756 757 758 759 760 761 762 763 764
          unsigned char *base = cursor;

          while (cursor >= ceiling_addr)
            {
              unsigned char *scan_start = cursor;

              while (*cursor != target && --cursor >= ceiling_addr)
                ;

              /* If we're looking for newlines, cache the fact that
                 the region from after the cursor to start is free of them.  */
              if (target == '\n' && newline_cache)
                know_region_cache (current_buffer, newline_cache,
765 766
                                   start_byte + cursor - base,
                                   start_byte + scan_start - base);
767 768 769 770 771 772 773

              /* Did we find the target character?  */
              if (cursor >= ceiling_addr)
                {
                  if (++count >= 0)
                    {
                      immediate_quit = 0;
774
                      return BYTE_TO_CHAR (start_byte + cursor - base);
775 776 777 778 779
                    }
                  cursor--;
                }
            }

780
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
781 782 783
        }
      }

Jim Blandy's avatar
Jim Blandy committed
784 785
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
786
    *shortage = count * direction;
787
  return start;
Jim Blandy's avatar
Jim Blandy committed
788
}
789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804

/* Search for COUNT instances of a line boundary, which means either a
   newline or (if selective display enabled) a carriage return.
   Start at START.  If COUNT is negative, search backwards.

   We report the resulting position by calling TEMP_SET_PT_BOTH.

   If we find COUNT instances. we position after (always after,
   even if scanning backwards) the COUNTth match, and return 0.

   If we don't find COUNT instances before reaching the end of the
   buffer (or the beginning, if scanning backwards), we return
   the number of line boundaries left unfound, and position at
   the limit we bumped up against.

   If ALLOW_QUIT is non-zero, set immediate_quit.  That's good to do
805
   except in special cases.  */
Jim Blandy's avatar
Jim Blandy committed
806

807
int
808 809 810 811 812
scan_newline (start, start_byte, limit, limit_byte, count, allow_quit)
     int start, start_byte;
     int limit, limit_byte;
     register int count;
     int allow_quit;
813
{
814 815 816 817 818 819 820 821
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

822 823
  int old_immediate_quit = immediate_quit;

824 825 826
  /* The code that follows is like scan_buffer
     but checks for either newline or carriage return.  */

827 828
  if (allow_quit)
    immediate_quit++;
829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848

  start_byte = CHAR_TO_BYTE (start);

  if (count > 0)
    {
      while (start_byte < limit_byte)
	{
	  ceiling =  BUFFER_CEILING_OF (start_byte);
	  ceiling = min (limit_byte - 1, ceiling);
	  ceiling_addr = BYTE_POS_ADDR (ceiling) + 1;
	  base = (cursor = BYTE_POS_ADDR (start_byte));
	  while (1)
	    {
	      while (*cursor != '\n' && ++cursor != ceiling_addr)
		;

	      if (cursor != ceiling_addr)
		{
		  if (--count == 0)
		    {
849
		      immediate_quit = old_immediate_quit;
850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881
		      start_byte = start_byte + cursor - base + 1;
		      start = BYTE_TO_CHAR (start_byte);
		      TEMP_SET_PT_BOTH (start, start_byte);
		      return 0;
		    }
		  else
		    if (++cursor == ceiling_addr)
		      break;
		}
	      else
		break;
	    }
	  start_byte += cursor - base;
	}
    }
  else
    {
      while (start_byte > limit_byte)
	{
	  ceiling = BUFFER_FLOOR_OF (start_byte - 1);
	  ceiling = max (limit_byte, ceiling);
	  ceiling_addr = BYTE_POS_ADDR (ceiling) - 1;
	  base = (cursor = BYTE_POS_ADDR (start_byte - 1) + 1);
	  while (1)
	    {
	      while (--cursor != ceiling_addr && *cursor != '\n')
		;

	      if (cursor != ceiling_addr)
		{
		  if (++count == 0)
		    {
882
		      immediate_quit = old_immediate_quit;
883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899
		      /* Return the position AFTER the match we found.  */
		      start_byte = start_byte + cursor - base + 1;
		      start = BYTE_TO_CHAR (start_byte);
		      TEMP_SET_PT_BOTH (start, start_byte);
		      return 0;
		    }
		}
	      else
		break;
	    }
	  /* Here we add 1 to compensate for the last decrement
	     of CURSOR, which took it past the valid range.  */
	  start_byte += cursor - base + 1;
	}
    }

  TEMP_SET_PT_BOTH (limit, limit_byte);
900
  immediate_quit = old_immediate_quit;
901 902

  return count * direction;
903 904
}

Jim Blandy's avatar
Jim Blandy committed
905
int
906
find_next_newline_no_quit (from, cnt)
Jim Blandy's avatar
Jim Blandy committed
907 908
     register int from, cnt;
{
909
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
910 911 912 913 914
}

/* Like find_next_newline, but returns position before the newline,
   not after, and only search up to TO.  This isn't just
   find_next_newline (...)-1, because you might hit TO.  */
915

916 917
int
find_before_next_newline (from, to, cnt)
918
     int from, to, cnt;
919 920 921 922 923 924
{
  int shortage;
  int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1);

  if (shortage == 0)
    pos--;
925

926
  return pos;
Jim Blandy's avatar
Jim Blandy committed
927 928 929 930 931
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
932
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
933 934 935
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
936
     int posix;
Jim Blandy's avatar
Jim Blandy committed
937 938
{
  register int np;
939
  int lim, lim_byte;
Jim Blandy's avatar
Jim Blandy committed
940 941 942 943
  int n = direction;

  if (!NILP (count))
    {
944
      CHECK_NUMBER (count);
Jim Blandy's avatar
Jim Blandy committed
945 946 947
      n *= XINT (count);
    }

948
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
949
  if (NILP (bound))
950 951 952 953 954 955
    {
      if (n > 0)
	lim = ZV, lim_byte = ZV_BYTE;
      else
	lim = BEGV, lim_byte = BEGV_BYTE;
    }
Jim Blandy's avatar
Jim Blandy committed
956 957
  else
    {
958
      CHECK_NUMBER_COERCE_MARKER (bound);
Jim Blandy's avatar
Jim Blandy committed
959
      lim = XINT (bound);
960
      if (n > 0 ? lim < PT : lim > PT)
Jim Blandy's avatar
Jim Blandy committed
961 962
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
963
	lim = ZV, lim_byte = ZV_BYTE;
964
      else if (lim < BEGV)
965
	lim = BEGV, lim_byte = BEGV_BYTE;
966 967
      else
	lim_byte = CHAR_TO_BYTE (lim);
Jim Blandy's avatar
Jim Blandy committed
968 969
    }

970 971 972 973
  /* This is so set_image_of_range_1 in regex.c can find the EQV table.  */
  XCHAR_TABLE (current_buffer->case_canon_table)->extras[2]
    = current_buffer->case_eqv_table;

974
  np = search_buffer (string, PT, PT_BYTE, lim, lim_byte, n, RE,
Jim Blandy's avatar
Jim Blandy committed
975
		      (!NILP (current_buffer->case_fold_search)
976
		       ? c