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

This file is part of GNU Emacs.

GNU Emacs is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
Karl Heuer's avatar
Karl Heuer committed
9
the Free Software Foundation; either version 2, or (at your option)
Jim Blandy's avatar
Jim Blandy committed
10 11 12 13 14 15 16 17 18
any later version.

GNU Emacs is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Emacs; see the file COPYING.  If not, write to
19 20
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
21 22


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

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

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

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

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

54 55
/* The head of the linked list; points to the most recently used buffer.  */
struct regexp_cache *searchbuf_head;
Jim Blandy's avatar
Jim Blandy committed
56 57


Jim Blandy's avatar
Jim Blandy committed
58 59 60 61 62 63 64
/* Every call to re_match, etc., must pass &search_regs as the regs
   argument unless you can show it is unnecessary (i.e., if re_match
   is certainly going to be called again before region-around-match
   can be called).

   Since the registers are now dynamically allocated, we need to make
   sure not to refer to the Nth register before checking that it has
Jim Blandy's avatar
Jim Blandy committed
65 66 67
   been allocated by checking search_regs.num_regs.

   The regex code keeps track of whether it has allocated the search
68 69
   buffer using bits in the re_pattern_buffer.  This means that whenever
   you compile a new pattern, it completely forgets whether it has
Jim Blandy's avatar
Jim Blandy committed
70 71 72 73 74
   allocated any registers, and will allocate new registers the next
   time you call a searching or matching function.  Therefore, we need
   to call re_set_registers after compiling a new pattern or after
   setting the match registers, so that the regex functions will be
   able to free or re-allocate it properly.  */
Jim Blandy's avatar
Jim Blandy committed
75 76
static struct re_registers search_regs;

Jim Blandy's avatar
Jim Blandy committed
77 78 79 80
/* The buffer in which the last search was performed, or
   Qt if the last search was done in a string;
   Qnil if no searching has been done yet.  */
static Lisp_Object last_thing_searched;
Jim Blandy's avatar
Jim Blandy committed
81

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

Lisp_Object Qinvalid_regexp;

Richard M. Stallman's avatar
Richard M. Stallman committed
86
Lisp_Object Vsearch_spaces_regexp;
87

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
   for this pattern.  0 means backtrack only enough to get a valid match.
Kenichi Handa's avatar
Kenichi Handa committed
110 111
   MULTIBYTE is nonzero iff a target of match is a multibyte buffer or
   string.  */
Jim Blandy's avatar
Jim Blandy committed
112

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

125
  cp->regexp = Qnil;
126
  cp->buf.translate = (! NILP (translate) ? translate : make_number (0));
127
  cp->posix = posix;
128 129
  cp->buf.multibyte = STRING_MULTIBYTE (pattern);
  cp->buf.target_multibyte = multibyte;
130
  BLOCK_INPUT;
131
  old = re_set_syntax (RE_SYNTAX_EMACS
132
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
Kenichi Handa's avatar
Kenichi Handa committed
133 134
  val = (char *) re_compile_pattern ((char *) SDATA (pattern),
				     SBYTES (pattern), &cp->buf);
135
  re_set_syntax (old);
136
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
137
  if (val)
138
    Fsignal (Qinvalid_regexp, Fcons (build_string (val), Qnil));
Jim Blandy's avatar
Jim Blandy committed
139

140 141 142
  cp->regexp = Fcopy_sequence (pattern);
}

143 144 145 146 147 148 149
/* 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 ()
{
150
  struct regexp_cache *cp;
151 152 153 154 155

  for (cp = searchbuf_head; cp != 0; cp = cp->next)
    {
      cp->buf.allocated = cp->buf.used;
      cp->buf.buffer
156
	= (unsigned char *) xrealloc (cp->buf.buffer, cp->buf.used);
157 158 159
    }
}

160
/* Compile a regexp if necessary, but first check to see if there's one in
161 162
   the cache.
   PATTERN is the pattern to compile.
163
   TRANSLATE is a translation table for ignoring case, or nil for none.
164 165 166 167 168 169
   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.  */
170 171

struct re_pattern_buffer *
172
compile_pattern (pattern, regp, translate, posix, multibyte)
173 174
     Lisp_Object pattern;
     struct re_registers *regp;
175
     Lisp_Object translate;
176
     int posix, multibyte;
177 178 179 180 181 182
{
  struct regexp_cache *cp, **cpp;

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
183 184
      /* Entries are initialized to nil, and may be set to nil by
	 compile_pattern_1 if the pattern isn't valid.  Don't apply
Ken Raeburn's avatar
Ken Raeburn committed
185 186 187
	 string accessors in those cases.  However, compile_pattern_1
	 is only applied to the cache entry we pick here to reuse.  So
	 nil should never appear before a non-nil entry.  */
188
      if (NILP (cp->regexp))
189
	goto compile_it;
190
      if (SCHARS (cp->regexp) == SCHARS (pattern)
191
	  && STRING_MULTIBYTE (cp->regexp) == STRING_MULTIBYTE (pattern)
192
	  && !NILP (Fstring_equal (cp->regexp, pattern))
193
	  && EQ (cp->buf.translate, (! NILP (translate) ? translate : make_number (0)))
Karl Heuer's avatar
Karl Heuer committed
194
	  && cp->posix == posix
195
	  && cp->buf.target_multibyte == multibyte)
196 197
	break;

198 199 200
      /* 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.  */
201 202
      if (cp->next == 0)
	{
203
	compile_it:
Karl Heuer's avatar
Karl Heuer committed
204
	  compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte);
205 206 207 208 209 210 211 212 213 214
	  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
215

216 217 218 219 220
  /* 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);

221
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
222 223 224 225 226 227 228 229 230 231 232 233 234
}

/* 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;
}

235 236
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
237
     Lisp_Object string;
238
     int posix;
Jim Blandy's avatar
Jim Blandy committed
239 240 241 242 243
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
244
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
245

246 247 248
  if (running_asynch_code)
    save_search_regs ();

249
  CHECK_STRING (string);
250 251
  bufp = compile_pattern (string, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
252
			   ? DOWNCASE_TABLE : Qnil),
253 254
			  posix,
			  !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
255 256 257 258 259 260 261 262

  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;
263
  s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
264
  p2 = GAP_END_ADDR;
265
  s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
266 267 268
  if (s1 < 0)
    {
      p2 = p1;
269
      s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
270 271 272 273
      s1 = 0;
    }
  if (s2 < 0)
    {
274
      s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
275 276
      s2 = 0;
    }
277 278

  re_match_object = Qnil;
279

280
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
281 282
		  PT_BYTE - BEGV_BYTE, &search_regs,
		  ZV_BYTE - BEGV_BYTE);
283
  immediate_quit = 0;
284

Jim Blandy's avatar
Jim Blandy committed
285 286 287 288
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
289 290 291 292 293 294 295 296 297
  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);
	}
298
  XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
299 300 301
  return val;
}

302
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
303 304 305 306 307
       doc: /* Return t if text after point matches regular expression REGEXP.
This function modifies the match data that `match-beginning',
`match-end' and `match-data' access; save and restore the match
data if you want to preserve them.  */)
     (regexp)
308
     Lisp_Object regexp;
309
{
310
  return looking_at_1 (regexp, 0);
311 312 313
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
314 315 316 317 318 319
       doc: /* Return t if text after point matches regular expression REGEXP.
Find the longest match, in accord with Posix regular expression rules.
This function modifies the match data that `match-beginning',
`match-end' and `match-data' access; save and restore the match
data if you want to preserve them.  */)
     (regexp)
320
     Lisp_Object regexp;
321
{
322
  return looking_at_1 (regexp, 1);
323 324 325 326
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
327
     Lisp_Object regexp, string, start;
328
     int posix;
Jim Blandy's avatar
Jim Blandy committed
329 330
{
  int val;
331
  struct re_pattern_buffer *bufp;
332 333
  int pos, pos_byte;
  int i;
Jim Blandy's avatar
Jim Blandy committed
334

335 336 337
  if (running_asynch_code)
    save_search_regs ();

338 339
  CHECK_STRING (regexp);
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
340 341

  if (NILP (start))
342
    pos = 0, pos_byte = 0;
Jim Blandy's avatar
Jim Blandy committed
343 344
  else
    {
345
      int len = SCHARS (string);
Jim Blandy's avatar
Jim Blandy committed
346

347
      CHECK_NUMBER (start);
348 349 350 351
      pos = XINT (start);
      if (pos < 0 && -pos <= len)
	pos = len + pos;
      else if (0 > pos || pos > len)
Jim Blandy's avatar
Jim Blandy committed
352
	args_out_of_range (string, start);
353
      pos_byte = string_char_to_byte (string, pos);
Jim Blandy's avatar
Jim Blandy committed
354 355
    }

356 357
  bufp = compile_pattern (regexp, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
358
			   ? DOWNCASE_TABLE : Qnil),
359 360
			  posix,
			  STRING_MULTIBYTE (string));
Jim Blandy's avatar
Jim Blandy committed
361
  immediate_quit = 1;
362
  re_match_object = string;
363

364 365 366
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), pos_byte,
		   SBYTES (string) - pos_byte,
Jim Blandy's avatar
Jim Blandy committed
367 368
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
369
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
370 371 372
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
373 374 375 376 377 378 379 380 381 382 383

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

386
DEFUN ("string-match", Fstring_match, Sstring_match, 2, 3, 0,
387 388 389 390 391
       doc: /* Return index of start of first match for REGEXP in STRING, or nil.
Case is ignored if `case-fold-search' is non-nil in the current buffer.
If third arg START is non-nil, start search at that index in STRING.
For index of first char beyond the match, do (match-end 0).
`match-end' and `match-beginning' also give indices of substrings
392 393 394 395
matched by parenthesis constructs in the pattern.

You can use the function `match-string' to extract the substrings
matched by the parenthesis constructions in REGEXP. */)
396
     (regexp, string, start)
397 398 399 400 401 402
     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,
403 404 405 406 407 408 409 410
       doc: /* Return index of start of first match for REGEXP in STRING, or nil.
Find the longest match, in accord with Posix regular expression rules.
Case is ignored if `case-fold-search' is non-nil in the current buffer.
If third arg START is non-nil, start search at that index in STRING.
For index of first char beyond the match, do (match-end 0).
`match-end' and `match-beginning' also give indices of substrings
matched by parenthesis constructs in the pattern.  */)
     (regexp, string, start)
411 412 413 414 415
     Lisp_Object regexp, string, start;
{
  return string_match_1 (regexp, string, start, 1);
}

Richard M. Stallman's avatar
Richard M. Stallman committed
416 417 418 419 420 421 422 423 424
/* 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;
425
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
426

427 428
  bufp = compile_pattern (regexp, 0, Qnil,
			  0, STRING_MULTIBYTE (string));
Richard M. Stallman's avatar
Richard M. Stallman committed
429
  immediate_quit = 1;
430
  re_match_object = string;
431

432 433 434
  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), 0,
		   SBYTES (string), 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
435 436 437
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
438 439 440

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

extern Lisp_Object Vascii_downcase_table;

int
447
fast_c_string_match_ignore_case (regexp, string)
Karl Heuer's avatar
Karl Heuer committed
448
     Lisp_Object regexp;
449
     const char *string;
Karl Heuer's avatar
Karl Heuer committed
450 451 452 453 454
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

455
  regexp = string_make_unibyte (regexp);
456
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
457
  bufp = compile_pattern (regexp, 0,
458
			  Vascii_downcase_table, 0,
459
			  0);
Karl Heuer's avatar
Karl Heuer committed
460 461 462 463 464
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485

/* Like fast_string_match but ignore case.  */

int
fast_string_match_ignore_case (regexp, string)
     Lisp_Object regexp, string;
{
  int val;
  struct re_pattern_buffer *bufp;

  bufp = compile_pattern (regexp, 0, Vascii_downcase_table,
			  0, STRING_MULTIBYTE (string));
  immediate_quit = 1;
  re_match_object = string;

  val = re_search (bufp, (char *) SDATA (string),
		   SBYTES (string), 0,
		   SBYTES (string), 0);
  immediate_quit = 0;
  return val;
}
486 487 488 489 490 491 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

/* 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
524 525

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

529 530
   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
531

532 533 534
   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
535
int
536 537 538 539 540
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
541
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
542
{
543
  struct region_cache *newline_cache;
544
  int direction;
Jim Blandy's avatar
Jim Blandy committed
545

546 547 548 549 550 551 552 553 554 555
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
556

557 558
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
559 560 561 562

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

563
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
564

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

        /* 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
584 585
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
586
            immediate_quit = allow_quit;
587

588 589 590
            /* START should never be after END.  */
            if (start_byte > ceiling_byte)
              start_byte = ceiling_byte;
591 592 593

            /* Now the text after start is an unknown region, and
               next_change is the position of the next known region. */
594
            ceiling_byte = min (next_change - 1, ceiling_byte);
595 596 597 598 599 600
          }

        /* 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.  */
601 602
	tem = BUFFER_CEILING_OF (start_byte);
	ceiling_byte = min (tem, ceiling_byte);
603 604

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

              /* Did we find the target character?  */
              if (cursor < ceiling_addr)
                {
                  if (--count == 0)
                    {
                      immediate_quit = 0;
633
                      return BYTE_TO_CHAR (start_byte + cursor - base + 1);
634 635 636 637 638
                    }
                  cursor++;
                }
            }

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

        /* Consult the newline cache, if appropriate.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_backward
656 657
                   (current_buffer, newline_cache, start_byte, &next_change))
              start_byte = next_change;
658
            immediate_quit = allow_quit;
659 660

            /* Start should never be at or before end.  */
661 662
            if (start_byte <= ceiling_byte)
              start_byte = ceiling_byte + 1;
663 664 665

            /* Now the text before start is an unknown region, and
               next_change is the position of the next known region. */
666
            ceiling_byte = max (next_change, ceiling_byte);
667 668 669
          }

        /* Stop scanning before the gap.  */
670 671
	tem = BUFFER_FLOOR_OF (start_byte - 1);
	ceiling_byte = max (tem, ceiling_byte);
672 673 674

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

              /* Did we find the target character?  */
              if (cursor >= ceiling_addr)
                {
                  if (++count >= 0)
                    {
                      immediate_quit = 0;
699
                      return BYTE_TO_CHAR (start_byte + cursor - base);
700 701 702 703 704
                    }
                  cursor--;
                }
            }

705
	  start = BYTE_TO_CHAR (start_byte + cursor - base);
706 707 708
        }
      }

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

732
int
733 734 735 736 737
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;
738
{
739 740 741 742 743 744 745 746
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
  unsigned char *base;

  register int ceiling;
  register unsigned char *ceiling_addr;

747 748
  int old_immediate_quit = immediate_quit;

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

752 753
  if (allow_quit)
    immediate_quit++;
754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773

  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)
		    {
774
		      immediate_quit = old_immediate_quit;
775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806
		      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)
		    {
807
		      immediate_quit = old_immediate_quit;
808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824
		      /* 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);
825
  immediate_quit = old_immediate_quit;
826 827

  return count * direction;
828 829
}

Jim Blandy's avatar
Jim Blandy committed
830
int
831
find_next_newline_no_quit (from, cnt)
Jim Blandy's avatar
Jim Blandy committed
832 833
     register int from, cnt;
{
834
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
835 836 837 838 839
}

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

841 842
int
find_before_next_newline (from, to, cnt)
843
     int from, to, cnt;
844 845 846 847 848 849
{
  int shortage;
  int pos = scan_buffer ('\n', from, to, cnt, &shortage, 1);

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

851
  return pos;
Jim Blandy's avatar
Jim Blandy committed
852 853 854 855 856
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
857
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
858 859 860
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
861
     int posix;
Jim Blandy's avatar
Jim Blandy committed
862 863
{
  register int np;
864
  int lim, lim_byte;
Jim Blandy's avatar
Jim Blandy committed
865 866 867 868
  int n = direction;

  if (!NILP (count))
    {
869
      CHECK_NUMBER (count);
Jim Blandy's avatar
Jim Blandy committed
870 871 872
      n *= XINT (count);
    }

873
  CHECK_STRING (string);
Jim Blandy's avatar
Jim Blandy committed
874
  if (NILP (bound))
875 876 877 878 879 880
    {
      if (n > 0)
	lim = ZV, lim_byte = ZV_BYTE;
      else
	lim = BEGV, lim_byte = BEGV_BYTE;
    }
Jim Blandy's avatar
Jim Blandy committed
881 882
  else
    {
883
      CHECK_NUMBER_COERCE_MARKER (bound);
Jim Blandy's avatar
Jim Blandy committed
884
      lim = XINT (bound);
885
      if (n > 0 ? lim < PT : lim > PT)
Jim Blandy's avatar
Jim Blandy committed
886 887
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
888
	lim = ZV, lim_byte = ZV_BYTE;
889
      else if (lim < BEGV)
890
	lim = BEGV, lim_byte = BEGV_BYTE;
891 892
      else
	lim_byte = CHAR_TO_BYTE (lim);
Jim Blandy's avatar
Jim Blandy committed
893 894
    }

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

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

  SET_PT (np);

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

Karl Heuer's avatar
Karl Heuer committed
932 933 934 935
static int
trivial_regexp_p (regexp)
     Lisp_Object regexp;
{
936 937
  int len = SBYTES (regexp);
  unsigned char *s = SDATA (regexp);
Karl Heuer's avatar
Karl Heuer committed
938 939 940 941 942 943 944 945 946 947 948 949 950
  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':
951
	    case 'S': case '=': case '{': case '}': case '_':
Karl Heuer's avatar
Karl Heuer committed
952
	    case 'c': case 'C':	/* for categoryspec and notcategoryspec */
953
	    case '1': case '2': case '3': case '4': case '5':
Karl Heuer's avatar
Karl Heuer committed
954 955 956 957 958 959 960 961
	    case '6': case '7': case '8': case '9':
	      return 0;
	    }
	}
    }
  return 1;
}

962
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
963
   starting at position POS and stopping at position LIM,
964
   treating STRING as a literal string if RE is false or as
Jim Blandy's avatar
Jim Blandy committed
965 966 967 968 969
   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.

970
   Returns -x if x occurrences remain to be found (x > 0),
Jim Blandy's avatar
Jim Blandy committed
971
   or else the position at the beginning of the Nth occurrence
972 973 974 975
   (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
976

977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992
#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)
993

994
static int
995 996
search_buffer (string, pos, pos_byte, lim, lim_byte, n,
	       RE, trt, inverse_trt, posix)
Jim Blandy's avatar
Jim Blandy committed
997 998
     Lisp_Object string;
     int pos;
999
     int pos_byte;
Jim Blandy's avatar
Jim Blandy committed
1000
     int lim;
1001
     int lim_byte;
Jim Blandy's avatar
Jim Blandy committed
1002 1003
     int n;
     int RE;
1004 1005
     Lisp_Object trt;
     Lisp_Object inverse_trt;
1006
     int posix;
Jim Blandy's avatar
Jim Blandy committed
1007
{
1008 1009
  int len = SCHARS (string);
  int len_byte = SBYTES (string);
1010
  register int i;
Jim Blandy's avatar
Jim Blandy committed
1011

1012 1013 1014
  if (running_asynch_code)
    save_search_regs ();

1015
  /* Searching 0 times means don't move.  */
Jim Blandy's avatar
Jim Blandy committed
1016
  /* Null string is found at starting position.  */
1017
  if (len == 0 || n == 0)
1018
    {
1019
      set_search_regs (pos_byte, 0);
1020 1021
      return pos;
    }
1022

Richard M. Stallman's avatar
Richard M. Stallman committed
1023
  if (RE && !(trivial_regexp_p (string) && NILP (Vsearch_spaces_regexp)))
Jim Blandy's avatar
Jim Blandy committed
1024
    {
1025 1026
      unsigned char *p1, *p2;
      int s1, s2;
1027 1028
      struct re_pattern_buffer *bufp;

1029 1030
      bufp = compile_pattern (string, &search_regs, trt, posix,
			      !NILP (current_buffer->enable_multibyte_characters));
Jim Blandy's avatar
Jim Blandy committed
1031 1032 1033 1034 1035 1036 1037 1038 1039 1040

      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;
1041
      s1 = GPT_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1042
      p2 = GAP_END_ADDR;
1043
      s2 = ZV_BYTE - GPT_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1044 1045 1046
      if (s1 < 0)
	{
	  p2 = p1;
1047
	  s2 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed
1048 1049 1050 1051
	  s1 = 0;
	}
      if (s2 < 0)
	{
1052
	  s1 = ZV_BYTE - BEGV_BYTE;
Jim Blandy's avatar
Jim Blandy committed