intervals.c 50.3 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
#include "lisp.h"
#include "intervals.h"
#include "buffer.h"
Richard M. Stallman's avatar
Richard M. Stallman committed
45
#include "puresize.h"
Joseph Arceneaux's avatar
Joseph Arceneaux committed
46

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

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

Lisp_Object merge_properties_sticky ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
54

55
/* Utility functions for intervals.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
56 57


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

INTERVAL
create_root_interval (parent)
     Lisp_Object parent;
{
Richard M. Stallman's avatar
Richard M. Stallman committed
64 65 66 67 68
  INTERVAL new;

  CHECK_IMPURE (parent);

  new = make_interval ();
Joseph Arceneaux's avatar
Joseph Arceneaux committed
69 70 71

  if (XTYPE (parent) == Lisp_Buffer)
    {
72 73
      new->total_length = (BUF_Z (XBUFFER (parent))
			   - BUF_BEG (XBUFFER (parent)));
Joseph Arceneaux's avatar
Joseph Arceneaux committed
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101
      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
102 103
   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
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

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,
135
   0 otherwise.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
136 137 138 139 140 141 142 143 144 145 146

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;

147 148 149
  if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1))
    return 0;

Joseph Arceneaux's avatar
Joseph Arceneaux committed
150 151 152 153 154 155 156
  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))
    {
157
      /* Lengths of the two plists were unequal.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
158 159 160 161 162 163
      if (i1_len == 0)
	return 0;

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

164
      /* i0 has something i1 doesn't.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
165 166 167
      if (EQ (i1_val, Qnil))
	return 0;

168
      /* i0 and i1 both have sym, but it has different values in each.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
169
      i0_cdr = Fcdr (i0_cdr);
170
      if (! EQ (Fcar (Fcdr (i1_val)), Fcar (i0_cdr)))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
171 172 173 174 175 176
	return 0;

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

177
  /* Lengths of the two plists were unequal.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
178 179 180 181 182 183 184 185 186 187 188
  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.
189
   Pass FUNCTION two args: an interval, and ARG.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
190 191

void
192
traverse_intervals (tree, position, depth, function, arg)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
193
     INTERVAL tree;
194
     int position, depth;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
195
     void (* function) ();
196
     Lisp_Object arg;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
197 198 199 200
{
  if (NULL_INTERVAL_P (tree))
    return;

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

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;
232
  traverse_intervals (tree, 1, 0, &check_for_interval, Qnil);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253
  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;
254
  traverse_intervals (i, 1, 0, &inc_interval_count, Qnil);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

  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;
287
  int old_total = interval->total_length;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
288

289
  /* Deal with any Parent of A;  make it point to B.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
290 291
  if (! ROOT_INTERVAL_P (interval))
    if (AM_LEFT_CHILD (interval))
292
      interval->parent->left = B;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
293
    else
294 295
      interval->parent->right = B;
  B->parent = interval->parent;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
296

297 298 299 300
  /* Make B the parent of A */
  i = B->right;
  B->right = interval;
  interval->parent = B;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
301

302
  /* Make A point to c */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
303 304 305
  interval->left = i;
  if (! NULL_INTERVAL_P (i))
    i->parent = interval;
306 307 308 309 310 311

  /* A's total length is decreased by the length of B and it's left child.  */
  interval->total_length -= B->total_length - LEFT_TOTAL_LENGTH (interval);

  /* B must have the same total length of A.  */
  B->total_length = old_total;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
312 313 314

  return B;
}
315

Joseph Arceneaux's avatar
Joseph Arceneaux committed
316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
/* 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;
331
  int old_total = interval->total_length;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
332

333
  /* Deal with any parent of A;  make it point to B.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
334 335
  if (! ROOT_INTERVAL_P (interval))
    if (AM_LEFT_CHILD (interval))
336
      interval->parent->left = B;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
337
    else
338 339
      interval->parent->right = B;
  B->parent = interval->parent;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
340 341

  /* Make B the parent of A */
342 343 344
  i = B->left;
  B->left = interval;
  interval->parent = B;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
345 346 347 348 349

  /* Make A point to c */
  interval->right = i;
  if (! NULL_INTERVAL_P (i))
    i->parent = interval;
350 351 352 353 354 355

  /* A's total length is decreased by the length of B and it's right child.  */
  interval->total_length -= B->total_length - RIGHT_TOTAL_LENGTH (interval);

  /* B must have the same total length of A.  */
  B->total_length = old_total;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
356 357 358 359

  return B;
}

360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445
/* Balance an interval tree with the assumption that the subtrees
   themselves are already balanced.  */

static INTERVAL
balance_an_interval (i)
     INTERVAL i;
{
  register int old_diff, new_diff;

  while (1)
    {
      old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i);
      if (old_diff > 0)
	{
	  new_diff = i->total_length - i->left->total_length
	    + RIGHT_TOTAL_LENGTH (i->left) - LEFT_TOTAL_LENGTH (i->left);
	  if (abs (new_diff) >= old_diff)
	    break;
	  i = rotate_right (i);
	  balance_an_interval (i->right);
	}
      else if (old_diff < 0)
	{
	  new_diff = i->total_length - i->right->total_length
	    + LEFT_TOTAL_LENGTH (i->right) - RIGHT_TOTAL_LENGTH (i->right);
	  if (abs (new_diff) >= -old_diff)
	    break;
	  i = rotate_left (i);
	  balance_an_interval (i->left);
	}
      else
	break;
    }
  return i;
}

/* Balance INTERVAL, potentially stuffing it back into its parent
   Lisp Object.  */

static INLINE INTERVAL
balance_possible_root_interval (interval)
     register INTERVAL interval;
{
  Lisp_Object parent;

  if (interval->parent == NULL_INTERVAL)
    return interval;

  parent = (Lisp_Object) (interval->parent);
  interval = balance_an_interval (interval);

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

  return interval;
}

/* Balance the interval tree TREE.  Balancing is by weight
   (the amount of text).  */

static INTERVAL
balance_intervals_internal (tree)
     register INTERVAL tree;
{
  /* Balance within each side.  */
  if (tree->left)
    balance_intervals (tree->left);
  if (tree->right)
    balance_intervals (tree->right);
  return balance_an_interval (tree);
}

/* Advertised interface to balance intervals.  */

INTERVAL
balance_intervals (tree)
     INTERVAL tree;
{
  if (tree == NULL_INTERVAL)
    return NULL_INTERVAL;

  return balance_intervals_internal (tree);
}

446 447 448 449
/* 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
450 451 452 453 454

   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
455 456

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

INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
460
split_interval_right (interval, offset)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
461
     INTERVAL interval;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
462
     int offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
463 464 465
{
  INTERVAL new = make_interval ();
  int position = interval->position;
466
  int new_length = LENGTH (interval) - offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
467

468
  new->position = position + offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
469 470
  new->parent = interval;

471
  if (NULL_RIGHT_CHILD (interval))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
472 473 474 475 476 477 478
    {
      interval->right = new;
      new->total_length = new_length;

      return new;
    }

479
  /* Insert the new node between INTERVAL and its right child.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
480 481 482 483 484
  new->right = interval->right;
  interval->right->parent = new;
  interval->right = new;
  new->total_length = new_length + new->right->total_length;

485 486 487
  balance_an_interval (new);
  balance_possible_root_interval (interval);

Joseph Arceneaux's avatar
Joseph Arceneaux committed
488 489 490
  return new;
}

491 492 493 494
/* 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
495

Joseph Arceneaux's avatar
Joseph Arceneaux committed
496 497 498 499 500 501
   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,
502
   it is still a root after this operation.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
503 504

INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
505
split_interval_left (interval, offset)
Joseph Arceneaux's avatar
Joseph Arceneaux committed
506
     INTERVAL interval;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
507
     int offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
508 509 510
{
  INTERVAL new = make_interval ();
  int position = interval->position;
511
  int new_length = offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
512 513

  new->position = interval->position;
514
  interval->position = interval->position + offset;
Joseph Arceneaux's avatar
Joseph Arceneaux committed
515 516 517 518 519 520 521 522 523 524
  new->parent = interval;

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

      return new;
    }

525
  /* Insert the new node between INTERVAL and its left child.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
526 527 528
  new->left = interval->left;
  new->left->parent = new;
  interval->left = new;
529 530 531 532
  new->total_length = new_length + new->left->total_length;

  balance_an_interval (new);
  balance_possible_root_interval (interval);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
533 534 535 536

  return new;
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
537
/* Find the interval containing text position POSITION in the text
538 539 540
   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
541

Joseph Arceneaux's avatar
Joseph Arceneaux committed
542 543
   The `position' field, which is a cache of an interval's position,
   is updated in the interval found.  Other functions (e.g., next_interval)
544
   will update this cache based on the result of find_interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
545 546

INLINE INTERVAL
Joseph Arceneaux's avatar
Joseph Arceneaux committed
547 548 549 550
find_interval (tree, position)
     register INTERVAL tree;
     register int position;
{
551 552 553
  /* 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
554 555 556 557

  if (NULL_INTERVAL_P (tree))
    return NULL_INTERVAL;

558
  if (relative_position > TOTAL_LENGTH (tree))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
559 560
    abort ();			/* Paranoia */

561 562
  tree = balance_possible_root_interval (tree);

Joseph Arceneaux's avatar
Joseph Arceneaux committed
563 564
  while (1)
    {
565
      if (relative_position < LEFT_TOTAL_LENGTH (tree))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
566 567 568
	{
	  tree = tree->left;
	}
569 570 571
      else if (! NULL_RIGHT_CHILD (tree)
	       && relative_position >= (TOTAL_LENGTH (tree)
					- RIGHT_TOTAL_LENGTH (tree)))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
572 573 574 575 576 577 578
	{
	  relative_position -= (TOTAL_LENGTH (tree)
				- RIGHT_TOTAL_LENGTH (tree));
	  tree = tree->right;
	}
      else
	{
579 580 581 582
	  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
583 584 585 586 587 588
	  return tree;
	}
    }
}

/* Find the succeeding interval (lexicographically) to INTERVAL.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
589
   Sets the `position' field based on that of INTERVAL (see
590
   find_interval).  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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 617 618 619 620 621 622 623 624 625 626 627 628

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
629
   Sets the `position' field based on that of INTERVAL (see
630
   find_interval).  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667

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
668
#if 0
Joseph Arceneaux's avatar
Joseph Arceneaux committed
669 670 671 672 673 674 675 676 677 678
/* 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
679
   to the root.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

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,
717
	     then this code will have to change.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
718 719 720 721 722 723 724
	  this->total_length += length;
	  this->position = LEFT_TOTAL_LENGTH (this)
	                   + position - relative_position + 1;
	  return tree;
	}
    }
}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
725 726 727 728 729 730 731 732 733 734 735
#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
736
   If both intervals are "sticky", then make them belong to the left-most
Joseph Arceneaux's avatar
Joseph Arceneaux committed
737
   interval.  Another possibility would be to create a new interval for
738
   this text, and make it have the merged properties of both ends.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
739 740 741 742 743 744 745

static INTERVAL
adjust_intervals_for_insertion (tree, position, length)
     INTERVAL tree;
     int position, length;
{
  register INTERVAL i;
746 747 748
  register INTERVAL temp;
  int eobp = 0;
  
Joseph Arceneaux's avatar
Joseph Arceneaux committed
749 750 751
  if (TOTAL_LENGTH (tree) == 0)	/* Paranoia */
    abort ();

752 753
  /* If inserting at point-max of a buffer, that position will be out
     of range.  Remember that buffer positions are 1-based.  */
754
  if (position >= BEG + TOTAL_LENGTH (tree)){
755
    position = BEG + TOTAL_LENGTH (tree);
756 757
    eobp = 1;
  }
Joseph Arceneaux's avatar
Joseph Arceneaux committed
758 759

  i = find_interval (tree, position);
760

761 762 763 764 765 766 767 768 769 770 771 772
  /* 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
773
  /* If we are positioned between intervals, check the stickiness of
774 775
     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
776
    {
777 778 779 780 781 782 783 784 785 786 787
      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
788

789 790 791
      /* 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.  */
792 793 794 795 796
      for (temp = prev ? prev : i;! NULL_INTERVAL_P (temp); temp = temp->parent)
	{
	  temp->total_length += length;
	  temp = balance_possible_root_interval (temp);
	}
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
      
      /* 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
834 835
    }

836 837
  /* Otherwise just extend the interval.  */
  else
Joseph Arceneaux's avatar
Joseph Arceneaux committed
838
    {
839
      for (temp = i; ! NULL_INTERVAL_P (temp); temp = temp->parent)
840 841 842 843
	{
	  temp->total_length += length;
	  temp = balance_possible_root_interval (temp);
	}
Joseph Arceneaux's avatar
Joseph Arceneaux committed
844
    }
845
      
Joseph Arceneaux's avatar
Joseph Arceneaux committed
846 847
  return tree;
}
848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870

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;
      
871
      if (CONSP (lrear) ? NILP (Fmemq (sym, lrear)) : NILP (lrear))
872 873 874 875
	{
	  /* rear-sticky is dominant, we needn't search in PRIGHT.  */
	  
	  props = Fcons (sym, Fcons (Fcar (Fcdr (tail1)), props));
876 877
	  if ((CONSP (lfront) || NILP (lfront))
	      && ! NILP (Fmemq (sym, lfront)))
878 879 880 881 882 883 884 885 886
	    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)))
	      {
		
887 888
		if (CONSP (rfront)
		    ? ! NILP (Fmemq (sym, rfront)) : ! NILP (rfront))
889 890 891 892 893
		  {
		    /* 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);
894 895
		    if ((CONSP (rrear) || NILP (rrear))
			&& ! NILP (Fmemq (sym, rrear)))
896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911
		      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.  */
912 913
      if (CONSP (rfront)
	  ? NILP (Fmemq (sym, rfront)) : NILP (rfront))
914 915 916 917 918 919 920 921 922 923 924
	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);
925 926
	  if ((CONSP (rrear) || NILP (rrear))
	      && ! NILP (Fmemq (sym, rrear)))
927 928 929 930 931 932 933 934 935 936 937
	    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
938

Joseph Arceneaux's avatar
Joseph Arceneaux committed
939 940
/* Delete an node I from its interval tree by merging its subtrees
   into one subtree which is then returned.  Caller is responsible for
941
   storing the resulting subtree into its parent.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
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

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
974
   for the length of I.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
975 976 977 978 979 980 981 982

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

983
  if (amt > 0)			/* Only used on zero-length intervals now.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017
    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;
    }
}

1018 1019 1020 1021 1022 1023 1024 1025
/* 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
1026

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1027
   Do this by recursing down TREE to the interval in question, and
1028
   deleting the appropriate amount of text.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040

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 */
1041
  if (relative_position < LEFT_TOTAL_LENGTH (tree))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1042 1043 1044 1045 1046 1047 1048 1049
    {
      int subtract = interval_deletion_adjustment (tree->left,
						   relative_position,
						   amount);
      tree->total_length -= subtract;
      return subtract;
    }
  /* Right branch */
1050 1051
  else if (relative_position >= (TOTAL_LENGTH (tree)
				 - RIGHT_TOTAL_LENGTH (tree)))
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
    {
      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;
    }
1063
  /* Here -- this node.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1064 1065
  else
    {
1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078
      /* 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
1079 1080
    }

1081
  /* Never reach here.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1082 1083
}

1084 1085 1086
/* 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
1087
   buffer position, i.e. origin 1).  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1088

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
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;

1101 1102 1103 1104
  if (start > BEG + TOTAL_LENGTH (tree)
      || start + length > BEG + TOTAL_LENGTH (tree))
    abort ();

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116
  if (length == TOTAL_LENGTH (tree))
    {
      buffer->intervals = NULL_INTERVAL;
      return;
    }

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

1117 1118
  if (start > BEG + TOTAL_LENGTH (tree))
    start = BEG + TOTAL_LENGTH (tree);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1119 1120
  while (left_to_delete > 0)
    {
1121
      left_to_delete -= interval_deletion_adjustment (tree, start - 1,
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1122 1123 1124 1125 1126 1127 1128 1129 1130 1131
						      left_to_delete);
      tree = buffer->intervals;
      if (left_to_delete == tree->total_length)
	{
	  buffer->intervals = NULL_INTERVAL;
	  return;
	}
    }
}

1132
/* Make the adjustments necessary to the interval tree of BUFFER to
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1133 1134
   represent an addition or deletion of LENGTH characters starting
   at position START.  Addition or deletion is indicated by the sign
1135
   of LENGTH.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149

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
1150 1151 1152 1153 1154 1155 1156 1157

/* 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)
1158
   interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1159 1160 1161 1162 1163 1164 1165 1166

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

1167
  /* Zero out this interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1168 1169
  i->total_length -= absorb;

1170
  /* Find the succeeding interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1171
  if (! NULL_RIGHT_CHILD (i))      /* It's below us.  Add absorb
1172
				      as we descend.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187
    {
      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
1188
					      we ascend.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201
    {
      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
1202
     be merged right.  The caller should have known.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1203 1204 1205 1206 1207 1208 1209 1210
  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:
1211
   The caller must verify that this is not the first (leftmost) interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1212 1213 1214 1215 1216 1217 1218 1219

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

1220
  /* Zero out this interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1221 1222
  i->total_length -= absorb;

1223
  /* Find the preceding interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1224
  if (! NULL_LEFT_CHILD (i))	/* It's below us. Go down,
1225
				   adding ABSORB as we go.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240
    {
      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,
1241
				   subtracting ABSORB.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252
    {
      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
1253

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1254
  /* This must be the leftmost or first interval and cannot
1255
     be merged left.  The caller should have known.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1256 1257 1258
  abort ();
}

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1259 1260 1261
/* 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
1262
   the pointers of the copy.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1263

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280
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;
}

1281 1282 1283
#if 0
/* Nobody calls this.  Perhaps it's a vestige of an earlier design.  */

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1284 1285 1286 1287 1288
/* 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
1289
   interval.  */
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1290

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306
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)
    {
1307
      /* New right node.  */
1308
      split_interval_right (slot, length);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1309 1310 1311 1312 1313
      return slot;
    }

  if (slot->position + LENGTH (slot) == start + length)
    {
1314
      /* New left node.  */
1315
      split_interval_left (slot, LENGTH (slot) - length);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1316 1317 1318
      return slot;
    }

1319
  /* Convert interval SLOT into three intervals.  */
1320 1321
  split_interval_left (slot, start - slot->position);
  split_interval_right (slot, length);
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1322 1323
  return slot;
}
1324
#endif
1325

Joseph Arceneaux's avatar
Joseph Arceneaux committed
1326
/* Insert the intervals of SOURCE into BUFFER at POSITION.
1327
   LENGTH is the length of the text in SOURCE.
Joseph Arceneaux's avatar
Joseph Arceneaux committed
1328