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