intervals.c 42.8 KB
Newer Older
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1
/* Code for doing intervals.
2
   Copyright (C) 1993 Free Software Foundation, Inc.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45

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


/* NOTES:

   Have to ensure that we can't put symbol nil on a plist, or some
   functions may work incorrectly.

   An idea:  Have the owner of the tree keep count of splits and/or
   insertion lengths (in intervals), and balance after every N.

   Need to call *_left_hook when buffer is killed.

   Scan for zero-length, or 0-length to see notes about handling
   zero length interval-markers.

   There are comments around about freeing intervals.  It might be
   faster to explicitly free them (put them on the free list) than
   to GC them.

*/


#include "config.h"
#include "lisp.h"
#include "intervals.h"
#include "buffer.h"

46 47 48
/* The rest of the file is within this conditional. */
#ifdef USE_TEXT_PROPERTIES

Joseph Arceneaux's avatar
Joseph Arceneaux committed
49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93
/* Factor for weight-balancing interval trees. */
Lisp_Object interval_balance_threshold;

/* Utility functions for intervals. */


/* Create the root interval of some object, a buffer or string. */

INTERVAL
create_root_interval (parent)
     Lisp_Object parent;
{
  INTERVAL new = make_interval ();

  if (XTYPE (parent) == Lisp_Buffer)
    {
      new->total_length = BUF_Z (XBUFFER (parent)) - 1;
      XBUFFER (parent)->intervals = new;
    }
  else if (XTYPE (parent) == Lisp_String)
    {
      new->total_length = XSTRING (parent)->size;
      XSTRING (parent)->intervals = new;
    }

  new->parent = (INTERVAL) parent;
  new->position = 1;

  return new;
}

/* Make the interval TARGET have exactly the properties of SOURCE */

void
copy_properties (source, target)
     register INTERVAL source, target;
{
  if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target))
    return;

  COPY_INTERVAL_CACHE (source, target);
  target->plist = Fcopy_sequence (source->plist);
}

/* Merge the properties of interval SOURCE into the properties
94 95
   of interval TARGET.  That is to say, each property in SOURCE
   is added to TARGET if TARGET has no such property as yet.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138

static void
merge_properties (source, target)
     register INTERVAL source, target;
{
  register Lisp_Object o, sym, val;

  if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target))
    return;

  MERGE_INTERVAL_CACHE (source, target);

  o = source->plist;
  while (! EQ (o, Qnil))
    {
      sym = Fcar (o);
      val = Fmemq (sym, target->plist);

      if (NILP (val))
	{
	  o = Fcdr (o);
	  val = Fcar (o);
	  target->plist = Fcons (sym, Fcons (val, target->plist));
	  o = Fcdr (o);
	}
      else
	o = Fcdr (Fcdr (o));
    }
}

/* Return 1 if the two intervals have the same properties,
   0 otherwise. */

int
intervals_equal (i0, i1)
     INTERVAL i0, i1;
{
  register Lisp_Object i0_cdr, i0_sym, i1_val;
  register i1_len;

  if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1))
    return 1;

139 140 141
  if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1))
    return 0;

Joseph Arceneaux's avatar
Joseph Arceneaux committed
142 143 144 145 146 147 148 149 150 151 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
  i1_len = XFASTINT (Flength (i1->plist));
  if (i1_len & 0x1)		/* Paranoia -- plists are always even */
    abort ();
  i1_len /= 2;
  i0_cdr = i0->plist;
  while (!NILP (i0_cdr))
    {
      /* Lengths of the two plists were unequal */
      if (i1_len == 0)
	return 0;

      i0_sym = Fcar (i0_cdr);
      i1_val = Fmemq (i0_sym, i1->plist);

      /* i0 has something i1 doesn't */
      if (EQ (i1_val, Qnil))
	return 0;

      /* i0 and i1 both have sym, but it has different values in each */
      i0_cdr = Fcdr (i0_cdr);
      if (! Fequal (i1_val, Fcar (i0_cdr)))
	return 0;

      i0_cdr = Fcdr (i0_cdr);
      i1_len--;
    }

  /* Lengths of the two plists were unequal */
  if (i1_len > 0)
    return 0;

  return 1;
}

static int icount;
static int idepth;
static int zero_length;

/* Traverse an interval tree TREE, performing FUNCTION on each node.
181
   Pass FUNCTION two args: an interval, and ARG.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
182 183

void
184
traverse_intervals (tree, position, depth, function, arg)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
185
     INTERVAL tree;
186
     int position, depth;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
187
     void (* function) ();
188
     Lisp_Object arg;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
189 190 191 192
{
  if (NULL_INTERVAL_P (tree))
    return;

193
  traverse_intervals (tree->left, position, depth + 1, function, arg);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
194 195
  position += LEFT_TOTAL_LENGTH (tree);
  tree->position = position;
196
  (*function) (tree, arg);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
197
  position += LENGTH (tree);
198
  traverse_intervals (tree->right, position, depth + 1,  function, arg);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223
}

#if 0
/* These functions are temporary, for debugging purposes only. */

INTERVAL search_interval, found_interval;

void
check_for_interval (i)
     register INTERVAL i;
{
  if (i == search_interval)
    {
      found_interval = i;
      icount++;
    }
}

INTERVAL
search_for_interval (i, tree)
     register INTERVAL i, tree;
{
  icount = 0;
  search_interval = i;
  found_interval = NULL_INTERVAL;
224
  traverse_intervals (tree, 1, 0, &check_for_interval, Qnil);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
  return found_interval;
}

static void
inc_interval_count (i)
     INTERVAL i;
{
  icount++;
  if (LENGTH (i) == 0)
    zero_length++;
  if (depth > idepth)
    idepth = depth;
}

int
count_intervals (i)
     register INTERVAL i;
{
  icount = 0;
  idepth = 0;
  zero_length = 0;
246
  traverse_intervals (i, 1, 0, &inc_interval_count, Qnil);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349

  return icount;
}

static INTERVAL
root_interval (interval)
     INTERVAL interval;
{
  register INTERVAL i = interval;

  while (! ROOT_INTERVAL_P (i))
    i = i->parent;

  return i;
}
#endif

/* Assuming that a left child exists, perform the following operation:

     A		  B
    / \		 / \
   B       =>       A
  / \		   / \
     c		  c
*/

static INTERVAL
rotate_right (interval)
     INTERVAL interval;
{
  INTERVAL i;
  INTERVAL B = interval->left;
  int len = LENGTH (interval);

  /* Deal with any Parent of A;  make it point to B. */
  if (! ROOT_INTERVAL_P (interval))
    if (AM_LEFT_CHILD (interval))
      interval->parent->left = interval->left;
    else
      interval->parent->right = interval->left;
  interval->left->parent = interval->parent;

  /* B gets the same length as A, since it get A's position in the tree. */
  interval->left->total_length = interval->total_length;

  /* B becomes the parent of A. */
  i = interval->left->right;
  interval->left->right = interval;
  interval->parent = interval->left;

  /* A gets c as left child. */
  interval->left = i;
  if (! NULL_INTERVAL_P (i))
    i->parent = interval;
  interval->total_length = (len + LEFT_TOTAL_LENGTH (interval)
			    + RIGHT_TOTAL_LENGTH (interval));

  return B;
}

/* Assuming that a right child exists, perform the following operation:

    A               B   
   / \	           / \  
      B	   =>     A
     / \         / \    
    c               c
*/

static INTERVAL
rotate_left (interval)
     INTERVAL interval;
{
  INTERVAL i;
  INTERVAL B = interval->right;
  int len = LENGTH (interval);

  /* Deal with the parent of A. */
  if (! ROOT_INTERVAL_P (interval))
    if (AM_LEFT_CHILD (interval))
      interval->parent->left = interval->right;
    else
      interval->parent->right = interval->right;
  interval->right->parent = interval->parent;

  /* B must have the same total length of A. */
  interval->right->total_length = interval->total_length;

  /* Make B the parent of A */
  i = interval->right->left;
  interval->right->left = interval;
  interval->parent = interval->right;

  /* Make A point to c */
  interval->right = i;
  if (! NULL_INTERVAL_P (i))
    i->parent = interval;
  interval->total_length = (len + LEFT_TOTAL_LENGTH (interval)
			    + RIGHT_TOTAL_LENGTH (interval));

  return B;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
350 351 352 353 354 355 356 357
/* Split INTERVAL into two pieces, starting the second piece at character
   position OFFSET (counting from 1), relative to INTERVAL.  The right-hand
   piece (second, lexicographically) is returned.

   The size and position fields of the two intervals are set based upon
   those of the original interval.  The property list of the new interval
   is reset, thus it is up to the caller to do the right thing with the
   result.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
358 359 360 361 362

   Note that this does not change the position of INTERVAL;  if it is a root,
   it is still a root after this operation. */

INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
363
split_interval_right (interval, offset)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
364
     INTERVAL interval;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
365
     int offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
366 367 368
{
  INTERVAL new = make_interval ();
  int position = interval->position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
369
  int new_length = LENGTH (interval) - offset + 1;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
370

Joseph Arceneaux's avatar
Joseph Arceneaux committed
371
  new->position = position + offset - 1;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391
  new->parent = interval;

  if (LEAF_INTERVAL_P (interval) || NULL_RIGHT_CHILD (interval))
    {
      interval->right = new;
      new->total_length = new_length;

      return new;
    }

  /* Insert the new node between INTERVAL and its right child. */
  new->right = interval->right;
  interval->right->parent = new;
  interval->right = new;

  new->total_length = new_length + new->right->total_length;

  return new;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
392 393 394
/* Split INTERVAL into two pieces, starting the second piece at character
   position OFFSET (counting from 1), relative to INTERVAL.  The left-hand
   piece (first, lexicographically) is returned.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
395

Joseph Arceneaux's avatar
Joseph Arceneaux committed
396 397 398 399 400 401 402
   The size and position fields of the two intervals are set based upon
   those of the original interval.  The property list of the new interval
   is reset, thus it is up to the caller to do the right thing with the
   result.

   Note that this does not change the position of INTERVAL;  if it is a root,
   it is still a root after this operation. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
403 404

INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
405
split_interval_left (interval, offset)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
406
     INTERVAL interval;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
407
     int offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
408 409 410
{
  INTERVAL new = make_interval ();
  int position = interval->position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
411
  int new_length = offset - 1;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
412 413

  new->position = interval->position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
414
  interval->position = interval->position + offset - 1;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
415 416 417 418 419 420 421 422 423 424 425 426 427 428
  new->parent = interval;

  if (NULL_LEFT_CHILD (interval))
    {
      interval->left = new;
      new->total_length = new_length;

      return new;
    }

  /* Insert the new node between INTERVAL and its left child. */
  new->left = interval->left;
  new->left->parent = new;
  interval->left = new;
429
  new->total_length = new_length + LEFT_TOTAL_LENGTH (new);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
430 431 432 433

  return new;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
434 435 436
/* Find the interval containing text position POSITION in the text
   represented by the interval tree TREE.  POSITION is relative to
   the beginning of that text.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
437

Joseph Arceneaux's avatar
Joseph Arceneaux committed
438 439 440 441 442
   The `position' field, which is a cache of an interval's position,
   is updated in the interval found.  Other functions (e.g., next_interval)
   will update this cache based on the result of find_interval. */

INLINE INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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 469 470 471 472 473 474 475 476 477 478 479 480
find_interval (tree, position)
     register INTERVAL tree;
     register int position;
{
  register int relative_position = position;

  if (NULL_INTERVAL_P (tree))
    return NULL_INTERVAL;

  if (position > TOTAL_LENGTH (tree))
    abort ();			/* Paranoia */
#if 0
    position = TOTAL_LENGTH (tree);
#endif

  while (1)
    {
      if (relative_position <= LEFT_TOTAL_LENGTH (tree))
	{
	  tree = tree->left;
	}
      else if (relative_position > (TOTAL_LENGTH (tree)
				    - RIGHT_TOTAL_LENGTH (tree)))
	{
	  relative_position -= (TOTAL_LENGTH (tree)
				- RIGHT_TOTAL_LENGTH (tree));
	  tree = tree->right;
	}
      else
	{
	  tree->position = LEFT_TOTAL_LENGTH (tree)
	                   + position - relative_position + 1;
	  return tree;
	}
    }
}

/* Find the succeeding interval (lexicographically) to INTERVAL.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
481 482
   Sets the `position' field based on that of INTERVAL (see
   find_interval). */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520

INTERVAL
next_interval (interval)
     register INTERVAL interval;
{
  register INTERVAL i = interval;
  register int next_position;

  if (NULL_INTERVAL_P (i))
    return NULL_INTERVAL;
  next_position = interval->position + LENGTH (interval);

  if (! NULL_RIGHT_CHILD (i))
    {
      i = i->right;
      while (! NULL_LEFT_CHILD (i))
	i = i->left;

      i->position = next_position;
      return i;
    }

  while (! NULL_PARENT (i))
    {
      if (AM_LEFT_CHILD (i))
	{
	  i = i->parent;
	  i->position = next_position;
	  return i;
	}

      i = i->parent;
    }

  return NULL_INTERVAL;
}

/* Find the preceding interval (lexicographically) to INTERVAL.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
521 522
   Sets the `position' field based on that of INTERVAL (see
   find_interval). */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

INTERVAL
previous_interval (interval)
     register INTERVAL interval;
{
  register INTERVAL i;
  register position_of_previous;

  if (NULL_INTERVAL_P (interval))
    return NULL_INTERVAL;

  if (! NULL_LEFT_CHILD (interval))
    {
      i = interval->left;
      while (! NULL_RIGHT_CHILD (i))
	i = i->right;

      i->position = interval->position - LENGTH (i);
      return i;
    }

  i = interval;
  while (! NULL_PARENT (i))
    {
      if (AM_RIGHT_CHILD (i))
	{
	  i = i->parent;

	  i->position = interval->position - LENGTH (i);
	  return i;
	}
      i = i->parent;
    }

  return NULL_INTERVAL;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
560
#if 0
Joseph Arceneaux's avatar
Joseph Arceneaux committed
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 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 615 616
/* Traverse a path down the interval tree TREE to the interval
   containing POSITION, adjusting all nodes on the path for
   an addition of LENGTH characters.  Insertion between two intervals
   (i.e., point == i->position, where i is second interval) means
   text goes into second interval.

   Modifications are needed to handle the hungry bits -- after simply
   finding the interval at position (don't add length going down),
   if it's the beginning of the interval, get the previous interval
   and check the hugry bits of both.  Then add the length going back up
   to the root. */

static INTERVAL
adjust_intervals_for_insertion (tree, position, length)
     INTERVAL tree;
     int position, length;
{
  register int relative_position;
  register INTERVAL this;

  if (TOTAL_LENGTH (tree) == 0)	/* Paranoia */
    abort ();

  /* If inserting at point-max of a buffer, that position
     will be out of range */
  if (position > TOTAL_LENGTH (tree))
    position = TOTAL_LENGTH (tree);
  relative_position = position;
  this = tree;

  while (1)
    {
      if (relative_position <= LEFT_TOTAL_LENGTH (this))
	{
	  this->total_length += length;
	  this = this->left;
	}
      else if (relative_position > (TOTAL_LENGTH (this)
				    - RIGHT_TOTAL_LENGTH (this)))
	{
	  relative_position -= (TOTAL_LENGTH (this)
				- RIGHT_TOTAL_LENGTH (this));
	  this->total_length += length;
	  this = this->right;
	}
      else
	{
	  /* If we are to use zero-length intervals as buffer pointers,
	     then this code will have to change. */
	  this->total_length += length;
	  this->position = LEFT_TOTAL_LENGTH (this)
	                   + position - relative_position + 1;
	  return tree;
	}
    }
}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
617 618 619 620 621 622 623 624 625 626 627
#endif

/* Effect an adjustment corresponding to the addition of LENGTH characters
   of text.  Do this by finding the interval containing POSITION in the
   interval tree TREE, and then adjusting all of it's ancestors by adding
   LENGTH to them.

   If POSITION is the first character of an interval, meaning that point
   is actually between the two intervals, make the new text belong to
   the interval which is "sticky".

Joseph Arceneaux's avatar
Joseph Arceneaux committed
628
   If both intervals are "sticky", then make them belong to the left-most
Joseph Arceneaux's avatar
Joseph Arceneaux committed
629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652
   interval.  Another possibility would be to create a new interval for
   this text, and make it have the merged properties of both ends. */

static INTERVAL
adjust_intervals_for_insertion (tree, position, length)
     INTERVAL tree;
     int position, length;
{
  register INTERVAL i;

  if (TOTAL_LENGTH (tree) == 0)	/* Paranoia */
    abort ();

  /* If inserting at point-max of a buffer, that position
     will be out of range. */
  if (position > TOTAL_LENGTH (tree))
    position = TOTAL_LENGTH (tree);

  i = find_interval (tree, position);
  /* If we are positioned between intervals, check the stickiness of
     both of them. */
  if (position == i->position
      && position != 1)
    {
Joseph Arceneaux's avatar
Joseph Arceneaux committed
653
      register INTERVAL prev = previous_interval (i);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
654 655 656 657

      /* If both intervals are sticky here, then default to the
         left-most one.  But perhaps we should create a new
	 interval here instead... */
658
      if (END_STICKY_P (prev))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
659 660 661 662 663 664
	i = prev;
    }

  while (! NULL_INTERVAL_P (i))
    {
      i->total_length += length;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
665
      i = i->parent;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
666 667 668 669
    }

  return tree;
}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
670

Joseph Arceneaux's avatar
Joseph Arceneaux committed
671 672
/* Delete an node I from its interval tree by merging its subtrees
   into one subtree which is then returned.  Caller is responsible for
Joseph Arceneaux's avatar
Joseph Arceneaux committed
673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 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
   storing the resulting subtree into its parent. */

static INTERVAL
delete_node (i)
     register INTERVAL i;
{
  register INTERVAL migrate, this;
  register int migrate_amt;

  if (NULL_INTERVAL_P (i->left))
    return i->right;
  if (NULL_INTERVAL_P (i->right))
    return i->left;

  migrate = i->left;
  migrate_amt = i->left->total_length;
  this = i->right;
  this->total_length += migrate_amt;
  while (! NULL_INTERVAL_P (this->left))
    {
      this = this->left;
      this->total_length += migrate_amt;
    }
  this->left = migrate;
  migrate->parent = this;

  return i->right;
}

/* Delete interval I from its tree by calling `delete_node'
   and properly connecting the resultant subtree.

   I is presumed to be empty; that is, no adjustments are made
   for the length of I. */

void
delete_interval (i)
     register INTERVAL i;
{
  register INTERVAL parent;
  int amt = LENGTH (i);

  if (amt > 0)			/* Only used on zero-length intervals now. */
    abort ();

  if (ROOT_INTERVAL_P (i))
    {
      Lisp_Object owner = (Lisp_Object) i->parent;
      parent = delete_node (i);
      if (! NULL_INTERVAL_P (parent))
	parent->parent = (INTERVAL) owner;

      if (XTYPE (owner) == Lisp_Buffer)
	XBUFFER (owner)->intervals = parent;
      else if (XTYPE (owner) == Lisp_String)
	XSTRING (owner)->intervals = parent;
      else
	abort ();

      return;
    }

  parent = i->parent;
  if (AM_LEFT_CHILD (i))
    {
      parent->left = delete_node (i);
      if (! NULL_INTERVAL_P (parent->left))
	parent->left->parent = parent;
    }
  else
    {
      parent->right = delete_node (i);
      if (! NULL_INTERVAL_P (parent->right))
	parent->right->parent = parent;
    }
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
750 751 752 753 754
/* Find the interval in TREE corresponding to the character position FROM
   and delete as much as possible of AMOUNT from that interval, starting
   after the relative position of FROM within it.  Return the amount
   actually deleted, and if the interval was zeroed-out, delete that
   interval node from the tree.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
755

Joseph Arceneaux's avatar
Joseph Arceneaux committed
756 757
   Do this by recursing down TREE to the interval in question, and
   deleting the appropriate amount of text. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

static int
interval_deletion_adjustment (tree, from, amount)
     register INTERVAL tree;
     register int from, amount;
{
  register int relative_position = from;

  if (NULL_INTERVAL_P (tree))
    return 0;

  /* Left branch */
  if (relative_position <= LEFT_TOTAL_LENGTH (tree))
    {
      int subtract = interval_deletion_adjustment (tree->left,
						   relative_position,
						   amount);
      tree->total_length -= subtract;
      return subtract;
    }
  /* Right branch */
  else if (relative_position > (TOTAL_LENGTH (tree)
				- RIGHT_TOTAL_LENGTH (tree)))
    {
      int subtract;

      relative_position -= (tree->total_length
			    - RIGHT_TOTAL_LENGTH (tree));
      subtract = interval_deletion_adjustment (tree->right,
					       relative_position,
					       amount);
      tree->total_length -= subtract;
      return subtract;
    }
  /* Here -- this node */
  else
    {
      /* If this is a zero-length, marker interval, then
	 we must skip it. */

      if (relative_position == LEFT_TOTAL_LENGTH (tree) + 1)
	{
	  /* This means we're deleting from the beginning of this interval. */
	  register int my_amount = LENGTH (tree);

	  if (amount < my_amount)
	    {
	      tree->total_length -= amount;
	      return amount;
	    }
	  else
	    {
	      tree->total_length -= my_amount;
	      if (LENGTH (tree) != 0)
		abort ();	/* Paranoia */

	      delete_interval (tree);
	      return my_amount;
	    }
	}
      else			/* Deleting starting in the middle. */
	{
	  register int my_amount = ((tree->total_length
				     - RIGHT_TOTAL_LENGTH (tree))
				    - relative_position + 1);

	  if (amount <= my_amount)
	    {
	      tree->total_length -= amount;
	      return amount;
	    }
	  else
	    {
	      tree->total_length -= my_amount;
	      return my_amount;
	    }
	}
    }

Joseph Arceneaux's avatar
Joseph Arceneaux committed
837
  /* Never reach here */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
838 839
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
840 841 842 843 844
/* Effect the adjustments neccessary to the interval tree of BUFFER
   to correspond to the deletion of LENGTH characters from that buffer
   text.  The deletion is effected at position START (relative to the
   buffer). */

Joseph Arceneaux's avatar
Joseph Arceneaux committed
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
static void
adjust_intervals_for_deletion (buffer, start, length)
     struct buffer *buffer;
     int start, length;
{
  register int left_to_delete = length;
  register INTERVAL tree = buffer->intervals;
  register int deleted;

  if (NULL_INTERVAL_P (tree))
    return;

  if (length == TOTAL_LENGTH (tree))
    {
      buffer->intervals = NULL_INTERVAL;
      return;
    }

  if (ONLY_INTERVAL_P (tree))
    {
      tree->total_length -= length;
      return;
    }

  if (start > TOTAL_LENGTH (tree))
    start = TOTAL_LENGTH (tree);
  while (left_to_delete > 0)
    {
      left_to_delete -= interval_deletion_adjustment (tree, start,
						      left_to_delete);
      tree = buffer->intervals;
      if (left_to_delete == tree->total_length)
	{
	  buffer->intervals = NULL_INTERVAL;
	  return;
	}
    }
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
884 885 886 887
/* Make the adjustments neccessary to the interval tree of BUFFER to
   represent an addition or deletion of LENGTH characters starting
   at position START.  Addition or deletion is indicated by the sign
   of LENGTH. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
888 889 890 891 892 893 894 895 896 897 898 899 900 901

INLINE void
offset_intervals (buffer, start, length)
     struct buffer *buffer;
     int start, length;
{
  if (NULL_INTERVAL_P (buffer->intervals) || length == 0)
    return;

  if (length > 0)
    adjust_intervals_for_insertion (buffer->intervals, start, length);
  else
    adjust_intervals_for_deletion (buffer, start, -length);
}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 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 1002 1003 1004

/* Merge interval I with its lexicographic successor. The resulting
   interval is returned, and has the properties of the original
   successor.  The properties of I are lost.  I is removed from the
   interval tree.

   IMPORTANT:
   The caller must verify that this is not the last (rightmost)
   interval. */

INTERVAL
merge_interval_right (i)
     register INTERVAL i;
{
  register int absorb = LENGTH (i);
  register INTERVAL successor;

  /* Zero out this interval. */
  i->total_length -= absorb;

  /* Find the succeeding interval. */
  if (! NULL_RIGHT_CHILD (i))      /* It's below us.  Add absorb
				      as we descend. */
    {
      successor = i->right;
      while (! NULL_LEFT_CHILD (successor))
	{
	  successor->total_length += absorb;
	  successor = successor->left;
	}

      successor->total_length += absorb;
      delete_interval (i);
      return successor;
    }

  successor = i;
  while (! NULL_PARENT (successor))	   /* It's above us.  Subtract as
					      we ascend. */
    {
      if (AM_LEFT_CHILD (successor))
	{
	  successor = successor->parent;
	  delete_interval (i);
	  return successor;
	}

      successor = successor->parent;
      successor->total_length -= absorb;
    }

  /* This must be the rightmost or last interval and cannot
     be merged right.  The caller should have known. */
  abort ();
}

/* Merge interval I with its lexicographic predecessor. The resulting
   interval is returned, and has the properties of the original predecessor.
   The properties of I are lost.  Interval node I is removed from the tree.

   IMPORTANT:
   The caller must verify that this is not the first (leftmost) interval. */

INTERVAL
merge_interval_left (i)
     register INTERVAL i;
{
  register int absorb = LENGTH (i);
  register INTERVAL predecessor;

  /* Zero out this interval. */
  i->total_length -= absorb;

  /* Find the preceding interval. */
  if (! NULL_LEFT_CHILD (i))	/* It's below us. Go down,
				   adding ABSORB as we go. */
    {
      predecessor = i->left;
      while (! NULL_RIGHT_CHILD (predecessor))
	{
	  predecessor->total_length += absorb;
	  predecessor = predecessor->right;
	}

      predecessor->total_length += absorb;
      delete_interval (i);
      return predecessor;
    }

  predecessor = i;
  while (! NULL_PARENT (predecessor))	/* It's above us.  Go up,
				   subtracting ABSORB. */
    {
      if (AM_RIGHT_CHILD (predecessor))
	{
	  predecessor = predecessor->parent;
	  delete_interval (i);
	  return predecessor;
	}

      predecessor = predecessor->parent;
      predecessor->total_length -= absorb;
    }
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1005

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1006 1007 1008 1009 1010
  /* This must be the leftmost or first interval and cannot
     be merged left.  The caller should have known. */
  abort ();
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1011 1012 1013 1014 1015
/* Make an exact copy of interval tree SOURCE which descends from
   PARENT.  This is done by recursing through SOURCE, copying
   the current interval and its properties, and then adjusting
   the pointers of the copy. */

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032
static INTERVAL
reproduce_tree (source, parent)
     INTERVAL source, parent;
{
  register INTERVAL t = make_interval ();

  bcopy (source, t, INTERVAL_SIZE);
  copy_properties (source, t);
  t->parent = parent;
  if (! NULL_LEFT_CHILD (source))
    t->left = reproduce_tree (source->left, t);
  if (! NULL_RIGHT_CHILD (source))
    t->right = reproduce_tree (source->right, t);

  return t;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1033 1034 1035 1036 1037 1038 1039
/* Make a new interval of length LENGTH starting at START in the
   group of intervals INTERVALS, which is actually an interval tree.
   Returns the new interval.

   Generate an error if the new positions would overlap an existing
   interval. */

Joseph Arceneaux's avatar
Joseph Arceneaux committed
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
static INTERVAL
make_new_interval (intervals, start, length)
     INTERVAL intervals;
     int start, length;
{
  INTERVAL slot;

  slot = find_interval (intervals, start);
  if (start + length > slot->position + LENGTH (slot))
    error ("Interval would overlap");

  if (start == slot->position && length == LENGTH (slot))
    return slot;

  if (slot->position == start)
    {
      /* New right node. */
      split_interval_right (slot, length + 1);
      return slot;
    }

  if (slot->position + LENGTH (slot) == start + length)
    {
      /* New left node. */
      split_interval_left (slot, LENGTH (slot) - length + 1);
      return slot;
    }

  /* Convert interval SLOT into three intervals. */
  split_interval_left (slot, start - slot->position + 1);
  split_interval_right (slot, length + 1);
  return slot;
}
1073

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1074
/* Insert the intervals of SOURCE into BUFFER at POSITION.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1075 1076

   This is used in insdel.c when inserting Lisp_Strings into
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1077
   the buffer.  The text corresponding to SOURCE is already in
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1078 1079 1080 1081 1082
   the buffer when this is called.  The intervals of new tree are
   those belonging to the string being inserted;  a copy is not made.

   If the inserted text had no intervals associated, this function
   simply returns -- offset_intervals should handle placing the
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1083
   text in the correct interval, depending on the sticky bits.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095

   If the inserted text had properties (intervals), then there are two
   cases -- either insertion happened in the middle of some interval,
   or between two intervals.

   If the text goes into the middle of an interval, then new
   intervals are created in the middle with only the properties of
   the new text, *unless* the macro MERGE_INSERTIONS is true, in
   which case the new text has the union of its properties and those
   of the text into which it was inserted.

   If the text goes between two intervals, then if neither interval
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1096 1097
   had its appropriate sticky property set (front_sticky, rear_sticky),
   the new text has only its properties.  If one of the sticky properties
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1098 1099
   is set, then the new text "sticks" to that region and its properties
   depend on merging as above.  If both the preceding and succeding
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1100 1101
   intervals to the new text are "sticky", then the new text retains
   only its properties, as if neither sticky property were set.  Perhaps
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1102 1103 1104 1105
   we should consider merging all three sets of properties onto the new
   text... */

void
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1106 1107
graft_intervals_into_buffer (source, position, buffer)
     INTERVAL source;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1108
     int position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1109
     struct buffer *buffer;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1110
{
1111
  register INTERVAL under, over, this, prev;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1112
  register INTERVAL tree = buffer->intervals;
1113
  int middle;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1114 1115

  /* If the new text has no properties, it becomes part of whatever
1116
     interval it was inserted into. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1117
  if (NULL_INTERVAL_P (source))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1118 1119 1120 1121 1122 1123
    return;

  if (NULL_INTERVAL_P (tree))
    {
      /* The inserted text constitutes the whole buffer, so
	 simply copy over the interval structure. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1124
      if (BUF_Z (buffer) == TOTAL_LENGTH (source))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1125
	{
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1126
	  buffer->intervals = reproduce_tree (source, tree->parent);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1127 1128 1129 1130 1131 1132
	  /* Explicitly free the old tree here. */

	  return;
	}

      /* Create an interval tree in which to place a copy
1133
	 of the intervals of the inserted string. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1134
      {
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1135 1136
	Lisp_Object buf;
	XSET (buf, Lisp_Buffer, buffer);
1137
	tree = create_root_interval (buf);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1138 1139 1140
      }
    }
  else
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1141
    if (TOTAL_LENGTH (tree) == TOTAL_LENGTH (source))
1142 1143 1144 1145 1146 1147 1148
      /* If the buffer contains only the new string, but
	 there was already some interval tree there, then it may be
	 some zero length intervals.  Eventually, do something clever
	 about inserting properly.  For now, just waste the old intervals. */
      {
	buffer->intervals = reproduce_tree (source, tree->parent);
	/* Explicitly free the old tree here. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1149

1150 1151 1152 1153 1154 1155 1156
	return;
      }
    else
      /* Paranoia -- the text has already been added, so this buffer
	 should be of non-zero length. */
      if (TOTAL_LENGTH (tree) == 0)
	abort ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1157 1158 1159 1160

  this = under = find_interval (tree, position);
  if (NULL_INTERVAL_P (under))	/* Paranoia */
    abort ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1161
  over = find_interval (source, 1);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1162

1163 1164 1165
  /* Here for insertion in the middle of an interval.
     Split off an equivalent interval to the right,
     then don't bother with it any more.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1166

1167
  if (position > under->position)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1168 1169
    {
      INTERVAL end_unchanged
1170
	= split_interval_left (this, position - under->position + 1);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1171
      copy_properties (under, end_unchanged);
1172 1173 1174
      under->position = position;
      prev = 0;
      middle = 1;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1175
    }
1176 1177 1178 1179 1180 1181 1182 1183
  else
    {
      prev = previous_interval (under);
      if (prev && !END_STICKY_P (prev))
	prev = 0;
    }

  /* Insertion is now at beginning of UNDER.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1184

1185 1186
  /* The inserted text "sticks" to the interval `under',
     which means it gets those properties. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1187 1188
  while (! NULL_INTERVAL_P (over))
    {
1189 1190 1191 1192 1193
      position = LENGTH (over) + 1;
      if (position < LENGTH (under))
	this = split_interval_left (under, position);
      else
	this = under;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1194
      copy_properties (over, this);
1195 1196 1197 1198 1199 1200 1201 1202 1203
      /* Insertion at the end of an interval, PREV,
	 inherits from PREV if PREV is sticky at the end.  */
      if (prev && ! FRONT_STICKY_P (under)
	  && MERGE_INSERTIONS (prev))
	merge_properties (prev, this);
      /* Maybe it inherits from the following interval
	 if that is sticky at the front.  */
      else if ((FRONT_STICKY_P (under) || middle)
	       && MERGE_INSERTIONS (under))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1204 1205 1206 1207
	merge_properties (under, this);
      over = next_interval (over);
    }

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1208
  buffer->intervals = balance_intervals (buffer->intervals);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1209 1210 1211
  return;
}

1212 1213 1214 1215 1216
/* Get the value of property PROP from PLIST,
   which is the plist of an interval.
   We check for direct properties and for categories with property PROP.  */

Lisp_Object
1217 1218 1219 1220
textget (plist, prop)
     Lisp_Object plist;
     register Lisp_Object prop;
{
1221 1222
  register Lisp_Object tail, fallback;
  fallback = Qnil;
1223 1224 1225 1226 1227 1228 1229

  for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail)))
    {
      register Lisp_Object tem;
      tem = Fcar (tail);
      if (EQ (prop, tem))
	return Fcar (Fcdr (tail));
1230 1231
      if (EQ (tem, Qcategory))
	fallback = Fget (Fcar (Fcdr (tail)), prop);
1232
    }
1233 1234

  return fallback;
1235
}
1236

1237 1238
/* Set point in BUFFER to POSITION.  If the target position is 
   before an invisible character which is not displayed with a special glyph,
1239
   move back to an ok place to display.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1240 1241 1242 1243 1244 1245

void
set_point (position, buffer)
     register int position;
     register struct buffer *buffer;
{
1246
  register INTERVAL to, from, toprev, fromprev, target;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1247 1248 1249 1250
  register int iposition = position;
  int buffer_point;
  register Lisp_Object obj;
  int backwards = (position < BUF_PT (buffer)) ? 1 : 0;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1251
  int old_position = buffer->text.pt;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1252 1253 1254 1255

  if (position == buffer->text.pt)
    return;

1256 1257 1258 1259 1260 1261
  /* Check this now, before checking if the buffer has any intervals.
     That way, we can catch conditions which break this sanity check
     whether or not there are intervals in the buffer.  */
  if (position > BUF_Z (buffer) || position < BUF_BEG (buffer))
    abort ();

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1262 1263 1264 1265 1266 1267 1268
  if (NULL_INTERVAL_P (buffer->intervals))
    {
      buffer->text.pt = position;
      return;
    }

  /* Position Z is really one past the last char in the buffer.  */
1269
  if (position == BUF_ZV (buffer))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1270 1271
    iposition = position - 1;

1272 1273 1274
  /* Set TO to the interval containing the char after POSITION,
     and TOPREV to the interval containing the char before POSITION.
     Either one may be null.  They may be equal.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1275
  to = find_interval (buffer->intervals, iposition);
1276 1277 1278
  if (position == BUF_BEGV (buffer))
    toprev = 0;
  else if (to->position == position)
1279 1280 1281 1282 1283 1284
    toprev = previous_interval (to);
  else if (iposition != position)
    toprev = to, to = 0;
  else
    toprev = to;

1285 1286
  buffer_point = (BUF_PT (buffer) == BUF_ZV (buffer)
		  ? BUF_ZV (buffer) - 1
1287
		  : BUF_PT (buffer));
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1288

1289 1290 1291
  /* Set FROM to the interval containing the char after PT,
     and FROMPREV to the interval containing the char before PT.
     Either one may be null.  They may be equal.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1292
  /* We could cache this and save time. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1293
  from = find_interval (buffer->intervals, buffer_point);
1294 1295 1296
  if (from->position == BUF_BEGV (buffer))
    fromprev = 0;
  else if (from->position == BUF_PT (buffer))
1297 1298 1299 1300 1301
    fromprev = previous_interval (from);
  else if (buffer_point != BUF_PT (buffer))
    fromprev = from, from = 0;
  else
    fromprev = from;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1302 1303

  /* Moving within an interval */
1304
  if (to == from && toprev == fromprev && INTERVAL_VISIBLE_P (to))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1305 1306 1307 1308 1309
    {
      buffer->text.pt = position;
      return;
    }

1310 1311 1312 1313 1314
  /* If the new position is before an invisible character,
     move forward over all such.  */
  while (! NULL_INTERVAL_P (to)
	 && ! INTERVAL_VISIBLE_P (to)
	 && ! DISPLAY_INVISIBLE_GLYPH (to))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1315
    {
1316 1317
      toprev = to;
      to = next_interval (to);
1318
      position = to->position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1319
    }
1320 1321

  buffer->text.pt = position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1322

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1323 1324
  /* We run point-left and point-entered hooks here, iff the
     two intervals are not equivalent.  These hooks take
1325 1326 1327
     (old_point, new_point) as arguments.  */
  if (! intervals_equal (from, to)
      || ! intervals_equal (fromprev, toprev))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1328
    {
1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347
      Lisp_Object leave_after, leave_before, enter_after, enter_before;

      if (fromprev)
	leave_after = textget (fromprev->plist, Qpoint_left);
      else
	leave_after = Qnil;
      if (from)
	leave_before = textget (from->plist, Qpoint_left);
      else
	leave_before = Qnil;

      if (toprev)
	enter_after = textget (toprev->plist, Qpoint_entered);
      else
	enter_after = Qnil;
      if (to)
	enter_before = textget (to->plist, Qpoint_entered);
      else
	enter_before = Qnil;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1348

1349 1350 1351 1352
      if (! EQ (leave_before, enter_before) && !NILP (leave_before))
	call2 (leave_before, old_position, position);
      if (! EQ (leave_after, enter_after) && !NILP (leave_after))
	call2 (leave_after, old_position, position);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1353

1354 1355 1356 1357
      if (! EQ (enter_before, leave_before) && !NILP (enter_before))
	call2 (enter_before, old_position, position);
      if (! EQ (enter_after, leave_after) && !NILP (enter_after))
	call2 (enter_after, old_position, position);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1358
    }
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1359 1360
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1361
/* Set point temporarily, without checking any text properties. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1362

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1363 1364 1365 1366 1367 1368 1369
INLINE void
temp_set_point (position, buffer)
     int position;
     struct buffer *buffer;
{
  buffer->text.pt = position;
}
1370

1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406
/* Return the proper local map for position POSITION in BUFFER.
   Use the map specified by the local-map property, if any.
   Otherwise, use BUFFER's local map.  */

Lisp_Object
get_local_map (position, buffer)
     register int position;
     register struct buffer *buffer;
{
  register INTERVAL interval;
  Lisp_Object prop, tem;

  if (NULL_INTERVAL_P (buffer->intervals))
    return current_buffer->keymap;

  /* Perhaps we should just change `position' to the limit. */
  if (position > BUF_Z (buffer) || position < BUF_BEG (buffer))
    abort ();

  /* Position Z is really one past the last char in the buffer.  */
  if (position == BUF_ZV (buffer))
    return current_buffer->keymap;

  interval = find_interval (buffer->intervals, position);
  prop = textget (interval->plist, Qlocal_map);
  if (NILP (prop))
    return current_buffer->keymap;

  /* Use the local map only if it is valid.  */
  tem = Fkeymapp (prop);
  if (!NILP (tem))
    return prop;

  return current_buffer->keymap;
}

1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421
/* Call the modification hook functions in LIST, each with START and END.  */

static void
call_mod_hooks (list, start, end)
     Lisp_Object list, start, end;
{
  struct gcpro gcpro1;
  GCPRO1 (list);
  while (!NILP (list))
    {
      call2 (Fcar (list), start, end);
      list = Fcdr (list);
    }
  UNGCPRO;
}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1422 1423 1424 1425 1426 1427 1428

/* Check for read-only intervals and signal an error if we find one.
   Then check for any modification hooks in the range START up to
   (but not including) TO.  Create a list of all these hooks in
   lexicographic order, eliminating consecutive extra copies of the
   same hook.  Then call those hooks in order, with START and END - 1
   as arguments. */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1429 1430 1431 1432 1433 1434 1435

void
verify_interval_modification (buf, start, end)
     struct buffer *buf;
     int start, end;
{
  register INTERVAL intervals = buf->intervals;
1436 1437 1438 1439
  register INTERVAL i, prev;
  Lisp_Object hooks;
  register Lisp_Object prev_mod_hooks;
  Lisp_Object mod_hooks;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1440
  struct gcpro gcpro1;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1441

1442 1443 1444 1445
  hooks = Qnil;
  prev_mod_hooks = Qnil;
  mod_hooks = Qnil;

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1446 1447 1448 1449 1450 1451 1452 1453 1454 1455
  if (NULL_INTERVAL_P (intervals))
    return;

  if (start > end)
    {
      int temp = start;
      start = end;
      end = temp;
    }

1456 1457
  /* For an insert operation, check the two chars around the position.  */
  if (start == end)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1458
    {
1459 1460
      INTERVAL prev;
      Lisp_Object before, after;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1461

1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478
      /* Set I to the interval containing the char after START,
	 and PREV to the interval containing the char before START.
	 Either one may be null.  They may be equal.  */
      i = find_interval (intervals,
			 (start == BUF_ZV (buf) ? start - 1 : start));

      if (start == BUF_BEGV (buf))
	prev = 0;
      if (i->position == start)
	prev = previous_interval (i);
      else if (i->position < start)
	prev = i;
      if (start == BUF_ZV (buf))
	i = 0;

      if (NULL_INTERVAL_P (prev))
	{
1479
	  after = textget (i->plist, Qread_only);
1480 1481 1482 1483 1484
	  if (! NILP (after))
	    error ("Attempt to insert within read-only text");
	}
      else if (NULL_INTERVAL_P (i))
	{
1485
	  before = textget (prev->plist, Qread_only);
1486 1487 1488 1489 1490
	  if (! NILP (before))
	    error ("Attempt to insert within read-only text");
	}
      else
	{
1491 1492
	  before = textget (prev->plist, Qread_only);
	  after = textget (i->plist, Qread_only);
1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508
	  if (! NILP (before) && EQ (before, after))
	    error ("Attempt to insert within read-only text");
	}

      /* Run both mod hooks (just once if they're the same).  */
      if (!NULL_INTERVAL_P (prev))
	prev_mod_hooks = textget (prev->plist, Qmodification_hooks);
      if (!NULL_INTERVAL_P (i))
	mod_hooks = textget (i->plist, Qmodification_hooks);
      GCPRO1 (mod_hooks);
      if (! NILP (prev_mod_hooks))
	call_mod_hooks (prev_mod_hooks, make_number (start),
			make_number (end));
      UNGCPRO;
      if (! NILP (mod_hooks) && ! EQ (mod_hooks, prev_mod_hooks))
	call_mod_hooks (mod_hooks, make_number (start), make_number (end));
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1509 1510 1511
    }
  else
    {
1512 1513
      /* Loop over intervals on or next to START...END,
	 collecting their hooks.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1514

1515 1516
      i = find_interval (intervals, start);
      do
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1517
	{