search.c 84 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* String search routines for GNU Emacs.
2
   Copyright (C) 1985, 86,87,93,94,97,98, 1999 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5 6 7

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
8
the Free Software Foundation; either version 2, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
9 10 11 12 13 14 15 16 17
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
18 19
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
20 21


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

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

36 37 38
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))

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 46 47 48
  struct regexp_cache *next;
  Lisp_Object regexp;
  struct re_pattern_buffer buf;
  char fastmap[0400];
49 50
  /* Nonzero means regexp was compiled to do full POSIX backtracking.  */
  char posix;
51
};
Jim Blandy's avatar
Jim Blandy committed
52

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

56 57
/* 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
58 59


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

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

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

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

Lisp_Object Qinvalid_regexp;

88
static void set_search_regs ();
89
static void save_search_regs ();
90 91
static int simple_search ();
static int boyer_moore ();
92 93
static int search_buffer ();

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

100 101 102
/* 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.
103
   TRANSLATE is a translation table for ignoring case, or nil for none.
104 105 106 107 108
   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
109 110 111 112
   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
113

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

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

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

173 174 175
  cp->regexp = Fcopy_sequence (pattern);
}

176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
/* 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 ()
{
  struct regexp_cache *cp, **cpp;

  for (cp = searchbuf_head; cp != 0; cp = cp->next)
    {
      cp->buf.allocated = cp->buf.used;
      cp->buf.buffer
	= (unsigned char *) realloc (cp->buf.buffer, cp->buf.used);
    }
}

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

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

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
216 217 218 219 220
      /* Entries are initialized to nil, and may be set to nil by
	 compile_pattern_1 if the pattern isn't valid.  Don't apply
	 XSTRING 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.  */
221
      if (NILP (cp->regexp))
222
	goto compile_it;
223
      if (XSTRING (cp->regexp)->size == XSTRING (pattern)->size
224
	  && STRING_MULTIBYTE (cp->regexp) == STRING_MULTIBYTE (pattern)
225
	  && !NILP (Fstring_equal (cp->regexp, pattern))
226
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
227 228
	  && cp->posix == posix
	  && cp->buf.multibyte == multibyte)
229 230
	break;

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

249 250 251 252 253
  /* 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);

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

/* 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;
}

268 269
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
270
     Lisp_Object string;
271
     int posix;
Jim Blandy's avatar
Jim Blandy committed
272 273 274 275 276
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
277
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
278

279 280 281
  if (running_asynch_code)
    save_search_regs ();

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

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

  re_match_object = Qnil;
Jim Blandy's avatar
Jim Blandy committed
312
  
313
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
314 315
		  PT_BYTE - BEGV_BYTE, &search_regs,
		  ZV_BYTE - BEGV_BYTE);
316 317
  immediate_quit = 0;
  
Jim Blandy's avatar
Jim Blandy committed
318 319 320 321
  if (i == -2)
    matcher_overflow ();

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

335
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
336
  "Return t if text after point matches regular expression REGEXP.\n\
337 338 339
This function modifies the match data that `match-beginning',\n\
`match-end' and `match-data' access; save and restore the match\n\
data if you want to preserve them.")
340 341
  (regexp)
     Lisp_Object regexp;
342
{
343
  return looking_at_1 (regexp, 0);
344 345 346
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
347
  "Return t if text after point matches regular expression REGEXP.\n\
348 349 350 351
Find the longest match, in accord with Posix regular expression rules.\n\
This function modifies the match data that `match-beginning',\n\
`match-end' and `match-data' access; save and restore the match\n\
data if you want to preserve them.")
352 353
  (regexp)
     Lisp_Object regexp;
354
{
355
  return looking_at_1 (regexp, 1);
356 357 358 359
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
360
     Lisp_Object regexp, string, start;
361
     int posix;
Jim Blandy's avatar
Jim Blandy committed
362 363
{
  int val;
364
  struct re_pattern_buffer *bufp;
365 366
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
367

368 369 370
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
371 372 373 374
  CHECK_STRING (regexp, 0);
  CHECK_STRING (string, 1);

  if (NILP (start))
375
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
376 377 378 379 380
  else
    {
      int len = XSTRING (string)->size;

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

389 390
  bufp = compile_pattern (regexp, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
391
			   ? DOWNCASE_TABLE : Qnil),
392 393
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
394
  immediate_quit = 1;
395 396
  re_match_object = string;
  
397
  val = re_search (bufp, (char *) XSTRING (string)->data,
398 399
		   STRING_BYTES (XSTRING (string)), pos_byte,
		   STRING_BYTES (XSTRING (string)) - pos_byte,
Jim Blandy's avatar
Jim Blandy committed
400 401
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
402
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
403 404 405
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
406 407 408 409 410 411 412 413 414 415 416

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

419 420
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
  "Return index of start of first match for REGEXP in STRING, or nil.\n\
421
Case is ignored if `case-fold-search' is non-nil in the current buffer.\n\
422 423 424 425 426 427 428 429 430 431 432 433 434
If third arg START is non-nil, start search at that index in STRING.\n\
For index of first char beyond the match, do (match-end 0).\n\
`match-end' and `match-beginning' also give indices of substrings\n\
matched by parenthesis constructs in the pattern.")
  (regexp, string, start)
     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,
  "Return index of start of first match for REGEXP in STRING, or nil.\n\
Find the longest match, in accord with Posix regular expression rules.\n\
435
Case is ignored if `case-fold-search' is non-nil in the current buffer.\n\
436 437 438 439 440 441 442 443 444 445
If third arg START is non-nil, start search at that index in STRING.\n\
For index of first char beyond the match, do (match-end 0).\n\
`match-end' and `match-beginning' also give indices of substrings\n\
matched by parenthesis constructs in the pattern.")
  (regexp, string, start)
     Lisp_Object regexp, string, start;
{
  return string_match_1 (regexp, string, start, 1);
}

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

457 458
  bufp = compile_pattern (regexp, 0, Qnil,
			  0, STRING_MULTIBYTE (string));
Richard M. Stallman's avatar
Richard M. Stallman committed
459
  immediate_quit = 1;
460 461
  re_match_object = string;
  
462
  val = re_search (bufp, (char *) XSTRING (string)->data,
463 464
		   STRING_BYTES (XSTRING (string)), 0,
		   STRING_BYTES (XSTRING (string)), 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
465 466 467
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
468 469 470

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

extern Lisp_Object Vascii_downcase_table;

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

485
  regexp = string_make_unibyte (regexp);
486
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
487
  bufp = compile_pattern (regexp, 0,
488
			  Vascii_downcase_table, 0,
489
			  0);
Karl Heuer's avatar
Karl Heuer committed
490 491 492 493 494
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
495 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

/* 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
533 534

   If we find COUNT instances, set *SHORTAGE to zero, and return the
Richard M. Stallman's avatar
Richard M. Stallman committed
535 536
   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
537

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

              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,
699 700
                                   start_byte + cursor - base,
                                   start_byte + scan_start - base);
701 702 703 704 705 706 707

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

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

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

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

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

756 757
  int old_immediate_quit = immediate_quit;

758 759 760 761 762 763 764 765
  /* If we are not in selective display mode,
     check only for newlines.  */
  int selective_display = (!NILP (current_buffer->selective_display)
			   && !INTEGERP (current_buffer->selective_display));

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

766 767
  if (allow_quit)
    immediate_quit++;
768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787

  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)
		    {
788
		      immediate_quit = old_immediate_quit;
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 817 818 819 820
		      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)
		    {
821
		      immediate_quit = old_immediate_quit;
822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838
		      /* 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);
839
  immediate_quit = old_immediate_quit;
840 841

  return count * direction;
842 843
}

Jim Blandy's avatar
Jim Blandy committed
844
int
845
find_next_newline_no_quit (from, cnt)
Jim Blandy's avatar
Jim Blandy committed
846 847
     register int from, cnt;
{
848
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
849 850 851 852 853
}

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

855 856
int
find_before_next_newline (from, to, cnt)
857
     int from, to, cnt;
858 859 860 861 862 863 864 865
{
  int shortage;
  int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1);

  if (shortage == 0)
    pos--;
  
  return pos;
Jim Blandy's avatar
Jim Blandy committed
866 867 868 869 870
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
871
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
872 873 874
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
875
     int posix;
Jim Blandy's avatar
Jim Blandy committed
876 877
{
  register int np;
878
  int lim, lim_byte;
Jim Blandy's avatar
Jim Blandy committed
879 880 881 882 883 884 885 886 887 888
  int n = direction;

  if (!NILP (count))
    {
      CHECK_NUMBER (count, 3);
      n *= XINT (count);
    }

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

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

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

  SET_PT (np);

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

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

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

985
   Returns -x if x occurrences remain to be found (x > 0),
Jim Blandy's avatar
Jim Blandy committed
986
   or else the position at the beginning of the Nth occurrence
987 988 989 990
   (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
991

992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007
#define TRANSLATE(out, trt, d)			\
do						\
  {						\
    if (! NILP (trt))				\
      {						\
	Lisp_Object temp;			\
	temp = Faref (trt, make_number (d));	\
	if (INTEGERP (temp))			\
	  out = XINT (temp);			\
	else					\
	  out = d;				\
      }						\
    else					\
      out = d;					\
  }						\
while (0)
1008

1009
static int
1010 1011
search_buffer (string, pos, pos_byte, lim, lim_byte, n,
	       RE, trt, inverse_trt, posix)
Jim Blandy's avatar
Jim Blandy committed
1012 1013
     Lisp_Object string;
     int pos;
1014
     int pos_byte;
Jim Blandy's avatar
Jim Blandy committed
1015
     int lim;
1016
     int lim_byte;
Jim Blandy's avatar
Jim Blandy committed
1017 1018
     int n;
     int RE;
1019