search.c 91.4 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, 2002, 2003,
3
                 2004, 2005, 2006 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
4 5 6 7 8

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
Karl Heuer's avatar
Karl Heuer committed
9
the Free Software Foundation; either version 2, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
10 11 12 13 14 15 16 17 18
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
19 20
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.  */
Jim Blandy's avatar
Jim Blandy committed
21 22


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

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

37
#define REGEXP_CACHE_SIZE 20
Jim Blandy's avatar
Jim Blandy committed
38

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

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

58 59
/* 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
60 61


Jim Blandy's avatar
Jim Blandy committed
62 63 64 65 66 67 68
/* 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
69 70 71
   been allocated by checking search_regs.num_regs.

   The regex code keeps track of whether it has allocated the search
72 73
   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
74 75 76 77 78
   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
79 80
static struct re_registers search_regs;

Jim Blandy's avatar
Jim Blandy committed
81 82 83 84
/* 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
85

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

Lisp_Object Qinvalid_regexp;

90 91 92
/* Error condition used for failing searches */
Lisp_Object Qsearch_failed;

Richard M. Stallman's avatar
Richard M. Stallman committed
93
Lisp_Object Vsearch_spaces_regexp;
94

95
static void set_search_regs ();
96
static void save_search_regs ();
97 98
static int simple_search ();
static int boyer_moore ();
99
static int search_buffer ();
100
static void matcher_overflow () NO_RETURN;
101

Jim Blandy's avatar
Jim Blandy committed
102 103 104 105 106 107
static void
matcher_overflow ()
{
  error ("Stack overflow in regexp matcher");
}

108 109 110
/* 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.
111
   TRANSLATE is a translation table for ignoring case, or nil for none.
112 113 114 115 116
   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
117 118 119
   for this pattern.  0 means backtrack only enough to get a valid match.
   MULTIBYTE is nonzero if we want to handle multibyte characters in
   PATTERN.  0 means all multibyte characters are recognized just as
120 121
   sequences of binary data.

Richard M. Stallman's avatar
Richard M. Stallman committed
122
   The behavior also depends on Vsearch_spaces_regexp.  */
Jim Blandy's avatar
Jim Blandy committed
123

124
static void
Karl Heuer's avatar
Karl Heuer committed
125
compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte)
126
     struct regexp_cache *cp;
Jim Blandy's avatar
Jim Blandy committed
127
     Lisp_Object pattern;
128
     Lisp_Object translate;
129
     struct re_registers *regp;
130
     int posix;
Karl Heuer's avatar
Karl Heuer committed
131
     int multibyte;
Jim Blandy's avatar
Jim Blandy committed
132
{
133
  unsigned char *raw_pattern;
134
  int raw_pattern_size;
135
  char *val;
136
  reg_syntax_t old;
Jim Blandy's avatar
Jim Blandy committed
137

138 139 140 141 142 143
  /* MULTIBYTE says whether the text to be searched is multibyte.
     We must convert PATTERN to match that, or we will not really
     find things right.  */

  if (multibyte == STRING_MULTIBYTE (pattern))
    {
144 145
      raw_pattern = (unsigned char *) SDATA (pattern);
      raw_pattern_size = SBYTES (pattern);
146 147 148
    }
  else if (multibyte)
    {
149 150
      raw_pattern_size = count_size_as_multibyte (SDATA (pattern),
						  SCHARS (pattern));
151
      raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1);
152 153
      copy_text (SDATA (pattern), raw_pattern,
		 SCHARS (pattern), 0, 1);
154 155 156 157 158 159 160 161 162
    }
  else
    {
      /* Converting multibyte to single-byte.

	 ??? Perhaps this conversion should be done in a special way
	 by subtracting nonascii-insert-offset from each non-ASCII char,
	 so that only the multibyte chars which really correspond to
	 the chosen single-byte character set can possibly match.  */
163
      raw_pattern_size = SCHARS (pattern);
164
      raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1);
165 166
      copy_text (SDATA (pattern), raw_pattern,
		 SBYTES (pattern), 1, 0);
167 168
    }

169
  cp->regexp = Qnil;
170
  cp->buf.translate = (! NILP (translate) ? translate : make_number (0));
171
  cp->posix = posix;
Karl Heuer's avatar
Karl Heuer committed
172
  cp->buf.multibyte = multibyte;
Richard M. Stallman's avatar
Richard M. Stallman committed
173
  cp->whitespace_regexp = Vsearch_spaces_regexp;
174 175 176 177 178
  /* 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;  */
179
  old = re_set_syntax (RE_SYNTAX_EMACS
180
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
181

Richard M. Stallman's avatar
Richard M. Stallman committed
182 183
  re_set_whitespace_regexp (NILP (Vsearch_spaces_regexp) ? NULL
			    : SDATA (Vsearch_spaces_regexp));
184

185 186
  val = (char *) re_compile_pattern ((char *)raw_pattern,
				     raw_pattern_size, &cp->buf);
187

188 189 190 191
  /* 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;

192 193
  re_set_whitespace_regexp (NULL);

194
  re_set_syntax (old);
195
  /* UNBLOCK_INPUT;  */
Jim Blandy's avatar
Jim Blandy committed
196
  if (val)
197
    xsignal1 (Qinvalid_regexp, build_string (val));
Jim Blandy's avatar
Jim Blandy committed
198

199 200 201
  cp->regexp = Fcopy_sequence (pattern);
}

202 203 204 205 206 207 208
/* 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 ()
{
209
  struct regexp_cache *cp;
210 211 212 213 214

  for (cp = searchbuf_head; cp != 0; cp = cp->next)
    {
      cp->buf.allocated = cp->buf.used;
      cp->buf.buffer
215
	= (unsigned char *) xrealloc (cp->buf.buffer, cp->buf.used);
216 217 218
    }
}

219 220 221 222 223 224 225 226 227 228 229 230 231
/* Clear the regexp cache.
   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)
    searchbufs[i].regexp = Qnil;
}

232
/* Compile a regexp if necessary, but first check to see if there's one in
233 234
   the cache.
   PATTERN is the pattern to compile.
235
   TRANSLATE is a translation table for ignoring case, or nil for none.
236 237 238 239 240 241
   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.  */
242 243

struct re_pattern_buffer *
244
compile_pattern (pattern, regp, translate, posix, multibyte)
245 246
     Lisp_Object pattern;
     struct re_registers *regp;
247
     Lisp_Object translate;
248
     int posix, multibyte;
249 250 251 252 253 254
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
255 256
      /* 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
257 258 259
	 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.  */
260
      if (NILP (cp->regexp))
261
	goto compile_it;
262
      if (SCHARS (cp->regexp) == SCHARS (pattern)
263
	  && STRING_MULTIBYTE (cp->regexp) == STRING_MULTIBYTE (pattern)
264
	  && !NILP (Fstring_equal (cp->regexp, pattern))
265
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
266
	  && cp->posix == posix
267
	  && cp->buf.multibyte == multibyte
268 269
	  && (EQ (cp->syntax_table, Qt)
	      || EQ (cp->syntax_table, current_buffer->syntax_table))
Richard M. Stallman's avatar
Richard M. Stallman committed
270
	  && !NILP (Fequal (cp->whitespace_regexp, Vsearch_spaces_regexp)))
271 272
	break;

273 274 275
      /* 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.  */
276 277
      if (cp->next == 0)
	{
278
	compile_it:
Karl Heuer's avatar
Karl Heuer committed
279
	  compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte);
280 281 282 283 284 285 286 287 288 289
	  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
290

291 292 293 294 295
  /* 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);

296
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
297 298 299
}


300 301
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
302
     Lisp_Object string;
303
     int posix;
Jim Blandy's avatar
Jim Blandy committed
304 305 306 307 308
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
309
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
310

311 312 313
  if (running_asynch_code)
    save_search_regs ();

314 315 316 317
  /* 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;

318
  CHECK_STRING (string);
319 320
  bufp = compile_pattern (string, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
321
			   ? current_buffer->case_canon_table : Qnil),
322 323
			  posix,
			  !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
324 325 326 327 328 329 330 331

  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;
332
  s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
333
  p2 = GAP_END_ADDR;
334
  s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
335 336 337
  if (s1 < 0)
    {
      p2 = p1;
338
      s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
339 340 341 342
      s1 = 0;
    }
  if (s2 < 0)
    {
343
      s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
344 345
      s2 = 0;
    }
346 347

  re_match_object = Qnil;
348

349
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
350 351
		  PT_BYTE - BEGV_BYTE, &search_regs,
		  ZV_BYTE - BEGV_BYTE);
352
  immediate_quit = 0;
353

Jim Blandy's avatar
Jim Blandy committed
354 355 356 357
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
358 359 360 361 362 363 364 365 366
  if (i >= 0)
    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);
	}
367
  XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
368 369 370
  return val;
}

371
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
372 373 374 375 376
       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)
377
     Lisp_Object regexp;
378
{
379
  return looking_at_1 (regexp, 0);
380 381 382
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
383 384 385 386 387 388
       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)
389
     Lisp_Object regexp;
390
{
391
  return looking_at_1 (regexp, 1);
392 393 394 395
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
396
     Lisp_Object regexp, string, start;
397
     int posix;
Jim Blandy's avatar
Jim Blandy committed
398 399
{
  int val;
400
  struct re_pattern_buffer *bufp;
401 402
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
403

404 405 406
  if (running_asynch_code)
    save_search_regs ();

407 408
  CHECK_STRING (regexp);
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
409 410

  if (NILP (start))
411
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
412 413
  else
    {
414
      int len = SCHARS (string);
Jim Blandy's avatar
Jim Blandy committed
415

416
      CHECK_NUMBER (start);
417 418 419 420
      pos = XINT (start);
      if (pos < 0 && -pos <= len)
	pos = len + pos;
      else if (0 > pos || pos > len)
Jim Blandy's avatar
Jim Blandy committed
421
	args_out_of_range (string, start);
422
      pos_byte = string_char_to_byte (string, pos);
Jim Blandy's avatar
Jim Blandy committed
423 424
    }

425 426 427 428
  /* 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;

429 430
  bufp = compile_pattern (regexp, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
431
			   ? current_buffer->case_canon_table : Qnil),
432 433
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
434
  immediate_quit = 1;
435
  re_match_object = string;
436

437 438 439
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), pos_byte,
		   SBYTES (string) - pos_byte,
Jim Blandy's avatar
Jim Blandy committed
440 441
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
442
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
443 444 445
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
446 447 448 449 450 451 452 453 454 455 456

  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]);
      }

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

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

Richard M. Stallman's avatar
Richard M. Stallman committed
489 490 491 492 493 494 495 496 497
/* 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;
498
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
499

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

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

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

extern Lisp_Object Vascii_downcase_table;

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

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

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

548
  bufp = compile_pattern (regexp, 0, Vascii_canon_table,
549 550 551 552 553 554 555 556 557 558
			  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;
}
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 592 593 594 595 596

/* 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
597 598

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

602 603
   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
604

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

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

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

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

636
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
637

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

        /* 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
657 658
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
659
            immediate_quit = allow_quit;
660

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

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

        /* 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.  */
674 675
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
676 677

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

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

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

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

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

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

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

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

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

778
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
779 780 781
        }
      }

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

805
int
806 807 808 809 810
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;
811
{
812 813 814 815 816 817 818 819
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

820 821
  int old_immediate_quit = immediate_quit;

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

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

  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)
		    {
847
		      immediate_quit = old_immediate_quit;
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 875 876 877 878 879
		      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)
		    {
880
		      immediate_quit = old_immediate_quit;
881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897
		      /* 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);
898
  immediate_quit = old_immediate_quit;
899 900

  return count * direction;
901 902
}

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

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

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

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

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

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

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

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

968 969 970 971
  /* 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;

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

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

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

  SET_PT (np);

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