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