search.c 60.5 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"
31
#include "intervals.h"
Jim Blandy's avatar
Jim Blandy committed
32

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

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

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

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

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


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

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

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

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

Lisp_Object Qinvalid_regexp;

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

88 89
static int search_buffer ();

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

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

102 103 104 105 106 107 108 109 110
/* 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
111 112 113 114
   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
115

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

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

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

/* Compile a regexp if necessary, but first check to see if there's one in
146 147 148 149 150 151 152 153 154
   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.  */
155 156

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

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

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

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

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

223 224 225
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
226
  CHECK_STRING (string, 0);
227 228
  bufp = compile_pattern (string, &search_regs,
			  (!NILP (current_buffer->case_fold_search)
229
			   ? XCHAR_TABLE (DOWNCASE_TABLE)->contents : 0),
230
			  posix);
Jim Blandy's avatar
Jim Blandy committed
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 254

  re_match_object = Qnil;
Jim Blandy's avatar
Jim Blandy committed
255
  
256
  i = re_match_2 (bufp, (char *) p1, s1, (char *) p2, s2,
257
		  PT - BEGV, &search_regs,
Jim Blandy's avatar
Jim Blandy committed
258 259 260 261 262
		  ZV - BEGV);
  if (i == -2)
    matcher_overflow ();

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

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

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

306 307 308
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
309 310 311 312 313 314 315 316 317 318 319 320
  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
321
	s = len + s;
Jim Blandy's avatar
Jim Blandy committed
322 323 324 325
      else if (0 > s || s > len)
	args_out_of_range (string, start);
    }

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

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

380
  bufp = compile_pattern (regexp, 0, 0, 0);
Richard M. Stallman's avatar
Richard M. Stallman committed
381
  immediate_quit = 1;
382 383
  re_match_object = string;
  
384
  val = re_search (bufp, (char *) XSTRING (string)->data,
Richard M. Stallman's avatar
Richard M. Stallman committed
385 386 387 388 389
		   XSTRING (string)->size, 0, XSTRING (string)->size,
		   0);
  immediate_quit = 0;
  return val;
}
Karl Heuer's avatar
Karl Heuer committed
390 391 392 393 394 395 396 397

/* 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
398
fast_c_string_match_ignore_case (regexp, string)
Karl Heuer's avatar
Karl Heuer committed
399 400 401 402 403 404 405
     Lisp_Object regexp;
     char *string;
{
  int val;
  struct re_pattern_buffer *bufp;
  int len = strlen (string);

406
  re_match_object = Qt;
Karl Heuer's avatar
Karl Heuer committed
407 408 409 410 411 412 413
  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
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 461 462 463 464 465 466 467 468
/* 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
469 470

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

474 475
   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
476

477 478 479
   If ALLOW_QUIT is non-zero, set immediate_quit.  That's good to do
   except when inside redisplay.  */

480 481 482 483 484
scan_buffer (target, start, end, count, shortage, allow_quit)
     register int target;
     int start, end;
     int count;
     int *shortage;
485
     int allow_quit;
Jim Blandy's avatar
Jim Blandy committed
486
{
487 488
  struct region_cache *newline_cache;
  int direction; 
Jim Blandy's avatar
Jim Blandy committed
489

490 491 492 493 494 495 496 497 498 499
  if (count > 0)
    {
      direction = 1;
      if (! end) end = ZV;
    }
  else
    {
      direction = -1;
      if (! end) end = BEGV;
    }
Jim Blandy's avatar
Jim Blandy committed
500

501 502
  newline_cache_on_off (current_buffer);
  newline_cache = current_buffer->newline_cache;
Jim Blandy's avatar
Jim Blandy committed
503 504 505 506

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

507
  immediate_quit = allow_quit;
Jim Blandy's avatar
Jim Blandy committed
508

Jim Blandy's avatar
Jim Blandy committed
509
  if (count > 0)
510
    while (start != end)
Jim Blandy's avatar
Jim Blandy committed
511
      {
512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527
        /* 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;
528
            immediate_quit = allow_quit;
529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546

            /* 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
547 548
          register unsigned char *ceiling_addr = POS_ADDR (ceiling) + 1;
          register unsigned char *cursor = POS_ADDR (start);
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579
          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
580 581
      }
  else
582 583 584 585 586 587 588 589 590 591 592 593 594
    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;
595
            immediate_quit = allow_quit;
596 597 598 599 600 601 602 603 604 605 606 607 608 609 610

            /* 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
611 612
          register unsigned char *ceiling_addr = POS_ADDR (ceiling);
          register unsigned char *cursor = POS_ADDR (start - 1);
613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
          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
645 646
  immediate_quit = 0;
  if (shortage != 0)
Jim Blandy's avatar
Jim Blandy committed
647
    *shortage = count * direction;
648
  return start;
Jim Blandy's avatar
Jim Blandy committed
649 650
}

651 652 653 654
int
find_next_newline_no_quit (from, cnt)
     register int from, cnt;
{
655
  return scan_buffer ('\n', from, 0, cnt, (int *) 0, 0);
656 657
}

Jim Blandy's avatar
Jim Blandy committed
658 659 660 661
int
find_next_newline (from, cnt)
     register int from, cnt;
{
662 663 664 665 666 667 668 669 670
  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)
671
     int from, to, cnt;
672 673 674 675 676 677 678 679
{
  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
680 681 682 683 684
}

/* Subroutines of Lisp buffer search functions. */

static Lisp_Object
685
search_command (string, bound, noerror, count, direction, RE, posix)
Jim Blandy's avatar
Jim Blandy committed
686 687 688
     Lisp_Object string, bound, noerror, count;
     int direction;
     int RE;
689
     int posix;
Jim Blandy's avatar
Jim Blandy committed
690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707
{
  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);
708
      if (n > 0 ? lim < PT : lim > PT)
Jim Blandy's avatar
Jim Blandy committed
709 710 711 712 713 714 715
	error ("Invalid search bound (wrong side of point)");
      if (lim > ZV)
	lim = ZV;
      if (lim < BEGV)
	lim = BEGV;
    }

716
  np = search_buffer (string, PT, lim, n, RE,
Jim Blandy's avatar
Jim Blandy committed
717
		      (!NILP (current_buffer->case_fold_search)
718 719
		       ? XCHAR_TABLE (current_buffer->case_canon_table)->contents
		       : 0),
Jim Blandy's avatar
Jim Blandy committed
720
		      (!NILP (current_buffer->case_fold_search)
721 722
		       ? XCHAR_TABLE (current_buffer->case_eqv_table)->contents
		       : 0),
723
		      posix);
Jim Blandy's avatar
Jim Blandy committed
724 725 726 727 728 729 730 731
  if (np <= 0)
    {
      if (NILP (noerror))
	return signal_failure (string);
      if (!EQ (noerror, Qt))
	{
	  if (lim < BEGV || lim > ZV)
	    abort ();
732 733 734 735
	  SET_PT (lim);
	  return Qnil;
#if 0 /* This would be clean, but maybe programs depend on
	 a value of nil here.  */
736
	  np = lim;
737
#endif
Jim Blandy's avatar
Jim Blandy committed
738
	}
739 740
      else
	return Qnil;
Jim Blandy's avatar
Jim Blandy committed
741 742 743 744 745 746 747 748 749 750
    }

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

  SET_PT (np);

  return make_number (np);
}

Karl Heuer's avatar
Karl Heuer committed
751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770
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':
771
	    case 'S': case '=':
Karl Heuer's avatar
Karl Heuer committed
772
	    case 'c': case 'C':	/* for categoryspec and notcategoryspec */
773
	    case '1': case '2': case '3': case '4': case '5':
Karl Heuer's avatar
Karl Heuer committed
774 775 776 777 778 779 780 781
	    case '6': case '7': case '8': case '9':
	      return 0;
	    }
	}
    }
  return 1;
}

782
/* Search for the n'th occurrence of STRING in the current buffer,
Jim Blandy's avatar
Jim Blandy committed
783
   starting at position POS and stopping at position LIM,
784
   treating STRING as a literal string if RE is false or as
Jim Blandy's avatar
Jim Blandy committed
785 786 787 788 789 790 791
   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
792 793 794 795
   (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
796

797 798
static int
search_buffer (string, pos, lim, n, RE, trt, inverse_trt, posix)
Jim Blandy's avatar
Jim Blandy committed
799 800 801 802 803
     Lisp_Object string;
     int pos;
     int lim;
     int n;
     int RE;
804 805
     Lisp_Object *trt;
     Lisp_Object *inverse_trt;
806
     int posix;
Jim Blandy's avatar
Jim Blandy committed
807 808 809 810 811 812 813 814 815 816 817 818 819
{
  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;

820 821 822
  if (running_asynch_code)
    save_search_regs ();

Jim Blandy's avatar
Jim Blandy committed
823
  /* Null string is found at starting position.  */
824
  if (len == 0)
825 826 827 828
    {
      set_search_regs (pos, 0);
      return pos;
    }
829 830 831

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

Karl Heuer's avatar
Karl Heuer committed
834
  if (RE && !trivial_regexp_p (string))
Jim Blandy's avatar
Jim Blandy committed
835
    {
836 837
      struct re_pattern_buffer *bufp;

838
      bufp = compile_pattern (string, &search_regs, trt, posix);
Jim Blandy's avatar
Jim Blandy committed
839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862

      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;
	}
863 864
      re_match_object = Qnil;
  
Jim Blandy's avatar
Jim Blandy committed
865 866
      while (n < 0)
	{
867
	  int val;
868
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,
869 870 871
			     pos - BEGV, lim - pos, &search_regs,
			     /* Don't allow match past current point */
			     pos - BEGV);
Jim Blandy's avatar
Jim Blandy committed
872
	  if (val == -2)
Karl Heuer's avatar
Karl Heuer committed
873 874 875
	    {
	      matcher_overflow ();
	    }
Jim Blandy's avatar
Jim Blandy committed
876 877 878
	  if (val >= 0)
	    {
	      j = BEGV;
Jim Blandy's avatar
Jim Blandy committed
879
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
880 881 882 883 884
		if (search_regs.start[i] >= 0)
		  {
		    search_regs.start[i] += j;
		    search_regs.end[i] += j;
		  }
885
	      XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
886 887 888 889 890 891 892 893 894 895 896 897
	      /* Set pos to the new position. */
	      pos = search_regs.start[0];
	    }
	  else
	    {
	      immediate_quit = 0;
	      return (n);
	    }
	  n++;
	}
      while (n > 0)
	{
898
	  int val;
899
	  val = re_search_2 (bufp, (char *) p1, s1, (char *) p2, s2,
900 901
			     pos - BEGV, lim - pos, &search_regs,
			     lim - BEGV);
Jim Blandy's avatar
Jim Blandy committed
902
	  if (val == -2)
Karl Heuer's avatar
Karl Heuer committed
903 904 905
	    {
	      matcher_overflow ();
	    }
Jim Blandy's avatar
Jim Blandy committed
906 907 908
	  if (val >= 0)
	    {
	      j = BEGV;
Jim Blandy's avatar
Jim Blandy committed
909
	      for (i = 0; i < search_regs.num_regs; i++)
Jim Blandy's avatar
Jim Blandy committed
910 911 912 913 914
		if (search_regs.start[i] >= 0)
		  {
		    search_regs.start[i] += j;
		    search_regs.end[i] += j;
		  }
915
	      XSETBUFFER (last_thing_searched, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935
	      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
936 937 938 939 940 941 942 943 944 945 946 947 948
      {
	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++;
	      }
949
	    *pat++ = (trt ? XINT (trt[*base_pat++]) : *base_pat++);
Karl Heuer's avatar
Karl Heuer committed
950 951 952 953
	  }
	len = pat - patbuf;
	pat = base_pat = patbuf;
      }
Jim Blandy's avatar
Jim Blandy committed
954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 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 997 998 999 1000 1001
      /* 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;
1002
	  if (trt != 0)
Jim Blandy's avatar
Jim Blandy committed
1003
	    {
1004
	      k = (j = XINT (trt[j]));
Jim Blandy's avatar
Jim Blandy committed
1005 1006 1007 1008 1009
	      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 */ 
1010
	      while ((j = (unsigned char) XINT (inverse_trt[j])) != k)
Jim Blandy's avatar
Jim Blandy committed
1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030
		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)
	{
1031 1032 1033 1034
	  /* It's been reported that some (broken) compiler thinks that
	     Boolean expressions in an arithmetic context are unsigned.
	     Using an explicit ?1:0 prevents this.  */
	  if ((lim - pos - ((direction > 0) ? 1 : 0)) * direction < 0)
Jim Blandy's avatar
Jim Blandy committed
1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
	    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)
	    {
Karl Heuer's avatar
Karl Heuer committed
1050 1051
	      p_limit = POS_ADDR (limit);
	      p2 = (cursor = POS_ADDR (pos));
Jim Blandy's avatar
Jim Blandy committed
1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063
	      /* 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.  */
1064
		      if ((EMACS_INT) (p_limit + infinity) > (EMACS_INT) p_limit)
1065
			while ((EMACS_INT) cursor <= (EMACS_INT) p_limit)
Jim Blandy's avatar
Jim Blandy committed
1066 1067
			  cursor += BM_tab[*cursor];
		      else
1068
			while ((EMACS_UINT) cursor <= (EMACS_UINT) p_limit)
Jim Blandy's avatar
Jim Blandy committed
1069 1070 1071 1072
			  cursor += BM_tab[*cursor];
		    }
		  else
		    {
1073 1074
		      if ((EMACS_INT) (p_limit + infinity) < (EMACS_INT) p_limit)
			while ((EMACS_INT) cursor >= (EMACS_INT) p_limit)
Jim Blandy's avatar
Jim Blandy committed
1075 1076
			  cursor += BM_tab[*cursor];
		      else
1077
			while ((EMACS_UINT) cursor >= (EMACS_UINT) p_limit)
Jim Blandy's avatar
Jim Blandy committed
1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
			  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;
1090
		  if (trt != 0)
Jim Blandy's avatar
Jim Blandy committed
1091 1092
		    {
		      while ((i -= direction) + direction != 0)
1093
			if (pat[i] != XINT (trt[*(cursor -= direction)]))
Jim Blandy's avatar
Jim Blandy committed
1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105
			  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
1106

1107 1108 1109 1110
		      set_search_regs (pos + cursor - p2 + ((direction > 0)
							    ? 1 - len : 0),
				       len);

Jim Blandy's avatar
Jim Blandy committed
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
		      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)
Karl Heuer's avatar
Karl Heuer committed
1141
		    pos += BM_tab[FETCH_BYTE (pos)];
Jim Blandy's avatar
Jim Blandy committed
1142
		  /* now run the same tests to distinguish going off the */
1143
		  /* end, a match or a phony match. */
Jim Blandy's avatar
Jim Blandy committed
1144 1145 1146 1147 1148 1149 1150 1151 1152
		  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;
1153
		      if (pat[i] != (trt != 0
1154
				     ? XINT (trt[FETCH_BYTE (pos)])
Karl Heuer's avatar
Karl Heuer committed
1155
				     : FETCH_BYTE (pos)))
Jim Blandy's avatar
Jim Blandy committed
1156 1157 1158 1159 1160 1161 1162 1163 1164
			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
1165

1166 1167 1168
		      set_search_regs (pos + ((direction > 0) ? 1 - len : 0),
				       len);

Jim Blandy's avatar
Jim Blandy committed
1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185
		      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;
    }
}
1186 1187 1188 1189 1190