intervals.c 49.2 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

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
8
the Free Software Foundation; either version 2, or (at your option)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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
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.

*/


41
#include <config.h>
Joseph Arceneaux's avatar
Joseph Arceneaux committed
42 43 44 45
#include "lisp.h"
#include "intervals.h"
#include "buffer.h"

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

49
/* Factor for weight-balancing interval trees.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
50 51
Lisp_Object interval_balance_threshold;

52
/* Utility functions for intervals.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
53 54


55
/* Create the root interval of some object, a buffer or string.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
56 57 58 59 60 61 62 63 64

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

  if (XTYPE (parent) == Lisp_Buffer)
    {
65 66
      new->total_length = (BUF_Z (XBUFFER (parent))
			   - BUF_BEG (XBUFFER (parent)));
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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 94
      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
95 96
   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
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

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,
128
   0 otherwise.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
129 130 131 132 133 134 135 136 137 138 139

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;

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

Joseph Arceneaux's avatar
Joseph Arceneaux committed
143 144 145 146 147 148 149
  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))
    {
150
      /* Lengths of the two plists were unequal.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
151 152 153 154 155 156
      if (i1_len == 0)
	return 0;

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

157
      /* i0 has something i1 doesn't.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
158 159 160
      if (EQ (i1_val, Qnil))
	return 0;

161
      /* i0 and i1 both have sym, but it has different values in each.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
162
      i0_cdr = Fcdr (i0_cdr);
163
      if (! EQ (Fcar (Fcdr (i1_val)), Fcar (i0_cdr)))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
164 165 166 167 168 169
	return 0;

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

170
  /* Lengths of the two plists were unequal.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
171 172 173 174 175 176 177 178 179 180 181
  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.
182
   Pass FUNCTION two args: an interval, and ARG.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
183 184

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

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

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;
225
  traverse_intervals (tree, 1, 0, &check_for_interval, Qnil);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
  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;
247
  traverse_intervals (i, 1, 0, &inc_interval_count, Qnil);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

  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);

282
  /* Deal with any Parent of A;  make it point to B.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
283 284 285 286 287 288 289
  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;

290
  /* B gets the same length as A, since it get A's position in the tree.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
291 292
  interval->left->total_length = interval->total_length;

293
  /* B becomes the parent of A.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
294 295 296 297
  i = interval->left->right;
  interval->left->right = interval;
  interval->parent = interval->left;

298
  /* A gets c as left child.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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
  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);

325
  /* Deal with the parent of A.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
326 327 328 329 330 331 332
  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;

333
  /* B must have the same total length of A.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350
  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;
}

351 352 353 354
/* Split INTERVAL into two pieces, starting the second piece at
   character position OFFSET (counting from 0), relative to INTERVAL.
   INTERVAL becomes the left-hand piece, and the right-hand piece
   (second, lexicographically) is returned.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
355 356 357 358 359

   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
360 361

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

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

373
  new->position = position + offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
374 375 376 377 378 379 380 381 382 383
  new->parent = interval;

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

      return new;
    }

384
  /* Insert the new node between INTERVAL and its right child.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
385 386 387 388 389 390 391 392 393
  new->right = interval->right;
  interval->right->parent = new;
  interval->right = new;

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

  return new;
}

394 395 396 397
/* Split INTERVAL into two pieces, starting the second piece at
   character position OFFSET (counting from 0), relative to INTERVAL.
   INTERVAL becomes the right-hand piece, and the left-hand piece
   (first, lexicographically) is returned.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
398

Joseph Arceneaux's avatar
Joseph Arceneaux committed
399 400 401 402 403 404
   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,
405
   it is still a root after this operation.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
406 407

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

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

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

      return new;
    }

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

  return new;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
437
/* Find the interval containing text position POSITION in the text
438 439 440
   represented by the interval tree TREE.  POSITION is a buffer
   position; the earliest position is 1.  If POSITION is at the end of
   the buffer, return the interval containing the last character.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
441

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

INLINE INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
447 448 449 450
find_interval (tree, position)
     register INTERVAL tree;
     register int position;
{
451 452 453
  /* The distance from the left edge of the subtree at TREE
                    to POSITION.  */
  register int relative_position = position - BEG;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
454 455 456 457

  if (NULL_INTERVAL_P (tree))
    return NULL_INTERVAL;

458
  if (relative_position > TOTAL_LENGTH (tree))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
459 460 461 462
    abort ();			/* Paranoia */

  while (1)
    {
463
      if (relative_position < LEFT_TOTAL_LENGTH (tree))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
464 465 466
	{
	  tree = tree->left;
	}
467 468 469
      else if (! NULL_RIGHT_CHILD (tree)
	       && relative_position >= (TOTAL_LENGTH (tree)
					- RIGHT_TOTAL_LENGTH (tree)))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
470 471 472 473 474 475 476
	{
	  relative_position -= (TOTAL_LENGTH (tree)
				- RIGHT_TOTAL_LENGTH (tree));
	  tree = tree->right;
	}
      else
	{
477 478 479 480
	  tree->position =
	    (position - relative_position /* the left edge of *tree */
	     + LEFT_TOTAL_LENGTH (tree)); /* the left edge of this interval */

Joseph Arceneaux's avatar
Joseph Arceneaux committed
481 482 483 484 485 486
	  return tree;
	}
    }
}

/* Find the succeeding interval (lexicographically) to INTERVAL.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
487
   Sets the `position' field based on that of INTERVAL (see
488
   find_interval).  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526

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
527
   Sets the `position' field based on that of INTERVAL (see
528
   find_interval).  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565

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
566
#if 0
Joseph Arceneaux's avatar
Joseph Arceneaux committed
567 568 569 570 571 572 573 574 575 576
/* 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
577
   to the root.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

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,
615
	     then this code will have to change.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
616 617 618 619 620 621 622
	  this->total_length += length;
	  this->position = LEFT_TOTAL_LENGTH (this)
	                   + position - relative_position + 1;
	  return tree;
	}
    }
}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
623 624 625 626 627 628 629 630 631 632 633
#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
634
   If both intervals are "sticky", then make them belong to the left-most
Joseph Arceneaux's avatar
Joseph Arceneaux committed
635
   interval.  Another possibility would be to create a new interval for
636
   this text, and make it have the merged properties of both ends.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
637 638 639 640 641 642 643

static INTERVAL
adjust_intervals_for_insertion (tree, position, length)
     INTERVAL tree;
     int position, length;
{
  register INTERVAL i;
644 645 646
  register INTERVAL temp;
  int eobp = 0;
  
Joseph Arceneaux's avatar
Joseph Arceneaux committed
647 648 649
  if (TOTAL_LENGTH (tree) == 0)	/* Paranoia */
    abort ();

650 651
  /* If inserting at point-max of a buffer, that position will be out
     of range.  Remember that buffer positions are 1-based.  */
652
  if (position >= BEG + TOTAL_LENGTH (tree)){
653
    position = BEG + TOTAL_LENGTH (tree);
654 655
    eobp = 1;
  }
Joseph Arceneaux's avatar
Joseph Arceneaux committed
656 657

  i = find_interval (tree, position);
658

659 660 661 662 663 664 665 666 667 668 669 670
  /* If in middle of an interval which is not sticky either way,
     we must not just give its properties to the insertion.
     So split this interval at the insertion point.  */
  if (! (position == i->position || eobp)
      && END_NONSTICKY_P (i)
      && ! FRONT_STICKY_P (i))
    {
      temp = split_interval_right (i, position - i->position);
      copy_properties (i, temp);
      i = temp;
    }

Joseph Arceneaux's avatar
Joseph Arceneaux committed
671
  /* If we are positioned between intervals, check the stickiness of
672 673
     both of them.  We have to do this too, if we are at BEG or Z.  */
  if (position == i->position || eobp)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
674
    {
675 676 677 678 679 680 681 682 683 684 685
      register INTERVAL prev;

      if (position == BEG)
	prev = 0;
      else if (eobp)
	{
	  prev = i;
	  i = 0;
	}
      else
	prev = previous_interval (i);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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
      /* Even if we are positioned between intervals, we default
	 to the left one if it exists.  We extend it now and split
	 off a part later, if stickyness demands it.  */
      for (temp = prev ? prev : i; ! NULL_INTERVAL_P (temp); temp = temp->parent)
	temp->total_length += length;
      
      /* If at least one interval has sticky properties,
	 we check the stickyness property by property.  */
      if (END_NONSTICKY_P (prev) || FRONT_STICKY_P (i))
	{
	  Lisp_Object pleft = NULL_INTERVAL_P (prev) ? Qnil : prev->plist;
	  Lisp_Object pright = NULL_INTERVAL_P (i) ? Qnil : i->plist;
	  struct interval newi;

	  newi.plist = merge_properties_sticky (pleft, pright);

	  if(! prev) /* i.e. position == BEG */
	    {
	      if (! intervals_equal (i, &newi))
		{
		  i = split_interval_left (i, length);
		  i->plist = newi.plist;
		}
	    }
	  else if (! intervals_equal (prev, &newi))
	    {
	      prev = split_interval_right (prev,
					   position - prev->position);
	      prev->plist = newi.plist;
	      if (! NULL_INTERVAL_P (i)
		  && intervals_equal (prev, i))
		merge_interval_right (prev);
	    }

	  /* We will need to update the cache here later.  */
	}
      else if (! prev && ! NILP (i->plist))
        {
	  /* Just split off a new interval at the left.
	     Since I wasn't front-sticky, the empty plist is ok.  */
	  i = split_interval_left (i, length);
        }
Joseph Arceneaux's avatar
Joseph Arceneaux committed
729 730
    }

731 732
  /* Otherwise just extend the interval.  */
  else
Joseph Arceneaux's avatar
Joseph Arceneaux committed
733
    {
734 735
      for (temp = i; ! NULL_INTERVAL_P (temp); temp = temp->parent)
	temp->total_length += length;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
736
    }
737
      
Joseph Arceneaux's avatar
Joseph Arceneaux committed
738 739
  return tree;
}
740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762

Lisp_Object
merge_properties_sticky (pleft, pright)
     Lisp_Object pleft, pright;
{
  register Lisp_Object props = Qnil, front = Qnil, rear = Qnil;
  
  Lisp_Object lfront = textget (pleft, Qfront_sticky);
  Lisp_Object lrear = textget (pleft, Qrear_nonsticky);
  Lisp_Object rfront = textget (pright, Qfront_sticky);
  Lisp_Object rrear = textget (pright, Qrear_nonsticky);

  register Lisp_Object tail1, tail2, sym;

  /* Go through each element of PLEFT.  */
  for (tail1 = pleft; ! NILP (tail1); tail1 = Fcdr (Fcdr (tail1)))
    {
      sym = Fcar (tail1);

      /* Sticky properties get special treatment.  */
      if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky))
	continue;
      
763
      if (CONSP (lrear) ? NILP (Fmemq (sym, lrear)) : NILP (lrear))
764 765 766 767
	{
	  /* rear-sticky is dominant, we needn't search in PRIGHT.  */
	  
	  props = Fcons (sym, Fcons (Fcar (Fcdr (tail1)), props));
768 769
	  if ((CONSP (lfront) || NILP (lfront))
	      && ! NILP (Fmemq (sym, lfront)))
770 771 772 773 774 775 776 777 778
	    front = Fcons (sym, front);
	}
      else
	{
	  /* Go through PRIGHT, looking for sym.  */
	  for (tail2 = pright; ! NILP (tail2); tail2 = Fcdr (Fcdr (tail2)))
	    if (EQ (sym, Fcar (tail2)))
	      {
		
779 780
		if (CONSP (rfront)
		    ? ! NILP (Fmemq (sym, rfront)) : ! NILP (rfront))
781 782 783 784 785
		  {
		    /* Nonsticky at the left and sticky at the right,
		       so take the right one.  */
		    props = Fcons (sym, Fcons (Fcar (Fcdr (tail2)), props));
		    front = Fcons (sym, front);
786 787
		    if ((CONSP (rrear) || NILP (rrear))
			&& ! NILP (Fmemq (sym, rrear)))
788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803
		      rear = Fcons (sym, rear);
		  }
		break;
	      }
	}
    }
  /* Now let's see what to keep from PRIGHT.  */
  for (tail2 = pright; ! NILP (tail2); tail2 = Fcdr (Fcdr (tail2)))
    {
      sym = Fcar (tail2);

      /* Sticky properties get special treatment.  */
      if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky))
	continue;

      /* If it ain't sticky, we don't take it.  */
804 805
      if (CONSP (rfront)
	  ? NILP (Fmemq (sym, rfront)) : NILP (rfront))
806 807 808 809 810 811 812 813 814 815 816
	continue;
      
      /* If sym is in PLEFT we already got it.  */
      for (tail1 = pleft; ! NILP (tail1); tail1 = Fcdr (Fcdr (tail1)))
	if (EQ (sym, Fcar (tail1)))
	  break;
      
      if (NILP (tail1))
	{
	  props = Fcons (sym, Fcons (Fcar (Fcdr (tail2)), props));
	  front = Fcons (sym, front);
817 818
	  if ((CONSP (rrear) || NILP (rrear))
	      && ! NILP (Fmemq (sym, rrear)))
819 820 821 822 823 824 825 826 827 828 829
	    rear = Fcons (sym, rear);
	}
    }
  if (! NILP (front))
    props = Fcons (Qfront_sticky, Fcons (front, props));
  if (! NILP (rear))
    props = Fcons (Qrear_nonsticky, Fcons (rear, props));
  return props;
  
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
830

Joseph Arceneaux's avatar
Joseph Arceneaux committed
831 832
/* Delete an node I from its interval tree by merging its subtrees
   into one subtree which is then returned.  Caller is responsible for
833
   storing the resulting subtree into its parent.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865

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
866
   for the length of I.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
867 868 869 870 871 872 873 874

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

875
  if (amt > 0)			/* Only used on zero-length intervals now.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909
    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;
    }
}

910 911 912 913 914 915 916 917
/* Find the interval in TREE corresponding to the relative position
   FROM and delete as much as possible of AMOUNT from that interval.
   Return the amount actually deleted, and if the interval was
   zeroed-out, delete that interval node from the tree.

   Note that FROM is actually origin zero, aka relative to the
   leftmost edge of tree.  This is appropriate since we call ourselves
   recursively on subtrees.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
918

Joseph Arceneaux's avatar
Joseph Arceneaux committed
919
   Do this by recursing down TREE to the interval in question, and
920
   deleting the appropriate amount of text.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
921 922 923 924 925 926 927 928 929 930 931 932

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 */
933
  if (relative_position < LEFT_TOTAL_LENGTH (tree))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
934 935 936 937 938 939 940 941
    {
      int subtract = interval_deletion_adjustment (tree->left,
						   relative_position,
						   amount);
      tree->total_length -= subtract;
      return subtract;
    }
  /* Right branch */
942 943
  else if (relative_position >= (TOTAL_LENGTH (tree)
				 - RIGHT_TOTAL_LENGTH (tree)))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
944 945 946 947 948 949 950 951 952 953 954
    {
      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;
    }
955
  /* Here -- this node.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
956 957
  else
    {
958 959 960 961 962 963 964 965 966 967 968 969 970
      /* How much can we delete from this interval?  */
      int my_amount = ((tree->total_length 
			- RIGHT_TOTAL_LENGTH (tree))
		       - relative_position);

      if (amount > my_amount)
	amount = my_amount;

      tree->total_length -= amount;
      if (LENGTH (tree) == 0)
	delete_interval (tree);
      
      return amount;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
971 972
    }

973
  /* Never reach here.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
974 975
}

976 977 978
/* Effect the adjustments necessary 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 (which is a
979
   buffer position, i.e. origin 1).  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
980

Joseph Arceneaux's avatar
Joseph Arceneaux committed
981 982 983 984 985 986 987 988 989 990 991 992
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;

993 994 995 996
  if (start > BEG + TOTAL_LENGTH (tree)
      || start + length > BEG + TOTAL_LENGTH (tree))
    abort ();

Joseph Arceneaux's avatar
Joseph Arceneaux committed
997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008
  if (length == TOTAL_LENGTH (tree))
    {
      buffer->intervals = NULL_INTERVAL;
      return;
    }

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

1009 1010
  if (start > BEG + TOTAL_LENGTH (tree))
    start = BEG + TOTAL_LENGTH (tree);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1011 1012
  while (left_to_delete > 0)
    {
1013
      left_to_delete -= interval_deletion_adjustment (tree, start - 1,
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1014 1015 1016 1017 1018 1019 1020 1021 1022 1023
						      left_to_delete);
      tree = buffer->intervals;
      if (left_to_delete == tree->total_length)
	{
	  buffer->intervals = NULL_INTERVAL;
	  return;
	}
    }
}

1024
/* Make the adjustments necessary to the interval tree of BUFFER to
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1025 1026
   represent an addition or deletion of LENGTH characters starting
   at position START.  Addition or deletion is indicated by the sign
1027
   of LENGTH.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041

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
1042 1043 1044 1045 1046 1047 1048 1049

/* 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)
1050
   interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1051 1052 1053 1054 1055 1056 1057 1058

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

1059
  /* Zero out this interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1060 1061
  i->total_length -= absorb;

1062
  /* Find the succeeding interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1063
  if (! NULL_RIGHT_CHILD (i))      /* It's below us.  Add absorb
1064
				      as we descend.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079
    {
      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
1080
					      we ascend.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
    {
      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
1094
     be merged right.  The caller should have known.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1095 1096 1097 1098 1099 1100 1101 1102
  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:
1103
   The caller must verify that this is not the first (leftmost) interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1104 1105 1106 1107 1108 1109 1110 1111

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

1112
  /* Zero out this interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1113 1114
  i->total_length -= absorb;

1115
  /* Find the preceding interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1116
  if (! NULL_LEFT_CHILD (i))	/* It's below us. Go down,
1117
				   adding ABSORB as we go.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132
    {
      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,
1133
				   subtracting ABSORB.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144
    {
      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
1145

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1146
  /* This must be the leftmost or first interval and cannot
1147
     be merged left.  The caller should have known.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1148 1149 1150
  abort ();
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1151 1152 1153
/* 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
1154
   the pointers of the copy.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1155

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
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;
}

1173 1174 1175
#if 0
/* Nobody calls this.  Perhaps it's a vestige of an earlier design.  */

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1176 1177 1178 1179 1180
/* 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
1181
   interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1182

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
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)
    {
1199
      /* New right node.  */
1200
      split_interval_right (slot, length);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1201 1202 1203 1204 1205
      return slot;
    }

  if (slot->position + LENGTH (slot) == start + length)
    {
1206
      /* New left node.  */
1207
      split_interval_left (slot, LENGTH (slot) - length);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1208 1209 1210
      return slot;
    }

1211
  /* Convert interval SLOT into three intervals.  */
1212 1213
  split_interval_left (slot, start - slot->position);
  split_interval_right (slot, length);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1214 1215
  return slot;
}
1216
#endif
1217

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1218
/* Insert the intervals of SOURCE into BUFFER at POSITION.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1219

1220 1221 1222 1223 1224
   This is used in insdel.c when inserting Lisp_Strings into the
   buffer.  The text corresponding to SOURCE is already in the buffer
   when this is called.  The intervals of new tree are a copy of those
   belonging to the string being inserted; intervals are never
   shared.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1225 1226 1227

   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
1228
   text in the correct interval, depending on the sticky bits.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240

   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
1241 1242
   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
1243
   is set, then the new text "sticks" to that region and its properties
1244
   depend on merging as above.  If both the preceding and succeeding
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1245 1246
   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
1247
   we should consider merging all three sets of properties onto the new
1248
   text...  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1249 1250

void
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1251 1252
graft_intervals_into_buffer (source, position, buffer)
     INTERVAL source;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1253
     int position;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1254
     struct buffer *buffer;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1255
{
1256
  register INTERVAL under, over, this, prev;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1257
  register INTERVAL tree = buffer->intervals;
1258
  int middle;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1259 1260

  /* If the new text has no properties, it becomes part of whatever
1261
     interval it was inserted into.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1262
  if (NULL_INTERVAL_P (source))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1263 1264 1265 1266 1267
    return;

  if (NULL_INTERVAL_P (tree))
    {
      /* The inserted text constitutes the whole buffer, so
1268
	 simply copy over the interval structure.  */
1269
      if ((BUF_Z (buffer) - BUF_BEG (buffer)) == TOTAL_LENGTH (source))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1270
	{
1271 1272 1273
	  Lisp_Object buf;
	  XSET (buf, Lisp_Buffer, buffer);
	  buffer->intervals = reproduce_tree (source, buf);
1274
	  /* Explicitly free the old tree here.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1275 1276 1277 1278 1279

	  return;
	}

      /* Create an interval tree in which to place a copy
1280
	 of the intervals of the inserted string.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1281
      {
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1282 1283
	Lisp_Object buf;
	XSET (buf, Lisp_Buffer, buffer);
1284
	tree = create_root_interval (buf);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1285 1286 1287
      }
    }
  else
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1288
    if (TOTAL_LENGTH (tree) == TOTAL_LENGTH (source))
1289 1290 1291
      /* 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
1292
	 about inserting properly.  For now, just waste the old intervals.  */
1293 1294
      {
	buffer->intervals = reproduce_tree (source, tree->parent);
1295
	/* Explicitly free the old tree here.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1296

1297 1298 1299 1300
	return;
      }
    else
      /* Paranoia -- the text has already been added, so this buffer