Commit | Line | Data |
---|---|---|
b45433b3 | 1 | /* Buffer insertion/deletion and gap motion for GNU Emacs. |
0b5538bd | 2 | Copyright (C) 1985, 1986, 1993, 1994, 1995, 1997, 1998, 1999, 2000, 2001, |
4e6835db | 3 | 2002, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc. |
b45433b3 JB |
4 | |
5 | This file is part of GNU Emacs. | |
6 | ||
7 | GNU Emacs is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
7c938215 | 9 | the Free Software Foundation; either version 2, or (at your option) |
b45433b3 JB |
10 | any later version. |
11 | ||
12 | GNU Emacs is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU Emacs; see the file COPYING. If not, write to | |
4fc5845f LK |
19 | the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
20 | Boston, MA 02110-1301, USA. */ | |
b45433b3 JB |
21 | |
22 | ||
18160b98 | 23 | #include <config.h> |
b45433b3 | 24 | #include "lisp.h" |
679194a6 | 25 | #include "intervals.h" |
b45433b3 | 26 | #include "buffer.h" |
469ff680 | 27 | #include "charset.h" |
b45433b3 | 28 | #include "window.h" |
d014bf88 | 29 | #include "blockinput.h" |
dfcf069d | 30 | #include "region-cache.h" |
b45433b3 | 31 | |
d206af14 RS |
32 | #ifndef NULL |
33 | #define NULL 0 | |
34 | #endif | |
35 | ||
2b083808 | 36 | static void insert_from_string_1 P_ ((Lisp_Object, int, int, int, int, int, int)); |
ef29f213 | 37 | static void insert_from_buffer_1 (); |
3be11131 RS |
38 | static void gap_left P_ ((int, int, int)); |
39 | static void gap_right P_ ((int, int)); | |
40 | static void adjust_markers_gap_motion P_ ((int, int, int)); | |
b16afa45 | 41 | static void adjust_markers_for_insert P_ ((int, int, int, int, int)); |
809f3d51 | 42 | void adjust_markers_for_delete P_ ((int, int, int, int)); |
b16afa45 | 43 | static void adjust_markers_for_replace P_ ((int, int, int, int, int, int)); |
3be11131 | 44 | static void adjust_point P_ ((int, int)); |
395ec62e | 45 | |
fb2e7d14 RS |
46 | Lisp_Object Fcombine_after_change_execute (); |
47 | ||
48 | /* Non-nil means don't call the after-change-functions right away, | |
49 | just record an element in Vcombine_after_change_calls_list. */ | |
50 | Lisp_Object Vcombine_after_change_calls; | |
51 | ||
52 | /* List of elements of the form (BEG-UNCHANGED END-UNCHANGED CHANGE-AMOUNT) | |
53 | describing changes which happened while combine_after_change_calls | |
54 | was nonzero. We use this to decide how to call them | |
55 | once the deferral ends. | |
56 | ||
57 | In each element. | |
58 | BEG-UNCHANGED is the number of chars before the changed range. | |
59 | END-UNCHANGED is the number of chars after the changed range, | |
60 | and CHANGE-AMOUNT is the number of characters inserted by the change | |
61 | (negative for a deletion). */ | |
62 | Lisp_Object combine_after_change_list; | |
63 | ||
64 | /* Buffer which combine_after_change_list is about. */ | |
65 | Lisp_Object combine_after_change_buffer; | |
27ea0af2 GM |
66 | |
67 | Lisp_Object Qinhibit_modification_hooks; | |
68 | ||
2b083808 | 69 | \f |
60ea6052 RS |
70 | /* Check all markers in the current buffer, looking for something invalid. */ |
71 | ||
72 | static int check_markers_debug_flag; | |
73 | ||
74 | #define CHECK_MARKERS() \ | |
75 | if (check_markers_debug_flag) \ | |
76 | check_markers (); \ | |
77 | else | |
78 | ||
79 | void | |
80 | check_markers () | |
81 | { | |
dab0b04d | 82 | register struct Lisp_Marker *tail; |
9f3ede3c | 83 | int multibyte = ! NILP (current_buffer->enable_multibyte_characters); |
60ea6052 | 84 | |
dab0b04d | 85 | for (tail = BUF_MARKERS (current_buffer); tail; tail = tail->next) |
60ea6052 | 86 | { |
dab0b04d | 87 | if (tail->buffer->text != current_buffer->text) |
60ea6052 | 88 | abort (); |
dab0b04d | 89 | if (tail->charpos > Z) |
60ea6052 | 90 | abort (); |
dab0b04d | 91 | if (tail->bytepos > Z_BYTE) |
60ea6052 | 92 | abort (); |
dab0b04d | 93 | if (multibyte && ! CHAR_HEAD_P (FETCH_BYTE (tail->bytepos))) |
9f3ede3c | 94 | abort (); |
60ea6052 RS |
95 | } |
96 | } | |
97 | \f | |
3be11131 | 98 | /* Move gap to position CHARPOS. |
b45433b3 JB |
99 | Note that this can quit! */ |
100 | ||
c660b094 | 101 | void |
3be11131 RS |
102 | move_gap (charpos) |
103 | int charpos; | |
b45433b3 | 104 | { |
3be11131 | 105 | move_gap_both (charpos, charpos_to_bytepos (charpos)); |
b45433b3 JB |
106 | } |
107 | ||
3be11131 RS |
108 | /* Move gap to byte position BYTEPOS, which is also char position CHARPOS. |
109 | Note that this can quit! */ | |
110 | ||
111 | void | |
112 | move_gap_both (charpos, bytepos) | |
113 | int charpos, bytepos; | |
114 | { | |
115 | if (bytepos < GPT_BYTE) | |
116 | gap_left (charpos, bytepos, 0); | |
117 | else if (bytepos > GPT_BYTE) | |
118 | gap_right (charpos, bytepos); | |
119 | } | |
120 | ||
121 | /* Move the gap to a position less than the current GPT. | |
122 | BYTEPOS describes the new position as a byte position, | |
123 | and CHARPOS is the corresponding char position. | |
b45433b3 JB |
124 | If NEWGAP is nonzero, then don't update beg_unchanged and end_unchanged. */ |
125 | ||
2bcaed71 | 126 | static void |
3be11131 RS |
127 | gap_left (charpos, bytepos, newgap) |
128 | register int charpos, bytepos; | |
b45433b3 JB |
129 | int newgap; |
130 | { | |
131 | register unsigned char *to, *from; | |
132 | register int i; | |
133 | int new_s1; | |
134 | ||
b45433b3 | 135 | if (!newgap) |
a50df55b | 136 | BUF_COMPUTE_UNCHANGED (current_buffer, charpos, GPT); |
b45433b3 | 137 | |
3be11131 | 138 | i = GPT_BYTE; |
b45433b3 JB |
139 | to = GAP_END_ADDR; |
140 | from = GPT_ADDR; | |
3be11131 | 141 | new_s1 = GPT_BYTE; |
b45433b3 JB |
142 | |
143 | /* Now copy the characters. To move the gap down, | |
144 | copy characters up. */ | |
145 | ||
146 | while (1) | |
147 | { | |
148 | /* I gets number of characters left to copy. */ | |
3be11131 | 149 | i = new_s1 - bytepos; |
b45433b3 JB |
150 | if (i == 0) |
151 | break; | |
152 | /* If a quit is requested, stop copying now. | |
3be11131 | 153 | Change BYTEPOS to be where we have actually moved the gap to. */ |
b45433b3 JB |
154 | if (QUITP) |
155 | { | |
3be11131 RS |
156 | bytepos = new_s1; |
157 | charpos = BYTE_TO_CHAR (bytepos); | |
b45433b3 JB |
158 | break; |
159 | } | |
160 | /* Move at most 32000 chars before checking again for a quit. */ | |
161 | if (i > 32000) | |
162 | i = 32000; | |
163 | #ifdef GAP_USE_BCOPY | |
164 | if (i >= 128 | |
165 | /* bcopy is safe if the two areas of memory do not overlap | |
166 | or on systems where bcopy is always safe for moving upward. */ | |
167 | && (BCOPY_UPWARD_SAFE | |
168 | || to - from >= 128)) | |
169 | { | |
170 | /* If overlap is not safe, avoid it by not moving too many | |
171 | characters at once. */ | |
172 | if (!BCOPY_UPWARD_SAFE && i > to - from) | |
173 | i = to - from; | |
174 | new_s1 -= i; | |
175 | from -= i, to -= i; | |
176 | bcopy (from, to, i); | |
177 | } | |
178 | else | |
179 | #endif | |
180 | { | |
181 | new_s1 -= i; | |
182 | while (--i >= 0) | |
183 | *--to = *--from; | |
184 | } | |
185 | } | |
186 | ||
3be11131 RS |
187 | /* Adjust markers, and buffer data structure, to put the gap at BYTEPOS. |
188 | BYTEPOS is where the loop above stopped, which may be what was specified | |
b45433b3 | 189 | or may be where a quit was detected. */ |
3be11131 RS |
190 | adjust_markers_gap_motion (bytepos, GPT_BYTE, GAP_SIZE); |
191 | GPT_BYTE = bytepos; | |
192 | GPT = charpos; | |
193 | if (bytepos < charpos) | |
194 | abort (); | |
469ff680 | 195 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
b45433b3 JB |
196 | QUIT; |
197 | } | |
198 | ||
3be11131 RS |
199 | /* Move the gap to a position greater than than the current GPT. |
200 | BYTEPOS describes the new position as a byte position, | |
201 | and CHARPOS is the corresponding char position. */ | |
202 | ||
2bcaed71 | 203 | static void |
3be11131 RS |
204 | gap_right (charpos, bytepos) |
205 | register int charpos, bytepos; | |
b45433b3 JB |
206 | { |
207 | register unsigned char *to, *from; | |
208 | register int i; | |
209 | int new_s1; | |
210 | ||
a50df55b | 211 | BUF_COMPUTE_UNCHANGED (current_buffer, charpos, GPT); |
b45433b3 | 212 | |
3be11131 | 213 | i = GPT_BYTE; |
b45433b3 JB |
214 | from = GAP_END_ADDR; |
215 | to = GPT_ADDR; | |
3be11131 | 216 | new_s1 = GPT_BYTE; |
b45433b3 JB |
217 | |
218 | /* Now copy the characters. To move the gap up, | |
219 | copy characters down. */ | |
220 | ||
221 | while (1) | |
222 | { | |
223 | /* I gets number of characters left to copy. */ | |
3be11131 | 224 | i = bytepos - new_s1; |
b45433b3 JB |
225 | if (i == 0) |
226 | break; | |
227 | /* If a quit is requested, stop copying now. | |
3be11131 | 228 | Change BYTEPOS to be where we have actually moved the gap to. */ |
b45433b3 JB |
229 | if (QUITP) |
230 | { | |
3be11131 RS |
231 | bytepos = new_s1; |
232 | charpos = BYTE_TO_CHAR (bytepos); | |
b45433b3 JB |
233 | break; |
234 | } | |
235 | /* Move at most 32000 chars before checking again for a quit. */ | |
236 | if (i > 32000) | |
237 | i = 32000; | |
238 | #ifdef GAP_USE_BCOPY | |
239 | if (i >= 128 | |
240 | /* bcopy is safe if the two areas of memory do not overlap | |
241 | or on systems where bcopy is always safe for moving downward. */ | |
242 | && (BCOPY_DOWNWARD_SAFE | |
243 | || from - to >= 128)) | |
244 | { | |
245 | /* If overlap is not safe, avoid it by not moving too many | |
246 | characters at once. */ | |
247 | if (!BCOPY_DOWNWARD_SAFE && i > from - to) | |
248 | i = from - to; | |
249 | new_s1 += i; | |
250 | bcopy (from, to, i); | |
251 | from += i, to += i; | |
252 | } | |
253 | else | |
254 | #endif | |
255 | { | |
256 | new_s1 += i; | |
257 | while (--i >= 0) | |
258 | *to++ = *from++; | |
259 | } | |
260 | } | |
261 | ||
3be11131 RS |
262 | adjust_markers_gap_motion (GPT_BYTE + GAP_SIZE, bytepos + GAP_SIZE, |
263 | - GAP_SIZE); | |
264 | GPT = charpos; | |
265 | GPT_BYTE = bytepos; | |
266 | if (bytepos < charpos) | |
267 | abort (); | |
469ff680 | 268 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
b45433b3 JB |
269 | QUIT; |
270 | } | |
2b083808 | 271 | \f |
3be11131 RS |
272 | /* Add AMOUNT to the byte position of every marker in the current buffer |
273 | whose current byte position is between FROM (exclusive) and TO (inclusive). | |
8948d317 | 274 | |
b45433b3 JB |
275 | Also, any markers past the outside of that interval, in the direction |
276 | of adjustment, are first moved back to the near end of the interval | |
8948d317 RS |
277 | and then adjusted by AMOUNT. |
278 | ||
279 | When the latter adjustment is done, if AMOUNT is negative, | |
280 | we record the adjustment for undo. (This case happens only for | |
3be11131 RS |
281 | deletion.) |
282 | ||
283 | The markers' character positions are not altered, | |
284 | because gap motion does not affect character positions. */ | |
285 | ||
286 | int adjust_markers_test; | |
b45433b3 | 287 | |
2bcaed71 | 288 | static void |
3be11131 | 289 | adjust_markers_gap_motion (from, to, amount) |
b45433b3 JB |
290 | register int from, to, amount; |
291 | { | |
80f6e77c RS |
292 | /* Now that a marker has a bytepos, not counting the gap, |
293 | nothing needs to be done here. */ | |
294 | #if 0 | |
b45433b3 JB |
295 | Lisp_Object marker; |
296 | register struct Lisp_Marker *m; | |
297 | register int mpos; | |
298 | ||
9fbf87cd | 299 | marker = BUF_MARKERS (current_buffer); |
b45433b3 | 300 | |
d427b66a | 301 | while (!NILP (marker)) |
b45433b3 JB |
302 | { |
303 | m = XMARKER (marker); | |
80f6e77c | 304 | mpos = m->bytepos; |
b45433b3 JB |
305 | if (amount > 0) |
306 | { | |
307 | if (mpos > to && mpos < to + amount) | |
3be11131 RS |
308 | { |
309 | if (adjust_markers_test) | |
310 | abort (); | |
311 | mpos = to + amount; | |
312 | } | |
b45433b3 JB |
313 | } |
314 | else | |
315 | { | |
8948d317 RS |
316 | /* Here's the case where a marker is inside text being deleted. |
317 | AMOUNT can be negative for gap motion, too, | |
318 | but then this range contains no markers. */ | |
b45433b3 | 319 | if (mpos > from + amount && mpos <= from) |
8948d317 | 320 | { |
3be11131 RS |
321 | if (adjust_markers_test) |
322 | abort (); | |
323 | mpos = from + amount; | |
8948d317 | 324 | } |
b45433b3 JB |
325 | } |
326 | if (mpos > from && mpos <= to) | |
327 | mpos += amount; | |
328 | m->bufpos = mpos; | |
329 | marker = m->chain; | |
330 | } | |
80f6e77c | 331 | #endif |
b45433b3 | 332 | } |
2b083808 | 333 | \f |
3be11131 RS |
334 | /* Adjust all markers for a deletion |
335 | whose range in bytes is FROM_BYTE to TO_BYTE. | |
336 | The range in charpos is FROM to TO. | |
337 | ||
338 | This function assumes that the gap is adjacent to | |
339 | or inside of the range being deleted. */ | |
beecb55b | 340 | |
809f3d51 | 341 | void |
3be11131 RS |
342 | adjust_markers_for_delete (from, from_byte, to, to_byte) |
343 | register int from, from_byte, to, to_byte; | |
344 | { | |
345 | Lisp_Object marker; | |
346 | register struct Lisp_Marker *m; | |
347 | register int charpos; | |
3be11131 | 348 | |
dab0b04d | 349 | for (m = BUF_MARKERS (current_buffer); m; m = m->next) |
3be11131 | 350 | { |
3be11131 RS |
351 | charpos = m->charpos; |
352 | ||
353 | if (charpos > Z) | |
354 | abort (); | |
355 | ||
356 | /* If the marker is after the deletion, | |
80f6e77c | 357 | relocate by number of chars / bytes deleted. */ |
3be11131 | 358 | if (charpos > to) |
80f6e77c RS |
359 | { |
360 | m->charpos -= to - from; | |
361 | m->bytepos -= to_byte - from_byte; | |
362 | } | |
80f6e77c | 363 | /* Here's the case where a marker is inside text being deleted. */ |
3be11131 RS |
364 | else if (charpos > from) |
365 | { | |
00de2987 | 366 | if (! m->insertion_type) |
dab0b04d | 367 | { /* Normal markers will end up at the beginning of the |
00de2987 | 368 | re-inserted text after undoing a deletion, and must be |
177c0ea7 | 369 | adjusted to move them to the correct place. */ |
dab0b04d | 370 | XSETMISC (marker, m); |
00de2987 | 371 | record_marker_adjustment (marker, from - charpos); |
dab0b04d | 372 | } |
00de2987 | 373 | else if (charpos < to) |
dab0b04d | 374 | { /* Before-insertion markers will automatically move forward |
00de2987 MB |
375 | upon re-inserting the deleted text, so we have to arrange |
376 | for them to move backward to the correct position. */ | |
dab0b04d | 377 | XSETMISC (marker, m); |
00de2987 | 378 | record_marker_adjustment (marker, charpos - to); |
dab0b04d | 379 | } |
3be11131 | 380 | m->charpos = from; |
80f6e77c | 381 | m->bytepos = from_byte; |
3be11131 | 382 | } |
00de2987 MB |
383 | /* Here's the case where a before-insertion marker is immediately |
384 | before the deleted region. */ | |
385 | else if (charpos == from && m->insertion_type) | |
386 | { | |
387 | /* Undoing the change uses normal insertion, which will | |
388 | incorrectly make MARKER move forward, so we arrange for it | |
389 | to then move backward to the correct place at the beginning | |
390 | of the deleted region. */ | |
dab0b04d | 391 | XSETMISC (marker, m); |
00de2987 MB |
392 | record_marker_adjustment (marker, to - from); |
393 | } | |
3be11131 RS |
394 | } |
395 | } | |
23b20a70 | 396 | |
2b083808 | 397 | \f |
432f78d2 RS |
398 | /* Adjust markers for an insertion that stretches from FROM / FROM_BYTE |
399 | to TO / TO_BYTE. We have to relocate the charpos of every marker | |
400 | that points after the insertion (but not their bytepos). | |
3be11131 | 401 | |
3be11131 RS |
402 | When a marker points at the insertion point, |
403 | we advance it if either its insertion-type is t | |
404 | or BEFORE_MARKERS is true. */ | |
405 | ||
406 | static void | |
b16afa45 | 407 | adjust_markers_for_insert (from, from_byte, to, to_byte, before_markers) |
432f78d2 | 408 | register int from, from_byte, to, to_byte; |
b16afa45 | 409 | int before_markers; |
beecb55b | 410 | { |
dab0b04d | 411 | struct Lisp_Marker *m; |
469ff680 | 412 | int adjusted = 0; |
3be11131 RS |
413 | int nchars = to - from; |
414 | int nbytes = to_byte - from_byte; | |
beecb55b | 415 | |
dab0b04d | 416 | for (m = BUF_MARKERS (current_buffer); m; m = m->next) |
beecb55b | 417 | { |
b16afa45 KH |
418 | /* In a single-byte buffer, a marker's two positions must be |
419 | equal. */ | |
1f90a790 RS |
420 | if (Z == Z_BYTE) |
421 | { | |
422 | if (m->charpos != m->bytepos) | |
423 | abort (); | |
424 | } | |
425 | ||
432f78d2 | 426 | if (m->bytepos == from_byte) |
469ff680 | 427 | { |
432f78d2 RS |
428 | if (m->insertion_type || before_markers) |
429 | { | |
b16afa45 KH |
430 | m->bytepos = to_byte; |
431 | m->charpos = to; | |
432f78d2 RS |
432 | if (m->insertion_type) |
433 | adjusted = 1; | |
434 | } | |
ce97a2d7 | 435 | } |
80f6e77c RS |
436 | else if (m->bytepos > from_byte) |
437 | { | |
438 | m->bytepos += nbytes; | |
b16afa45 | 439 | m->charpos += nchars; |
80f6e77c | 440 | } |
beecb55b | 441 | } |
3be11131 RS |
442 | |
443 | /* Adjusting only markers whose insertion-type is t may result in | |
abdb9b83 MY |
444 | - disordered start and end in overlays, and |
445 | - disordered overlays in the slot `overlays_before' of current_buffer. */ | |
469ff680 | 446 | if (adjusted) |
abdb9b83 MY |
447 | { |
448 | fix_start_end_in_overlays(from, to); | |
449 | fix_overlays_before (current_buffer, from, to); | |
450 | } | |
beecb55b RS |
451 | } |
452 | ||
3be11131 RS |
453 | /* Adjust point for an insertion of NBYTES bytes, which are NCHARS characters. |
454 | ||
455 | This is used only when the value of point changes due to an insert | |
456 | or delete; it does not represent a conceptual change in point as a | |
457 | marker. In particular, point is not crossing any interval | |
458 | boundaries, so there's no need to use the usual SET_PT macro. In | |
459 | fact it would be incorrect to do so, because either the old or the | |
460 | new value of point is out of sync with the current set of | |
461 | intervals. */ | |
462 | ||
a27a38d8 | 463 | static void |
3be11131 RS |
464 | adjust_point (nchars, nbytes) |
465 | int nchars, nbytes; | |
a27a38d8 | 466 | { |
3be11131 RS |
467 | BUF_PT (current_buffer) += nchars; |
468 | BUF_PT_BYTE (current_buffer) += nbytes; | |
469 | ||
470 | /* In a single-byte buffer, the two positions must be equal. */ | |
471 | if (ZV == ZV_BYTE | |
472 | && PT != PT_BYTE) | |
473 | abort (); | |
a27a38d8 | 474 | } |
b45433b3 | 475 | \f |
652838b5 KH |
476 | /* Adjust markers for a replacement of a text at FROM (FROM_BYTE) of |
477 | length OLD_CHARS (OLD_BYTES) to a new text of length NEW_CHARS | |
adee4f91 KH |
478 | (NEW_BYTES). It is assumed that OLD_CHARS > 0, i.e., this is not |
479 | an insertion. */ | |
652838b5 KH |
480 | |
481 | static void | |
482 | adjust_markers_for_replace (from, from_byte, old_chars, old_bytes, | |
b16afa45 | 483 | new_chars, new_bytes) |
652838b5 | 484 | int from, from_byte, old_chars, old_bytes, new_chars, new_bytes; |
652838b5 | 485 | { |
dab0b04d | 486 | register struct Lisp_Marker *m; |
652838b5 | 487 | int prev_to_byte = from_byte + old_bytes; |
b16afa45 | 488 | int diff_chars = new_chars - old_chars; |
652838b5 KH |
489 | int diff_bytes = new_bytes - old_bytes; |
490 | ||
dab0b04d | 491 | for (m = BUF_MARKERS (current_buffer); m; m = m->next) |
652838b5 | 492 | { |
adee4f91 | 493 | if (m->bytepos >= prev_to_byte) |
652838b5 | 494 | { |
adee4f91 KH |
495 | m->charpos += diff_chars; |
496 | m->bytepos += diff_bytes; | |
652838b5 | 497 | } |
adee4f91 | 498 | else if (m->bytepos > from_byte) |
652838b5 | 499 | { |
652838b5 | 500 | m->charpos = from; |
b16afa45 | 501 | m->bytepos = from_byte; |
652838b5 | 502 | } |
652838b5 | 503 | } |
3019692c KH |
504 | |
505 | CHECK_MARKERS (); | |
652838b5 KH |
506 | } |
507 | ||
508 | \f | |
3be11131 | 509 | /* Make the gap NBYTES_ADDED bytes longer. */ |
b45433b3 | 510 | |
c660b094 | 511 | void |
8af5b8e7 | 512 | make_gap_larger (nbytes_added) |
3be11131 | 513 | int nbytes_added; |
b45433b3 | 514 | { |
b45433b3 JB |
515 | Lisp_Object tem; |
516 | int real_gap_loc; | |
3be11131 | 517 | int real_gap_loc_byte; |
b45433b3 JB |
518 | int old_gap_size; |
519 | ||
520 | /* If we have to get more space, get enough to last a while. */ | |
3be11131 | 521 | nbytes_added += 2000; |
b45433b3 | 522 | |
94056516 RS |
523 | /* Don't allow a buffer size that won't fit in an int |
524 | even if it will fit in a Lisp integer. | |
e17144de AS |
525 | That won't work because so many places use `int'. |
526 | ||
527 | Make sure we don't introduce overflows in the calculation. */ | |
177c0ea7 | 528 | |
e17144de AS |
529 | if (Z_BYTE - BEG_BYTE + GAP_SIZE |
530 | >= (((EMACS_INT) 1 << (min (VALBITS, BITS_PER_INT) - 1)) - 1 | |
531 | - nbytes_added)) | |
14f6194b | 532 | error ("Buffer exceeds maximum size"); |
94056516 | 533 | |
71a7bfa7 | 534 | enlarge_buffer_text (current_buffer, nbytes_added); |
b45433b3 JB |
535 | |
536 | /* Prevent quitting in move_gap. */ | |
537 | tem = Vinhibit_quit; | |
538 | Vinhibit_quit = Qt; | |
539 | ||
540 | real_gap_loc = GPT; | |
3be11131 | 541 | real_gap_loc_byte = GPT_BYTE; |
b45433b3 JB |
542 | old_gap_size = GAP_SIZE; |
543 | ||
544 | /* Call the newly allocated space a gap at the end of the whole space. */ | |
545 | GPT = Z + GAP_SIZE; | |
7d92db58 | 546 | GPT_BYTE = Z_BYTE + GAP_SIZE; |
3be11131 | 547 | GAP_SIZE = nbytes_added; |
b45433b3 JB |
548 | |
549 | /* Move the new gap down to be consecutive with the end of the old one. | |
550 | This adjusts the markers properly too. */ | |
3be11131 | 551 | gap_left (real_gap_loc + old_gap_size, real_gap_loc_byte + old_gap_size, 1); |
b45433b3 JB |
552 | |
553 | /* Now combine the two into one large gap. */ | |
554 | GAP_SIZE += old_gap_size; | |
555 | GPT = real_gap_loc; | |
3be11131 | 556 | GPT_BYTE = real_gap_loc_byte; |
b45433b3 | 557 | |
469ff680 KH |
558 | /* Put an anchor. */ |
559 | *(Z_ADDR) = 0; | |
560 | ||
b45433b3 JB |
561 | Vinhibit_quit = tem; |
562 | } | |
8af5b8e7 AI |
563 | |
564 | ||
7273faa1 | 565 | /* Make the gap NBYTES_REMOVED bytes shorter. */ |
8af5b8e7 AI |
566 | |
567 | void | |
568 | make_gap_smaller (nbytes_removed) | |
569 | int nbytes_removed; | |
570 | { | |
571 | Lisp_Object tem; | |
572 | int real_gap_loc; | |
573 | int real_gap_loc_byte; | |
574 | int real_Z; | |
575 | int real_Z_byte; | |
73df3b72 KS |
576 | int real_beg_unchanged; |
577 | int new_gap_size; | |
8af5b8e7 AI |
578 | |
579 | /* Make sure the gap is at least 20 bytes. */ | |
580 | if (GAP_SIZE - nbytes_removed < 20) | |
581 | nbytes_removed = GAP_SIZE - 20; | |
582 | ||
583 | /* Prevent quitting in move_gap. */ | |
584 | tem = Vinhibit_quit; | |
585 | Vinhibit_quit = Qt; | |
586 | ||
587 | real_gap_loc = GPT; | |
588 | real_gap_loc_byte = GPT_BYTE; | |
73df3b72 | 589 | new_gap_size = GAP_SIZE - nbytes_removed; |
8af5b8e7 AI |
590 | real_Z = Z; |
591 | real_Z_byte = Z_BYTE; | |
73df3b72 | 592 | real_beg_unchanged = BEG_UNCHANGED; |
8af5b8e7 AI |
593 | |
594 | /* Pretend that the last unwanted part of the gap is the entire gap, | |
595 | and that the first desired part of the gap is part of the buffer | |
596 | text. */ | |
73df3b72 KS |
597 | bzero (GPT_ADDR, new_gap_size); |
598 | GPT += new_gap_size; | |
599 | GPT_BYTE += new_gap_size; | |
600 | Z += new_gap_size; | |
601 | Z_BYTE += new_gap_size; | |
8af5b8e7 AI |
602 | GAP_SIZE = nbytes_removed; |
603 | ||
604 | /* Move the unwanted pretend gap to the end of the buffer. This | |
605 | adjusts the markers properly too. */ | |
606 | gap_right (Z, Z_BYTE); | |
607 | ||
608 | enlarge_buffer_text (current_buffer, -nbytes_removed); | |
609 | ||
610 | /* Now restore the desired gap. */ | |
73df3b72 | 611 | GAP_SIZE = new_gap_size; |
8af5b8e7 AI |
612 | GPT = real_gap_loc; |
613 | GPT_BYTE = real_gap_loc_byte; | |
614 | Z = real_Z; | |
615 | Z_BYTE = real_Z_byte; | |
73df3b72 | 616 | BEG_UNCHANGED = real_beg_unchanged; |
8af5b8e7 AI |
617 | |
618 | /* Put an anchor. */ | |
619 | *(Z_ADDR) = 0; | |
620 | ||
621 | Vinhibit_quit = tem; | |
622 | } | |
623 | ||
624 | void | |
625 | make_gap (nbytes_added) | |
626 | int nbytes_added; | |
627 | { | |
628 | if (nbytes_added >= 0) | |
629 | make_gap_larger (nbytes_added); | |
d77fbc16 | 630 | #if defined USE_MMAP_FOR_BUFFERS || defined REL_ALLOC || defined DOUG_LEA_MALLOC |
8af5b8e7 AI |
631 | else |
632 | make_gap_smaller (-nbytes_added); | |
633 | #endif | |
634 | } | |
b45433b3 | 635 | \f |
2b083808 RS |
636 | /* Copy NBYTES bytes of text from FROM_ADDR to TO_ADDR. |
637 | FROM_MULTIBYTE says whether the incoming text is multibyte. | |
638 | TO_MULTIBYTE says whether to store the text as multibyte. | |
639 | If FROM_MULTIBYTE != TO_MULTIBYTE, we convert. | |
640 | ||
641 | Return the number of bytes stored at TO_ADDR. */ | |
642 | ||
643 | int | |
644 | copy_text (from_addr, to_addr, nbytes, | |
645 | from_multibyte, to_multibyte) | |
641a26d2 | 646 | const unsigned char *from_addr; |
2b083808 RS |
647 | unsigned char *to_addr; |
648 | int nbytes; | |
649 | int from_multibyte, to_multibyte; | |
650 | { | |
651 | if (from_multibyte == to_multibyte) | |
652 | { | |
653 | bcopy (from_addr, to_addr, nbytes); | |
654 | return nbytes; | |
655 | } | |
656 | else if (from_multibyte) | |
657 | { | |
658 | int nchars = 0; | |
659 | int bytes_left = nbytes; | |
6021f7c5 | 660 | Lisp_Object tbl = Qnil; |
f44cbcd8 KH |
661 | |
662 | /* We set the variable tbl to the reverse table of | |
663 | Vnonascii_translation_table in advance. */ | |
664 | if (CHAR_TABLE_P (Vnonascii_translation_table)) | |
665 | { | |
666 | tbl = Fchar_table_extra_slot (Vnonascii_translation_table, | |
667 | make_number (0)); | |
668 | if (!CHAR_TABLE_P (tbl)) | |
669 | tbl = Qnil; | |
670 | } | |
2b083808 RS |
671 | |
672 | /* Convert multibyte to single byte. */ | |
673 | while (bytes_left > 0) | |
674 | { | |
b16afa45 KH |
675 | int thislen, c; |
676 | c = STRING_CHAR_AND_LENGTH (from_addr, bytes_left, thislen); | |
f44cbcd8 | 677 | if (!SINGLE_BYTE_CHAR_P (c)) |
4ec36780 | 678 | c = multibyte_char_to_unibyte (c, tbl); |
f44cbcd8 | 679 | *to_addr++ = c; |
2b083808 | 680 | from_addr += thislen; |
7e79b8e0 | 681 | bytes_left -= thislen; |
2b083808 RS |
682 | nchars++; |
683 | } | |
684 | return nchars; | |
685 | } | |
686 | else | |
687 | { | |
688 | unsigned char *initial_to_addr = to_addr; | |
689 | ||
690 | /* Convert single-byte to multibyte. */ | |
691 | while (nbytes > 0) | |
692 | { | |
693 | int c = *from_addr++; | |
2b083808 | 694 | |
b16afa45 | 695 | if (c >= 0200) |
2b083808 | 696 | { |
59a52d50 | 697 | c = unibyte_char_to_multibyte (c); |
0ef71121 | 698 | to_addr += CHAR_STRING (c, to_addr); |
2b083808 RS |
699 | nbytes--; |
700 | } | |
701 | else | |
702 | /* Special case for speed. */ | |
703 | *to_addr++ = c, nbytes--; | |
704 | } | |
705 | return to_addr - initial_to_addr; | |
706 | } | |
707 | } | |
708 | ||
709 | /* Return the number of bytes it would take | |
710 | to convert some single-byte text to multibyte. | |
711 | The single-byte text consists of NBYTES bytes at PTR. */ | |
712 | ||
713 | int | |
714 | count_size_as_multibyte (ptr, nbytes) | |
641a26d2 | 715 | const unsigned char *ptr; |
2b083808 RS |
716 | int nbytes; |
717 | { | |
718 | int i; | |
719 | int outgoing_nbytes = 0; | |
720 | ||
721 | for (i = 0; i < nbytes; i++) | |
722 | { | |
723 | unsigned int c = *ptr++; | |
59a52d50 | 724 | |
b16afa45 | 725 | if (c < 0200) |
59a52d50 KH |
726 | outgoing_nbytes++; |
727 | else | |
2b083808 | 728 | { |
59a52d50 | 729 | c = unibyte_char_to_multibyte (c); |
643044eb | 730 | outgoing_nbytes += CHAR_BYTES (c); |
2b083808 | 731 | } |
2b083808 RS |
732 | } |
733 | ||
734 | return outgoing_nbytes; | |
735 | } | |
736 | \f | |
b45433b3 | 737 | /* Insert a string of specified length before point. |
2b083808 RS |
738 | This function judges multibyteness based on |
739 | enable_multibyte_characters in the current buffer; | |
740 | it never converts between single-byte and multibyte. | |
741 | ||
ef29f213 KH |
742 | DO NOT use this for the contents of a Lisp string or a Lisp buffer! |
743 | prepare_to_modify_buffer could relocate the text. */ | |
b45433b3 | 744 | |
c660b094 | 745 | void |
3be11131 | 746 | insert (string, nbytes) |
641a26d2 | 747 | register const unsigned char *string; |
dfcf069d | 748 | register int nbytes; |
b45433b3 | 749 | { |
3be11131 | 750 | if (nbytes > 0) |
395ec62e | 751 | { |
bab3eee1 EZ |
752 | int len = chars_in_text (string, nbytes), opoint; |
753 | insert_1_both (string, len, nbytes, 0, 1, 0); | |
754 | opoint = PT - len; | |
755 | signal_after_change (opoint, 0, len); | |
0ef71121 | 756 | update_compositions (opoint, PT, CHECK_BORDER); |
cd11ef31 RS |
757 | } |
758 | } | |
759 | ||
2b083808 RS |
760 | /* Likewise, but inherit text properties from neighboring characters. */ |
761 | ||
c660b094 | 762 | void |
3be11131 | 763 | insert_and_inherit (string, nbytes) |
641a26d2 | 764 | register const unsigned char *string; |
dfcf069d | 765 | register int nbytes; |
cd11ef31 | 766 | { |
3be11131 | 767 | if (nbytes > 0) |
cd11ef31 | 768 | { |
bab3eee1 EZ |
769 | int len = chars_in_text (string, nbytes), opoint; |
770 | insert_1_both (string, len, nbytes, 1, 1, 0); | |
771 | opoint = PT - len; | |
772 | signal_after_change (opoint, 0, len); | |
0ef71121 | 773 | update_compositions (opoint, PT, CHECK_BORDER); |
395ec62e KH |
774 | } |
775 | } | |
b45433b3 | 776 | |
2b083808 | 777 | /* Insert the character C before point. Do not inherit text properties. */ |
3be11131 | 778 | |
c660b094 | 779 | void |
3be11131 RS |
780 | insert_char (c) |
781 | int c; | |
782 | { | |
0ef71121 | 783 | unsigned char str[MAX_MULTIBYTE_LENGTH]; |
2b083808 RS |
784 | int len; |
785 | ||
786 | if (! NILP (current_buffer->enable_multibyte_characters)) | |
0ef71121 | 787 | len = CHAR_STRING (c, str); |
2b083808 RS |
788 | else |
789 | { | |
790 | len = 1; | |
0ef71121 | 791 | str[0] = c; |
2b083808 | 792 | } |
3be11131 RS |
793 | |
794 | insert (str, len); | |
795 | } | |
796 | ||
2b083808 | 797 | /* Insert the null-terminated string S before point. */ |
3be11131 RS |
798 | |
799 | void | |
800 | insert_string (s) | |
641a26d2 | 801 | const char *s; |
3be11131 RS |
802 | { |
803 | insert (s, strlen (s)); | |
804 | } | |
805 | ||
806 | /* Like `insert' except that all markers pointing at the place where | |
807 | the insertion happens are adjusted to point after it. | |
808 | Don't use this function to insert part of a Lisp string, | |
809 | since gc could happen and relocate it. */ | |
810 | ||
811 | void | |
812 | insert_before_markers (string, nbytes) | |
641a26d2 | 813 | const unsigned char *string; |
3be11131 RS |
814 | register int nbytes; |
815 | { | |
816 | if (nbytes > 0) | |
817 | { | |
bab3eee1 EZ |
818 | int len = chars_in_text (string, nbytes), opoint; |
819 | insert_1_both (string, len, nbytes, 0, 1, 1); | |
820 | opoint = PT - len; | |
821 | signal_after_change (opoint, 0, len); | |
0ef71121 | 822 | update_compositions (opoint, PT, CHECK_BORDER); |
3be11131 RS |
823 | } |
824 | } | |
825 | ||
2b083808 RS |
826 | /* Likewise, but inherit text properties from neighboring characters. */ |
827 | ||
3be11131 RS |
828 | void |
829 | insert_before_markers_and_inherit (string, nbytes) | |
641a26d2 | 830 | const unsigned char *string; |
3be11131 RS |
831 | register int nbytes; |
832 | { | |
833 | if (nbytes > 0) | |
834 | { | |
bab3eee1 EZ |
835 | int len = chars_in_text (string, nbytes), opoint; |
836 | insert_1_both (string, len, nbytes, 1, 1, 1); | |
837 | opoint = PT - len; | |
838 | signal_after_change (opoint, 0, len); | |
0ef71121 | 839 | update_compositions (opoint, PT, CHECK_BORDER); |
3be11131 RS |
840 | } |
841 | } | |
1f90a790 | 842 | |
3be11131 RS |
843 | /* Subroutine used by the insert functions above. */ |
844 | ||
845 | void | |
846 | insert_1 (string, nbytes, inherit, prepare, before_markers) | |
641a26d2 | 847 | register const unsigned char *string; |
3be11131 RS |
848 | register int nbytes; |
849 | int inherit, prepare, before_markers; | |
395ec62e | 850 | { |
432f78d2 RS |
851 | insert_1_both (string, chars_in_text (string, nbytes), nbytes, |
852 | inherit, prepare, before_markers); | |
853 | } | |
b16afa45 | 854 | |
1f90a790 | 855 | \f |
b16afa45 KH |
856 | #ifdef BYTE_COMBINING_DEBUG |
857 | ||
432f78d2 RS |
858 | /* See if the bytes before POS/POS_BYTE combine with bytes |
859 | at the start of STRING to form a single character. | |
ce97a2d7 | 860 | If so, return the number of bytes at the start of STRING |
432f78d2 | 861 | which combine in this way. Otherwise, return 0. */ |
b45433b3 | 862 | |
432f78d2 RS |
863 | int |
864 | count_combining_before (string, length, pos, pos_byte) | |
641a26d2 | 865 | const unsigned char *string; |
432f78d2 RS |
866 | int length; |
867 | int pos, pos_byte; | |
868 | { | |
cae184f2 | 869 | int len, combining_bytes; |
641a26d2 | 870 | const unsigned char *p; |
b45433b3 | 871 | |
432f78d2 RS |
872 | if (NILP (current_buffer->enable_multibyte_characters)) |
873 | return 0; | |
cae184f2 KH |
874 | |
875 | /* At first, we can exclude the following cases: | |
876 | (1) STRING[0] can't be a following byte of multibyte sequence. | |
877 | (2) POS is the start of the current buffer. | |
878 | (3) A character before POS is not a multibyte character. */ | |
879 | if (length == 0 || CHAR_HEAD_P (*string)) /* case (1) */ | |
432f78d2 | 880 | return 0; |
cae184f2 | 881 | if (pos_byte == BEG_BYTE) /* case (2) */ |
432f78d2 | 882 | return 0; |
cae184f2 KH |
883 | len = 1; |
884 | p = BYTE_POS_ADDR (pos_byte - 1); | |
885 | while (! CHAR_HEAD_P (*p)) p--, len++; | |
886 | if (! BASE_LEADING_CODE_P (*p)) /* case (3) */ | |
432f78d2 | 887 | return 0; |
cae184f2 | 888 | |
cae184f2 KH |
889 | combining_bytes = BYTES_BY_CHAR_HEAD (*p) - len; |
890 | if (combining_bytes <= 0) | |
891 | /* The character preceding POS is, complete and no room for | |
892 | combining bytes (combining_bytes == 0), or an independent 8-bit | |
893 | character (combining_bytes < 0). */ | |
432f78d2 | 894 | return 0; |
ce97a2d7 | 895 | |
cae184f2 KH |
896 | /* We have a combination situation. Count the bytes at STRING that |
897 | may combine. */ | |
898 | p = string + 1; | |
ce97a2d7 RS |
899 | while (!CHAR_HEAD_P (*p) && p < string + length) |
900 | p++; | |
901 | ||
cae184f2 | 902 | return (combining_bytes < p - string ? combining_bytes : p - string); |
432f78d2 | 903 | } |
b45433b3 | 904 | |
432f78d2 RS |
905 | /* See if the bytes after POS/POS_BYTE combine with bytes |
906 | at the end of STRING to form a single character. | |
907 | If so, return the number of bytes after POS/POS_BYTE | |
908 | which combine in this way. Otherwise, return 0. */ | |
679194a6 | 909 | |
432f78d2 RS |
910 | int |
911 | count_combining_after (string, length, pos, pos_byte) | |
641a26d2 | 912 | const unsigned char *string; |
432f78d2 RS |
913 | int length; |
914 | int pos, pos_byte; | |
915 | { | |
6021f7c5 | 916 | int opos_byte = pos_byte; |
432f78d2 | 917 | int i; |
6021f7c5 | 918 | int bytes; |
cae184f2 | 919 | unsigned char *bufp; |
3be11131 | 920 | |
432f78d2 RS |
921 | if (NILP (current_buffer->enable_multibyte_characters)) |
922 | return 0; | |
cae184f2 KH |
923 | |
924 | /* At first, we can exclude the following cases: | |
925 | (1) The last byte of STRING is an ASCII. | |
926 | (2) POS is the last of the current buffer. | |
927 | (3) A character at POS can't be a following byte of multibyte | |
928 | character. */ | |
929 | if (length > 0 && ASCII_BYTE_P (string[length - 1])) /* case (1) */ | |
930 | return 0; | |
931 | if (pos_byte == Z_BYTE) /* case (2) */ | |
432f78d2 | 932 | return 0; |
cae184f2 KH |
933 | bufp = BYTE_POS_ADDR (pos_byte); |
934 | if (CHAR_HEAD_P (*bufp)) /* case (3) */ | |
935 | return 0; | |
936 | ||
432f78d2 | 937 | i = length - 1; |
b57a7b0b | 938 | while (i >= 0 && ! CHAR_HEAD_P (string[i])) |
432f78d2 RS |
939 | { |
940 | i--; | |
941 | } | |
b57a7b0b KH |
942 | if (i < 0) |
943 | { | |
cae184f2 KH |
944 | /* All characters in STRING are not character head. We must |
945 | check also preceding bytes at POS. We are sure that the gap | |
946 | is at POS. */ | |
947 | unsigned char *p = BEG_ADDR; | |
b57a7b0b | 948 | i = pos_byte - 2; |
cae184f2 | 949 | while (i >= 0 && ! CHAR_HEAD_P (p[i])) |
b57a7b0b | 950 | i--; |
cae184f2 | 951 | if (i < 0 || !BASE_LEADING_CODE_P (p[i])) |
b57a7b0b | 952 | return 0; |
0ef71121 | 953 | |
cae184f2 KH |
954 | bytes = BYTES_BY_CHAR_HEAD (p[i]); |
955 | return (bytes <= pos_byte - 1 - i + length | |
956 | ? 0 | |
957 | : bytes - (pos_byte - 1 - i + length)); | |
b57a7b0b | 958 | } |
cae184f2 | 959 | if (!BASE_LEADING_CODE_P (string[i])) |
432f78d2 RS |
960 | return 0; |
961 | ||
cae184f2 KH |
962 | bytes = BYTES_BY_CHAR_HEAD (string[i]) - (length - i); |
963 | bufp++, pos_byte++; | |
964 | while (!CHAR_HEAD_P (*bufp)) bufp++, pos_byte++; | |
cd11ef31 | 965 | |
cae184f2 | 966 | return (bytes <= pos_byte - opos_byte ? bytes : pos_byte - opos_byte); |
b45433b3 | 967 | } |
2b083808 | 968 | |
b16afa45 | 969 | #endif |
9f3ede3c | 970 | |
1f90a790 | 971 | \f |
2b083808 RS |
972 | /* Insert a sequence of NCHARS chars which occupy NBYTES bytes |
973 | starting at STRING. INHERIT, PREPARE and BEFORE_MARKERS | |
974 | are the same as in insert_1. */ | |
975 | ||
976 | void | |
977 | insert_1_both (string, nchars, nbytes, inherit, prepare, before_markers) | |
641a26d2 | 978 | register const unsigned char *string; |
2b083808 RS |
979 | register int nchars, nbytes; |
980 | int inherit, prepare, before_markers; | |
981 | { | |
da80a8d5 GM |
982 | if (nchars == 0) |
983 | return; | |
177c0ea7 | 984 | |
57404188 KH |
985 | if (NILP (current_buffer->enable_multibyte_characters)) |
986 | nchars = nbytes; | |
987 | ||
35d63725 RS |
988 | if (prepare) |
989 | /* Do this before moving and increasing the gap, | |
990 | because the before-change hooks might move the gap | |
991 | or make it smaller. */ | |
992 | prepare_to_modify_buffer (PT, PT, NULL); | |
993 | ||
2b083808 RS |
994 | if (PT != GPT) |
995 | move_gap_both (PT, PT_BYTE); | |
996 | if (GAP_SIZE < nbytes) | |
997 | make_gap (nbytes - GAP_SIZE); | |
998 | ||
b16afa45 KH |
999 | #ifdef BYTE_COMBINING_DEBUG |
1000 | if (count_combining_before (string, nbytes, PT, PT_BYTE) | |
1001 | || count_combining_after (string, nbytes, PT, PT_BYTE)) | |
1002 | abort (); | |
1003 | #endif | |
432f78d2 RS |
1004 | |
1005 | /* Record deletion of the surrounding text that combines with | |
1006 | the insertion. This, together with recording the insertion, | |
b16afa45 KH |
1007 | will add up to the right stuff in the undo list. */ |
1008 | record_insert (PT, nchars); | |
2b083808 | 1009 | MODIFF++; |
3e145152 | 1010 | CHARS_MODIFF = MODIFF; |
2b083808 RS |
1011 | |
1012 | bcopy (string, GPT_ADDR, nbytes); | |
1013 | ||
2b083808 | 1014 | GAP_SIZE -= nbytes; |
1f90a790 RS |
1015 | GPT += nchars; |
1016 | ZV += nchars; | |
1017 | Z += nchars; | |
2b083808 RS |
1018 | GPT_BYTE += nbytes; |
1019 | ZV_BYTE += nbytes; | |
1020 | Z_BYTE += nbytes; | |
1021 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1f90a790 | 1022 | |
1f90a790 RS |
1023 | if (GPT_BYTE < GPT) |
1024 | abort (); | |
1025 | ||
9dde4e0c KS |
1026 | /* The insert may have been in the unchanged region, so check again. */ |
1027 | if (Z - GPT < END_UNCHANGED) | |
1028 | END_UNCHANGED = Z - GPT; | |
1029 | ||
1f90a790 | 1030 | adjust_overlays_for_insert (PT, nchars); |
432f78d2 | 1031 | adjust_markers_for_insert (PT, PT_BYTE, |
1f90a790 | 1032 | PT + nchars, PT_BYTE + nbytes, |
2b083808 | 1033 | before_markers); |
ce97a2d7 | 1034 | |
1f90a790 | 1035 | if (BUF_INTERVALS (current_buffer) != 0) |
1f90a790 RS |
1036 | offset_intervals (current_buffer, PT, nchars); |
1037 | ||
ce97a2d7 | 1038 | if (!inherit && BUF_INTERVALS (current_buffer) != 0) |
f2cab2ea GM |
1039 | set_text_properties (make_number (PT), make_number (PT + nchars), |
1040 | Qnil, Qnil, Qnil); | |
ce97a2d7 | 1041 | |
b16afa45 | 1042 | adjust_point (nchars, nbytes); |
828f1ed3 KH |
1043 | |
1044 | CHECK_MARKERS (); | |
2b083808 | 1045 | } |
3be11131 | 1046 | \f |
679194a6 | 1047 | /* Insert the part of the text of STRING, a Lisp object assumed to be |
2b083808 RS |
1048 | of type string, consisting of the LENGTH characters (LENGTH_BYTE bytes) |
1049 | starting at position POS / POS_BYTE. If the text of STRING has properties, | |
1050 | copy them into the buffer. | |
679194a6 JA |
1051 | |
1052 | It does not work to use `insert' for this, because a GC could happen | |
7e1ea612 JB |
1053 | before we bcopy the stuff into the buffer, and relocate the string |
1054 | without insert noticing. */ | |
679194a6 | 1055 | |
c660b094 | 1056 | void |
2b083808 | 1057 | insert_from_string (string, pos, pos_byte, length, length_byte, inherit) |
b45433b3 | 1058 | Lisp_Object string; |
2b083808 | 1059 | register int pos, pos_byte, length, length_byte; |
9391e591 | 1060 | int inherit; |
395ec62e | 1061 | { |
62b82678 | 1062 | int opoint = PT; |
d8bf4256 RS |
1063 | |
1064 | if (SCHARS (string) == 0) | |
1065 | return; | |
1066 | ||
62b82678 RS |
1067 | insert_from_string_1 (string, pos, pos_byte, length, length_byte, |
1068 | inherit, 0); | |
1069 | signal_after_change (opoint, 0, PT - opoint); | |
0ef71121 | 1070 | update_compositions (opoint, PT, CHECK_BORDER); |
395ec62e KH |
1071 | } |
1072 | ||
2b083808 RS |
1073 | /* Like `insert_from_string' except that all markers pointing |
1074 | at the place where the insertion happens are adjusted to point after it. */ | |
3be11131 RS |
1075 | |
1076 | void | |
2b083808 RS |
1077 | insert_from_string_before_markers (string, pos, pos_byte, |
1078 | length, length_byte, inherit) | |
395ec62e | 1079 | Lisp_Object string; |
2b083808 | 1080 | register int pos, pos_byte, length, length_byte; |
395ec62e | 1081 | int inherit; |
3be11131 | 1082 | { |
62b82678 | 1083 | int opoint = PT; |
d8bf4256 RS |
1084 | |
1085 | if (SCHARS (string) == 0) | |
1086 | return; | |
1087 | ||
62b82678 RS |
1088 | insert_from_string_1 (string, pos, pos_byte, length, length_byte, |
1089 | inherit, 1); | |
1090 | signal_after_change (opoint, 0, PT - opoint); | |
0ef71121 | 1091 | update_compositions (opoint, PT, CHECK_BORDER); |
3be11131 RS |
1092 | } |
1093 | ||
1094 | /* Subroutine of the insertion functions above. */ | |
1095 | ||
1096 | static void | |
2b083808 RS |
1097 | insert_from_string_1 (string, pos, pos_byte, nchars, nbytes, |
1098 | inherit, before_markers) | |
3be11131 | 1099 | Lisp_Object string; |
2b083808 | 1100 | register int pos, pos_byte, nchars, nbytes; |
3be11131 | 1101 | int inherit, before_markers; |
b45433b3 | 1102 | { |
b45433b3 | 1103 | struct gcpro gcpro1; |
2b083808 | 1104 | int outgoing_nbytes = nbytes; |
ce97a2d7 | 1105 | INTERVAL intervals; |
2b083808 RS |
1106 | |
1107 | /* Make OUTGOING_NBYTES describe the text | |
1108 | as it will be inserted in this buffer. */ | |
1109 | ||
1110 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1111 | outgoing_nbytes = nchars; | |
2a1d8be0 | 1112 | else if (! STRING_MULTIBYTE (string)) |
2b083808 | 1113 | outgoing_nbytes |
f7e233a8 | 1114 | = count_size_as_multibyte (SDATA (string) + pos_byte, |
2b083808 | 1115 | nbytes); |
b45433b3 | 1116 | |
b45433b3 | 1117 | GCPRO1 (string); |
35d63725 RS |
1118 | /* Do this before moving and increasing the gap, |
1119 | because the before-change hooks might move the gap | |
1120 | or make it smaller. */ | |
d206af14 | 1121 | prepare_to_modify_buffer (PT, PT, NULL); |
b45433b3 | 1122 | |
2bcaed71 | 1123 | if (PT != GPT) |
3be11131 | 1124 | move_gap_both (PT, PT_BYTE); |
534b9840 | 1125 | if (GAP_SIZE < outgoing_nbytes) |
2b083808 | 1126 | make_gap (outgoing_nbytes - GAP_SIZE); |
b45433b3 JB |
1127 | UNGCPRO; |
1128 | ||
2b083808 RS |
1129 | /* Copy the string text into the buffer, perhaps converting |
1130 | between single-byte and multibyte. */ | |
d5db4077 | 1131 | copy_text (SDATA (string) + pos_byte, GPT_ADDR, nbytes, |
2a1d8be0 | 1132 | STRING_MULTIBYTE (string), |
2b083808 | 1133 | ! NILP (current_buffer->enable_multibyte_characters)); |
b45433b3 | 1134 | |
b16afa45 | 1135 | #ifdef BYTE_COMBINING_DEBUG |
432f78d2 RS |
1136 | /* We have copied text into the gap, but we have not altered |
1137 | PT or PT_BYTE yet. So we can pass PT and PT_BYTE | |
1138 | to these functions and get the same results as we would | |
1139 | have got earlier on. Meanwhile, PT_ADDR does point to | |
1140 | the text that has been stored by copy_text. */ | |
b16afa45 KH |
1141 | if (count_combining_before (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE) |
1142 | || count_combining_after (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE)) | |
1143 | abort (); | |
1144 | #endif | |
432f78d2 | 1145 | |
b16afa45 | 1146 | record_insert (PT, nchars); |
432f78d2 | 1147 | MODIFF++; |
3e145152 | 1148 | CHARS_MODIFF = MODIFF; |
432f78d2 | 1149 | |
7792090e | 1150 | GAP_SIZE -= outgoing_nbytes; |
1f90a790 RS |
1151 | GPT += nchars; |
1152 | ZV += nchars; | |
1153 | Z += nchars; | |
2b083808 RS |
1154 | GPT_BYTE += outgoing_nbytes; |
1155 | ZV_BYTE += outgoing_nbytes; | |
1156 | Z_BYTE += outgoing_nbytes; | |
469ff680 | 1157 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
3be11131 RS |
1158 | |
1159 | if (GPT_BYTE < GPT) | |
1160 | abort (); | |
679194a6 | 1161 | |
9dde4e0c KS |
1162 | /* The insert may have been in the unchanged region, so check again. */ |
1163 | if (Z - GPT < END_UNCHANGED) | |
1164 | END_UNCHANGED = Z - GPT; | |
1165 | ||
1f90a790 RS |
1166 | adjust_overlays_for_insert (PT, nchars); |
1167 | adjust_markers_for_insert (PT, PT_BYTE, PT + nchars, | |
1168 | PT_BYTE + outgoing_nbytes, | |
1f90a790 | 1169 | before_markers); |
ce97a2d7 | 1170 | |
1f90a790 RS |
1171 | offset_intervals (current_buffer, PT, nchars); |
1172 | ||
d5db4077 | 1173 | intervals = STRING_INTERVALS (string); |
b16afa45 | 1174 | /* Get the intervals for the part of the string we are inserting. */ |
d5db4077 | 1175 | if (nbytes < SBYTES (string)) |
1f90a790 | 1176 | intervals = copy_intervals (intervals, pos, nchars); |
177c0ea7 | 1177 | |
ce97a2d7 | 1178 | /* Insert those intervals. */ |
1f90a790 | 1179 | graft_intervals_into_buffer (intervals, PT, nchars, |
9391e591 | 1180 | current_buffer, inherit); |
ce97a2d7 | 1181 | |
b16afa45 | 1182 | adjust_point (nchars, outgoing_nbytes); |
b45433b3 | 1183 | } |
3be11131 RS |
1184 | \f |
1185 | /* Insert text from BUF, NCHARS characters starting at CHARPOS, into the | |
ef29f213 KH |
1186 | current buffer. If the text in BUF has properties, they are absorbed |
1187 | into the current buffer. | |
1188 | ||
1189 | It does not work to use `insert' for this, because a malloc could happen | |
1190 | and relocate BUF's text before the bcopy happens. */ | |
1191 | ||
1192 | void | |
3be11131 | 1193 | insert_from_buffer (buf, charpos, nchars, inherit) |
ef29f213 | 1194 | struct buffer *buf; |
3be11131 | 1195 | int charpos, nchars; |
ef29f213 KH |
1196 | int inherit; |
1197 | { | |
62b82678 | 1198 | int opoint = PT; |
3be11131 | 1199 | |
62b82678 RS |
1200 | insert_from_buffer_1 (buf, charpos, nchars, inherit); |
1201 | signal_after_change (opoint, 0, PT - opoint); | |
0ef71121 | 1202 | update_compositions (opoint, PT, CHECK_BORDER); |
ef29f213 KH |
1203 | } |
1204 | ||
1205 | static void | |
3be11131 | 1206 | insert_from_buffer_1 (buf, from, nchars, inherit) |
ef29f213 | 1207 | struct buffer *buf; |
3be11131 | 1208 | int from, nchars; |
ef29f213 KH |
1209 | int inherit; |
1210 | { | |
0aa8c4b2 | 1211 | register Lisp_Object temp; |
4468c4f1 | 1212 | int chunk, chunk_expanded; |
3be11131 RS |
1213 | int from_byte = buf_charpos_to_bytepos (buf, from); |
1214 | int to_byte = buf_charpos_to_bytepos (buf, from + nchars); | |
2b083808 RS |
1215 | int incoming_nbytes = to_byte - from_byte; |
1216 | int outgoing_nbytes = incoming_nbytes; | |
ce97a2d7 | 1217 | INTERVAL intervals; |
2b083808 RS |
1218 | |
1219 | /* Make OUTGOING_NBYTES describe the text | |
1220 | as it will be inserted in this buffer. */ | |
1221 | ||
1222 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1223 | outgoing_nbytes = nchars; | |
1224 | else if (NILP (buf->enable_multibyte_characters)) | |
4468c4f1 KH |
1225 | { |
1226 | int outgoing_before_gap = 0; | |
1227 | int outgoing_after_gap = 0; | |
ef29f213 | 1228 | |
4468c4f1 KH |
1229 | if (from < BUF_GPT (buf)) |
1230 | { | |
1231 | chunk = BUF_GPT_BYTE (buf) - from_byte; | |
1232 | if (chunk > incoming_nbytes) | |
1233 | chunk = incoming_nbytes; | |
1234 | outgoing_before_gap | |
1235 | = count_size_as_multibyte (BUF_BYTE_ADDRESS (buf, from_byte), | |
1236 | chunk); | |
1237 | } | |
1238 | else | |
1239 | chunk = 0; | |
1240 | ||
1241 | if (chunk < incoming_nbytes) | |
1242 | outgoing_after_gap | |
177c0ea7 | 1243 | = count_size_as_multibyte (BUF_BYTE_ADDRESS (buf, |
4468c4f1 KH |
1244 | from_byte + chunk), |
1245 | incoming_nbytes - chunk); | |
1246 | ||
1247 | outgoing_nbytes = outgoing_before_gap + outgoing_after_gap; | |
1248 | } | |
177c0ea7 | 1249 | |
ef29f213 | 1250 | /* Make sure point-max won't overflow after this insertion. */ |
2b083808 RS |
1251 | XSETINT (temp, outgoing_nbytes + Z); |
1252 | if (outgoing_nbytes + Z != XINT (temp)) | |
3be11131 | 1253 | error ("Maximum buffer size exceeded"); |
ef29f213 | 1254 | |
35d63725 RS |
1255 | /* Do this before moving and increasing the gap, |
1256 | because the before-change hooks might move the gap | |
1257 | or make it smaller. */ | |
d206af14 | 1258 | prepare_to_modify_buffer (PT, PT, NULL); |
ef29f213 KH |
1259 | |
1260 | if (PT != GPT) | |
3be11131 | 1261 | move_gap_both (PT, PT_BYTE); |
2b083808 RS |
1262 | if (GAP_SIZE < outgoing_nbytes) |
1263 | make_gap (outgoing_nbytes - GAP_SIZE); | |
ef29f213 | 1264 | |
3be11131 | 1265 | if (from < BUF_GPT (buf)) |
ef29f213 | 1266 | { |
3be11131 | 1267 | chunk = BUF_GPT_BYTE (buf) - from_byte; |
2b083808 RS |
1268 | if (chunk > incoming_nbytes) |
1269 | chunk = incoming_nbytes; | |
4468c4f1 KH |
1270 | /* Record number of output bytes, so we know where |
1271 | to put the output from the second copy_text. */ | |
1272 | chunk_expanded | |
1273 | = copy_text (BUF_BYTE_ADDRESS (buf, from_byte), | |
1274 | GPT_ADDR, chunk, | |
1275 | ! NILP (buf->enable_multibyte_characters), | |
1276 | ! NILP (current_buffer->enable_multibyte_characters)); | |
ef29f213 KH |
1277 | } |
1278 | else | |
4468c4f1 KH |
1279 | chunk_expanded = chunk = 0; |
1280 | ||
2b083808 RS |
1281 | if (chunk < incoming_nbytes) |
1282 | copy_text (BUF_BYTE_ADDRESS (buf, from_byte + chunk), | |
4468c4f1 | 1283 | GPT_ADDR + chunk_expanded, incoming_nbytes - chunk, |
2b083808 RS |
1284 | ! NILP (buf->enable_multibyte_characters), |
1285 | ! NILP (current_buffer->enable_multibyte_characters)); | |
ef29f213 | 1286 | |
b16afa45 | 1287 | #ifdef BYTE_COMBINING_DEBUG |
432f78d2 RS |
1288 | /* We have copied text into the gap, but we have not altered |
1289 | PT or PT_BYTE yet. So we can pass PT and PT_BYTE | |
1290 | to these functions and get the same results as we would | |
1f90a790 | 1291 | have got earlier on. Meanwhile, GPT_ADDR does point to |
432f78d2 | 1292 | the text that has been stored by copy_text. */ |
b16afa45 KH |
1293 | if (count_combining_before (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE) |
1294 | || count_combining_after (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE)) | |
1295 | abort (); | |
1296 | #endif | |
432f78d2 | 1297 | |
b16afa45 | 1298 | record_insert (PT, nchars); |
432f78d2 | 1299 | MODIFF++; |
3e145152 | 1300 | CHARS_MODIFF = MODIFF; |
432f78d2 | 1301 | |
2b083808 | 1302 | GAP_SIZE -= outgoing_nbytes; |
1f90a790 RS |
1303 | GPT += nchars; |
1304 | ZV += nchars; | |
1305 | Z += nchars; | |
2b083808 RS |
1306 | GPT_BYTE += outgoing_nbytes; |
1307 | ZV_BYTE += outgoing_nbytes; | |
1308 | Z_BYTE += outgoing_nbytes; | |
469ff680 | 1309 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
1f90a790 | 1310 | |
1f90a790 RS |
1311 | if (GPT_BYTE < GPT) |
1312 | abort (); | |
1313 | ||
9dde4e0c KS |
1314 | /* The insert may have been in the unchanged region, so check again. */ |
1315 | if (Z - GPT < END_UNCHANGED) | |
1316 | END_UNCHANGED = Z - GPT; | |
1317 | ||
1f90a790 RS |
1318 | adjust_overlays_for_insert (PT, nchars); |
1319 | adjust_markers_for_insert (PT, PT_BYTE, PT + nchars, | |
432f78d2 | 1320 | PT_BYTE + outgoing_nbytes, |
b16afa45 | 1321 | 0); |
ce97a2d7 | 1322 | |
1f90a790 RS |
1323 | if (BUF_INTERVALS (current_buffer) != 0) |
1324 | offset_intervals (current_buffer, PT, nchars); | |
ce97a2d7 | 1325 | |
b16afa45 | 1326 | /* Get the intervals for the part of the string we are inserting. */ |
ce97a2d7 | 1327 | intervals = BUF_INTERVALS (buf); |
1f90a790 | 1328 | if (outgoing_nbytes < BUF_Z_BYTE (buf) - BUF_BEG_BYTE (buf)) |
06d8227a GM |
1329 | { |
1330 | if (buf == current_buffer && PT <= from) | |
1331 | from += nchars; | |
1332 | intervals = copy_intervals (intervals, from, nchars); | |
1333 | } | |
177c0ea7 | 1334 | |
ce97a2d7 | 1335 | /* Insert those intervals. */ |
1f90a790 | 1336 | graft_intervals_into_buffer (intervals, PT, nchars, current_buffer, inherit); |
ce97a2d7 | 1337 | |
b16afa45 | 1338 | adjust_point (nchars, outgoing_nbytes); |
b45433b3 JB |
1339 | } |
1340 | \f | |
652838b5 KH |
1341 | /* Record undo information and adjust markers and position keepers for |
1342 | a replacement of a text PREV_TEXT at FROM to a new text of LEN | |
1343 | chars (LEN_BYTE bytes) which resides in the gap just after | |
1344 | GPT_ADDR. | |
1345 | ||
1346 | PREV_TEXT nil means the new text was just inserted. */ | |
2d9eea44 | 1347 | |
1e9c7b7d | 1348 | void |
652838b5 KH |
1349 | adjust_after_replace (from, from_byte, prev_text, len, len_byte) |
1350 | int from, from_byte, len, len_byte; | |
1351 | Lisp_Object prev_text; | |
1e9c7b7d | 1352 | { |
652838b5 | 1353 | int nchars_del = 0, nbytes_del = 0; |
61415a25 | 1354 | |
b16afa45 KH |
1355 | #ifdef BYTE_COMBINING_DEBUG |
1356 | if (count_combining_before (GPT_ADDR, len_byte, from, from_byte) | |
1357 | || count_combining_after (GPT_ADDR, len_byte, from, from_byte)) | |
1358 | abort (); | |
1359 | #endif | |
1360 | ||
828f1ed3 KH |
1361 | if (STRINGP (prev_text)) |
1362 | { | |
d5db4077 KR |
1363 | nchars_del = SCHARS (prev_text); |
1364 | nbytes_del = SBYTES (prev_text); | |
828f1ed3 KH |
1365 | } |
1366 | ||
61415a25 KH |
1367 | /* Update various buffer positions for the new text. */ |
1368 | GAP_SIZE -= len_byte; | |
1369 | ZV += len; Z+= len; | |
1370 | ZV_BYTE += len_byte; Z_BYTE += len_byte; | |
1371 | GPT += len; GPT_BYTE += len_byte; | |
1372 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1373 | ||
adee4f91 KH |
1374 | if (nchars_del > 0) |
1375 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, | |
1376 | len, len_byte); | |
1377 | else | |
1378 | adjust_markers_for_insert (from, from_byte, | |
1379 | from + len, from_byte + len_byte, 0); | |
b16afa45 | 1380 | |
828f1ed3 KH |
1381 | if (! EQ (current_buffer->undo_list, Qt)) |
1382 | { | |
828f1ed3 | 1383 | if (nchars_del > 0) |
b16afa45 KH |
1384 | record_delete (from, prev_text); |
1385 | record_insert (from, len); | |
828f1ed3 | 1386 | } |
652838b5 KH |
1387 | |
1388 | if (len > nchars_del) | |
1389 | adjust_overlays_for_insert (from, len - nchars_del); | |
1390 | else if (len < nchars_del) | |
1391 | adjust_overlays_for_delete (from, nchars_del - len); | |
61415a25 | 1392 | if (BUF_INTERVALS (current_buffer) != 0) |
4a7cf15f KH |
1393 | { |
1394 | offset_intervals (current_buffer, from, len - nchars_del); | |
4a7cf15f | 1395 | } |
61415a25 | 1396 | |
b16afa45 KH |
1397 | if (from < PT) |
1398 | adjust_point (len - nchars_del, len_byte - nbytes_del); | |
61415a25 | 1399 | |
9f3ede3c | 1400 | /* As byte combining will decrease Z, we must check this again. */ |
a50df55b GM |
1401 | if (Z - GPT < END_UNCHANGED) |
1402 | END_UNCHANGED = Z - GPT; | |
9f3ede3c | 1403 | |
60ea6052 RS |
1404 | CHECK_MARKERS (); |
1405 | ||
1e9c7b7d | 1406 | if (len == 0) |
b58e3ca1 RS |
1407 | evaporate_overlays (from); |
1408 | MODIFF++; | |
3e145152 | 1409 | CHARS_MODIFF = MODIFF; |
b58e3ca1 RS |
1410 | } |
1411 | ||
1412 | /* Like adjust_after_replace, but doesn't require PREV_TEXT. | |
1413 | This is for use when undo is not enabled in the current buffer. */ | |
1414 | ||
1415 | void | |
1416 | adjust_after_replace_noundo (from, from_byte, nchars_del, nbytes_del, len, len_byte) | |
1417 | int from, from_byte, nchars_del, nbytes_del, len, len_byte; | |
1418 | { | |
1419 | #ifdef BYTE_COMBINING_DEBUG | |
1420 | if (count_combining_before (GPT_ADDR, len_byte, from, from_byte) | |
1421 | || count_combining_after (GPT_ADDR, len_byte, from, from_byte)) | |
1422 | abort (); | |
1423 | #endif | |
1424 | ||
1425 | /* Update various buffer positions for the new text. */ | |
1426 | GAP_SIZE -= len_byte; | |
1427 | ZV += len; Z+= len; | |
1428 | ZV_BYTE += len_byte; Z_BYTE += len_byte; | |
1429 | GPT += len; GPT_BYTE += len_byte; | |
1430 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1431 | ||
1432 | if (nchars_del > 0) | |
1433 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, | |
1434 | len, len_byte); | |
1435 | else | |
1436 | adjust_markers_for_insert (from, from_byte, | |
1437 | from + len, from_byte + len_byte, 0); | |
1438 | ||
1439 | if (len > nchars_del) | |
1440 | adjust_overlays_for_insert (from, len - nchars_del); | |
1441 | else if (len < nchars_del) | |
1442 | adjust_overlays_for_delete (from, nchars_del - len); | |
1443 | if (BUF_INTERVALS (current_buffer) != 0) | |
1444 | { | |
1445 | offset_intervals (current_buffer, from, len - nchars_del); | |
1446 | } | |
1447 | ||
1448 | if (from < PT) | |
1449 | adjust_point (len - nchars_del, len_byte - nbytes_del); | |
1450 | ||
1451 | /* As byte combining will decrease Z, we must check this again. */ | |
1452 | if (Z - GPT < END_UNCHANGED) | |
1453 | END_UNCHANGED = Z - GPT; | |
1454 | ||
1455 | CHECK_MARKERS (); | |
1456 | ||
1457 | if (len == 0) | |
1e9c7b7d KH |
1458 | evaporate_overlays (from); |
1459 | MODIFF++; | |
3e145152 | 1460 | CHARS_MODIFF = MODIFF; |
1e9c7b7d KH |
1461 | } |
1462 | ||
652838b5 KH |
1463 | /* Record undo information, adjust markers and position keepers for an |
1464 | insertion of a text from FROM (FROM_BYTE) to TO (TO_BYTE). The | |
1465 | text already exists in the current buffer but character length (TO | |
1466 | - FROM) may be incorrect, the correct length is NEWLEN. */ | |
1467 | ||
1468 | void | |
1469 | adjust_after_insert (from, from_byte, to, to_byte, newlen) | |
1470 | int from, from_byte, to, to_byte, newlen; | |
1471 | { | |
1472 | int len = to - from, len_byte = to_byte - from_byte; | |
1473 | ||
1474 | if (GPT != to) | |
1475 | move_gap_both (to, to_byte); | |
1476 | GAP_SIZE += len_byte; | |
1477 | GPT -= len; GPT_BYTE -= len_byte; | |
1478 | ZV -= len; ZV_BYTE -= len_byte; | |
1479 | Z -= len; Z_BYTE -= len_byte; | |
1480 | adjust_after_replace (from, from_byte, Qnil, newlen, len_byte); | |
1481 | } | |
085db7de | 1482 | \f |
3be11131 | 1483 | /* Replace the text from character positions FROM to TO with NEW, |
c5ca4d3a RS |
1484 | If PREPARE is nonzero, call prepare_to_modify_buffer. |
1485 | If INHERIT, the newly inserted text should inherit text properties | |
1486 | from the surrounding non-deleted text. */ | |
1487 | ||
1488 | /* Note that this does not yet handle markers quite right. | |
1489 | Also it needs to record a single undo-entry that does a replacement | |
1490 | rather than a separate delete and insert. | |
60aa777a RS |
1491 | That way, undo will also handle markers properly. |
1492 | ||
1493 | But if MARKERS is 0, don't relocate markers. */ | |
c5ca4d3a RS |
1494 | |
1495 | void | |
60aa777a | 1496 | replace_range (from, to, new, prepare, inherit, markers) |
c5ca4d3a | 1497 | Lisp_Object new; |
60aa777a | 1498 | int from, to, prepare, inherit, markers; |
c5ca4d3a | 1499 | { |
d5db4077 KR |
1500 | int inschars = SCHARS (new); |
1501 | int insbytes = SBYTES (new); | |
3be11131 RS |
1502 | int from_byte, to_byte; |
1503 | int nbytes_del, nchars_del; | |
c5ca4d3a RS |
1504 | register Lisp_Object temp; |
1505 | struct gcpro gcpro1; | |
ce97a2d7 | 1506 | INTERVAL intervals; |
1f90a790 | 1507 | int outgoing_insbytes = insbytes; |
23b20a70 | 1508 | Lisp_Object deletion; |
c5ca4d3a | 1509 | |
60ea6052 RS |
1510 | CHECK_MARKERS (); |
1511 | ||
c5ca4d3a | 1512 | GCPRO1 (new); |
6bbd7a29 | 1513 | deletion = Qnil; |
c5ca4d3a RS |
1514 | |
1515 | if (prepare) | |
1516 | { | |
1517 | int range_length = to - from; | |
1518 | prepare_to_modify_buffer (from, to, &from); | |
1519 | to = from + range_length; | |
1520 | } | |
1521 | ||
3be11131 RS |
1522 | UNGCPRO; |
1523 | ||
c5ca4d3a RS |
1524 | /* Make args be valid */ |
1525 | if (from < BEGV) | |
1526 | from = BEGV; | |
1527 | if (to > ZV) | |
1528 | to = ZV; | |
1529 | ||
3be11131 RS |
1530 | from_byte = CHAR_TO_BYTE (from); |
1531 | to_byte = CHAR_TO_BYTE (to); | |
c5ca4d3a | 1532 | |
3be11131 RS |
1533 | nchars_del = to - from; |
1534 | nbytes_del = to_byte - from_byte; | |
1535 | ||
1536 | if (nbytes_del <= 0 && insbytes == 0) | |
1537 | return; | |
c5ca4d3a | 1538 | |
1f90a790 RS |
1539 | /* Make OUTGOING_INSBYTES describe the text |
1540 | as it will be inserted in this buffer. */ | |
1541 | ||
1542 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1543 | outgoing_insbytes = inschars; | |
2a1d8be0 | 1544 | else if (! STRING_MULTIBYTE (new)) |
1f90a790 | 1545 | outgoing_insbytes |
d5db4077 | 1546 | = count_size_as_multibyte (SDATA (new), insbytes); |
1f90a790 | 1547 | |
c5ca4d3a | 1548 | /* Make sure point-max won't overflow after this insertion. */ |
3be11131 RS |
1549 | XSETINT (temp, Z_BYTE - nbytes_del + insbytes); |
1550 | if (Z_BYTE - nbytes_del + insbytes != XINT (temp)) | |
1551 | error ("Maximum buffer size exceeded"); | |
c5ca4d3a | 1552 | |
c5ca4d3a RS |
1553 | GCPRO1 (new); |
1554 | ||
1555 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
1556 | if (from > GPT) | |
3be11131 | 1557 | gap_right (from, from_byte); |
c5ca4d3a | 1558 | if (to < GPT) |
3be11131 | 1559 | gap_left (to, to_byte, 0); |
c5ca4d3a | 1560 | |
039af53a KH |
1561 | /* Even if we don't record for undo, we must keep the original text |
1562 | because we may have to recover it because of inappropriate byte | |
1563 | combining. */ | |
b16afa45 KH |
1564 | if (! EQ (current_buffer->undo_list, Qt)) |
1565 | deletion = make_buffer_string_both (from, from_byte, to, to_byte, 1); | |
c5ca4d3a | 1566 | |
3be11131 RS |
1567 | GAP_SIZE += nbytes_del; |
1568 | ZV -= nchars_del; | |
1569 | Z -= nchars_del; | |
1570 | ZV_BYTE -= nbytes_del; | |
1571 | Z_BYTE -= nbytes_del; | |
c5ca4d3a | 1572 | GPT = from; |
3be11131 | 1573 | GPT_BYTE = from_byte; |
017e09ac | 1574 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
c5ca4d3a | 1575 | |
3be11131 RS |
1576 | if (GPT_BYTE < GPT) |
1577 | abort (); | |
1578 | ||
a50df55b GM |
1579 | if (GPT - BEG < BEG_UNCHANGED) |
1580 | BEG_UNCHANGED = GPT - BEG; | |
1581 | if (Z - GPT < END_UNCHANGED) | |
1582 | END_UNCHANGED = Z - GPT; | |
c5ca4d3a | 1583 | |
3be11131 RS |
1584 | if (GAP_SIZE < insbytes) |
1585 | make_gap (insbytes - GAP_SIZE); | |
c5ca4d3a | 1586 | |
1f90a790 RS |
1587 | /* Copy the string text into the buffer, perhaps converting |
1588 | between single-byte and multibyte. */ | |
d5db4077 | 1589 | copy_text (SDATA (new), GPT_ADDR, insbytes, |
2a1d8be0 | 1590 | STRING_MULTIBYTE (new), |
1f90a790 RS |
1591 | ! NILP (current_buffer->enable_multibyte_characters)); |
1592 | ||
b16afa45 | 1593 | #ifdef BYTE_COMBINING_DEBUG |
255c7dae RS |
1594 | /* We have copied text into the gap, but we have not marked |
1595 | it as part of the buffer. So we can use the old FROM and FROM_BYTE | |
1596 | here, for both the previous text and the following text. | |
1597 | Meanwhile, GPT_ADDR does point to | |
432f78d2 | 1598 | the text that has been stored by copy_text. */ |
b16afa45 KH |
1599 | if (count_combining_before (GPT_ADDR, outgoing_insbytes, from, from_byte) |
1600 | || count_combining_after (GPT_ADDR, outgoing_insbytes, from, from_byte)) | |
1601 | abort (); | |
1602 | #endif | |
432f78d2 | 1603 | |
23b20a70 KH |
1604 | if (! EQ (current_buffer->undo_list, Qt)) |
1605 | { | |
b16afa45 KH |
1606 | record_delete (from, deletion); |
1607 | record_insert (from, inschars); | |
23b20a70 | 1608 | } |
c5ca4d3a | 1609 | |
1f90a790 RS |
1610 | GAP_SIZE -= outgoing_insbytes; |
1611 | GPT += inschars; | |
1612 | ZV += inschars; | |
1613 | Z += inschars; | |
1614 | GPT_BYTE += outgoing_insbytes; | |
1615 | ZV_BYTE += outgoing_insbytes; | |
1616 | Z_BYTE += outgoing_insbytes; | |
c5ca4d3a RS |
1617 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
1618 | ||
3be11131 RS |
1619 | if (GPT_BYTE < GPT) |
1620 | abort (); | |
1621 | ||
c5ca4d3a RS |
1622 | /* Adjust the overlay center as needed. This must be done after |
1623 | adjusting the markers that bound the overlays. */ | |
3be11131 | 1624 | adjust_overlays_for_delete (from, nchars_del); |
1f90a790 | 1625 | adjust_overlays_for_insert (from, inschars); |
048a0fbb RS |
1626 | |
1627 | /* Adjust markers for the deletion and the insertion. */ | |
60aa777a | 1628 | if (markers) |
048a0fbb RS |
1629 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, |
1630 | inschars, outgoing_insbytes); | |
c5ca4d3a | 1631 | |
255c7dae | 1632 | offset_intervals (current_buffer, from, inschars - nchars_del); |
ce97a2d7 RS |
1633 | |
1634 | /* Get the intervals for the part of the string we are inserting-- | |
1635 | not including the combined-before bytes. */ | |
d5db4077 | 1636 | intervals = STRING_INTERVALS (new); |
ce97a2d7 | 1637 | /* Insert those intervals. */ |
1f90a790 | 1638 | graft_intervals_into_buffer (intervals, from, inschars, |
ce97a2d7 | 1639 | current_buffer, inherit); |
c5ca4d3a | 1640 | |
1f90a790 RS |
1641 | /* Relocate point as if it were a marker. */ |
1642 | if (from < PT) | |
8bedbe9d | 1643 | adjust_point ((from + inschars - (PT < to ? PT : to)), |
1f90a790 | 1644 | (from_byte + outgoing_insbytes |
8bedbe9d | 1645 | - (PT_BYTE < to_byte ? PT_BYTE : to_byte))); |
c5ca4d3a | 1646 | |
1f90a790 RS |
1647 | if (outgoing_insbytes == 0) |
1648 | evaporate_overlays (from); | |
93b882e8 | 1649 | |
60ea6052 RS |
1650 | CHECK_MARKERS (); |
1651 | ||
c5ca4d3a | 1652 | MODIFF++; |
3e145152 | 1653 | CHARS_MODIFF = MODIFF; |
c5ca4d3a RS |
1654 | UNGCPRO; |
1655 | ||
255c7dae | 1656 | signal_after_change (from, nchars_del, GPT - from); |
0ef71121 | 1657 | update_compositions (from, GPT, CHECK_BORDER); |
c5ca4d3a RS |
1658 | } |
1659 | \f | |
085db7de RS |
1660 | /* Replace the text from character positions FROM to TO with |
1661 | the text in INS of length INSCHARS. | |
1662 | Keep the text properties that applied to the old characters | |
1663 | (extending them to all the new chars if there are more new chars). | |
1664 | ||
1665 | Note that this does not yet handle markers quite right. | |
1666 | ||
1667 | If MARKERS is nonzero, relocate markers. | |
1668 | ||
1669 | Unlike most functions at this level, never call | |
1670 | prepare_to_modify_buffer and never call signal_after_change. */ | |
1671 | ||
1672 | void | |
1673 | replace_range_2 (from, from_byte, to, to_byte, ins, inschars, insbytes, markers) | |
1674 | int from, from_byte, to, to_byte; | |
1675 | char *ins; | |
1676 | int inschars, insbytes, markers; | |
1677 | { | |
1678 | int nbytes_del, nchars_del; | |
1679 | Lisp_Object temp; | |
1680 | ||
1681 | CHECK_MARKERS (); | |
1682 | ||
1683 | nchars_del = to - from; | |
1684 | nbytes_del = to_byte - from_byte; | |
1685 | ||
1686 | if (nbytes_del <= 0 && insbytes == 0) | |
1687 | return; | |
1688 | ||
1689 | /* Make sure point-max won't overflow after this insertion. */ | |
1690 | XSETINT (temp, Z_BYTE - nbytes_del + insbytes); | |
1691 | if (Z_BYTE - nbytes_del + insbytes != XINT (temp)) | |
1692 | error ("Maximum buffer size exceeded"); | |
1693 | ||
1694 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
1695 | if (from > GPT) | |
1696 | gap_right (from, from_byte); | |
1697 | if (to < GPT) | |
1698 | gap_left (to, to_byte, 0); | |
1699 | ||
1700 | GAP_SIZE += nbytes_del; | |
1701 | ZV -= nchars_del; | |
1702 | Z -= nchars_del; | |
1703 | ZV_BYTE -= nbytes_del; | |
1704 | Z_BYTE -= nbytes_del; | |
1705 | GPT = from; | |
1706 | GPT_BYTE = from_byte; | |
1707 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1708 | ||
1709 | if (GPT_BYTE < GPT) | |
1710 | abort (); | |
1711 | ||
1712 | if (GPT - BEG < BEG_UNCHANGED) | |
1713 | BEG_UNCHANGED = GPT - BEG; | |
1714 | if (Z - GPT < END_UNCHANGED) | |
1715 | END_UNCHANGED = Z - GPT; | |
1716 | ||
1717 | if (GAP_SIZE < insbytes) | |
1718 | make_gap (insbytes - GAP_SIZE); | |
1719 | ||
1720 | /* Copy the replacement text into the buffer. */ | |
1721 | bcopy (ins, GPT_ADDR, insbytes); | |
1722 | ||
1723 | #ifdef BYTE_COMBINING_DEBUG | |
1724 | /* We have copied text into the gap, but we have not marked | |
1725 | it as part of the buffer. So we can use the old FROM and FROM_BYTE | |
1726 | here, for both the previous text and the following text. | |
1727 | Meanwhile, GPT_ADDR does point to | |
1728 | the text that has been stored by copy_text. */ | |
1729 | if (count_combining_before (GPT_ADDR, insbytes, from, from_byte) | |
1730 | || count_combining_after (GPT_ADDR, insbytes, from, from_byte)) | |
1731 | abort (); | |
1732 | #endif | |
1733 | ||
1734 | GAP_SIZE -= insbytes; | |
1735 | GPT += inschars; | |
1736 | ZV += inschars; | |
1737 | Z += inschars; | |
1738 | GPT_BYTE += insbytes; | |
1739 | ZV_BYTE += insbytes; | |
1740 | Z_BYTE += insbytes; | |
1741 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1742 | ||
1743 | if (GPT_BYTE < GPT) | |
1744 | abort (); | |
1745 | ||
1746 | /* Adjust the overlay center as needed. This must be done after | |
1747 | adjusting the markers that bound the overlays. */ | |
1748 | if (nchars_del != inschars) | |
1749 | { | |
1750 | adjust_overlays_for_insert (from, inschars); | |
1751 | adjust_overlays_for_delete (from + inschars, nchars_del); | |
1752 | } | |
1753 | ||
1754 | /* Adjust markers for the deletion and the insertion. */ | |
1755 | if (markers | |
7077904e | 1756 | && ! (nchars_del == 1 && inschars == 1 && nbytes_del == insbytes)) |
085db7de RS |
1757 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, |
1758 | inschars, insbytes); | |
1759 | ||
1760 | offset_intervals (current_buffer, from, inschars - nchars_del); | |
1761 | ||
1762 | /* Relocate point as if it were a marker. */ | |
7077904e KH |
1763 | if (from < PT && (nchars_del != inschars || nbytes_del != insbytes)) |
1764 | { | |
1765 | if (PT < to) | |
1766 | /* PT was within the deleted text. Move it to FROM. */ | |
1767 | adjust_point (from - PT, from_byte - PT_BYTE); | |
1768 | else | |
1769 | adjust_point (inschars - nchars_del, insbytes - nbytes_del); | |
1770 | } | |
085db7de RS |
1771 | |
1772 | if (insbytes == 0) | |
1773 | evaporate_overlays (from); | |
1774 | ||
1775 | CHECK_MARKERS (); | |
1776 | ||
1777 | MODIFF++; | |
3e145152 | 1778 | CHARS_MODIFF = MODIFF; |
085db7de RS |
1779 | } |
1780 | \f | |
b45433b3 | 1781 | /* Delete characters in current buffer |
3be11131 RS |
1782 | from FROM up to (but not including) TO. |
1783 | If TO comes before FROM, we delete nothing. */ | |
b45433b3 | 1784 | |
c660b094 | 1785 | void |
b45433b3 JB |
1786 | del_range (from, to) |
1787 | register int from, to; | |
47c64747 | 1788 | { |
7dae4502 | 1789 | del_range_1 (from, to, 1, 0); |
47c64747 RS |
1790 | } |
1791 | ||
7dae4502 SM |
1792 | /* Like del_range; PREPARE says whether to call prepare_to_modify_buffer. |
1793 | RET_STRING says to return the deleted text. */ | |
47c64747 | 1794 | |
7dae4502 SM |
1795 | Lisp_Object |
1796 | del_range_1 (from, to, prepare, ret_string) | |
1797 | int from, to, prepare, ret_string; | |
b45433b3 | 1798 | { |
3be11131 | 1799 | int from_byte, to_byte; |
7dae4502 SM |
1800 | Lisp_Object deletion; |
1801 | struct gcpro gcpro1; | |
3be11131 RS |
1802 | |
1803 | /* Make args be valid */ | |
1804 | if (from < BEGV) | |
1805 | from = BEGV; | |
1806 | if (to > ZV) | |
1807 | to = ZV; | |
1808 | ||
1809 | if (to <= from) | |
7dae4502 | 1810 | return Qnil; |
3be11131 RS |
1811 | |
1812 | if (prepare) | |
1813 | { | |
1814 | int range_length = to - from; | |
1815 | prepare_to_modify_buffer (from, to, &from); | |
0a411995 | 1816 | to = min (ZV, from + range_length); |
3be11131 RS |
1817 | } |
1818 | ||
1819 | from_byte = CHAR_TO_BYTE (from); | |
1820 | to_byte = CHAR_TO_BYTE (to); | |
1821 | ||
7dae4502 SM |
1822 | deletion = del_range_2 (from, from_byte, to, to_byte, ret_string); |
1823 | GCPRO1(deletion); | |
9c36993a | 1824 | signal_after_change (from, to - from, 0); |
233cc02d | 1825 | update_compositions (from, from, CHECK_HEAD); |
7dae4502 SM |
1826 | UNGCPRO; |
1827 | return deletion; | |
3be11131 RS |
1828 | } |
1829 | ||
1830 | /* Like del_range_1 but args are byte positions, not char positions. */ | |
1831 | ||
1832 | void | |
1833 | del_range_byte (from_byte, to_byte, prepare) | |
1834 | int from_byte, to_byte, prepare; | |
1835 | { | |
1836 | int from, to; | |
1837 | ||
1838 | /* Make args be valid */ | |
1839 | if (from_byte < BEGV_BYTE) | |
1840 | from_byte = BEGV_BYTE; | |
1841 | if (to_byte > ZV_BYTE) | |
1842 | to_byte = ZV_BYTE; | |
1843 | ||
1844 | if (to_byte <= from_byte) | |
1845 | return; | |
1846 | ||
1847 | from = BYTE_TO_CHAR (from_byte); | |
1848 | to = BYTE_TO_CHAR (to_byte); | |
b45433b3 | 1849 | |
d206af14 RS |
1850 | if (prepare) |
1851 | { | |
3be11131 | 1852 | int old_from = from, old_to = Z - to; |
d206af14 RS |
1853 | int range_length = to - from; |
1854 | prepare_to_modify_buffer (from, to, &from); | |
1855 | to = from + range_length; | |
3be11131 RS |
1856 | |
1857 | if (old_from != from) | |
1858 | from_byte = CHAR_TO_BYTE (from); | |
0a411995 GM |
1859 | if (to > ZV) |
1860 | { | |
1861 | to = ZV; | |
1862 | to_byte = ZV_BYTE; | |
1863 | } | |
1864 | else if (old_to == Z - to) | |
3be11131 | 1865 | to_byte = CHAR_TO_BYTE (to); |
d206af14 RS |
1866 | } |
1867 | ||
7dae4502 | 1868 | del_range_2 (from, from_byte, to, to_byte, 0); |
9c36993a | 1869 | signal_after_change (from, to - from, 0); |
0ef71121 | 1870 | update_compositions (from, from, CHECK_HEAD); |
3be11131 RS |
1871 | } |
1872 | ||
1873 | /* Like del_range_1, but positions are specified both as charpos | |
1874 | and bytepos. */ | |
1875 | ||
1876 | void | |
353800c7 KH |
1877 | del_range_both (from, from_byte, to, to_byte, prepare) |
1878 | int from, from_byte, to, to_byte, prepare; | |
3be11131 | 1879 | { |
b45433b3 | 1880 | /* Make args be valid */ |
3be11131 RS |
1881 | if (from_byte < BEGV_BYTE) |
1882 | from_byte = BEGV_BYTE; | |
1883 | if (to_byte > ZV_BYTE) | |
1884 | to_byte = ZV_BYTE; | |
1885 | ||
1886 | if (to_byte <= from_byte) | |
1887 | return; | |
1888 | ||
b45433b3 JB |
1889 | if (from < BEGV) |
1890 | from = BEGV; | |
1891 | if (to > ZV) | |
1892 | to = ZV; | |
1893 | ||
3be11131 RS |
1894 | if (prepare) |
1895 | { | |
1896 | int old_from = from, old_to = Z - to; | |
1897 | int range_length = to - from; | |
1898 | prepare_to_modify_buffer (from, to, &from); | |
1899 | to = from + range_length; | |
1900 | ||
1901 | if (old_from != from) | |
1902 | from_byte = CHAR_TO_BYTE (from); | |
0a411995 GM |
1903 | if (to > ZV) |
1904 | { | |
1905 | to = ZV; | |
1906 | to_byte = ZV_BYTE; | |
1907 | } | |
1908 | else if (old_to == Z - to) | |
3be11131 RS |
1909 | to_byte = CHAR_TO_BYTE (to); |
1910 | } | |
1911 | ||
7dae4502 | 1912 | del_range_2 (from, from_byte, to, to_byte, 0); |
9c36993a | 1913 | signal_after_change (from, to - from, 0); |
0ef71121 | 1914 | update_compositions (from, from, CHECK_HEAD); |
3be11131 RS |
1915 | } |
1916 | ||
1917 | /* Delete a range of text, specified both as character positions | |
1918 | and byte positions. FROM and TO are character positions, | |
7dae4502 SM |
1919 | while FROM_BYTE and TO_BYTE are byte positions. |
1920 | If RET_STRING is true, the deleted area is returned as a string. */ | |
3be11131 | 1921 | |
7dae4502 SM |
1922 | Lisp_Object |
1923 | del_range_2 (from, from_byte, to, to_byte, ret_string) | |
1924 | int from, from_byte, to, to_byte, ret_string; | |
3be11131 RS |
1925 | { |
1926 | register int nbytes_del, nchars_del; | |
628cea90 | 1927 | Lisp_Object deletion; |
3be11131 | 1928 | |
60ea6052 RS |
1929 | CHECK_MARKERS (); |
1930 | ||
3be11131 RS |
1931 | nchars_del = to - from; |
1932 | nbytes_del = to_byte - from_byte; | |
b45433b3 JB |
1933 | |
1934 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
1935 | if (from > GPT) | |
3be11131 | 1936 | gap_right (from, from_byte); |
b45433b3 | 1937 | if (to < GPT) |
3be11131 | 1938 | gap_left (to, to_byte, 0); |
b45433b3 | 1939 | |
b16afa45 KH |
1940 | #ifdef BYTE_COMBINING_DEBUG |
1941 | if (count_combining_before (BUF_BYTE_ADDRESS (current_buffer, to_byte), | |
1942 | Z_BYTE - to_byte, from, from_byte)) | |
1943 | abort (); | |
1944 | #endif | |
628cea90 | 1945 | |
7dae4502 | 1946 | if (ret_string || ! EQ (current_buffer->undo_list, Qt)) |
b16afa45 | 1947 | deletion = make_buffer_string_both (from, from_byte, to, to_byte, 1); |
7dae4502 SM |
1948 | else |
1949 | deletion = Qnil; | |
1950 | ||
8948d317 RS |
1951 | /* Relocate all markers pointing into the new, larger gap |
1952 | to point at the end of the text before the gap. | |
3be11131 RS |
1953 | Do this before recording the deletion, |
1954 | so that undo handles this after reinserting the text. */ | |
1955 | adjust_markers_for_delete (from, from_byte, to, to_byte); | |
b16afa45 | 1956 | |
0aa8c4b2 | 1957 | if (! EQ (current_buffer->undo_list, Qt)) |
b16afa45 | 1958 | record_delete (from, deletion); |
be09561e | 1959 | MODIFF++; |
3e145152 | 1960 | CHARS_MODIFF = MODIFF; |
be09561e | 1961 | |
b45433b3 | 1962 | /* Relocate point as if it were a marker. */ |
2bcaed71 | 1963 | if (from < PT) |
3be11131 RS |
1964 | adjust_point (from - (PT < to ? PT : to), |
1965 | from_byte - (PT_BYTE < to_byte ? PT_BYTE : to_byte)); | |
b45433b3 | 1966 | |
3be11131 | 1967 | offset_intervals (current_buffer, from, - nchars_del); |
16032db6 | 1968 | |
adde4858 | 1969 | /* Adjust the overlay center as needed. This must be done after |
a7f38d28 | 1970 | adjusting the markers that bound the overlays. */ |
e3a87305 | 1971 | adjust_overlays_for_delete (from, nchars_del); |
adde4858 | 1972 | |
3be11131 RS |
1973 | GAP_SIZE += nbytes_del; |
1974 | ZV_BYTE -= nbytes_del; | |
1975 | Z_BYTE -= nbytes_del; | |
1976 | ZV -= nchars_del; | |
1977 | Z -= nchars_del; | |
b45433b3 | 1978 | GPT = from; |
3be11131 | 1979 | GPT_BYTE = from_byte; |
017e09ac | 1980 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
e3a87305 | 1981 | |
3be11131 RS |
1982 | if (GPT_BYTE < GPT) |
1983 | abort (); | |
1984 | ||
a50df55b GM |
1985 | if (GPT - BEG < BEG_UNCHANGED) |
1986 | BEG_UNCHANGED = GPT - BEG; | |
1987 | if (Z - GPT < END_UNCHANGED) | |
1988 | END_UNCHANGED = Z - GPT; | |
b45433b3 | 1989 | |
60ea6052 RS |
1990 | CHECK_MARKERS (); |
1991 | ||
d386034e | 1992 | evaporate_overlays (from); |
7dae4502 SM |
1993 | |
1994 | return deletion; | |
b45433b3 JB |
1995 | } |
1996 | \f | |
3be11131 RS |
1997 | /* Call this if you're about to change the region of BUFFER from |
1998 | character positions START to END. This checks the read-only | |
1999 | properties of the region, calls the necessary modification hooks, | |
2000 | and warns the next redisplay that it should pay attention to that | |
3e145152 CY |
2001 | area. |
2002 | ||
2003 | If PRESERVE_CHARS_MODIFF is non-zero, do not update CHARS_MODIFF. | |
2004 | Otherwise set CHARS_MODIFF to the new value of MODIFF. */ | |
3be11131 | 2005 | |
c660b094 | 2006 | void |
3e145152 | 2007 | modify_region (buffer, start, end, preserve_chars_modiff) |
04a759c8 | 2008 | struct buffer *buffer; |
3e145152 | 2009 | int start, end, preserve_chars_modiff; |
b45433b3 | 2010 | { |
04a759c8 JB |
2011 | struct buffer *old_buffer = current_buffer; |
2012 | ||
2013 | if (buffer != old_buffer) | |
2014 | set_buffer_internal (buffer); | |
2015 | ||
d206af14 | 2016 | prepare_to_modify_buffer (start, end, NULL); |
b45433b3 | 2017 | |
a50df55b | 2018 | BUF_COMPUTE_UNCHANGED (buffer, start - 1, end); |
83010cd6 | 2019 | |
9fbf87cd | 2020 | if (MODIFF <= SAVE_MODIFF) |
83010cd6 | 2021 | record_first_change (); |
b45433b3 | 2022 | MODIFF++; |
3e145152 CY |
2023 | if (! preserve_chars_modiff) |
2024 | CHARS_MODIFF = MODIFF; | |
04a759c8 | 2025 | |
069cdc4f RS |
2026 | buffer->point_before_scroll = Qnil; |
2027 | ||
04a759c8 JB |
2028 | if (buffer != old_buffer) |
2029 | set_buffer_internal (old_buffer); | |
b45433b3 | 2030 | } |
d206af14 | 2031 | \f |
3be11131 RS |
2032 | /* Check that it is okay to modify the buffer between START and END, |
2033 | which are char positions. | |
2034 | ||
679194a6 JA |
2035 | Run the before-change-function, if any. If intervals are in use, |
2036 | verify that the text to be modified is not read-only, and call | |
d206af14 RS |
2037 | any modification properties the text may have. |
2038 | ||
2039 | If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR | |
2040 | by holding its value temporarily in a marker. */ | |
b45433b3 | 2041 | |
c660b094 | 2042 | void |
d206af14 | 2043 | prepare_to_modify_buffer (start, end, preserve_ptr) |
fb4ee5cd | 2044 | int start, end; |
d206af14 | 2045 | int *preserve_ptr; |
b45433b3 | 2046 | { |
234fb773 CY |
2047 | struct buffer *base_buffer; |
2048 | ||
d427b66a | 2049 | if (!NILP (current_buffer->read_only)) |
b45433b3 JB |
2050 | Fbarf_if_buffer_read_only (); |
2051 | ||
2e9f55fd GM |
2052 | /* Let redisplay consider other windows than selected_window |
2053 | if modifying another buffer. */ | |
2054 | if (XBUFFER (XWINDOW (selected_window)->buffer) != current_buffer) | |
2055 | ++windows_or_buffers_changed; | |
2056 | ||
9fbf87cd | 2057 | if (BUF_INTERVALS (current_buffer) != 0) |
d206af14 RS |
2058 | { |
2059 | if (preserve_ptr) | |
2060 | { | |
2061 | Lisp_Object preserve_marker; | |
2062 | struct gcpro gcpro1; | |
2063 | preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil); | |
2064 | GCPRO1 (preserve_marker); | |
2065 | verify_interval_modification (current_buffer, start, end); | |
2066 | *preserve_ptr = marker_position (preserve_marker); | |
dab0b04d | 2067 | unchain_marker (XMARKER (preserve_marker)); |
d206af14 RS |
2068 | UNGCPRO; |
2069 | } | |
2070 | else | |
2071 | verify_interval_modification (current_buffer, start, end); | |
2072 | } | |
b45433b3 | 2073 | |
234fb773 CY |
2074 | /* For indirect buffers, use the base buffer to check clashes. */ |
2075 | if (current_buffer->base_buffer != 0) | |
2076 | base_buffer = current_buffer->base_buffer; | |
2077 | else | |
2078 | base_buffer = current_buffer; | |
2079 | ||
b45433b3 | 2080 | #ifdef CLASH_DETECTION |
234fb773 | 2081 | if (!NILP (base_buffer->file_truename) |
ab6c5c0c | 2082 | /* Make binding buffer-file-name to nil effective. */ |
234fb773 | 2083 | && !NILP (base_buffer->filename) |
9fbf87cd | 2084 | && SAVE_MODIFF >= MODIFF) |
234fb773 | 2085 | lock_file (base_buffer->file_truename); |
b45433b3 JB |
2086 | #else |
2087 | /* At least warn if this file has changed on disk since it was visited. */ | |
234fb773 | 2088 | if (!NILP (base_buffer->filename) |
9fbf87cd | 2089 | && SAVE_MODIFF >= MODIFF |
d427b66a | 2090 | && NILP (Fverify_visited_file_modtime (Fcurrent_buffer ())) |
234fb773 | 2091 | && !NILP (Ffile_exists_p (base_buffer->filename))) |
b45433b3 | 2092 | call1 (intern ("ask-user-about-supersession-threat"), |
234fb773 | 2093 | base_buffer->filename); |
b45433b3 JB |
2094 | #endif /* not CLASH_DETECTION */ |
2095 | ||
d206af14 | 2096 | signal_before_change (start, end, preserve_ptr); |
2f545eea | 2097 | |
56e1065e JB |
2098 | if (current_buffer->newline_cache) |
2099 | invalidate_region_cache (current_buffer, | |
2100 | current_buffer->newline_cache, | |
2101 | start - BEG, Z - end); | |
2102 | if (current_buffer->width_run_cache) | |
2103 | invalidate_region_cache (current_buffer, | |
2104 | current_buffer->width_run_cache, | |
2105 | start - BEG, Z - end); | |
2106 | ||
2f545eea | 2107 | Vdeactivate_mark = Qt; |
b45433b3 JB |
2108 | } |
2109 | \f | |
d206af14 RS |
2110 | /* These macros work with an argument named `preserve_ptr' |
2111 | and a local variable named `preserve_marker'. */ | |
2112 | ||
2113 | #define PRESERVE_VALUE \ | |
2114 | if (preserve_ptr && NILP (preserve_marker)) \ | |
2115 | preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil) | |
2116 | ||
2117 | #define RESTORE_VALUE \ | |
2118 | if (! NILP (preserve_marker)) \ | |
2119 | { \ | |
2120 | *preserve_ptr = marker_position (preserve_marker); \ | |
dab0b04d | 2121 | unchain_marker (XMARKER (preserve_marker)); \ |
d206af14 RS |
2122 | } |
2123 | ||
b86e0aaf RS |
2124 | #define PRESERVE_START_END \ |
2125 | if (NILP (start_marker)) \ | |
2126 | start_marker = Fcopy_marker (start, Qnil); \ | |
2127 | if (NILP (end_marker)) \ | |
2128 | end_marker = Fcopy_marker (end, Qnil); | |
2129 | ||
2130 | #define FETCH_START \ | |
2131 | (! NILP (start_marker) ? Fmarker_position (start_marker) : start) | |
2132 | ||
2133 | #define FETCH_END \ | |
2134 | (! NILP (end_marker) ? Fmarker_position (end_marker) : end) | |
2135 | ||
eb8c3be9 | 2136 | /* Signal a change to the buffer immediately before it happens. |
d206af14 RS |
2137 | START_INT and END_INT are the bounds of the text to be changed. |
2138 | ||
2139 | If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR | |
2140 | by holding its value temporarily in a marker. */ | |
b45433b3 | 2141 | |
c660b094 | 2142 | void |
d206af14 | 2143 | signal_before_change (start_int, end_int, preserve_ptr) |
6022d493 | 2144 | int start_int, end_int; |
d206af14 | 2145 | int *preserve_ptr; |
b45433b3 | 2146 | { |
fb4ee5cd | 2147 | Lisp_Object start, end; |
b86e0aaf | 2148 | Lisp_Object start_marker, end_marker; |
d206af14 | 2149 | Lisp_Object preserve_marker; |
b86e0aaf | 2150 | struct gcpro gcpro1, gcpro2, gcpro3; |
fb4ee5cd | 2151 | |
fd16a4c6 KH |
2152 | if (inhibit_modification_hooks) |
2153 | return; | |
2154 | ||
fb4ee5cd RS |
2155 | start = make_number (start_int); |
2156 | end = make_number (end_int); | |
d206af14 | 2157 | preserve_marker = Qnil; |
b86e0aaf RS |
2158 | start_marker = Qnil; |
2159 | end_marker = Qnil; | |
2160 | GCPRO3 (preserve_marker, start_marker, end_marker); | |
fb4ee5cd | 2161 | |
b45433b3 | 2162 | /* If buffer is unmodified, run a special hook for that case. */ |
9fbf87cd | 2163 | if (SAVE_MODIFF >= MODIFF |
dbc4e1c1 JB |
2164 | && !NILP (Vfirst_change_hook) |
2165 | && !NILP (Vrun_hooks)) | |
d206af14 RS |
2166 | { |
2167 | PRESERVE_VALUE; | |
b86e0aaf | 2168 | PRESERVE_START_END; |
d206af14 RS |
2169 | call1 (Vrun_hooks, Qfirst_change_hook); |
2170 | } | |
dbc4e1c1 | 2171 | |
3d1e2d9c | 2172 | /* Now run the before-change-functions if any. */ |
e45fb8bf RS |
2173 | if (!NILP (Vbefore_change_functions)) |
2174 | { | |
3d1e2d9c RS |
2175 | Lisp_Object args[3]; |
2176 | Lisp_Object before_change_functions; | |
2177 | Lisp_Object after_change_functions; | |
2178 | struct gcpro gcpro1, gcpro2; | |
460e6bae GM |
2179 | struct buffer *old = current_buffer; |
2180 | struct buffer *new; | |
3d1e2d9c | 2181 | |
d206af14 | 2182 | PRESERVE_VALUE; |
b86e0aaf | 2183 | PRESERVE_START_END; |
d206af14 | 2184 | |
3d1e2d9c RS |
2185 | /* "Bind" before-change-functions and after-change-functions |
2186 | to nil--but in a way that errors don't know about. | |
2187 | That way, if there's an error in them, they will stay nil. */ | |
2188 | before_change_functions = Vbefore_change_functions; | |
2189 | after_change_functions = Vafter_change_functions; | |
c82c1da0 KH |
2190 | Vbefore_change_functions = Qnil; |
2191 | Vafter_change_functions = Qnil; | |
3d1e2d9c RS |
2192 | GCPRO2 (before_change_functions, after_change_functions); |
2193 | ||
2194 | /* Actually run the hook functions. */ | |
2195 | args[0] = Qbefore_change_functions; | |
b86e0aaf RS |
2196 | args[1] = FETCH_START; |
2197 | args[2] = FETCH_END; | |
3d1e2d9c RS |
2198 | run_hook_list_with_args (before_change_functions, 3, args); |
2199 | ||
460e6bae GM |
2200 | /* "Unbind" the variables we "bound" to nil. Beware a |
2201 | buffer-local hook which changes the buffer when run (e.g. W3). */ | |
2202 | if (old != current_buffer) | |
2203 | { | |
2204 | new = current_buffer; | |
2205 | set_buffer_internal (old); | |
2206 | Vbefore_change_functions = before_change_functions; | |
2207 | Vafter_change_functions = after_change_functions; | |
2208 | set_buffer_internal (new); | |
2209 | } | |
2210 | else | |
2211 | { | |
2212 | Vbefore_change_functions = before_change_functions; | |
2213 | Vafter_change_functions = after_change_functions; | |
2214 | } | |
3d1e2d9c | 2215 | UNGCPRO; |
e45fb8bf | 2216 | } |
d07c0804 | 2217 | |
fbebdf81 | 2218 | if (current_buffer->overlays_before || current_buffer->overlays_after) |
d206af14 RS |
2219 | { |
2220 | PRESERVE_VALUE; | |
b86e0aaf RS |
2221 | report_overlay_modification (FETCH_START, FETCH_END, 0, |
2222 | FETCH_START, FETCH_END, Qnil); | |
d206af14 RS |
2223 | } |
2224 | ||
b86e0aaf RS |
2225 | if (! NILP (start_marker)) |
2226 | free_marker (start_marker); | |
2227 | if (! NILP (end_marker)) | |
2228 | free_marker (end_marker); | |
d206af14 RS |
2229 | RESTORE_VALUE; |
2230 | UNGCPRO; | |
b45433b3 JB |
2231 | } |
2232 | ||
eb8c3be9 | 2233 | /* Signal a change immediately after it happens. |
3be11131 | 2234 | CHARPOS is the character position of the start of the changed text. |
b45433b3 JB |
2235 | LENDEL is the number of characters of the text before the change. |
2236 | (Not the whole buffer; just the part that was changed.) | |
8b09e5d0 RS |
2237 | LENINS is the number of characters in that part of the text |
2238 | after the change. */ | |
b45433b3 | 2239 | |
c660b094 | 2240 | void |
3be11131 RS |
2241 | signal_after_change (charpos, lendel, lenins) |
2242 | int charpos, lendel, lenins; | |
b45433b3 | 2243 | { |
fd16a4c6 KH |
2244 | if (inhibit_modification_hooks) |
2245 | return; | |
2246 | ||
fb2e7d14 RS |
2247 | /* If we are deferring calls to the after-change functions |
2248 | and there are no before-change functions, | |
2249 | just record the args that we were going to use. */ | |
2250 | if (! NILP (Vcombine_after_change_calls) | |
1675d086 | 2251 | && NILP (Vbefore_change_functions) |
fbebdf81 SM |
2252 | && !current_buffer->overlays_before |
2253 | && !current_buffer->overlays_after) | |
fb2e7d14 RS |
2254 | { |
2255 | Lisp_Object elt; | |
2256 | ||
2257 | if (!NILP (combine_after_change_list) | |
2258 | && current_buffer != XBUFFER (combine_after_change_buffer)) | |
2259 | Fcombine_after_change_execute (); | |
2260 | ||
3be11131 RS |
2261 | elt = Fcons (make_number (charpos - BEG), |
2262 | Fcons (make_number (Z - (charpos - lendel + lenins)), | |
fb2e7d14 RS |
2263 | Fcons (make_number (lenins - lendel), Qnil))); |
2264 | combine_after_change_list | |
2265 | = Fcons (elt, combine_after_change_list); | |
2266 | combine_after_change_buffer = Fcurrent_buffer (); | |
2267 | ||
2268 | return; | |
2269 | } | |
2270 | ||
177c0ea7 | 2271 | if (!NILP (combine_after_change_list)) |
fb2e7d14 RS |
2272 | Fcombine_after_change_execute (); |
2273 | ||
e45fb8bf RS |
2274 | if (!NILP (Vafter_change_functions)) |
2275 | { | |
3d1e2d9c RS |
2276 | Lisp_Object args[4]; |
2277 | Lisp_Object before_change_functions; | |
2278 | Lisp_Object after_change_functions; | |
460e6bae GM |
2279 | struct buffer *old = current_buffer; |
2280 | struct buffer *new; | |
3d1e2d9c RS |
2281 | struct gcpro gcpro1, gcpro2; |
2282 | ||
2283 | /* "Bind" before-change-functions and after-change-functions | |
2284 | to nil--but in a way that errors don't know about. | |
2285 | That way, if there's an error in them, they will stay nil. */ | |
2286 | before_change_functions = Vbefore_change_functions; | |
2287 | after_change_functions = Vafter_change_functions; | |
c82c1da0 KH |
2288 | Vbefore_change_functions = Qnil; |
2289 | Vafter_change_functions = Qnil; | |
3d1e2d9c RS |
2290 | GCPRO2 (before_change_functions, after_change_functions); |
2291 | ||
2292 | /* Actually run the hook functions. */ | |
2293 | args[0] = Qafter_change_functions; | |
3be11131 RS |
2294 | XSETFASTINT (args[1], charpos); |
2295 | XSETFASTINT (args[2], charpos + lenins); | |
3d1e2d9c RS |
2296 | XSETFASTINT (args[3], lendel); |
2297 | run_hook_list_with_args (after_change_functions, | |
2298 | 4, args); | |
2299 | ||
460e6bae GM |
2300 | /* "Unbind" the variables we "bound" to nil. Beware a |
2301 | buffer-local hook which changes the buffer when run (e.g. W3). */ | |
2302 | if (old != current_buffer) | |
2303 | { | |
2304 | new = current_buffer; | |
2305 | set_buffer_internal (old); | |
2306 | Vbefore_change_functions = before_change_functions; | |
2307 | Vafter_change_functions = after_change_functions; | |
2308 | set_buffer_internal (new); | |
2309 | } | |
2310 | else | |
2311 | { | |
2312 | Vbefore_change_functions = before_change_functions; | |
2313 | Vafter_change_functions = after_change_functions; | |
2314 | } | |
3d1e2d9c | 2315 | UNGCPRO; |
e45fb8bf | 2316 | } |
d07c0804 | 2317 | |
fbebdf81 | 2318 | if (current_buffer->overlays_before || current_buffer->overlays_after) |
3be11131 RS |
2319 | report_overlay_modification (make_number (charpos), |
2320 | make_number (charpos + lenins), | |
d07c0804 | 2321 | 1, |
3be11131 RS |
2322 | make_number (charpos), |
2323 | make_number (charpos + lenins), | |
d07c0804 | 2324 | make_number (lendel)); |
c5ca0786 RS |
2325 | |
2326 | /* After an insertion, call the text properties | |
2327 | insert-behind-hooks or insert-in-front-hooks. */ | |
2328 | if (lendel == 0) | |
d6b81c0f AS |
2329 | report_interval_modification (make_number (charpos), |
2330 | make_number (charpos + lenins)); | |
b45433b3 | 2331 | } |
fb2e7d14 RS |
2332 | |
2333 | Lisp_Object | |
2334 | Fcombine_after_change_execute_1 (val) | |
2335 | Lisp_Object val; | |
2336 | { | |
2337 | Vcombine_after_change_calls = val; | |
2338 | return val; | |
2339 | } | |
2340 | ||
2341 | DEFUN ("combine-after-change-execute", Fcombine_after_change_execute, | |
335c5470 PJ |
2342 | Scombine_after_change_execute, 0, 0, 0, |
2343 | doc: /* This function is for use internally in `combine-after-change-calls'. */) | |
2344 | () | |
fb2e7d14 | 2345 | { |
aed13378 | 2346 | int count = SPECPDL_INDEX (); |
fb2e7d14 RS |
2347 | int beg, end, change; |
2348 | int begpos, endpos; | |
2349 | Lisp_Object tail; | |
2350 | ||
101e446f KH |
2351 | if (NILP (combine_after_change_list)) |
2352 | return Qnil; | |
2353 | ||
c47a9ed1 CY |
2354 | /* It is rare for combine_after_change_buffer to be invalid, but |
2355 | possible. It can happen when combine-after-change-calls is | |
2356 | non-nil, and insertion calls a file handler (e.g. through | |
2357 | lock_file) which scribbles into a temp file -- cyd */ | |
2358 | if (!BUFFERP (combine_after_change_buffer) | |
2359 | || NILP (XBUFFER (combine_after_change_buffer)->name)) | |
2360 | { | |
2361 | combine_after_change_list = Qnil; | |
2362 | return Qnil; | |
2363 | } | |
2364 | ||
fb2e7d14 RS |
2365 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); |
2366 | ||
2367 | Fset_buffer (combine_after_change_buffer); | |
2368 | ||
2369 | /* # chars unchanged at beginning of buffer. */ | |
2370 | beg = Z - BEG; | |
2371 | /* # chars unchanged at end of buffer. */ | |
2372 | end = beg; | |
2373 | /* Total amount of insertion (negative for deletion). */ | |
2374 | change = 0; | |
2375 | ||
2376 | /* Scan the various individual changes, | |
2377 | accumulating the range info in BEG, END and CHANGE. */ | |
2378 | for (tail = combine_after_change_list; CONSP (tail); | |
03699b14 | 2379 | tail = XCDR (tail)) |
fb2e7d14 | 2380 | { |
e688a080 KH |
2381 | Lisp_Object elt; |
2382 | int thisbeg, thisend, thischange; | |
fb2e7d14 RS |
2383 | |
2384 | /* Extract the info from the next element. */ | |
03699b14 | 2385 | elt = XCAR (tail); |
fb2e7d14 RS |
2386 | if (! CONSP (elt)) |
2387 | continue; | |
03699b14 | 2388 | thisbeg = XINT (XCAR (elt)); |
fb2e7d14 | 2389 | |
03699b14 | 2390 | elt = XCDR (elt); |
fb2e7d14 RS |
2391 | if (! CONSP (elt)) |
2392 | continue; | |
03699b14 | 2393 | thisend = XINT (XCAR (elt)); |
fb2e7d14 | 2394 | |
03699b14 | 2395 | elt = XCDR (elt); |
fb2e7d14 RS |
2396 | if (! CONSP (elt)) |
2397 | continue; | |
03699b14 | 2398 | thischange = XINT (XCAR (elt)); |
fb2e7d14 RS |
2399 | |
2400 | /* Merge this range into the accumulated range. */ | |
2401 | change += thischange; | |
2402 | if (thisbeg < beg) | |
2403 | beg = thisbeg; | |
2404 | if (thisend < end) | |
2405 | end = thisend; | |
2406 | } | |
2407 | ||
2408 | /* Get the current start and end positions of the range | |
2409 | that was changed. */ | |
2410 | begpos = BEG + beg; | |
2411 | endpos = Z - end; | |
177c0ea7 | 2412 | |
fb2e7d14 RS |
2413 | /* We are about to handle these, so discard them. */ |
2414 | combine_after_change_list = Qnil; | |
2415 | ||
2416 | /* Now run the after-change functions for real. | |
2417 | Turn off the flag that defers them. */ | |
2418 | record_unwind_protect (Fcombine_after_change_execute_1, | |
2419 | Vcombine_after_change_calls); | |
2420 | signal_after_change (begpos, endpos - begpos - change, endpos - begpos); | |
0ef71121 | 2421 | update_compositions (begpos, endpos, CHECK_ALL); |
fb2e7d14 | 2422 | |
101e446f | 2423 | return unbind_to (count, Qnil); |
fb2e7d14 RS |
2424 | } |
2425 | \f | |
dfcf069d | 2426 | void |
fb2e7d14 RS |
2427 | syms_of_insdel () |
2428 | { | |
2429 | staticpro (&combine_after_change_list); | |
bf0bf758 | 2430 | staticpro (&combine_after_change_buffer); |
fb2e7d14 | 2431 | combine_after_change_list = Qnil; |
101e446f | 2432 | combine_after_change_buffer = Qnil; |
fb2e7d14 | 2433 | |
60ea6052 | 2434 | DEFVAR_BOOL ("check-markers-debug-flag", &check_markers_debug_flag, |
335c5470 | 2435 | doc: /* Non-nil means enable debugging checks for invalid marker positions. */); |
60ea6052 | 2436 | check_markers_debug_flag = 0; |
fb2e7d14 | 2437 | DEFVAR_LISP ("combine-after-change-calls", &Vcombine_after_change_calls, |
335c5470 | 2438 | doc: /* Used internally by the `combine-after-change-calls' macro. */); |
fb2e7d14 RS |
2439 | Vcombine_after_change_calls = Qnil; |
2440 | ||
7baf49cf | 2441 | DEFVAR_BOOL ("inhibit-modification-hooks", &inhibit_modification_hooks, |
335c5470 PJ |
2442 | doc: /* Non-nil means don't run any of the hooks that respond to buffer changes. |
2443 | This affects `before-change-functions' and `after-change-functions', | |
2444 | as well as hooks attached to text properties and overlays. */); | |
7baf49cf | 2445 | inhibit_modification_hooks = 0; |
27ea0af2 GM |
2446 | Qinhibit_modification_hooks = intern ("inhibit-modification-hooks"); |
2447 | staticpro (&Qinhibit_modification_hooks); | |
7baf49cf | 2448 | |
fb2e7d14 RS |
2449 | defsubr (&Scombine_after_change_execute); |
2450 | } | |
ab5796a9 MB |
2451 | |
2452 | /* arch-tag: 9b34b886-47d7-465e-a234-299af411b23d | |
2453 | (do not change this comment) */ |