search.c 85.5 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* String search routines for GNU Emacs.
2 3
   Copyright (C) 1985, 86,87,93,94,97,98, 1999, 2004
             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
19 20
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, 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 44 45 46
  struct regexp_cache *next;
  Lisp_Object regexp;
  struct re_pattern_buffer buf;
  char fastmap[0400];
47 48
  /* Nonzero means regexp was compiled to do full POSIX backtracking.  */
  char posix;
49
};
Jim Blandy's avatar
Jim Blandy committed
50

51 52
/* The instances of that struct.  */
struct regexp_cache searchbufs[REGEXP_CACHE_SIZE];
Jim Blandy's avatar
Jim Blandy committed
53

54 55
/* 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
56 57


Jim Blandy's avatar
Jim Blandy committed
58 59 60 61 62 63 64
/* 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
65 66 67
   been allocated by checking search_regs.num_regs.

   The regex code keeps track of whether it has allocated the search
68 69
   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
70 71 72 73 74
   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
75 76
static struct re_registers search_regs;

Jim Blandy's avatar
Jim Blandy committed
77 78 79 80
/* 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
81

Karl Heuer's avatar
Karl Heuer committed
82
/* error condition signaled when regexp compile_pattern fails */
Jim Blandy's avatar
Jim Blandy committed
83 84 85

Lisp_Object Qinvalid_regexp;

86
static void set_search_regs ();
87
static void save_search_regs ();
88 89
static int simple_search ();
static int boyer_moore ();
90 91
static int search_buffer ();

Jim Blandy's avatar
Jim Blandy committed
92 93 94 95 96 97
static void
matcher_overflow ()
{
  error ("Stack overflow in regexp matcher");
}

98 99 100
/* 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.
101
   TRANSLATE is a translation table for ignoring case, or nil for none.
102 103 104 105 106
   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
107 108 109 110
   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
   sequences of binary data.  */
Jim Blandy's avatar
Jim Blandy committed
111

112
static void
Karl Heuer's avatar
Karl Heuer committed
113
compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte)
114
     struct regexp_cache *cp;
Jim Blandy's avatar
Jim Blandy committed
115
     Lisp_Object pattern;
116
     Lisp_Object translate;
117
     struct re_registers *regp;
118
     int posix;
Karl Heuer's avatar
Karl Heuer committed
119
     int multibyte;
Jim Blandy's avatar
Jim Blandy committed
120
{
121
  unsigned char *raw_pattern;
122
  int raw_pattern_size;
123
  char *val;
124
  reg_syntax_t old;
Jim Blandy's avatar
Jim Blandy committed
125

126 127 128 129 130 131
  /* 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))
    {
132 133
      raw_pattern = (unsigned char *) SDATA (pattern);
      raw_pattern_size = SBYTES (pattern);
134 135 136
    }
  else if (multibyte)
    {
137 138
      raw_pattern_size = count_size_as_multibyte (SDATA (pattern),
						  SCHARS (pattern));
139
      raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1);
140 141
      copy_text (SDATA (pattern), raw_pattern,
		 SCHARS (pattern), 0, 1);
142 143 144 145 146 147 148 149 150
    }
  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.  */
151
      raw_pattern_size = SCHARS (pattern);
152
      raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1);
153 154
      copy_text (SDATA (pattern), raw_pattern,
		 SBYTES (pattern), 1, 0);
155 156
    }

157
  cp->regexp = Qnil;
158
  cp->buf.translate = (! NILP (translate) ? translate : make_number (0));
159
  cp->posix = posix;
Karl Heuer's avatar
Karl Heuer committed
160
  cp->buf.multibyte = multibyte;
161
  BLOCK_INPUT;
162
  old = re_set_syntax (RE_SYNTAX_EMACS
163
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
164 165
  val = (char *) re_compile_pattern ((char *)raw_pattern,
				     raw_pattern_size, &cp->buf);
166
  re_set_syntax (old);
167
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
168
  if (val)
169
    Fsignal (Qinvalid_regexp, Fcons (build_string (val), Qnil));
Jim Blandy's avatar
Jim Blandy committed
170

171 172 173
  cp->regexp = Fcopy_sequence (pattern);
}

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

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

191
/* Compile a regexp if necessary, but first check to see if there's one in
192 193
   the cache.
   PATTERN is the pattern to compile.
194
   TRANSLATE is a translation table for ignoring case, or nil for none.
195 196 197 198 199 200
   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.  */
201 202

struct re_pattern_buffer *
203
compile_pattern (pattern, regp, translate, posix, multibyte)
204 205
     Lisp_Object pattern;
     struct re_registers *regp;
206
     Lisp_Object translate;
207
     int posix, multibyte;
208 209 210 211 212 213
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
214 215
      /* 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
216 217 218
	 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.  */
219
      if (NILP (cp->regexp))
220
	goto compile_it;
221
      if (SCHARS (cp->regexp) == SCHARS (pattern)
222
	  && STRING_MULTIBYTE (cp->regexp) == STRING_MULTIBYTE (pattern)
223
	  && !NILP (Fstring_equal (cp->regexp, pattern))
224
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
225 226
	  && cp->posix == posix
	  && cp->buf.multibyte == multibyte)
227 228
	break;

229 230 231
      /* 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.  */
232 233
      if (cp->next == 0)
	{
234
	compile_it:
Karl Heuer's avatar
Karl Heuer committed
235
	  compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte);
236 237 238 239 240 241 242 243 244 245
	  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
246

247 248 249 250 251
  /* 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);

252
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
253 254 255 256 257 258 259 260 261 262 263 264 265
}

/* Error condition used for failing searches */
Lisp_Object Qsearch_failed;

Lisp_Object
signal_failure (arg)
     Lisp_Object arg;
{
  Fsignal (Qsearch_failed, Fcons (arg, Qnil));
  return Qnil;
}

266 267
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
268
     Lisp_Object string;
269
     int posix;
Jim Blandy's avatar
Jim Blandy committed
270 271 272 273 274
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
275
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
276

277 278 279
  if (running_asynch_code)
    save_search_regs ();

280
  CHECK_STRING (string);
281 282
  bufp = compile_pattern (string, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
283
			   ? DOWNCASE_TABLE : Qnil),
284 285
			  posix,
			  !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
286 287 288 289 290 291 292 293

  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;
294
  s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
295
  p2 = GAP_END_ADDR;
296
  s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
297 298 299
  if (s1 < 0)
    {
      p2 = p1;
300
      s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
301 302 303 304
      s1 = 0;
    }
  if (s2 < 0)
    {
305
      s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
306 307
      s2 = 0;
    }
308 309

  re_match_object = Qnil;
310

311
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
312 313
		  PT_BYTE - BEGV_BYTE, &search_regs,
		  ZV_BYTE - BEGV_BYTE);
314
  immediate_quit = 0;
315

Jim Blandy's avatar
Jim Blandy committed
316 317 318 319
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
320 321 322 323 324 325 326 327 328
  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);
	}
329
  XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
330 331 332
  return val;
}

333
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
334 335 336 337 338
       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)
339
     Lisp_Object regexp;
340
{
341
  return looking_at_1 (regexp, 0);
342 343 344
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
345 346 347 348 349 350
       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)
351
     Lisp_Object regexp;
352
{
353
  return looking_at_1 (regexp, 1);
354 355 356 357
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
358
     Lisp_Object regexp, string, start;
359
     int posix;
Jim Blandy's avatar
Jim Blandy committed
360 361
{
  int val;
362
  struct re_pattern_buffer *bufp;
363 364
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
365

366 367 368
  if (running_asynch_code)
    save_search_regs ();

369 370
  CHECK_STRING (regexp);
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
371 372

  if (NILP (start))
373
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
374 375
  else
    {
376
      int len = SCHARS (string);
Jim Blandy's avatar
Jim Blandy committed
377

378
      CHECK_NUMBER (start);
379 380 381 382
      pos = XINT (start);
      if (pos < 0 && -pos <= len)
	pos = len + pos;
      else if (0 > pos || pos > len)
Jim Blandy's avatar
Jim Blandy committed
383
	args_out_of_range (string, start);
384
      pos_byte = string_char_to_byte (string, pos);
Jim Blandy's avatar
Jim Blandy committed
385 386
    }

387 388
  bufp = compile_pattern (regexp, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
389
			   ? DOWNCASE_TABLE : Qnil),
390 391
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
392
  immediate_quit = 1;
393
  re_match_object = string;
394

395 396 397
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), pos_byte,
		   SBYTES (string) - pos_byte,
Jim Blandy's avatar
Jim Blandy committed
398 399
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
400
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
401 402 403
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
404 405 406 407 408 409 410 411 412 413 414

  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
415
}
Richard M. Stallman's avatar
Richard M. Stallman committed
416

417
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
418 419 420 421 422
       doc: /* Return index of start of first match for REGEXP in STRING, or nil.
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
423 424 425 426
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. */)
427
     (regexp, string, start)
428 429 430 431 432 433
     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,
434 435 436 437 438 439 440 441
       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)
442 443 444 445 446
     Lisp_Object regexp, string, start;
{
  return string_match_1 (regexp, string, start, 1);
}

Richard M. Stallman's avatar
Richard M. Stallman committed
447 448 449 450 451 452 453 454 455
/* 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;
456
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
457

458 459
  bufp = compile_pattern (regexp, 0, Qnil,
			  0, STRING_MULTIBYTE (string));
Richard M. Stallman's avatar
Richard M. Stallman committed
460
  immediate_quit = 1;
461
  re_match_object = string;
462

463 464 465
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), 0,
		   SBYTES (string), 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
466 467 468
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
469 470 471

/* Match REGEXP against STRING, searching all of STRING ignoring case,
   and return the index of the match, or negative on failure.
472 473
   This does not clobber the match data.
   We assume that STRING contains single-byte characters.  */
Karl Heuer's avatar
Karl Heuer committed
474 475 476 477

extern Lisp_Object Vascii_downcase_table;

int
478
fast_c_string_match_ignore_case (regexp, string)
Karl Heuer's avatar
Karl Heuer committed
479
     Lisp_Object regexp;
480
     const char *string;
Karl Heuer's avatar
Karl Heuer committed
481 482 483 484 485
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

486
  regexp = string_make_unibyte (regexp);
487
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
488
  bufp = compile_pattern (regexp, 0,
489
			  Vascii_downcase_table, 0,
490
			  0);
Karl Heuer's avatar
Karl Heuer committed
491 492 493 494 495
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533

/* 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
534 535

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

539 540
   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
541

542 543 544
   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
545
int
546 547 548 549 550
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
551
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
552
{
553
  struct region_cache *newline_cache;
554
  int direction;
Jim Blandy's avatar
Jim Blandy committed
555

556 557 558 559 560 561 562 563 564 565
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
566

567 568
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
569 570 571 572

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

573
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
574

Jim Blandy's avatar
Jim Blandy committed
575
  if (count > 0)
576
    while (start != end)
Jim Blandy's avatar
Jim Blandy committed
577
      {
578 579 580 581 582
        /* 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.  */
583 584
	int ceiling_byte = CHAR_TO_BYTE (end) - 1;
	int start_byte = CHAR_TO_BYTE (start);
585
	int tem;
586 587 588 589 590 591 592 593

        /* 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
594 595
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
596
            immediate_quit = allow_quit;
597

598 599 600
            /* START should never be after END.  */
            if (start_byte > ceiling_byte)
              start_byte = ceiling_byte;
601 602 603

            /* Now the text after start is an unknown region, and
               next_change is the position of the next known region. */
604
            ceiling_byte = min (next_change - 1, ceiling_byte);
605 606 607 608 609 610
          }

        /* 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.  */
611 612
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
613 614

        {
615
          /* The termination address of the dumb loop.  */
616 617 618 619
          register unsigned char *ceiling_addr
	    = BYTE_POS_ADDR (ceiling_byte) + 1;
          register unsigned char *cursor
	    = BYTE_POS_ADDR (start_byte);
620 621 622 623 624 625 626 627 628 629 630 631 632 633
          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,
634 635
                                   start_byte + scan_start - base,
                                   start_byte + cursor - base);
636 637 638 639 640 641 642

              /* Did we find the target character?  */
              if (cursor < ceiling_addr)
                {
                  if (--count == 0)
                    {
                      immediate_quit = 0;
643
                      return BYTE_TO_CHAR (start_byte + cursor - base + 1);
644 645 646 647 648
                    }
                  cursor++;
                }
            }

649
          start = BYTE_TO_CHAR (start_byte + cursor - base);
650
        }
Jim Blandy's avatar
Jim Blandy committed
651 652
      }
  else
653 654 655
    while (start > end)
      {
        /* The last character to check before the next obstacle.  */
656 657
	int ceiling_byte = CHAR_TO_BYTE (end);
	int start_byte = CHAR_TO_BYTE (start);
658
	int tem;
659 660 661 662 663 664 665

        /* Consult the newline cache, if appropriate.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_backward
666 667
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
668
            immediate_quit = allow_quit;
669 670

            /* Start should never be at or before end.  */
671 672
            if (start_byte <= ceiling_byte)
              start_byte = ceiling_byte + 1;
673 674 675

            /* Now the text before start is an unknown region, and
               next_change is the position of the next known region. */
676
            ceiling_byte = max (next_change, ceiling_byte);
677 678 679
          }

        /* Stop scanning before the gap.  */
680 681
	tem = BUFFER_FLOOR_OF (start_byte - 1);
	ceiling_byte = max (tem, ceiling_byte);
682 683 684

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

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

715
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
716 717 718
        }
      }

Jim Blandy's avatar
Jim Blandy committed
719 720
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
721
    *shortage = count * direction;
722
  return start;
Jim Blandy's avatar
Jim Blandy committed
723
}
724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739

/* 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
740
   except in special cases.  */
Jim Blandy's avatar
Jim Blandy committed
741

742
int
743 744 745 746 747
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;
748
{
749 750 751 752 753 754 755 756
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

757 758
  int old_immediate_quit = immediate_quit;

759 760 761
  /* The code that follows is like scan_buffer
     but checks for either newline or carriage return.  */

762 763
  if (allow_quit)
    immediate_quit++;
764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783

  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)
		    {
784
		      immediate_quit = old_immediate_quit;
785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816
		      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)
		    {
817
		      immediate_quit = old_immediate_quit;
818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834
		      /* 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);
835
  immediate_quit = old_immediate_quit;
836 837

  return count * direction;
838 839
}

Jim Blandy's avatar
Jim Blandy committed
840
int
841
find_next_newline_no_quit (from, cnt)
Jim Blandy's avatar
Jim Blandy committed
842 843
     register int from, cnt;
{
844
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
845 846 847 848 849
}

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

851 852
int
find_before_next_newline (from, to, cnt)
853
     int from, to, cnt;
854 855 856 857 858 859
{
  int shortage;
  int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1);

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

861
  return pos;
Jim Blandy's avatar
Jim Blandy committed
862 863 864 865 866
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
867
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
868 869 870
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
871
     int posix;
Jim Blandy's avatar
Jim Blandy committed
872 873
{
  register int np;
874
  int lim, lim_byte;
Jim Blandy's avatar
Jim Blandy committed
875 876 877 878
  int n = direction;

  if (!NILP (count))
    {
879
      CHECK_NUMBER (count);
Jim Blandy's avatar
Jim Blandy committed
880 881 882
      n *= XINT (count);
    }

883
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
884
  if (NILP (bound))
885 886 887 888 889 890
    {
      if (n > 0)
	lim = ZV, lim_byte = ZV_BYTE;
      else
	lim = BEGV, lim_byte = BEGV_BYTE;
    }
Jim Blandy's avatar
Jim Blandy committed
891 892
  else
    {
893
      CHECK_NUMBER_COERCE_MARKER (bound);
Jim Blandy's avatar
Jim Blandy committed
894
      lim = XINT (bound);
895
      if (n > 0 ? lim < PT : lim > PT)
Jim Blandy's avatar
Jim Blandy committed
896 897
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
898
	lim = ZV, lim_byte = ZV_BYTE;
899
      else if (lim < BEGV)
900
	lim = BEGV, lim_byte = BEGV_BYTE;
901 902
      else
	lim_byte = CHAR_TO_BYTE (lim);
Jim Blandy's avatar
Jim Blandy committed
903 904
    }

905
  np = search_buffer (string, PT, PT_BYTE, lim, lim_byte, n, RE,
Jim Blandy's avatar
Jim Blandy committed
906
		      (!NILP (current_buffer->case_fold_search)
907
		       ? current_buffer->case_canon_table
908
		       : Qnil),
Jim Blandy's avatar
Jim Blandy committed
909
		      (!NILP (current_buffer->case_fold_search)
910
		       ? current_buffer->case_eqv_table
911
		       : Qnil),
912
		      posix);
Jim Blandy's avatar
Jim Blandy committed
913 914 915 916 917 918 919 920
  if (np <= 0)
    {
      if (NILP (noerror))
	return signal_failure (string);
      if (!EQ (noerror, Qt))
	{
	  if (lim < BEGV || lim > ZV)
	    abort ();
921
	  SET_PT_BOTH (lim, lim_byte);
922 923 924
	  return Qnil;
#if 0 /* This would be clean, but maybe programs depend on
	 a value of nil here.  */
925
	  np = lim;
926
#endif
Jim Blandy's avatar
Jim Blandy committed
927
	}
928 929
      else
	return Qnil;
Jim Blandy's avatar
Jim Blandy committed
930 931 932 933 934 935 936 937 938 939
    }

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

  SET_PT (np);

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

Karl Heuer's avatar
Karl Heuer committed
942 943 944 945
static int
trivial_regexp_p (regexp)
     Lisp_Object regexp;
{
946 947
  int len = SBYTES (regexp);
  unsigned char *s = SDATA (regexp);
Karl Heuer's avatar
Karl Heuer committed
948 949 950 951 952 953 954 955 956 957 958 959 960
  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':
961
	    case 'S': case '=': case '{': case '}': case '_':
Karl Heuer's avatar
Karl Heuer committed
962
	    case 'c': case 'C':	/* for categoryspec and notcategoryspec */
963
	    case '1': case '2': case '3': case '4': case '5':
Karl Heuer's avatar
Karl Heuer committed
964 965 966 967 968 969 970 971
	    case '6': case '7': case '8': case '9':
	      return 0;
	    }
	}
    }
  return 1;
}

972
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
973
   starting at position POS and stopping at position LIM,
974
   treating STRING as a literal string if RE is false or as
Jim Blandy's avatar
Jim Blandy committed
975 976 977 978 979
   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.

980
   Returns -x if x occurrences remain to be found (x > 0),
Jim Blandy's avatar
Jim Blandy committed
981
   or else the position at the beginning of the Nth occurrence
982 983 984