search.c 79.7 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>
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 100 101 102 103 104 105
static void
matcher_overflow ()
{
  error ("Stack overflow in regexp matcher");
}

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

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

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

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

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

178 179 180 181
  cp->regexp = Fcopy_sequence (pattern);
}

/* Compile a regexp if necessary, but first check to see if there's one in
182 183
   the cache.
   PATTERN is the pattern to compile.
184
   TRANSLATE is a translation table for ignoring case, or nil for none.
185 186 187 188 189 190
   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.  */
191 192

struct re_pattern_buffer *
193
compile_pattern (pattern, regp, translate, posix, multibyte)
194 195
     Lisp_Object pattern;
     struct re_registers *regp;
196
     Lisp_Object translate;
197
     int posix, multibyte;
198 199 200 201 202 203
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
204 205
      if (XSTRING (cp->regexp)->size == XSTRING (pattern)->size
	  && !NILP (Fstring_equal (cp->regexp, pattern))
206
	  && cp->buf.translate == (! NILP (translate) ? translate : 0)
Karl Heuer's avatar
Karl Heuer committed
207 208
	  && cp->posix == posix
	  && cp->buf.multibyte == multibyte)
209 210 211 212 213
	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
214
	  compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte);
215 216 217 218 219 220 221 222 223 224
	  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
225

226 227 228 229 230
  /* 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);

231
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
232 233 234 235 236 237 238 239 240 241 242 243 244
}

/* 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;
}

245 246
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
247
     Lisp_Object string;
248
     int posix;
Jim Blandy's avatar
Jim Blandy committed
249 250 251 252 253
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
254
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
255

256 257 258
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
259
  CHECK_STRING (string, 0);
260 261
  bufp = compile_pattern (string, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
262
			   ? DOWNCASE_TABLE : Qnil),
263 264
			  posix,
			  !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
265 266 267 268 269 270 271 272

  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;
273
  s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
274
  p2 = GAP_END_ADDR;
275
  s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
276 277 278
  if (s1 < 0)
    {
      p2 = p1;
279
      s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
280 281 282 283
      s1 = 0;
    }
  if (s2 < 0)
    {
284
      s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
285 286
      s2 = 0;
    }
287 288

  re_match_object = Qnil;
Jim Blandy's avatar
Jim Blandy committed
289
  
290
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
291 292
		  PT_BYTE - BEGV_BYTE, &search_regs,
		  ZV_BYTE - BEGV_BYTE);
Jim Blandy's avatar
Jim Blandy committed
293 294 295 296
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
297 298 299 300 301 302 303 304 305
  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);
	}
306
  XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
307 308 309 310
  immediate_quit = 0;
  return val;
}

311
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
312
  "Return t if text after point matches regular expression REGEXP.\n\
313 314 315
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.")
316 317
  (regexp)
     Lisp_Object regexp;
318
{
319
  return looking_at_1 (regexp, 0);
320 321 322
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
323
  "Return t if text after point matches regular expression REGEXP.\n\
324 325 326 327
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.")
328 329
  (regexp)
     Lisp_Object regexp;
330
{
331
  return looking_at_1 (regexp, 1);
332 333 334 335
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
336
     Lisp_Object regexp, string, start;
337
     int posix;
Jim Blandy's avatar
Jim Blandy committed
338 339
{
  int val;
340
  struct re_pattern_buffer *bufp;
341 342
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
343

344 345 346
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
347 348 349 350
  CHECK_STRING (regexp, 0);
  CHECK_STRING (string, 1);

  if (NILP (start))
351
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
352 353 354 355 356
  else
    {
      int len = XSTRING (string)->size;

      CHECK_NUMBER (start, 2);
357 358 359 360
      pos = XINT (start);
      if (pos < 0 && -pos <= len)
	pos = len + pos;
      else if (0 > pos || pos > len)
Jim Blandy's avatar
Jim Blandy committed
361
	args_out_of_range (string, start);
362
      pos_byte = string_char_to_byte (string, pos);
Jim Blandy's avatar
Jim Blandy committed
363 364
    }

365 366
  bufp = compile_pattern (regexp, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
367
			   ? DOWNCASE_TABLE : Qnil),
368 369
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
370
  immediate_quit = 1;
371 372
  re_match_object = string;
  
373
  val = re_search (bufp, (char *) XSTRING (string)->data,
374 375
		   STRING_BYTES (XSTRING (string)), pos_byte,
		   STRING_BYTES (XSTRING (string)) - pos_byte,
Jim Blandy's avatar
Jim Blandy committed
376 377
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
378
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
379 380 381
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
382 383 384 385 386 387 388 389 390 391 392

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

395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
  "Return index of start of first match for REGEXP in STRING, or nil.\n\
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\
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
420 421 422 423 424 425 426 427 428
/* 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;
429
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
430

431 432
  bufp = compile_pattern (regexp, 0, Qnil,
			  0, STRING_MULTIBYTE (string));
Richard M. Stallman's avatar
Richard M. Stallman committed
433
  immediate_quit = 1;
434 435
  re_match_object = string;
  
436
  val = re_search (bufp, (char *) XSTRING (string)->data,
437 438
		   STRING_BYTES (XSTRING (string)), 0,
		   STRING_BYTES (XSTRING (string)), 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
439 440 441
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
442 443 444

/* Match REGEXP against STRING, searching all of STRING ignoring case,
   and return the index of the match, or negative on failure.
445 446
   This does not clobber the match data.
   We assume that STRING contains single-byte characters.  */
Karl Heuer's avatar
Karl Heuer committed
447 448 449 450

extern Lisp_Object Vascii_downcase_table;

int
451
fast_c_string_match_ignore_case (regexp, string)
Karl Heuer's avatar
Karl Heuer committed
452 453 454 455 456 457 458
     Lisp_Object regexp;
     char *string;
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

459
  regexp = string_make_unibyte (regexp);
460
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
461
  bufp = compile_pattern (regexp, 0,
462
			  Vascii_downcase_table, 0,
463
			  0);
Karl Heuer's avatar
Karl Heuer committed
464 465 466 467 468
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506

/* 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
507 508

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

512 513
   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
514

515 516 517
   If ALLOW_QUIT is non-zero, set immediate_quit.  That's good to do
   except when inside redisplay.  */

518 519 520 521 522
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
523
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
524
{
525 526
  struct region_cache *newline_cache;
  int direction; 
Jim Blandy's avatar
Jim Blandy committed
527

528 529 530 531 532 533 534 535 536 537
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
538

539 540
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
541 542 543 544

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

545
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
546

Jim Blandy's avatar
Jim Blandy committed
547
  if (count > 0)
548
    while (start != end)
Jim Blandy's avatar
Jim Blandy committed
549
      {
550 551 552 553 554
        /* 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.  */
555 556
	int ceiling_byte = CHAR_TO_BYTE (end) - 1;
	int start_byte = CHAR_TO_BYTE (start);
557
	int tem;
558 559 560 561 562 563 564 565

        /* 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
566 567
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
568
            immediate_quit = allow_quit;
569

570 571 572
            /* START should never be after END.  */
            if (start_byte > ceiling_byte)
              start_byte = ceiling_byte;
573 574 575

            /* Now the text after start is an unknown region, and
               next_change is the position of the next known region. */
576
            ceiling_byte = min (next_change - 1, ceiling_byte);
577 578 579 580 581 582
          }

        /* 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.  */
583 584
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
585 586 587

        {
          /* The termination address of the dumb loop.  */ 
588 589 590 591
          register unsigned char *ceiling_addr
	    = BYTE_POS_ADDR (ceiling_byte) + 1;
          register unsigned char *cursor
	    = BYTE_POS_ADDR (start_byte);
592 593 594 595 596 597 598 599 600 601 602 603 604 605
          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,
606 607
                                   start_byte + scan_start - base,
                                   start_byte + cursor - base);
608 609 610 611 612 613 614

              /* Did we find the target character?  */
              if (cursor < ceiling_addr)
                {
                  if (--count == 0)
                    {
                      immediate_quit = 0;
615
                      return BYTE_TO_CHAR (start_byte + cursor - base + 1);
616 617 618 619 620
                    }
                  cursor++;
                }
            }

621
          start = BYTE_TO_CHAR (start_byte + cursor - base);
622
        }
Jim Blandy's avatar
Jim Blandy committed
623 624
      }
  else
625 626 627
    while (start > end)
      {
        /* The last character to check before the next obstacle.  */
628 629
	int ceiling_byte = CHAR_TO_BYTE (end);
	int start_byte = CHAR_TO_BYTE (start);
630
	int tem;
631 632 633 634 635 636 637

        /* Consult the newline cache, if appropriate.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_backward
638 639
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
640
            immediate_quit = allow_quit;
641 642

            /* Start should never be at or before end.  */
643 644
            if (start_byte <= ceiling_byte)
              start_byte = ceiling_byte + 1;
645 646 647

            /* Now the text before start is an unknown region, and
               next_change is the position of the next known region. */
648
            ceiling_byte = max (next_change, ceiling_byte);
649 650 651
          }

        /* Stop scanning before the gap.  */
652 653
	tem = BUFFER_FLOOR_OF (start_byte - 1);
	ceiling_byte = max (tem, ceiling_byte);
654 655 656

        {
          /* The termination address of the dumb loop.  */
657 658
          register unsigned char *ceiling_addr = BYTE_POS_ADDR (ceiling_byte);
          register unsigned char *cursor = BYTE_POS_ADDR (start_byte - 1);
659 660 661 662 663 664 665 666 667 668 669 670 671
          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,
672 673
                                   start_byte + cursor - base,
                                   start_byte + scan_start - base);
674 675 676 677 678 679 680

              /* Did we find the target character?  */
              if (cursor >= ceiling_addr)
                {
                  if (++count >= 0)
                    {
                      immediate_quit = 0;
681
                      return BYTE_TO_CHAR (start_byte + cursor - base);
682 683 684 685 686
                    }
                  cursor--;
                }
            }

687
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
688 689 690
        }
      }

Jim Blandy's avatar
Jim Blandy committed
691 692
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
693
    *shortage = count * direction;
694
  return start;
Jim Blandy's avatar
Jim Blandy committed
695
}
696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711

/* 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
712
   except in special cases.  */
Jim Blandy's avatar
Jim Blandy committed
713

714
int
715 716 717 718 719
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;
720
{
721 722 723 724 725 726 727 728
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

729 730
  int old_immediate_quit = immediate_quit;

731 732 733 734 735 736 737 738
  /* 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.  */

739 740
  if (allow_quit)
    immediate_quit++;
741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760

  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)
		    {
761
		      immediate_quit = old_immediate_quit;
762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793
		      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)
		    {
794
		      immediate_quit = old_immediate_quit;
795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811
		      /* 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);
812
  immediate_quit = old_immediate_quit;
813 814

  return count * direction;
815 816
}

Jim Blandy's avatar
Jim Blandy committed
817
int
818
find_next_newline_no_quit (from, cnt)
Jim Blandy's avatar
Jim Blandy committed
819 820
     register int from, cnt;
{
821
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
822 823 824 825 826
}

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

828 829
int
find_before_next_newline (from, to, cnt)
830
     int from, to, cnt;
831 832 833 834 835 836 837 838
{
  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
839 840 841 842 843
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
844
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
845 846 847
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
848
     int posix;
Jim Blandy's avatar
Jim Blandy committed
849 850
{
  register int np;
851
  int lim, lim_byte;
Jim Blandy's avatar
Jim Blandy committed
852 853 854 855 856 857 858 859 860 861
  int n = direction;

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

  CHECK_STRING (string, 0);
  if (NILP (bound))
862 863 864 865 866 867
    {
      if (n > 0)
	lim = ZV, lim_byte = ZV_BYTE;
      else
	lim = BEGV, lim_byte = BEGV_BYTE;
    }
Jim Blandy's avatar
Jim Blandy committed
868 869 870 871
  else
    {
      CHECK_NUMBER_COERCE_MARKER (bound, 1);
      lim = XINT (bound);
872
      if (n > 0 ? lim < PT : lim > PT)
Jim Blandy's avatar
Jim Blandy committed
873 874
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
875
	lim = ZV, lim_byte = ZV_BYTE;
876
      else if (lim < BEGV)
877
	lim = BEGV, lim_byte = BEGV_BYTE;
878 879
      else
	lim_byte = CHAR_TO_BYTE (lim);
Jim Blandy's avatar
Jim Blandy committed
880 881
    }

882
  np = search_buffer (string, PT, PT_BYTE, lim, lim_byte, n, RE,
Jim Blandy's avatar
Jim Blandy committed
883
		      (!NILP (current_buffer->case_fold_search)
884
		       ? current_buffer->case_canon_table
885
		       : Qnil),
Jim Blandy's avatar
Jim Blandy committed
886
		      (!NILP (current_buffer->case_fold_search)
887
		       ? current_buffer->case_eqv_table
888
		       : Qnil),
889
		      posix);
Jim Blandy's avatar
Jim Blandy committed
890 891 892 893 894 895 896 897
  if (np <= 0)
    {
      if (NILP (noerror))
	return signal_failure (string);
      if (!EQ (noerror, Qt))
	{
	  if (lim < BEGV || lim > ZV)
	    abort ();
898
	  SET_PT_BOTH (lim, lim_byte);
899 900 901
	  return Qnil;
#if 0 /* This would be clean, but maybe programs depend on
	 a value of nil here.  */
902
	  np = lim;
903
#endif
Jim Blandy's avatar
Jim Blandy committed
904
	}
905 906
      else
	return Qnil;
Jim Blandy's avatar
Jim Blandy committed
907 908 909 910 911 912 913 914 915 916
    }

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

  SET_PT (np);

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

Karl Heuer's avatar
Karl Heuer committed
919 920 921 922
static int
trivial_regexp_p (regexp)
     Lisp_Object regexp;
{
923
  int len = STRING_BYTES (XSTRING (regexp));
Karl Heuer's avatar
Karl Heuer committed
924 925 926 927 928 929 930 931 932 933 934 935 936 937 938
  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':
939
	    case 'S': case '=':
Karl Heuer's avatar
Karl Heuer committed
940
	    case 'c': case 'C':	/* for categoryspec and notcategoryspec */
941
	    case '1': case '2': case '3': case '4': case '5':
Karl Heuer's avatar
Karl Heuer committed
942 943 944 945 946 947 948 949
	    case '6': case '7': case '8': case '9':
	      return 0;
	    }
	}
    }
  return 1;
}

950
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
951
   starting at position POS and stopping at position LIM,
952
   treating STRING as a literal string if RE is false or as
Jim Blandy's avatar
Jim Blandy committed
953 954 955 956 957
   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.

958
   Returns -x if x occurrences remain to be found (x > 0),
Jim Blandy's avatar
Jim Blandy committed
959
   or else the position at the beginning of the Nth occurrence
960 961 962 963
   (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
964

965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980
#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)
981

982
static int
983 984
search_buffer (string, pos, pos_byte, lim, lim_byte, n,
	       RE, trt, inverse_trt, posix)
Jim Blandy's avatar
Jim Blandy committed
985 986
     Lisp_Object string;
     int pos;
987
     int pos_byte;
Jim Blandy's avatar
Jim Blandy committed
988
     int lim;
989
     int lim_byte;
Jim Blandy's avatar
Jim Blandy committed
990 991
     int n;
     int RE;
992 993
     Lisp_Object trt;
     Lisp_Object inverse_trt;
994
     int posix;
Jim Blandy's avatar
Jim Blandy committed
995 996
{
  int len = XSTRING (string)->size;
997
  int len_byte = STRING_BYTES (XSTRING (string));
998
  register int i;
Jim Blandy's avatar
Jim Blandy committed
999

1000 1001 1002
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
1003
  /* Null string is found at starting position.  */
1004
  if (len == 0)
1005 1006 1007 1008
    {
      set_search_regs (pos, 0);
      return pos;
    }
1009 1010 1011

  /* Searching 0 times means don't move.  */
  if (n == 0)
Jim Blandy's avatar
Jim Blandy committed
1012 1013
    return pos;

Karl Heuer's avatar
Karl Heuer committed
1014
  if (RE && !trivial_regexp_p (string))
Jim Blandy's avatar
Jim Blandy committed
1015
    {
1016 1017
      unsigned char *p1, *p2;
      int s1, s2;
1018 1019
      struct re_pattern_buffer *bufp;

1020 1021
      bufp = compile_pattern (string, &search_regs, trt, posix,
			      !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
1022 1023 1024 1025 1026 1027 1028 1029 1030 1031

      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;
1032
      s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1033
      p2 = GAP_END_ADDR;
1034
      s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1035 1036 1037
      if (s1 < 0)
	{
	  p2 = p1;
1038
	  s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1039 1040 1041 1042
	  s1 = 0;
	}
      if (s2 < 0)
	{
1043
	  s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1044 1045
	  s2 = 0;
	}
1046 1047
      re_match_object = Qnil;
  
Jim Blandy's avatar
Jim Blandy committed
1048 1049
      while (n < 0)
	{
1050
	  int val;
1051
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,
1052 1053
			     pos_byte - BEGV_BYTE, lim_byte - pos_byte,
			     &search_regs,
1054
			     /* Don't allow match past current point */
1055
			     pos_byte - BEGV_BYTE);
Jim Blandy's avatar
Jim Blandy committed
1056
	  if (val == -2)
Karl Heuer's avatar
Karl Heuer committed
1057 1058 1059
	    {
	      matcher_overflow ();
	    }
Jim Blandy's avatar
Jim Blandy committed
1060 1061
	  if (val >= 0)
	    {
1062
	      pos_byte = search_regs.start[0] + BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1063
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
1064 1065
		if (search_regs.start[i] >= 0)
		  {
1066 1067