search.c 81.2 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* String search routines for GNU Emacs.
Richard M. Stallman's avatar
Richard M. Stallman committed
2
   Copyright (C) 1985, 86, 87, 93, 94, 97, 1998 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>
Andreas Schwab's avatar
Andreas Schwab committed
23 24 25
#ifdef STDC_HEADERS
#include <stdlib.h>
#endif
Jim Blandy's avatar
Jim Blandy committed
26 27
#include "lisp.h"
#include "syntax.h"
Karl Heuer's avatar
Karl Heuer committed
28
#include "category.h"
Jim Blandy's avatar
Jim Blandy committed
29
#include "buffer.h"
Karl Heuer's avatar
Karl Heuer committed
30
#include "charset.h"
31
#include "region-cache.h"
Jim Blandy's avatar
Jim Blandy committed
32
#include "commands.h"
33
#include "blockinput.h"
34
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
35

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

39 40 41
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))

42
#define REGEXP_CACHE_SIZE 20
Jim Blandy's avatar
Jim Blandy committed
43

44 45
/* If the regexp is non-nil, then the buffer contains the compiled form
   of that regexp, suitable for searching.  */
46 47
struct regexp_cache
{
48 49 50 51
  struct regexp_cache *next;
  Lisp_Object regexp;
  struct re_pattern_buffer buf;
  char fastmap[0400];
52 53
  /* Nonzero means regexp was compiled to do full POSIX backtracking.  */
  char posix;
54
};
Jim Blandy's avatar
Jim Blandy committed
55

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

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


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

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

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

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

Lisp_Object Qinvalid_regexp;

91
static void set_search_regs ();
92
static void save_search_regs ();
93 94
static int simple_search ();
static int boyer_moore ();
95 96
static int search_buffer ();

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

#ifdef __STDC__
#define CONST const
#else
#define CONST
#endif

109 110 111
/* 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.
112
   TRANSLATE is a translation table for ignoring case, or nil for none.
113 114 115 116 117
   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
118 119 120 121
   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
122

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

137 138 139 140 141 142
  /* 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))
    {
143
      raw_pattern = (unsigned char *) XSTRING (pattern)->data;
144
      raw_pattern_size = STRING_BYTES (XSTRING (pattern));
145 146 147 148 149
    }
  else if (multibyte)
    {
      raw_pattern_size = count_size_as_multibyte (XSTRING (pattern)->data,
						  XSTRING (pattern)->size);
150
      raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1);
151 152 153 154 155 156 157 158 159 160 161 162
      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;
163
      raw_pattern = (unsigned char *) alloca (raw_pattern_size + 1);
164
      copy_text (XSTRING (pattern)->data, raw_pattern,
165
		 STRING_BYTES (XSTRING (pattern)), 1, 0);
166 167
    }

168
  cp->regexp = Qnil;
169
  cp->buf.translate = (! NILP (translate) ? translate : make_number (0));
170
  cp->posix = posix;
Karl Heuer's avatar
Karl Heuer committed
171
  cp->buf.multibyte = multibyte;
172
  BLOCK_INPUT;
173 174
  old = re_set_syntax (RE_SYNTAX_EMACS
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
175 176
  val = (char *) re_compile_pattern ((char *)raw_pattern,
				     raw_pattern_size, &cp->buf);
177
  re_set_syntax (old);
178
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
179
  if (val)
180
    Fsignal (Qinvalid_regexp, Fcons (build_string (val), Qnil));
Jim Blandy's avatar
Jim Blandy committed
181

182 183 184
  cp->regexp = Fcopy_sequence (pattern);
}

185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201
/* 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);
    }
}

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

struct re_pattern_buffer *
214
compile_pattern (pattern, regp, translate, posix, multibyte)
215 216
     Lisp_Object pattern;
     struct re_registers *regp;
217
     Lisp_Object translate;
218
     int posix, multibyte;
219 220 221 222 223 224
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
225 226
      if (XSTRING (cp->regexp)->size == XSTRING (pattern)->size
	  && !NILP (Fstring_equal (cp->regexp, pattern))
227
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
228 229
	  && cp->posix == posix
	  && cp->buf.multibyte == multibyte)
230 231 232 233 234
	break;

      /* If we're at the end of the cache, compile into the last cell.  */
      if (cp->next == 0)
	{
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 ();

Jim Blandy's avatar
Jim Blandy committed
280
  CHECK_STRING (string, 0);
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;
Jim Blandy's avatar
Jim Blandy committed
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);
Jim Blandy's avatar
Jim Blandy committed
314 315 316 317
  if (i == -2)
    matcher_overflow ();

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

332
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
333
  "Return t if text after point matches regular expression REGEXP.\n\
334 335 336
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.")
337 338
  (regexp)
     Lisp_Object regexp;
339
{
340
  return looking_at_1 (regexp, 0);
341 342 343
}

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

365 366 367
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
368 369 370 371
  CHECK_STRING (regexp, 0);
  CHECK_STRING (string, 1);

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

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

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

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

416 417
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
  "Return index of start of first match for REGEXP in STRING, or nil.\n\
418
Case is ignored if `case-fold-search' is non-nil in the current buffer.\n\
419 420 421 422 423 424 425 426 427 428 429 430 431
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\
432
Case is ignored if `case-fold-search' is non-nil in the current buffer.\n\
433 434 435 436 437 438 439 440 441 442
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
443 444 445 446 447 448 449 450 451
/* 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;
452
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
453

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

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

extern Lisp_Object Vascii_downcase_table;

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

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

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

535 536
   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
537

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

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

563 564
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
565 566 567 568

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

569
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
570

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

        /* 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
590 591
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
592
            immediate_quit = allow_quit;
593

594 595 596
            /* START should never be after END.  */
            if (start_byte > ceiling_byte)
              start_byte = ceiling_byte;
597 598 599

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

        /* 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.  */
607 608
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
609 610 611

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

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

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

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

            /* Start should never be at or before end.  */
667 668
            if (start_byte <= ceiling_byte)
              start_byte = ceiling_byte + 1;
669 670 671

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

        /* Stop scanning before the gap.  */
676 677
	tem = BUFFER_FLOOR_OF (start_byte - 1);
	ceiling_byte = max (tem, ceiling_byte);
678 679 680

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

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

711
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
712 713 714
        }
      }

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

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

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

753 754
  int old_immediate_quit = immediate_quit;

755 756 757 758 759 760 761 762
  /* 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.  */

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

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

  return count * direction;
839 840
}

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

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

852 853
int
find_before_next_newline (from, to, cnt)
854
     int from, to, cnt;
855 856 857 858 859 860 861 862
{
  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
863 864 865 866 867
}

/* Subroutines of Lisp buffer search functions. */

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

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

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

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

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

  SET_PT (np);

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

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

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

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

989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004
#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)
1005

1006
static int
1007 1008
search_buffer (string, pos, pos_byte, lim, lim_byte, n,
	       RE, trt, inverse_trt, posix)
Jim Blandy's avatar
Jim Blandy committed
1009 1010
     Lisp_Object string;
     int pos;
1011
     int pos_byte;
Jim Blandy's avatar
Jim Blandy committed
1012
     int lim;
1013
     int lim_byte;
Jim Blandy's avatar
Jim Blandy committed
1014 1015
     int n;
     int RE;
1016 1017
     Lisp_Object trt;
     Lisp_Object inverse_trt;
1018
     int posix;
Jim Blandy's avatar
Jim Blandy committed
1019 1020
{
  int len = XSTRING (string)->size;
1021
  int len_byte = STRING_BYTES (XSTRING (string));
1022
  register int i;
Jim Blandy's avatar
Jim Blandy committed
1023

1024 1025 1026
  if (running_asynch_code)
    save_search_regs ();

1027
  /* Searching 0 times means don't move.  */
Jim Blandy's avatar
Jim Blandy committed
1028
  /* Null string is found at starting position.  */
1029
  if (len == 0 || n == 0)
1030 1031 1032 1033
    {
      set_search_regs (pos, 0);
      return pos;
    }
1034

Karl Heuer's avatar
Karl Heuer committed
1035
  if (RE && !trivial_regexp_p (string))
Jim Blandy's avatar
Jim Blandy committed
1036
    {
1037 1038
      unsigned char *p1, *p2;
      int s1, s2;
1039 1040
      struct re_pattern_buffer *bufp;

1041 1042
      bufp = compile_pattern (string, &search_regs, trt, posix,
			      !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
1043 1044 1045 1046 1047 1048 1049 1050 1051 1052

      immediate_quit = 1;	/* Quit immediately if user types ^G,
				   because letting this function finish
				   can take too long. */
      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;
1053
      s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1054
      p2 = GAP_END_ADDR;
1055
      s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1056 1057 1058
      if (s1 < 0)
	{
	  p2 = p1;
1059
	  s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1060 1061 1062 1063
	  s1 = 0;
	}
      if (s2 < 0)
	{
1064
	  s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1065 1066
	  s2 = 0;
	}
1067 1068
      re_match_object = Qnil;
  
Jim Blandy's avatar
Jim Blandy committed
1069 1070
      while (n < 0)
	{
1071
	  int val;
1072
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,
1073 1074
			     pos_byte - BEGV_BYTE, lim_byte - pos_byte,
			     &search_regs,
1075
			     /* Don't allow match past current point */
1076
			     pos_byte - BEGV_BYTE);
Jim Blandy's avatar
Jim Blandy committed
1077
	  if (val == -2)
Karl Heuer's avatar
Karl Heuer committed
1078 1079 1080
	    {
	      matcher_overflow ();
	    }
Jim Blandy's avatar
Jim Blandy committed
1081 1082
	  if (val >= 0)
	    {
1083
	      pos_byte = search_regs.start[0] + BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1084
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
1085 1086
		if (search_regs.start[i] >= 0)
		  {
1087 1088 1089 1090
		    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);
Jim Blandy's avatar
Jim Blandy committed
1091
		  }
1092
	      XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104
	      /* Set pos to the new position. */
	      pos = search_regs.start[0];
	    }
	  else
	    {
	      immediate_quit = 0;
	      return (n);
	    }
	  n++;
	}
      while (n > 0)
	{
1105
	  int val;
1106
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,