search.c 44.4 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* String search routines for GNU Emacs.
Jim Blandy's avatar
Jim Blandy committed
2
   Copyright (C) 1985, 1986, 1987, 1993 Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

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
the Free Software Foundation; either version 1, or (at your option)
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
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */


21
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
22 23 24 25
#include "lisp.h"
#include "syntax.h"
#include "buffer.h"
#include "commands.h"
26
#include "blockinput.h"
Jim Blandy's avatar
Jim Blandy committed
27

Jim Blandy's avatar
Jim Blandy committed
28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
#include <sys/types.h>
#include "regex.h"

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

/* We compile regexps into this buffer and then use it for searching. */

struct re_pattern_buffer searchbuf;

char search_fastmap[0400];

/* Last regexp we compiled */

Lisp_Object last_regexp;

Jim Blandy's avatar
Jim Blandy committed
44 45 46 47 48 49 50
/* 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
51 52 53 54 55 56 57 58 59 60
   been allocated by checking search_regs.num_regs.

   The regex code keeps track of whether it has allocated the search
   buffer using bits in searchbuf.  This means that whenever you
   compile a new pattern, it completely forgets whether it has
   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
61 62
static struct re_registers search_regs;

Jim Blandy's avatar
Jim Blandy committed
63 64 65 66
/* 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
67 68 69 70 71

/* error condition signalled when regexp compile_pattern fails */

Lisp_Object Qinvalid_regexp;

72 73
static void set_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
74 75 76 77 78 79 80 81 82 83 84 85 86 87
static void
matcher_overflow ()
{
  error ("Stack overflow in regexp matcher");
}

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

/* Compile a regexp and signal a Lisp error if anything goes wrong.  */

Jim Blandy's avatar
Jim Blandy committed
88
compile_pattern (pattern, bufp, regp, translate)
Jim Blandy's avatar
Jim Blandy committed
89 90
     Lisp_Object pattern;
     struct re_pattern_buffer *bufp;
Jim Blandy's avatar
Jim Blandy committed
91
     struct re_registers *regp;
Jim Blandy's avatar
Jim Blandy committed
92 93 94 95 96 97 98 99
     char *translate;
{
  CONST char *val;
  Lisp_Object dummy;

  if (EQ (pattern, last_regexp)
      && translate == bufp->translate)
    return;
Jim Blandy's avatar
Jim Blandy committed
100

Jim Blandy's avatar
Jim Blandy committed
101 102
  last_regexp = Qnil;
  bufp->translate = translate;
103
  BLOCK_INPUT;
104 105
  val = (CONST char *) re_compile_pattern ((char *) XSTRING (pattern)->data,
					   XSTRING (pattern)->size, bufp);
106
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
107 108 109 110 111 112
  if (val)
    {
      dummy = build_string (val);
      while (1)
	Fsignal (Qinvalid_regexp, Fcons (dummy, Qnil));
    }
Jim Blandy's avatar
Jim Blandy committed
113

Jim Blandy's avatar
Jim Blandy committed
114
  last_regexp = pattern;
Jim Blandy's avatar
Jim Blandy committed
115 116 117

  /* Advise the searching functions about the space we have allocated
     for register data.  */
118
  BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
119 120
  if (regp)
    re_set_registers (bufp, regp, regp->num_regs, regp->start, regp->end);
121
  UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
122

Jim Blandy's avatar
Jim Blandy committed
123 124 125 126 127 128 129 130 131 132 133 134 135 136 137
  return;
}

/* 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;
}

DEFUN ("looking-at", Flooking_at, Slooking_at, 1, 1, 0,
Jim Blandy's avatar
Jim Blandy committed
138 139 140
  "Return t if text after point matches regular expression PAT.\n\
This function modifies the match data that `match-beginning',\n\
`match-end' and `match-data' access; save and restore the match\n\
141
data if you want to preserve them.")
Jim Blandy's avatar
Jim Blandy committed
142 143 144 145 146 147 148 149 150
  (string)
     Lisp_Object string;
{
  Lisp_Object val;
  unsigned char *p1, *p2;
  int s1, s2;
  register int i;

  CHECK_STRING (string, 0);
Jim Blandy's avatar
Jim Blandy committed
151
  compile_pattern (string, &searchbuf, &search_regs,
Jim Blandy's avatar
Jim Blandy committed
152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
		   !NILP (current_buffer->case_fold_search) ? DOWNCASE_TABLE : 0);

  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;
    }
  
  i = re_match_2 (&searchbuf, (char *) p1, s1, (char *) p2, s2,
		  point - BEGV, &search_regs,
		  ZV - BEGV);
  if (i == -2)
    matcher_overflow ();

  val = (0 <= i ? Qt : Qnil);
Jim Blandy's avatar
Jim Blandy committed
183
  for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
184 185 186 187 188
    if (search_regs.start[i] >= 0)
      {
	search_regs.start[i] += BEGV;
	search_regs.end[i] += BEGV;
      }
Jim Blandy's avatar
Jim Blandy committed
189
  XSET (last_thing_searched, Lisp_Buffer, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222
  immediate_quit = 0;
  return val;
}

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;
{
  int val;
  int s;

  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)
	s = len - s;
      else if (0 > s || s > len)
	args_out_of_range (string, start);
    }

Jim Blandy's avatar
Jim Blandy committed
223
  compile_pattern (regexp, &searchbuf, &search_regs,
Jim Blandy's avatar
Jim Blandy committed
224 225 226 227 228 229
		   !NILP (current_buffer->case_fold_search) ? DOWNCASE_TABLE : 0);
  immediate_quit = 1;
  val = re_search (&searchbuf, (char *) XSTRING (string)->data,
		   XSTRING (string)->size, s, XSTRING (string)->size - s,
		   &search_regs);
  immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
230
  last_thing_searched = Qt;
Jim Blandy's avatar
Jim Blandy committed
231 232 233 234 235
  if (val == -2)
    matcher_overflow ();
  if (val < 0) return Qnil;
  return make_number (val);
}
Richard M. Stallman's avatar
Richard M. Stallman committed
236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254

/* 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;

  compile_pattern (regexp, &searchbuf, 0, 0);
  immediate_quit = 1;
  val = re_search (&searchbuf, (char *) XSTRING (string)->data,
		   XSTRING (string)->size, 0, XSTRING (string)->size,
		   0);
  immediate_quit = 0;
  return val;
}
Jim Blandy's avatar
Jim Blandy committed
255

Jim Blandy's avatar
Jim Blandy committed
256 257 258 259
/* Search for COUNT instances of the character TARGET, starting at START.
   If COUNT is negative, search backwards.

   If we find COUNT instances, set *SHORTAGE to zero, and return the
Richard M. Stallman's avatar
Richard M. Stallman committed
260 261
   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
262 263 264 265 266 267 268 269 270

   If we don't find COUNT instances before reaching the end of the
   buffer (or the beginning, if scanning backwards), set *SHORTAGE to
   the number of TARGETs left unfound, and return the end of the
   buffer we bumped up against.  */

scan_buffer (target, start, count, shortage)
     int *shortage, start;
     register int count, target;
Jim Blandy's avatar
Jim Blandy committed
271
{
Jim Blandy's avatar
Jim Blandy committed
272 273 274 275
  int limit = ((count > 0) ? ZV - 1 : BEGV);
  int direction = ((count > 0) ? 1 : -1);

  register unsigned char *cursor;
Jim Blandy's avatar
Jim Blandy committed
276
  unsigned char *base;
Jim Blandy's avatar
Jim Blandy committed
277 278 279

  register int ceiling;
  register unsigned char *ceiling_addr;
Jim Blandy's avatar
Jim Blandy committed
280 281 282 283 284 285

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

  immediate_quit = 1;

Jim Blandy's avatar
Jim Blandy committed
286 287
  if (count > 0)
    while (start != limit + 1)
Jim Blandy's avatar
Jim Blandy committed
288
      {
Jim Blandy's avatar
Jim Blandy committed
289 290 291 292
	ceiling =  BUFFER_CEILING_OF (start);
	ceiling = min (limit, ceiling);
	ceiling_addr = &FETCH_CHAR (ceiling) + 1;
	base = (cursor = &FETCH_CHAR (start));
Jim Blandy's avatar
Jim Blandy committed
293 294
	while (1)
	  {
Jim Blandy's avatar
Jim Blandy committed
295
	    while (*cursor != target && ++cursor != ceiling_addr)
Jim Blandy's avatar
Jim Blandy committed
296
	      ;
Jim Blandy's avatar
Jim Blandy committed
297
	    if (cursor != ceiling_addr)
Jim Blandy's avatar
Jim Blandy committed
298
	      {
Jim Blandy's avatar
Jim Blandy committed
299
		if (--count == 0)
Jim Blandy's avatar
Jim Blandy committed
300 301
		  {
		    immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
302
		    return (start + cursor - base + 1);
Jim Blandy's avatar
Jim Blandy committed
303 304
		  }
		else
Jim Blandy's avatar
Jim Blandy committed
305
		  if (++cursor == ceiling_addr)
Jim Blandy's avatar
Jim Blandy committed
306 307 308 309 310
		    break;
	      }
	    else
	      break;
	  }
Jim Blandy's avatar
Jim Blandy committed
311
	start += cursor - base;
Jim Blandy's avatar
Jim Blandy committed
312 313 314
      }
  else
    {
Jim Blandy's avatar
Jim Blandy committed
315 316 317 318 319 320 321
      start--;			/* first character we scan */
      while (start > limit - 1)
	{			/* we WILL scan under start */
	  ceiling =  BUFFER_FLOOR_OF (start);
	  ceiling = max (limit, ceiling);
	  ceiling_addr = &FETCH_CHAR (ceiling) - 1;
	  base = (cursor = &FETCH_CHAR (start));
Jim Blandy's avatar
Jim Blandy committed
322 323 324
	  cursor++;
	  while (1)
	    {
Jim Blandy's avatar
Jim Blandy committed
325
	      while (--cursor != ceiling_addr && *cursor != target)
Jim Blandy's avatar
Jim Blandy committed
326
		;
Jim Blandy's avatar
Jim Blandy committed
327
	      if (cursor != ceiling_addr)
Jim Blandy's avatar
Jim Blandy committed
328
		{
Jim Blandy's avatar
Jim Blandy committed
329
		  if (++count == 0)
Jim Blandy's avatar
Jim Blandy committed
330 331
		    {
		      immediate_quit = 0;
Jim Blandy's avatar
Jim Blandy committed
332
		      return (start + cursor - base + 1);
Jim Blandy's avatar
Jim Blandy committed
333 334 335 336 337
		    }
		}
	      else
		break;
	    }
Jim Blandy's avatar
Jim Blandy committed
338
	  start += cursor - base;
Jim Blandy's avatar
Jim Blandy committed
339 340 341 342
	}
    }
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
343 344
    *shortage = count * direction;
  return (start + ((direction == 1 ? 0 : 1)));
Jim Blandy's avatar
Jim Blandy committed
345 346 347 348 349 350 351 352 353
}

int
find_next_newline (from, cnt)
     register int from, cnt;
{
  return (scan_buffer ('\n', from, cnt, (int *) 0));
}

354 355
Lisp_Object skip_chars ();

Jim Blandy's avatar
Jim Blandy committed
356
DEFUN ("skip-chars-forward", Fskip_chars_forward, Sskip_chars_forward, 1, 2, 0,
357 358
  "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
359 360
except that `]' is never special and `\\' quotes `^', `-' or `\\'.\n\
Thus, with arg \"a-zA-Z\", this skips letters stopping before first nonletter.\n\
361 362
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
363 364 365
  (string, lim)
     Lisp_Object string, lim;
{
366
  return skip_chars (1, 0, string, lim);
Jim Blandy's avatar
Jim Blandy committed
367 368 369
}

DEFUN ("skip-chars-backward", Fskip_chars_backward, Sskip_chars_backward, 1, 2, 0,
370
  "Move point backward, stopping after a char not in STRING, or at pos LIM.\n\
371 372
See `skip-chars-forward' for details.\n\
Returns the distance traveled, either zero or negative.")
Jim Blandy's avatar
Jim Blandy committed
373 374 375
  (string, lim)
     Lisp_Object string, lim;
{
376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400
  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
401 402
}

403
Lisp_Object
404 405
skip_chars (forwardp, syntaxp, string, lim)
     int forwardp, syntaxp;
Jim Blandy's avatar
Jim Blandy committed
406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421
     Lisp_Object string, lim;
{
  register unsigned char *p, *pend;
  register unsigned char c;
  unsigned char fastmap[0400];
  int negate = 0;
  register int i;

  CHECK_STRING (string, 0);

  if (NILP (lim))
    XSET (lim, Lisp_Int, forwardp ? ZV : BEGV);
  else
    CHECK_NUMBER_COERCE_MARKER (lim, 1);

  /* In any case, don't allow scan outside bounds of buffer.  */
422 423 424 425
  /* 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)
Jim Blandy's avatar
Jim Blandy committed
426
    XFASTINT (lim) = ZV;
427
  if (XINT (lim) < BEGV)
Jim Blandy's avatar
Jim Blandy committed
428 429 430 431 432 433 434 435 436 437 438
    XFASTINT (lim) = BEGV;

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

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

439 440 441
  /* Find the characters specified and set their elements of fastmap.
     If syntaxp, each character counts as itself.
     Otherwise, handle backslashes and ranges specially  */
Jim Blandy's avatar
Jim Blandy committed
442 443 444 445

  while (p != pend)
    {
      c = *p++;
446 447 448
      if (syntaxp)
	fastmap[c] = 1;
      else
Jim Blandy's avatar
Jim Blandy committed
449
	{
450
	  if (c == '\\')
Jim Blandy's avatar
Jim Blandy committed
451
	    {
452 453 454 455 456 457 458 459 460 461 462 463 464
	      if (p == pend) break;
	      c = *p++;
	    }
	  if (p != pend && *p == '-')
	    {
	      p++;
	      if (p == pend) break;
	      while (c <= *p)
		{
		  fastmap[c] = 1;
		  c++;
		}
	      p++;
Jim Blandy's avatar
Jim Blandy committed
465
	    }
466 467
	  else
	    fastmap[c] = 1;
Jim Blandy's avatar
Jim Blandy committed
468 469 470 471 472 473 474 475 476
	}
    }

  /* If ^ was the first character, complement the fastmap. */

  if (negate)
    for (i = 0; i < sizeof fastmap; i++)
      fastmap[i] ^= 1;

477 478 479 480
  {
    int start_point = point;

    immediate_quit = 1;
481
    if (syntaxp)
482
      {
483 484 485 486 487 488 489 490 491 492 493 494 495

	if (forwardp)
	  {
	    while (point < XINT (lim)
		   && fastmap[(unsigned char) syntax_code_spec[(int) SYNTAX (FETCH_CHAR (point))]])
	      SET_PT (point + 1);
	  }
	else
	  {
	    while (point > XINT (lim)
		   && fastmap[(unsigned char) syntax_code_spec[(int) SYNTAX (FETCH_CHAR (point - 1))]])
	      SET_PT (point - 1);
	  }
496 497 498
      }
    else
      {
499 500 501 502 503 504 505 506 507 508
	if (forwardp)
	  {
	    while (point < XINT (lim) && fastmap[FETCH_CHAR (point)])
	      SET_PT (point + 1);
	  }
	else
	  {
	    while (point > XINT (lim) && fastmap[FETCH_CHAR (point - 1)])
	      SET_PT (point - 1);
	  }
509 510 511 512 513
      }
    immediate_quit = 0;

    return make_number (point - start_point);
  }
Jim Blandy's avatar
Jim Blandy committed
514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
search_command (string, bound, noerror, count, direction, RE)
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
{
  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);
      if (n > 0 ? lim < point : lim > point)
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
	lim = ZV;
      if (lim < BEGV)
	lim = BEGV;
    }

  np = search_buffer (string, point, lim, n, RE,
		      (!NILP (current_buffer->case_fold_search)
		       ? XSTRING (current_buffer->case_canon_table)->data : 0),
		      (!NILP (current_buffer->case_fold_search)
		       ? XSTRING (current_buffer->case_eqv_table)->data : 0));
  if (np <= 0)
    {
      if (NILP (noerror))
	return signal_failure (string);
      if (!EQ (noerror, Qt))
	{
	  if (lim < BEGV || lim > ZV)
	    abort ();
562 563 564 565
	  SET_PT (lim);
	  return Qnil;
#if 0 /* This would be clean, but maybe programs depend on
	 a value of nil here.  */
566
	  np = lim;
567
#endif
Jim Blandy's avatar
Jim Blandy committed
568
	}
569 570
      else
	return Qnil;
Jim Blandy's avatar
Jim Blandy committed
571 572 573 574 575 576 577 578 579 580
    }

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

  SET_PT (np);

  return make_number (np);
}

581
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614
   starting at position POS and stopping at position LIM,
   treating PAT as a literal string if RE is false or as
   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
   (if searching backward) or the end (if searching forward).  */

search_buffer (string, pos, lim, n, RE, trt, inverse_trt)
     Lisp_Object string;
     int pos;
     int lim;
     int n;
     int RE;
     register unsigned char *trt;
     register unsigned char *inverse_trt;
{
  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;

  /* Null string is found at starting position.  */
615
  if (len == 0)
616 617 618 619
    {
      set_search_regs (pos, 0);
      return pos;
    }
620 621 622

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

  if (RE)
Jim Blandy's avatar
Jim Blandy committed
626
    compile_pattern (string, &searchbuf, &search_regs, (char *) trt);
Jim Blandy's avatar
Jim Blandy committed
627 628 629 630 631
  
  if (RE			/* Here we detect whether the */
				/* generality of an RE search is */
				/* really needed. */
      /* first item is "exact match" */
Jim Blandy's avatar
Jim Blandy committed
632
      && *(searchbuf.buffer) == (char) RE_EXACTN_VALUE
Jim Blandy's avatar
Jim Blandy committed
633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675
      && searchbuf.buffer[1] + 2 == searchbuf.used) /*first is ONLY item */
    {
      RE = 0;			/* can do straight (non RE) search */
      pat = (base_pat = (unsigned char *) searchbuf.buffer + 2);
				/* trt already applied */
      len = searchbuf.used - 2;
    }
  else if (!RE)
    {
      pat = (unsigned char *) alloca (len);

      for (i = len; i--;)		/* Copy the pattern; apply trt */
	*pat++ = (((int) trt) ? trt [*base_pat++] : *base_pat++);
      pat -= len; base_pat = pat;
    }

  if (RE)
    {
      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)
	{
676 677 678 679 680
	  int val;
	  val = re_search_2 (&searchbuf, (char *) p1, s1, (char *) p2, s2,
			     pos - BEGV, lim - pos, &search_regs,
			     /* Don't allow match past current point */
			     pos - BEGV);
Jim Blandy's avatar
Jim Blandy committed
681 682 683 684 685
	  if (val == -2)
	    matcher_overflow ();
	  if (val >= 0)
	    {
	      j = BEGV;
Jim Blandy's avatar
Jim Blandy committed
686
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
687 688 689 690 691
		if (search_regs.start[i] >= 0)
		  {
		    search_regs.start[i] += j;
		    search_regs.end[i] += j;
		  }
Jim Blandy's avatar
Jim Blandy committed
692
	      XSET (last_thing_searched, Lisp_Buffer, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
693 694 695 696 697 698 699 700 701 702 703 704
	      /* Set pos to the new position. */
	      pos = search_regs.start[0];
	    }
	  else
	    {
	      immediate_quit = 0;
	      return (n);
	    }
	  n++;
	}
      while (n > 0)
	{
705 706 707 708
	  int val;
	  val = re_search_2 (&searchbuf, (char *) p1, s1, (char *) p2, s2,
			     pos - BEGV, lim - pos, &search_regs,
			     lim - BEGV);
Jim Blandy's avatar
Jim Blandy committed
709 710 711 712 713
	  if (val == -2)
	    matcher_overflow ();
	  if (val >= 0)
	    {
	      j = BEGV;
Jim Blandy's avatar
Jim Blandy committed
714
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
715 716 717 718 719
		if (search_regs.start[i] >= 0)
		  {
		    search_regs.start[i] += j;
		    search_regs.end[i] += j;
		  }
Jim Blandy's avatar
Jim Blandy committed
720
	      XSET (last_thing_searched, Lisp_Buffer, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 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 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889
	      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
      /* The general approach is that we are going to maintain that we know */
      /* the first (closest to the present position, in whatever direction */
      /* we're searching) character that could possibly be the last */
      /* (furthest from present position) character of a valid match.  We */
      /* advance the state of our knowledge by looking at that character */
      /* and seeing whether it indeed matches the last character of the */
      /* pattern.  If it does, we take a closer look.  If it does not, we */
      /* move our pointer (to putative last characters) as far as is */
      /* logically possible.  This amount of movement, which I call a */
      /* stride, will be the length of the pattern if the actual character */
      /* appears nowhere in the pattern, otherwise it will be the distance */
      /* from the last occurrence of that character to the end of the */
      /* pattern. */
      /* As a coding trick, an enormous stride is coded into the table for */
      /* characters that match the last character.  This allows use of only */
      /* a single test, a test for having gone past the end of the */
      /* permissible match region, to test for both possible matches (when */
      /* the stride goes past the end immediately) and failure to */
      /* match (where you get nudged past the end one stride at a time). */ 

      /* Here we make a "mickey mouse" BM table.  The stride of the search */
      /* is determined only by the last character of the putative match. */
      /* If that character does not match, we will stride the proper */
      /* distance to propose a match that superimposes it on the last */
      /* instance of a character that matches it (per trt), or misses */
      /* it entirely if there is none. */  

      dirlen = len * direction;
      infinity = dirlen - (lim + pos + len + len) * direction;
      if (direction < 0)
	pat = (base_pat += len - 1);
      BM_tab_base = BM_tab;
      BM_tab += 0400;
      j = dirlen;		/* to get it in a register */
      /* A character that does not appear in the pattern induces a */
      /* stride equal to the pattern length. */
      while (BM_tab_base != BM_tab)
	{
	  *--BM_tab = j;
	  *--BM_tab = j;
	  *--BM_tab = j;
	  *--BM_tab = j;
	}
      i = 0;
      while (i != infinity)
	{
	  j = pat[i]; i += direction;
	  if (i == dirlen) i = infinity;
	  if ((int) trt)
	    {
	      k = (j = trt[j]);
	      if (i == infinity)
		stride_for_teases = BM_tab[j];
	      BM_tab[j] = dirlen - i;
	      /* A translation table is accompanied by its inverse -- see */
	      /* comment following downcase_table for details */ 
	      while ((j = inverse_trt[j]) != k)
		BM_tab[j] = dirlen - i;
	    }
	  else
	    {
	      if (i == infinity)
		stride_for_teases = BM_tab[j];
	      BM_tab[j] = dirlen - i;
	    }
	  /* stride_for_teases tells how much to stride if we get a */
	  /* match on the far character but are subsequently */
	  /* disappointed, by recording what the stride would have been */
	  /* for that character if the last character had been */
	  /* different. */
	}
      infinity = dirlen - infinity;
      pos += dirlen - ((direction > 0) ? direction : 0);
      /* loop invariant - pos points at where last char (first char if reverse)
	 of pattern would align in a possible match.  */
      while (n != 0)
	{
	  if ((lim - pos - (direction > 0)) * direction < 0)
	    return (n * (0 - direction));
	  /* First we do the part we can by pointers (maybe nothing) */
	  QUIT;
	  pat = base_pat;
	  limit = pos - dirlen + direction;
	  limit = ((direction > 0)
		   ? BUFFER_CEILING_OF (limit)
		   : BUFFER_FLOOR_OF (limit));
	  /* LIMIT is now the last (not beyond-last!) value
	     POS can take on without hitting edge of buffer or the gap.  */
	  limit = ((direction > 0)
		   ? min (lim - 1, min (limit, pos + 20000))
		   : max (lim, max (limit, pos - 20000)));
	  if ((limit - pos) * direction > 20)
	    {
	      p_limit = &FETCH_CHAR (limit);
	      p2 = (cursor = &FETCH_CHAR (pos));
	      /* In this loop, pos + cursor - p2 is the surrogate for pos */
	      while (1)		/* use one cursor setting as long as i can */
		{
		  if (direction > 0) /* worth duplicating */
		    {
		      /* Use signed comparison if appropriate
			 to make cursor+infinity sure to be > p_limit.
			 Assuming that the buffer lies in a range of addresses
			 that are all "positive" (as ints) or all "negative",
			 either kind of comparison will work as long
			 as we don't step by infinity.  So pick the kind
			 that works when we do step by infinity.  */
		      if ((int) (p_limit + infinity) > (int) p_limit)
			while ((int) cursor <= (int) p_limit)
			  cursor += BM_tab[*cursor];
		      else
			while ((unsigned int) cursor <= (unsigned int) p_limit)
			  cursor += BM_tab[*cursor];
		    }
		  else
		    {
		      if ((int) (p_limit + infinity) < (int) p_limit)
			while ((int) cursor >= (int) p_limit)
			  cursor += BM_tab[*cursor];
		      else
			while ((unsigned int) cursor >= (unsigned int) p_limit)
			  cursor += BM_tab[*cursor];
		    }
/* If you are here, cursor is beyond the end of the searched region. */
 /* This can happen if you match on the far character of the pattern, */
 /* because the "stride" of that character is infinity, a number able */
 /* to throw you well beyond the end of the search.  It can also */
 /* happen if you fail to match within the permitted region and would */
 /* otherwise try a character beyond that region */
		  if ((cursor - p_limit) * direction <= len)
		    break;	/* a small overrun is genuine */
		  cursor -= infinity; /* large overrun = hit */
		  i = dirlen - direction;
		  if ((int) trt)
		    {
		      while ((i -= direction) + direction != 0)
			if (pat[i] != trt[*(cursor -= direction)])
			  break;
		    }
		  else
		    {
		      while ((i -= direction) + direction != 0)
			if (pat[i] != *(cursor -= direction))
			  break;
		    }
		  cursor += dirlen - i - direction;	/* fix cursor */
		  if (i + direction == 0)
		    {
		      cursor -= direction;
Jim Blandy's avatar
Jim Blandy committed
890

891 892 893 894
		      set_search_regs (pos + cursor - p2 + ((direction > 0)
							    ? 1 - len : 0),
				       len);

Jim Blandy's avatar
Jim Blandy committed
895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926
		      if ((n -= direction) != 0)
			cursor += dirlen; /* to resume search */
		      else
			return ((direction > 0)
				? search_regs.end[0] : search_regs.start[0]);
		    }
		  else
		    cursor += stride_for_teases; /* <sigh> we lose -  */
		}
	      pos += cursor - p2;
	    }
	  else
	    /* Now we'll pick up a clump that has to be done the hard */
	    /* way because it covers a discontinuity */
	    {
	      limit = ((direction > 0)
		       ? BUFFER_CEILING_OF (pos - dirlen + 1)
		       : BUFFER_FLOOR_OF (pos - dirlen - 1));
	      limit = ((direction > 0)
		       ? min (limit + len, lim - 1)
		       : max (limit - len, lim));
	      /* LIMIT is now the last value POS can have
		 and still be valid for a possible match.  */
	      while (1)
		{
		  /* This loop can be coded for space rather than */
		  /* speed because it will usually run only once. */
		  /* (the reach is at most len + 21, and typically */
		  /* does not exceed len) */    
		  while ((limit - pos) * direction >= 0)
		    pos += BM_tab[FETCH_CHAR(pos)];
		  /* now run the same tests to distinguish going off the */
927
		  /* end, a match or a phony match. */
Jim Blandy's avatar
Jim Blandy committed
928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948
		  if ((pos - limit) * direction <= len)
		    break;	/* ran off the end */
		  /* Found what might be a match.
		     Set POS back to last (first if reverse) char pos.  */
		  pos -= infinity;
		  i = dirlen - direction;
		  while ((i -= direction) + direction != 0)
		    {
		      pos -= direction;
		      if (pat[i] != (((int) trt)
				     ? trt[FETCH_CHAR(pos)]
				     : FETCH_CHAR (pos)))
			break;
		    }
		  /* Above loop has moved POS part or all the way
		     back to the first char pos (last char pos if reverse).
		     Set it once again at the last (first if reverse) char.  */
		  pos += dirlen - i- direction;
		  if (i + direction == 0)
		    {
		      pos -= direction;
Jim Blandy's avatar
Jim Blandy committed
949

950 951 952
		      set_search_regs (pos + ((direction > 0) ? 1 - len : 0),
				       len);

Jim Blandy's avatar
Jim Blandy committed
953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969
		      if ((n -= direction) != 0)
			pos += dirlen; /* to resume search */
		      else
			return ((direction > 0)
				? search_regs.end[0] : search_regs.start[0]);
		    }
		  else
		    pos += stride_for_teases;
		}
	      }
	  /* We have done one clump.  Can we continue? */
	  if ((lim - pos) * direction < 0)
	    return ((0 - n) * direction);
	}
      return pos;
    }
}
970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996

/* Record beginning BEG and end BEG + LEN
   for a match just found in the current buffer.  */

static void
set_search_regs (beg, len)
     int beg, len;
{
  /* Make sure we have registers in which to store
     the match position.  */
  if (search_regs.num_regs == 0)
    {
      regoff_t *starts, *ends;

      starts = (regoff_t *) xmalloc (2 * sizeof (regoff_t));
      ends = (regoff_t *) xmalloc (2 * sizeof (regoff_t));
      BLOCK_INPUT;
      re_set_registers (&searchbuf,
			&search_regs,
			2, starts, ends);
      UNBLOCK_INPUT;
    }

  search_regs.start[0] = beg;
  search_regs.end[0] = beg + len;
  XSET (last_thing_searched, Lisp_Buffer, current_buffer);
}
Jim Blandy's avatar
Jim Blandy committed
997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 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 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152

/* Given a string of words separated by word delimiters,
  compute a regexp that matches those exact words
  separated by arbitrary punctuation.  */

static Lisp_Object
wordify (string)
     Lisp_Object string;
{
  register unsigned char *p, *o;
  register int i, len, punct_count = 0, word_count = 0;
  Lisp_Object val;

  CHECK_STRING (string, 0);
  p = XSTRING (string)->data;
  len = XSTRING (string)->size;

  for (i = 0; i < len; i++)
    if (SYNTAX (p[i]) != Sword)
      {
	punct_count++;
	if (i > 0 && SYNTAX (p[i-1]) == Sword) word_count++;
      }
  if (SYNTAX (p[len-1]) == Sword) word_count++;
  if (!word_count) return build_string ("");

  val = make_string (p, len - punct_count + 5 * (word_count - 1) + 4);

  o = XSTRING (val)->data;
  *o++ = '\\';
  *o++ = 'b';

  for (i = 0; i < len; i++)
    if (SYNTAX (p[i]) == Sword)
      *o++ = p[i];
    else if (i > 0 && SYNTAX (p[i-1]) == Sword && --word_count)
      {
	*o++ = '\\';
	*o++ = 'W';
	*o++ = '\\';
	*o++ = 'W';
	*o++ = '*';
      }

  *o++ = '\\';
  *o++ = 'b';

  return val;
}

DEFUN ("search-backward", Fsearch_backward, Ssearch_backward, 1, 4,
  "sSearch backward: ",
  "Search backward from point for STRING.\n\
Set point to the beginning of the occurrence found, and return point.\n\
An optional second argument bounds the search; it is a buffer position.\n\
The match found must not extend before that position.\n\
Optional third argument, if t, means if fail just return nil (no error).\n\
 If not nil and not t, position at limit of search and return nil.\n\
Optional fourth argument is repeat count--search for successive occurrences.\n\
See also the functions `match-beginning', `match-end' and `replace-match'.")
  (string, bound, noerror, count)
     Lisp_Object string, bound, noerror, count;
{
  return search_command (string, bound, noerror, count, -1, 0);
}

DEFUN ("search-forward", Fsearch_forward, Ssearch_forward, 1, 4, "sSearch: ",
  "Search forward from point for STRING.\n\
Set point to the end of the occurrence found, and return point.\n\
An optional second argument bounds the search; it is a buffer position.\n\
The match found must not extend after that position.  nil is equivalent\n\
  to (point-max).\n\
Optional third argument, if t, means if fail just return nil (no error).\n\
  If not nil and not t, move to limit of search and return nil.\n\
Optional fourth argument is repeat count--search for successive occurrences.\n\
See also the functions `match-beginning', `match-end' and `replace-match'.")
  (string, bound, noerror, count)
     Lisp_Object string, bound, noerror, count;
{
  return search_command (string, bound, noerror, count, 1, 0);
}

DEFUN ("word-search-backward", Fword_search_backward, Sword_search_backward, 1, 4,
  "sWord search backward: ",
  "Search backward from point for STRING, ignoring differences in punctuation.\n\
Set point to the beginning of the occurrence found, and return point.\n\
An optional second argument bounds the search; it is a buffer position.\n\
The match found must not extend before that position.\n\
Optional third argument, if t, means if fail just return nil (no error).\n\
  If not nil and not t, move to limit of search and return nil.\n\
Optional fourth argument is repeat count--search for successive occurrences.")
  (string, bound, noerror, count)
     Lisp_Object string, bound, noerror, count;
{
  return search_command (wordify (string), bound, noerror, count, -1, 1);
}

DEFUN ("word-search-forward", Fword_search_forward, Sword_search_forward, 1, 4,
  "sWord search: ",
  "Search forward from point for STRING, ignoring differences in punctuation.\n\
Set point to the end of the occurrence found, and return point.\n\
An optional second argument bounds the search; it is a buffer position.\n\
The match found must not extend after that position.\n\
Optional third argument, if t, means if fail just return nil (no error).\n\
  If not nil and not t, move to limit of search and return nil.\n\
Optional fourth argument is repeat count--search for successive occurrences.")
  (string, bound, noerror, count)
     Lisp_Object string, bound, noerror, count;
{
  return search_command (wordify (string), bound, noerror, count, 1, 1);
}

DEFUN ("re-search-backward", Fre_search_backward, Sre_search_backward, 1, 4,
  "sRE search backward: ",
  "Search backward from point for match for regular expression REGEXP.\n\
Set point to the beginning of the match, and return point.\n\
The match found is the one starting last in the buffer\n\
and yet ending before the place the origin of the search.\n\
An optional second argument bounds the search; it is a buffer position.\n\
The match found must start at or after that position.\n\
Optional third argument, if t, means if fail just return nil (no error).\n\
  If not nil and not t, move to limit of search and return nil.\n\
Optional fourth argument is repeat count--search for successive occurrences.\n\
See also the functions `match-beginning', `match-end' and `replace-match'.")
  (string, bound, noerror, count)
     Lisp_Object string, bound, noerror, count;
{
  return search_command (string, bound, noerror, count, -1, 1);
}

DEFUN ("re-search-forward", Fre_search_forward, Sre_search_forward, 1, 4,
  "sRE search: ",
  "Search forward from point for regular expression REGEXP.\n\
Set point to the end of the occurrence found, and return point.\n\
An optional second argument bounds the search; it is a buffer position.\n\
The match found must not extend after that position.\n\
Optional third argument, if t, means if fail just return nil (no error).\n\
  If not nil and not t, move to limit of search and return nil.\n\
Optional fourth argument is repeat count--search for successive occurrences.\n\
See also the functions `match-beginning', `match-end' and `replace-match'.")
  (string, bound, noerror, count)
     Lisp_Object string, bound, noerror, count;
{
  return search_command (string, bound, noerror, count, 1, 1);
}

DEFUN ("replace-match", Freplace_match, Sreplace_match, 1, 3, 0,
  "Replace text matched by last search with NEWTEXT.\n\
If second arg FIXEDCASE is non-nil, do not alter case of replacement text.\n\
Otherwise convert to all caps or cap initials, like replaced text.\n\
If third arg LITERAL is non-nil, insert NEWTEXT literally.\n\
Otherwise treat `\\' as special:\n\
  `\\&' in NEWTEXT means substitute original matched text.\n\
  `\\N' means substitute what matched the Nth `\\(...\\)'.\n\
       If Nth parens didn't match, substitute nothing.\n\
  `\\\\' means insert one `\\'.\n\
Jim Blandy's avatar
Jim Blandy committed
1153
FIXEDCASE and LITERAL are optional arguments.\n\
Jim Blandy's avatar
Jim Blandy committed
1154
Leaves point at end of replacement text.")
1155 1156
  (newtext, fixedcase, literal)
     Lisp_Object newtext, fixedcase, literal;
Jim Blandy's avatar
Jim Blandy committed
1157 1158 1159 1160
{
  enum { nochange, all_caps, cap_initial } case_action;
  register int pos, last;
  int some_multiletter_word;
1161 1162
  int some_lowercase;
  int some_uppercase_initial;
Jim Blandy's avatar
Jim Blandy committed
1163 1164 1165
  register int c, prevc;
  int inslen;

1166
  CHECK_STRING (newtext, 0);
Jim Blandy's avatar
Jim Blandy committed
1167 1168 1169

  case_action = nochange;	/* We tried an initialization */
				/* but some C compilers blew it */
Jim Blandy's avatar
Jim Blandy committed
1170 1171 1172 1173

  if (search_regs.num_regs <= 0)
    error ("replace-match called before any match found");

Jim Blandy's avatar
Jim Blandy committed
1174 1175 1176
  if (search_regs.start[0] < BEGV
      || search_regs.start[0] > search_regs.end[0]
      || search_regs.end[0] > ZV)
1177 1178
    args_out_of_range (make_number (search_regs.start[0]),
		       make_number (search_regs.end[0]));
Jim Blandy's avatar
Jim Blandy committed
1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190

  if (NILP (fixedcase))
    {
      /* Decide how to casify by examining the matched text. */

      last = search_regs.end[0];
      prevc = '\n';
      case_action = all_caps;

      /* some_multiletter_word is set nonzero if any original word
	 is more than one letter long. */
      some_multiletter_word = 0;
1191 1192
      some_lowercase = 0;
      some_uppercase_initial = 0;
Jim Blandy's avatar
Jim Blandy committed
1193 1194 1195 1196 1197 1198 1199 1200

      for (pos = search_regs.start[0]; pos < last; pos++)
	{
	  c = FETCH_CHAR (pos);
	  if (LOWERCASEP (c))
	    {
	      /* Cannot be all caps if any original char is lower case */

1201
	      some_lowercase = 1;
Jim Blandy's avatar
Jim Blandy committed
1202
	      if (SYNTAX (prevc) != Sword)
1203
		;
Jim Blandy's avatar
Jim Blandy committed
1204 1205 1206 1207 1208
	      else
		some_multiletter_word = 1;
	    }
	  else if (!NOCASEP (c))
	    {
1209 1210 1211
	      if (SYNTAX (prevc) != Sword)
		some_uppercase_initial = 1;
	      else
Jim Blandy's avatar
Jim Blandy committed
1212 1213 1214 1215 1216 1217
		some_multiletter_word = 1;
	    }

	  prevc = c;
	}

1218 1219 1220 1221 1222 1223
      /* Convert to all caps if the old text is all caps
	 and has at least one multiletter word.  */
      if (! some_lowercase && some_multiletter_word)
	case_action = all_caps;
      /* Capitalize each word, if the old text has a capitalized word.  */
      else if (some_uppercase_initial)
Jim Blandy's avatar
Jim Blandy committed
1224
	case_action = cap_initial;
1225 1226
      else
	case_action = nochange;
Jim Blandy's avatar
Jim Blandy committed
1227 1228
    }

1229 1230 1231 1232 1233
  /* We insert the replacement text before the old text, and then
     delete the original text.  This means that markers at the
     beginning or end of the original will float to the corresponding
     position in the replacement.  */
  SET_PT (search_regs.start[0]);
Jim Blandy's avatar
Jim Blandy committed
1234
  if (!NILP (literal))
1235
    Finsert_and_inherit (1, &newtext);
Jim Blandy's avatar
Jim Blandy committed
1236 1237 1238
  else
    {
      struct gcpro gcpro1;
1239
      GCPRO1 (newtext);
Jim Blandy's avatar
Jim Blandy committed
1240

1241
      for (pos = 0; pos < XSTRING (newtext)->size; pos++)
Jim Blandy's avatar
Jim Blandy committed
1242
	{
1243 1244
	  int offset = point - search_regs.start[0];

1245
	  c = XSTRING (newtext)->data[pos];
Jim Blandy's avatar
Jim Blandy committed
1246 1247
	  if (c == '\\')
	    {
1248
	      c = XSTRING (newtext)->data[++pos];
Jim Blandy's avatar
Jim Blandy committed
1249
	      if (c == '&')
1250 1251 1252 1253
		Finsert_buffer_substring
		  (Fcurrent_buffer (),
		   make_number (search_regs.start[0] + offset),
		   make_number (search_regs.end[0] + offset));
Jim Blandy's avatar
Jim Blandy committed
1254
	      else if (c >= '1' && c <= search_regs.num_regs + '0')
Jim Blandy's avatar
Jim Blandy committed
1255 1256
		{
		  if (search_regs.start[c - '0'] >= 1)
1257 1258 1259 1260
		    Finsert_buffer_substring
		      (Fcurrent_buffer (),
		       make_number (search_regs.start[c - '0'] + offset),
		       make_number (search_regs.end[c - '0'] + offset));
Jim Blandy's avatar
Jim Blandy committed
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270
		}
	      else
		insert_char (c);
	    }
	  else
	    insert_char (c);
	}
      UNGCPRO;
    }

1271 1272
  inslen = point - (search_regs.start[0]);
  del_range (search_regs.start[0] + inslen, search_regs.end[0] + inslen);
Jim Blandy's avatar
Jim Blandy committed
1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289

  if (case_action == all_caps)
    Fupcase_region (make_number (point - inslen), make_number (point));
  else if (case_action == cap_initial)
    upcase_initials_region (make_number (point - inslen), make_number (point));
  return Qnil;
}

static Lisp_Object
match_limit (num, beginningp)
     Lisp_Object num;
     int beginningp;
{
  register int n;

  CHECK_NUMBER (num, 0);
  n = XINT (num);
Jim Blandy's avatar
Jim Blandy committed
1290 1291 1292 1293
  if (n < 0 || n >= search_regs.num_regs)
    args_out_of_range (num, make_number (search_regs.num_regs));
  if (search_regs.num_regs <= 0
      || search_regs.start[n] < 0)
Jim Blandy's avatar
Jim Blandy committed
1294 1295 1296 1297 1298 1299 1300
    return Qnil;
  return (make_number ((beginningp) ? search_regs.start[n]
		                    : search_regs.end[n]));
}

DEFUN ("match-beginning", Fmatch_beginning, Smatch_beginning, 1, 1, 0,
  "Return position of start of text matched by last search.\n\
1301 1302
NUM specifies which parenthesized expression in the last regexp.\n\
 Value is nil if NUMth pair didn't match, or there were less than NUM pairs.\n\
Jim Blandy's avatar
Jim Blandy committed
1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328
Zero means the entire text matched by the whole regexp or whole string.")
  (num)
     Lisp_Object num;
{
  return match_limit (num, 1);
}

DEFUN ("match-end", Fmatch_end, Smatch_end, 1, 1, 0,
  "Return position of end of text matched by last search.\n\
ARG, a number, specifies which parenthesized expression in the last regexp.\n\
 Value is nil if ARGth pair didn't match, or there were less than ARG pairs.\n\
Zero means the entire text matched by the whole regexp or whole string.")
  (num)
     Lisp_Object num;
{
  return match_limit (num, 0);
} 

DEFUN ("match-data", Fmatch_data, Smatch_data, 0, 0, 0,
  "Return a list containing all info on what the last search matched.\n\
Element 2N is `(match-beginning N)'; element 2N + 1 is `(match-end N)'.\n\
All the elements are markers or nil (nil if the Nth pair didn't match)\n\
if the last match was on a buffer; integers or nil if a string was matched.\n\
Use `store-match-data' to reinstate the data in this list.")
  ()
{
Jim Blandy's avatar
Jim Blandy committed
1329
  Lisp_Object *data;
Jim Blandy's avatar
Jim Blandy committed
1330 1331
  int i, len;

Jim Blandy's avatar
Jim Blandy committed
1332 1333 1334
  if (NILP (last_thing_searched))
    error ("match-data called before any match found");

Jim Blandy's avatar
Jim Blandy committed
1335 1336 1337
  data = (Lisp_Object *) alloca ((2 * search_regs.num_regs)
				 * sizeof (Lisp_Object));

Jim Blandy's avatar
Jim Blandy committed
1338
  len = -1;
Jim Blandy's avatar
Jim Blandy committed
1339
  for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
1340 1341 1342 1343
    {
      int start = search_regs.start[i];
      if (start >= 0)
	{
Jim Blandy's avatar
Jim Blandy committed
1344
	  if (EQ (last_thing_searched, Qt))
Jim Blandy's avatar
Jim Blandy committed
1345 1346 1347 1348
	    {
	      XFASTINT (data[2 * i]) = start;
	      XFASTINT (data[2 * i + 1]) = search_regs.end[i];
	    }
Jim Blandy's avatar
Jim Blandy committed
1349
	  else if (XTYPE (last_thing_searched) == Lisp_Buffer)
Jim Blandy's avatar
Jim Blandy committed
1350 1351
	    {
	      data[2 * i] = Fmake_marker ();
Jim Blandy's avatar
Jim Blandy committed
1352 1353 1354
	      Fset_marker (data[2 * i],
			   make_number (start),
			   last_thing_searched);
Jim Blandy's avatar
Jim Blandy committed
1355 1356
	      data[2 * i + 1] = Fmake_marker ();
	      Fset_marker (data[2 * i + 1],
Jim Blandy's avatar
Jim Blandy committed
1357 1358
			   make_number (search_regs.end[i]), 
			   last_thing_searched);
Jim Blandy's avatar
Jim Blandy committed
1359
	    }
Jim Blandy's avatar
Jim Blandy committed
1360 1361 1362 1363
	  else
	    /* last_thing_searched must always be Qt, a buffer, or Qnil.  */
	    abort ();

Jim Blandy's avatar
Jim Blandy committed
1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382
	  len = i;
	}
      else
	data[2 * i] = data [2 * i + 1] = Qnil;
    }
  return Flist (2 * len + 2, data);
}


DEFUN ("store-match-data", Fstore_match_data, Sstore_match_data, 1, 1, 0,
  "Set internal data on last search match from elements of LIST.\n\
LIST should have been created by calling `match-data' previously.")
  (list)
     register Lisp_Object list;
{
  register int i;
  register Lisp_Object marker;

  if (!CONSP (list) && !NILP (list))
1383
    list = wrong_type_argument (Qconsp, list);
Jim Blandy's avatar
Jim Blandy committed
1384

Jim Blandy's avatar
Jim Blandy committed
1385 1386 1387 1388
  /* Unless we find a marker with a buffer in LIST, assume that this 
     match data came from a string.  */
  last_thing_searched = Qt;

Jim Blandy's avatar
Jim Blandy committed
1389 1390
  /* Allocate registers if they don't already exist.  */
  {
1391
    int length = XFASTINT (Flength (list)) / 2;
Jim Blandy's avatar
Jim Blandy committed
1392 1393 1394

    if (length > search_regs.num_regs)
      {
Jim Blandy's avatar
Jim Blandy committed
1395 1396 1397 1398 1399 1400 1401
	if (search_regs.num_regs == 0)
	  {
	    search_regs.start
	      = (regoff_t *) xmalloc (length * sizeof (regoff_t));
	    search_regs.end
	      = (regoff_t *) xmalloc (length * sizeof (regoff_t));
	  }
Jim Blandy's avatar
Jim Blandy committed
1402
	else
Jim Blandy's avatar
Jim Blandy committed
1403 1404 1405 1406 1407 1408 1409 1410
	  {
	    search_regs.start
	      = (regoff_t *) xrealloc (search_regs.start,
				       length * sizeof (regoff_t));
	    search_regs.end
	      = (regoff_t *) xrealloc (search_regs.end,
				       length * sizeof (regoff_t));
	  }
Jim Blandy's avatar
Jim Blandy committed
1411

1412
	BLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
1413 1414
	re_set_registers (&searchbuf, &search_regs, length,
			  search_regs.start, search_regs.end);
1415
	UNBLOCK_INPUT;
Jim Blandy's avatar
Jim Blandy committed
1416 1417 1418 1419
      }
  }

  for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
1420 1421 1422 1423 1424 1425 1426 1427 1428
    {
      marker = Fcar (list);
      if (NILP (marker))
	{
	  search_regs.start[i] = -1;
	  list = Fcdr (list);
	}
      else
	{
Jim Blandy's avatar
Jim Blandy committed
1429 1430 1431 1432 1433 1434 1435 1436
	  if (XTYPE (marker) == Lisp_Marker)
	    {
	      if (XMARKER (marker)->buffer == 0)
		XFASTINT (marker) = 0;
	      else
		XSET (last_thing_searched, Lisp_Buffer,
		      XMARKER (marker)->buffer);
	    }
Jim Blandy's avatar
Jim Blandy committed
1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493

	  CHECK_NUMBER_COERCE_MARKER (marker, 0);
	  search_regs.start[i] = XINT (marker);
	  list = Fcdr (list);

	  marker = Fcar (list);
	  if (XTYPE (marker) == Lisp_Marker
	      && XMARKER (marker)->buffer == 0)
	    XFASTINT (marker) = 0;

	  CHECK_NUMBER_COERCE_MARKER (marker, 0);
	  search_regs.end[i] = XINT (marker);
	}
      list = Fcdr (list);
    }

  return Qnil;  
}

/* Quote a string to inactivate reg-expr chars */

DEFUN ("regexp-quote", Fregexp_quote, Sregexp_quote, 1, 1, 0,
  "Return a regexp string which matches exactly STRING and nothing else.")
  (str)
     Lisp_Object str;
{
  register unsigned char *in, *out, *end;
  register unsigned char *temp;

  CHECK_STRING (str, 0);

  temp = (unsigned char *) alloca (XSTRING (str)->size * 2);

  /* Now copy the data into the new string, inserting escapes. */

  in = XSTRING (str)->data;
  end = in + XSTRING (str)->size;
  out = temp; 

  for (; in != end; in++)
    {
      if (*in == '[' || *in == ']'
	  || *in == '*' || *in == '.' || *in == '\\'
	  || *in == '?' || *in == '+'
	  || *in == '^' || *in == '$')
	*out++ = '\\';
      *out++ = *in;
    }

  return make_string (temp, out - temp);
}
  
syms_of_search ()
{
  register int i;

  searchbuf.allocated = 100;
Jim Blandy's avatar
Jim Blandy committed
1494
  searchbuf.buffer = (unsigned char *) malloc (searchbuf.allocated);
Jim Blandy's avatar
Jim Blandy committed
1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514
  searchbuf.fastmap = search_fastmap;

  Qsearch_failed = intern ("search-failed");
  staticpro (&Qsearch_failed);
  Qinvalid_regexp = intern ("invalid-regexp");
  staticpro (&Qinvalid_regexp);

  Fput (Qsearch_failed, Qerror_conditions,
	Fcons (Qsearch_failed, Fcons (Qerror, Qnil)));
  Fput (Qsearch_failed, Qerror_message,
	build_string ("Search failed"));

  Fput (Qinvalid_regexp, Qerror_conditions,
	Fcons (Qinvalid_regexp, Fcons (Qerror, Qnil)));
  Fput (Qinvalid_regexp, Qerror_message,
	build_string ("Invalid regexp"));

  last_regexp = Qnil;
  staticpro (&last_regexp);

Jim Blandy's avatar
Jim Blandy committed
1515 1516 1517
  last_thing_searched = Qnil;
  staticpro (&last_thing_searched);

Jim Blandy's avatar
Jim Blandy committed
1518 1519 1520 1521
  defsubr (&Sstring_match);
  defsubr (&Slooking_at);
  defsubr (&Sskip_chars_forward);
  defsubr (&Sskip_chars_backward);
1522 1523
  defsubr (&Sskip_syntax_forward);
  defsubr (&Sskip_syntax_backward);
Jim Blandy's avatar
Jim Blandy committed
1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536
  defsubr (&Ssearch_forward);
  defsubr (&Ssearch_backward);
  defsubr (&Sword_search_forward);
  defsubr (&Sword_search_backward);
  defsubr (&Sre_search_forward);
  defsubr (&Sre_search_backward);
  defsubr (&Sreplace_match);
  defsubr (&Smatch_beginning);
  defsubr (&Smatch_end);
  defsubr (&Smatch_data);
  defsubr (&Sstore_match_data);
  defsubr (&Sregexp_quote);
}