search.c 93.7 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
  cp->whitespace_regexp = Vsearch_spaces_regexp;
145 146 147 148 149
  /* 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;  */
150
  old = re_set_syntax (RE_SYNTAX_EMACS
151
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
152 153 154
  re_set_whitespace_regexp (NILP (Vsearch_spaces_regexp) ? NULL
			    : SDATA (Vsearch_spaces_regexp));

Kenichi Handa's avatar
Kenichi Handa committed
155 156
  val = (char *) re_compile_pattern ((char *) SDATA (pattern),
				     SBYTES (pattern), &cp->buf);
157

158 159 160 161
  /* 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;

162 163
  re_set_whitespace_regexp (NULL);

164
  re_set_syntax (old);
165
  /* UNBLOCK_INPUT;  */
Jim Blandy's avatar
Jim Blandy committed
166
  if (val)
167
    xsignal1 (Qinvalid_regexp, build_string (val));
Jim Blandy's avatar
Jim Blandy committed
168

169 170 171
  cp->regexp = Fcopy_sequence (pattern);
}

172 173 174 175 176 177 178
/* 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 ()
{
179
  struct regexp_cache *cp;
180 181 182 183 184

  for (cp = searchbuf_head; cp != 0; cp = cp->next)
    {
      cp->buf.allocated = cp->buf.used;
      cp->buf.buffer
185
	= (unsigned char *) xrealloc (cp->buf.buffer, cp->buf.used);
186 187 188
    }
}

189 190
/* Clear the regexp cache w.r.t. a particular syntax table,
   because it was changed.
191 192 193 194 195 196 197 198 199
   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)
200 201 202 203 204
    /* 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;
205 206
}

207
/* Compile a regexp if necessary, but first check to see if there's one in
208 209
   the cache.
   PATTERN is the pattern to compile.
210
   TRANSLATE is a translation table for ignoring case, or nil for none.
211 212 213 214 215 216
   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.  */
217 218

struct re_pattern_buffer *
219
compile_pattern (pattern, regp, translate, posix, multibyte)
220 221
     Lisp_Object pattern;
     struct re_registers *regp;
222
     Lisp_Object translate;
223
     int posix, multibyte;
224 225 226 227 228 229
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
230 231
      /* 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
232 233 234
	 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.  */
235
      if (NILP (cp->regexp))
236
	goto compile_it;
237
      if (SCHARS (cp->regexp) == SCHARS (pattern)
238
	  && STRING_MULTIBYTE (cp->regexp) == STRING_MULTIBYTE (pattern)
239
	  && !NILP (Fstring_equal (cp->regexp, pattern))
240
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
241
	  && cp->posix == posix
242 243
	  && (EQ (cp->syntax_table, Qt)
	      || EQ (cp->syntax_table, current_buffer->syntax_table))
Kenichi Handa's avatar
Kenichi Handa committed
244 245
	  && !NILP (Fequal (cp->whitespace_regexp, Vsearch_spaces_regexp))
	  && cp->buf.charset_unibyte == charset_unibyte)
246 247
	break;

248 249 250
      /* 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.  */
251 252
      if (cp->next == 0)
	{
253
	compile_it:
Kenichi Handa's avatar
Kenichi Handa committed
254
	  compile_pattern_1 (cp, pattern, translate, regp, posix);
255 256 257 258 259 260 261 262 263 264
	  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
265

266 267 268 269 270
  /* 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
271 272 273 274
  /* 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;

275
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
276 277 278
}


279 280
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
281
     Lisp_Object string;
282
     int posix;
Jim Blandy's avatar
Jim Blandy committed
283 284 285 286 287
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
288
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
289

290 291 292
  if (running_asynch_code)
    save_search_regs ();

293 294 295 296
  /* 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;

297
  CHECK_STRING (string);
298 299 300
  bufp = compile_pattern (string,
			  (NILP (Vinhibit_changing_match_data)
			   ? &search_regs : NULL),
301
			  (!NILP (current_buffer->case_fold_search)
302
			   ? current_buffer->case_canon_table : Qnil),
303 304
			  posix,
			  !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
305 306 307 308 309 310 311 312

  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;
313
  s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
314
  p2 = GAP_END_ADDR;
315
  s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
316 317 318
  if (s1 < 0)
    {
      p2 = p1;
319
      s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
320 321 322 323
      s1 = 0;
    }
  if (s2 < 0)
    {
324
      s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
325 326
      s2 = 0;
    }
327 328

  re_match_object = Qnil;
329

330
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
331 332 333
		  PT_BYTE - BEGV_BYTE,
		  (NILP (Vinhibit_changing_match_data)
		   ? &search_regs : NULL),
334
		  ZV_BYTE - BEGV_BYTE);
335
  immediate_quit = 0;
336

Jim Blandy's avatar
Jim Blandy committed
337 338 339 340
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
341
  if (NILP (Vinhibit_changing_match_data) && i >= 0)
342 343 344 345 346 347 348 349
    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);
	}
350 351 352 353 354

  /* 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
355 356 357
  return val;
}

358
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
359 360 361 362 363
       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)
364
     Lisp_Object regexp;
365
{
366
  return looking_at_1 (regexp, 0);
367 368 369
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
370 371 372 373 374 375
       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)
376
     Lisp_Object regexp;
377
{
378
  return looking_at_1 (regexp, 1);
379 380 381 382
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
383
     Lisp_Object regexp, string, start;
384
     int posix;
Jim Blandy's avatar
Jim Blandy committed
385 386
{
  int val;
387
  struct re_pattern_buffer *bufp;
388 389
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
390

391 392 393
  if (running_asynch_code)
    save_search_regs ();

394 395
  CHECK_STRING (regexp);
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
396 397

  if (NILP (start))
398
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
399 400
  else
    {
401
      int len = SCHARS (string);
Jim Blandy's avatar
Jim Blandy committed
402

403
      CHECK_NUMBER (start);
404 405 406 407
      pos = XINT (start);
      if (pos < 0 && -pos <= len)
	pos = len + pos;
      else if (0 > pos || pos > len)
Jim Blandy's avatar
Jim Blandy committed
408
	args_out_of_range (string, start);
409
      pos_byte = string_char_to_byte (string, pos);
Jim Blandy's avatar
Jim Blandy committed
410 411
    }

412 413 414 415
  /* 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;

416 417 418
  bufp = compile_pattern (regexp,
			  (NILP (Vinhibit_changing_match_data)
			   ? &search_regs : NULL),
419
			  (!NILP (current_buffer->case_fold_search)
420
			   ? current_buffer->case_canon_table : Qnil),
421 422
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
423
  immediate_quit = 1;
424
  re_match_object = string;
425

426 427 428
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), pos_byte,
		   SBYTES (string) - pos_byte,
429 430
		   (NILP (Vinhibit_changing_match_data)
		    ? &search_regs : NULL));
Jim Blandy's avatar
Jim Blandy committed
431
  immediate_quit = 0;
432 433 434 435 436

  /* 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
437 438 439
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
440

441 442 443 444 445 446 447 448 449
  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]);
	}
450 451

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

454
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
455
       doc: /* Return index of start of first match for REGEXP in STRING, or nil.
Richard M. Stallman's avatar
Richard M. Stallman committed
456
Matching ignores case if `case-fold-search' is non-nil.
457 458 459
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
460 461 462 463
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. */)
464
     (regexp, string, start)
465 466 467 468 469 470
     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,
471 472 473 474 475 476 477 478
       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)
479 480 481 482 483
     Lisp_Object regexp, string, start;
{
  return string_match_1 (regexp, string, start, 1);
}

Richard M. Stallman's avatar
Richard M. Stallman committed
484 485 486 487 488 489 490 491 492
/* 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;
493
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
494

495 496
  bufp = compile_pattern (regexp, 0, Qnil,
			  0, STRING_MULTIBYTE (string));
Richard M. Stallman's avatar
Richard M. Stallman committed
497
  immediate_quit = 1;
498
  re_match_object = string;
499

500 501 502
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), 0,
		   SBYTES (string), 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
503 504 505
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
506 507 508

/* Match REGEXP against STRING, searching all of STRING ignoring case,
   and return the index of the match, or negative on failure.
509 510
   This does not clobber the match data.
   We assume that STRING contains single-byte characters.  */
Karl Heuer's avatar
Karl Heuer committed
511 512 513 514

extern Lisp_Object Vascii_downcase_table;

int
515
fast_c_string_match_ignore_case (regexp, string)
Karl Heuer's avatar
Karl Heuer committed
516
     Lisp_Object regexp;
517
     const char *string;
Karl Heuer's avatar
Karl Heuer committed
518 519 520 521 522
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

523
  regexp = string_make_unibyte (regexp);
524
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
525
  bufp = compile_pattern (regexp, 0,
526
			  Vascii_canon_table, 0,
527
			  0);
Karl Heuer's avatar
Karl Heuer committed
528 529 530 531 532
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
533 534 535 536 537 538 539 540 541 542

/* 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;

543
  bufp = compile_pattern (regexp, 0, Vascii_canon_table,
544 545 546 547 548 549 550 551 552 553
			  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;
}
554 555 556 557 558 559 560 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

/* 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
592 593

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

597 598
   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
599

600 601 602
   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
603
int
604 605 606 607 608
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
609
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
610
{
611
  struct region_cache *newline_cache;
612
  int direction;
Jim Blandy's avatar
Jim Blandy committed
613

614 615 616 617 618 619 620 621 622 623
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
624

625 626
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
627 628 629 630

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

631
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
632

Jim Blandy's avatar
Jim Blandy committed
633
  if (count > 0)
634
    while (start != end)
Jim Blandy's avatar
Jim Blandy committed
635
      {
636 637 638 639 640
        /* 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.  */
641 642
	int ceiling_byte = CHAR_TO_BYTE (end) - 1;
	int start_byte = CHAR_TO_BYTE (start);
643
	int tem;
644 645 646 647 648 649 650 651

        /* 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
652 653
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
654
            immediate_quit = allow_quit;
655

656 657 658
            /* START should never be after END.  */
            if (start_byte > ceiling_byte)
              start_byte = ceiling_byte;
659 660 661

            /* Now the text after start is an unknown region, and
               next_change is the position of the next known region. */
662
            ceiling_byte = min (next_change - 1, ceiling_byte);
663 664 665 666 667 668
          }

        /* 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.  */
669 670
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
671 672

        {
673
          /* The termination address of the dumb loop.  */
674 675 676 677
          register unsigned char *ceiling_addr
	    = BYTE_POS_ADDR (ceiling_byte) + 1;
          register unsigned char *cursor
	    = BYTE_POS_ADDR (start_byte);
678 679 680 681 682 683 684 685 686 687 688 689 690 691
          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,
692 693
                                   start_byte + scan_start - base,
                                   start_byte + cursor - base);
694 695 696 697 698 699 700

              /* Did we find the target character?  */
              if (cursor < ceiling_addr)
                {
                  if (--count == 0)
                    {
                      immediate_quit = 0;
701
                      return BYTE_TO_CHAR (start_byte + cursor - base + 1);
702 703 704 705 706
                    }
                  cursor++;
                }
            }

707
          start = BYTE_TO_CHAR (start_byte + cursor - base);
708
        }
Jim Blandy's avatar
Jim Blandy committed
709 710
      }
  else
711 712 713
    while (start > end)
      {
        /* The last character to check before the next obstacle.  */
714 715
	int ceiling_byte = CHAR_TO_BYTE (end);
	int start_byte = CHAR_TO_BYTE (start);
716
	int tem;
717 718 719 720 721 722 723

        /* Consult the newline cache, if appropriate.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_backward
724 725
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
726
            immediate_quit = allow_quit;
727 728

            /* Start should never be at or before end.  */
729 730
            if (start_byte <= ceiling_byte)
              start_byte = ceiling_byte + 1;
731 732 733

            /* Now the text before start is an unknown region, and
               next_change is the position of the next known region. */
734
            ceiling_byte = max (next_change, ceiling_byte);
735 736 737
          }

        /* Stop scanning before the gap.  */
738 739
	tem = BUFFER_FLOOR_OF (start_byte - 1);
	ceiling_byte = max (tem, ceiling_byte);
740 741 742

        {
          /* The termination address of the dumb loop.  */
743 744
          register unsigned char *ceiling_addr = BYTE_POS_ADDR (ceiling_byte);
          register unsigned char *cursor = BYTE_POS_ADDR (start_byte - 1);
745 746 747 748 749 750 751 752 753 754 755 756 757
          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,
758 759
                                   start_byte + cursor - base,
                                   start_byte + scan_start - base);
760 761 762 763 764 765 766

              /* Did we find the target character?  */
              if (cursor >= ceiling_addr)
                {
                  if (++count >= 0)
                    {
                      immediate_quit = 0;
767
                      return BYTE_TO_CHAR (start_byte + cursor - base);
768 769 770 771 772
                    }
                  cursor--;
                }
            }

773
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
774 775 776
        }
      }

Jim Blandy's avatar
Jim Blandy committed
777 778
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
779
    *shortage = count * direction;
780
  return start;
Jim Blandy's avatar
Jim Blandy committed
781
}
782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797

/* 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
798
   except in special cases.  */
Jim Blandy's avatar
Jim Blandy committed
799

800
int
801 802 803 804 805
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;
806
{
807 808 809 810 811 812 813 814
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

815 816
  int old_immediate_quit = immediate_quit;

817 818 819
  /* The code that follows is like scan_buffer
     but checks for either newline or carriage return.  */

820 821
  if (allow_quit)
    immediate_quit++;
822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841

  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)
		    {
842
		      immediate_quit = old_immediate_quit;
843 844 845 846 847 848 849 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
		      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)
		    {
875
		      immediate_quit = old_immediate_quit;
876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892
		      /* 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);
893
  immediate_quit = old_immediate_quit;
894 895

  return count * direction;
896 897
}

Jim Blandy's avatar
Jim Blandy committed
898
int
899
find_next_newline_no_quit (from, cnt)
Jim Blandy's avatar
Jim Blandy committed
900 901
     register int from, cnt;
{
902
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
903 904 905 906 907
}

/* 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.  */
908

909 910
int
find_before_next_newline (from, to, cnt)
911
     int from, to, cnt;
912 913 914 915 916 917
{
  int shortage;
  int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1);

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

919
  return pos;
Jim Blandy's avatar
Jim Blandy committed
920 921 922 923 924
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
925
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
926 927 928
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
929
     int posix;
Jim Blandy's avatar
Jim Blandy committed
930 931
{
  register int np;
932
  int lim, lim_byte;
Jim Blandy's avatar
Jim Blandy committed
933 934 935 936
  int n = direction;

  if (!NILP (count))
    {
937
      CHECK_NUMBER (count);
Jim Blandy's avatar
Jim Blandy committed
938 939 940
      n *= XINT (count);
    }

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

963 964 965 966
  /* 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;

967
  np = search_buffer (string, PT, PT_BYTE, lim, lim_byte, n, RE,
Jim Blandy's avatar
Jim Blandy committed
968
		      (!NILP (current_buffer->case_fold_search)
969
		       ? current_buffer->case_canon_table
970
		       : Qnil),
Jim Blandy's avatar
Jim Blandy committed
971
		      (!NILP (current_buffer->case_fold_search)
972
		       ? current_buffer->case_eqv_table
973
		       : Qnil),
974
		      posix);
Jim Blandy's avatar
Jim Blandy committed
975 976 977
  if (np <= 0)
    {
      if (NILP (noerror))
978 979
	xsignal1 (Qsearch_failed, string);

Jim Blandy's avatar
Jim Blandy committed
980 981 982 983
      if (!EQ (noerror, Qt))
	{
	  if (lim < BEGV || lim > ZV)
	    abort ();
984
	  SET_PT_BOTH (lim, lim_byte);
985 986 987
	  return Qnil;
#if 0 /* This would be clean, but maybe programs depend on
	 a value of nil here.  */
988
	  np = lim;
989
#endif
Jim Blandy's avatar
Jim Blandy committed
990
	}
991 992
      else
	return Qnil;
Jim Blandy's avatar
Jim Blandy committed
993 994 995 996 997 998 999 1000 1001 1002
    }

  if (np < BEGV || np > ZV)
    abort ();

  SET_PT (np);

  return make_number (np);
}

1003 1004
/* Return 1 if REGEXP it matches just one constant string.  */

Karl Heuer's avatar
Karl Heuer committed
1005 1006 1007 1008
static int
trivial_regexp_p (regexp)
     Lisp_Object regexp;
{
1009 1010
  int len = SBYTES (regexp);
  unsigned char *s = SDATA (regexp);
Karl Heuer's avatar
Karl Heuer committed
1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023
  while (--len >= 0)
    {
      switch (*s++)
	{
	case '.': case '*': case '+': case '?': case '[': case '^': case '$':
	  return 0;
	case '\\':
	  if (--len < 0)
	    return 0;
	  switch (*s++)
	    {
	    case '|': case '(': case ')': case '`': case '\'': case 'b':
	    case 'B': case '<': case '>': case 'w': case 'W': case 's':
1024
	    case 'S': case '=': case '{': case '}': case '_':
Karl Heuer's avatar
Karl Heuer committed
1025
	    case 'c': case 'C':	/* for categoryspec and notcategoryspec */
1026
	    case '1': case '2': case '3': case '4': case '5':
Karl Heuer's avatar
Karl Heuer committed
1027 1028 1029 1030 1031 1032 1033 1034
	    case '6': case '7': case '8': case '9':
	      return 0;
	    }
	}
    }
  return 1;
}

1035
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
1036
   starting at position POS and stopping at position LIM,
1037
   treating STRING as a literal string if RE is false or as
Jim Blandy's avatar
Jim Blandy committed
1038 1039 1040 1041 1042
   a regular expression if RE is true.

   If N is positive, searching is forward and LIM must be greater than POS.
   If N is negative, searching is backward and LIM must be less than POS.

1043
   Returns -x if x occurrences remain to be found (x > 0),
Jim Blandy's avatar
Jim Blandy committed
1044
   or else the position at the beginning of the Nth occurrence
1045 1046 1047 1048
   (if searching backward) or the end (if searching forward).

   POSIX is nonzero if we want full backtracking (POSIX style)
   for this pattern.  0 means backtrack only enough to get a valid match.  */
Jim Blandy's avatar
Jim Blandy committed
1049

Richard M. Stallman's avatar