Commit | Line | Data |
---|---|---|
b45433b3 | 1 | /* Buffer insertion/deletion and gap motion for GNU Emacs. |
f8c25f1b | 2 | Copyright (C) 1985, 1986, 1993, 1994, 1995 Free Software Foundation, Inc. |
b45433b3 JB |
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 | |
7c938215 | 8 | the Free Software Foundation; either version 2, or (at your option) |
b45433b3 JB |
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. */ | |
b45433b3 JB |
20 | |
21 | ||
18160b98 | 22 | #include <config.h> |
b45433b3 | 23 | #include "lisp.h" |
679194a6 | 24 | #include "intervals.h" |
b45433b3 | 25 | #include "buffer.h" |
469ff680 | 26 | #include "charset.h" |
b45433b3 | 27 | #include "window.h" |
d014bf88 | 28 | #include "blockinput.h" |
b45433b3 | 29 | |
d206af14 RS |
30 | #ifndef NULL |
31 | #define NULL 0 | |
32 | #endif | |
33 | ||
14f6194b RS |
34 | #define min(x, y) ((x) < (y) ? (x) : (y)) |
35 | ||
395ec62e | 36 | static void insert_from_string_1 (); |
ef29f213 | 37 | static void insert_from_buffer_1 (); |
2bcaed71 KH |
38 | static void gap_left (); |
39 | static void gap_right (); | |
40 | static void adjust_markers (); | |
a27a38d8 | 41 | static void adjust_point (); |
395ec62e | 42 | |
fb2e7d14 RS |
43 | Lisp_Object Fcombine_after_change_execute (); |
44 | ||
45 | /* Non-nil means don't call the after-change-functions right away, | |
46 | just record an element in Vcombine_after_change_calls_list. */ | |
47 | Lisp_Object Vcombine_after_change_calls; | |
48 | ||
49 | /* List of elements of the form (BEG-UNCHANGED END-UNCHANGED CHANGE-AMOUNT) | |
50 | describing changes which happened while combine_after_change_calls | |
51 | was nonzero. We use this to decide how to call them | |
52 | once the deferral ends. | |
53 | ||
54 | In each element. | |
55 | BEG-UNCHANGED is the number of chars before the changed range. | |
56 | END-UNCHANGED is the number of chars after the changed range, | |
57 | and CHANGE-AMOUNT is the number of characters inserted by the change | |
58 | (negative for a deletion). */ | |
59 | Lisp_Object combine_after_change_list; | |
60 | ||
61 | /* Buffer which combine_after_change_list is about. */ | |
62 | Lisp_Object combine_after_change_buffer; | |
63 | ||
b45433b3 JB |
64 | /* Move gap to position `pos'. |
65 | Note that this can quit! */ | |
66 | ||
c660b094 | 67 | void |
b45433b3 JB |
68 | move_gap (pos) |
69 | int pos; | |
70 | { | |
71 | if (pos < GPT) | |
72 | gap_left (pos, 0); | |
73 | else if (pos > GPT) | |
74 | gap_right (pos); | |
75 | } | |
76 | ||
77 | /* Move the gap to POS, which is less than the current GPT. | |
78 | If NEWGAP is nonzero, then don't update beg_unchanged and end_unchanged. */ | |
79 | ||
2bcaed71 | 80 | static void |
b45433b3 JB |
81 | gap_left (pos, newgap) |
82 | register int pos; | |
83 | int newgap; | |
84 | { | |
85 | register unsigned char *to, *from; | |
86 | register int i; | |
87 | int new_s1; | |
88 | ||
89 | pos--; | |
90 | ||
91 | if (!newgap) | |
92 | { | |
894ab630 RS |
93 | if (unchanged_modified == MODIFF |
94 | && overlay_unchanged_modified == OVERLAY_MODIFF) | |
b45433b3 JB |
95 | { |
96 | beg_unchanged = pos; | |
97 | end_unchanged = Z - pos - 1; | |
98 | } | |
99 | else | |
100 | { | |
101 | if (Z - GPT < end_unchanged) | |
102 | end_unchanged = Z - GPT; | |
103 | if (pos < beg_unchanged) | |
104 | beg_unchanged = pos; | |
105 | } | |
106 | } | |
107 | ||
108 | i = GPT; | |
109 | to = GAP_END_ADDR; | |
110 | from = GPT_ADDR; | |
111 | new_s1 = GPT - BEG; | |
112 | ||
113 | /* Now copy the characters. To move the gap down, | |
114 | copy characters up. */ | |
115 | ||
116 | while (1) | |
117 | { | |
118 | /* I gets number of characters left to copy. */ | |
119 | i = new_s1 - pos; | |
120 | if (i == 0) | |
121 | break; | |
122 | /* If a quit is requested, stop copying now. | |
123 | Change POS to be where we have actually moved the gap to. */ | |
124 | if (QUITP) | |
125 | { | |
126 | pos = new_s1; | |
127 | break; | |
128 | } | |
129 | /* Move at most 32000 chars before checking again for a quit. */ | |
130 | if (i > 32000) | |
131 | i = 32000; | |
132 | #ifdef GAP_USE_BCOPY | |
133 | if (i >= 128 | |
134 | /* bcopy is safe if the two areas of memory do not overlap | |
135 | or on systems where bcopy is always safe for moving upward. */ | |
136 | && (BCOPY_UPWARD_SAFE | |
137 | || to - from >= 128)) | |
138 | { | |
139 | /* If overlap is not safe, avoid it by not moving too many | |
140 | characters at once. */ | |
141 | if (!BCOPY_UPWARD_SAFE && i > to - from) | |
142 | i = to - from; | |
143 | new_s1 -= i; | |
144 | from -= i, to -= i; | |
145 | bcopy (from, to, i); | |
146 | } | |
147 | else | |
148 | #endif | |
149 | { | |
150 | new_s1 -= i; | |
151 | while (--i >= 0) | |
152 | *--to = *--from; | |
153 | } | |
154 | } | |
155 | ||
156 | /* Adjust markers, and buffer data structure, to put the gap at POS. | |
157 | POS is where the loop above stopped, which may be what was specified | |
158 | or may be where a quit was detected. */ | |
159 | adjust_markers (pos + 1, GPT, GAP_SIZE); | |
160 | GPT = pos + 1; | |
469ff680 | 161 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
b45433b3 JB |
162 | QUIT; |
163 | } | |
164 | ||
2bcaed71 | 165 | static void |
b45433b3 JB |
166 | gap_right (pos) |
167 | register int pos; | |
168 | { | |
169 | register unsigned char *to, *from; | |
170 | register int i; | |
171 | int new_s1; | |
172 | ||
173 | pos--; | |
174 | ||
894ab630 RS |
175 | if (unchanged_modified == MODIFF |
176 | && overlay_unchanged_modified == OVERLAY_MODIFF) | |
177 | ||
b45433b3 JB |
178 | { |
179 | beg_unchanged = pos; | |
180 | end_unchanged = Z - pos - 1; | |
181 | } | |
182 | else | |
183 | { | |
184 | if (Z - pos - 1 < end_unchanged) | |
185 | end_unchanged = Z - pos - 1; | |
186 | if (GPT - BEG < beg_unchanged) | |
187 | beg_unchanged = GPT - BEG; | |
188 | } | |
189 | ||
190 | i = GPT; | |
191 | from = GAP_END_ADDR; | |
192 | to = GPT_ADDR; | |
193 | new_s1 = GPT - 1; | |
194 | ||
195 | /* Now copy the characters. To move the gap up, | |
196 | copy characters down. */ | |
197 | ||
198 | while (1) | |
199 | { | |
200 | /* I gets number of characters left to copy. */ | |
201 | i = pos - new_s1; | |
202 | if (i == 0) | |
203 | break; | |
204 | /* If a quit is requested, stop copying now. | |
205 | Change POS to be where we have actually moved the gap to. */ | |
206 | if (QUITP) | |
207 | { | |
208 | pos = new_s1; | |
209 | break; | |
210 | } | |
211 | /* Move at most 32000 chars before checking again for a quit. */ | |
212 | if (i > 32000) | |
213 | i = 32000; | |
214 | #ifdef GAP_USE_BCOPY | |
215 | if (i >= 128 | |
216 | /* bcopy is safe if the two areas of memory do not overlap | |
217 | or on systems where bcopy is always safe for moving downward. */ | |
218 | && (BCOPY_DOWNWARD_SAFE | |
219 | || from - to >= 128)) | |
220 | { | |
221 | /* If overlap is not safe, avoid it by not moving too many | |
222 | characters at once. */ | |
223 | if (!BCOPY_DOWNWARD_SAFE && i > from - to) | |
224 | i = from - to; | |
225 | new_s1 += i; | |
226 | bcopy (from, to, i); | |
227 | from += i, to += i; | |
228 | } | |
229 | else | |
230 | #endif | |
231 | { | |
232 | new_s1 += i; | |
233 | while (--i >= 0) | |
234 | *to++ = *from++; | |
235 | } | |
236 | } | |
237 | ||
238 | adjust_markers (GPT + GAP_SIZE, pos + 1 + GAP_SIZE, - GAP_SIZE); | |
239 | GPT = pos + 1; | |
469ff680 | 240 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
b45433b3 JB |
241 | QUIT; |
242 | } | |
243 | ||
8948d317 RS |
244 | /* Add AMOUNT to the position of every marker in the current buffer |
245 | whose current position is between FROM (exclusive) and TO (inclusive). | |
246 | ||
b45433b3 JB |
247 | Also, any markers past the outside of that interval, in the direction |
248 | of adjustment, are first moved back to the near end of the interval | |
8948d317 RS |
249 | and then adjusted by AMOUNT. |
250 | ||
251 | When the latter adjustment is done, if AMOUNT is negative, | |
252 | we record the adjustment for undo. (This case happens only for | |
253 | deletion.) */ | |
b45433b3 | 254 | |
2bcaed71 | 255 | static void |
b45433b3 JB |
256 | adjust_markers (from, to, amount) |
257 | register int from, to, amount; | |
258 | { | |
259 | Lisp_Object marker; | |
260 | register struct Lisp_Marker *m; | |
261 | register int mpos; | |
262 | ||
9fbf87cd | 263 | marker = BUF_MARKERS (current_buffer); |
b45433b3 | 264 | |
d427b66a | 265 | while (!NILP (marker)) |
b45433b3 JB |
266 | { |
267 | m = XMARKER (marker); | |
268 | mpos = m->bufpos; | |
269 | if (amount > 0) | |
270 | { | |
271 | if (mpos > to && mpos < to + amount) | |
272 | mpos = to + amount; | |
273 | } | |
274 | else | |
275 | { | |
8948d317 RS |
276 | /* Here's the case where a marker is inside text being deleted. |
277 | AMOUNT can be negative for gap motion, too, | |
278 | but then this range contains no markers. */ | |
b45433b3 | 279 | if (mpos > from + amount && mpos <= from) |
8948d317 | 280 | { |
9856e218 RS |
281 | int before = mpos; |
282 | int after = from + amount; | |
283 | ||
284 | mpos = after; | |
285 | ||
286 | /* Compute the before and after positions | |
287 | as buffer positions. */ | |
288 | if (before > GPT + GAP_SIZE) | |
289 | before -= GAP_SIZE; | |
290 | else if (before > GPT) | |
291 | before = GPT; | |
292 | ||
293 | if (after > GPT + GAP_SIZE) | |
294 | after -= GAP_SIZE; | |
295 | else if (after > GPT) | |
296 | after = GPT; | |
297 | ||
298 | record_marker_adjustment (marker, after - before); | |
8948d317 | 299 | } |
b45433b3 JB |
300 | } |
301 | if (mpos > from && mpos <= to) | |
302 | mpos += amount; | |
303 | m->bufpos = mpos; | |
304 | marker = m->chain; | |
305 | } | |
306 | } | |
a27a38d8 | 307 | |
beecb55b RS |
308 | /* Adjust markers whose insertion-type is t |
309 | for an insertion of AMOUNT characters at POS. */ | |
310 | ||
311 | static void | |
312 | adjust_markers_for_insert (pos, amount) | |
313 | register int pos, amount; | |
314 | { | |
315 | Lisp_Object marker; | |
469ff680 | 316 | int adjusted = 0; |
beecb55b RS |
317 | |
318 | marker = BUF_MARKERS (current_buffer); | |
319 | ||
320 | while (!NILP (marker)) | |
321 | { | |
322 | register struct Lisp_Marker *m = XMARKER (marker); | |
323 | if (m->insertion_type && m->bufpos == pos) | |
469ff680 KH |
324 | { |
325 | m->bufpos += amount; | |
326 | adjusted = 1; | |
327 | } | |
beecb55b RS |
328 | marker = m->chain; |
329 | } | |
469ff680 KH |
330 | if (adjusted) |
331 | /* Adjusting only markers whose insertion-type is t may result in | |
332 | disordered overlays in the slot `overlays_before'. */ | |
333 | fix_overlays_before (current_buffer, pos, pos + amount); | |
beecb55b RS |
334 | } |
335 | ||
a27a38d8 KH |
336 | /* Add the specified amount to point. This is used only when the value |
337 | of point changes due to an insert or delete; it does not represent | |
338 | a conceptual change in point as a marker. In particular, point is | |
339 | not crossing any interval boundaries, so there's no need to use the | |
340 | usual SET_PT macro. In fact it would be incorrect to do so, because | |
8e6208c5 | 341 | either the old or the new value of point is out of sync with the |
a27a38d8 KH |
342 | current set of intervals. */ |
343 | static void | |
344 | adjust_point (amount) | |
29eb72ac | 345 | int amount; |
a27a38d8 | 346 | { |
9fbf87cd | 347 | BUF_PT (current_buffer) += amount; |
a27a38d8 | 348 | } |
b45433b3 JB |
349 | \f |
350 | /* Make the gap INCREMENT characters longer. */ | |
351 | ||
c660b094 | 352 | void |
b45433b3 JB |
353 | make_gap (increment) |
354 | int increment; | |
355 | { | |
356 | unsigned char *result; | |
357 | Lisp_Object tem; | |
358 | int real_gap_loc; | |
359 | int old_gap_size; | |
360 | ||
361 | /* If we have to get more space, get enough to last a while. */ | |
362 | increment += 2000; | |
363 | ||
94056516 RS |
364 | /* Don't allow a buffer size that won't fit in an int |
365 | even if it will fit in a Lisp integer. | |
366 | That won't work because so many places use `int'. */ | |
367 | ||
14f6194b | 368 | if (Z - BEG + GAP_SIZE + increment |
68be917d | 369 | >= ((unsigned) 1 << (min (BITS_PER_INT, VALBITS) - 1))) |
14f6194b | 370 | error ("Buffer exceeds maximum size"); |
94056516 | 371 | |
9ac0d9e0 | 372 | BLOCK_INPUT; |
469ff680 KH |
373 | /* We allocate extra 1-byte `\0' at the tail for anchoring a search. */ |
374 | result = BUFFER_REALLOC (BEG_ADDR, (Z - BEG + GAP_SIZE + increment + 1)); | |
9ac0d9e0 | 375 | |
b45433b3 | 376 | if (result == 0) |
270c2138 RS |
377 | { |
378 | UNBLOCK_INPUT; | |
379 | memory_full (); | |
380 | } | |
381 | ||
382 | /* We can't unblock until the new address is properly stored. */ | |
b45433b3 | 383 | BEG_ADDR = result; |
270c2138 | 384 | UNBLOCK_INPUT; |
b45433b3 JB |
385 | |
386 | /* Prevent quitting in move_gap. */ | |
387 | tem = Vinhibit_quit; | |
388 | Vinhibit_quit = Qt; | |
389 | ||
390 | real_gap_loc = GPT; | |
391 | old_gap_size = GAP_SIZE; | |
392 | ||
393 | /* Call the newly allocated space a gap at the end of the whole space. */ | |
394 | GPT = Z + GAP_SIZE; | |
395 | GAP_SIZE = increment; | |
396 | ||
397 | /* Move the new gap down to be consecutive with the end of the old one. | |
398 | This adjusts the markers properly too. */ | |
399 | gap_left (real_gap_loc + old_gap_size, 1); | |
400 | ||
401 | /* Now combine the two into one large gap. */ | |
402 | GAP_SIZE += old_gap_size; | |
403 | GPT = real_gap_loc; | |
404 | ||
469ff680 KH |
405 | /* Put an anchor. */ |
406 | *(Z_ADDR) = 0; | |
407 | ||
b45433b3 JB |
408 | Vinhibit_quit = tem; |
409 | } | |
410 | \f | |
411 | /* Insert a string of specified length before point. | |
ef29f213 KH |
412 | DO NOT use this for the contents of a Lisp string or a Lisp buffer! |
413 | prepare_to_modify_buffer could relocate the text. */ | |
b45433b3 | 414 | |
c660b094 | 415 | void |
b45433b3 JB |
416 | insert (string, length) |
417 | register unsigned char *string; | |
418 | register length; | |
419 | { | |
395ec62e KH |
420 | if (length > 0) |
421 | { | |
c660b094 | 422 | insert_1 (string, length, 0, 1); |
cd11ef31 RS |
423 | signal_after_change (PT-length, 0, length); |
424 | } | |
425 | } | |
426 | ||
c660b094 | 427 | void |
cd11ef31 RS |
428 | insert_and_inherit (string, length) |
429 | register unsigned char *string; | |
430 | register length; | |
431 | { | |
432 | if (length > 0) | |
433 | { | |
c660b094 | 434 | insert_1 (string, length, 1, 1); |
2bcaed71 | 435 | signal_after_change (PT-length, 0, length); |
395ec62e KH |
436 | } |
437 | } | |
b45433b3 | 438 | |
c660b094 KH |
439 | void |
440 | insert_1 (string, length, inherit, prepare) | |
395ec62e | 441 | register unsigned char *string; |
c660b094 KH |
442 | register int length; |
443 | int inherit, prepare; | |
395ec62e KH |
444 | { |
445 | register Lisp_Object temp; | |
b45433b3 | 446 | |
c660b094 | 447 | if (prepare) |
d206af14 | 448 | prepare_to_modify_buffer (PT, PT, NULL); |
b45433b3 | 449 | |
2bcaed71 KH |
450 | if (PT != GPT) |
451 | move_gap (PT); | |
b45433b3 JB |
452 | if (GAP_SIZE < length) |
453 | make_gap (length - GAP_SIZE); | |
454 | ||
2bcaed71 | 455 | record_insert (PT, length); |
b45433b3 JB |
456 | MODIFF++; |
457 | ||
458 | bcopy (string, GPT_ADDR, length); | |
459 | ||
648c4c55 | 460 | #ifdef USE_TEXT_PROPERTIES |
9fbf87cd | 461 | if (BUF_INTERVALS (current_buffer) != 0) |
648c4c55 RS |
462 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES. */ |
463 | offset_intervals (current_buffer, PT, length); | |
464 | #endif | |
679194a6 | 465 | |
b45433b3 JB |
466 | GAP_SIZE -= length; |
467 | GPT += length; | |
468 | ZV += length; | |
469 | Z += length; | |
469ff680 | 470 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
adde4858 | 471 | adjust_overlays_for_insert (PT, length); |
beecb55b | 472 | adjust_markers_for_insert (PT, length); |
a27a38d8 | 473 | adjust_point (length); |
cd11ef31 | 474 | |
648c4c55 | 475 | #ifdef USE_TEXT_PROPERTIES |
9fbf87cd | 476 | if (!inherit && BUF_INTERVALS (current_buffer) != 0) |
cd11ef31 RS |
477 | Fset_text_properties (make_number (PT - length), make_number (PT), |
478 | Qnil, Qnil); | |
648c4c55 | 479 | #endif |
b45433b3 JB |
480 | } |
481 | ||
679194a6 JA |
482 | /* Insert the part of the text of STRING, a Lisp object assumed to be |
483 | of type string, consisting of the LENGTH characters starting at | |
484 | position POS. If the text of STRING has properties, they are absorbed | |
485 | into the buffer. | |
486 | ||
487 | It does not work to use `insert' for this, because a GC could happen | |
7e1ea612 JB |
488 | before we bcopy the stuff into the buffer, and relocate the string |
489 | without insert noticing. */ | |
679194a6 | 490 | |
c660b094 | 491 | void |
9391e591 | 492 | insert_from_string (string, pos, length, inherit) |
b45433b3 JB |
493 | Lisp_Object string; |
494 | register int pos, length; | |
9391e591 | 495 | int inherit; |
395ec62e KH |
496 | { |
497 | if (length > 0) | |
498 | { | |
499 | insert_from_string_1 (string, pos, length, inherit); | |
2bcaed71 | 500 | signal_after_change (PT-length, 0, length); |
395ec62e KH |
501 | } |
502 | } | |
503 | ||
504 | static void | |
505 | insert_from_string_1 (string, pos, length, inherit) | |
506 | Lisp_Object string; | |
507 | register int pos, length; | |
508 | int inherit; | |
b45433b3 JB |
509 | { |
510 | register Lisp_Object temp; | |
511 | struct gcpro gcpro1; | |
512 | ||
b45433b3 | 513 | /* Make sure point-max won't overflow after this insertion. */ |
eb7db9e6 | 514 | XSETINT (temp, length + Z); |
b45433b3 JB |
515 | if (length + Z != XINT (temp)) |
516 | error ("maximum buffer size exceeded"); | |
517 | ||
518 | GCPRO1 (string); | |
d206af14 | 519 | prepare_to_modify_buffer (PT, PT, NULL); |
b45433b3 | 520 | |
2bcaed71 KH |
521 | if (PT != GPT) |
522 | move_gap (PT); | |
b45433b3 JB |
523 | if (GAP_SIZE < length) |
524 | make_gap (length - GAP_SIZE); | |
525 | ||
2bcaed71 | 526 | record_insert (PT, length); |
b45433b3 JB |
527 | MODIFF++; |
528 | UNGCPRO; | |
529 | ||
530 | bcopy (XSTRING (string)->data, GPT_ADDR, length); | |
531 | ||
679194a6 | 532 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ |
2bcaed71 | 533 | offset_intervals (current_buffer, PT, length); |
679194a6 | 534 | |
b45433b3 JB |
535 | GAP_SIZE -= length; |
536 | GPT += length; | |
537 | ZV += length; | |
538 | Z += length; | |
469ff680 | 539 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
adde4858 | 540 | adjust_overlays_for_insert (PT, length); |
beecb55b | 541 | adjust_markers_for_insert (PT, length); |
679194a6 JA |
542 | |
543 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ | |
2bcaed71 | 544 | graft_intervals_into_buffer (XSTRING (string)->intervals, PT, length, |
9391e591 | 545 | current_buffer, inherit); |
679194a6 | 546 | |
a27a38d8 | 547 | adjust_point (length); |
b45433b3 JB |
548 | } |
549 | ||
ef29f213 KH |
550 | /* Insert text from BUF, starting at POS and having length LENGTH, into the |
551 | current buffer. If the text in BUF has properties, they are absorbed | |
552 | into the current buffer. | |
553 | ||
554 | It does not work to use `insert' for this, because a malloc could happen | |
555 | and relocate BUF's text before the bcopy happens. */ | |
556 | ||
557 | void | |
558 | insert_from_buffer (buf, pos, length, inherit) | |
559 | struct buffer *buf; | |
560 | int pos, length; | |
561 | int inherit; | |
562 | { | |
563 | if (length > 0) | |
564 | { | |
565 | insert_from_buffer_1 (buf, pos, length, inherit); | |
566 | signal_after_change (PT-length, 0, length); | |
567 | } | |
568 | } | |
569 | ||
570 | static void | |
571 | insert_from_buffer_1 (buf, pos, length, inherit) | |
572 | struct buffer *buf; | |
573 | int pos, length; | |
574 | int inherit; | |
575 | { | |
576 | register Lisp_Object temp; | |
577 | int chunk; | |
578 | ||
579 | /* Make sure point-max won't overflow after this insertion. */ | |
580 | XSETINT (temp, length + Z); | |
581 | if (length + Z != XINT (temp)) | |
582 | error ("maximum buffer size exceeded"); | |
583 | ||
d206af14 | 584 | prepare_to_modify_buffer (PT, PT, NULL); |
ef29f213 KH |
585 | |
586 | if (PT != GPT) | |
587 | move_gap (PT); | |
588 | if (GAP_SIZE < length) | |
589 | make_gap (length - GAP_SIZE); | |
590 | ||
591 | record_insert (PT, length); | |
592 | MODIFF++; | |
593 | ||
594 | if (pos < BUF_GPT (buf)) | |
595 | { | |
61bd0e9c RS |
596 | chunk = BUF_GPT (buf) - pos; |
597 | if (chunk > length) | |
598 | chunk = length; | |
ef29f213 KH |
599 | bcopy (BUF_CHAR_ADDRESS (buf, pos), GPT_ADDR, chunk); |
600 | } | |
601 | else | |
602 | chunk = 0; | |
603 | if (chunk < length) | |
604 | bcopy (BUF_CHAR_ADDRESS (buf, pos + chunk), | |
605 | GPT_ADDR + chunk, length - chunk); | |
606 | ||
607 | #ifdef USE_TEXT_PROPERTIES | |
9fbf87cd | 608 | if (BUF_INTERVALS (current_buffer) != 0) |
ef29f213 KH |
609 | offset_intervals (current_buffer, PT, length); |
610 | #endif | |
611 | ||
612 | GAP_SIZE -= length; | |
613 | GPT += length; | |
614 | ZV += length; | |
615 | Z += length; | |
469ff680 | 616 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
adde4858 | 617 | adjust_overlays_for_insert (PT, length); |
beecb55b | 618 | adjust_markers_for_insert (PT, length); |
ef29f213 KH |
619 | adjust_point (length); |
620 | ||
621 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ | |
9fbf87cd RS |
622 | graft_intervals_into_buffer (copy_intervals (BUF_INTERVALS (buf), |
623 | pos, length), | |
ef29f213 KH |
624 | PT - length, length, current_buffer, inherit); |
625 | } | |
626 | ||
b45433b3 JB |
627 | /* Insert the character C before point */ |
628 | ||
629 | void | |
630 | insert_char (c) | |
469ff680 | 631 | int c; |
b45433b3 | 632 | { |
469ff680 KH |
633 | unsigned char workbuf[4], *str; |
634 | int len = CHAR_STRING (c, workbuf, str); | |
635 | ||
636 | insert (str, len); | |
b45433b3 JB |
637 | } |
638 | ||
639 | /* Insert the null-terminated string S before point */ | |
640 | ||
641 | void | |
642 | insert_string (s) | |
643 | char *s; | |
644 | { | |
645 | insert (s, strlen (s)); | |
646 | } | |
647 | ||
648 | /* Like `insert' except that all markers pointing at the place where | |
649 | the insertion happens are adjusted to point after it. | |
650 | Don't use this function to insert part of a Lisp string, | |
651 | since gc could happen and relocate it. */ | |
652 | ||
c660b094 | 653 | void |
b45433b3 JB |
654 | insert_before_markers (string, length) |
655 | unsigned char *string; | |
656 | register int length; | |
657 | { | |
395ec62e KH |
658 | if (length > 0) |
659 | { | |
2bcaed71 | 660 | register int opoint = PT; |
c660b094 | 661 | insert_1 (string, length, 0, 1); |
395ec62e | 662 | adjust_markers (opoint - 1, opoint, length); |
2bcaed71 | 663 | signal_after_change (PT-length, 0, length); |
395ec62e | 664 | } |
b45433b3 JB |
665 | } |
666 | ||
c660b094 | 667 | void |
598fb6fe RS |
668 | insert_before_markers_and_inherit (string, length) |
669 | unsigned char *string; | |
670 | register int length; | |
671 | { | |
672 | if (length > 0) | |
673 | { | |
674 | register int opoint = PT; | |
c660b094 | 675 | insert_1 (string, length, 1, 1); |
598fb6fe RS |
676 | adjust_markers (opoint - 1, opoint, length); |
677 | signal_after_change (PT-length, 0, length); | |
678 | } | |
679 | } | |
680 | ||
b45433b3 JB |
681 | /* Insert part of a Lisp string, relocating markers after. */ |
682 | ||
c660b094 | 683 | void |
9391e591 | 684 | insert_from_string_before_markers (string, pos, length, inherit) |
b45433b3 JB |
685 | Lisp_Object string; |
686 | register int pos, length; | |
9391e591 | 687 | int inherit; |
b45433b3 | 688 | { |
395ec62e KH |
689 | if (length > 0) |
690 | { | |
2bcaed71 | 691 | register int opoint = PT; |
395ec62e KH |
692 | insert_from_string_1 (string, pos, length, inherit); |
693 | adjust_markers (opoint - 1, opoint, length); | |
2bcaed71 | 694 | signal_after_change (PT-length, 0, length); |
395ec62e | 695 | } |
b45433b3 JB |
696 | } |
697 | \f | |
698 | /* Delete characters in current buffer | |
699 | from FROM up to (but not including) TO. */ | |
700 | ||
c660b094 | 701 | void |
b45433b3 JB |
702 | del_range (from, to) |
703 | register int from, to; | |
47c64747 | 704 | { |
c660b094 | 705 | del_range_1 (from, to, 1); |
47c64747 RS |
706 | } |
707 | ||
708 | /* Like del_range; PREPARE says whether to call prepare_to_modify_buffer. */ | |
709 | ||
c660b094 | 710 | void |
47c64747 | 711 | del_range_1 (from, to, prepare) |
d206af14 | 712 | int from, to, prepare; |
b45433b3 JB |
713 | { |
714 | register int numdel; | |
715 | ||
d206af14 RS |
716 | if (prepare) |
717 | { | |
718 | int range_length = to - from; | |
719 | prepare_to_modify_buffer (from, to, &from); | |
720 | to = from + range_length; | |
721 | } | |
722 | ||
b45433b3 JB |
723 | /* Make args be valid */ |
724 | if (from < BEGV) | |
725 | from = BEGV; | |
726 | if (to > ZV) | |
727 | to = ZV; | |
728 | ||
729 | if ((numdel = to - from) <= 0) | |
730 | return; | |
731 | ||
732 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
733 | if (from > GPT) | |
734 | gap_right (from); | |
735 | if (to < GPT) | |
736 | gap_left (to, 0); | |
737 | ||
8948d317 RS |
738 | /* Relocate all markers pointing into the new, larger gap |
739 | to point at the end of the text before the gap. | |
740 | This has to be done before recording the deletion, | |
741 | so undo handles this after reinserting the text. */ | |
742 | adjust_markers (to + GAP_SIZE, to + GAP_SIZE, - numdel - GAP_SIZE); | |
743 | ||
be09561e RS |
744 | record_delete (from, numdel); |
745 | MODIFF++; | |
746 | ||
b45433b3 | 747 | /* Relocate point as if it were a marker. */ |
2bcaed71 | 748 | if (from < PT) |
a27a38d8 | 749 | adjust_point (from - (PT < to ? PT : to)); |
b45433b3 | 750 | |
16032db6 | 751 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ |
83010cd6 | 752 | offset_intervals (current_buffer, from, - numdel); |
16032db6 | 753 | |
adde4858 | 754 | /* Adjust the overlay center as needed. This must be done after |
a7f38d28 | 755 | adjusting the markers that bound the overlays. */ |
adde4858 KH |
756 | adjust_overlays_for_delete (from, numdel); |
757 | ||
b45433b3 JB |
758 | GAP_SIZE += numdel; |
759 | ZV -= numdel; | |
760 | Z -= numdel; | |
761 | GPT = from; | |
469ff680 | 762 | *(GPT_ADDR) = 0; /* Put an anchor. */ |
b45433b3 JB |
763 | |
764 | if (GPT - BEG < beg_unchanged) | |
765 | beg_unchanged = GPT - BEG; | |
766 | if (Z - GPT < end_unchanged) | |
767 | end_unchanged = Z - GPT; | |
768 | ||
d386034e | 769 | evaporate_overlays (from); |
b45433b3 JB |
770 | signal_after_change (from, numdel, 0); |
771 | } | |
772 | \f | |
04a759c8 JB |
773 | /* Call this if you're about to change the region of BUFFER from START |
774 | to END. This checks the read-only properties of the region, calls | |
775 | the necessary modification hooks, and warns the next redisplay that | |
776 | it should pay attention to that area. */ | |
c660b094 | 777 | void |
04a759c8 JB |
778 | modify_region (buffer, start, end) |
779 | struct buffer *buffer; | |
b45433b3 JB |
780 | int start, end; |
781 | { | |
04a759c8 JB |
782 | struct buffer *old_buffer = current_buffer; |
783 | ||
784 | if (buffer != old_buffer) | |
785 | set_buffer_internal (buffer); | |
786 | ||
d206af14 | 787 | prepare_to_modify_buffer (start, end, NULL); |
b45433b3 | 788 | |
894ab630 RS |
789 | if (start - 1 < beg_unchanged |
790 | || (unchanged_modified == MODIFF | |
791 | && overlay_unchanged_modified == OVERLAY_MODIFF)) | |
b45433b3 JB |
792 | beg_unchanged = start - 1; |
793 | if (Z - end < end_unchanged | |
894ab630 RS |
794 | || (unchanged_modified == MODIFF |
795 | && overlay_unchanged_modified == OVERLAY_MODIFF)) | |
b45433b3 | 796 | end_unchanged = Z - end; |
83010cd6 | 797 | |
9fbf87cd | 798 | if (MODIFF <= SAVE_MODIFF) |
83010cd6 | 799 | record_first_change (); |
b45433b3 | 800 | MODIFF++; |
04a759c8 | 801 | |
069cdc4f RS |
802 | buffer->point_before_scroll = Qnil; |
803 | ||
04a759c8 JB |
804 | if (buffer != old_buffer) |
805 | set_buffer_internal (old_buffer); | |
b45433b3 | 806 | } |
d206af14 | 807 | \f |
b45433b3 | 808 | /* Check that it is okay to modify the buffer between START and END. |
679194a6 JA |
809 | Run the before-change-function, if any. If intervals are in use, |
810 | verify that the text to be modified is not read-only, and call | |
d206af14 RS |
811 | any modification properties the text may have. |
812 | ||
813 | If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR | |
814 | by holding its value temporarily in a marker. */ | |
b45433b3 | 815 | |
c660b094 | 816 | void |
d206af14 | 817 | prepare_to_modify_buffer (start, end, preserve_ptr) |
fb4ee5cd | 818 | int start, end; |
d206af14 | 819 | int *preserve_ptr; |
b45433b3 | 820 | { |
d427b66a | 821 | if (!NILP (current_buffer->read_only)) |
b45433b3 JB |
822 | Fbarf_if_buffer_read_only (); |
823 | ||
679194a6 | 824 | /* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */ |
9fbf87cd | 825 | if (BUF_INTERVALS (current_buffer) != 0) |
d206af14 RS |
826 | { |
827 | if (preserve_ptr) | |
828 | { | |
829 | Lisp_Object preserve_marker; | |
830 | struct gcpro gcpro1; | |
831 | preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil); | |
832 | GCPRO1 (preserve_marker); | |
833 | verify_interval_modification (current_buffer, start, end); | |
834 | *preserve_ptr = marker_position (preserve_marker); | |
835 | unchain_marker (preserve_marker); | |
836 | UNGCPRO; | |
837 | } | |
838 | else | |
839 | verify_interval_modification (current_buffer, start, end); | |
840 | } | |
b45433b3 JB |
841 | |
842 | #ifdef CLASH_DETECTION | |
f173b650 | 843 | if (!NILP (current_buffer->file_truename) |
ab6c5c0c RS |
844 | /* Make binding buffer-file-name to nil effective. */ |
845 | && !NILP (current_buffer->filename) | |
9fbf87cd | 846 | && SAVE_MODIFF >= MODIFF) |
f173b650 | 847 | lock_file (current_buffer->file_truename); |
b45433b3 JB |
848 | #else |
849 | /* At least warn if this file has changed on disk since it was visited. */ | |
d427b66a | 850 | if (!NILP (current_buffer->filename) |
9fbf87cd | 851 | && SAVE_MODIFF >= MODIFF |
d427b66a JB |
852 | && NILP (Fverify_visited_file_modtime (Fcurrent_buffer ())) |
853 | && !NILP (Ffile_exists_p (current_buffer->filename))) | |
b45433b3 JB |
854 | call1 (intern ("ask-user-about-supersession-threat"), |
855 | current_buffer->filename); | |
856 | #endif /* not CLASH_DETECTION */ | |
857 | ||
d206af14 | 858 | signal_before_change (start, end, preserve_ptr); |
2f545eea | 859 | |
56e1065e JB |
860 | if (current_buffer->newline_cache) |
861 | invalidate_region_cache (current_buffer, | |
862 | current_buffer->newline_cache, | |
863 | start - BEG, Z - end); | |
864 | if (current_buffer->width_run_cache) | |
865 | invalidate_region_cache (current_buffer, | |
866 | current_buffer->width_run_cache, | |
867 | start - BEG, Z - end); | |
868 | ||
2f545eea | 869 | Vdeactivate_mark = Qt; |
b45433b3 JB |
870 | } |
871 | \f | |
d206af14 RS |
872 | /* These macros work with an argument named `preserve_ptr' |
873 | and a local variable named `preserve_marker'. */ | |
874 | ||
875 | #define PRESERVE_VALUE \ | |
876 | if (preserve_ptr && NILP (preserve_marker)) \ | |
877 | preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil) | |
878 | ||
879 | #define RESTORE_VALUE \ | |
880 | if (! NILP (preserve_marker)) \ | |
881 | { \ | |
882 | *preserve_ptr = marker_position (preserve_marker); \ | |
883 | unchain_marker (preserve_marker); \ | |
884 | } | |
885 | ||
eb8c3be9 | 886 | /* Signal a change to the buffer immediately before it happens. |
d206af14 RS |
887 | START_INT and END_INT are the bounds of the text to be changed. |
888 | ||
889 | If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR | |
890 | by holding its value temporarily in a marker. */ | |
b45433b3 | 891 | |
c660b094 | 892 | void |
d206af14 | 893 | signal_before_change (start_int, end_int, preserve_ptr) |
6022d493 | 894 | int start_int, end_int; |
d206af14 | 895 | int *preserve_ptr; |
b45433b3 | 896 | { |
fb4ee5cd | 897 | Lisp_Object start, end; |
d206af14 RS |
898 | Lisp_Object preserve_marker; |
899 | struct gcpro gcpro1; | |
fb4ee5cd RS |
900 | |
901 | start = make_number (start_int); | |
902 | end = make_number (end_int); | |
d206af14 RS |
903 | preserve_marker = Qnil; |
904 | GCPRO1 (preserve_marker); | |
fb4ee5cd | 905 | |
b45433b3 | 906 | /* If buffer is unmodified, run a special hook for that case. */ |
9fbf87cd | 907 | if (SAVE_MODIFF >= MODIFF |
dbc4e1c1 JB |
908 | && !NILP (Vfirst_change_hook) |
909 | && !NILP (Vrun_hooks)) | |
d206af14 RS |
910 | { |
911 | PRESERVE_VALUE; | |
912 | call1 (Vrun_hooks, Qfirst_change_hook); | |
913 | } | |
dbc4e1c1 | 914 | |
3d1e2d9c RS |
915 | /* Run the before-change-function if any. |
916 | We don't bother "binding" this variable to nil | |
917 | because it is obsolete anyway and new code should not use it. */ | |
d427b66a | 918 | if (!NILP (Vbefore_change_function)) |
d206af14 RS |
919 | { |
920 | PRESERVE_VALUE; | |
921 | call2 (Vbefore_change_function, start, end); | |
922 | } | |
e45fb8bf | 923 | |
3d1e2d9c | 924 | /* Now run the before-change-functions if any. */ |
e45fb8bf RS |
925 | if (!NILP (Vbefore_change_functions)) |
926 | { | |
3d1e2d9c RS |
927 | Lisp_Object args[3]; |
928 | Lisp_Object before_change_functions; | |
929 | Lisp_Object after_change_functions; | |
930 | struct gcpro gcpro1, gcpro2; | |
931 | ||
d206af14 RS |
932 | PRESERVE_VALUE; |
933 | ||
3d1e2d9c RS |
934 | /* "Bind" before-change-functions and after-change-functions |
935 | to nil--but in a way that errors don't know about. | |
936 | That way, if there's an error in them, they will stay nil. */ | |
937 | before_change_functions = Vbefore_change_functions; | |
938 | after_change_functions = Vafter_change_functions; | |
c82c1da0 KH |
939 | Vbefore_change_functions = Qnil; |
940 | Vafter_change_functions = Qnil; | |
3d1e2d9c RS |
941 | GCPRO2 (before_change_functions, after_change_functions); |
942 | ||
943 | /* Actually run the hook functions. */ | |
944 | args[0] = Qbefore_change_functions; | |
945 | args[1] = start; | |
946 | args[2] = end; | |
947 | run_hook_list_with_args (before_change_functions, 3, args); | |
948 | ||
949 | /* "Unbind" the variables we "bound" to nil. */ | |
950 | Vbefore_change_functions = before_change_functions; | |
951 | Vafter_change_functions = after_change_functions; | |
952 | UNGCPRO; | |
e45fb8bf | 953 | } |
d07c0804 RS |
954 | |
955 | if (!NILP (current_buffer->overlays_before) | |
956 | || !NILP (current_buffer->overlays_after)) | |
d206af14 RS |
957 | { |
958 | PRESERVE_VALUE; | |
959 | report_overlay_modification (start, end, 0, start, end, Qnil); | |
960 | } | |
961 | ||
962 | RESTORE_VALUE; | |
963 | UNGCPRO; | |
b45433b3 JB |
964 | } |
965 | ||
eb8c3be9 | 966 | /* Signal a change immediately after it happens. |
b45433b3 JB |
967 | POS is the address of the start of the changed text. |
968 | LENDEL is the number of characters of the text before the change. | |
969 | (Not the whole buffer; just the part that was changed.) | |
8b09e5d0 RS |
970 | LENINS is the number of characters in that part of the text |
971 | after the change. */ | |
b45433b3 | 972 | |
c660b094 | 973 | void |
b45433b3 JB |
974 | signal_after_change (pos, lendel, lenins) |
975 | int pos, lendel, lenins; | |
976 | { | |
fb2e7d14 RS |
977 | /* If we are deferring calls to the after-change functions |
978 | and there are no before-change functions, | |
979 | just record the args that we were going to use. */ | |
980 | if (! NILP (Vcombine_after_change_calls) | |
981 | && NILP (Vbefore_change_function) && NILP (Vbefore_change_functions) | |
982 | && NILP (current_buffer->overlays_before) | |
983 | && NILP (current_buffer->overlays_after)) | |
984 | { | |
985 | Lisp_Object elt; | |
986 | ||
987 | if (!NILP (combine_after_change_list) | |
988 | && current_buffer != XBUFFER (combine_after_change_buffer)) | |
989 | Fcombine_after_change_execute (); | |
990 | ||
991 | elt = Fcons (make_number (pos - BEG), | |
992 | Fcons (make_number (Z - (pos - lendel + lenins)), | |
993 | Fcons (make_number (lenins - lendel), Qnil))); | |
994 | combine_after_change_list | |
995 | = Fcons (elt, combine_after_change_list); | |
996 | combine_after_change_buffer = Fcurrent_buffer (); | |
997 | ||
998 | return; | |
999 | } | |
1000 | ||
1001 | if (!NILP (combine_after_change_list)) | |
1002 | Fcombine_after_change_execute (); | |
1003 | ||
3d1e2d9c RS |
1004 | /* Run the after-change-function if any. |
1005 | We don't bother "binding" this variable to nil | |
1006 | because it is obsolete anyway and new code should not use it. */ | |
d427b66a | 1007 | if (!NILP (Vafter_change_function)) |
3d1e2d9c RS |
1008 | call3 (Vafter_change_function, |
1009 | make_number (pos), make_number (pos + lenins), | |
1010 | make_number (lendel)); | |
b45433b3 | 1011 | |
e45fb8bf RS |
1012 | if (!NILP (Vafter_change_functions)) |
1013 | { | |
3d1e2d9c RS |
1014 | Lisp_Object args[4]; |
1015 | Lisp_Object before_change_functions; | |
1016 | Lisp_Object after_change_functions; | |
1017 | struct gcpro gcpro1, gcpro2; | |
1018 | ||
1019 | /* "Bind" before-change-functions and after-change-functions | |
1020 | to nil--but in a way that errors don't know about. | |
1021 | That way, if there's an error in them, they will stay nil. */ | |
1022 | before_change_functions = Vbefore_change_functions; | |
1023 | after_change_functions = Vafter_change_functions; | |
c82c1da0 KH |
1024 | Vbefore_change_functions = Qnil; |
1025 | Vafter_change_functions = Qnil; | |
3d1e2d9c RS |
1026 | GCPRO2 (before_change_functions, after_change_functions); |
1027 | ||
1028 | /* Actually run the hook functions. */ | |
1029 | args[0] = Qafter_change_functions; | |
1030 | XSETFASTINT (args[1], pos); | |
1031 | XSETFASTINT (args[2], pos + lenins); | |
1032 | XSETFASTINT (args[3], lendel); | |
1033 | run_hook_list_with_args (after_change_functions, | |
1034 | 4, args); | |
1035 | ||
1036 | /* "Unbind" the variables we "bound" to nil. */ | |
1037 | Vbefore_change_functions = before_change_functions; | |
1038 | Vafter_change_functions = after_change_functions; | |
1039 | UNGCPRO; | |
e45fb8bf | 1040 | } |
d07c0804 RS |
1041 | |
1042 | if (!NILP (current_buffer->overlays_before) | |
1043 | || !NILP (current_buffer->overlays_after)) | |
835220e8 | 1044 | report_overlay_modification (make_number (pos), |
8b09e5d0 | 1045 | make_number (pos + lenins), |
d07c0804 RS |
1046 | 1, |
1047 | make_number (pos), make_number (pos + lenins), | |
1048 | make_number (lendel)); | |
c5ca0786 RS |
1049 | |
1050 | /* After an insertion, call the text properties | |
1051 | insert-behind-hooks or insert-in-front-hooks. */ | |
1052 | if (lendel == 0) | |
1053 | report_interval_modification (pos, pos + lenins); | |
b45433b3 | 1054 | } |
fb2e7d14 RS |
1055 | |
1056 | Lisp_Object | |
1057 | Fcombine_after_change_execute_1 (val) | |
1058 | Lisp_Object val; | |
1059 | { | |
1060 | Vcombine_after_change_calls = val; | |
1061 | return val; | |
1062 | } | |
1063 | ||
1064 | DEFUN ("combine-after-change-execute", Fcombine_after_change_execute, | |
1065 | Scombine_after_change_execute, 0, 0, 0, | |
1066 | "This function is for use internally in `combine-after-change-calls'.") | |
1067 | () | |
1068 | { | |
1069 | register Lisp_Object val; | |
1070 | int count = specpdl_ptr - specpdl; | |
1071 | int beg, end, change; | |
1072 | int begpos, endpos; | |
1073 | Lisp_Object tail; | |
1074 | ||
1075 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); | |
1076 | ||
1077 | Fset_buffer (combine_after_change_buffer); | |
1078 | ||
1079 | /* # chars unchanged at beginning of buffer. */ | |
1080 | beg = Z - BEG; | |
1081 | /* # chars unchanged at end of buffer. */ | |
1082 | end = beg; | |
1083 | /* Total amount of insertion (negative for deletion). */ | |
1084 | change = 0; | |
1085 | ||
1086 | /* Scan the various individual changes, | |
1087 | accumulating the range info in BEG, END and CHANGE. */ | |
1088 | for (tail = combine_after_change_list; CONSP (tail); | |
1089 | tail = XCONS (tail)->cdr) | |
1090 | { | |
e688a080 KH |
1091 | Lisp_Object elt; |
1092 | int thisbeg, thisend, thischange; | |
fb2e7d14 RS |
1093 | |
1094 | /* Extract the info from the next element. */ | |
1095 | elt = XCONS (tail)->car; | |
1096 | if (! CONSP (elt)) | |
1097 | continue; | |
1098 | thisbeg = XINT (XCONS (elt)->car); | |
1099 | ||
1100 | elt = XCONS (elt)->cdr; | |
1101 | if (! CONSP (elt)) | |
1102 | continue; | |
1103 | thisend = XINT (XCONS (elt)->car); | |
1104 | ||
1105 | elt = XCONS (elt)->cdr; | |
1106 | if (! CONSP (elt)) | |
1107 | continue; | |
1108 | thischange = XINT (XCONS (elt)->car); | |
1109 | ||
1110 | /* Merge this range into the accumulated range. */ | |
1111 | change += thischange; | |
1112 | if (thisbeg < beg) | |
1113 | beg = thisbeg; | |
1114 | if (thisend < end) | |
1115 | end = thisend; | |
1116 | } | |
1117 | ||
1118 | /* Get the current start and end positions of the range | |
1119 | that was changed. */ | |
1120 | begpos = BEG + beg; | |
1121 | endpos = Z - end; | |
1122 | ||
1123 | /* We are about to handle these, so discard them. */ | |
1124 | combine_after_change_list = Qnil; | |
1125 | ||
1126 | /* Now run the after-change functions for real. | |
1127 | Turn off the flag that defers them. */ | |
1128 | record_unwind_protect (Fcombine_after_change_execute_1, | |
1129 | Vcombine_after_change_calls); | |
1130 | signal_after_change (begpos, endpos - begpos - change, endpos - begpos); | |
1131 | ||
1132 | return unbind_to (count, val); | |
1133 | } | |
1134 | \f | |
1135 | syms_of_insdel () | |
1136 | { | |
1137 | staticpro (&combine_after_change_list); | |
1138 | combine_after_change_list = Qnil; | |
1139 | ||
1140 | DEFVAR_LISP ("combine-after-change-calls", &Vcombine_after_change_calls, | |
1141 | "Used internally by the `combine-after-change-calls' macro."); | |
1142 | Vcombine_after_change_calls = Qnil; | |
1143 | ||
1144 | defsubr (&Scombine_after_change_execute); | |
1145 | } |