Commit | Line | Data |
---|---|---|
a50699fd | 1 | /* Code for doing intervals. |
b745025d | 2 | Copyright (C) 1993, 1994, 1995, 1997 Free Software Foundation, Inc. |
a50699fd JA |
3 | |
4 | This file is part of GNU Emacs. | |
5 | ||
6 | GNU Emacs is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
7ce503fd | 8 | the Free Software Foundation; either version 2, or (at your option) |
a50699fd JA |
9 | any later version. |
10 | ||
11 | GNU Emacs is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU Emacs; see the file COPYING. If not, write to | |
3b7ad313 EN |
18 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. */ | |
a50699fd JA |
20 | |
21 | ||
22 | /* NOTES: | |
23 | ||
24 | Have to ensure that we can't put symbol nil on a plist, or some | |
25 | functions may work incorrectly. | |
26 | ||
27 | An idea: Have the owner of the tree keep count of splits and/or | |
28 | insertion lengths (in intervals), and balance after every N. | |
29 | ||
30 | Need to call *_left_hook when buffer is killed. | |
31 | ||
32 | Scan for zero-length, or 0-length to see notes about handling | |
33 | zero length interval-markers. | |
34 | ||
35 | There are comments around about freeing intervals. It might be | |
36 | faster to explicitly free them (put them on the free list) than | |
37 | to GC them. | |
38 | ||
39 | */ | |
40 | ||
41 | ||
18160b98 | 42 | #include <config.h> |
a50699fd JA |
43 | #include "lisp.h" |
44 | #include "intervals.h" | |
45 | #include "buffer.h" | |
328c0f1f | 46 | #include "puresize.h" |
f54a8c1a | 47 | #include "keyboard.h" |
a50699fd | 48 | |
7ce503fd | 49 | /* The rest of the file is within this conditional. */ |
d2f7a802 JA |
50 | #ifdef USE_TEXT_PROPERTIES |
51 | ||
45d82bdc KH |
52 | /* Test for membership, allowing for t (actually any non-cons) to mean the |
53 | universal set. */ | |
54 | ||
55 | #define TMEM(sym, set) (CONSP (set) ? ! NILP (Fmemq (sym, set)) : ! NILP (set)) | |
56 | ||
d8638d30 RS |
57 | #define min(x, y) ((x) < (y) ? (x) : (y)) |
58 | ||
b5f37d3f | 59 | Lisp_Object merge_properties_sticky (); |
a50699fd | 60 | \f |
7ce503fd | 61 | /* Utility functions for intervals. */ |
a50699fd JA |
62 | |
63 | ||
7ce503fd | 64 | /* Create the root interval of some object, a buffer or string. */ |
a50699fd JA |
65 | |
66 | INTERVAL | |
67 | create_root_interval (parent) | |
68 | Lisp_Object parent; | |
69 | { | |
328c0f1f RS |
70 | INTERVAL new; |
71 | ||
72 | CHECK_IMPURE (parent); | |
73 | ||
74 | new = make_interval (); | |
a50699fd | 75 | |
b629dd47 | 76 | if (BUFFERP (parent)) |
a50699fd | 77 | { |
2bc7a79b JB |
78 | new->total_length = (BUF_Z (XBUFFER (parent)) |
79 | - BUF_BEG (XBUFFER (parent))); | |
e5d967c9 | 80 | BUF_INTERVALS (XBUFFER (parent)) = new; |
a50699fd | 81 | } |
b629dd47 | 82 | else if (STRINGP (parent)) |
a50699fd JA |
83 | { |
84 | new->total_length = XSTRING (parent)->size; | |
85 | XSTRING (parent)->intervals = new; | |
86 | } | |
87 | ||
88 | new->parent = (INTERVAL) parent; | |
89 | new->position = 1; | |
90 | ||
91 | return new; | |
92 | } | |
93 | ||
94 | /* Make the interval TARGET have exactly the properties of SOURCE */ | |
95 | ||
96 | void | |
97 | copy_properties (source, target) | |
98 | register INTERVAL source, target; | |
99 | { | |
100 | if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target)) | |
101 | return; | |
102 | ||
103 | COPY_INTERVAL_CACHE (source, target); | |
104 | target->plist = Fcopy_sequence (source->plist); | |
105 | } | |
106 | ||
107 | /* Merge the properties of interval SOURCE into the properties | |
323a7ad4 RS |
108 | of interval TARGET. That is to say, each property in SOURCE |
109 | is added to TARGET if TARGET has no such property as yet. */ | |
a50699fd JA |
110 | |
111 | static void | |
112 | merge_properties (source, target) | |
113 | register INTERVAL source, target; | |
114 | { | |
115 | register Lisp_Object o, sym, val; | |
116 | ||
117 | if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target)) | |
118 | return; | |
119 | ||
120 | MERGE_INTERVAL_CACHE (source, target); | |
121 | ||
122 | o = source->plist; | |
123 | while (! EQ (o, Qnil)) | |
124 | { | |
125 | sym = Fcar (o); | |
126 | val = Fmemq (sym, target->plist); | |
127 | ||
128 | if (NILP (val)) | |
129 | { | |
130 | o = Fcdr (o); | |
131 | val = Fcar (o); | |
132 | target->plist = Fcons (sym, Fcons (val, target->plist)); | |
133 | o = Fcdr (o); | |
134 | } | |
135 | else | |
136 | o = Fcdr (Fcdr (o)); | |
137 | } | |
138 | } | |
139 | ||
140 | /* Return 1 if the two intervals have the same properties, | |
7ce503fd | 141 | 0 otherwise. */ |
a50699fd JA |
142 | |
143 | int | |
144 | intervals_equal (i0, i1) | |
145 | INTERVAL i0, i1; | |
146 | { | |
147 | register Lisp_Object i0_cdr, i0_sym, i1_val; | |
148 | register i1_len; | |
149 | ||
150 | if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1)) | |
151 | return 1; | |
152 | ||
323a7ad4 RS |
153 | if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1)) |
154 | return 0; | |
155 | ||
a50699fd JA |
156 | i1_len = XFASTINT (Flength (i1->plist)); |
157 | if (i1_len & 0x1) /* Paranoia -- plists are always even */ | |
158 | abort (); | |
159 | i1_len /= 2; | |
160 | i0_cdr = i0->plist; | |
161 | while (!NILP (i0_cdr)) | |
162 | { | |
7ce503fd | 163 | /* Lengths of the two plists were unequal. */ |
a50699fd JA |
164 | if (i1_len == 0) |
165 | return 0; | |
166 | ||
167 | i0_sym = Fcar (i0_cdr); | |
168 | i1_val = Fmemq (i0_sym, i1->plist); | |
169 | ||
7ce503fd | 170 | /* i0 has something i1 doesn't. */ |
a50699fd JA |
171 | if (EQ (i1_val, Qnil)) |
172 | return 0; | |
173 | ||
7ce503fd | 174 | /* i0 and i1 both have sym, but it has different values in each. */ |
a50699fd | 175 | i0_cdr = Fcdr (i0_cdr); |
7ce503fd | 176 | if (! EQ (Fcar (Fcdr (i1_val)), Fcar (i0_cdr))) |
a50699fd JA |
177 | return 0; |
178 | ||
179 | i0_cdr = Fcdr (i0_cdr); | |
180 | i1_len--; | |
181 | } | |
182 | ||
7ce503fd | 183 | /* Lengths of the two plists were unequal. */ |
a50699fd JA |
184 | if (i1_len > 0) |
185 | return 0; | |
186 | ||
187 | return 1; | |
188 | } | |
189 | \f | |
190 | static int icount; | |
191 | static int idepth; | |
192 | static int zero_length; | |
193 | ||
a50699fd | 194 | /* Traverse an interval tree TREE, performing FUNCTION on each node. |
4a93c905 | 195 | Pass FUNCTION two args: an interval, and ARG. */ |
a50699fd JA |
196 | |
197 | void | |
4a93c905 | 198 | traverse_intervals (tree, position, depth, function, arg) |
a50699fd | 199 | INTERVAL tree; |
e0b63493 | 200 | int position, depth; |
a50699fd | 201 | void (* function) (); |
4a93c905 | 202 | Lisp_Object arg; |
a50699fd JA |
203 | { |
204 | if (NULL_INTERVAL_P (tree)) | |
205 | return; | |
206 | ||
323a7ad4 | 207 | traverse_intervals (tree->left, position, depth + 1, function, arg); |
a50699fd JA |
208 | position += LEFT_TOTAL_LENGTH (tree); |
209 | tree->position = position; | |
4a93c905 | 210 | (*function) (tree, arg); |
a50699fd | 211 | position += LENGTH (tree); |
323a7ad4 | 212 | traverse_intervals (tree->right, position, depth + 1, function, arg); |
a50699fd JA |
213 | } |
214 | \f | |
215 | #if 0 | |
7ce503fd | 216 | /* These functions are temporary, for debugging purposes only. */ |
a50699fd JA |
217 | |
218 | INTERVAL search_interval, found_interval; | |
219 | ||
220 | void | |
221 | check_for_interval (i) | |
222 | register INTERVAL i; | |
223 | { | |
224 | if (i == search_interval) | |
225 | { | |
226 | found_interval = i; | |
227 | icount++; | |
228 | } | |
229 | } | |
230 | ||
231 | INTERVAL | |
232 | search_for_interval (i, tree) | |
233 | register INTERVAL i, tree; | |
234 | { | |
235 | icount = 0; | |
236 | search_interval = i; | |
237 | found_interval = NULL_INTERVAL; | |
4a93c905 | 238 | traverse_intervals (tree, 1, 0, &check_for_interval, Qnil); |
a50699fd JA |
239 | return found_interval; |
240 | } | |
241 | ||
242 | static void | |
243 | inc_interval_count (i) | |
244 | INTERVAL i; | |
245 | { | |
246 | icount++; | |
247 | if (LENGTH (i) == 0) | |
248 | zero_length++; | |
249 | if (depth > idepth) | |
250 | idepth = depth; | |
251 | } | |
252 | ||
253 | int | |
254 | count_intervals (i) | |
255 | register INTERVAL i; | |
256 | { | |
257 | icount = 0; | |
258 | idepth = 0; | |
259 | zero_length = 0; | |
4a93c905 | 260 | traverse_intervals (i, 1, 0, &inc_interval_count, Qnil); |
a50699fd JA |
261 | |
262 | return icount; | |
263 | } | |
264 | ||
265 | static INTERVAL | |
266 | root_interval (interval) | |
267 | INTERVAL interval; | |
268 | { | |
269 | register INTERVAL i = interval; | |
270 | ||
271 | while (! ROOT_INTERVAL_P (i)) | |
272 | i = i->parent; | |
273 | ||
274 | return i; | |
275 | } | |
276 | #endif | |
277 | \f | |
278 | /* Assuming that a left child exists, perform the following operation: | |
279 | ||
280 | A B | |
281 | / \ / \ | |
282 | B => A | |
283 | / \ / \ | |
284 | c c | |
285 | */ | |
286 | ||
287 | static INTERVAL | |
288 | rotate_right (interval) | |
289 | INTERVAL interval; | |
290 | { | |
291 | INTERVAL i; | |
292 | INTERVAL B = interval->left; | |
4314dea4 | 293 | int old_total = interval->total_length; |
a50699fd | 294 | |
7ce503fd | 295 | /* Deal with any Parent of A; make it point to B. */ |
a50699fd JA |
296 | if (! ROOT_INTERVAL_P (interval)) |
297 | if (AM_LEFT_CHILD (interval)) | |
4314dea4 | 298 | interval->parent->left = B; |
a50699fd | 299 | else |
4314dea4 RS |
300 | interval->parent->right = B; |
301 | B->parent = interval->parent; | |
a50699fd | 302 | |
4314dea4 RS |
303 | /* Make B the parent of A */ |
304 | i = B->right; | |
305 | B->right = interval; | |
306 | interval->parent = B; | |
a50699fd | 307 | |
4314dea4 | 308 | /* Make A point to c */ |
a50699fd JA |
309 | interval->left = i; |
310 | if (! NULL_INTERVAL_P (i)) | |
311 | i->parent = interval; | |
4314dea4 | 312 | |
550bd63a | 313 | /* A's total length is decreased by the length of B and its left child. */ |
4314dea4 RS |
314 | interval->total_length -= B->total_length - LEFT_TOTAL_LENGTH (interval); |
315 | ||
316 | /* B must have the same total length of A. */ | |
317 | B->total_length = old_total; | |
a50699fd JA |
318 | |
319 | return B; | |
320 | } | |
4314dea4 | 321 | |
a50699fd JA |
322 | /* Assuming that a right child exists, perform the following operation: |
323 | ||
324 | A B | |
325 | / \ / \ | |
326 | B => A | |
327 | / \ / \ | |
328 | c c | |
329 | */ | |
330 | ||
331 | static INTERVAL | |
332 | rotate_left (interval) | |
333 | INTERVAL interval; | |
334 | { | |
335 | INTERVAL i; | |
336 | INTERVAL B = interval->right; | |
4314dea4 | 337 | int old_total = interval->total_length; |
a50699fd | 338 | |
4314dea4 | 339 | /* Deal with any parent of A; make it point to B. */ |
a50699fd JA |
340 | if (! ROOT_INTERVAL_P (interval)) |
341 | if (AM_LEFT_CHILD (interval)) | |
4314dea4 | 342 | interval->parent->left = B; |
a50699fd | 343 | else |
4314dea4 RS |
344 | interval->parent->right = B; |
345 | B->parent = interval->parent; | |
a50699fd JA |
346 | |
347 | /* Make B the parent of A */ | |
4314dea4 RS |
348 | i = B->left; |
349 | B->left = interval; | |
350 | interval->parent = B; | |
a50699fd JA |
351 | |
352 | /* Make A point to c */ | |
353 | interval->right = i; | |
354 | if (! NULL_INTERVAL_P (i)) | |
355 | i->parent = interval; | |
4314dea4 | 356 | |
550bd63a | 357 | /* A's total length is decreased by the length of B and its right child. */ |
4314dea4 RS |
358 | interval->total_length -= B->total_length - RIGHT_TOTAL_LENGTH (interval); |
359 | ||
360 | /* B must have the same total length of A. */ | |
361 | B->total_length = old_total; | |
a50699fd JA |
362 | |
363 | return B; | |
364 | } | |
365 | \f | |
4314dea4 RS |
366 | /* Balance an interval tree with the assumption that the subtrees |
367 | themselves are already balanced. */ | |
368 | ||
369 | static INTERVAL | |
370 | balance_an_interval (i) | |
371 | INTERVAL i; | |
372 | { | |
373 | register int old_diff, new_diff; | |
374 | ||
375 | while (1) | |
376 | { | |
377 | old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i); | |
378 | if (old_diff > 0) | |
379 | { | |
380 | new_diff = i->total_length - i->left->total_length | |
381 | + RIGHT_TOTAL_LENGTH (i->left) - LEFT_TOTAL_LENGTH (i->left); | |
382 | if (abs (new_diff) >= old_diff) | |
383 | break; | |
384 | i = rotate_right (i); | |
385 | balance_an_interval (i->right); | |
386 | } | |
387 | else if (old_diff < 0) | |
388 | { | |
389 | new_diff = i->total_length - i->right->total_length | |
390 | + LEFT_TOTAL_LENGTH (i->right) - RIGHT_TOTAL_LENGTH (i->right); | |
391 | if (abs (new_diff) >= -old_diff) | |
392 | break; | |
393 | i = rotate_left (i); | |
394 | balance_an_interval (i->left); | |
395 | } | |
396 | else | |
397 | break; | |
398 | } | |
399 | return i; | |
400 | } | |
401 | ||
402 | /* Balance INTERVAL, potentially stuffing it back into its parent | |
403 | Lisp Object. */ | |
404 | ||
405 | static INLINE INTERVAL | |
406 | balance_possible_root_interval (interval) | |
407 | register INTERVAL interval; | |
408 | { | |
409 | Lisp_Object parent; | |
410 | ||
411 | if (interval->parent == NULL_INTERVAL) | |
412 | return interval; | |
413 | ||
414 | parent = (Lisp_Object) (interval->parent); | |
415 | interval = balance_an_interval (interval); | |
416 | ||
b629dd47 | 417 | if (BUFFERP (parent)) |
e5d967c9 | 418 | BUF_INTERVALS (XBUFFER (parent)) = interval; |
b629dd47 | 419 | else if (STRINGP (parent)) |
4314dea4 RS |
420 | XSTRING (parent)->intervals = interval; |
421 | ||
422 | return interval; | |
423 | } | |
424 | ||
425 | /* Balance the interval tree TREE. Balancing is by weight | |
426 | (the amount of text). */ | |
427 | ||
428 | static INTERVAL | |
429 | balance_intervals_internal (tree) | |
430 | register INTERVAL tree; | |
431 | { | |
432 | /* Balance within each side. */ | |
433 | if (tree->left) | |
8f3b9b95 | 434 | balance_intervals_internal (tree->left); |
4314dea4 | 435 | if (tree->right) |
8f3b9b95 | 436 | balance_intervals_internal (tree->right); |
4314dea4 RS |
437 | return balance_an_interval (tree); |
438 | } | |
439 | ||
440 | /* Advertised interface to balance intervals. */ | |
441 | ||
442 | INTERVAL | |
443 | balance_intervals (tree) | |
444 | INTERVAL tree; | |
445 | { | |
446 | if (tree == NULL_INTERVAL) | |
447 | return NULL_INTERVAL; | |
448 | ||
449 | return balance_intervals_internal (tree); | |
450 | } | |
451 | \f | |
2bc7a79b JB |
452 | /* Split INTERVAL into two pieces, starting the second piece at |
453 | character position OFFSET (counting from 0), relative to INTERVAL. | |
454 | INTERVAL becomes the left-hand piece, and the right-hand piece | |
455 | (second, lexicographically) is returned. | |
90ba40fc JA |
456 | |
457 | The size and position fields of the two intervals are set based upon | |
458 | those of the original interval. The property list of the new interval | |
459 | is reset, thus it is up to the caller to do the right thing with the | |
460 | result. | |
a50699fd JA |
461 | |
462 | Note that this does not change the position of INTERVAL; if it is a root, | |
7ce503fd | 463 | it is still a root after this operation. */ |
a50699fd JA |
464 | |
465 | INTERVAL | |
90ba40fc | 466 | split_interval_right (interval, offset) |
a50699fd | 467 | INTERVAL interval; |
90ba40fc | 468 | int offset; |
a50699fd JA |
469 | { |
470 | INTERVAL new = make_interval (); | |
471 | int position = interval->position; | |
2bc7a79b | 472 | int new_length = LENGTH (interval) - offset; |
a50699fd | 473 | |
2bc7a79b | 474 | new->position = position + offset; |
a50699fd | 475 | new->parent = interval; |
a50699fd | 476 | |
4314dea4 | 477 | if (NULL_RIGHT_CHILD (interval)) |
a50699fd JA |
478 | { |
479 | interval->right = new; | |
480 | new->total_length = new_length; | |
481 | ||
482 | return new; | |
483 | } | |
484 | ||
7ce503fd | 485 | /* Insert the new node between INTERVAL and its right child. */ |
a50699fd JA |
486 | new->right = interval->right; |
487 | interval->right->parent = new; | |
488 | interval->right = new; | |
a50699fd JA |
489 | new->total_length = new_length + new->right->total_length; |
490 | ||
4314dea4 RS |
491 | balance_an_interval (new); |
492 | balance_possible_root_interval (interval); | |
493 | ||
a50699fd JA |
494 | return new; |
495 | } | |
496 | ||
2bc7a79b JB |
497 | /* Split INTERVAL into two pieces, starting the second piece at |
498 | character position OFFSET (counting from 0), relative to INTERVAL. | |
499 | INTERVAL becomes the right-hand piece, and the left-hand piece | |
500 | (first, lexicographically) is returned. | |
a50699fd | 501 | |
90ba40fc JA |
502 | The size and position fields of the two intervals are set based upon |
503 | those of the original interval. The property list of the new interval | |
504 | is reset, thus it is up to the caller to do the right thing with the | |
505 | result. | |
506 | ||
507 | Note that this does not change the position of INTERVAL; if it is a root, | |
7ce503fd | 508 | it is still a root after this operation. */ |
a50699fd JA |
509 | |
510 | INTERVAL | |
90ba40fc | 511 | split_interval_left (interval, offset) |
a50699fd | 512 | INTERVAL interval; |
90ba40fc | 513 | int offset; |
a50699fd JA |
514 | { |
515 | INTERVAL new = make_interval (); | |
516 | int position = interval->position; | |
2bc7a79b | 517 | int new_length = offset; |
a50699fd | 518 | |
a50699fd | 519 | new->position = interval->position; |
2bc7a79b | 520 | interval->position = interval->position + offset; |
a50699fd JA |
521 | new->parent = interval; |
522 | ||
523 | if (NULL_LEFT_CHILD (interval)) | |
524 | { | |
525 | interval->left = new; | |
526 | new->total_length = new_length; | |
527 | ||
528 | return new; | |
529 | } | |
530 | ||
7ce503fd | 531 | /* Insert the new node between INTERVAL and its left child. */ |
a50699fd JA |
532 | new->left = interval->left; |
533 | new->left->parent = new; | |
534 | interval->left = new; | |
4314dea4 RS |
535 | new->total_length = new_length + new->left->total_length; |
536 | ||
537 | balance_an_interval (new); | |
538 | balance_possible_root_interval (interval); | |
a50699fd JA |
539 | |
540 | return new; | |
541 | } | |
542 | \f | |
90ba40fc | 543 | /* Find the interval containing text position POSITION in the text |
24e3d3bf JB |
544 | represented by the interval tree TREE. POSITION is a buffer |
545 | position; the earliest position is 1. If POSITION is at the end of | |
546 | the buffer, return the interval containing the last character. | |
a50699fd | 547 | |
90ba40fc JA |
548 | The `position' field, which is a cache of an interval's position, |
549 | is updated in the interval found. Other functions (e.g., next_interval) | |
7ce503fd | 550 | will update this cache based on the result of find_interval. */ |
90ba40fc JA |
551 | |
552 | INLINE INTERVAL | |
a50699fd JA |
553 | find_interval (tree, position) |
554 | register INTERVAL tree; | |
555 | register int position; | |
556 | { | |
24e3d3bf JB |
557 | /* The distance from the left edge of the subtree at TREE |
558 | to POSITION. */ | |
559 | register int relative_position = position - BEG; | |
a50699fd JA |
560 | |
561 | if (NULL_INTERVAL_P (tree)) | |
562 | return NULL_INTERVAL; | |
563 | ||
24e3d3bf | 564 | if (relative_position > TOTAL_LENGTH (tree)) |
a50699fd | 565 | abort (); /* Paranoia */ |
a50699fd | 566 | |
4314dea4 RS |
567 | tree = balance_possible_root_interval (tree); |
568 | ||
a50699fd JA |
569 | while (1) |
570 | { | |
24e3d3bf | 571 | if (relative_position < LEFT_TOTAL_LENGTH (tree)) |
a50699fd JA |
572 | { |
573 | tree = tree->left; | |
574 | } | |
24e3d3bf JB |
575 | else if (! NULL_RIGHT_CHILD (tree) |
576 | && relative_position >= (TOTAL_LENGTH (tree) | |
577 | - RIGHT_TOTAL_LENGTH (tree))) | |
a50699fd JA |
578 | { |
579 | relative_position -= (TOTAL_LENGTH (tree) | |
580 | - RIGHT_TOTAL_LENGTH (tree)); | |
581 | tree = tree->right; | |
582 | } | |
583 | else | |
584 | { | |
24e3d3bf JB |
585 | tree->position = |
586 | (position - relative_position /* the left edge of *tree */ | |
587 | + LEFT_TOTAL_LENGTH (tree)); /* the left edge of this interval */ | |
588 | ||
a50699fd JA |
589 | return tree; |
590 | } | |
591 | } | |
592 | } | |
593 | \f | |
594 | /* Find the succeeding interval (lexicographically) to INTERVAL. | |
90ba40fc | 595 | Sets the `position' field based on that of INTERVAL (see |
7ce503fd | 596 | find_interval). */ |
a50699fd JA |
597 | |
598 | INTERVAL | |
599 | next_interval (interval) | |
600 | register INTERVAL interval; | |
601 | { | |
602 | register INTERVAL i = interval; | |
603 | register int next_position; | |
604 | ||
605 | if (NULL_INTERVAL_P (i)) | |
606 | return NULL_INTERVAL; | |
607 | next_position = interval->position + LENGTH (interval); | |
608 | ||
609 | if (! NULL_RIGHT_CHILD (i)) | |
610 | { | |
611 | i = i->right; | |
612 | while (! NULL_LEFT_CHILD (i)) | |
613 | i = i->left; | |
614 | ||
615 | i->position = next_position; | |
616 | return i; | |
617 | } | |
618 | ||
619 | while (! NULL_PARENT (i)) | |
620 | { | |
621 | if (AM_LEFT_CHILD (i)) | |
622 | { | |
623 | i = i->parent; | |
624 | i->position = next_position; | |
625 | return i; | |
626 | } | |
627 | ||
628 | i = i->parent; | |
629 | } | |
630 | ||
631 | return NULL_INTERVAL; | |
632 | } | |
633 | ||
634 | /* Find the preceding interval (lexicographically) to INTERVAL. | |
90ba40fc | 635 | Sets the `position' field based on that of INTERVAL (see |
7ce503fd | 636 | find_interval). */ |
a50699fd JA |
637 | |
638 | INTERVAL | |
639 | previous_interval (interval) | |
640 | register INTERVAL interval; | |
641 | { | |
642 | register INTERVAL i; | |
643 | register position_of_previous; | |
644 | ||
645 | if (NULL_INTERVAL_P (interval)) | |
646 | return NULL_INTERVAL; | |
647 | ||
648 | if (! NULL_LEFT_CHILD (interval)) | |
649 | { | |
650 | i = interval->left; | |
651 | while (! NULL_RIGHT_CHILD (i)) | |
652 | i = i->right; | |
653 | ||
654 | i->position = interval->position - LENGTH (i); | |
655 | return i; | |
656 | } | |
657 | ||
658 | i = interval; | |
659 | while (! NULL_PARENT (i)) | |
660 | { | |
661 | if (AM_RIGHT_CHILD (i)) | |
662 | { | |
663 | i = i->parent; | |
664 | ||
665 | i->position = interval->position - LENGTH (i); | |
666 | return i; | |
667 | } | |
668 | i = i->parent; | |
669 | } | |
670 | ||
671 | return NULL_INTERVAL; | |
672 | } | |
25eeac41 RS |
673 | |
674 | /* Find the interval containing POS given some non-NULL INTERVAL | |
675 | in the same tree. */ | |
676 | INTERVAL | |
677 | update_interval (i, pos) | |
678 | register INTERVAL i; | |
679 | int pos; | |
680 | { | |
681 | if (NULL_INTERVAL_P (i)) | |
682 | return NULL_INTERVAL; | |
683 | ||
684 | while (1) | |
685 | { | |
686 | if (pos < i->position) | |
687 | { | |
688 | /* Move left. */ | |
689 | if (pos >= i->position - TOTAL_LENGTH (i->left)) | |
690 | i = i->left; /* Move to the left child */ | |
691 | else if (NULL_PARENT (i)) | |
692 | error ("Point before start of properties"); | |
693 | else i = i->parent; | |
694 | continue; | |
695 | } | |
696 | else if (pos >= INTERVAL_LAST_POS (i)) | |
697 | { | |
698 | /* Move right. */ | |
699 | if (pos < INTERVAL_LAST_POS (i) + TOTAL_LENGTH (i->right)) | |
700 | i = i->right; /* Move to the right child */ | |
701 | else if (NULL_PARENT (i)) | |
702 | error ("Point after end of properties"); | |
703 | else | |
704 | i = i->parent; | |
705 | continue; | |
706 | } | |
707 | else | |
708 | return i; | |
709 | } | |
710 | } | |
711 | ||
a50699fd | 712 | \f |
90ba40fc | 713 | #if 0 |
a50699fd JA |
714 | /* Traverse a path down the interval tree TREE to the interval |
715 | containing POSITION, adjusting all nodes on the path for | |
716 | an addition of LENGTH characters. Insertion between two intervals | |
717 | (i.e., point == i->position, where i is second interval) means | |
718 | text goes into second interval. | |
719 | ||
720 | Modifications are needed to handle the hungry bits -- after simply | |
721 | finding the interval at position (don't add length going down), | |
722 | if it's the beginning of the interval, get the previous interval | |
8e6208c5 | 723 | and check the hungry bits of both. Then add the length going back up |
7ce503fd | 724 | to the root. */ |
a50699fd JA |
725 | |
726 | static INTERVAL | |
727 | adjust_intervals_for_insertion (tree, position, length) | |
728 | INTERVAL tree; | |
729 | int position, length; | |
730 | { | |
731 | register int relative_position; | |
732 | register INTERVAL this; | |
733 | ||
734 | if (TOTAL_LENGTH (tree) == 0) /* Paranoia */ | |
735 | abort (); | |
736 | ||
737 | /* If inserting at point-max of a buffer, that position | |
738 | will be out of range */ | |
739 | if (position > TOTAL_LENGTH (tree)) | |
740 | position = TOTAL_LENGTH (tree); | |
741 | relative_position = position; | |
742 | this = tree; | |
743 | ||
744 | while (1) | |
745 | { | |
746 | if (relative_position <= LEFT_TOTAL_LENGTH (this)) | |
747 | { | |
748 | this->total_length += length; | |
749 | this = this->left; | |
750 | } | |
751 | else if (relative_position > (TOTAL_LENGTH (this) | |
752 | - RIGHT_TOTAL_LENGTH (this))) | |
753 | { | |
754 | relative_position -= (TOTAL_LENGTH (this) | |
755 | - RIGHT_TOTAL_LENGTH (this)); | |
756 | this->total_length += length; | |
757 | this = this->right; | |
758 | } | |
759 | else | |
760 | { | |
761 | /* If we are to use zero-length intervals as buffer pointers, | |
7ce503fd | 762 | then this code will have to change. */ |
a50699fd JA |
763 | this->total_length += length; |
764 | this->position = LEFT_TOTAL_LENGTH (this) | |
765 | + position - relative_position + 1; | |
766 | return tree; | |
767 | } | |
768 | } | |
769 | } | |
90ba40fc JA |
770 | #endif |
771 | ||
772 | /* Effect an adjustment corresponding to the addition of LENGTH characters | |
773 | of text. Do this by finding the interval containing POSITION in the | |
550bd63a | 774 | interval tree TREE, and then adjusting all of its ancestors by adding |
90ba40fc JA |
775 | LENGTH to them. |
776 | ||
777 | If POSITION is the first character of an interval, meaning that point | |
778 | is actually between the two intervals, make the new text belong to | |
779 | the interval which is "sticky". | |
780 | ||
1d1d7ba0 | 781 | If both intervals are "sticky", then make them belong to the left-most |
90ba40fc | 782 | interval. Another possibility would be to create a new interval for |
7ce503fd | 783 | this text, and make it have the merged properties of both ends. */ |
90ba40fc JA |
784 | |
785 | static INTERVAL | |
786 | adjust_intervals_for_insertion (tree, position, length) | |
787 | INTERVAL tree; | |
788 | int position, length; | |
789 | { | |
790 | register INTERVAL i; | |
7ce503fd RS |
791 | register INTERVAL temp; |
792 | int eobp = 0; | |
793 | ||
90ba40fc JA |
794 | if (TOTAL_LENGTH (tree) == 0) /* Paranoia */ |
795 | abort (); | |
796 | ||
24e3d3bf JB |
797 | /* If inserting at point-max of a buffer, that position will be out |
798 | of range. Remember that buffer positions are 1-based. */ | |
7ce503fd | 799 | if (position >= BEG + TOTAL_LENGTH (tree)){ |
24e3d3bf | 800 | position = BEG + TOTAL_LENGTH (tree); |
7ce503fd RS |
801 | eobp = 1; |
802 | } | |
90ba40fc JA |
803 | |
804 | i = find_interval (tree, position); | |
7ce503fd | 805 | |
2313b945 RS |
806 | /* If in middle of an interval which is not sticky either way, |
807 | we must not just give its properties to the insertion. | |
808 | So split this interval at the insertion point. */ | |
809 | if (! (position == i->position || eobp) | |
810 | && END_NONSTICKY_P (i) | |
ca41a64d | 811 | && FRONT_NONSTICKY_P (i)) |
2313b945 | 812 | { |
ca41a64d RS |
813 | Lisp_Object tail; |
814 | Lisp_Object front, rear; | |
815 | ||
816 | front = textget (i->plist, Qfront_sticky); | |
817 | rear = textget (i->plist, Qrear_nonsticky); | |
818 | ||
819 | /* Does any actual property pose an actual problem? */ | |
820 | for (tail = i->plist; ! NILP (tail); tail = Fcdr (Fcdr (tail))) | |
821 | { | |
822 | Lisp_Object prop; | |
823 | prop = XCONS (tail)->car; | |
824 | ||
825 | /* Is this particular property rear-sticky? | |
826 | Note, if REAR isn't a cons, it must be non-nil, | |
827 | which means that all properties are rear-nonsticky. */ | |
828 | if (CONSP (rear) && NILP (Fmemq (prop, rear))) | |
829 | continue; | |
830 | ||
831 | /* Is this particular property front-sticky? | |
832 | Note, if FRONT isn't a cons, it must be nil, | |
833 | which means that all properties are front-nonsticky. */ | |
834 | if (CONSP (front) && ! NILP (Fmemq (prop, front))) | |
835 | continue; | |
836 | ||
837 | /* PROP isn't sticky on either side => it is a real problem. */ | |
838 | break; | |
839 | } | |
840 | ||
841 | /* If any property is a real problem, split the interval. */ | |
842 | if (! NILP (tail)) | |
843 | { | |
844 | temp = split_interval_right (i, position - i->position); | |
845 | copy_properties (i, temp); | |
846 | i = temp; | |
847 | } | |
2313b945 RS |
848 | } |
849 | ||
90ba40fc | 850 | /* If we are positioned between intervals, check the stickiness of |
7ce503fd RS |
851 | both of them. We have to do this too, if we are at BEG or Z. */ |
852 | if (position == i->position || eobp) | |
90ba40fc | 853 | { |
7ce503fd RS |
854 | register INTERVAL prev; |
855 | ||
856 | if (position == BEG) | |
857 | prev = 0; | |
858 | else if (eobp) | |
859 | { | |
860 | prev = i; | |
861 | i = 0; | |
862 | } | |
863 | else | |
864 | prev = previous_interval (i); | |
90ba40fc | 865 | |
7ce503fd RS |
866 | /* Even if we are positioned between intervals, we default |
867 | to the left one if it exists. We extend it now and split | |
8e6208c5 | 868 | off a part later, if stickiness demands it. */ |
4314dea4 RS |
869 | for (temp = prev ? prev : i;! NULL_INTERVAL_P (temp); temp = temp->parent) |
870 | { | |
871 | temp->total_length += length; | |
872 | temp = balance_possible_root_interval (temp); | |
873 | } | |
7ce503fd RS |
874 | |
875 | /* If at least one interval has sticky properties, | |
8e6208c5 | 876 | we check the stickiness property by property. */ |
7ce503fd RS |
877 | if (END_NONSTICKY_P (prev) || FRONT_STICKY_P (i)) |
878 | { | |
dd675b05 | 879 | Lisp_Object pleft, pright; |
7ce503fd RS |
880 | struct interval newi; |
881 | ||
dd675b05 KH |
882 | pleft = NULL_INTERVAL_P (prev) ? Qnil : prev->plist; |
883 | pright = NULL_INTERVAL_P (i) ? Qnil : i->plist; | |
7ce503fd RS |
884 | newi.plist = merge_properties_sticky (pleft, pright); |
885 | ||
886 | if(! prev) /* i.e. position == BEG */ | |
887 | { | |
888 | if (! intervals_equal (i, &newi)) | |
889 | { | |
890 | i = split_interval_left (i, length); | |
891 | i->plist = newi.plist; | |
892 | } | |
893 | } | |
894 | else if (! intervals_equal (prev, &newi)) | |
895 | { | |
896 | prev = split_interval_right (prev, | |
897 | position - prev->position); | |
898 | prev->plist = newi.plist; | |
899 | if (! NULL_INTERVAL_P (i) | |
900 | && intervals_equal (prev, i)) | |
901 | merge_interval_right (prev); | |
902 | } | |
903 | ||
904 | /* We will need to update the cache here later. */ | |
905 | } | |
906 | else if (! prev && ! NILP (i->plist)) | |
907 | { | |
908 | /* Just split off a new interval at the left. | |
909 | Since I wasn't front-sticky, the empty plist is ok. */ | |
910 | i = split_interval_left (i, length); | |
911 | } | |
90ba40fc JA |
912 | } |
913 | ||
7ce503fd RS |
914 | /* Otherwise just extend the interval. */ |
915 | else | |
90ba40fc | 916 | { |
7ce503fd | 917 | for (temp = i; ! NULL_INTERVAL_P (temp); temp = temp->parent) |
4314dea4 RS |
918 | { |
919 | temp->total_length += length; | |
920 | temp = balance_possible_root_interval (temp); | |
921 | } | |
90ba40fc | 922 | } |
7ce503fd | 923 | |
90ba40fc JA |
924 | return tree; |
925 | } | |
7ce503fd | 926 | |
45d82bdc KH |
927 | /* Any property might be front-sticky on the left, rear-sticky on the left, |
928 | front-sticky on the right, or rear-sticky on the right; the 16 combinations | |
929 | can be arranged in a matrix with rows denoting the left conditions and | |
930 | columns denoting the right conditions: | |
931 | _ __ _ | |
932 | _ FR FR FR FR | |
933 | FR__ 0 1 2 3 | |
934 | _FR 4 5 6 7 | |
935 | FR 8 9 A B | |
936 | FR C D E F | |
937 | ||
938 | left-props = '(front-sticky (p8 p9 pa pb pc pd pe pf) | |
939 | rear-nonsticky (p4 p5 p6 p7 p8 p9 pa pb) | |
940 | p0 L p1 L p2 L p3 L p4 L p5 L p6 L p7 L | |
941 | p8 L p9 L pa L pb L pc L pd L pe L pf L) | |
942 | right-props = '(front-sticky (p2 p3 p6 p7 pa pb pe pf) | |
943 | rear-nonsticky (p1 p2 p5 p6 p9 pa pd pe) | |
944 | p0 R p1 R p2 R p3 R p4 R p5 R p6 R p7 R | |
945 | p8 R p9 R pa R pb R pc R pd R pe R pf R) | |
946 | ||
947 | We inherit from whoever has a sticky side facing us. If both sides | |
948 | do (cases 2, 3, E, and F), then we inherit from whichever side has a | |
949 | non-nil value for the current property. If both sides do, then we take | |
950 | from the left. | |
951 | ||
952 | When we inherit a property, we get its stickiness as well as its value. | |
953 | So, when we merge the above two lists, we expect to get this: | |
954 | ||
955 | result = '(front-sticky (p6 p7 pa pb pc pd pe pf) | |
956 | rear-nonsticky (p6 pa) | |
957 | p0 L p1 L p2 L p3 L p6 R p7 R | |
958 | pa R pb R pc L pd L pe L pf L) | |
959 | ||
960 | The optimizable special cases are: | |
961 | left rear-nonsticky = nil, right front-sticky = nil (inherit left) | |
962 | left rear-nonsticky = t, right front-sticky = t (inherit right) | |
963 | left rear-nonsticky = t, right front-sticky = nil (inherit none) | |
964 | */ | |
965 | ||
7ce503fd RS |
966 | Lisp_Object |
967 | merge_properties_sticky (pleft, pright) | |
968 | Lisp_Object pleft, pright; | |
969 | { | |
dd675b05 KH |
970 | register Lisp_Object props, front, rear; |
971 | Lisp_Object lfront, lrear, rfront, rrear; | |
4ab19eb3 | 972 | register Lisp_Object tail1, tail2, sym, lval, rval, cat; |
45d82bdc | 973 | int use_left, use_right; |
4ab19eb3 | 974 | int lpresent; |
7ce503fd | 975 | |
dd675b05 KH |
976 | props = Qnil; |
977 | front = Qnil; | |
978 | rear = Qnil; | |
979 | lfront = textget (pleft, Qfront_sticky); | |
980 | lrear = textget (pleft, Qrear_nonsticky); | |
981 | rfront = textget (pright, Qfront_sticky); | |
982 | rrear = textget (pright, Qrear_nonsticky); | |
983 | ||
45d82bdc KH |
984 | /* Go through each element of PRIGHT. */ |
985 | for (tail1 = pright; ! NILP (tail1); tail1 = Fcdr (Fcdr (tail1))) | |
7ce503fd RS |
986 | { |
987 | sym = Fcar (tail1); | |
988 | ||
989 | /* Sticky properties get special treatment. */ | |
990 | if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky)) | |
991 | continue; | |
45d82bdc KH |
992 | |
993 | rval = Fcar (Fcdr (tail1)); | |
994 | for (tail2 = pleft; ! NILP (tail2); tail2 = Fcdr (Fcdr (tail2))) | |
995 | if (EQ (sym, Fcar (tail2))) | |
996 | break; | |
45d82bdc | 997 | |
4ab19eb3 RS |
998 | /* Indicate whether the property is explicitly defined on the left. |
999 | (We know it is defined explicitly on the right | |
1000 | because otherwise we don't get here.) */ | |
1001 | lpresent = ! NILP (tail2); | |
1002 | lval = (NILP (tail2) ? Qnil : Fcar (Fcdr (tail2))); | |
1003 | ||
1004 | use_left = ! TMEM (sym, lrear) && lpresent; | |
45d82bdc KH |
1005 | use_right = TMEM (sym, rfront); |
1006 | if (use_left && use_right) | |
1007 | { | |
4ab19eb3 RS |
1008 | if (NILP (lval)) |
1009 | use_left = 0; | |
1010 | else if (NILP (rval)) | |
1011 | use_right = 0; | |
45d82bdc KH |
1012 | } |
1013 | if (use_left) | |
7ce503fd | 1014 | { |
45d82bdc KH |
1015 | /* We build props as (value sym ...) rather than (sym value ...) |
1016 | because we plan to nreverse it when we're done. */ | |
4ab19eb3 | 1017 | props = Fcons (lval, Fcons (sym, props)); |
45d82bdc | 1018 | if (TMEM (sym, lfront)) |
7ce503fd | 1019 | front = Fcons (sym, front); |
45d82bdc KH |
1020 | if (TMEM (sym, lrear)) |
1021 | rear = Fcons (sym, rear); | |
7ce503fd | 1022 | } |
45d82bdc | 1023 | else if (use_right) |
7ce503fd | 1024 | { |
4ab19eb3 | 1025 | props = Fcons (rval, Fcons (sym, props)); |
45d82bdc KH |
1026 | if (TMEM (sym, rfront)) |
1027 | front = Fcons (sym, front); | |
1028 | if (TMEM (sym, rrear)) | |
1029 | rear = Fcons (sym, rear); | |
7ce503fd RS |
1030 | } |
1031 | } | |
45d82bdc KH |
1032 | |
1033 | /* Now go through each element of PLEFT. */ | |
1034 | for (tail2 = pleft; ! NILP (tail2); tail2 = Fcdr (Fcdr (tail2))) | |
7ce503fd RS |
1035 | { |
1036 | sym = Fcar (tail2); | |
1037 | ||
1038 | /* Sticky properties get special treatment. */ | |
1039 | if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky)) | |
1040 | continue; | |
1041 | ||
45d82bdc KH |
1042 | /* If sym is in PRIGHT, we've already considered it. */ |
1043 | for (tail1 = pright; ! NILP (tail1); tail1 = Fcdr (Fcdr (tail1))) | |
7ce503fd RS |
1044 | if (EQ (sym, Fcar (tail1))) |
1045 | break; | |
45d82bdc KH |
1046 | if (! NILP (tail1)) |
1047 | continue; | |
1048 | ||
1049 | lval = Fcar (Fcdr (tail2)); | |
1050 | ||
1051 | /* Since rval is known to be nil in this loop, the test simplifies. */ | |
1052 | if (! TMEM (sym, lrear)) | |
7ce503fd | 1053 | { |
4ab19eb3 | 1054 | props = Fcons (lval, Fcons (sym, props)); |
45d82bdc KH |
1055 | if (TMEM (sym, lfront)) |
1056 | front = Fcons (sym, front); | |
1057 | } | |
1058 | else if (TMEM (sym, rfront)) | |
1059 | { | |
1060 | /* The value is nil, but we still inherit the stickiness | |
1061 | from the right. */ | |
7ce503fd | 1062 | front = Fcons (sym, front); |
45d82bdc | 1063 | if (TMEM (sym, rrear)) |
7ce503fd RS |
1064 | rear = Fcons (sym, rear); |
1065 | } | |
1066 | } | |
550bd63a | 1067 | props = Fnreverse (props); |
7ce503fd | 1068 | if (! NILP (rear)) |
550bd63a | 1069 | props = Fcons (Qrear_nonsticky, Fcons (Fnreverse (rear), props)); |
4ab19eb3 RS |
1070 | |
1071 | cat = textget (props, Qcategory); | |
1072 | if (! NILP (front) | |
1073 | && | |
1074 | /* If we have inherited a front-stick category property that is t, | |
1075 | we don't need to set up a detailed one. */ | |
1076 | ! (! NILP (cat) && SYMBOLP (cat) | |
1077 | && EQ (Fget (cat, Qfront_sticky), Qt))) | |
45d82bdc | 1078 | props = Fcons (Qfront_sticky, Fcons (Fnreverse (front), props)); |
7ce503fd | 1079 | return props; |
7ce503fd RS |
1080 | } |
1081 | ||
a50699fd | 1082 | \f |
90ba40fc JA |
1083 | /* Delete an node I from its interval tree by merging its subtrees |
1084 | into one subtree which is then returned. Caller is responsible for | |
7ce503fd | 1085 | storing the resulting subtree into its parent. */ |
a50699fd JA |
1086 | |
1087 | static INTERVAL | |
1088 | delete_node (i) | |
1089 | register INTERVAL i; | |
1090 | { | |
1091 | register INTERVAL migrate, this; | |
1092 | register int migrate_amt; | |
1093 | ||
1094 | if (NULL_INTERVAL_P (i->left)) | |
1095 | return i->right; | |
1096 | if (NULL_INTERVAL_P (i->right)) | |
1097 | return i->left; | |
1098 | ||
1099 | migrate = i->left; | |
1100 | migrate_amt = i->left->total_length; | |
1101 | this = i->right; | |
1102 | this->total_length += migrate_amt; | |
1103 | while (! NULL_INTERVAL_P (this->left)) | |
1104 | { | |
1105 | this = this->left; | |
1106 | this->total_length += migrate_amt; | |
1107 | } | |
1108 | this->left = migrate; | |
1109 | migrate->parent = this; | |
1110 | ||
1111 | return i->right; | |
1112 | } | |
1113 | ||
1114 | /* Delete interval I from its tree by calling `delete_node' | |
1115 | and properly connecting the resultant subtree. | |
1116 | ||
1117 | I is presumed to be empty; that is, no adjustments are made | |
7ce503fd | 1118 | for the length of I. */ |
a50699fd JA |
1119 | |
1120 | void | |
1121 | delete_interval (i) | |
1122 | register INTERVAL i; | |
1123 | { | |
1124 | register INTERVAL parent; | |
1125 | int amt = LENGTH (i); | |
1126 | ||
7ce503fd | 1127 | if (amt > 0) /* Only used on zero-length intervals now. */ |
a50699fd JA |
1128 | abort (); |
1129 | ||
1130 | if (ROOT_INTERVAL_P (i)) | |
1131 | { | |
dd675b05 KH |
1132 | Lisp_Object owner; |
1133 | owner = (Lisp_Object) i->parent; | |
a50699fd JA |
1134 | parent = delete_node (i); |
1135 | if (! NULL_INTERVAL_P (parent)) | |
1136 | parent->parent = (INTERVAL) owner; | |
1137 | ||
b629dd47 | 1138 | if (BUFFERP (owner)) |
e5d967c9 | 1139 | BUF_INTERVALS (XBUFFER (owner)) = parent; |
b629dd47 | 1140 | else if (STRINGP (owner)) |
a50699fd JA |
1141 | XSTRING (owner)->intervals = parent; |
1142 | else | |
1143 | abort (); | |
1144 | ||
1145 | return; | |
1146 | } | |
1147 | ||
1148 | parent = i->parent; | |
1149 | if (AM_LEFT_CHILD (i)) | |
1150 | { | |
1151 | parent->left = delete_node (i); | |
1152 | if (! NULL_INTERVAL_P (parent->left)) | |
1153 | parent->left->parent = parent; | |
1154 | } | |
1155 | else | |
1156 | { | |
1157 | parent->right = delete_node (i); | |
1158 | if (! NULL_INTERVAL_P (parent->right)) | |
1159 | parent->right->parent = parent; | |
1160 | } | |
1161 | } | |
1162 | \f | |
24e3d3bf JB |
1163 | /* Find the interval in TREE corresponding to the relative position |
1164 | FROM and delete as much as possible of AMOUNT from that interval. | |
1165 | Return the amount actually deleted, and if the interval was | |
1166 | zeroed-out, delete that interval node from the tree. | |
1167 | ||
1168 | Note that FROM is actually origin zero, aka relative to the | |
1169 | leftmost edge of tree. This is appropriate since we call ourselves | |
1170 | recursively on subtrees. | |
a50699fd | 1171 | |
1d1d7ba0 | 1172 | Do this by recursing down TREE to the interval in question, and |
7ce503fd | 1173 | deleting the appropriate amount of text. */ |
a50699fd JA |
1174 | |
1175 | static int | |
1176 | interval_deletion_adjustment (tree, from, amount) | |
1177 | register INTERVAL tree; | |
1178 | register int from, amount; | |
1179 | { | |
1180 | register int relative_position = from; | |
1181 | ||
1182 | if (NULL_INTERVAL_P (tree)) | |
1183 | return 0; | |
1184 | ||
1185 | /* Left branch */ | |
24e3d3bf | 1186 | if (relative_position < LEFT_TOTAL_LENGTH (tree)) |
a50699fd JA |
1187 | { |
1188 | int subtract = interval_deletion_adjustment (tree->left, | |
1189 | relative_position, | |
1190 | amount); | |
1191 | tree->total_length -= subtract; | |
1192 | return subtract; | |
1193 | } | |
1194 | /* Right branch */ | |
24e3d3bf JB |
1195 | else if (relative_position >= (TOTAL_LENGTH (tree) |
1196 | - RIGHT_TOTAL_LENGTH (tree))) | |
a50699fd JA |
1197 | { |
1198 | int subtract; | |
1199 | ||
1200 | relative_position -= (tree->total_length | |
1201 | - RIGHT_TOTAL_LENGTH (tree)); | |
1202 | subtract = interval_deletion_adjustment (tree->right, | |
1203 | relative_position, | |
1204 | amount); | |
1205 | tree->total_length -= subtract; | |
1206 | return subtract; | |
1207 | } | |
7ce503fd | 1208 | /* Here -- this node. */ |
a50699fd JA |
1209 | else |
1210 | { | |
24e3d3bf JB |
1211 | /* How much can we delete from this interval? */ |
1212 | int my_amount = ((tree->total_length | |
1213 | - RIGHT_TOTAL_LENGTH (tree)) | |
1214 | - relative_position); | |
1215 | ||
1216 | if (amount > my_amount) | |
1217 | amount = my_amount; | |
1218 | ||
1219 | tree->total_length -= amount; | |
1220 | if (LENGTH (tree) == 0) | |
1221 | delete_interval (tree); | |
1222 | ||
1223 | return amount; | |
a50699fd JA |
1224 | } |
1225 | ||
7ce503fd | 1226 | /* Never reach here. */ |
a50699fd JA |
1227 | } |
1228 | ||
24e3d3bf JB |
1229 | /* Effect the adjustments necessary to the interval tree of BUFFER to |
1230 | correspond to the deletion of LENGTH characters from that buffer | |
1231 | text. The deletion is effected at position START (which is a | |
7ce503fd | 1232 | buffer position, i.e. origin 1). */ |
1d1d7ba0 | 1233 | |
a50699fd JA |
1234 | static void |
1235 | adjust_intervals_for_deletion (buffer, start, length) | |
1236 | struct buffer *buffer; | |
1237 | int start, length; | |
1238 | { | |
1239 | register int left_to_delete = length; | |
e5d967c9 | 1240 | register INTERVAL tree = BUF_INTERVALS (buffer); |
a50699fd JA |
1241 | register int deleted; |
1242 | ||
1243 | if (NULL_INTERVAL_P (tree)) | |
1244 | return; | |
1245 | ||
24e3d3bf JB |
1246 | if (start > BEG + TOTAL_LENGTH (tree) |
1247 | || start + length > BEG + TOTAL_LENGTH (tree)) | |
1248 | abort (); | |
1249 | ||
a50699fd JA |
1250 | if (length == TOTAL_LENGTH (tree)) |
1251 | { | |
e5d967c9 | 1252 | BUF_INTERVALS (buffer) = NULL_INTERVAL; |
a50699fd JA |
1253 | return; |
1254 | } | |
1255 | ||
1256 | if (ONLY_INTERVAL_P (tree)) | |
1257 | { | |
1258 | tree->total_length -= length; | |
1259 | return; | |
1260 | } | |
1261 | ||
24e3d3bf JB |
1262 | if (start > BEG + TOTAL_LENGTH (tree)) |
1263 | start = BEG + TOTAL_LENGTH (tree); | |
a50699fd JA |
1264 | while (left_to_delete > 0) |
1265 | { | |
24e3d3bf | 1266 | left_to_delete -= interval_deletion_adjustment (tree, start - 1, |
a50699fd | 1267 | left_to_delete); |
e5d967c9 | 1268 | tree = BUF_INTERVALS (buffer); |
a50699fd JA |
1269 | if (left_to_delete == tree->total_length) |
1270 | { | |
e5d967c9 | 1271 | BUF_INTERVALS (buffer) = NULL_INTERVAL; |
a50699fd JA |
1272 | return; |
1273 | } | |
1274 | } | |
1275 | } | |
1276 | \f | |
eb8c3be9 | 1277 | /* Make the adjustments necessary to the interval tree of BUFFER to |
1d1d7ba0 JA |
1278 | represent an addition or deletion of LENGTH characters starting |
1279 | at position START. Addition or deletion is indicated by the sign | |
7ce503fd | 1280 | of LENGTH. */ |
a50699fd JA |
1281 | |
1282 | INLINE void | |
1283 | offset_intervals (buffer, start, length) | |
1284 | struct buffer *buffer; | |
1285 | int start, length; | |
1286 | { | |
e5d967c9 | 1287 | if (NULL_INTERVAL_P (BUF_INTERVALS (buffer)) || length == 0) |
a50699fd JA |
1288 | return; |
1289 | ||
1290 | if (length > 0) | |
e5d967c9 | 1291 | adjust_intervals_for_insertion (BUF_INTERVALS (buffer), start, length); |
a50699fd JA |
1292 | else |
1293 | adjust_intervals_for_deletion (buffer, start, -length); | |
1294 | } | |
9c79dd1b JA |
1295 | \f |
1296 | /* Merge interval I with its lexicographic successor. The resulting | |
1297 | interval is returned, and has the properties of the original | |
1298 | successor. The properties of I are lost. I is removed from the | |
1299 | interval tree. | |
1300 | ||
1301 | IMPORTANT: | |
1302 | The caller must verify that this is not the last (rightmost) | |
7ce503fd | 1303 | interval. */ |
9c79dd1b JA |
1304 | |
1305 | INTERVAL | |
1306 | merge_interval_right (i) | |
1307 | register INTERVAL i; | |
1308 | { | |
1309 | register int absorb = LENGTH (i); | |
1310 | register INTERVAL successor; | |
1311 | ||
7ce503fd | 1312 | /* Zero out this interval. */ |
9c79dd1b JA |
1313 | i->total_length -= absorb; |
1314 | ||
7ce503fd | 1315 | /* Find the succeeding interval. */ |
9c79dd1b | 1316 | if (! NULL_RIGHT_CHILD (i)) /* It's below us. Add absorb |
7ce503fd | 1317 | as we descend. */ |
9c79dd1b JA |
1318 | { |
1319 | successor = i->right; | |
1320 | while (! NULL_LEFT_CHILD (successor)) | |
1321 | { | |
1322 | successor->total_length += absorb; | |
1323 | successor = successor->left; | |
1324 | } | |
1325 | ||
1326 | successor->total_length += absorb; | |
1327 | delete_interval (i); | |
1328 | return successor; | |
1329 | } | |
1330 | ||
1331 | successor = i; | |
1332 | while (! NULL_PARENT (successor)) /* It's above us. Subtract as | |
7ce503fd | 1333 | we ascend. */ |
9c79dd1b JA |
1334 | { |
1335 | if (AM_LEFT_CHILD (successor)) | |
1336 | { | |
1337 | successor = successor->parent; | |
1338 | delete_interval (i); | |
1339 | return successor; | |
1340 | } | |
1341 | ||
1342 | successor = successor->parent; | |
1343 | successor->total_length -= absorb; | |
1344 | } | |
1345 | ||
1346 | /* This must be the rightmost or last interval and cannot | |
7ce503fd | 1347 | be merged right. The caller should have known. */ |
9c79dd1b JA |
1348 | abort (); |
1349 | } | |
1350 | \f | |
1351 | /* Merge interval I with its lexicographic predecessor. The resulting | |
1352 | interval is returned, and has the properties of the original predecessor. | |
1353 | The properties of I are lost. Interval node I is removed from the tree. | |
1354 | ||
1355 | IMPORTANT: | |
7ce503fd | 1356 | The caller must verify that this is not the first (leftmost) interval. */ |
9c79dd1b JA |
1357 | |
1358 | INTERVAL | |
1359 | merge_interval_left (i) | |
1360 | register INTERVAL i; | |
1361 | { | |
1362 | register int absorb = LENGTH (i); | |
1363 | register INTERVAL predecessor; | |
1364 | ||
7ce503fd | 1365 | /* Zero out this interval. */ |
9c79dd1b JA |
1366 | i->total_length -= absorb; |
1367 | ||
7ce503fd | 1368 | /* Find the preceding interval. */ |
9c79dd1b | 1369 | if (! NULL_LEFT_CHILD (i)) /* It's below us. Go down, |
7ce503fd | 1370 | adding ABSORB as we go. */ |
9c79dd1b JA |
1371 | { |
1372 | predecessor = i->left; | |
1373 | while (! NULL_RIGHT_CHILD (predecessor)) | |
1374 | { | |
1375 | predecessor->total_length += absorb; | |
1376 | predecessor = predecessor->right; | |
1377 | } | |
1378 | ||
1379 | predecessor->total_length += absorb; | |
1380 | delete_interval (i); | |
1381 | return predecessor; | |
1382 | } | |
1383 | ||
1384 | predecessor = i; | |
1385 | while (! NULL_PARENT (predecessor)) /* It's above us. Go up, | |
7ce503fd | 1386 | subtracting ABSORB. */ |
9c79dd1b JA |
1387 | { |
1388 | if (AM_RIGHT_CHILD (predecessor)) | |
1389 | { | |
1390 | predecessor = predecessor->parent; | |
1391 | delete_interval (i); | |
1392 | return predecessor; | |
1393 | } | |
1394 | ||
1395 | predecessor = predecessor->parent; | |
1396 | predecessor->total_length -= absorb; | |
1397 | } | |
a50699fd | 1398 | |
9c79dd1b | 1399 | /* This must be the leftmost or first interval and cannot |
7ce503fd | 1400 | be merged left. The caller should have known. */ |
9c79dd1b JA |
1401 | abort (); |
1402 | } | |
1403 | \f | |
1d1d7ba0 JA |
1404 | /* Make an exact copy of interval tree SOURCE which descends from |
1405 | PARENT. This is done by recursing through SOURCE, copying | |
1406 | the current interval and its properties, and then adjusting | |
7ce503fd | 1407 | the pointers of the copy. */ |
1d1d7ba0 | 1408 | |
a50699fd JA |
1409 | static INTERVAL |
1410 | reproduce_tree (source, parent) | |
1411 | INTERVAL source, parent; | |
1412 | { | |
1413 | register INTERVAL t = make_interval (); | |
1414 | ||
1415 | bcopy (source, t, INTERVAL_SIZE); | |
1416 | copy_properties (source, t); | |
1417 | t->parent = parent; | |
1418 | if (! NULL_LEFT_CHILD (source)) | |
1419 | t->left = reproduce_tree (source->left, t); | |
1420 | if (! NULL_RIGHT_CHILD (source)) | |
1421 | t->right = reproduce_tree (source->right, t); | |
1422 | ||
1423 | return t; | |
1424 | } | |
1425 | ||
24e3d3bf JB |
1426 | #if 0 |
1427 | /* Nobody calls this. Perhaps it's a vestige of an earlier design. */ | |
1428 | ||
1d1d7ba0 JA |
1429 | /* Make a new interval of length LENGTH starting at START in the |
1430 | group of intervals INTERVALS, which is actually an interval tree. | |
1431 | Returns the new interval. | |
1432 | ||
1433 | Generate an error if the new positions would overlap an existing | |
7ce503fd | 1434 | interval. */ |
1d1d7ba0 | 1435 | |
a50699fd JA |
1436 | static INTERVAL |
1437 | make_new_interval (intervals, start, length) | |
1438 | INTERVAL intervals; | |
1439 | int start, length; | |
1440 | { | |
1441 | INTERVAL slot; | |
1442 | ||
1443 | slot = find_interval (intervals, start); | |
1444 | if (start + length > slot->position + LENGTH (slot)) | |
1445 | error ("Interval would overlap"); | |
1446 | ||
1447 | if (start == slot->position && length == LENGTH (slot)) | |
1448 | return slot; | |
1449 | ||
1450 | if (slot->position == start) | |
1451 | { | |
7ce503fd | 1452 | /* New right node. */ |
2bc7a79b | 1453 | split_interval_right (slot, length); |
a50699fd JA |
1454 | return slot; |
1455 | } | |
1456 | ||
1457 | if (slot->position + LENGTH (slot) == start + length) | |
1458 | { | |
7ce503fd | 1459 | /* New left node. */ |
2bc7a79b | 1460 | split_interval_left (slot, LENGTH (slot) - length); |
a50699fd JA |
1461 | return slot; |
1462 | } | |
1463 | ||
7ce503fd | 1464 | /* Convert interval SLOT into three intervals. */ |
2bc7a79b JB |
1465 | split_interval_left (slot, start - slot->position); |
1466 | split_interval_right (slot, length); | |
a50699fd JA |
1467 | return slot; |
1468 | } | |
24e3d3bf | 1469 | #endif |
294efdbe | 1470 | \f |
9c79dd1b | 1471 | /* Insert the intervals of SOURCE into BUFFER at POSITION. |
0b79989f | 1472 | LENGTH is the length of the text in SOURCE. |
a50699fd | 1473 | |
2bc7a79b JB |
1474 | This is used in insdel.c when inserting Lisp_Strings into the |
1475 | buffer. The text corresponding to SOURCE is already in the buffer | |
1476 | when this is called. The intervals of new tree are a copy of those | |
1477 | belonging to the string being inserted; intervals are never | |
1478 | shared. | |
a50699fd | 1479 | |
0b79989f RS |
1480 | If the inserted text had no intervals associated, and we don't |
1481 | want to inherit the surrounding text's properties, this function | |
a50699fd | 1482 | simply returns -- offset_intervals should handle placing the |
90ba40fc | 1483 | text in the correct interval, depending on the sticky bits. |
a50699fd JA |
1484 | |
1485 | If the inserted text had properties (intervals), then there are two | |
1486 | cases -- either insertion happened in the middle of some interval, | |
1487 | or between two intervals. | |
1488 | ||
1489 | If the text goes into the middle of an interval, then new | |
1490 | intervals are created in the middle with only the properties of | |
1491 | the new text, *unless* the macro MERGE_INSERTIONS is true, in | |
1492 | which case the new text has the union of its properties and those | |
1493 | of the text into which it was inserted. | |
1494 | ||
1495 | If the text goes between two intervals, then if neither interval | |
90ba40fc JA |
1496 | had its appropriate sticky property set (front_sticky, rear_sticky), |
1497 | the new text has only its properties. If one of the sticky properties | |
a50699fd | 1498 | is set, then the new text "sticks" to that region and its properties |
eb8c3be9 | 1499 | depend on merging as above. If both the preceding and succeeding |
90ba40fc JA |
1500 | intervals to the new text are "sticky", then the new text retains |
1501 | only its properties, as if neither sticky property were set. Perhaps | |
a50699fd | 1502 | we should consider merging all three sets of properties onto the new |
7ce503fd | 1503 | text... */ |
a50699fd JA |
1504 | |
1505 | void | |
0b79989f | 1506 | graft_intervals_into_buffer (source, position, length, buffer, inherit) |
9c79dd1b | 1507 | INTERVAL source; |
0b79989f | 1508 | int position, length; |
9c79dd1b | 1509 | struct buffer *buffer; |
7ea69158 | 1510 | int inherit; |
a50699fd | 1511 | { |
323a7ad4 | 1512 | register INTERVAL under, over, this, prev; |
e5d967c9 | 1513 | register INTERVAL tree; |
323a7ad4 | 1514 | int middle; |
a50699fd | 1515 | |
e5d967c9 RS |
1516 | tree = BUF_INTERVALS (buffer); |
1517 | ||
a50699fd | 1518 | /* If the new text has no properties, it becomes part of whatever |
7ce503fd | 1519 | interval it was inserted into. */ |
9c79dd1b | 1520 | if (NULL_INTERVAL_P (source)) |
0b79989f RS |
1521 | { |
1522 | Lisp_Object buf; | |
08b05272 | 1523 | if (!inherit && ! NULL_INTERVAL_P (tree)) |
0b79989f | 1524 | { |
55cfc731 | 1525 | XSETBUFFER (buf, buffer); |
0b79989f RS |
1526 | Fset_text_properties (make_number (position), |
1527 | make_number (position + length), | |
1528 | Qnil, buf); | |
1529 | } | |
e5d967c9 RS |
1530 | if (! NULL_INTERVAL_P (BUF_INTERVALS (buffer))) |
1531 | BUF_INTERVALS (buffer) = balance_an_interval (BUF_INTERVALS (buffer)); | |
0b79989f RS |
1532 | return; |
1533 | } | |
a50699fd | 1534 | |
a50699fd JA |
1535 | if (NULL_INTERVAL_P (tree)) |
1536 | { | |
1537 | /* The inserted text constitutes the whole buffer, so | |
7ce503fd | 1538 | simply copy over the interval structure. */ |
2bc7a79b | 1539 | if ((BUF_Z (buffer) - BUF_BEG (buffer)) == TOTAL_LENGTH (source)) |
a50699fd | 1540 | { |
b8e4857c | 1541 | Lisp_Object buf; |
55cfc731 | 1542 | XSETBUFFER (buf, buffer); |
e5d967c9 | 1543 | BUF_INTERVALS (buffer) = reproduce_tree (source, buf); |
7ce503fd | 1544 | /* Explicitly free the old tree here. */ |
a50699fd JA |
1545 | |
1546 | return; | |
1547 | } | |
1548 | ||
1549 | /* Create an interval tree in which to place a copy | |
7ce503fd | 1550 | of the intervals of the inserted string. */ |
a50699fd | 1551 | { |
249a6da9 | 1552 | Lisp_Object buf; |
55cfc731 | 1553 | XSETBUFFER (buf, buffer); |
323a7ad4 | 1554 | tree = create_root_interval (buf); |
a50699fd JA |
1555 | } |
1556 | } | |
7ea69158 RS |
1557 | else if (TOTAL_LENGTH (tree) == TOTAL_LENGTH (source)) |
1558 | /* If the buffer contains only the new string, but | |
1559 | there was already some interval tree there, then it may be | |
1560 | some zero length intervals. Eventually, do something clever | |
1561 | about inserting properly. For now, just waste the old intervals. */ | |
1562 | { | |
e5d967c9 | 1563 | BUF_INTERVALS (buffer) = reproduce_tree (source, tree->parent); |
7ea69158 | 1564 | /* Explicitly free the old tree here. */ |
a50699fd | 1565 | |
7ea69158 RS |
1566 | return; |
1567 | } | |
1568 | /* Paranoia -- the text has already been added, so this buffer | |
1569 | should be of non-zero length. */ | |
1570 | else if (TOTAL_LENGTH (tree) == 0) | |
1571 | abort (); | |
a50699fd JA |
1572 | |
1573 | this = under = find_interval (tree, position); | |
1574 | if (NULL_INTERVAL_P (under)) /* Paranoia */ | |
1575 | abort (); | |
9c79dd1b | 1576 | over = find_interval (source, 1); |
a50699fd | 1577 | |
323a7ad4 RS |
1578 | /* Here for insertion in the middle of an interval. |
1579 | Split off an equivalent interval to the right, | |
1580 | then don't bother with it any more. */ | |
a50699fd | 1581 | |
323a7ad4 | 1582 | if (position > under->position) |
a50699fd JA |
1583 | { |
1584 | INTERVAL end_unchanged | |
2bc7a79b | 1585 | = split_interval_left (this, position - under->position); |
a50699fd | 1586 | copy_properties (under, end_unchanged); |
323a7ad4 RS |
1587 | under->position = position; |
1588 | prev = 0; | |
1589 | middle = 1; | |
a50699fd | 1590 | } |
323a7ad4 RS |
1591 | else |
1592 | { | |
1593 | prev = previous_interval (under); | |
7ce503fd | 1594 | if (prev && !END_NONSTICKY_P (prev)) |
323a7ad4 RS |
1595 | prev = 0; |
1596 | } | |
1597 | ||
1598 | /* Insertion is now at beginning of UNDER. */ | |
a50699fd | 1599 | |
323a7ad4 | 1600 | /* The inserted text "sticks" to the interval `under', |
7ce503fd RS |
1601 | which means it gets those properties. |
1602 | The properties of under are the result of | |
8e6208c5 | 1603 | adjust_intervals_for_insertion, so stickiness has |
7ce503fd RS |
1604 | already been taken care of. */ |
1605 | ||
a50699fd JA |
1606 | while (! NULL_INTERVAL_P (over)) |
1607 | { | |
767809fb | 1608 | if (LENGTH (over) < LENGTH (under)) |
7ce503fd RS |
1609 | { |
1610 | this = split_interval_left (under, LENGTH (over)); | |
1611 | copy_properties (under, this); | |
1612 | } | |
323a7ad4 RS |
1613 | else |
1614 | this = under; | |
a50699fd | 1615 | copy_properties (over, this); |
7ea69158 | 1616 | if (inherit) |
7ce503fd RS |
1617 | merge_properties (over, this); |
1618 | else | |
1619 | copy_properties (over, this); | |
a50699fd JA |
1620 | over = next_interval (over); |
1621 | } | |
1622 | ||
e5d967c9 RS |
1623 | if (! NULL_INTERVAL_P (BUF_INTERVALS (buffer))) |
1624 | BUF_INTERVALS (buffer) = balance_an_interval (BUF_INTERVALS (buffer)); | |
a50699fd JA |
1625 | return; |
1626 | } | |
1627 | ||
5cae0ec6 RS |
1628 | /* Get the value of property PROP from PLIST, |
1629 | which is the plist of an interval. | |
70743ff1 | 1630 | We check for direct properties, for categories with property PROP, |
06d92327 | 1631 | and for PROP appearing on the default-text-properties list. */ |
5cae0ec6 RS |
1632 | |
1633 | Lisp_Object | |
323a7ad4 RS |
1634 | textget (plist, prop) |
1635 | Lisp_Object plist; | |
1636 | register Lisp_Object prop; | |
1637 | { | |
5cae0ec6 RS |
1638 | register Lisp_Object tail, fallback; |
1639 | fallback = Qnil; | |
323a7ad4 RS |
1640 | |
1641 | for (tail = plist; !NILP (tail); tail = Fcdr (Fcdr (tail))) | |
1642 | { | |
1643 | register Lisp_Object tem; | |
1644 | tem = Fcar (tail); | |
1645 | if (EQ (prop, tem)) | |
1646 | return Fcar (Fcdr (tail)); | |
5cae0ec6 | 1647 | if (EQ (tem, Qcategory)) |
5dd6606e RS |
1648 | { |
1649 | tem = Fcar (Fcdr (tail)); | |
1650 | if (SYMBOLP (tem)) | |
1651 | fallback = Fget (tem, prop); | |
1652 | } | |
323a7ad4 | 1653 | } |
5cae0ec6 | 1654 | |
70743ff1 BG |
1655 | if (! NILP (fallback)) |
1656 | return fallback; | |
06d92327 BG |
1657 | if (CONSP (Vdefault_text_properties)) |
1658 | return Fplist_get (Vdefault_text_properties, prop); | |
70743ff1 | 1659 | return Qnil; |
323a7ad4 | 1660 | } |
7ce503fd | 1661 | |
294efdbe | 1662 | \f |
5cae0ec6 | 1663 | /* Set point in BUFFER to POSITION. If the target position is |
f65013b0 | 1664 | before an intangible character, move to an ok place. */ |
a50699fd JA |
1665 | |
1666 | void | |
1667 | set_point (position, buffer) | |
1668 | register int position; | |
1669 | register struct buffer *buffer; | |
1670 | { | |
323a7ad4 | 1671 | register INTERVAL to, from, toprev, fromprev, target; |
a50699fd JA |
1672 | int buffer_point; |
1673 | register Lisp_Object obj; | |
e5d967c9 | 1674 | int old_position = BUF_PT (buffer); |
580fae94 RS |
1675 | int backwards = (position < old_position ? 1 : 0); |
1676 | int have_overlays; | |
1677 | int original_position; | |
a50699fd | 1678 | |
b6a0ebc3 RS |
1679 | buffer->point_before_scroll = Qnil; |
1680 | ||
e5d967c9 | 1681 | if (position == BUF_PT (buffer)) |
a50699fd JA |
1682 | return; |
1683 | ||
62056764 JB |
1684 | /* Check this now, before checking if the buffer has any intervals. |
1685 | That way, we can catch conditions which break this sanity check | |
1686 | whether or not there are intervals in the buffer. */ | |
b827a9e3 | 1687 | if (position > BUF_ZV (buffer) || position < BUF_BEGV (buffer)) |
62056764 JB |
1688 | abort (); |
1689 | ||
580fae94 RS |
1690 | have_overlays = (! NILP (buffer->overlays_before) |
1691 | || ! NILP (buffer->overlays_after)); | |
1692 | ||
1693 | /* If we have no text properties and overlays, | |
1694 | then we can do it quickly. */ | |
1695 | if (NULL_INTERVAL_P (BUF_INTERVALS (buffer)) && ! have_overlays) | |
a50699fd | 1696 | { |
e5d967c9 | 1697 | BUF_PT (buffer) = position; |
a50699fd JA |
1698 | return; |
1699 | } | |
1700 | ||
323a7ad4 RS |
1701 | /* Set TO to the interval containing the char after POSITION, |
1702 | and TOPREV to the interval containing the char before POSITION. | |
1703 | Either one may be null. They may be equal. */ | |
e5d967c9 | 1704 | to = find_interval (BUF_INTERVALS (buffer), position); |
294efdbe RS |
1705 | if (position == BUF_BEGV (buffer)) |
1706 | toprev = 0; | |
580fae94 | 1707 | else if (to && to->position == position) |
323a7ad4 | 1708 | toprev = previous_interval (to); |
323a7ad4 RS |
1709 | else |
1710 | toprev = to; | |
1711 | ||
294efdbe RS |
1712 | buffer_point = (BUF_PT (buffer) == BUF_ZV (buffer) |
1713 | ? BUF_ZV (buffer) - 1 | |
323a7ad4 | 1714 | : BUF_PT (buffer)); |
9c79dd1b | 1715 | |
323a7ad4 RS |
1716 | /* Set FROM to the interval containing the char after PT, |
1717 | and FROMPREV to the interval containing the char before PT. | |
1718 | Either one may be null. They may be equal. */ | |
7ce503fd | 1719 | /* We could cache this and save time. */ |
e5d967c9 | 1720 | from = find_interval (BUF_INTERVALS (buffer), buffer_point); |
7ce503fd | 1721 | if (buffer_point == BUF_BEGV (buffer)) |
294efdbe | 1722 | fromprev = 0; |
580fae94 | 1723 | else if (from && from->position == BUF_PT (buffer)) |
323a7ad4 RS |
1724 | fromprev = previous_interval (from); |
1725 | else if (buffer_point != BUF_PT (buffer)) | |
1726 | fromprev = from, from = 0; | |
1727 | else | |
1728 | fromprev = from; | |
a50699fd | 1729 | |
7ce503fd | 1730 | /* Moving within an interval. */ |
580fae94 RS |
1731 | if (to == from && toprev == fromprev && INTERVAL_VISIBLE_P (to) |
1732 | && ! have_overlays) | |
a50699fd | 1733 | { |
e5d967c9 | 1734 | BUF_PT (buffer) = position; |
a50699fd JA |
1735 | return; |
1736 | } | |
1737 | ||
580fae94 RS |
1738 | original_position = position; |
1739 | ||
5eabb4e7 RS |
1740 | /* If the new position is between two intangible characters |
1741 | with the same intangible property value, | |
1742 | move forward or backward until a change in that property. */ | |
580fae94 RS |
1743 | if (NILP (Vinhibit_point_motion_hooks) |
1744 | && ((! NULL_INTERVAL_P (to) && ! NULL_INTERVAL_P (toprev)) | |
b827a9e3 RS |
1745 | || have_overlays) |
1746 | /* Intangibility never stops us from positioning at the beginning | |
1747 | or end of the buffer, so don't bother checking in that case. */ | |
1748 | && position != BEGV && position != ZV) | |
a50699fd | 1749 | { |
580fae94 RS |
1750 | Lisp_Object intangible_propval; |
1751 | Lisp_Object pos; | |
1752 | ||
1753 | XSETINT (pos, position); | |
1754 | ||
d5219de5 RS |
1755 | if (backwards) |
1756 | { | |
580fae94 RS |
1757 | intangible_propval = Fget_char_property (make_number (position), |
1758 | Qintangible, Qnil); | |
5eabb4e7 RS |
1759 | |
1760 | /* If following char is intangible, | |
1761 | skip back over all chars with matching intangible property. */ | |
1762 | if (! NILP (intangible_propval)) | |
580fae94 RS |
1763 | while (XINT (pos) > BUF_BEGV (buffer) |
1764 | && EQ (Fget_char_property (make_number (XINT (pos) - 1), | |
1765 | Qintangible, Qnil), | |
1766 | intangible_propval)) | |
1767 | pos = Fprevious_char_property_change (pos, Qnil); | |
d5219de5 | 1768 | } |
0df8950e | 1769 | else |
d5219de5 | 1770 | { |
580fae94 RS |
1771 | intangible_propval = Fget_char_property (make_number (position - 1), |
1772 | Qintangible, Qnil); | |
5eabb4e7 | 1773 | |
580fae94 RS |
1774 | /* If following char is intangible, |
1775 | skip back over all chars with matching intangible property. */ | |
5eabb4e7 | 1776 | if (! NILP (intangible_propval)) |
580fae94 RS |
1777 | while (XINT (pos) < BUF_ZV (buffer) |
1778 | && EQ (Fget_char_property (pos, Qintangible, Qnil), | |
1779 | intangible_propval)) | |
1780 | pos = Fnext_char_property_change (pos, Qnil); | |
1781 | ||
d5219de5 | 1782 | } |
580fae94 RS |
1783 | |
1784 | position = XINT (pos); | |
1785 | } | |
1786 | ||
1787 | if (position != original_position) | |
1788 | { | |
1789 | /* Set TO to the interval containing the char after POSITION, | |
1790 | and TOPREV to the interval containing the char before POSITION. | |
1791 | Either one may be null. They may be equal. */ | |
1792 | to = find_interval (BUF_INTERVALS (buffer), position); | |
1793 | if (position == BUF_BEGV (buffer)) | |
1794 | toprev = 0; | |
1795 | else if (to && to->position == position) | |
1796 | toprev = previous_interval (to); | |
1797 | else | |
1798 | toprev = to; | |
a50699fd | 1799 | } |
323a7ad4 | 1800 | |
5eabb4e7 RS |
1801 | /* Here TO is the interval after the stopping point |
1802 | and TOPREV is the interval before the stopping point. | |
1803 | One or the other may be null. */ | |
1804 | ||
e5d967c9 | 1805 | BUF_PT (buffer) = position; |
a50699fd | 1806 | |
d7e3e52b JA |
1807 | /* We run point-left and point-entered hooks here, iff the |
1808 | two intervals are not equivalent. These hooks take | |
323a7ad4 | 1809 | (old_point, new_point) as arguments. */ |
ddd931ff RS |
1810 | if (NILP (Vinhibit_point_motion_hooks) |
1811 | && (! intervals_equal (from, to) | |
1812 | || ! intervals_equal (fromprev, toprev))) | |
9c79dd1b | 1813 | { |
323a7ad4 RS |
1814 | Lisp_Object leave_after, leave_before, enter_after, enter_before; |
1815 | ||
1816 | if (fromprev) | |
1817 | leave_after = textget (fromprev->plist, Qpoint_left); | |
1818 | else | |
1819 | leave_after = Qnil; | |
1820 | if (from) | |
1821 | leave_before = textget (from->plist, Qpoint_left); | |
1822 | else | |
1823 | leave_before = Qnil; | |
1824 | ||
1825 | if (toprev) | |
1826 | enter_after = textget (toprev->plist, Qpoint_entered); | |
1827 | else | |
1828 | enter_after = Qnil; | |
1829 | if (to) | |
1830 | enter_before = textget (to->plist, Qpoint_entered); | |
1831 | else | |
1832 | enter_before = Qnil; | |
9c79dd1b | 1833 | |
323a7ad4 RS |
1834 | if (! EQ (leave_before, enter_before) && !NILP (leave_before)) |
1835 | call2 (leave_before, old_position, position); | |
1836 | if (! EQ (leave_after, enter_after) && !NILP (leave_after)) | |
1837 | call2 (leave_after, old_position, position); | |
9c79dd1b | 1838 | |
323a7ad4 RS |
1839 | if (! EQ (enter_before, leave_before) && !NILP (enter_before)) |
1840 | call2 (enter_before, old_position, position); | |
1841 | if (! EQ (enter_after, leave_after) && !NILP (enter_after)) | |
1842 | call2 (enter_after, old_position, position); | |
9c79dd1b | 1843 | } |
a50699fd JA |
1844 | } |
1845 | ||
7ce503fd | 1846 | /* Set point temporarily, without checking any text properties. */ |
a50699fd | 1847 | |
9c79dd1b JA |
1848 | INLINE void |
1849 | temp_set_point (position, buffer) | |
1850 | int position; | |
1851 | struct buffer *buffer; | |
1852 | { | |
e5d967c9 | 1853 | BUF_PT (buffer) = position; |
9c79dd1b | 1854 | } |
294efdbe | 1855 | \f |
a7fa233f RS |
1856 | /* Move point to POSITION, unless POSITION is inside an intangible |
1857 | segment that reaches all the way to point. */ | |
1858 | ||
1859 | void | |
1860 | move_if_not_intangible (position) | |
1861 | int position; | |
1862 | { | |
1863 | Lisp_Object pos; | |
1864 | Lisp_Object intangible_propval; | |
1865 | ||
1866 | XSETINT (pos, position); | |
1867 | ||
1868 | if (! NILP (Vinhibit_point_motion_hooks)) | |
1869 | /* If intangible is inhibited, always move point to POSITION. */ | |
1870 | ; | |
5509c7ff | 1871 | else if (PT < position && pos < ZV) |
a7fa233f RS |
1872 | { |
1873 | /* We want to move forward, so check the text before POSITION. */ | |
1874 | ||
1875 | intangible_propval = Fget_char_property (pos, | |
1876 | Qintangible, Qnil); | |
1877 | ||
1878 | /* If following char is intangible, | |
1879 | skip back over all chars with matching intangible property. */ | |
1880 | if (! NILP (intangible_propval)) | |
1881 | while (XINT (pos) > BEGV | |
1882 | && EQ (Fget_char_property (make_number (XINT (pos) - 1), | |
1883 | Qintangible, Qnil), | |
1884 | intangible_propval)) | |
1885 | pos = Fprevious_char_property_change (pos, Qnil); | |
1886 | } | |
5509c7ff | 1887 | else if (pos > BEGV) |
a7fa233f RS |
1888 | { |
1889 | /* We want to move backward, so check the text after POSITION. */ | |
1890 | ||
1891 | intangible_propval = Fget_char_property (make_number (XINT (pos) - 1), | |
1892 | Qintangible, Qnil); | |
1893 | ||
1894 | /* If following char is intangible, | |
1895 | skip back over all chars with matching intangible property. */ | |
1896 | if (! NILP (intangible_propval)) | |
1897 | while (XINT (pos) < ZV | |
1898 | && EQ (Fget_char_property (pos, Qintangible, Qnil), | |
1899 | intangible_propval)) | |
1900 | pos = Fnext_char_property_change (pos, Qnil); | |
1901 | ||
1902 | } | |
1903 | ||
1904 | /* If the whole stretch between PT and POSITION isn't intangible, | |
1905 | try moving to POSITION (which means we actually move farther | |
1906 | if POSITION is inside of intangible text). */ | |
1907 | ||
1908 | if (XINT (pos) != PT) | |
1909 | SET_PT (position); | |
1910 | } | |
1911 | \f | |
5cae0ec6 RS |
1912 | /* Return the proper local map for position POSITION in BUFFER. |
1913 | Use the map specified by the local-map property, if any. | |
1914 | Otherwise, use BUFFER's local map. */ | |
1915 | ||
1916 | Lisp_Object | |
1917 | get_local_map (position, buffer) | |
1918 | register int position; | |
1919 | register struct buffer *buffer; | |
1920 | { | |
0f7a5fda KH |
1921 | Lisp_Object prop, tem, lispy_position, lispy_buffer; |
1922 | int old_begv, old_zv; | |
5cae0ec6 | 1923 | |
7ce503fd | 1924 | /* Perhaps we should just change `position' to the limit. */ |
5cae0ec6 RS |
1925 | if (position > BUF_Z (buffer) || position < BUF_BEG (buffer)) |
1926 | abort (); | |
1927 | ||
0f7a5fda KH |
1928 | /* Ignore narrowing, so that a local map continues to be valid even if |
1929 | the visible region contains no characters and hence no properties. */ | |
1930 | old_begv = BUF_BEGV (buffer); | |
1931 | old_zv = BUF_ZV (buffer); | |
1932 | BUF_BEGV (buffer) = BUF_BEG (buffer); | |
1933 | BUF_ZV (buffer) = BUF_Z (buffer); | |
1934 | ||
1935 | /* There are no properties at the end of the buffer, so in that case | |
1936 | check for a local map on the last character of the buffer instead. */ | |
1937 | if (position == BUF_Z (buffer) && BUF_Z (buffer) > BUF_BEG (buffer)) | |
1938 | --position; | |
1939 | XSETFASTINT (lispy_position, position); | |
1940 | XSETBUFFER (lispy_buffer, buffer); | |
1941 | prop = Fget_char_property (lispy_position, Qlocal_map, lispy_buffer); | |
1942 | ||
1943 | BUF_BEGV (buffer) = old_begv; | |
1944 | BUF_ZV (buffer) = old_zv; | |
5cae0ec6 RS |
1945 | |
1946 | /* Use the local map only if it is valid. */ | |
4a9f44cd RS |
1947 | /* Do allow symbols that are defined as keymaps. */ |
1948 | if (SYMBOLP (prop) && !NILP (prop)) | |
1949 | prop = Findirect_function (prop); | |
0f7a5fda KH |
1950 | if (!NILP (prop) |
1951 | && (tem = Fkeymapp (prop), !NILP (tem))) | |
5cae0ec6 RS |
1952 | return prop; |
1953 | ||
e5d967c9 | 1954 | return buffer->keymap; |
5cae0ec6 RS |
1955 | } |
1956 | \f | |
9c79dd1b | 1957 | /* Produce an interval tree reflecting the intervals in |
7ce503fd | 1958 | TREE from START to START + LENGTH. */ |
a50699fd | 1959 | |
7b1d5b85 | 1960 | INTERVAL |
a50699fd JA |
1961 | copy_intervals (tree, start, length) |
1962 | INTERVAL tree; | |
1963 | int start, length; | |
1964 | { | |
1965 | register INTERVAL i, new, t; | |
95e3e1ef | 1966 | register int got, prevlen; |
a50699fd JA |
1967 | |
1968 | if (NULL_INTERVAL_P (tree) || length <= 0) | |
1969 | return NULL_INTERVAL; | |
1970 | ||
1971 | i = find_interval (tree, start); | |
1972 | if (NULL_INTERVAL_P (i) || LENGTH (i) == 0) | |
1973 | abort (); | |
1974 | ||
7ce503fd | 1975 | /* If there is only one interval and it's the default, return nil. */ |
a50699fd JA |
1976 | if ((start - i->position + 1 + length) < LENGTH (i) |
1977 | && DEFAULT_INTERVAL_P (i)) | |
1978 | return NULL_INTERVAL; | |
1979 | ||
1980 | new = make_interval (); | |
1981 | new->position = 1; | |
1982 | got = (LENGTH (i) - (start - i->position)); | |
9c79dd1b | 1983 | new->total_length = length; |
a50699fd JA |
1984 | copy_properties (i, new); |
1985 | ||
1986 | t = new; | |
95e3e1ef | 1987 | prevlen = got; |
a50699fd JA |
1988 | while (got < length) |
1989 | { | |
1990 | i = next_interval (i); | |
2bc7a79b | 1991 | t = split_interval_right (t, prevlen); |
a50699fd | 1992 | copy_properties (i, t); |
95e3e1ef RS |
1993 | prevlen = LENGTH (i); |
1994 | got += prevlen; | |
a50699fd JA |
1995 | } |
1996 | ||
4314dea4 | 1997 | return balance_an_interval (new); |
a50699fd JA |
1998 | } |
1999 | ||
7ce503fd | 2000 | /* Give STRING the properties of BUFFER from POSITION to LENGTH. */ |
a50699fd | 2001 | |
d7e3e52b | 2002 | INLINE void |
a50699fd | 2003 | copy_intervals_to_string (string, buffer, position, length) |
46d8a55b RS |
2004 | Lisp_Object string; |
2005 | struct buffer *buffer; | |
a50699fd JA |
2006 | int position, length; |
2007 | { | |
46d8a55b | 2008 | INTERVAL interval_copy = copy_intervals (BUF_INTERVALS (buffer), |
a50699fd JA |
2009 | position, length); |
2010 | if (NULL_INTERVAL_P (interval_copy)) | |
2011 | return; | |
2012 | ||
2013 | interval_copy->parent = (INTERVAL) string; | |
2014 | XSTRING (string)->intervals = interval_copy; | |
2015 | } | |
d8638d30 RS |
2016 | \f |
2017 | /* Return 1 if string S1 and S2 have identical properties; 0 otherwise. | |
2018 | Assume they have identical characters. */ | |
2019 | ||
2020 | int | |
2021 | compare_string_intervals (s1, s2) | |
2022 | Lisp_Object s1, s2; | |
2023 | { | |
2024 | INTERVAL i1, i2; | |
2025 | int pos = 1; | |
2026 | int end = XSTRING (s1)->size + 1; | |
2027 | ||
2028 | /* We specify 1 as position because the interval functions | |
2029 | always use positions starting at 1. */ | |
2030 | i1 = find_interval (XSTRING (s1)->intervals, 1); | |
2031 | i2 = find_interval (XSTRING (s2)->intervals, 1); | |
2032 | ||
2033 | while (pos < end) | |
2034 | { | |
2035 | /* Determine how far we can go before we reach the end of I1 or I2. */ | |
2036 | int len1 = (i1 != 0 ? INTERVAL_LAST_POS (i1) : end) - pos; | |
2037 | int len2 = (i2 != 0 ? INTERVAL_LAST_POS (i2) : end) - pos; | |
2038 | int distance = min (len1, len2); | |
2039 | ||
2040 | /* If we ever find a mismatch between the strings, | |
2041 | they differ. */ | |
2042 | if (! intervals_equal (i1, i2)) | |
2043 | return 0; | |
2044 | ||
2045 | /* Advance POS till the end of the shorter interval, | |
2046 | and advance one or both interval pointers for the new position. */ | |
2047 | pos += distance; | |
2048 | if (len1 == distance) | |
2049 | i1 = next_interval (i1); | |
2050 | if (len2 == distance) | |
2051 | i2 = next_interval (i2); | |
2052 | } | |
2053 | return 1; | |
2054 | } | |
d2f7a802 JA |
2055 | |
2056 | #endif /* USE_TEXT_PROPERTIES */ |