Commit | Line | Data |
---|---|---|
a50699fd | 1 | /* Code for doing intervals. |
f0dcf801 | 2 | Copyright (C) 1993, 1994, 1995, 1997, 1998, 2002 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" |
8feddab4 | 48 | #include "keymap.h" |
a50699fd | 49 | |
45d82bdc KH |
50 | /* Test for membership, allowing for t (actually any non-cons) to mean the |
51 | universal set. */ | |
52 | ||
53 | #define TMEM(sym, set) (CONSP (set) ? ! NILP (Fmemq (sym, set)) : ! NILP (set)) | |
54 | ||
b5f37d3f | 55 | Lisp_Object merge_properties_sticky (); |
439d5cb4 KR |
56 | static INTERVAL reproduce_tree P_ ((INTERVAL, INTERVAL)); |
57 | static INTERVAL reproduce_tree_obj P_ ((INTERVAL, Lisp_Object)); | |
a50699fd | 58 | \f |
7ce503fd | 59 | /* Utility functions for intervals. */ |
a50699fd JA |
60 | |
61 | ||
7ce503fd | 62 | /* Create the root interval of some object, a buffer or string. */ |
a50699fd JA |
63 | |
64 | INTERVAL | |
65 | create_root_interval (parent) | |
66 | Lisp_Object parent; | |
67 | { | |
328c0f1f RS |
68 | INTERVAL new; |
69 | ||
70 | CHECK_IMPURE (parent); | |
71 | ||
72 | new = make_interval (); | |
a50699fd | 73 | |
b629dd47 | 74 | if (BUFFERP (parent)) |
a50699fd | 75 | { |
2bc7a79b JB |
76 | new->total_length = (BUF_Z (XBUFFER (parent)) |
77 | - BUF_BEG (XBUFFER (parent))); | |
e5d967c9 | 78 | BUF_INTERVALS (XBUFFER (parent)) = new; |
944d4e4b | 79 | new->position = 1; |
a50699fd | 80 | } |
b629dd47 | 81 | else if (STRINGP (parent)) |
a50699fd | 82 | { |
d5db4077 | 83 | new->total_length = SCHARS (parent); |
b13738b6 | 84 | STRING_SET_INTERVALS (parent, new); |
944d4e4b | 85 | new->position = 0; |
a50699fd JA |
86 | } |
87 | ||
439d5cb4 | 88 | SET_INTERVAL_OBJECT (new, parent); |
a50699fd JA |
89 | |
90 | return new; | |
91 | } | |
92 | ||
93 | /* Make the interval TARGET have exactly the properties of SOURCE */ | |
94 | ||
95 | void | |
96 | copy_properties (source, target) | |
97 | register INTERVAL source, target; | |
98 | { | |
99 | if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target)) | |
100 | return; | |
101 | ||
102 | COPY_INTERVAL_CACHE (source, target); | |
103 | target->plist = Fcopy_sequence (source->plist); | |
104 | } | |
105 | ||
106 | /* Merge the properties of interval SOURCE into the properties | |
323a7ad4 RS |
107 | of interval TARGET. That is to say, each property in SOURCE |
108 | is added to TARGET if TARGET has no such property as yet. */ | |
a50699fd JA |
109 | |
110 | static void | |
111 | merge_properties (source, target) | |
112 | register INTERVAL source, target; | |
113 | { | |
114 | register Lisp_Object o, sym, val; | |
115 | ||
116 | if (DEFAULT_INTERVAL_P (source) && DEFAULT_INTERVAL_P (target)) | |
117 | return; | |
118 | ||
119 | MERGE_INTERVAL_CACHE (source, target); | |
120 | ||
121 | o = source->plist; | |
122 | while (! EQ (o, Qnil)) | |
123 | { | |
124 | sym = Fcar (o); | |
125 | val = Fmemq (sym, target->plist); | |
126 | ||
127 | if (NILP (val)) | |
128 | { | |
129 | o = Fcdr (o); | |
130 | val = Fcar (o); | |
131 | target->plist = Fcons (sym, Fcons (val, target->plist)); | |
132 | o = Fcdr (o); | |
133 | } | |
134 | else | |
135 | o = Fcdr (Fcdr (o)); | |
136 | } | |
137 | } | |
138 | ||
139 | /* Return 1 if the two intervals have the same properties, | |
7ce503fd | 140 | 0 otherwise. */ |
a50699fd JA |
141 | |
142 | int | |
143 | intervals_equal (i0, i1) | |
144 | INTERVAL i0, i1; | |
145 | { | |
146 | register Lisp_Object i0_cdr, i0_sym, i1_val; | |
dfcf069d | 147 | register int i1_len; |
a50699fd JA |
148 | |
149 | if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1)) | |
150 | return 1; | |
151 | ||
323a7ad4 RS |
152 | if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1)) |
153 | return 0; | |
154 | ||
a50699fd JA |
155 | i1_len = XFASTINT (Flength (i1->plist)); |
156 | if (i1_len & 0x1) /* Paranoia -- plists are always even */ | |
157 | abort (); | |
158 | i1_len /= 2; | |
159 | i0_cdr = i0->plist; | |
160 | while (!NILP (i0_cdr)) | |
161 | { | |
7ce503fd | 162 | /* Lengths of the two plists were unequal. */ |
a50699fd JA |
163 | if (i1_len == 0) |
164 | return 0; | |
165 | ||
166 | i0_sym = Fcar (i0_cdr); | |
167 | i1_val = Fmemq (i0_sym, i1->plist); | |
168 | ||
7ce503fd | 169 | /* i0 has something i1 doesn't. */ |
a50699fd JA |
170 | if (EQ (i1_val, Qnil)) |
171 | return 0; | |
172 | ||
7ce503fd | 173 | /* i0 and i1 both have sym, but it has different values in each. */ |
a50699fd | 174 | i0_cdr = Fcdr (i0_cdr); |
7ce503fd | 175 | if (! EQ (Fcar (Fcdr (i1_val)), Fcar (i0_cdr))) |
a50699fd JA |
176 | return 0; |
177 | ||
178 | i0_cdr = Fcdr (i0_cdr); | |
179 | i1_len--; | |
180 | } | |
181 | ||
7ce503fd | 182 | /* Lengths of the two plists were unequal. */ |
a50699fd JA |
183 | if (i1_len > 0) |
184 | return 0; | |
185 | ||
186 | return 1; | |
187 | } | |
188 | \f | |
a50699fd | 189 | |
19d4e9a7 SM |
190 | /* Traverse an interval tree TREE, performing FUNCTION on each node. |
191 | No guarantee is made about the order of traversal. | |
192 | Pass FUNCTION two args: an interval, and ARG. */ | |
193 | ||
194 | void | |
195 | traverse_intervals_noorder (tree, function, arg) | |
196 | INTERVAL tree; | |
197 | void (* function) P_ ((INTERVAL, Lisp_Object)); | |
198 | Lisp_Object arg; | |
199 | { | |
200 | /* Minimize stack usage. */ | |
201 | while (!NULL_INTERVAL_P (tree)) | |
202 | { | |
203 | (*function) (tree, arg); | |
204 | if (NULL_INTERVAL_P (tree->right)) | |
205 | tree = tree->left; | |
206 | else | |
207 | { | |
208 | traverse_intervals_noorder (tree->left, function, arg); | |
209 | tree = tree->right; | |
210 | } | |
211 | } | |
212 | } | |
213 | ||
a50699fd | 214 | /* Traverse an interval tree TREE, performing FUNCTION on each node. |
4a93c905 | 215 | Pass FUNCTION two args: an interval, and ARG. */ |
a50699fd JA |
216 | |
217 | void | |
42005513 | 218 | traverse_intervals (tree, position, function, arg) |
a50699fd | 219 | INTERVAL tree; |
42005513 | 220 | int position; |
0c60dfd7 | 221 | void (* function) P_ ((INTERVAL, Lisp_Object)); |
4a93c905 | 222 | Lisp_Object arg; |
a50699fd | 223 | { |
19d4e9a7 SM |
224 | while (!NULL_INTERVAL_P (tree)) |
225 | { | |
42005513 | 226 | traverse_intervals (tree->left, position, function, arg); |
19d4e9a7 SM |
227 | position += LEFT_TOTAL_LENGTH (tree); |
228 | tree->position = position; | |
229 | (*function) (tree, arg); | |
42005513 | 230 | position += LENGTH (tree); tree = tree->right; |
19d4e9a7 | 231 | } |
a50699fd JA |
232 | } |
233 | \f | |
234 | #if 0 | |
e39adcda GM |
235 | |
236 | static int icount; | |
237 | static int idepth; | |
238 | static int zero_length; | |
239 | ||
7ce503fd | 240 | /* These functions are temporary, for debugging purposes only. */ |
a50699fd JA |
241 | |
242 | INTERVAL search_interval, found_interval; | |
243 | ||
244 | void | |
245 | check_for_interval (i) | |
246 | register INTERVAL i; | |
247 | { | |
248 | if (i == search_interval) | |
249 | { | |
250 | found_interval = i; | |
251 | icount++; | |
252 | } | |
253 | } | |
254 | ||
255 | INTERVAL | |
256 | search_for_interval (i, tree) | |
257 | register INTERVAL i, tree; | |
258 | { | |
259 | icount = 0; | |
260 | search_interval = i; | |
261 | found_interval = NULL_INTERVAL; | |
19d4e9a7 | 262 | traverse_intervals_noorder (tree, &check_for_interval, Qnil); |
a50699fd JA |
263 | return found_interval; |
264 | } | |
265 | ||
266 | static void | |
267 | inc_interval_count (i) | |
268 | INTERVAL i; | |
269 | { | |
270 | icount++; | |
271 | if (LENGTH (i) == 0) | |
272 | zero_length++; | |
273 | if (depth > idepth) | |
274 | idepth = depth; | |
275 | } | |
276 | ||
277 | int | |
278 | count_intervals (i) | |
279 | register INTERVAL i; | |
280 | { | |
281 | icount = 0; | |
282 | idepth = 0; | |
283 | zero_length = 0; | |
19d4e9a7 | 284 | traverse_intervals_noorder (i, &inc_interval_count, Qnil); |
a50699fd JA |
285 | |
286 | return icount; | |
287 | } | |
288 | ||
289 | static INTERVAL | |
290 | root_interval (interval) | |
291 | INTERVAL interval; | |
292 | { | |
293 | register INTERVAL i = interval; | |
294 | ||
295 | while (! ROOT_INTERVAL_P (i)) | |
439d5cb4 | 296 | i = INTERVAL_PARENT (i); |
a50699fd JA |
297 | |
298 | return i; | |
299 | } | |
300 | #endif | |
301 | \f | |
302 | /* Assuming that a left child exists, perform the following operation: | |
303 | ||
304 | A B | |
305 | / \ / \ | |
306 | B => A | |
307 | / \ / \ | |
308 | c c | |
309 | */ | |
310 | ||
19d4e9a7 | 311 | static INLINE INTERVAL |
a50699fd JA |
312 | rotate_right (interval) |
313 | INTERVAL interval; | |
314 | { | |
315 | INTERVAL i; | |
316 | INTERVAL B = interval->left; | |
4314dea4 | 317 | int old_total = interval->total_length; |
a50699fd | 318 | |
7ce503fd | 319 | /* Deal with any Parent of A; make it point to B. */ |
a50699fd | 320 | if (! ROOT_INTERVAL_P (interval)) |
e39adcda GM |
321 | { |
322 | if (AM_LEFT_CHILD (interval)) | |
439d5cb4 | 323 | INTERVAL_PARENT (interval)->left = B; |
e39adcda | 324 | else |
439d5cb4 | 325 | INTERVAL_PARENT (interval)->right = B; |
e39adcda | 326 | } |
439d5cb4 | 327 | COPY_INTERVAL_PARENT (B, interval); |
a50699fd | 328 | |
4314dea4 RS |
329 | /* Make B the parent of A */ |
330 | i = B->right; | |
331 | B->right = interval; | |
439d5cb4 | 332 | SET_INTERVAL_PARENT (interval, B); |
a50699fd | 333 | |
4314dea4 | 334 | /* Make A point to c */ |
a50699fd JA |
335 | interval->left = i; |
336 | if (! NULL_INTERVAL_P (i)) | |
439d5cb4 | 337 | SET_INTERVAL_PARENT (i, interval); |
4314dea4 | 338 | |
550bd63a | 339 | /* A's total length is decreased by the length of B and its left child. */ |
4314dea4 RS |
340 | interval->total_length -= B->total_length - LEFT_TOTAL_LENGTH (interval); |
341 | ||
342 | /* B must have the same total length of A. */ | |
343 | B->total_length = old_total; | |
a50699fd JA |
344 | |
345 | return B; | |
346 | } | |
4314dea4 | 347 | |
a50699fd JA |
348 | /* Assuming that a right child exists, perform the following operation: |
349 | ||
7d0393cf JB |
350 | A B |
351 | / \ / \ | |
a50699fd | 352 | B => A |
7d0393cf | 353 | / \ / \ |
a50699fd JA |
354 | c c |
355 | */ | |
356 | ||
19d4e9a7 | 357 | static INLINE INTERVAL |
a50699fd JA |
358 | rotate_left (interval) |
359 | INTERVAL interval; | |
360 | { | |
361 | INTERVAL i; | |
362 | INTERVAL B = interval->right; | |
4314dea4 | 363 | int old_total = interval->total_length; |
a50699fd | 364 | |
4314dea4 | 365 | /* Deal with any parent of A; make it point to B. */ |
a50699fd | 366 | if (! ROOT_INTERVAL_P (interval)) |
e39adcda GM |
367 | { |
368 | if (AM_LEFT_CHILD (interval)) | |
439d5cb4 | 369 | INTERVAL_PARENT (interval)->left = B; |
e39adcda | 370 | else |
439d5cb4 | 371 | INTERVAL_PARENT (interval)->right = B; |
e39adcda | 372 | } |
439d5cb4 | 373 | COPY_INTERVAL_PARENT (B, interval); |
a50699fd JA |
374 | |
375 | /* Make B the parent of A */ | |
4314dea4 RS |
376 | i = B->left; |
377 | B->left = interval; | |
439d5cb4 | 378 | SET_INTERVAL_PARENT (interval, B); |
a50699fd JA |
379 | |
380 | /* Make A point to c */ | |
381 | interval->right = i; | |
382 | if (! NULL_INTERVAL_P (i)) | |
439d5cb4 | 383 | SET_INTERVAL_PARENT (i, interval); |
4314dea4 | 384 | |
550bd63a | 385 | /* A's total length is decreased by the length of B and its right child. */ |
4314dea4 RS |
386 | interval->total_length -= B->total_length - RIGHT_TOTAL_LENGTH (interval); |
387 | ||
388 | /* B must have the same total length of A. */ | |
389 | B->total_length = old_total; | |
a50699fd JA |
390 | |
391 | return B; | |
392 | } | |
393 | \f | |
4314dea4 RS |
394 | /* Balance an interval tree with the assumption that the subtrees |
395 | themselves are already balanced. */ | |
396 | ||
397 | static INTERVAL | |
398 | balance_an_interval (i) | |
399 | INTERVAL i; | |
400 | { | |
401 | register int old_diff, new_diff; | |
402 | ||
403 | while (1) | |
404 | { | |
405 | old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i); | |
406 | if (old_diff > 0) | |
407 | { | |
408 | new_diff = i->total_length - i->left->total_length | |
409 | + RIGHT_TOTAL_LENGTH (i->left) - LEFT_TOTAL_LENGTH (i->left); | |
410 | if (abs (new_diff) >= old_diff) | |
411 | break; | |
412 | i = rotate_right (i); | |
413 | balance_an_interval (i->right); | |
414 | } | |
415 | else if (old_diff < 0) | |
416 | { | |
417 | new_diff = i->total_length - i->right->total_length | |
418 | + LEFT_TOTAL_LENGTH (i->right) - RIGHT_TOTAL_LENGTH (i->right); | |
419 | if (abs (new_diff) >= -old_diff) | |
420 | break; | |
421 | i = rotate_left (i); | |
422 | balance_an_interval (i->left); | |
423 | } | |
424 | else | |
425 | break; | |
426 | } | |
427 | return i; | |
428 | } | |
429 | ||
430 | /* Balance INTERVAL, potentially stuffing it back into its parent | |
431 | Lisp Object. */ | |
432 | ||
433 | static INLINE INTERVAL | |
434 | balance_possible_root_interval (interval) | |
435 | register INTERVAL interval; | |
436 | { | |
437 | Lisp_Object parent; | |
439d5cb4 | 438 | int have_parent = 0; |
4314dea4 | 439 | |
439d5cb4 | 440 | if (!INTERVAL_HAS_OBJECT (interval) && !INTERVAL_HAS_PARENT (interval)) |
4314dea4 RS |
441 | return interval; |
442 | ||
439d5cb4 KR |
443 | if (INTERVAL_HAS_OBJECT (interval)) |
444 | { | |
445 | have_parent = 1; | |
446 | GET_INTERVAL_OBJECT (parent, interval); | |
447 | } | |
4314dea4 RS |
448 | interval = balance_an_interval (interval); |
449 | ||
439d5cb4 KR |
450 | if (have_parent) |
451 | { | |
452 | if (BUFFERP (parent)) | |
453 | BUF_INTERVALS (XBUFFER (parent)) = interval; | |
454 | else if (STRINGP (parent)) | |
b13738b6 | 455 | STRING_SET_INTERVALS (parent, interval); |
439d5cb4 | 456 | } |
4314dea4 RS |
457 | |
458 | return interval; | |
459 | } | |
460 | ||
461 | /* Balance the interval tree TREE. Balancing is by weight | |
462 | (the amount of text). */ | |
463 | ||
464 | static INTERVAL | |
465 | balance_intervals_internal (tree) | |
466 | register INTERVAL tree; | |
467 | { | |
468 | /* Balance within each side. */ | |
469 | if (tree->left) | |
8f3b9b95 | 470 | balance_intervals_internal (tree->left); |
4314dea4 | 471 | if (tree->right) |
8f3b9b95 | 472 | balance_intervals_internal (tree->right); |
4314dea4 RS |
473 | return balance_an_interval (tree); |
474 | } | |
475 | ||
476 | /* Advertised interface to balance intervals. */ | |
477 | ||
478 | INTERVAL | |
479 | balance_intervals (tree) | |
480 | INTERVAL tree; | |
481 | { | |
482 | if (tree == NULL_INTERVAL) | |
483 | return NULL_INTERVAL; | |
484 | ||
485 | return balance_intervals_internal (tree); | |
486 | } | |
487 | \f | |
2bc7a79b JB |
488 | /* Split INTERVAL into two pieces, starting the second piece at |
489 | character position OFFSET (counting from 0), relative to INTERVAL. | |
490 | INTERVAL becomes the left-hand piece, and the right-hand piece | |
491 | (second, lexicographically) is returned. | |
90ba40fc JA |
492 | |
493 | The size and position fields of the two intervals are set based upon | |
494 | those of the original interval. The property list of the new interval | |
495 | is reset, thus it is up to the caller to do the right thing with the | |
496 | result. | |
a50699fd JA |
497 | |
498 | Note that this does not change the position of INTERVAL; if it is a root, | |
7ce503fd | 499 | it is still a root after this operation. */ |
a50699fd JA |
500 | |
501 | INTERVAL | |
90ba40fc | 502 | split_interval_right (interval, offset) |
a50699fd | 503 | INTERVAL interval; |
90ba40fc | 504 | int offset; |
a50699fd JA |
505 | { |
506 | INTERVAL new = make_interval (); | |
507 | int position = interval->position; | |
2bc7a79b | 508 | int new_length = LENGTH (interval) - offset; |
a50699fd | 509 | |
2bc7a79b | 510 | new->position = position + offset; |
439d5cb4 | 511 | SET_INTERVAL_PARENT (new, interval); |
a50699fd | 512 | |
4314dea4 | 513 | if (NULL_RIGHT_CHILD (interval)) |
a50699fd JA |
514 | { |
515 | interval->right = new; | |
516 | new->total_length = new_length; | |
a50699fd | 517 | } |
cc6e2aaa RS |
518 | else |
519 | { | |
520 | /* Insert the new node between INTERVAL and its right child. */ | |
521 | new->right = interval->right; | |
439d5cb4 | 522 | SET_INTERVAL_PARENT (interval->right, new); |
cc6e2aaa RS |
523 | interval->right = new; |
524 | new->total_length = new_length + new->right->total_length; | |
525 | balance_an_interval (new); | |
526 | } | |
7d0393cf | 527 | |
4314dea4 RS |
528 | balance_possible_root_interval (interval); |
529 | ||
a50699fd JA |
530 | return new; |
531 | } | |
532 | ||
2bc7a79b JB |
533 | /* Split INTERVAL into two pieces, starting the second piece at |
534 | character position OFFSET (counting from 0), relative to INTERVAL. | |
535 | INTERVAL becomes the right-hand piece, and the left-hand piece | |
536 | (first, lexicographically) is returned. | |
a50699fd | 537 | |
90ba40fc JA |
538 | The size and position fields of the two intervals are set based upon |
539 | those of the original interval. The property list of the new interval | |
540 | is reset, thus it is up to the caller to do the right thing with the | |
541 | result. | |
542 | ||
543 | Note that this does not change the position of INTERVAL; if it is a root, | |
7ce503fd | 544 | it is still a root after this operation. */ |
a50699fd JA |
545 | |
546 | INTERVAL | |
90ba40fc | 547 | split_interval_left (interval, offset) |
a50699fd | 548 | INTERVAL interval; |
90ba40fc | 549 | int offset; |
a50699fd JA |
550 | { |
551 | INTERVAL new = make_interval (); | |
2bc7a79b | 552 | int new_length = offset; |
a50699fd | 553 | |
a50699fd | 554 | new->position = interval->position; |
2bc7a79b | 555 | interval->position = interval->position + offset; |
439d5cb4 | 556 | SET_INTERVAL_PARENT (new, interval); |
a50699fd JA |
557 | |
558 | if (NULL_LEFT_CHILD (interval)) | |
559 | { | |
560 | interval->left = new; | |
561 | new->total_length = new_length; | |
a50699fd | 562 | } |
cc6e2aaa RS |
563 | else |
564 | { | |
565 | /* Insert the new node between INTERVAL and its left child. */ | |
566 | new->left = interval->left; | |
439d5cb4 | 567 | SET_INTERVAL_PARENT (new->left, new); |
cc6e2aaa RS |
568 | interval->left = new; |
569 | new->total_length = new_length + new->left->total_length; | |
570 | balance_an_interval (new); | |
571 | } | |
7d0393cf | 572 | |
4314dea4 | 573 | balance_possible_root_interval (interval); |
a50699fd JA |
574 | |
575 | return new; | |
576 | } | |
577 | \f | |
944d4e4b KH |
578 | /* Return the proper position for the first character |
579 | described by the interval tree SOURCE. | |
580 | This is 1 if the parent is a buffer, | |
581 | 0 if the parent is a string or if there is no parent. | |
582 | ||
583 | Don't use this function on an interval which is the child | |
584 | of another interval! */ | |
585 | ||
586 | int | |
587 | interval_start_pos (source) | |
588 | INTERVAL source; | |
589 | { | |
590 | Lisp_Object parent; | |
591 | ||
592 | if (NULL_INTERVAL_P (source)) | |
593 | return 0; | |
594 | ||
e0b8c689 KR |
595 | if (! INTERVAL_HAS_OBJECT (source)) |
596 | return 0; | |
439d5cb4 | 597 | GET_INTERVAL_OBJECT (parent, source); |
944d4e4b KH |
598 | if (BUFFERP (parent)) |
599 | return BUF_BEG (XBUFFER (parent)); | |
600 | return 0; | |
601 | } | |
602 | ||
90ba40fc | 603 | /* Find the interval containing text position POSITION in the text |
24e3d3bf | 604 | represented by the interval tree TREE. POSITION is a buffer |
944d4e4b KH |
605 | position (starting from 1) or a string index (starting from 0). |
606 | If POSITION is at the end of the buffer or string, | |
607 | return the interval containing the last character. | |
a50699fd | 608 | |
90ba40fc JA |
609 | The `position' field, which is a cache of an interval's position, |
610 | is updated in the interval found. Other functions (e.g., next_interval) | |
7ce503fd | 611 | will update this cache based on the result of find_interval. */ |
90ba40fc | 612 | |
1863bbf8 | 613 | INTERVAL |
a50699fd JA |
614 | find_interval (tree, position) |
615 | register INTERVAL tree; | |
616 | register int position; | |
617 | { | |
24e3d3bf JB |
618 | /* The distance from the left edge of the subtree at TREE |
619 | to POSITION. */ | |
944d4e4b | 620 | register int relative_position; |
a50699fd JA |
621 | |
622 | if (NULL_INTERVAL_P (tree)) | |
623 | return NULL_INTERVAL; | |
624 | ||
944d4e4b | 625 | relative_position = position; |
439d5cb4 KR |
626 | if (INTERVAL_HAS_OBJECT (tree)) |
627 | { | |
628 | Lisp_Object parent; | |
629 | GET_INTERVAL_OBJECT (parent, tree); | |
630 | if (BUFFERP (parent)) | |
631 | relative_position -= BUF_BEG (XBUFFER (parent)); | |
632 | } | |
944d4e4b | 633 | |
24e3d3bf | 634 | if (relative_position > TOTAL_LENGTH (tree)) |
a50699fd | 635 | abort (); /* Paranoia */ |
a50699fd | 636 | |
52283633 SM |
637 | if (!handling_signal) |
638 | tree = balance_possible_root_interval (tree); | |
4314dea4 | 639 | |
a50699fd JA |
640 | while (1) |
641 | { | |
24e3d3bf | 642 | if (relative_position < LEFT_TOTAL_LENGTH (tree)) |
a50699fd JA |
643 | { |
644 | tree = tree->left; | |
645 | } | |
24e3d3bf JB |
646 | else if (! NULL_RIGHT_CHILD (tree) |
647 | && relative_position >= (TOTAL_LENGTH (tree) | |
648 | - RIGHT_TOTAL_LENGTH (tree))) | |
a50699fd JA |
649 | { |
650 | relative_position -= (TOTAL_LENGTH (tree) | |
651 | - RIGHT_TOTAL_LENGTH (tree)); | |
652 | tree = tree->right; | |
653 | } | |
654 | else | |
655 | { | |
944d4e4b KH |
656 | tree->position |
657 | = (position - relative_position /* the left edge of *tree */ | |
658 | + LEFT_TOTAL_LENGTH (tree)); /* the left edge of this interval */ | |
24e3d3bf | 659 | |
a50699fd JA |
660 | return tree; |
661 | } | |
662 | } | |
663 | } | |
664 | \f | |
665 | /* Find the succeeding interval (lexicographically) to INTERVAL. | |
90ba40fc | 666 | Sets the `position' field based on that of INTERVAL (see |
7ce503fd | 667 | find_interval). */ |
a50699fd JA |
668 | |
669 | INTERVAL | |
670 | next_interval (interval) | |
671 | register INTERVAL interval; | |
672 | { | |
673 | register INTERVAL i = interval; | |
674 | register int next_position; | |
675 | ||
676 | if (NULL_INTERVAL_P (i)) | |
677 | return NULL_INTERVAL; | |
678 | next_position = interval->position + LENGTH (interval); | |
679 | ||
680 | if (! NULL_RIGHT_CHILD (i)) | |
681 | { | |
682 | i = i->right; | |
683 | while (! NULL_LEFT_CHILD (i)) | |
684 | i = i->left; | |
685 | ||
686 | i->position = next_position; | |
687 | return i; | |
688 | } | |
689 | ||
690 | while (! NULL_PARENT (i)) | |
691 | { | |
692 | if (AM_LEFT_CHILD (i)) | |
693 | { | |
439d5cb4 | 694 | i = INTERVAL_PARENT (i); |
a50699fd JA |
695 | i->position = next_position; |
696 | return i; | |
697 | } | |
698 | ||
439d5cb4 | 699 | i = INTERVAL_PARENT (i); |
a50699fd JA |
700 | } |
701 | ||
702 | return NULL_INTERVAL; | |
703 | } | |
704 | ||
705 | /* Find the preceding interval (lexicographically) to INTERVAL. | |
90ba40fc | 706 | Sets the `position' field based on that of INTERVAL (see |
7ce503fd | 707 | find_interval). */ |
a50699fd JA |
708 | |
709 | INTERVAL | |
710 | previous_interval (interval) | |
711 | register INTERVAL interval; | |
712 | { | |
713 | register INTERVAL i; | |
a50699fd JA |
714 | |
715 | if (NULL_INTERVAL_P (interval)) | |
716 | return NULL_INTERVAL; | |
717 | ||
718 | if (! NULL_LEFT_CHILD (interval)) | |
719 | { | |
720 | i = interval->left; | |
721 | while (! NULL_RIGHT_CHILD (i)) | |
722 | i = i->right; | |
723 | ||
724 | i->position = interval->position - LENGTH (i); | |
725 | return i; | |
726 | } | |
727 | ||
728 | i = interval; | |
729 | while (! NULL_PARENT (i)) | |
730 | { | |
731 | if (AM_RIGHT_CHILD (i)) | |
732 | { | |
439d5cb4 | 733 | i = INTERVAL_PARENT (i); |
a50699fd JA |
734 | |
735 | i->position = interval->position - LENGTH (i); | |
736 | return i; | |
737 | } | |
439d5cb4 | 738 | i = INTERVAL_PARENT (i); |
a50699fd JA |
739 | } |
740 | ||
741 | return NULL_INTERVAL; | |
742 | } | |
25eeac41 RS |
743 | |
744 | /* Find the interval containing POS given some non-NULL INTERVAL | |
75167cd4 | 745 | in the same tree. Note that we need to update interval->position |
52283633 SM |
746 | if we go down the tree. |
747 | To speed up the process, we assume that the ->position of | |
748 | I and all its parents is already uptodate. */ | |
25eeac41 RS |
749 | INTERVAL |
750 | update_interval (i, pos) | |
751 | register INTERVAL i; | |
752 | int pos; | |
753 | { | |
754 | if (NULL_INTERVAL_P (i)) | |
755 | return NULL_INTERVAL; | |
756 | ||
7d0393cf | 757 | while (1) |
25eeac41 | 758 | { |
7d0393cf | 759 | if (pos < i->position) |
25eeac41 RS |
760 | { |
761 | /* Move left. */ | |
7d0393cf | 762 | if (pos >= i->position - TOTAL_LENGTH (i->left)) |
75167cd4 RS |
763 | { |
764 | i->left->position = i->position - TOTAL_LENGTH (i->left) | |
765 | + LEFT_TOTAL_LENGTH (i->left); | |
766 | i = i->left; /* Move to the left child */ | |
767 | } | |
7d0393cf | 768 | else if (NULL_PARENT (i)) |
25eeac41 | 769 | error ("Point before start of properties"); |
7d0393cf | 770 | else |
439d5cb4 | 771 | i = INTERVAL_PARENT (i); |
25eeac41 RS |
772 | continue; |
773 | } | |
774 | else if (pos >= INTERVAL_LAST_POS (i)) | |
775 | { | |
776 | /* Move right. */ | |
7d0393cf | 777 | if (pos < INTERVAL_LAST_POS (i) + TOTAL_LENGTH (i->right)) |
75167cd4 RS |
778 | { |
779 | i->right->position = INTERVAL_LAST_POS (i) + | |
780 | LEFT_TOTAL_LENGTH (i->right); | |
781 | i = i->right; /* Move to the right child */ | |
782 | } | |
7d0393cf | 783 | else if (NULL_PARENT (i)) |
25eeac41 | 784 | error ("Point after end of properties"); |
7d0393cf | 785 | else |
439d5cb4 | 786 | i = INTERVAL_PARENT (i); |
25eeac41 RS |
787 | continue; |
788 | } | |
7d0393cf | 789 | else |
25eeac41 RS |
790 | return i; |
791 | } | |
792 | } | |
793 | ||
a50699fd | 794 | \f |
90ba40fc | 795 | #if 0 |
a50699fd JA |
796 | /* Traverse a path down the interval tree TREE to the interval |
797 | containing POSITION, adjusting all nodes on the path for | |
798 | an addition of LENGTH characters. Insertion between two intervals | |
799 | (i.e., point == i->position, where i is second interval) means | |
800 | text goes into second interval. | |
801 | ||
802 | Modifications are needed to handle the hungry bits -- after simply | |
803 | finding the interval at position (don't add length going down), | |
804 | if it's the beginning of the interval, get the previous interval | |
8e6208c5 | 805 | and check the hungry bits of both. Then add the length going back up |
7ce503fd | 806 | to the root. */ |
a50699fd JA |
807 | |
808 | static INTERVAL | |
809 | adjust_intervals_for_insertion (tree, position, length) | |
810 | INTERVAL tree; | |
811 | int position, length; | |
812 | { | |
813 | register int relative_position; | |
814 | register INTERVAL this; | |
815 | ||
816 | if (TOTAL_LENGTH (tree) == 0) /* Paranoia */ | |
817 | abort (); | |
818 | ||
819 | /* If inserting at point-max of a buffer, that position | |
820 | will be out of range */ | |
821 | if (position > TOTAL_LENGTH (tree)) | |
822 | position = TOTAL_LENGTH (tree); | |
823 | relative_position = position; | |
824 | this = tree; | |
825 | ||
826 | while (1) | |
827 | { | |
828 | if (relative_position <= LEFT_TOTAL_LENGTH (this)) | |
829 | { | |
830 | this->total_length += length; | |
831 | this = this->left; | |
832 | } | |
833 | else if (relative_position > (TOTAL_LENGTH (this) | |
834 | - RIGHT_TOTAL_LENGTH (this))) | |
835 | { | |
836 | relative_position -= (TOTAL_LENGTH (this) | |
837 | - RIGHT_TOTAL_LENGTH (this)); | |
838 | this->total_length += length; | |
839 | this = this->right; | |
840 | } | |
841 | else | |
842 | { | |
843 | /* If we are to use zero-length intervals as buffer pointers, | |
7ce503fd | 844 | then this code will have to change. */ |
a50699fd JA |
845 | this->total_length += length; |
846 | this->position = LEFT_TOTAL_LENGTH (this) | |
847 | + position - relative_position + 1; | |
848 | return tree; | |
849 | } | |
850 | } | |
851 | } | |
90ba40fc JA |
852 | #endif |
853 | ||
854 | /* Effect an adjustment corresponding to the addition of LENGTH characters | |
855 | of text. Do this by finding the interval containing POSITION in the | |
550bd63a | 856 | interval tree TREE, and then adjusting all of its ancestors by adding |
90ba40fc JA |
857 | LENGTH to them. |
858 | ||
859 | If POSITION is the first character of an interval, meaning that point | |
860 | is actually between the two intervals, make the new text belong to | |
861 | the interval which is "sticky". | |
862 | ||
1d1d7ba0 | 863 | If both intervals are "sticky", then make them belong to the left-most |
90ba40fc | 864 | interval. Another possibility would be to create a new interval for |
7ce503fd | 865 | this text, and make it have the merged properties of both ends. */ |
90ba40fc JA |
866 | |
867 | static INTERVAL | |
868 | adjust_intervals_for_insertion (tree, position, length) | |
869 | INTERVAL tree; | |
870 | int position, length; | |
871 | { | |
872 | register INTERVAL i; | |
7ce503fd RS |
873 | register INTERVAL temp; |
874 | int eobp = 0; | |
944d4e4b KH |
875 | Lisp_Object parent; |
876 | int offset; | |
7d0393cf | 877 | |
90ba40fc JA |
878 | if (TOTAL_LENGTH (tree) == 0) /* Paranoia */ |
879 | abort (); | |
880 | ||
439d5cb4 | 881 | GET_INTERVAL_OBJECT (parent, tree); |
944d4e4b KH |
882 | offset = (BUFFERP (parent) ? BUF_BEG (XBUFFER (parent)) : 0); |
883 | ||
24e3d3bf JB |
884 | /* If inserting at point-max of a buffer, that position will be out |
885 | of range. Remember that buffer positions are 1-based. */ | |
944d4e4b KH |
886 | if (position >= TOTAL_LENGTH (tree) + offset) |
887 | { | |
888 | position = TOTAL_LENGTH (tree) + offset; | |
889 | eobp = 1; | |
890 | } | |
90ba40fc JA |
891 | |
892 | i = find_interval (tree, position); | |
7ce503fd | 893 | |
2313b945 RS |
894 | /* If in middle of an interval which is not sticky either way, |
895 | we must not just give its properties to the insertion. | |
f56b42ac KH |
896 | So split this interval at the insertion point. |
897 | ||
898 | Originally, the if condition here was this: | |
899 | (! (position == i->position || eobp) | |
900 | && END_NONSTICKY_P (i) | |
901 | && FRONT_NONSTICKY_P (i)) | |
902 | But, these macros are now unreliable because of introduction of | |
903 | Vtext_property_default_nonsticky. So, we always check properties | |
904 | one by one if POSITION is in middle of an interval. */ | |
905 | if (! (position == i->position || eobp)) | |
2313b945 | 906 | { |
ca41a64d RS |
907 | Lisp_Object tail; |
908 | Lisp_Object front, rear; | |
909 | ||
f56b42ac KH |
910 | tail = i->plist; |
911 | ||
912 | /* Properties font-sticky and rear-nonsticky override | |
913 | Vtext_property_default_nonsticky. So, if they are t, we can | |
914 | skip one by one checking of properties. */ | |
915 | rear = textget (i->plist, Qrear_nonsticky); | |
916 | if (! CONSP (rear) && ! NILP (rear)) | |
917 | { | |
918 | /* All properties are nonsticky. We split the interval. */ | |
919 | goto check_done; | |
920 | } | |
ca41a64d | 921 | front = textget (i->plist, Qfront_sticky); |
f56b42ac KH |
922 | if (! CONSP (front) && ! NILP (front)) |
923 | { | |
924 | /* All properties are sticky. We don't split the interval. */ | |
925 | tail = Qnil; | |
926 | goto check_done; | |
927 | } | |
ca41a64d | 928 | |
f56b42ac KH |
929 | /* Does any actual property pose an actual problem? We break |
930 | the loop if we find a nonsticky property. */ | |
931 | for (; CONSP (tail); tail = Fcdr (XCDR (tail))) | |
ca41a64d | 932 | { |
f56b42ac | 933 | Lisp_Object prop, tmp; |
03699b14 | 934 | prop = XCAR (tail); |
ca41a64d | 935 | |
f56b42ac | 936 | /* Is this particular property front-sticky? */ |
ca41a64d RS |
937 | if (CONSP (front) && ! NILP (Fmemq (prop, front))) |
938 | continue; | |
939 | ||
f56b42ac KH |
940 | /* Is this particular property rear-nonsticky? */ |
941 | if (CONSP (rear) && ! NILP (Fmemq (prop, rear))) | |
942 | break; | |
943 | ||
944 | /* Is this particular property recorded as sticky or | |
945 | nonsticky in Vtext_property_default_nonsticky? */ | |
946 | tmp = Fassq (prop, Vtext_property_default_nonsticky); | |
947 | if (CONSP (tmp)) | |
948 | { | |
949 | if (NILP (tmp)) | |
950 | continue; | |
951 | break; | |
952 | } | |
953 | ||
954 | /* By default, a text property is rear-sticky, thus we | |
955 | continue the loop. */ | |
ca41a64d RS |
956 | } |
957 | ||
f56b42ac | 958 | check_done: |
ca41a64d RS |
959 | /* If any property is a real problem, split the interval. */ |
960 | if (! NILP (tail)) | |
961 | { | |
962 | temp = split_interval_right (i, position - i->position); | |
963 | copy_properties (i, temp); | |
964 | i = temp; | |
965 | } | |
2313b945 RS |
966 | } |
967 | ||
90ba40fc | 968 | /* If we are positioned between intervals, check the stickiness of |
7ce503fd RS |
969 | both of them. We have to do this too, if we are at BEG or Z. */ |
970 | if (position == i->position || eobp) | |
90ba40fc | 971 | { |
7ce503fd RS |
972 | register INTERVAL prev; |
973 | ||
974 | if (position == BEG) | |
975 | prev = 0; | |
976 | else if (eobp) | |
977 | { | |
978 | prev = i; | |
979 | i = 0; | |
980 | } | |
981 | else | |
982 | prev = previous_interval (i); | |
90ba40fc | 983 | |
7ce503fd RS |
984 | /* Even if we are positioned between intervals, we default |
985 | to the left one if it exists. We extend it now and split | |
8e6208c5 | 986 | off a part later, if stickiness demands it. */ |
439d5cb4 | 987 | for (temp = prev ? prev : i; temp; temp = INTERVAL_PARENT_OR_NULL (temp)) |
4314dea4 RS |
988 | { |
989 | temp->total_length += length; | |
990 | temp = balance_possible_root_interval (temp); | |
991 | } | |
7d0393cf | 992 | |
7ce503fd | 993 | /* If at least one interval has sticky properties, |
f56b42ac KH |
994 | we check the stickiness property by property. |
995 | ||
996 | Originally, the if condition here was this: | |
997 | (END_NONSTICKY_P (prev) || FRONT_STICKY_P (i)) | |
998 | But, these macros are now unreliable because of introduction | |
999 | of Vtext_property_default_nonsticky. So, we always have to | |
1000 | check stickiness of properties one by one. If cache of | |
1001 | stickiness is implemented in the future, we may be able to | |
1002 | use those macros again. */ | |
1003 | if (1) | |
7ce503fd | 1004 | { |
dd675b05 | 1005 | Lisp_Object pleft, pright; |
7ce503fd RS |
1006 | struct interval newi; |
1007 | ||
dd675b05 KH |
1008 | pleft = NULL_INTERVAL_P (prev) ? Qnil : prev->plist; |
1009 | pright = NULL_INTERVAL_P (i) ? Qnil : i->plist; | |
7ce503fd RS |
1010 | newi.plist = merge_properties_sticky (pleft, pright); |
1011 | ||
ef1900f3 | 1012 | if (! prev) /* i.e. position == BEG */ |
7ce503fd RS |
1013 | { |
1014 | if (! intervals_equal (i, &newi)) | |
1015 | { | |
1016 | i = split_interval_left (i, length); | |
1017 | i->plist = newi.plist; | |
1018 | } | |
1019 | } | |
1020 | else if (! intervals_equal (prev, &newi)) | |
1021 | { | |
1022 | prev = split_interval_right (prev, | |
1023 | position - prev->position); | |
1024 | prev->plist = newi.plist; | |
1025 | if (! NULL_INTERVAL_P (i) | |
1026 | && intervals_equal (prev, i)) | |
1027 | merge_interval_right (prev); | |
1028 | } | |
1029 | ||
1030 | /* We will need to update the cache here later. */ | |
1031 | } | |
1032 | else if (! prev && ! NILP (i->plist)) | |
1033 | { | |
1034 | /* Just split off a new interval at the left. | |
1035 | Since I wasn't front-sticky, the empty plist is ok. */ | |
1036 | i = split_interval_left (i, length); | |
1037 | } | |
90ba40fc JA |
1038 | } |
1039 | ||
7ce503fd RS |
1040 | /* Otherwise just extend the interval. */ |
1041 | else | |
90ba40fc | 1042 | { |
439d5cb4 | 1043 | for (temp = i; temp; temp = INTERVAL_PARENT_OR_NULL (temp)) |
4314dea4 RS |
1044 | { |
1045 | temp->total_length += length; | |
1046 | temp = balance_possible_root_interval (temp); | |
1047 | } | |
90ba40fc | 1048 | } |
7d0393cf | 1049 | |
90ba40fc JA |
1050 | return tree; |
1051 | } | |
7ce503fd | 1052 | |
45d82bdc KH |
1053 | /* Any property might be front-sticky on the left, rear-sticky on the left, |
1054 | front-sticky on the right, or rear-sticky on the right; the 16 combinations | |
1055 | can be arranged in a matrix with rows denoting the left conditions and | |
1056 | columns denoting the right conditions: | |
1057 | _ __ _ | |
1058 | _ FR FR FR FR | |
1059 | FR__ 0 1 2 3 | |
1060 | _FR 4 5 6 7 | |
1061 | FR 8 9 A B | |
1062 | FR C D E F | |
1063 | ||
1064 | left-props = '(front-sticky (p8 p9 pa pb pc pd pe pf) | |
1065 | rear-nonsticky (p4 p5 p6 p7 p8 p9 pa pb) | |
1066 | p0 L p1 L p2 L p3 L p4 L p5 L p6 L p7 L | |
1067 | p8 L p9 L pa L pb L pc L pd L pe L pf L) | |
1068 | right-props = '(front-sticky (p2 p3 p6 p7 pa pb pe pf) | |
1069 | rear-nonsticky (p1 p2 p5 p6 p9 pa pd pe) | |
1070 | p0 R p1 R p2 R p3 R p4 R p5 R p6 R p7 R | |
1071 | p8 R p9 R pa R pb R pc R pd R pe R pf R) | |
1072 | ||
1073 | We inherit from whoever has a sticky side facing us. If both sides | |
1074 | do (cases 2, 3, E, and F), then we inherit from whichever side has a | |
1075 | non-nil value for the current property. If both sides do, then we take | |
1076 | from the left. | |
1077 | ||
1078 | When we inherit a property, we get its stickiness as well as its value. | |
1079 | So, when we merge the above two lists, we expect to get this: | |
1080 | ||
1081 | result = '(front-sticky (p6 p7 pa pb pc pd pe pf) | |
1082 | rear-nonsticky (p6 pa) | |
1083 | p0 L p1 L p2 L p3 L p6 R p7 R | |
1084 | pa R pb R pc L pd L pe L pf L) | |
1085 | ||
1086 | The optimizable special cases are: | |
1087 | left rear-nonsticky = nil, right front-sticky = nil (inherit left) | |
1088 | left rear-nonsticky = t, right front-sticky = t (inherit right) | |
1089 | left rear-nonsticky = t, right front-sticky = nil (inherit none) | |
1090 | */ | |
1091 | ||
7ce503fd RS |
1092 | Lisp_Object |
1093 | merge_properties_sticky (pleft, pright) | |
1094 | Lisp_Object pleft, pright; | |
1095 | { | |
dd675b05 KH |
1096 | register Lisp_Object props, front, rear; |
1097 | Lisp_Object lfront, lrear, rfront, rrear; | |
4ab19eb3 | 1098 | register Lisp_Object tail1, tail2, sym, lval, rval, cat; |
45d82bdc | 1099 | int use_left, use_right; |
4ab19eb3 | 1100 | int lpresent; |
7ce503fd | 1101 | |
dd675b05 KH |
1102 | props = Qnil; |
1103 | front = Qnil; | |
1104 | rear = Qnil; | |
1105 | lfront = textget (pleft, Qfront_sticky); | |
1106 | lrear = textget (pleft, Qrear_nonsticky); | |
1107 | rfront = textget (pright, Qfront_sticky); | |
1108 | rrear = textget (pright, Qrear_nonsticky); | |
1109 | ||
45d82bdc | 1110 | /* Go through each element of PRIGHT. */ |
f56b42ac | 1111 | for (tail1 = pright; CONSP (tail1); tail1 = Fcdr (Fcdr (tail1))) |
7ce503fd | 1112 | { |
f56b42ac KH |
1113 | Lisp_Object tmp; |
1114 | ||
7ce503fd RS |
1115 | sym = Fcar (tail1); |
1116 | ||
1117 | /* Sticky properties get special treatment. */ | |
1118 | if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky)) | |
1119 | continue; | |
45d82bdc KH |
1120 | |
1121 | rval = Fcar (Fcdr (tail1)); | |
f56b42ac | 1122 | for (tail2 = pleft; CONSP (tail2); tail2 = Fcdr (Fcdr (tail2))) |
45d82bdc KH |
1123 | if (EQ (sym, Fcar (tail2))) |
1124 | break; | |
45d82bdc | 1125 | |
4ab19eb3 RS |
1126 | /* Indicate whether the property is explicitly defined on the left. |
1127 | (We know it is defined explicitly on the right | |
1128 | because otherwise we don't get here.) */ | |
1129 | lpresent = ! NILP (tail2); | |
1130 | lval = (NILP (tail2) ? Qnil : Fcar (Fcdr (tail2))); | |
1131 | ||
f56b42ac KH |
1132 | /* Even if lrear or rfront say nothing about the stickiness of |
1133 | SYM, Vtext_property_default_nonsticky may give default | |
1134 | stickiness to SYM. */ | |
1135 | tmp = Fassq (sym, Vtext_property_default_nonsticky); | |
1136 | use_left = (lpresent | |
1137 | && ! (TMEM (sym, lrear) | |
3a62677f | 1138 | || (CONSP (tmp) && ! NILP (XCDR (tmp))))); |
f56b42ac KH |
1139 | use_right = (TMEM (sym, rfront) |
1140 | || (CONSP (tmp) && NILP (XCDR (tmp)))); | |
45d82bdc KH |
1141 | if (use_left && use_right) |
1142 | { | |
4ab19eb3 RS |
1143 | if (NILP (lval)) |
1144 | use_left = 0; | |
1145 | else if (NILP (rval)) | |
1146 | use_right = 0; | |
45d82bdc KH |
1147 | } |
1148 | if (use_left) | |
7ce503fd | 1149 | { |
45d82bdc KH |
1150 | /* We build props as (value sym ...) rather than (sym value ...) |
1151 | because we plan to nreverse it when we're done. */ | |
4ab19eb3 | 1152 | props = Fcons (lval, Fcons (sym, props)); |
45d82bdc | 1153 | if (TMEM (sym, lfront)) |
7ce503fd | 1154 | front = Fcons (sym, front); |
45d82bdc KH |
1155 | if (TMEM (sym, lrear)) |
1156 | rear = Fcons (sym, rear); | |
7ce503fd | 1157 | } |
45d82bdc | 1158 | else if (use_right) |
7ce503fd | 1159 | { |
4ab19eb3 | 1160 | props = Fcons (rval, Fcons (sym, props)); |
45d82bdc KH |
1161 | if (TMEM (sym, rfront)) |
1162 | front = Fcons (sym, front); | |
1163 | if (TMEM (sym, rrear)) | |
1164 | rear = Fcons (sym, rear); | |
7ce503fd RS |
1165 | } |
1166 | } | |
45d82bdc KH |
1167 | |
1168 | /* Now go through each element of PLEFT. */ | |
f56b42ac | 1169 | for (tail2 = pleft; CONSP (tail2); tail2 = Fcdr (Fcdr (tail2))) |
7ce503fd | 1170 | { |
f56b42ac KH |
1171 | Lisp_Object tmp; |
1172 | ||
7ce503fd RS |
1173 | sym = Fcar (tail2); |
1174 | ||
1175 | /* Sticky properties get special treatment. */ | |
1176 | if (EQ (sym, Qrear_nonsticky) || EQ (sym, Qfront_sticky)) | |
1177 | continue; | |
1178 | ||
45d82bdc | 1179 | /* If sym is in PRIGHT, we've already considered it. */ |
f56b42ac | 1180 | for (tail1 = pright; CONSP (tail1); tail1 = Fcdr (Fcdr (tail1))) |
7ce503fd RS |
1181 | if (EQ (sym, Fcar (tail1))) |
1182 | break; | |
45d82bdc KH |
1183 | if (! NILP (tail1)) |
1184 | continue; | |
1185 | ||
1186 | lval = Fcar (Fcdr (tail2)); | |
1187 | ||
f56b42ac KH |
1188 | /* Even if lrear or rfront say nothing about the stickiness of |
1189 | SYM, Vtext_property_default_nonsticky may give default | |
1190 | stickiness to SYM. */ | |
1191 | tmp = Fassq (sym, Vtext_property_default_nonsticky); | |
1192 | ||
45d82bdc | 1193 | /* Since rval is known to be nil in this loop, the test simplifies. */ |
f56b42ac | 1194 | if (! (TMEM (sym, lrear) || (CONSP (tmp) && ! NILP (XCDR (tmp))))) |
7ce503fd | 1195 | { |
4ab19eb3 | 1196 | props = Fcons (lval, Fcons (sym, props)); |
45d82bdc KH |
1197 | if (TMEM (sym, lfront)) |
1198 | front = Fcons (sym, front); | |
1199 | } | |
f56b42ac | 1200 | else if (TMEM (sym, rfront) || (CONSP (tmp) && NILP (XCDR (tmp)))) |
45d82bdc KH |
1201 | { |
1202 | /* The value is nil, but we still inherit the stickiness | |
1203 | from the right. */ | |
7ce503fd | 1204 | front = Fcons (sym, front); |
45d82bdc | 1205 | if (TMEM (sym, rrear)) |
7ce503fd RS |
1206 | rear = Fcons (sym, rear); |
1207 | } | |
1208 | } | |
550bd63a | 1209 | props = Fnreverse (props); |
7ce503fd | 1210 | if (! NILP (rear)) |
550bd63a | 1211 | props = Fcons (Qrear_nonsticky, Fcons (Fnreverse (rear), props)); |
4ab19eb3 RS |
1212 | |
1213 | cat = textget (props, Qcategory); | |
1214 | if (! NILP (front) | |
7d0393cf | 1215 | && |
4ab19eb3 RS |
1216 | /* If we have inherited a front-stick category property that is t, |
1217 | we don't need to set up a detailed one. */ | |
1218 | ! (! NILP (cat) && SYMBOLP (cat) | |
1219 | && EQ (Fget (cat, Qfront_sticky), Qt))) | |
45d82bdc | 1220 | props = Fcons (Qfront_sticky, Fcons (Fnreverse (front), props)); |
7ce503fd | 1221 | return props; |
7ce503fd RS |
1222 | } |
1223 | ||
a50699fd | 1224 | \f |
7d0393cf | 1225 | /* Delete a node I from its interval tree by merging its subtrees |
90ba40fc | 1226 | into one subtree which is then returned. Caller is responsible for |
7ce503fd | 1227 | storing the resulting subtree into its parent. */ |
a50699fd JA |
1228 | |
1229 | static INTERVAL | |
1230 | delete_node (i) | |
1231 | register INTERVAL i; | |
1232 | { | |
1233 | register INTERVAL migrate, this; | |
1234 | register int migrate_amt; | |
1235 | ||
1236 | if (NULL_INTERVAL_P (i->left)) | |
1237 | return i->right; | |
1238 | if (NULL_INTERVAL_P (i->right)) | |
1239 | return i->left; | |
1240 | ||
1241 | migrate = i->left; | |
1242 | migrate_amt = i->left->total_length; | |
1243 | this = i->right; | |
1244 | this->total_length += migrate_amt; | |
1245 | while (! NULL_INTERVAL_P (this->left)) | |
1246 | { | |
1247 | this = this->left; | |
1248 | this->total_length += migrate_amt; | |
1249 | } | |
1250 | this->left = migrate; | |
439d5cb4 | 1251 | SET_INTERVAL_PARENT (migrate, this); |
a50699fd JA |
1252 | |
1253 | return i->right; | |
1254 | } | |
1255 | ||
1256 | /* Delete interval I from its tree by calling `delete_node' | |
1257 | and properly connecting the resultant subtree. | |
1258 | ||
1259 | I is presumed to be empty; that is, no adjustments are made | |
7ce503fd | 1260 | for the length of I. */ |
a50699fd JA |
1261 | |
1262 | void | |
1263 | delete_interval (i) | |
1264 | register INTERVAL i; | |
1265 | { | |
1266 | register INTERVAL parent; | |
1267 | int amt = LENGTH (i); | |
1268 | ||
7ce503fd | 1269 | if (amt > 0) /* Only used on zero-length intervals now. */ |
a50699fd JA |
1270 | abort (); |
1271 | ||
1272 | if (ROOT_INTERVAL_P (i)) | |
1273 | { | |
dd675b05 | 1274 | Lisp_Object owner; |
439d5cb4 | 1275 | GET_INTERVAL_OBJECT (owner, i); |
a50699fd JA |
1276 | parent = delete_node (i); |
1277 | if (! NULL_INTERVAL_P (parent)) | |
439d5cb4 | 1278 | SET_INTERVAL_OBJECT (parent, owner); |
a50699fd | 1279 | |
b629dd47 | 1280 | if (BUFFERP (owner)) |
e5d967c9 | 1281 | BUF_INTERVALS (XBUFFER (owner)) = parent; |
b629dd47 | 1282 | else if (STRINGP (owner)) |
b13738b6 | 1283 | STRING_SET_INTERVALS (owner, parent); |
a50699fd JA |
1284 | else |
1285 | abort (); | |
1286 | ||
1287 | return; | |
1288 | } | |
1289 | ||
439d5cb4 | 1290 | parent = INTERVAL_PARENT (i); |
a50699fd JA |
1291 | if (AM_LEFT_CHILD (i)) |
1292 | { | |
1293 | parent->left = delete_node (i); | |
1294 | if (! NULL_INTERVAL_P (parent->left)) | |
439d5cb4 | 1295 | SET_INTERVAL_PARENT (parent->left, parent); |
a50699fd JA |
1296 | } |
1297 | else | |
1298 | { | |
1299 | parent->right = delete_node (i); | |
1300 | if (! NULL_INTERVAL_P (parent->right)) | |
439d5cb4 | 1301 | SET_INTERVAL_PARENT (parent->right, parent); |
a50699fd JA |
1302 | } |
1303 | } | |
1304 | \f | |
24e3d3bf JB |
1305 | /* Find the interval in TREE corresponding to the relative position |
1306 | FROM and delete as much as possible of AMOUNT from that interval. | |
1307 | Return the amount actually deleted, and if the interval was | |
1308 | zeroed-out, delete that interval node from the tree. | |
1309 | ||
1310 | Note that FROM is actually origin zero, aka relative to the | |
1311 | leftmost edge of tree. This is appropriate since we call ourselves | |
1312 | recursively on subtrees. | |
a50699fd | 1313 | |
1d1d7ba0 | 1314 | Do this by recursing down TREE to the interval in question, and |
7ce503fd | 1315 | deleting the appropriate amount of text. */ |
a50699fd JA |
1316 | |
1317 | static int | |
1318 | interval_deletion_adjustment (tree, from, amount) | |
1319 | register INTERVAL tree; | |
1320 | register int from, amount; | |
1321 | { | |
1322 | register int relative_position = from; | |
1323 | ||
1324 | if (NULL_INTERVAL_P (tree)) | |
1325 | return 0; | |
1326 | ||
1327 | /* Left branch */ | |
24e3d3bf | 1328 | if (relative_position < LEFT_TOTAL_LENGTH (tree)) |
a50699fd JA |
1329 | { |
1330 | int subtract = interval_deletion_adjustment (tree->left, | |
1331 | relative_position, | |
1332 | amount); | |
1333 | tree->total_length -= subtract; | |
1334 | return subtract; | |
1335 | } | |
1336 | /* Right branch */ | |
24e3d3bf JB |
1337 | else if (relative_position >= (TOTAL_LENGTH (tree) |
1338 | - RIGHT_TOTAL_LENGTH (tree))) | |
a50699fd JA |
1339 | { |
1340 | int subtract; | |
1341 | ||
1342 | relative_position -= (tree->total_length | |
1343 | - RIGHT_TOTAL_LENGTH (tree)); | |
1344 | subtract = interval_deletion_adjustment (tree->right, | |
1345 | relative_position, | |
1346 | amount); | |
1347 | tree->total_length -= subtract; | |
1348 | return subtract; | |
1349 | } | |
7ce503fd | 1350 | /* Here -- this node. */ |
a50699fd JA |
1351 | else |
1352 | { | |
24e3d3bf | 1353 | /* How much can we delete from this interval? */ |
7d0393cf | 1354 | int my_amount = ((tree->total_length |
24e3d3bf JB |
1355 | - RIGHT_TOTAL_LENGTH (tree)) |
1356 | - relative_position); | |
1357 | ||
1358 | if (amount > my_amount) | |
1359 | amount = my_amount; | |
1360 | ||
1361 | tree->total_length -= amount; | |
1362 | if (LENGTH (tree) == 0) | |
1363 | delete_interval (tree); | |
7d0393cf | 1364 | |
24e3d3bf | 1365 | return amount; |
a50699fd JA |
1366 | } |
1367 | ||
7ce503fd | 1368 | /* Never reach here. */ |
a50699fd JA |
1369 | } |
1370 | ||
24e3d3bf JB |
1371 | /* Effect the adjustments necessary to the interval tree of BUFFER to |
1372 | correspond to the deletion of LENGTH characters from that buffer | |
1373 | text. The deletion is effected at position START (which is a | |
7ce503fd | 1374 | buffer position, i.e. origin 1). */ |
1d1d7ba0 | 1375 | |
a50699fd JA |
1376 | static void |
1377 | adjust_intervals_for_deletion (buffer, start, length) | |
1378 | struct buffer *buffer; | |
1379 | int start, length; | |
1380 | { | |
1381 | register int left_to_delete = length; | |
e5d967c9 | 1382 | register INTERVAL tree = BUF_INTERVALS (buffer); |
944d4e4b KH |
1383 | Lisp_Object parent; |
1384 | int offset; | |
1385 | ||
439d5cb4 | 1386 | GET_INTERVAL_OBJECT (parent, tree); |
944d4e4b | 1387 | offset = (BUFFERP (parent) ? BUF_BEG (XBUFFER (parent)) : 0); |
a50699fd JA |
1388 | |
1389 | if (NULL_INTERVAL_P (tree)) | |
1390 | return; | |
1391 | ||
944d4e4b KH |
1392 | if (start > offset + TOTAL_LENGTH (tree) |
1393 | || start + length > offset + TOTAL_LENGTH (tree)) | |
24e3d3bf JB |
1394 | abort (); |
1395 | ||
a50699fd JA |
1396 | if (length == TOTAL_LENGTH (tree)) |
1397 | { | |
e5d967c9 | 1398 | BUF_INTERVALS (buffer) = NULL_INTERVAL; |
a50699fd JA |
1399 | return; |
1400 | } | |
1401 | ||
1402 | if (ONLY_INTERVAL_P (tree)) | |
1403 | { | |
1404 | tree->total_length -= length; | |
1405 | return; | |
1406 | } | |
1407 | ||
944d4e4b KH |
1408 | if (start > offset + TOTAL_LENGTH (tree)) |
1409 | start = offset + TOTAL_LENGTH (tree); | |
a50699fd JA |
1410 | while (left_to_delete > 0) |
1411 | { | |
944d4e4b | 1412 | left_to_delete -= interval_deletion_adjustment (tree, start - offset, |
a50699fd | 1413 | left_to_delete); |
e5d967c9 | 1414 | tree = BUF_INTERVALS (buffer); |
a50699fd JA |
1415 | if (left_to_delete == tree->total_length) |
1416 | { | |
e5d967c9 | 1417 | BUF_INTERVALS (buffer) = NULL_INTERVAL; |
a50699fd JA |
1418 | return; |
1419 | } | |
1420 | } | |
1421 | } | |
1422 | \f | |
eb8c3be9 | 1423 | /* Make the adjustments necessary to the interval tree of BUFFER to |
1d1d7ba0 JA |
1424 | represent an addition or deletion of LENGTH characters starting |
1425 | at position START. Addition or deletion is indicated by the sign | |
7ce503fd | 1426 | of LENGTH. */ |
a50699fd JA |
1427 | |
1428 | INLINE void | |
1429 | offset_intervals (buffer, start, length) | |
1430 | struct buffer *buffer; | |
1431 | int start, length; | |
1432 | { | |
e5d967c9 | 1433 | if (NULL_INTERVAL_P (BUF_INTERVALS (buffer)) || length == 0) |
a50699fd JA |
1434 | return; |
1435 | ||
1436 | if (length > 0) | |
e5d967c9 | 1437 | adjust_intervals_for_insertion (BUF_INTERVALS (buffer), start, length); |
a50699fd JA |
1438 | else |
1439 | adjust_intervals_for_deletion (buffer, start, -length); | |
1440 | } | |
9c79dd1b JA |
1441 | \f |
1442 | /* Merge interval I with its lexicographic successor. The resulting | |
1443 | interval is returned, and has the properties of the original | |
1444 | successor. The properties of I are lost. I is removed from the | |
1445 | interval tree. | |
1446 | ||
1447 | IMPORTANT: | |
1448 | The caller must verify that this is not the last (rightmost) | |
7ce503fd | 1449 | interval. */ |
9c79dd1b JA |
1450 | |
1451 | INTERVAL | |
1452 | merge_interval_right (i) | |
1453 | register INTERVAL i; | |
1454 | { | |
1455 | register int absorb = LENGTH (i); | |
1456 | register INTERVAL successor; | |
1457 | ||
7ce503fd | 1458 | /* Zero out this interval. */ |
9c79dd1b JA |
1459 | i->total_length -= absorb; |
1460 | ||
7ce503fd | 1461 | /* Find the succeeding interval. */ |
9c79dd1b | 1462 | if (! NULL_RIGHT_CHILD (i)) /* It's below us. Add absorb |
7ce503fd | 1463 | as we descend. */ |
9c79dd1b JA |
1464 | { |
1465 | successor = i->right; | |
1466 | while (! NULL_LEFT_CHILD (successor)) | |
1467 | { | |
1468 | successor->total_length += absorb; | |
1469 | successor = successor->left; | |
1470 | } | |
1471 | ||
1472 | successor->total_length += absorb; | |
1473 | delete_interval (i); | |
1474 | return successor; | |
1475 | } | |
1476 | ||
1477 | successor = i; | |
1478 | while (! NULL_PARENT (successor)) /* It's above us. Subtract as | |
7ce503fd | 1479 | we ascend. */ |
9c79dd1b JA |
1480 | { |
1481 | if (AM_LEFT_CHILD (successor)) | |
1482 | { | |
439d5cb4 | 1483 | successor = INTERVAL_PARENT (successor); |
9c79dd1b JA |
1484 | delete_interval (i); |
1485 | return successor; | |
1486 | } | |
1487 | ||
439d5cb4 | 1488 | successor = INTERVAL_PARENT (successor); |
9c79dd1b JA |
1489 | successor->total_length -= absorb; |
1490 | } | |
1491 | ||
1492 | /* This must be the rightmost or last interval and cannot | |
7ce503fd | 1493 | be merged right. The caller should have known. */ |
9c79dd1b JA |
1494 | abort (); |
1495 | } | |
1496 | \f | |
1497 | /* Merge interval I with its lexicographic predecessor. The resulting | |
1498 | interval is returned, and has the properties of the original predecessor. | |
1499 | The properties of I are lost. Interval node I is removed from the tree. | |
1500 | ||
1501 | IMPORTANT: | |
7ce503fd | 1502 | The caller must verify that this is not the first (leftmost) interval. */ |
9c79dd1b JA |
1503 | |
1504 | INTERVAL | |
1505 | merge_interval_left (i) | |
1506 | register INTERVAL i; | |
1507 | { | |
1508 | register int absorb = LENGTH (i); | |
1509 | register INTERVAL predecessor; | |
1510 | ||
7ce503fd | 1511 | /* Zero out this interval. */ |
9c79dd1b JA |
1512 | i->total_length -= absorb; |
1513 | ||
7ce503fd | 1514 | /* Find the preceding interval. */ |
9c79dd1b | 1515 | if (! NULL_LEFT_CHILD (i)) /* It's below us. Go down, |
7ce503fd | 1516 | adding ABSORB as we go. */ |
9c79dd1b JA |
1517 | { |
1518 | predecessor = i->left; | |
1519 | while (! NULL_RIGHT_CHILD (predecessor)) | |
1520 | { | |
1521 | predecessor->total_length += absorb; | |
1522 | predecessor = predecessor->right; | |
1523 | } | |
1524 | ||
1525 | predecessor->total_length += absorb; | |
1526 | delete_interval (i); | |
1527 | return predecessor; | |
1528 | } | |
1529 | ||
1530 | predecessor = i; | |
1531 | while (! NULL_PARENT (predecessor)) /* It's above us. Go up, | |
7ce503fd | 1532 | subtracting ABSORB. */ |
9c79dd1b JA |
1533 | { |
1534 | if (AM_RIGHT_CHILD (predecessor)) | |
1535 | { | |
439d5cb4 | 1536 | predecessor = INTERVAL_PARENT (predecessor); |
9c79dd1b JA |
1537 | delete_interval (i); |
1538 | return predecessor; | |
1539 | } | |
1540 | ||
439d5cb4 | 1541 | predecessor = INTERVAL_PARENT (predecessor); |
9c79dd1b JA |
1542 | predecessor->total_length -= absorb; |
1543 | } | |
a50699fd | 1544 | |
9c79dd1b | 1545 | /* This must be the leftmost or first interval and cannot |
7ce503fd | 1546 | be merged left. The caller should have known. */ |
9c79dd1b JA |
1547 | abort (); |
1548 | } | |
1549 | \f | |
1d1d7ba0 JA |
1550 | /* Make an exact copy of interval tree SOURCE which descends from |
1551 | PARENT. This is done by recursing through SOURCE, copying | |
1552 | the current interval and its properties, and then adjusting | |
7ce503fd | 1553 | the pointers of the copy. */ |
1d1d7ba0 | 1554 | |
a50699fd JA |
1555 | static INTERVAL |
1556 | reproduce_tree (source, parent) | |
1557 | INTERVAL source, parent; | |
1558 | { | |
1559 | register INTERVAL t = make_interval (); | |
1560 | ||
1561 | bcopy (source, t, INTERVAL_SIZE); | |
1562 | copy_properties (source, t); | |
439d5cb4 KR |
1563 | SET_INTERVAL_PARENT (t, parent); |
1564 | if (! NULL_LEFT_CHILD (source)) | |
1565 | t->left = reproduce_tree (source->left, t); | |
1566 | if (! NULL_RIGHT_CHILD (source)) | |
1567 | t->right = reproduce_tree (source->right, t); | |
1568 | ||
1569 | return t; | |
1570 | } | |
1571 | ||
1572 | static INTERVAL | |
1573 | reproduce_tree_obj (source, parent) | |
1574 | INTERVAL source; | |
1575 | Lisp_Object parent; | |
1576 | { | |
1577 | register INTERVAL t = make_interval (); | |
1578 | ||
1579 | bcopy (source, t, INTERVAL_SIZE); | |
1580 | copy_properties (source, t); | |
1581 | SET_INTERVAL_OBJECT (t, parent); | |
a50699fd JA |
1582 | if (! NULL_LEFT_CHILD (source)) |
1583 | t->left = reproduce_tree (source->left, t); | |
1584 | if (! NULL_RIGHT_CHILD (source)) | |
1585 | t->right = reproduce_tree (source->right, t); | |
1586 | ||
1587 | return t; | |
1588 | } | |
1589 | ||
24e3d3bf JB |
1590 | #if 0 |
1591 | /* Nobody calls this. Perhaps it's a vestige of an earlier design. */ | |
1592 | ||
1d1d7ba0 JA |
1593 | /* Make a new interval of length LENGTH starting at START in the |
1594 | group of intervals INTERVALS, which is actually an interval tree. | |
1595 | Returns the new interval. | |
1596 | ||
1597 | Generate an error if the new positions would overlap an existing | |
7ce503fd | 1598 | interval. */ |
1d1d7ba0 | 1599 | |
a50699fd JA |
1600 | static INTERVAL |
1601 | make_new_interval (intervals, start, length) | |
1602 | INTERVAL intervals; | |
1603 | int start, length; | |
1604 | { | |
1605 | INTERVAL slot; | |
1606 | ||
1607 | slot = find_interval (intervals, start); | |
1608 | if (start + length > slot->position + LENGTH (slot)) | |
1609 | error ("Interval would overlap"); | |
1610 | ||
1611 | if (start == slot->position && length == LENGTH (slot)) | |
1612 | return slot; | |
1613 | ||
1614 | if (slot->position == start) | |
1615 | { | |
7ce503fd | 1616 | /* New right node. */ |
2bc7a79b | 1617 | split_interval_right (slot, length); |
a50699fd JA |
1618 | return slot; |
1619 | } | |
1620 | ||
1621 | if (slot->position + LENGTH (slot) == start + length) | |
1622 | { | |
7ce503fd | 1623 | /* New left node. */ |
2bc7a79b | 1624 | split_interval_left (slot, LENGTH (slot) - length); |
a50699fd JA |
1625 | return slot; |
1626 | } | |
1627 | ||
7ce503fd | 1628 | /* Convert interval SLOT into three intervals. */ |
2bc7a79b JB |
1629 | split_interval_left (slot, start - slot->position); |
1630 | split_interval_right (slot, length); | |
a50699fd JA |
1631 | return slot; |
1632 | } | |
24e3d3bf | 1633 | #endif |
294efdbe | 1634 | \f |
9c79dd1b | 1635 | /* Insert the intervals of SOURCE into BUFFER at POSITION. |
0b79989f | 1636 | LENGTH is the length of the text in SOURCE. |
a50699fd | 1637 | |
944d4e4b KH |
1638 | The `position' field of the SOURCE intervals is assumed to be |
1639 | consistent with its parent; therefore, SOURCE must be an | |
1640 | interval tree made with copy_interval or must be the whole | |
1641 | tree of a buffer or a string. | |
1642 | ||
2bc7a79b JB |
1643 | This is used in insdel.c when inserting Lisp_Strings into the |
1644 | buffer. The text corresponding to SOURCE is already in the buffer | |
1645 | when this is called. The intervals of new tree are a copy of those | |
1646 | belonging to the string being inserted; intervals are never | |
1647 | shared. | |
a50699fd | 1648 | |
0b79989f RS |
1649 | If the inserted text had no intervals associated, and we don't |
1650 | want to inherit the surrounding text's properties, this function | |
a50699fd | 1651 | simply returns -- offset_intervals should handle placing the |
90ba40fc | 1652 | text in the correct interval, depending on the sticky bits. |
a50699fd JA |
1653 | |
1654 | If the inserted text had properties (intervals), then there are two | |
1655 | cases -- either insertion happened in the middle of some interval, | |
1656 | or between two intervals. | |
1657 | ||
1658 | If the text goes into the middle of an interval, then new | |
1659 | intervals are created in the middle with only the properties of | |
1660 | the new text, *unless* the macro MERGE_INSERTIONS is true, in | |
1661 | which case the new text has the union of its properties and those | |
1662 | of the text into which it was inserted. | |
1663 | ||
1664 | If the text goes between two intervals, then if neither interval | |
90ba40fc JA |
1665 | had its appropriate sticky property set (front_sticky, rear_sticky), |
1666 | the new text has only its properties. If one of the sticky properties | |
a50699fd | 1667 | is set, then the new text "sticks" to that region and its properties |
eb8c3be9 | 1668 | depend on merging as above. If both the preceding and succeeding |
90ba40fc JA |
1669 | intervals to the new text are "sticky", then the new text retains |
1670 | only its properties, as if neither sticky property were set. Perhaps | |
a50699fd | 1671 | we should consider merging all three sets of properties onto the new |
7ce503fd | 1672 | text... */ |
a50699fd JA |
1673 | |
1674 | void | |
0b79989f | 1675 | graft_intervals_into_buffer (source, position, length, buffer, inherit) |
9c79dd1b | 1676 | INTERVAL source; |
0b79989f | 1677 | int position, length; |
9c79dd1b | 1678 | struct buffer *buffer; |
7ea69158 | 1679 | int inherit; |
a50699fd | 1680 | { |
323a7ad4 | 1681 | register INTERVAL under, over, this, prev; |
e5d967c9 | 1682 | register INTERVAL tree; |
a50699fd | 1683 | |
e5d967c9 RS |
1684 | tree = BUF_INTERVALS (buffer); |
1685 | ||
34e096ed RS |
1686 | /* If the new text has no properties, then with inheritance it |
1687 | becomes part of whatever interval it was inserted into. | |
1688 | To prevent inheritance, we must clear out the properties | |
1689 | of the newly inserted text. */ | |
9c79dd1b | 1690 | if (NULL_INTERVAL_P (source)) |
0b79989f RS |
1691 | { |
1692 | Lisp_Object buf; | |
201ffa57 | 1693 | if (!inherit && !NULL_INTERVAL_P (tree) && length > 0) |
0b79989f | 1694 | { |
55cfc731 | 1695 | XSETBUFFER (buf, buffer); |
34e096ed RS |
1696 | set_text_properties_1 (make_number (position), |
1697 | make_number (position + length), | |
1698 | Qnil, buf, 0); | |
0b79989f | 1699 | } |
e5d967c9 RS |
1700 | if (! NULL_INTERVAL_P (BUF_INTERVALS (buffer))) |
1701 | BUF_INTERVALS (buffer) = balance_an_interval (BUF_INTERVALS (buffer)); | |
0b79989f RS |
1702 | return; |
1703 | } | |
a50699fd | 1704 | |
a50699fd JA |
1705 | if (NULL_INTERVAL_P (tree)) |
1706 | { | |
1707 | /* The inserted text constitutes the whole buffer, so | |
7ce503fd | 1708 | simply copy over the interval structure. */ |
2bc7a79b | 1709 | if ((BUF_Z (buffer) - BUF_BEG (buffer)) == TOTAL_LENGTH (source)) |
a50699fd | 1710 | { |
b8e4857c | 1711 | Lisp_Object buf; |
55cfc731 | 1712 | XSETBUFFER (buf, buffer); |
439d5cb4 | 1713 | BUF_INTERVALS (buffer) = reproduce_tree_obj (source, buf); |
944d4e4b KH |
1714 | BUF_INTERVALS (buffer)->position = 1; |
1715 | ||
1716 | /* Explicitly free the old tree here? */ | |
a50699fd JA |
1717 | |
1718 | return; | |
1719 | } | |
1720 | ||
1721 | /* Create an interval tree in which to place a copy | |
7ce503fd | 1722 | of the intervals of the inserted string. */ |
a50699fd | 1723 | { |
249a6da9 | 1724 | Lisp_Object buf; |
55cfc731 | 1725 | XSETBUFFER (buf, buffer); |
323a7ad4 | 1726 | tree = create_root_interval (buf); |
a50699fd JA |
1727 | } |
1728 | } | |
7ea69158 RS |
1729 | else if (TOTAL_LENGTH (tree) == TOTAL_LENGTH (source)) |
1730 | /* If the buffer contains only the new string, but | |
1731 | there was already some interval tree there, then it may be | |
1732 | some zero length intervals. Eventually, do something clever | |
1733 | about inserting properly. For now, just waste the old intervals. */ | |
1734 | { | |
439d5cb4 | 1735 | BUF_INTERVALS (buffer) = reproduce_tree (source, INTERVAL_PARENT (tree)); |
944d4e4b | 1736 | BUF_INTERVALS (buffer)->position = 1; |
7ea69158 | 1737 | /* Explicitly free the old tree here. */ |
a50699fd | 1738 | |
7ea69158 RS |
1739 | return; |
1740 | } | |
1741 | /* Paranoia -- the text has already been added, so this buffer | |
1742 | should be of non-zero length. */ | |
1743 | else if (TOTAL_LENGTH (tree) == 0) | |
1744 | abort (); | |
a50699fd JA |
1745 | |
1746 | this = under = find_interval (tree, position); | |
1747 | if (NULL_INTERVAL_P (under)) /* Paranoia */ | |
1748 | abort (); | |
944d4e4b | 1749 | over = find_interval (source, interval_start_pos (source)); |
a50699fd | 1750 | |
323a7ad4 RS |
1751 | /* Here for insertion in the middle of an interval. |
1752 | Split off an equivalent interval to the right, | |
1753 | then don't bother with it any more. */ | |
a50699fd | 1754 | |
323a7ad4 | 1755 | if (position > under->position) |
a50699fd JA |
1756 | { |
1757 | INTERVAL end_unchanged | |
2bc7a79b | 1758 | = split_interval_left (this, position - under->position); |
a50699fd | 1759 | copy_properties (under, end_unchanged); |
323a7ad4 | 1760 | under->position = position; |
a50699fd | 1761 | } |
323a7ad4 RS |
1762 | else |
1763 | { | |
f56b42ac KH |
1764 | /* This call may have some effect because previous_interval may |
1765 | update `position' fields of intervals. Thus, don't ignore it | |
1766 | for the moment. Someone please tell me the truth (K.Handa). */ | |
323a7ad4 | 1767 | prev = previous_interval (under); |
f56b42ac KH |
1768 | #if 0 |
1769 | /* But, this code surely has no effect. And, anyway, | |
1770 | END_NONSTICKY_P is unreliable now. */ | |
7ce503fd | 1771 | if (prev && !END_NONSTICKY_P (prev)) |
323a7ad4 | 1772 | prev = 0; |
f56b42ac | 1773 | #endif /* 0 */ |
323a7ad4 RS |
1774 | } |
1775 | ||
1776 | /* Insertion is now at beginning of UNDER. */ | |
a50699fd | 1777 | |
323a7ad4 | 1778 | /* The inserted text "sticks" to the interval `under', |
7ce503fd RS |
1779 | which means it gets those properties. |
1780 | The properties of under are the result of | |
8e6208c5 | 1781 | adjust_intervals_for_insertion, so stickiness has |
7ce503fd | 1782 | already been taken care of. */ |
7d0393cf | 1783 | |
a50699fd JA |
1784 | while (! NULL_INTERVAL_P (over)) |
1785 | { | |
767809fb | 1786 | if (LENGTH (over) < LENGTH (under)) |
7ce503fd RS |
1787 | { |
1788 | this = split_interval_left (under, LENGTH (over)); | |
1789 | copy_properties (under, this); | |
1790 | } | |
323a7ad4 RS |
1791 | else |
1792 | this = under; | |
a50699fd | 1793 | copy_properties (over, this); |
7ea69158 | 1794 | if (inherit) |
7ce503fd RS |
1795 | merge_properties (over, this); |
1796 | else | |
1797 | copy_properties (over, this); | |
a50699fd JA |
1798 | over = next_interval (over); |
1799 | } | |
1800 | ||
e5d967c9 RS |
1801 | if (! NULL_INTERVAL_P (BUF_INTERVALS (buffer))) |
1802 | BUF_INTERVALS (buffer) = balance_an_interval (BUF_INTERVALS (buffer)); | |
a50699fd JA |
1803 | return; |
1804 | } | |
1805 | ||
5cae0ec6 RS |
1806 | /* Get the value of property PROP from PLIST, |
1807 | which is the plist of an interval. | |
7d0393cf | 1808 | We check for direct properties, for categories with property PROP, |
06d92327 | 1809 | and for PROP appearing on the default-text-properties list. */ |
5cae0ec6 RS |
1810 | |
1811 | Lisp_Object | |
323a7ad4 RS |
1812 | textget (plist, prop) |
1813 | Lisp_Object plist; | |
1814 | register Lisp_Object prop; | |
1815 | { | |
91b53904 | 1816 | return lookup_char_property (plist, prop, 1); |
948fe32d CW |
1817 | } |
1818 | ||
1819 | Lisp_Object | |
1820 | lookup_char_property (plist, prop, textprop) | |
1821 | Lisp_Object plist; | |
1822 | register Lisp_Object prop; | |
1823 | int textprop; | |
1824 | { | |
1825 | register Lisp_Object tail, fallback = Qnil; | |
323a7ad4 | 1826 | |
91b53904 | 1827 | for (tail = plist; CONSP (tail); tail = Fcdr (XCDR (tail))) |
323a7ad4 RS |
1828 | { |
1829 | register Lisp_Object tem; | |
91b53904 | 1830 | tem = XCAR (tail); |
323a7ad4 | 1831 | if (EQ (prop, tem)) |
91b53904 | 1832 | return Fcar (XCDR (tail)); |
5cae0ec6 | 1833 | if (EQ (tem, Qcategory)) |
5dd6606e | 1834 | { |
91b53904 | 1835 | tem = Fcar (XCDR (tail)); |
5dd6606e RS |
1836 | if (SYMBOLP (tem)) |
1837 | fallback = Fget (tem, prop); | |
1838 | } | |
323a7ad4 | 1839 | } |
5cae0ec6 | 1840 | |
70743ff1 BG |
1841 | if (! NILP (fallback)) |
1842 | return fallback; | |
948fe32d CW |
1843 | /* Check for alternative properties */ |
1844 | tail = Fassq (prop, Vchar_property_alias_alist); | |
1845 | if (NILP (tail)) | |
1846 | return tail; | |
1847 | tail = XCDR (tail); | |
91b53904 SM |
1848 | for (; NILP (fallback) && CONSP (tail); tail = XCDR (tail)) |
1849 | fallback = Fplist_get (plist, XCAR (tail)); | |
948fe32d CW |
1850 | if (textprop && NILP (fallback) && CONSP (Vdefault_text_properties)) |
1851 | fallback = Fplist_get (Vdefault_text_properties, prop); | |
1852 | return fallback; | |
323a7ad4 | 1853 | } |
7ce503fd | 1854 | |
294efdbe | 1855 | \f |
ef1900f3 RS |
1856 | /* Set point "temporarily", without checking any text properties. */ |
1857 | ||
1858 | INLINE void | |
1859 | temp_set_point (buffer, charpos) | |
1860 | struct buffer *buffer; | |
1861 | int charpos; | |
1862 | { | |
1863 | temp_set_point_both (buffer, charpos, | |
1864 | buf_charpos_to_bytepos (buffer, charpos)); | |
1865 | } | |
1866 | ||
1867 | /* Set point in BUFFER "temporarily" to CHARPOS, which corresponds to | |
1868 | byte position BYTEPOS. */ | |
1869 | ||
1870 | INLINE void | |
1871 | temp_set_point_both (buffer, charpos, bytepos) | |
2189766e | 1872 | int charpos, bytepos; |
ef1900f3 RS |
1873 | struct buffer *buffer; |
1874 | { | |
1875 | /* In a single-byte buffer, the two positions must be equal. */ | |
1876 | if (BUF_ZV (buffer) == BUF_ZV_BYTE (buffer) | |
1877 | && charpos != bytepos) | |
1878 | abort (); | |
1879 | ||
1880 | if (charpos > bytepos) | |
1881 | abort (); | |
1882 | ||
1883 | if (charpos > BUF_ZV (buffer) || charpos < BUF_BEGV (buffer)) | |
1884 | abort (); | |
1885 | ||
1886 | BUF_PT_BYTE (buffer) = bytepos; | |
1887 | BUF_PT (buffer) = charpos; | |
1888 | } | |
1889 | ||
7d0393cf | 1890 | /* Set point in BUFFER to CHARPOS. If the target position is |
f65013b0 | 1891 | before an intangible character, move to an ok place. */ |
a50699fd JA |
1892 | |
1893 | void | |
ef1900f3 | 1894 | set_point (buffer, charpos) |
a50699fd | 1895 | register struct buffer *buffer; |
ef1900f3 RS |
1896 | register int charpos; |
1897 | { | |
1898 | set_point_both (buffer, charpos, buf_charpos_to_bytepos (buffer, charpos)); | |
1899 | } | |
1900 | ||
f0dcf801 MB |
1901 | /* If there's an invisible character at position POS + TEST_OFFS in the |
1902 | current buffer, and the invisible property has a `stickiness' such that | |
1903 | inserting a character at position POS would inherit the property it, | |
1904 | return POS + ADJ, otherwise return POS. If TEST_INTANG is non-zero, | |
1905 | then intangibility is required as well as invisibleness. | |
1906 | ||
1907 | TEST_OFFS should be either 0 or -1, and ADJ should be either 1 or -1. | |
1908 | ||
1909 | Note that `stickiness' is determined by overlay marker insertion types, | |
7d0393cf | 1910 | if the invisible property comes from an overlay. */ |
f0dcf801 MB |
1911 | |
1912 | static int | |
1913 | adjust_for_invis_intang (pos, test_offs, adj, test_intang) | |
1914 | int pos, test_offs, adj, test_intang; | |
1915 | { | |
1916 | Lisp_Object invis_propval, invis_overlay; | |
1917 | Lisp_Object test_pos; | |
1918 | ||
1919 | if ((adj < 0 && pos + adj < BEGV) || (adj > 0 && pos + adj > ZV)) | |
1920 | /* POS + ADJ would be beyond the buffer bounds, so do no adjustment. */ | |
1921 | return pos; | |
1922 | ||
1923 | test_pos = make_number (pos + test_offs); | |
1924 | ||
1925 | invis_propval | |
1926 | = get_char_property_and_overlay (test_pos, Qinvisible, Qnil, | |
1927 | &invis_overlay); | |
1928 | ||
1929 | if ((!test_intang | |
1930 | || ! NILP (Fget_char_property (test_pos, Qintangible, Qnil))) | |
1931 | && TEXT_PROP_MEANS_INVISIBLE (invis_propval) | |
1932 | /* This next test is true if the invisible property has a stickiness | |
1933 | such that an insertion at POS would inherit it. */ | |
1934 | && (NILP (invis_overlay) | |
1935 | /* Invisible property is from a text-property. */ | |
1936 | ? (text_property_stickiness (Qinvisible, make_number (pos)) | |
1937 | == (test_offs == 0 ? 1 : -1)) | |
1938 | /* Invisible property is from an overlay. */ | |
1939 | : (test_offs == 0 | |
1940 | ? XMARKER (OVERLAY_START (invis_overlay))->insertion_type == 0 | |
1941 | : XMARKER (OVERLAY_END (invis_overlay))->insertion_type == 1))) | |
1942 | pos += adj; | |
1943 | ||
1944 | return pos; | |
1945 | } | |
1946 | ||
ef1900f3 | 1947 | /* Set point in BUFFER to CHARPOS, which corresponds to byte |
7d0393cf | 1948 | position BYTEPOS. If the target position is |
ef1900f3 RS |
1949 | before an intangible character, move to an ok place. */ |
1950 | ||
1951 | void | |
1952 | set_point_both (buffer, charpos, bytepos) | |
1953 | register struct buffer *buffer; | |
2189766e | 1954 | register int charpos, bytepos; |
a50699fd | 1955 | { |
e39adcda | 1956 | register INTERVAL to, from, toprev, fromprev; |
a50699fd | 1957 | int buffer_point; |
e5d967c9 | 1958 | int old_position = BUF_PT (buffer); |
ef1900f3 | 1959 | int backwards = (charpos < old_position ? 1 : 0); |
580fae94 RS |
1960 | int have_overlays; |
1961 | int original_position; | |
a50699fd | 1962 | |
b6a0ebc3 RS |
1963 | buffer->point_before_scroll = Qnil; |
1964 | ||
ef1900f3 | 1965 | if (charpos == BUF_PT (buffer)) |
a50699fd JA |
1966 | return; |
1967 | ||
ef1900f3 RS |
1968 | /* In a single-byte buffer, the two positions must be equal. */ |
1969 | if (BUF_ZV (buffer) == BUF_ZV_BYTE (buffer) | |
1970 | && charpos != bytepos) | |
1971 | abort (); | |
1972 | ||
62056764 JB |
1973 | /* Check this now, before checking if the buffer has any intervals. |
1974 | That way, we can catch conditions which break this sanity check | |
1975 | whether or not there are intervals in the buffer. */ | |
ef1900f3 | 1976 | if (charpos > BUF_ZV (buffer) || charpos < BUF_BEGV (buffer)) |
62056764 JB |
1977 | abort (); |
1978 | ||
580fae94 RS |
1979 | have_overlays = (! NILP (buffer->overlays_before) |
1980 | || ! NILP (buffer->overlays_after)); | |
1981 | ||
1982 | /* If we have no text properties and overlays, | |
1983 | then we can do it quickly. */ | |
1984 | if (NULL_INTERVAL_P (BUF_INTERVALS (buffer)) && ! have_overlays) | |
a50699fd | 1985 | { |
ef1900f3 | 1986 | temp_set_point_both (buffer, charpos, bytepos); |
a50699fd JA |
1987 | return; |
1988 | } | |
1989 | ||
ef1900f3 RS |
1990 | /* Set TO to the interval containing the char after CHARPOS, |
1991 | and TOPREV to the interval containing the char before CHARPOS. | |
323a7ad4 | 1992 | Either one may be null. They may be equal. */ |
ef1900f3 RS |
1993 | to = find_interval (BUF_INTERVALS (buffer), charpos); |
1994 | if (charpos == BUF_BEGV (buffer)) | |
294efdbe | 1995 | toprev = 0; |
ef1900f3 | 1996 | else if (to && to->position == charpos) |
323a7ad4 | 1997 | toprev = previous_interval (to); |
323a7ad4 RS |
1998 | else |
1999 | toprev = to; | |
2000 | ||
294efdbe RS |
2001 | buffer_point = (BUF_PT (buffer) == BUF_ZV (buffer) |
2002 | ? BUF_ZV (buffer) - 1 | |
323a7ad4 | 2003 | : BUF_PT (buffer)); |
9c79dd1b | 2004 | |
323a7ad4 RS |
2005 | /* Set FROM to the interval containing the char after PT, |
2006 | and FROMPREV to the interval containing the char before PT. | |
2007 | Either one may be null. They may be equal. */ | |
7ce503fd | 2008 | /* We could cache this and save time. */ |
e5d967c9 | 2009 | from = find_interval (BUF_INTERVALS (buffer), buffer_point); |
7ce503fd | 2010 | if (buffer_point == BUF_BEGV (buffer)) |
294efdbe | 2011 | fromprev = 0; |
580fae94 | 2012 | else if (from && from->position == BUF_PT (buffer)) |
323a7ad4 RS |
2013 | fromprev = previous_interval (from); |
2014 | else if (buffer_point != BUF_PT (buffer)) | |
2015 | fromprev = from, from = 0; | |
2016 | else | |
2017 | fromprev = from; | |
a50699fd | 2018 | |
7ce503fd | 2019 | /* Moving within an interval. */ |
580fae94 RS |
2020 | if (to == from && toprev == fromprev && INTERVAL_VISIBLE_P (to) |
2021 | && ! have_overlays) | |
a50699fd | 2022 | { |
ef1900f3 | 2023 | temp_set_point_both (buffer, charpos, bytepos); |
a50699fd JA |
2024 | return; |
2025 | } | |
2026 | ||
ef1900f3 | 2027 | original_position = charpos; |
580fae94 | 2028 | |
5eabb4e7 RS |
2029 | /* If the new position is between two intangible characters |
2030 | with the same intangible property value, | |
2031 | move forward or backward until a change in that property. */ | |
580fae94 RS |
2032 | if (NILP (Vinhibit_point_motion_hooks) |
2033 | && ((! NULL_INTERVAL_P (to) && ! NULL_INTERVAL_P (toprev)) | |
b827a9e3 RS |
2034 | || have_overlays) |
2035 | /* Intangibility never stops us from positioning at the beginning | |
2036 | or end of the buffer, so don't bother checking in that case. */ | |
ef1900f3 | 2037 | && charpos != BEGV && charpos != ZV) |
a50699fd | 2038 | { |
580fae94 | 2039 | Lisp_Object pos; |
f0dcf801 | 2040 | Lisp_Object intangible_propval; |
580fae94 | 2041 | |
d5219de5 RS |
2042 | if (backwards) |
2043 | { | |
f0dcf801 MB |
2044 | /* If the preceeding character is both intangible and invisible, |
2045 | and the invisible property is `rear-sticky', perturb it so | |
2046 | that the search starts one character earlier -- this ensures | |
2047 | that point can never move to the end of an invisible/ | |
2048 | intangible/rear-sticky region. */ | |
2049 | charpos = adjust_for_invis_intang (charpos, -1, -1, 1); | |
1d14d232 | 2050 | |
f0dcf801 | 2051 | XSETINT (pos, charpos); |
5eabb4e7 RS |
2052 | |
2053 | /* If following char is intangible, | |
2054 | skip back over all chars with matching intangible property. */ | |
1d14d232 RS |
2055 | |
2056 | intangible_propval = Fget_char_property (pos, Qintangible, Qnil); | |
2057 | ||
5eabb4e7 | 2058 | if (! NILP (intangible_propval)) |
1d14d232 RS |
2059 | { |
2060 | while (XINT (pos) > BUF_BEGV (buffer) | |
2061 | && EQ (Fget_char_property (make_number (XINT (pos) - 1), | |
2062 | Qintangible, Qnil), | |
2063 | intangible_propval)) | |
2064 | pos = Fprevious_char_property_change (pos, Qnil); | |
f0dcf801 MB |
2065 | |
2066 | /* Set CHARPOS from POS, and if the final intangible character | |
2067 | that we skipped over is also invisible, and the invisible | |
2068 | property is `front-sticky', perturb it to be one character | |
2069 | earlier -- this ensures that point can never move to the | |
2070 | beginning of an invisible/intangible/front-sticky region. */ | |
2071 | charpos = adjust_for_invis_intang (XINT (pos), 0, -1, 0); | |
1d14d232 | 2072 | } |
d5219de5 | 2073 | } |
0df8950e | 2074 | else |
d5219de5 | 2075 | { |
f0dcf801 MB |
2076 | /* If the following character is both intangible and invisible, |
2077 | and the invisible property is `front-sticky', perturb it so | |
2078 | that the search starts one character later -- this ensures | |
2079 | that point can never move to the beginning of an | |
2080 | invisible/intangible/front-sticky region. */ | |
2081 | charpos = adjust_for_invis_intang (charpos, 0, 1, 1); | |
2082 | ||
2083 | XSETINT (pos, charpos); | |
2084 | ||
1d14d232 RS |
2085 | /* If preceding char is intangible, |
2086 | skip forward over all chars with matching intangible property. */ | |
2087 | ||
ef1900f3 | 2088 | intangible_propval = Fget_char_property (make_number (charpos - 1), |
580fae94 | 2089 | Qintangible, Qnil); |
5eabb4e7 | 2090 | |
5eabb4e7 | 2091 | if (! NILP (intangible_propval)) |
1d14d232 RS |
2092 | { |
2093 | while (XINT (pos) < BUF_ZV (buffer) | |
2094 | && EQ (Fget_char_property (pos, Qintangible, Qnil), | |
2095 | intangible_propval)) | |
2096 | pos = Fnext_char_property_change (pos, Qnil); | |
580fae94 | 2097 | |
f0dcf801 MB |
2098 | /* Set CHARPOS from POS, and if the final intangible character |
2099 | that we skipped over is also invisible, and the invisible | |
2100 | property is `rear-sticky', perturb it to be one character | |
2101 | later -- this ensures that point can never move to the | |
2102 | end of an invisible/intangible/rear-sticky region. */ | |
2103 | charpos = adjust_for_invis_intang (XINT (pos), -1, 1, 0); | |
1d14d232 | 2104 | } |
d5219de5 | 2105 | } |
580fae94 | 2106 | |
ef1900f3 | 2107 | bytepos = buf_charpos_to_bytepos (buffer, charpos); |
580fae94 RS |
2108 | } |
2109 | ||
ef1900f3 | 2110 | if (charpos != original_position) |
580fae94 | 2111 | { |
ef1900f3 RS |
2112 | /* Set TO to the interval containing the char after CHARPOS, |
2113 | and TOPREV to the interval containing the char before CHARPOS. | |
580fae94 | 2114 | Either one may be null. They may be equal. */ |
ef1900f3 RS |
2115 | to = find_interval (BUF_INTERVALS (buffer), charpos); |
2116 | if (charpos == BUF_BEGV (buffer)) | |
580fae94 | 2117 | toprev = 0; |
ef1900f3 | 2118 | else if (to && to->position == charpos) |
580fae94 RS |
2119 | toprev = previous_interval (to); |
2120 | else | |
2121 | toprev = to; | |
a50699fd | 2122 | } |
323a7ad4 | 2123 | |
5eabb4e7 RS |
2124 | /* Here TO is the interval after the stopping point |
2125 | and TOPREV is the interval before the stopping point. | |
2126 | One or the other may be null. */ | |
2127 | ||
ef1900f3 | 2128 | temp_set_point_both (buffer, charpos, bytepos); |
a50699fd | 2129 | |
d7e3e52b JA |
2130 | /* We run point-left and point-entered hooks here, iff the |
2131 | two intervals are not equivalent. These hooks take | |
323a7ad4 | 2132 | (old_point, new_point) as arguments. */ |
ddd931ff RS |
2133 | if (NILP (Vinhibit_point_motion_hooks) |
2134 | && (! intervals_equal (from, to) | |
2135 | || ! intervals_equal (fromprev, toprev))) | |
9c79dd1b | 2136 | { |
323a7ad4 RS |
2137 | Lisp_Object leave_after, leave_before, enter_after, enter_before; |
2138 | ||
2139 | if (fromprev) | |
2140 | leave_after = textget (fromprev->plist, Qpoint_left); | |
2141 | else | |
2142 | leave_after = Qnil; | |
2143 | if (from) | |
2144 | leave_before = textget (from->plist, Qpoint_left); | |
2145 | else | |
2146 | leave_before = Qnil; | |
2147 | ||
2148 | if (toprev) | |
2149 | enter_after = textget (toprev->plist, Qpoint_entered); | |
2150 | else | |
2151 | enter_after = Qnil; | |
2152 | if (to) | |
2153 | enter_before = textget (to->plist, Qpoint_entered); | |
2154 | else | |
2155 | enter_before = Qnil; | |
9c79dd1b | 2156 | |
323a7ad4 | 2157 | if (! EQ (leave_before, enter_before) && !NILP (leave_before)) |
4dcb3ee3 | 2158 | call2 (leave_before, make_number (old_position), |
ef1900f3 | 2159 | make_number (charpos)); |
323a7ad4 | 2160 | if (! EQ (leave_after, enter_after) && !NILP (leave_after)) |
4dcb3ee3 | 2161 | call2 (leave_after, make_number (old_position), |
ef1900f3 | 2162 | make_number (charpos)); |
9c79dd1b | 2163 | |
323a7ad4 | 2164 | if (! EQ (enter_before, leave_before) && !NILP (enter_before)) |
4dcb3ee3 | 2165 | call2 (enter_before, make_number (old_position), |
ef1900f3 | 2166 | make_number (charpos)); |
323a7ad4 | 2167 | if (! EQ (enter_after, leave_after) && !NILP (enter_after)) |
4dcb3ee3 | 2168 | call2 (enter_after, make_number (old_position), |
ef1900f3 | 2169 | make_number (charpos)); |
9c79dd1b | 2170 | } |
a50699fd | 2171 | } |
294efdbe | 2172 | \f |
a7fa233f RS |
2173 | /* Move point to POSITION, unless POSITION is inside an intangible |
2174 | segment that reaches all the way to point. */ | |
2175 | ||
2176 | void | |
2177 | move_if_not_intangible (position) | |
2178 | int position; | |
2179 | { | |
2180 | Lisp_Object pos; | |
2181 | Lisp_Object intangible_propval; | |
2182 | ||
2183 | XSETINT (pos, position); | |
2184 | ||
2185 | if (! NILP (Vinhibit_point_motion_hooks)) | |
2186 | /* If intangible is inhibited, always move point to POSITION. */ | |
2187 | ; | |
2e34157c | 2188 | else if (PT < position && XINT (pos) < ZV) |
a7fa233f RS |
2189 | { |
2190 | /* We want to move forward, so check the text before POSITION. */ | |
2191 | ||
2192 | intangible_propval = Fget_char_property (pos, | |
2193 | Qintangible, Qnil); | |
2194 | ||
2195 | /* If following char is intangible, | |
2196 | skip back over all chars with matching intangible property. */ | |
2197 | if (! NILP (intangible_propval)) | |
2198 | while (XINT (pos) > BEGV | |
2199 | && EQ (Fget_char_property (make_number (XINT (pos) - 1), | |
2200 | Qintangible, Qnil), | |
2201 | intangible_propval)) | |
2202 | pos = Fprevious_char_property_change (pos, Qnil); | |
2203 | } | |
2e34157c | 2204 | else if (XINT (pos) > BEGV) |
a7fa233f RS |
2205 | { |
2206 | /* We want to move backward, so check the text after POSITION. */ | |
2207 | ||
2208 | intangible_propval = Fget_char_property (make_number (XINT (pos) - 1), | |
2209 | Qintangible, Qnil); | |
2210 | ||
2211 | /* If following char is intangible, | |
887f2a2d | 2212 | skip forward over all chars with matching intangible property. */ |
a7fa233f RS |
2213 | if (! NILP (intangible_propval)) |
2214 | while (XINT (pos) < ZV | |
2215 | && EQ (Fget_char_property (pos, Qintangible, Qnil), | |
2216 | intangible_propval)) | |
2217 | pos = Fnext_char_property_change (pos, Qnil); | |
2218 | ||
2219 | } | |
2220 | ||
7d0393cf | 2221 | /* If the whole stretch between PT and POSITION isn't intangible, |
a7fa233f RS |
2222 | try moving to POSITION (which means we actually move farther |
2223 | if POSITION is inside of intangible text). */ | |
2224 | ||
2225 | if (XINT (pos) != PT) | |
2226 | SET_PT (position); | |
2227 | } | |
2228 | \f | |
f56b42ac KH |
2229 | /* If text at position POS has property PROP, set *VAL to the property |
2230 | value, *START and *END to the beginning and end of a region that | |
2231 | has the same property, and return 1. Otherwise return 0. | |
2232 | ||
2233 | OBJECT is the string or buffer to look for the property in; | |
2234 | nil means the current buffer. */ | |
2235 | ||
2236 | int | |
2237 | get_property_and_range (pos, prop, val, start, end, object) | |
2238 | int pos; | |
2239 | Lisp_Object prop, *val; | |
2240 | int *start, *end; | |
2241 | Lisp_Object object; | |
2242 | { | |
2243 | INTERVAL i, prev, next; | |
2244 | ||
2245 | if (NILP (object)) | |
2246 | i = find_interval (BUF_INTERVALS (current_buffer), pos); | |
2247 | else if (BUFFERP (object)) | |
2248 | i = find_interval (BUF_INTERVALS (XBUFFER (object)), pos); | |
2249 | else if (STRINGP (object)) | |
d5db4077 | 2250 | i = find_interval (STRING_INTERVALS (object), pos); |
f56b42ac KH |
2251 | else |
2252 | abort (); | |
2253 | ||
2254 | if (NULL_INTERVAL_P (i) || (i->position + LENGTH (i) <= pos)) | |
2255 | return 0; | |
2256 | *val = textget (i->plist, prop); | |
2257 | if (NILP (*val)) | |
2258 | return 0; | |
2259 | ||
2260 | next = i; /* remember it in advance */ | |
2261 | prev = previous_interval (i); | |
2262 | while (! NULL_INTERVAL_P (prev) | |
2263 | && EQ (*val, textget (prev->plist, prop))) | |
2264 | i = prev, prev = previous_interval (prev); | |
2265 | *start = i->position; | |
2266 | ||
2267 | next = next_interval (i); | |
7d0393cf | 2268 | while (! NULL_INTERVAL_P (next) |
f56b42ac KH |
2269 | && EQ (*val, textget (next->plist, prop))) |
2270 | i = next, next = next_interval (next); | |
2271 | *end = i->position + LENGTH (i); | |
2272 | ||
2273 | return 1; | |
2274 | } | |
2275 | \f | |
2b4b027f GM |
2276 | /* Return the proper local keymap TYPE for position POSITION in |
2277 | BUFFER; TYPE should be one of `keymap' or `local-map'. Use the map | |
2278 | specified by the PROP property, if any. Otherwise, if TYPE is | |
2279 | `local-map' use BUFFER's local map. */ | |
5cae0ec6 RS |
2280 | |
2281 | Lisp_Object | |
6a7dccef | 2282 | get_local_map (position, buffer, type) |
5cae0ec6 RS |
2283 | register int position; |
2284 | register struct buffer *buffer; | |
2b4b027f | 2285 | Lisp_Object type; |
5cae0ec6 | 2286 | { |
f94ecad1 | 2287 | Lisp_Object prop, lispy_position, lispy_buffer; |
ef1900f3 | 2288 | int old_begv, old_zv, old_begv_byte, old_zv_byte; |
5cae0ec6 | 2289 | |
7ce503fd | 2290 | /* Perhaps we should just change `position' to the limit. */ |
5cae0ec6 RS |
2291 | if (position > BUF_Z (buffer) || position < BUF_BEG (buffer)) |
2292 | abort (); | |
2293 | ||
0f7a5fda KH |
2294 | /* Ignore narrowing, so that a local map continues to be valid even if |
2295 | the visible region contains no characters and hence no properties. */ | |
2296 | old_begv = BUF_BEGV (buffer); | |
2297 | old_zv = BUF_ZV (buffer); | |
ef1900f3 RS |
2298 | old_begv_byte = BUF_BEGV_BYTE (buffer); |
2299 | old_zv_byte = BUF_ZV_BYTE (buffer); | |
0f7a5fda KH |
2300 | BUF_BEGV (buffer) = BUF_BEG (buffer); |
2301 | BUF_ZV (buffer) = BUF_Z (buffer); | |
ef1900f3 RS |
2302 | BUF_BEGV_BYTE (buffer) = BUF_BEG_BYTE (buffer); |
2303 | BUF_ZV_BYTE (buffer) = BUF_Z_BYTE (buffer); | |
0f7a5fda KH |
2304 | |
2305 | /* There are no properties at the end of the buffer, so in that case | |
2306 | check for a local map on the last character of the buffer instead. */ | |
2307 | if (position == BUF_Z (buffer) && BUF_Z (buffer) > BUF_BEG (buffer)) | |
2308 | --position; | |
2309 | XSETFASTINT (lispy_position, position); | |
2310 | XSETBUFFER (lispy_buffer, buffer); | |
2b4b027f | 2311 | prop = Fget_char_property (lispy_position, type, lispy_buffer); |
0f7a5fda KH |
2312 | |
2313 | BUF_BEGV (buffer) = old_begv; | |
2314 | BUF_ZV (buffer) = old_zv; | |
ef1900f3 RS |
2315 | BUF_BEGV_BYTE (buffer) = old_begv_byte; |
2316 | BUF_ZV_BYTE (buffer) = old_zv_byte; | |
5cae0ec6 RS |
2317 | |
2318 | /* Use the local map only if it is valid. */ | |
02067692 SM |
2319 | prop = get_keymap (prop, 0, 0); |
2320 | if (CONSP (prop)) | |
5cae0ec6 RS |
2321 | return prop; |
2322 | ||
2b4b027f | 2323 | if (EQ (type, Qkeymap)) |
6a7dccef DL |
2324 | return Qnil; |
2325 | else | |
2326 | return buffer->keymap; | |
5cae0ec6 RS |
2327 | } |
2328 | \f | |
9c79dd1b | 2329 | /* Produce an interval tree reflecting the intervals in |
944d4e4b KH |
2330 | TREE from START to START + LENGTH. |
2331 | The new interval tree has no parent and has a starting-position of 0. */ | |
a50699fd | 2332 | |
7b1d5b85 | 2333 | INTERVAL |
a50699fd JA |
2334 | copy_intervals (tree, start, length) |
2335 | INTERVAL tree; | |
2336 | int start, length; | |
2337 | { | |
2338 | register INTERVAL i, new, t; | |
95e3e1ef | 2339 | register int got, prevlen; |
a50699fd JA |
2340 | |
2341 | if (NULL_INTERVAL_P (tree) || length <= 0) | |
2342 | return NULL_INTERVAL; | |
2343 | ||
2344 | i = find_interval (tree, start); | |
2345 | if (NULL_INTERVAL_P (i) || LENGTH (i) == 0) | |
2346 | abort (); | |
2347 | ||
7ce503fd | 2348 | /* If there is only one interval and it's the default, return nil. */ |
a50699fd JA |
2349 | if ((start - i->position + 1 + length) < LENGTH (i) |
2350 | && DEFAULT_INTERVAL_P (i)) | |
2351 | return NULL_INTERVAL; | |
2352 | ||
2353 | new = make_interval (); | |
944d4e4b | 2354 | new->position = 0; |
a50699fd | 2355 | got = (LENGTH (i) - (start - i->position)); |
9c79dd1b | 2356 | new->total_length = length; |
a50699fd JA |
2357 | copy_properties (i, new); |
2358 | ||
2359 | t = new; | |
95e3e1ef | 2360 | prevlen = got; |
a50699fd JA |
2361 | while (got < length) |
2362 | { | |
2363 | i = next_interval (i); | |
2bc7a79b | 2364 | t = split_interval_right (t, prevlen); |
a50699fd | 2365 | copy_properties (i, t); |
95e3e1ef RS |
2366 | prevlen = LENGTH (i); |
2367 | got += prevlen; | |
a50699fd JA |
2368 | } |
2369 | ||
4314dea4 | 2370 | return balance_an_interval (new); |
a50699fd JA |
2371 | } |
2372 | ||
7ce503fd | 2373 | /* Give STRING the properties of BUFFER from POSITION to LENGTH. */ |
a50699fd | 2374 | |
d7e3e52b | 2375 | INLINE void |
a50699fd | 2376 | copy_intervals_to_string (string, buffer, position, length) |
46d8a55b RS |
2377 | Lisp_Object string; |
2378 | struct buffer *buffer; | |
a50699fd JA |
2379 | int position, length; |
2380 | { | |
46d8a55b | 2381 | INTERVAL interval_copy = copy_intervals (BUF_INTERVALS (buffer), |
a50699fd JA |
2382 | position, length); |
2383 | if (NULL_INTERVAL_P (interval_copy)) | |
2384 | return; | |
2385 | ||
439d5cb4 | 2386 | SET_INTERVAL_OBJECT (interval_copy, string); |
b13738b6 | 2387 | STRING_SET_INTERVALS (string, interval_copy); |
a50699fd | 2388 | } |
d8638d30 | 2389 | \f |
944d4e4b | 2390 | /* Return 1 if strings S1 and S2 have identical properties; 0 otherwise. |
d8638d30 RS |
2391 | Assume they have identical characters. */ |
2392 | ||
2393 | int | |
2394 | compare_string_intervals (s1, s2) | |
2395 | Lisp_Object s1, s2; | |
2396 | { | |
2397 | INTERVAL i1, i2; | |
944d4e4b | 2398 | int pos = 0; |
d5db4077 | 2399 | int end = SCHARS (s1); |
d8638d30 | 2400 | |
d5db4077 KR |
2401 | i1 = find_interval (STRING_INTERVALS (s1), 0); |
2402 | i2 = find_interval (STRING_INTERVALS (s2), 0); | |
d8638d30 RS |
2403 | |
2404 | while (pos < end) | |
2405 | { | |
2406 | /* Determine how far we can go before we reach the end of I1 or I2. */ | |
2407 | int len1 = (i1 != 0 ? INTERVAL_LAST_POS (i1) : end) - pos; | |
2408 | int len2 = (i2 != 0 ? INTERVAL_LAST_POS (i2) : end) - pos; | |
2409 | int distance = min (len1, len2); | |
2410 | ||
2411 | /* If we ever find a mismatch between the strings, | |
2412 | they differ. */ | |
2413 | if (! intervals_equal (i1, i2)) | |
2414 | return 0; | |
2415 | ||
2416 | /* Advance POS till the end of the shorter interval, | |
2417 | and advance one or both interval pointers for the new position. */ | |
2418 | pos += distance; | |
2419 | if (len1 == distance) | |
2420 | i1 = next_interval (i1); | |
2421 | if (len2 == distance) | |
2422 | i2 = next_interval (i2); | |
2423 | } | |
2424 | return 1; | |
2425 | } | |
37f26f3c | 2426 | \f |
37f26f3c RS |
2427 | /* Recursively adjust interval I in the current buffer |
2428 | for setting enable_multibyte_characters to MULTI_FLAG. | |
2429 | The range of interval I is START ... END in characters, | |
2430 | START_BYTE ... END_BYTE in bytes. */ | |
2431 | ||
2432 | static void | |
2433 | set_intervals_multibyte_1 (i, multi_flag, start, start_byte, end, end_byte) | |
2434 | INTERVAL i; | |
2435 | int multi_flag; | |
2436 | int start, start_byte, end, end_byte; | |
2437 | { | |
37f26f3c RS |
2438 | /* Fix the length of this interval. */ |
2439 | if (multi_flag) | |
2440 | i->total_length = end - start; | |
2441 | else | |
2442 | i->total_length = end_byte - start_byte; | |
2443 | ||
2444 | /* Recursively fix the length of the subintervals. */ | |
2445 | if (i->left) | |
2446 | { | |
2447 | int left_end, left_end_byte; | |
2448 | ||
2449 | if (multi_flag) | |
2450 | { | |
2451 | left_end_byte = start_byte + LEFT_TOTAL_LENGTH (i); | |
2452 | left_end = BYTE_TO_CHAR (left_end_byte); | |
2453 | } | |
2454 | else | |
2455 | { | |
2456 | left_end = start + LEFT_TOTAL_LENGTH (i); | |
2457 | left_end_byte = CHAR_TO_BYTE (left_end); | |
2458 | } | |
2459 | ||
2460 | set_intervals_multibyte_1 (i->left, multi_flag, start, start_byte, | |
2461 | left_end, left_end_byte); | |
2462 | } | |
2463 | if (i->right) | |
2464 | { | |
2465 | int right_start_byte, right_start; | |
2466 | ||
2467 | if (multi_flag) | |
2468 | { | |
2469 | right_start_byte = end_byte - RIGHT_TOTAL_LENGTH (i); | |
2470 | right_start = BYTE_TO_CHAR (right_start_byte); | |
2471 | } | |
2472 | else | |
2473 | { | |
2474 | right_start = end - RIGHT_TOTAL_LENGTH (i); | |
2475 | right_start_byte = CHAR_TO_BYTE (right_start); | |
2476 | } | |
2477 | ||
2478 | set_intervals_multibyte_1 (i->right, multi_flag, | |
2479 | right_start, right_start_byte, | |
2480 | end, end_byte); | |
2481 | } | |
2482 | } | |
d2f7a802 | 2483 | |
24cef261 RS |
2484 | /* Update the intervals of the current buffer |
2485 | to fit the contents as multibyte (if MULTI_FLAG is 1) | |
2486 | or to fit them as non-multibyte (if MULTI_FLAG is 0). */ | |
2487 | ||
2488 | void | |
2489 | set_intervals_multibyte (multi_flag) | |
2490 | int multi_flag; | |
2491 | { | |
2492 | if (BUF_INTERVALS (current_buffer)) | |
2493 | set_intervals_multibyte_1 (BUF_INTERVALS (current_buffer), multi_flag, | |
2494 | BEG, BEG_BYTE, Z, Z_BYTE); | |
2495 | } |