search.c 66.1 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* String search routines for GNU Emacs.
Karl Heuer's avatar
Karl Heuer committed
2
   Copyright (C) 1985, 1986, 1987, 1993, 1994 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"
Jim Blandy's avatar
Jim Blandy committed
31

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

35
#define REGEXP_CACHE_SIZE 20
Jim Blandy's avatar
Jim Blandy committed
36

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

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

52 53
/* 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
54 55


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

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

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

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

Lisp_Object Qinvalid_regexp;

84
static void set_search_regs ();
85
static void save_search_regs ();
86

87 88
static int search_buffer ();

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

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

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

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

127 128
  cp->regexp = Qnil;
  cp->buf.translate = translate;
129
  cp->posix = posix;
Karl Heuer's avatar
Karl Heuer committed
130
  cp->buf.multibyte = multibyte;
131
  BLOCK_INPUT;
132 133
  old = re_set_syntax (RE_SYNTAX_EMACS
		       | (posix ? 0 : RE_NO_POSIX_BACKTRACKING));
134
  val = (CONST char *) re_compile_pattern ((char *) XSTRING (pattern)->data,
135
					   XSTRING (pattern)->size, &cp->buf);
136
  re_set_syntax (old);
137
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
138
  if (val)
139
    Fsignal (Qinvalid_regexp, Fcons (build_string (val), Qnil));
Jim Blandy's avatar
Jim Blandy committed
140

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

/* Compile a regexp if necessary, but first check to see if there's one in
145 146 147 148 149 150 151 152 153
   the cache.
   PATTERN is the pattern to compile.
   TRANSLATE is a translation table for ignoring case, or NULL for none.
   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.  */
154 155

struct re_pattern_buffer *
156
compile_pattern (pattern, regp, translate, posix)
157 158
     Lisp_Object pattern;
     struct re_registers *regp;
159
     Lisp_Object *translate;
160
     int posix;
161 162
{
  struct regexp_cache *cp, **cpp;
Karl Heuer's avatar
Karl Heuer committed
163 164 165
  /* Should we check it here, or add an argument `multibyte' to this
     function?  */
  int multibyte = !NILP (current_buffer->enable_multibyte_characters);
166 167 168 169

  for (cpp = &searchbuf_head; ; cpp = &cp->next)
    {
      cp = *cpp;
170 171
      if (XSTRING (cp->regexp)->size == XSTRING (pattern)->size
	  && !NILP (Fstring_equal (cp->regexp, pattern))
172
	  && cp->buf.translate == translate
Karl Heuer's avatar
Karl Heuer committed
173 174
	  && cp->posix == posix
	  && cp->buf.multibyte == multibyte)
175 176 177 178 179
	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
180
	  compile_pattern_1 (cp, pattern, translate, regp, posix, multibyte);
181 182 183 184 185 186 187 188 189 190
	  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
191

192 193 194 195 196
  /* 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);

197
  return &cp->buf;
Jim Blandy's avatar
Jim Blandy committed
198 199 200 201 202 203 204 205 206 207 208 209 210
}

/* 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;
}

211 212
static Lisp_Object
looking_at_1 (string, posix)
Jim Blandy's avatar
Jim Blandy committed
213
     Lisp_Object string;
214
     int posix;
Jim Blandy's avatar
Jim Blandy committed
215 216 217 218 219
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;
220
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
221

222 223 224
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
225
  CHECK_STRING (string, 0);
226 227
  bufp = compile_pattern (string, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
228 229
			   ? DOWNCASE_TABLE : 0),
			  posix);
Jim Blandy's avatar
Jim Blandy committed
230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252

  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;
  s1 = GPT - BEGV;
  p2 = GAP_END_ADDR;
  s2 = ZV - GPT;
  if (s1 < 0)
    {
      p2 = p1;
      s2 = ZV - BEGV;
      s1 = 0;
    }
  if (s2 < 0)
    {
      s1 = ZV - BEGV;
      s2 = 0;
    }
  
253
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
254
		  PT - BEGV, &search_regs,
Jim Blandy's avatar
Jim Blandy committed
255 256 257 258 259
		  ZV - BEGV);
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
Jim Blandy's avatar
Jim Blandy committed
260
  for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
261 262 263 264 265
    if (search_regs.start[i] >= 0)
      {
	search_regs.start[i] += BEGV;
	search_regs.end[i] += BEGV;
      }
266
  XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
267 268 269 270
  immediate_quit = 0;
  return val;
}

271
DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
272
  "Return t if text after point matches regular expression REGEXP.\n\
273 274 275
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.")
276 277
  (regexp)
     Lisp_Object regexp;
278
{
279
  return looking_at_1 (regexp, 0);
280 281 282
}

DEFUN ("posix-looking-at", Fposix_looking_at, Sposix_looking_at, 1, 1, 0,
283
  "Return t if text after point matches regular expression REGEXP.\n\
284 285 286 287
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.")
288 289
  (regexp)
     Lisp_Object regexp;
290
{
291
  return looking_at_1 (regexp, 1);
292 293 294 295
}

static Lisp_Object
string_match_1 (regexp, string, start, posix)
Jim Blandy's avatar
Jim Blandy committed
296
     Lisp_Object regexp, string, start;
297
     int posix;
Jim Blandy's avatar
Jim Blandy committed
298 299 300
{
  int val;
  int s;
301
  struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
302

303 304 305
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
306 307 308 309 310 311 312 313 314 315 316 317
  CHECK_STRING (regexp, 0);
  CHECK_STRING (string, 1);

  if (NILP (start))
    s = 0;
  else
    {
      int len = XSTRING (string)->size;

      CHECK_NUMBER (start, 2);
      s = XINT (start);
      if (s < 0 && -s <= len)
Karl Heuer's avatar
Karl Heuer committed
318
	s = len + s;
Jim Blandy's avatar
Jim Blandy committed
319 320 321 322
      else if (0 > s || s > len)
	args_out_of_range (string, start);
    }

323 324
  bufp = compile_pattern (regexp, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
325
			   ? DOWNCASE_TABLE : 0),
326
			  posix);
Jim Blandy's avatar
Jim Blandy committed
327
  immediate_quit = 1;
328
  val = re_search (bufp, (char *) XSTRING (string)->data,
Jim Blandy's avatar
Jim Blandy committed
329 330 331
		   XSTRING (string)->size, s, XSTRING (string)->size - s,
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
332
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
333 334 335 336 337
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
  return make_number (val);
}
Richard M. Stallman's avatar
Richard M. Stallman committed
338

339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
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
364 365 366 367 368 369 370 371 372
/* 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;
373
  struct re_pattern_buffer *bufp;
Richard M. Stallman's avatar
Richard M. Stallman committed
374

375
  bufp = compile_pattern (regexp, 0, 0, 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
376
  immediate_quit = 1;
377
  val = re_search (bufp, (char *) XSTRING (string)->data,
Richard M. Stallman's avatar
Richard M. Stallman committed
378 379 380 381 382
		   XSTRING (string)->size, 0, XSTRING (string)->size,
		   0);
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405

/* Match REGEXP against STRING, searching all of STRING ignoring case,
   and return the index of the match, or negative on failure.
   This does not clobber the match data.  */

extern Lisp_Object Vascii_downcase_table;

int
fast_string_match_ignore_case (regexp, string)
     Lisp_Object regexp;
     char *string;
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

  bufp = compile_pattern (regexp, 0,
			  XCHAR_TABLE (Vascii_downcase_table)->contents, 0);
  immediate_quit = 1;
  val = re_search (bufp, string, len, 0, len, 0);
  immediate_quit = 0;
  return val;
}
Jim Blandy's avatar
Jim Blandy committed
406

407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460
/* max and min.  */

static int
max (a, b)
     int a, b;
{
  return ((a > b) ? a : b);
}

static int
min (a, b)
     int a, b;
{
  return ((a < b) ? a : b);
}


/* 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
461 462

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

466 467
   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
468

469 470 471
   If ALLOW_QUIT is non-zero, set immediate_quit.  That's good to do
   except when inside redisplay.  */

472 473 474 475 476
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
477
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
478
{
479 480
  struct region_cache *newline_cache;
  int direction; 
Jim Blandy's avatar
Jim Blandy committed
481

482 483 484 485 486 487 488 489 490 491
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
492

493 494
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
495 496 497 498

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

499
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
500

Jim Blandy's avatar
Jim Blandy committed
501
  if (count > 0)
502
    while (start != end)
Jim Blandy's avatar
Jim Blandy committed
503
      {
504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519
        /* 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.  */
        register int ceiling = end - 1;

        /* 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
                   (current_buffer, newline_cache, start, &next_change))
              start = next_change;
520
            immediate_quit = allow_quit;
521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538

            /* start should never be after end.  */
            if (start >= end)
              start = end - 1;

            /* Now the text after start is an unknown region, and
               next_change is the position of the next known region. */
            ceiling = min (next_change - 1, ceiling);
          }

        /* 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.  */
        ceiling = min (BUFFER_CEILING_OF (start), ceiling);

        {
          /* The termination address of the dumb loop.  */ 
Karl Heuer's avatar
Karl Heuer committed
539 540
          register unsigned char *ceiling_addr = POS_ADDR (ceiling) + 1;
          register unsigned char *cursor = POS_ADDR (start);
541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571
          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,
                                   start + scan_start - base,
                                   start + cursor - base);

              /* Did we find the target character?  */
              if (cursor < ceiling_addr)
                {
                  if (--count == 0)
                    {
                      immediate_quit = 0;
                      return (start + cursor - base + 1);
                    }
                  cursor++;
                }
            }

          start += cursor - base;
        }
Jim Blandy's avatar
Jim Blandy committed
572 573
      }
  else
574 575 576 577 578 579 580 581 582 583 584 585 586
    while (start > end)
      {
        /* The last character to check before the next obstacle.  */
        register int ceiling = end;

        /* Consult the newline cache, if appropriate.  */
        if (target == '\n' && newline_cache)
          {
            int next_change;
            immediate_quit = 0;
            while (region_cache_backward
                   (current_buffer, newline_cache, start, &next_change))
              start = next_change;
587
            immediate_quit = allow_quit;
588 589 590 591 592 593 594 595 596 597 598 599 600 601 602

            /* Start should never be at or before end.  */
            if (start <= end)
              start = end + 1;

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

        /* Stop scanning before the gap.  */
        ceiling = max (BUFFER_FLOOR_OF (start - 1), ceiling);

        {
          /* The termination address of the dumb loop.  */
Karl Heuer's avatar
Karl Heuer committed
603 604
          register unsigned char *ceiling_addr = POS_ADDR (ceiling);
          register unsigned char *cursor = POS_ADDR (start - 1);
605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636
          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,
                                   start + cursor - base,
                                   start + scan_start - base);

              /* Did we find the target character?  */
              if (cursor >= ceiling_addr)
                {
                  if (++count >= 0)
                    {
                      immediate_quit = 0;
                      return (start + cursor - base);
                    }
                  cursor--;
                }
            }

          start += cursor - base;
        }
      }

Jim Blandy's avatar
Jim Blandy committed
637 638
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
639
    *shortage = count * direction;
640
  return start;
Jim Blandy's avatar
Jim Blandy committed
641 642
}

643 644 645 646
int
find_next_newline_no_quit (from, cnt)
     register int from, cnt;
{
647
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
648 649
}

Jim Blandy's avatar
Jim Blandy committed
650 651 652 653
int
find_next_newline (from, cnt)
     register int from, cnt;
{
654 655 656 657 658 659 660 661 662
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 1);
}


/* 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.  */
int
find_before_next_newline (from, to, cnt)
663
     int from, to, cnt;
664 665 666 667 668 669 670 671
{
  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
672 673
}

674 675
Lisp_Object skip_chars ();

Jim Blandy's avatar
Jim Blandy committed
676
DEFUN ("skip-chars-forward", Fskip_chars_forward, Sskip_chars_forward, 1, 2, 0,
677 678
  "Move point forward, stopping before a char not in STRING, or at pos LIM.\n\
STRING is like the inside of a `[...]' in a regular expression\n\
Jim Blandy's avatar
Jim Blandy committed
679 680
except that `]' is never special and `\\' quotes `^', `-' or `\\'.\n\
Thus, with arg \"a-zA-Z\", this skips letters stopping before first nonletter.\n\
681 682
With arg \"^a-zA-Z\", skips nonletters stopping before first letter.\n\
Returns the distance traveled, either zero or positive.")
Jim Blandy's avatar
Jim Blandy committed
683 684 685
  (string, lim)
     Lisp_Object string, lim;
{
686
  return skip_chars (1, 0, string, lim);
Jim Blandy's avatar
Jim Blandy committed
687 688 689
}

DEFUN ("skip-chars-backward", Fskip_chars_backward, Sskip_chars_backward, 1, 2, 0,
690
  "Move point backward, stopping after a char not in STRING, or at pos LIM.\n\
691 692
See `skip-chars-forward' for details.\n\
Returns the distance traveled, either zero or negative.")
Jim Blandy's avatar
Jim Blandy committed
693 694 695
  (string, lim)
     Lisp_Object string, lim;
{
696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720
  return skip_chars (0, 0, string, lim);
}

DEFUN ("skip-syntax-forward", Fskip_syntax_forward, Sskip_syntax_forward, 1, 2, 0,
  "Move point forward across chars in specified syntax classes.\n\
SYNTAX is a string of syntax code characters.\n\
Stop before a char whose syntax is not in SYNTAX, or at position LIM.\n\
If SYNTAX starts with ^, skip characters whose syntax is NOT in SYNTAX.\n\
This function returns the distance traveled, either zero or positive.")
  (syntax, lim)
     Lisp_Object syntax, lim;
{
  return skip_chars (1, 1, syntax, lim);
}

DEFUN ("skip-syntax-backward", Fskip_syntax_backward, Sskip_syntax_backward, 1, 2, 0,
  "Move point backward across chars in specified syntax classes.\n\
SYNTAX is a string of syntax code characters.\n\
Stop on reaching a char whose syntax is not in SYNTAX, or at position LIM.\n\
If SYNTAX starts with ^, skip characters whose syntax is NOT in SYNTAX.\n\
This function returns the distance traveled, either zero or negative.")
  (syntax, lim)
     Lisp_Object syntax, lim;
{
  return skip_chars (0, 1, syntax, lim);
Jim Blandy's avatar
Jim Blandy committed
721 722
}

723
Lisp_Object
724 725
skip_chars (forwardp, syntaxp, string, lim)
     int forwardp, syntaxp;
Jim Blandy's avatar
Jim Blandy committed
726 727 728 729
     Lisp_Object string, lim;
{
  register unsigned char *p, *pend;
  register unsigned char c;
Karl Heuer's avatar
Karl Heuer committed
730
  register int ch;
Jim Blandy's avatar
Jim Blandy committed
731
  unsigned char fastmap[0400];
Karl Heuer's avatar
Karl Heuer committed
732 733 734 735 736 737 738 739 740 741
  /* If SYNTAXP is 0, STRING may contain multi-byte form of characters
     of which codes don't fit in FASTMAP.  In that case, we set the
     first byte of multibyte form (i.e. base leading-code) in FASTMAP
     and set the actual ranges of characters in CHAR_RANGES.  In the
     form "X-Y" of STRING, both X and Y must belong to the same
     character set because a range striding across character sets is
     meaningless.  */
  int *char_ranges
    = (int *) alloca (XSTRING (string)->size * (sizeof (int)) * 2);
  int n_char_ranges = 0;
Jim Blandy's avatar
Jim Blandy committed
742 743 744 745 746 747
  int negate = 0;
  register int i;

  CHECK_STRING (string, 0);

  if (NILP (lim))
748
    XSETINT (lim, forwardp ? ZV : BEGV);
Jim Blandy's avatar
Jim Blandy committed
749 750 751 752
  else
    CHECK_NUMBER_COERCE_MARKER (lim, 1);

  /* In any case, don't allow scan outside bounds of buffer.  */
753 754 755 756
  /* jla turned this off, for no known reason.
     bfox turned the ZV part on, and rms turned the
     BEGV part back on.  */
  if (XINT (lim) > ZV)
757
    XSETFASTINT (lim, ZV);
758
  if (XINT (lim) < BEGV)
759
    XSETFASTINT (lim, BEGV);
Jim Blandy's avatar
Jim Blandy committed
760 761 762 763 764 765 766 767 768 769

  p = XSTRING (string)->data;
  pend = p + XSTRING (string)->size;
  bzero (fastmap, sizeof fastmap);

  if (p != pend && *p == '^')
    {
      negate = 1; p++;
    }

770 771
  /* Find the characters specified and set their elements of fastmap.
     If syntaxp, each character counts as itself.
Karl Heuer's avatar
Karl Heuer committed
772
     Otherwise, handle backslashes and ranges specially.  */
Jim Blandy's avatar
Jim Blandy committed
773 774 775

  while (p != pend)
    {
Karl Heuer's avatar
Karl Heuer committed
776 777 778
      c = *p;
      ch = STRING_CHAR (p, pend - p);
      p += BYTES_BY_CHAR_HEAD (*p);
779
      if (syntaxp)
780
	fastmap[syntax_spec_code[c]] = 1;
781
      else
Jim Blandy's avatar
Jim Blandy committed
782
	{
783
	  if (c == '\\')
Jim Blandy's avatar
Jim Blandy committed
784
	    {
785 786 787 788 789
	      if (p == pend) break;
	      c = *p++;
	    }
	  if (p != pend && *p == '-')
	    {
Karl Heuer's avatar
Karl Heuer committed
790 791
	      unsigned int ch2;

792 793
	      p++;
	      if (p == pend) break;
Karl Heuer's avatar
Karl Heuer committed
794 795 796 797 798 799 800
	      if (SINGLE_BYTE_CHAR_P (ch))
		while (c <= *p)
		  {
		    fastmap[c] = 1;
		    c++;
		  }
	      else
801
		{
Karl Heuer's avatar
Karl Heuer committed
802 803 804 805 806
		  fastmap[c] = 1; /* C is the base leading-code.  */
		  ch2 = STRING_CHAR (p, pend - p);
		  if (ch <= ch2)
		    char_ranges[n_char_ranges++] = ch,
		    char_ranges[n_char_ranges++] = ch2;
807
		}
Karl Heuer's avatar
Karl Heuer committed
808
	      p += BYTES_BY_CHAR_HEAD (*p);
Jim Blandy's avatar
Jim Blandy committed
809
	    }
810
	  else
Karl Heuer's avatar
Karl Heuer committed
811 812 813 814 815 816
	    {
	      fastmap[c] = 1;
	      if (!SINGLE_BYTE_CHAR_P (ch))
		char_ranges[n_char_ranges++] = ch,
		char_ranges[n_char_ranges++] = ch;
	    }
Jim Blandy's avatar
Jim Blandy committed
817 818 819
	}
    }

Karl Heuer's avatar
Karl Heuer committed
820 821 822 823
  /* If ^ was the first character, complement the fastmap.  In
     addition, as all multibyte characters have possibility of
     matching, set all entries for base leading codes, which is
     harmless even if SYNTAXP is 1.  */
Jim Blandy's avatar
Jim Blandy committed
824 825 826

  if (negate)
    for (i = 0; i < sizeof fastmap; i++)
Karl Heuer's avatar
Karl Heuer committed
827 828 829 830 831 832
      {
	if (!BASE_LEADING_CODE_P (i))
	  fastmap[i] ^= 1;
	else
	  fastmap[i] = 1;
      }
Jim Blandy's avatar
Jim Blandy committed
833

834
  {
835
    int start_point = PT;
836
    int pos = PT;
837 838

    immediate_quit = 1;
839
    if (syntaxp)
840
      {
841 842
	if (forwardp)
	  {
843 844
	    while (pos < XINT (lim)
		   && fastmap[(int) SYNTAX (FETCH_CHAR (pos))])
Karl Heuer's avatar
Karl Heuer committed
845
	      INC_POS (pos);
846 847 848
	  }
	else
	  {
Karl Heuer's avatar
Karl Heuer committed
849 850 851 852 853 854 855 856 857
	    while (pos > XINT (lim))
	      {
		DEC_POS (pos);
		if (!fastmap[(int) SYNTAX (FETCH_CHAR (pos))])
		  {
		    INC_POS (pos);
		    break;
		  }
	      }
858
	  }
859 860 861
      }
    else
      {
862 863
	if (forwardp)
	  {
Karl Heuer's avatar
Karl Heuer committed
864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886
	    while (pos < XINT (lim) && fastmap[(c = FETCH_BYTE (pos))])
	      {
		if (!BASE_LEADING_CODE_P (c))
		  pos++;
		else if (n_char_ranges)
		  {
		    /* We much check CHAR_RANGES for a multibyte
                       character.  */
		    ch = FETCH_MULTIBYTE_CHAR (pos);
		    for (i = 0; i < n_char_ranges; i += 2)
		      if ((ch >= char_ranges[i] && ch <= char_ranges[i + 1]))
			break;
		    if (!(negate ^ (i < n_char_ranges)))
		      break;

		    INC_POS (pos);
		  }
		else
		  {
		    if (!negate) break;
		    INC_POS (pos);
		  }
	      }
887 888 889
	  }
	else
	  {
Karl Heuer's avatar
Karl Heuer committed
890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914
	    while (pos > XINT (lim))
	      {
		DEC_POS (pos);
		if (fastmap[(c = FETCH_BYTE (pos))])
		  {
		    if (!BASE_LEADING_CODE_P (c))
		      ;
		    else if (n_char_ranges)
		      {
			/* We much check CHAR_RANGES for a multibyte
                           character.  */
			ch = FETCH_MULTIBYTE_CHAR (pos);
			for (i = 0; i < n_char_ranges; i += 2)
			  if (ch >= char_ranges[i] && ch <= char_ranges[i + 1])
			    break;
			if (!(negate ^ (i < n_char_ranges)))
			  break;
		      }
		    else
		      if (!negate)
			break;
		  }
		else
		  break;
	      }
915
	  }
916
      }
917
    SET_PT (pos);
918 919
    immediate_quit = 0;

920
    return make_number (PT - start_point);
921
  }
Jim Blandy's avatar
Jim Blandy committed
922 923 924 925 926
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
927
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
928 929 930
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
931
     int posix;
Jim Blandy's avatar
Jim Blandy committed
932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949
{
  register int np;
  int lim;
  int n = direction;

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

  CHECK_STRING (string, 0);
  if (NILP (bound))
    lim = n > 0 ? ZV : BEGV;
  else
    {
      CHECK_NUMBER_COERCE_MARKER (bound, 1);
      lim = XINT (bound);
950
      if (n > 0 ? lim < PT : lim > PT)
Jim Blandy's avatar
Jim Blandy committed
951 952 953 954 955 956 957
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
	lim = ZV;
      if (lim < BEGV)
	lim = BEGV;
    }

958
  np = search_buffer (string, PT, lim, n, RE,
Jim Blandy's avatar
Jim Blandy committed
959
		      (!NILP (current_buffer->case_fold_search)
960 961
		       ? XCHAR_TABLE (current_buffer->case_canon_table)->contents
		       : 0),
Jim Blandy's avatar
Jim Blandy committed
962
		      (!NILP (current_buffer->case_fold_search)
963 964
		       ? XCHAR_TABLE (current_buffer->case_eqv_table)->contents
		       : 0),
965
		      posix);
Jim Blandy's avatar
Jim Blandy committed
966 967 968 969 970 971 972 973
  if (np <= 0)
    {
      if (NILP (noerror))
	return signal_failure (string);
      if (!EQ (noerror, Qt))
	{
	  if (lim < BEGV || lim > ZV)
	    abort ();
974 975 976 977
	  SET_PT (lim);
	  return Qnil;
#if 0 /* This would be clean, but maybe programs depend on
	 a value of nil here.  */
978
	  np = lim;
979
#endif
Jim Blandy's avatar
Jim Blandy committed
980
	}
981 982
      else
	return Qnil;
Jim Blandy's avatar
Jim Blandy committed
983 984 985 986 987 988 989 990 991 992
    }

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

  SET_PT (np);

  return make_number (np);
}

Karl Heuer's avatar
Karl Heuer committed
993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012
static int
trivial_regexp_p (regexp)
     Lisp_Object regexp;
{
  int len = XSTRING (regexp)->size;
  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':
1013
	    case 'S': case '=':
Karl Heuer's avatar
Karl Heuer committed
1014
	    case 'c': case 'C':	/* for categoryspec and notcategoryspec */
1015
	    case '1': case '2': case '3': case '4': case '5':
Karl Heuer's avatar
Karl Heuer committed
1016 1017 1018 1019 1020 1021 1022 1023
	    case '6': case '7': case '8': case '9':
	      return 0;
	    }
	}
    }
  return 1;
}

1024
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
1025
   starting at position POS and stopping at position LIM,
1026
   treating STRING as a literal string if RE is false or as
Jim Blandy's avatar
Jim Blandy committed
1027 1028 1029 1030 1031 1032 1033
   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.

   Returns -x if only N-x occurrences found (x > 0),
   or else the position at the beginning of the Nth occurrence
1034 1035 1036 1037
   (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
1038

1039 1040
static int
search_buffer (string, pos, lim, n, RE, trt, inverse_trt, posix)
Jim Blandy's avatar
Jim Blandy committed
1041 1042 1043 1044 1045
     Lisp_Object string;
     int pos;
     int lim;
     int n;
     int RE;
1046 1047
     Lisp_Object *trt;
     Lisp_Object *inverse_trt;
1048
     int posix;
Jim Blandy's avatar
Jim Blandy committed
1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061
{
  int len = XSTRING (string)->size;
  unsigned char *base_pat = XSTRING (string)->data;
  register int *BM_tab;
  int *BM_tab_base;
  register int direction = ((n > 0) ? 1 : -1);
  register int dirlen;
  int infinity, limit, k, stride_for_teases;
  register unsigned char *pat, *cursor, *p_limit;  
  register int i, j;
  unsigned char *p1, *p2;
  int s1, s2;

1062 1063 1064
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
1065
  /* Null string is found at starting position.  */
1066
  if (len == 0)
1067 1068 1069 1070
    {
      set_search_regs (pos, 0);
      return pos;
    }
1071 1072 1073

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

Karl Heuer's avatar
Karl Heuer committed
1076
  if (RE && !trivial_regexp_p (string))
Jim Blandy's avatar
Jim Blandy committed
1077
    {
1078 1079
      struct re_pattern_buffer *bufp;

1080
      bufp = compile_pattern (string, &search_regs, trt, posix);
Jim Blandy's avatar
Jim Blandy committed
1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106

      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;
      s1 = GPT - BEGV;
      p2 = GAP_END_ADDR;
      s2 = ZV - GPT;
      if (s1 < 0)
	{
	  p2 = p1;
	  s2 = ZV - BEGV;
	  s1 = 0;
	}
      if (s2 < 0)
	{
	  s1 = ZV - BEGV;
	  s2 = 0;
	}
      while (n < 0)
	{
1107
	  int val;
1108
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,
1109 1110 1111
			     pos - BEGV, lim - pos, &search_regs,
			     /* Don't allow match past current point */
			     pos - BEGV);
Jim Blandy's avatar
Jim Blandy committed
1112
	  if (val == -2)
Karl Heuer's avatar
Karl Heuer committed
1113 1114 1115
	    {
	      matcher_overflow ();
	    }
Jim Blandy's avatar
Jim Blandy committed
1116 1117 1118
	  if (val >= 0)
	    {
	      j = BEGV;
Jim Blandy's avatar
Jim Blandy committed
1119
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
1120 1121 1122 1123 1124
		if (search_regs.start[i] >= 0)
		  {
		    search_regs.start[i] += j;
		    search_regs.end[i] += j;
		  }
1125
	      XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137
	      /* Set pos to the new position. */
	      pos = search_regs.start[0];
	    }
	  else
	    {
	      immediate_quit = 0;
	      return (n);
	    }
	  n++;
	}
      while (n > 0)
	{
1138
	  int val;
1139
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,
1140 1141
			     pos - BEGV, lim - pos, &search_regs,
			     lim - BEGV);
Jim Blandy's avatar
Jim Blandy committed
1142
	  if (val == -2)
Karl Heuer's avatar
Karl Heuer committed
1143 1144 1145
	    {
	      matcher_overflow ();
	    }
Jim Blandy's avatar
Jim Blandy committed
1146 1147 1148
	  if (val >= 0)
	    {
	      j = BEGV;
Jim Blandy's avatar
Jim Blandy committed
1149
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
1150 1151 1152 1153 1154
		if (search_regs.start[i] >= 0)
		  {
		    search_regs.start[i] += j;
		    search_regs.end[i] += j;
		  }
1155
	      XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175
	      pos = search_regs.end[0];
	    }
	  else
	    {
	      immediate_quit = 0;
	      return (0 - n);
	    }
	  n--;
	}
      immediate_quit = 0;
      return (pos);
    }
  else				/* non-RE case */
    {
#ifdef C_ALLOCA
      int BM_tab_space[0400];
      BM_tab = &BM_tab_space[0];
#else
      BM_tab = (int *) alloca (0400 * sizeof (int));
#endif
Karl Heuer's avatar
Karl Heuer committed
1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193
      {
	unsigned char *patbuf = (unsigned char *) alloca (len);
	pat = patbuf;
	while (--len >= 0)
	  {
	    /* If we got here and the RE flag is set, it's because we're
	       dealing with a regexp known to be trivial, so the backslash
	       just quotes the next character.  */
	    if (RE && *base_pat == '\\')
	      {
		len--;
		base_pat++;
	      }
	    *pat++ = (trt ? trt[*base_pat++] : *base_pat++);
	  }
	len = pat - patbuf;
	pat = base_pat = patbuf;
      }
Jim Blandy's avatar
Jim Blandy committed
1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241
      /* The g