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" |
811f7370 | 27 | #include "character.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 | |
6b61353c KH |
444 | - disordered start and end in overlays, and |
445 | - disordered overlays in the slot `overlays_before' of current_buffer. */ | |
469ff680 | 446 | if (adjusted) |
6b61353c KH |
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 | 661 | |
2b083808 RS |
662 | while (bytes_left > 0) |
663 | { | |
b16afa45 KH |
664 | int thislen, c; |
665 | c = STRING_CHAR_AND_LENGTH (from_addr, bytes_left, thislen); | |
47e20ea4 | 666 | if (!ASCII_CHAR_P (c)) |
4ec36780 | 667 | c = multibyte_char_to_unibyte (c, tbl); |
f44cbcd8 | 668 | *to_addr++ = c; |
2b083808 | 669 | from_addr += thislen; |
7e79b8e0 | 670 | bytes_left -= thislen; |
2b083808 RS |
671 | nchars++; |
672 | } | |
673 | return nchars; | |
674 | } | |
675 | else | |
676 | { | |
677 | unsigned char *initial_to_addr = to_addr; | |
678 | ||
679 | /* Convert single-byte to multibyte. */ | |
680 | while (nbytes > 0) | |
681 | { | |
682 | int c = *from_addr++; | |
2b083808 | 683 | |
b16afa45 | 684 | if (c >= 0200) |
2b083808 | 685 | { |
59a52d50 | 686 | c = unibyte_char_to_multibyte (c); |
0ef71121 | 687 | to_addr += CHAR_STRING (c, to_addr); |
2b083808 RS |
688 | nbytes--; |
689 | } | |
690 | else | |
691 | /* Special case for speed. */ | |
692 | *to_addr++ = c, nbytes--; | |
693 | } | |
694 | return to_addr - initial_to_addr; | |
695 | } | |
696 | } | |
697 | ||
698 | /* Return the number of bytes it would take | |
699 | to convert some single-byte text to multibyte. | |
700 | The single-byte text consists of NBYTES bytes at PTR. */ | |
701 | ||
702 | int | |
703 | count_size_as_multibyte (ptr, nbytes) | |
641a26d2 | 704 | const unsigned char *ptr; |
2b083808 RS |
705 | int nbytes; |
706 | { | |
707 | int i; | |
708 | int outgoing_nbytes = 0; | |
709 | ||
710 | for (i = 0; i < nbytes; i++) | |
711 | { | |
712 | unsigned int c = *ptr++; | |
59a52d50 | 713 | |
b16afa45 | 714 | if (c < 0200) |
59a52d50 KH |
715 | outgoing_nbytes++; |
716 | else | |
2b083808 | 717 | { |
59a52d50 | 718 | c = unibyte_char_to_multibyte (c); |
643044eb | 719 | outgoing_nbytes += CHAR_BYTES (c); |
2b083808 | 720 | } |
2b083808 RS |
721 | } |
722 | ||
723 | return outgoing_nbytes; | |
724 | } | |
725 | \f | |
b45433b3 | 726 | /* Insert a string of specified length before point. |
2b083808 RS |
727 | This function judges multibyteness based on |
728 | enable_multibyte_characters in the current buffer; | |
729 | it never converts between single-byte and multibyte. | |
730 | ||
ef29f213 KH |
731 | DO NOT use this for the contents of a Lisp string or a Lisp buffer! |
732 | prepare_to_modify_buffer could relocate the text. */ | |
b45433b3 | 733 | |
c660b094 | 734 | void |
3be11131 | 735 | insert (string, nbytes) |
641a26d2 | 736 | register const unsigned char *string; |
dfcf069d | 737 | register int nbytes; |
b45433b3 | 738 | { |
3be11131 | 739 | if (nbytes > 0) |
395ec62e | 740 | { |
bab3eee1 EZ |
741 | int len = chars_in_text (string, nbytes), opoint; |
742 | insert_1_both (string, len, nbytes, 0, 1, 0); | |
743 | opoint = PT - len; | |
744 | signal_after_change (opoint, 0, len); | |
0ef71121 | 745 | update_compositions (opoint, PT, CHECK_BORDER); |
cd11ef31 RS |
746 | } |
747 | } | |
748 | ||
2b083808 RS |
749 | /* Likewise, but inherit text properties from neighboring characters. */ |
750 | ||
c660b094 | 751 | void |
3be11131 | 752 | insert_and_inherit (string, nbytes) |
641a26d2 | 753 | register const unsigned char *string; |
dfcf069d | 754 | register int nbytes; |
cd11ef31 | 755 | { |
3be11131 | 756 | if (nbytes > 0) |
cd11ef31 | 757 | { |
bab3eee1 EZ |
758 | int len = chars_in_text (string, nbytes), opoint; |
759 | insert_1_both (string, len, nbytes, 1, 1, 0); | |
760 | opoint = PT - len; | |
761 | signal_after_change (opoint, 0, len); | |
0ef71121 | 762 | update_compositions (opoint, PT, CHECK_BORDER); |
395ec62e KH |
763 | } |
764 | } | |
b45433b3 | 765 | |
2b083808 | 766 | /* Insert the character C before point. Do not inherit text properties. */ |
3be11131 | 767 | |
c660b094 | 768 | void |
3be11131 RS |
769 | insert_char (c) |
770 | int c; | |
771 | { | |
0ef71121 | 772 | unsigned char str[MAX_MULTIBYTE_LENGTH]; |
2b083808 RS |
773 | int len; |
774 | ||
775 | if (! NILP (current_buffer->enable_multibyte_characters)) | |
0ef71121 | 776 | len = CHAR_STRING (c, str); |
2b083808 RS |
777 | else |
778 | { | |
779 | len = 1; | |
0ef71121 | 780 | str[0] = c; |
2b083808 | 781 | } |
3be11131 RS |
782 | |
783 | insert (str, len); | |
784 | } | |
785 | ||
2b083808 | 786 | /* Insert the null-terminated string S before point. */ |
3be11131 RS |
787 | |
788 | void | |
789 | insert_string (s) | |
641a26d2 | 790 | const char *s; |
3be11131 RS |
791 | { |
792 | insert (s, strlen (s)); | |
793 | } | |
794 | ||
795 | /* Like `insert' except that all markers pointing at the place where | |
796 | the insertion happens are adjusted to point after it. | |
797 | Don't use this function to insert part of a Lisp string, | |
798 | since gc could happen and relocate it. */ | |
799 | ||
800 | void | |
801 | insert_before_markers (string, nbytes) | |
641a26d2 | 802 | const unsigned char *string; |
3be11131 RS |
803 | register int nbytes; |
804 | { | |
805 | if (nbytes > 0) | |
806 | { | |
bab3eee1 EZ |
807 | int len = chars_in_text (string, nbytes), opoint; |
808 | insert_1_both (string, len, nbytes, 0, 1, 1); | |
809 | opoint = PT - len; | |
810 | signal_after_change (opoint, 0, len); | |
0ef71121 | 811 | update_compositions (opoint, PT, CHECK_BORDER); |
3be11131 RS |
812 | } |
813 | } | |
814 | ||
2b083808 RS |
815 | /* Likewise, but inherit text properties from neighboring characters. */ |
816 | ||
3be11131 RS |
817 | void |
818 | insert_before_markers_and_inherit (string, nbytes) | |
641a26d2 | 819 | const unsigned char *string; |
3be11131 RS |
820 | register int nbytes; |
821 | { | |
822 | if (nbytes > 0) | |
823 | { | |
bab3eee1 EZ |
824 | int len = chars_in_text (string, nbytes), opoint; |
825 | insert_1_both (string, len, nbytes, 1, 1, 1); | |
826 | opoint = PT - len; | |
827 | signal_after_change (opoint, 0, len); | |
0ef71121 | 828 | update_compositions (opoint, PT, CHECK_BORDER); |
3be11131 RS |
829 | } |
830 | } | |
1f90a790 | 831 | |
3be11131 RS |
832 | /* Subroutine used by the insert functions above. */ |
833 | ||
834 | void | |
835 | insert_1 (string, nbytes, inherit, prepare, before_markers) | |
641a26d2 | 836 | register const unsigned char *string; |
3be11131 RS |
837 | register int nbytes; |
838 | int inherit, prepare, before_markers; | |
395ec62e | 839 | { |
432f78d2 RS |
840 | insert_1_both (string, chars_in_text (string, nbytes), nbytes, |
841 | inherit, prepare, before_markers); | |
842 | } | |
b16afa45 | 843 | |
1f90a790 | 844 | \f |
b16afa45 KH |
845 | #ifdef BYTE_COMBINING_DEBUG |
846 | ||
432f78d2 RS |
847 | /* See if the bytes before POS/POS_BYTE combine with bytes |
848 | at the start of STRING to form a single character. | |
ce97a2d7 | 849 | If so, return the number of bytes at the start of STRING |
432f78d2 | 850 | which combine in this way. Otherwise, return 0. */ |
b45433b3 | 851 | |
432f78d2 RS |
852 | int |
853 | count_combining_before (string, length, pos, pos_byte) | |
641a26d2 | 854 | const unsigned char *string; |
432f78d2 RS |
855 | int length; |
856 | int pos, pos_byte; | |
857 | { | |
cae184f2 | 858 | int len, combining_bytes; |
641a26d2 | 859 | const unsigned char *p; |
b45433b3 | 860 | |
432f78d2 RS |
861 | if (NILP (current_buffer->enable_multibyte_characters)) |
862 | return 0; | |
cae184f2 KH |
863 | |
864 | /* At first, we can exclude the following cases: | |
865 | (1) STRING[0] can't be a following byte of multibyte sequence. | |
866 | (2) POS is the start of the current buffer. | |
867 | (3) A character before POS is not a multibyte character. */ | |
868 | if (length == 0 || CHAR_HEAD_P (*string)) /* case (1) */ | |
432f78d2 | 869 | return 0; |
cae184f2 | 870 | if (pos_byte == BEG_BYTE) /* case (2) */ |
432f78d2 | 871 | return 0; |
cae184f2 KH |
872 | len = 1; |
873 | p = BYTE_POS_ADDR (pos_byte - 1); | |
874 | while (! CHAR_HEAD_P (*p)) p--, len++; | |
875 | if (! BASE_LEADING_CODE_P (*p)) /* case (3) */ | |
432f78d2 | 876 | return 0; |
cae184f2 | 877 | |
cae184f2 KH |
878 | combining_bytes = BYTES_BY_CHAR_HEAD (*p) - len; |
879 | if (combining_bytes <= 0) | |
880 | /* The character preceding POS is, complete and no room for | |
881 | combining bytes (combining_bytes == 0), or an independent 8-bit | |
882 | character (combining_bytes < 0). */ | |
432f78d2 | 883 | return 0; |
ce97a2d7 | 884 | |
cae184f2 KH |
885 | /* We have a combination situation. Count the bytes at STRING that |
886 | may combine. */ | |
887 | p = string + 1; | |
ce97a2d7 RS |
888 | while (!CHAR_HEAD_P (*p) && p < string + length) |
889 | p++; | |
890 | ||
cae184f2 | 891 | return (combining_bytes < p - string ? combining_bytes : p - string); |
432f78d2 | 892 | } |
b45433b3 | 893 | |
432f78d2 RS |
894 | /* See if the bytes after POS/POS_BYTE combine with bytes |
895 | at the end of STRING to form a single character. | |
896 | If so, return the number of bytes after POS/POS_BYTE | |
897 | which combine in this way. Otherwise, return 0. */ | |
679194a6 | 898 | |
432f78d2 RS |
899 | int |
900 | count_combining_after (string, length, pos, pos_byte) | |
641a26d2 | 901 | const unsigned char *string; |
432f78d2 RS |
902 | int length; |
903 | int pos, pos_byte; | |
904 | { | |
6021f7c5 | 905 | int opos_byte = pos_byte; |
432f78d2 | 906 | int i; |
6021f7c5 | 907 | int bytes; |
cae184f2 | 908 | unsigned char *bufp; |
3be11131 | 909 | |
432f78d2 RS |
910 | if (NILP (current_buffer->enable_multibyte_characters)) |
911 | return 0; | |
cae184f2 KH |
912 | |
913 | /* At first, we can exclude the following cases: | |
914 | (1) The last byte of STRING is an ASCII. | |
915 | (2) POS is the last of the current buffer. | |
916 | (3) A character at POS can't be a following byte of multibyte | |
917 | character. */ | |
918 | if (length > 0 && ASCII_BYTE_P (string[length - 1])) /* case (1) */ | |
919 | return 0; | |
920 | if (pos_byte == Z_BYTE) /* case (2) */ | |
432f78d2 | 921 | return 0; |
cae184f2 KH |
922 | bufp = BYTE_POS_ADDR (pos_byte); |
923 | if (CHAR_HEAD_P (*bufp)) /* case (3) */ | |
924 | return 0; | |
925 | ||
432f78d2 | 926 | i = length - 1; |
b57a7b0b | 927 | while (i >= 0 && ! CHAR_HEAD_P (string[i])) |
432f78d2 RS |
928 | { |
929 | i--; | |
930 | } | |
b57a7b0b KH |
931 | if (i < 0) |
932 | { | |
cae184f2 KH |
933 | /* All characters in STRING are not character head. We must |
934 | check also preceding bytes at POS. We are sure that the gap | |
935 | is at POS. */ | |
936 | unsigned char *p = BEG_ADDR; | |
b57a7b0b | 937 | i = pos_byte - 2; |
cae184f2 | 938 | while (i >= 0 && ! CHAR_HEAD_P (p[i])) |
b57a7b0b | 939 | i--; |
cae184f2 | 940 | if (i < 0 || !BASE_LEADING_CODE_P (p[i])) |
b57a7b0b | 941 | return 0; |
0ef71121 | 942 | |
cae184f2 KH |
943 | bytes = BYTES_BY_CHAR_HEAD (p[i]); |
944 | return (bytes <= pos_byte - 1 - i + length | |
945 | ? 0 | |
946 | : bytes - (pos_byte - 1 - i + length)); | |
b57a7b0b | 947 | } |
cae184f2 | 948 | if (!BASE_LEADING_CODE_P (string[i])) |
432f78d2 RS |
949 | return 0; |
950 | ||
cae184f2 KH |
951 | bytes = BYTES_BY_CHAR_HEAD (string[i]) - (length - i); |
952 | bufp++, pos_byte++; | |
953 | while (!CHAR_HEAD_P (*bufp)) bufp++, pos_byte++; | |
cd11ef31 | 954 | |
cae184f2 | 955 | return (bytes <= pos_byte - opos_byte ? bytes : pos_byte - opos_byte); |
b45433b3 | 956 | } |
2b083808 | 957 | |
b16afa45 | 958 | #endif |
9f3ede3c | 959 | |
1f90a790 | 960 | \f |
2b083808 RS |
961 | /* Insert a sequence of NCHARS chars which occupy NBYTES bytes |
962 | starting at STRING. INHERIT, PREPARE and BEFORE_MARKERS | |
963 | are the same as in insert_1. */ | |
964 | ||
965 | void | |
966 | insert_1_both (string, nchars, nbytes, inherit, prepare, before_markers) | |
641a26d2 | 967 | register const unsigned char *string; |
2b083808 RS |
968 | register int nchars, nbytes; |
969 | int inherit, prepare, before_markers; | |
970 | { | |
da80a8d5 GM |
971 | if (nchars == 0) |
972 | return; | |
177c0ea7 | 973 | |
57404188 KH |
974 | if (NILP (current_buffer->enable_multibyte_characters)) |
975 | nchars = nbytes; | |
976 | ||
35d63725 RS |
977 | if (prepare) |
978 | /* Do this before moving and increasing the gap, | |
979 | because the before-change hooks might move the gap | |
980 | or make it smaller. */ | |
981 | prepare_to_modify_buffer (PT, PT, NULL); | |
982 | ||
2b083808 RS |
983 | if (PT != GPT) |
984 | move_gap_both (PT, PT_BYTE); | |
985 | if (GAP_SIZE < nbytes) | |
986 | make_gap (nbytes - GAP_SIZE); | |
987 | ||
b16afa45 KH |
988 | #ifdef BYTE_COMBINING_DEBUG |
989 | if (count_combining_before (string, nbytes, PT, PT_BYTE) | |
990 | || count_combining_after (string, nbytes, PT, PT_BYTE)) | |
991 | abort (); | |
992 | #endif | |
432f78d2 RS |
993 | |
994 | /* Record deletion of the surrounding text that combines with | |
995 | the insertion. This, together with recording the insertion, | |
b16afa45 KH |
996 | will add up to the right stuff in the undo list. */ |
997 | record_insert (PT, nchars); | |
2b083808 | 998 | MODIFF++; |
3e145152 | 999 | CHARS_MODIFF = MODIFF; |
2b083808 RS |
1000 | |
1001 | bcopy (string, GPT_ADDR, nbytes); | |
1002 | ||
2b083808 | 1003 | GAP_SIZE -= nbytes; |
1f90a790 RS |
1004 | GPT += nchars; |
1005 | ZV += nchars; | |
1006 | Z += nchars; | |
2b083808 RS |
1007 | GPT_BYTE += nbytes; |
1008 | ZV_BYTE += nbytes; | |
1009 | Z_BYTE += nbytes; | |
1010 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1f90a790 | 1011 | |
1f90a790 RS |
1012 | if (GPT_BYTE < GPT) |
1013 | abort (); | |
1014 | ||
9dde4e0c KS |
1015 | /* The insert may have been in the unchanged region, so check again. */ |
1016 | if (Z - GPT < END_UNCHANGED) | |
1017 | END_UNCHANGED = Z - GPT; | |
1018 | ||
1f90a790 | 1019 | adjust_overlays_for_insert (PT, nchars); |
432f78d2 | 1020 | adjust_markers_for_insert (PT, PT_BYTE, |
1f90a790 | 1021 | PT + nchars, PT_BYTE + nbytes, |
2b083808 | 1022 | before_markers); |
ce97a2d7 | 1023 | |
1f90a790 | 1024 | if (BUF_INTERVALS (current_buffer) != 0) |
1f90a790 RS |
1025 | offset_intervals (current_buffer, PT, nchars); |
1026 | ||
ce97a2d7 | 1027 | if (!inherit && BUF_INTERVALS (current_buffer) != 0) |
f2cab2ea GM |
1028 | set_text_properties (make_number (PT), make_number (PT + nchars), |
1029 | Qnil, Qnil, Qnil); | |
ce97a2d7 | 1030 | |
b16afa45 | 1031 | adjust_point (nchars, nbytes); |
828f1ed3 KH |
1032 | |
1033 | CHECK_MARKERS (); | |
2b083808 | 1034 | } |
3be11131 | 1035 | \f |
679194a6 | 1036 | /* Insert the part of the text of STRING, a Lisp object assumed to be |
2b083808 RS |
1037 | of type string, consisting of the LENGTH characters (LENGTH_BYTE bytes) |
1038 | starting at position POS / POS_BYTE. If the text of STRING has properties, | |
1039 | copy them into the buffer. | |
679194a6 JA |
1040 | |
1041 | It does not work to use `insert' for this, because a GC could happen | |
7e1ea612 JB |
1042 | before we bcopy the stuff into the buffer, and relocate the string |
1043 | without insert noticing. */ | |
679194a6 | 1044 | |
c660b094 | 1045 | void |
2b083808 | 1046 | insert_from_string (string, pos, pos_byte, length, length_byte, inherit) |
b45433b3 | 1047 | Lisp_Object string; |
2b083808 | 1048 | register int pos, pos_byte, length, length_byte; |
9391e591 | 1049 | int inherit; |
395ec62e | 1050 | { |
62b82678 | 1051 | int opoint = PT; |
d8bf4256 RS |
1052 | |
1053 | if (SCHARS (string) == 0) | |
1054 | return; | |
1055 | ||
62b82678 RS |
1056 | insert_from_string_1 (string, pos, pos_byte, length, length_byte, |
1057 | inherit, 0); | |
1058 | signal_after_change (opoint, 0, PT - opoint); | |
0ef71121 | 1059 | update_compositions (opoint, PT, CHECK_BORDER); |
395ec62e KH |
1060 | } |
1061 | ||
2b083808 RS |
1062 | /* Like `insert_from_string' except that all markers pointing |
1063 | at the place where the insertion happens are adjusted to point after it. */ | |
3be11131 RS |
1064 | |
1065 | void | |
2b083808 RS |
1066 | insert_from_string_before_markers (string, pos, pos_byte, |
1067 | length, length_byte, inherit) | |
395ec62e | 1068 | Lisp_Object string; |
2b083808 | 1069 | register int pos, pos_byte, length, length_byte; |
395ec62e | 1070 | int inherit; |
3be11131 | 1071 | { |
62b82678 | 1072 | int opoint = PT; |
d8bf4256 RS |
1073 | |
1074 | if (SCHARS (string) == 0) | |
1075 | return; | |
1076 | ||
62b82678 RS |
1077 | insert_from_string_1 (string, pos, pos_byte, length, length_byte, |
1078 | inherit, 1); | |
1079 | signal_after_change (opoint, 0, PT - opoint); | |
0ef71121 | 1080 | update_compositions (opoint, PT, CHECK_BORDER); |
3be11131 RS |
1081 | } |
1082 | ||
1083 | /* Subroutine of the insertion functions above. */ | |
1084 | ||
1085 | static void | |
2b083808 RS |
1086 | insert_from_string_1 (string, pos, pos_byte, nchars, nbytes, |
1087 | inherit, before_markers) | |
3be11131 | 1088 | Lisp_Object string; |
2b083808 | 1089 | register int pos, pos_byte, nchars, nbytes; |
3be11131 | 1090 | int inherit, before_markers; |
b45433b3 | 1091 | { |
b45433b3 | 1092 | struct gcpro gcpro1; |
2b083808 | 1093 | int outgoing_nbytes = nbytes; |
ce97a2d7 | 1094 | INTERVAL intervals; |
2b083808 RS |
1095 | |
1096 | /* Make OUTGOING_NBYTES describe the text | |
1097 | as it will be inserted in this buffer. */ | |
1098 | ||
1099 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1100 | outgoing_nbytes = nchars; | |
2a1d8be0 | 1101 | else if (! STRING_MULTIBYTE (string)) |
2b083808 | 1102 | outgoing_nbytes |
f7e233a8 | 1103 | = count_size_as_multibyte (SDATA (string) + pos_byte, |
2b083808 | 1104 | nbytes); |
b45433b3 | 1105 | |
b45433b3 | 1106 | GCPRO1 (string); |
35d63725 RS |
1107 | /* Do this before moving and increasing the gap, |
1108 | because the before-change hooks might move the gap | |
1109 | or make it smaller. */ | |
d206af14 | 1110 | prepare_to_modify_buffer (PT, PT, NULL); |
b45433b3 | 1111 | |
2bcaed71 | 1112 | if (PT != GPT) |
3be11131 | 1113 | move_gap_both (PT, PT_BYTE); |
534b9840 | 1114 | if (GAP_SIZE < outgoing_nbytes) |
2b083808 | 1115 | make_gap (outgoing_nbytes - GAP_SIZE); |
b45433b3 JB |
1116 | UNGCPRO; |
1117 | ||
2b083808 RS |
1118 | /* Copy the string text into the buffer, perhaps converting |
1119 | between single-byte and multibyte. */ | |
d5db4077 | 1120 | copy_text (SDATA (string) + pos_byte, GPT_ADDR, nbytes, |
2a1d8be0 | 1121 | STRING_MULTIBYTE (string), |
2b083808 | 1122 | ! NILP (current_buffer->enable_multibyte_characters)); |
b45433b3 | 1123 | |
b16afa45 | 1124 | #ifdef BYTE_COMBINING_DEBUG |
432f78d2 RS |
1125 | /* We have copied text into the gap, but we have not altered |
1126 | PT or PT_BYTE yet. So we can pass PT and PT_BYTE | |
1127 | to these functions and get the same results as we would | |
1128 | have got earlier on. Meanwhile, PT_ADDR does point to | |
1129 | the text that has been stored by copy_text. */ | |
b16afa45 KH |
1130 | if (count_combining_before (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE) |
1131 | || count_combining_after (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE)) | |
1132 | abort (); | |
1133 | #endif | |
432f78d2 | 1134 | |
b16afa45 | 1135 | record_insert (PT, nchars); |
432f78d2 | 1136 | MODIFF++; |
3e145152 | 1137 | CHARS_MODIFF = MODIFF; |
432f78d2 | 1138 | |
7792090e | 1139 | GAP_SIZE -= outgoing_nbytes; |
1f90a790 RS |
1140 | GPT += nchars; |
1141 | ZV += nchars; | |
1142 | Z += nchars; | |
2b083808 RS |
1143 | GPT_BYTE += outgoing_nbytes; |
1144 | ZV_BYTE += outgoing_nbytes; | |
1145 | Z_BYTE += outgoing_nbytes; | |
469ff680 | 1146 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
3be11131 RS |
1147 | |
1148 | if (GPT_BYTE < GPT) | |
1149 | abort (); | |
679194a6 | 1150 | |
9dde4e0c KS |
1151 | /* The insert may have been in the unchanged region, so check again. */ |
1152 | if (Z - GPT < END_UNCHANGED) | |
1153 | END_UNCHANGED = Z - GPT; | |
1154 | ||
1f90a790 RS |
1155 | adjust_overlays_for_insert (PT, nchars); |
1156 | adjust_markers_for_insert (PT, PT_BYTE, PT + nchars, | |
1157 | PT_BYTE + outgoing_nbytes, | |
1f90a790 | 1158 | before_markers); |
ce97a2d7 | 1159 | |
1f90a790 RS |
1160 | offset_intervals (current_buffer, PT, nchars); |
1161 | ||
d5db4077 | 1162 | intervals = STRING_INTERVALS (string); |
b16afa45 | 1163 | /* Get the intervals for the part of the string we are inserting. */ |
d5db4077 | 1164 | if (nbytes < SBYTES (string)) |
1f90a790 | 1165 | intervals = copy_intervals (intervals, pos, nchars); |
177c0ea7 | 1166 | |
ce97a2d7 | 1167 | /* Insert those intervals. */ |
1f90a790 | 1168 | graft_intervals_into_buffer (intervals, PT, nchars, |
9391e591 | 1169 | current_buffer, inherit); |
ce97a2d7 | 1170 | |
b16afa45 | 1171 | adjust_point (nchars, outgoing_nbytes); |
8f924df7 KH |
1172 | |
1173 | CHECK_MARKERS (); | |
1174 | } | |
1175 | \f | |
1176 | /* Insert a sequence of NCHARS chars which occupy NBYTES bytes | |
1177 | starting at GPT_ADDR. */ | |
1178 | ||
1179 | void | |
1180 | insert_from_gap (nchars, nbytes) | |
1181 | register int nchars, nbytes; | |
1182 | { | |
1183 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1184 | nchars = nbytes; | |
1185 | ||
1186 | record_insert (GPT, nchars); | |
1187 | MODIFF++; | |
1188 | ||
1189 | GAP_SIZE -= nbytes; | |
1190 | GPT += nchars; | |
1191 | ZV += nchars; | |
1192 | Z += nchars; | |
1193 | GPT_BYTE += nbytes; | |
1194 | ZV_BYTE += nbytes; | |
1195 | Z_BYTE += nbytes; | |
1196 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1197 | ||
1198 | if (GPT_BYTE < GPT) | |
1199 | abort (); | |
1200 | ||
c669988b KH |
1201 | adjust_overlays_for_insert (GPT - nchars, nchars); |
1202 | adjust_markers_for_insert (GPT - nchars, GPT_BYTE - nbytes, | |
1203 | GPT, GPT_BYTE, 0); | |
8f924df7 KH |
1204 | |
1205 | if (BUF_INTERVALS (current_buffer) != 0) | |
c669988b KH |
1206 | { |
1207 | offset_intervals (current_buffer, GPT - nchars, nchars); | |
1208 | graft_intervals_into_buffer (NULL_INTERVAL, GPT - nchars, nchars, | |
1209 | current_buffer, 0); | |
1210 | } | |
8f924df7 KH |
1211 | |
1212 | if (GPT - nchars < PT) | |
1213 | adjust_point (nchars, nbytes); | |
1214 | ||
1215 | CHECK_MARKERS (); | |
b45433b3 | 1216 | } |
3be11131 RS |
1217 | \f |
1218 | /* Insert text from BUF, NCHARS characters starting at CHARPOS, into the | |
ef29f213 KH |
1219 | current buffer. If the text in BUF has properties, they are absorbed |
1220 | into the current buffer. | |
1221 | ||
1222 | It does not work to use `insert' for this, because a malloc could happen | |
1223 | and relocate BUF's text before the bcopy happens. */ | |
1224 | ||
1225 | void | |
3be11131 | 1226 | insert_from_buffer (buf, charpos, nchars, inherit) |
ef29f213 | 1227 | struct buffer *buf; |
3be11131 | 1228 | int charpos, nchars; |
ef29f213 KH |
1229 | int inherit; |
1230 | { | |
62b82678 | 1231 | int opoint = PT; |
3be11131 | 1232 | |
62b82678 RS |
1233 | insert_from_buffer_1 (buf, charpos, nchars, inherit); |
1234 | signal_after_change (opoint, 0, PT - opoint); | |
0ef71121 | 1235 | update_compositions (opoint, PT, CHECK_BORDER); |
ef29f213 KH |
1236 | } |
1237 | ||
1238 | static void | |
3be11131 | 1239 | insert_from_buffer_1 (buf, from, nchars, inherit) |
ef29f213 | 1240 | struct buffer *buf; |
3be11131 | 1241 | int from, nchars; |
ef29f213 KH |
1242 | int inherit; |
1243 | { | |
0aa8c4b2 | 1244 | register Lisp_Object temp; |
4468c4f1 | 1245 | int chunk, chunk_expanded; |
3be11131 RS |
1246 | int from_byte = buf_charpos_to_bytepos (buf, from); |
1247 | int to_byte = buf_charpos_to_bytepos (buf, from + nchars); | |
2b083808 RS |
1248 | int incoming_nbytes = to_byte - from_byte; |
1249 | int outgoing_nbytes = incoming_nbytes; | |
ce97a2d7 | 1250 | INTERVAL intervals; |
2b083808 RS |
1251 | |
1252 | /* Make OUTGOING_NBYTES describe the text | |
1253 | as it will be inserted in this buffer. */ | |
1254 | ||
1255 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1256 | outgoing_nbytes = nchars; | |
1257 | else if (NILP (buf->enable_multibyte_characters)) | |
4468c4f1 KH |
1258 | { |
1259 | int outgoing_before_gap = 0; | |
1260 | int outgoing_after_gap = 0; | |
ef29f213 | 1261 | |
4468c4f1 KH |
1262 | if (from < BUF_GPT (buf)) |
1263 | { | |
1264 | chunk = BUF_GPT_BYTE (buf) - from_byte; | |
1265 | if (chunk > incoming_nbytes) | |
1266 | chunk = incoming_nbytes; | |
1267 | outgoing_before_gap | |
1268 | = count_size_as_multibyte (BUF_BYTE_ADDRESS (buf, from_byte), | |
1269 | chunk); | |
1270 | } | |
1271 | else | |
1272 | chunk = 0; | |
1273 | ||
1274 | if (chunk < incoming_nbytes) | |
1275 | outgoing_after_gap | |
177c0ea7 | 1276 | = count_size_as_multibyte (BUF_BYTE_ADDRESS (buf, |
4468c4f1 KH |
1277 | from_byte + chunk), |
1278 | incoming_nbytes - chunk); | |
1279 | ||
1280 | outgoing_nbytes = outgoing_before_gap + outgoing_after_gap; | |
1281 | } | |
177c0ea7 | 1282 | |
ef29f213 | 1283 | /* Make sure point-max won't overflow after this insertion. */ |
2b083808 RS |
1284 | XSETINT (temp, outgoing_nbytes + Z); |
1285 | if (outgoing_nbytes + Z != XINT (temp)) | |
3be11131 | 1286 | error ("Maximum buffer size exceeded"); |
ef29f213 | 1287 | |
35d63725 RS |
1288 | /* Do this before moving and increasing the gap, |
1289 | because the before-change hooks might move the gap | |
1290 | or make it smaller. */ | |
d206af14 | 1291 | prepare_to_modify_buffer (PT, PT, NULL); |
ef29f213 KH |
1292 | |
1293 | if (PT != GPT) | |
3be11131 | 1294 | move_gap_both (PT, PT_BYTE); |
2b083808 RS |
1295 | if (GAP_SIZE < outgoing_nbytes) |
1296 | make_gap (outgoing_nbytes - GAP_SIZE); | |
ef29f213 | 1297 | |
3be11131 | 1298 | if (from < BUF_GPT (buf)) |
ef29f213 | 1299 | { |
3be11131 | 1300 | chunk = BUF_GPT_BYTE (buf) - from_byte; |
2b083808 RS |
1301 | if (chunk > incoming_nbytes) |
1302 | chunk = incoming_nbytes; | |
4468c4f1 KH |
1303 | /* Record number of output bytes, so we know where |
1304 | to put the output from the second copy_text. */ | |
1305 | chunk_expanded | |
1306 | = copy_text (BUF_BYTE_ADDRESS (buf, from_byte), | |
1307 | GPT_ADDR, chunk, | |
1308 | ! NILP (buf->enable_multibyte_characters), | |
1309 | ! NILP (current_buffer->enable_multibyte_characters)); | |
ef29f213 KH |
1310 | } |
1311 | else | |
4468c4f1 KH |
1312 | chunk_expanded = chunk = 0; |
1313 | ||
2b083808 RS |
1314 | if (chunk < incoming_nbytes) |
1315 | copy_text (BUF_BYTE_ADDRESS (buf, from_byte + chunk), | |
4468c4f1 | 1316 | GPT_ADDR + chunk_expanded, incoming_nbytes - chunk, |
2b083808 RS |
1317 | ! NILP (buf->enable_multibyte_characters), |
1318 | ! NILP (current_buffer->enable_multibyte_characters)); | |
ef29f213 | 1319 | |
b16afa45 | 1320 | #ifdef BYTE_COMBINING_DEBUG |
432f78d2 RS |
1321 | /* We have copied text into the gap, but we have not altered |
1322 | PT or PT_BYTE yet. So we can pass PT and PT_BYTE | |
1323 | to these functions and get the same results as we would | |
1f90a790 | 1324 | have got earlier on. Meanwhile, GPT_ADDR does point to |
432f78d2 | 1325 | the text that has been stored by copy_text. */ |
b16afa45 KH |
1326 | if (count_combining_before (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE) |
1327 | || count_combining_after (GPT_ADDR, outgoing_nbytes, PT, PT_BYTE)) | |
1328 | abort (); | |
1329 | #endif | |
432f78d2 | 1330 | |
b16afa45 | 1331 | record_insert (PT, nchars); |
432f78d2 | 1332 | MODIFF++; |
3e145152 | 1333 | CHARS_MODIFF = MODIFF; |
432f78d2 | 1334 | |
2b083808 | 1335 | GAP_SIZE -= outgoing_nbytes; |
1f90a790 RS |
1336 | GPT += nchars; |
1337 | ZV += nchars; | |
1338 | Z += nchars; | |
2b083808 RS |
1339 | GPT_BYTE += outgoing_nbytes; |
1340 | ZV_BYTE += outgoing_nbytes; | |
1341 | Z_BYTE += outgoing_nbytes; | |
469ff680 | 1342 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
1f90a790 | 1343 | |
1f90a790 RS |
1344 | if (GPT_BYTE < GPT) |
1345 | abort (); | |
1346 | ||
9dde4e0c KS |
1347 | /* The insert may have been in the unchanged region, so check again. */ |
1348 | if (Z - GPT < END_UNCHANGED) | |
1349 | END_UNCHANGED = Z - GPT; | |
1350 | ||
1f90a790 RS |
1351 | adjust_overlays_for_insert (PT, nchars); |
1352 | adjust_markers_for_insert (PT, PT_BYTE, PT + nchars, | |
432f78d2 | 1353 | PT_BYTE + outgoing_nbytes, |
b16afa45 | 1354 | 0); |
ce97a2d7 | 1355 | |
1f90a790 RS |
1356 | if (BUF_INTERVALS (current_buffer) != 0) |
1357 | offset_intervals (current_buffer, PT, nchars); | |
ce97a2d7 | 1358 | |
b16afa45 | 1359 | /* Get the intervals for the part of the string we are inserting. */ |
ce97a2d7 | 1360 | intervals = BUF_INTERVALS (buf); |
1f90a790 | 1361 | if (outgoing_nbytes < BUF_Z_BYTE (buf) - BUF_BEG_BYTE (buf)) |
06d8227a GM |
1362 | { |
1363 | if (buf == current_buffer && PT <= from) | |
1364 | from += nchars; | |
1365 | intervals = copy_intervals (intervals, from, nchars); | |
1366 | } | |
177c0ea7 | 1367 | |
ce97a2d7 | 1368 | /* Insert those intervals. */ |
1f90a790 | 1369 | graft_intervals_into_buffer (intervals, PT, nchars, current_buffer, inherit); |
ce97a2d7 | 1370 | |
b16afa45 | 1371 | adjust_point (nchars, outgoing_nbytes); |
b45433b3 JB |
1372 | } |
1373 | \f | |
652838b5 KH |
1374 | /* Record undo information and adjust markers and position keepers for |
1375 | a replacement of a text PREV_TEXT at FROM to a new text of LEN | |
1376 | chars (LEN_BYTE bytes) which resides in the gap just after | |
1377 | GPT_ADDR. | |
1378 | ||
1379 | PREV_TEXT nil means the new text was just inserted. */ | |
2d9eea44 | 1380 | |
1e9c7b7d | 1381 | void |
652838b5 KH |
1382 | adjust_after_replace (from, from_byte, prev_text, len, len_byte) |
1383 | int from, from_byte, len, len_byte; | |
1384 | Lisp_Object prev_text; | |
1e9c7b7d | 1385 | { |
652838b5 | 1386 | int nchars_del = 0, nbytes_del = 0; |
61415a25 | 1387 | |
b16afa45 KH |
1388 | #ifdef BYTE_COMBINING_DEBUG |
1389 | if (count_combining_before (GPT_ADDR, len_byte, from, from_byte) | |
1390 | || count_combining_after (GPT_ADDR, len_byte, from, from_byte)) | |
1391 | abort (); | |
1392 | #endif | |
1393 | ||
828f1ed3 KH |
1394 | if (STRINGP (prev_text)) |
1395 | { | |
d5db4077 KR |
1396 | nchars_del = SCHARS (prev_text); |
1397 | nbytes_del = SBYTES (prev_text); | |
828f1ed3 KH |
1398 | } |
1399 | ||
61415a25 KH |
1400 | /* Update various buffer positions for the new text. */ |
1401 | GAP_SIZE -= len_byte; | |
1402 | ZV += len; Z+= len; | |
1403 | ZV_BYTE += len_byte; Z_BYTE += len_byte; | |
1404 | GPT += len; GPT_BYTE += len_byte; | |
1405 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1406 | ||
adee4f91 KH |
1407 | if (nchars_del > 0) |
1408 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, | |
1409 | len, len_byte); | |
1410 | else | |
1411 | adjust_markers_for_insert (from, from_byte, | |
1412 | from + len, from_byte + len_byte, 0); | |
b16afa45 | 1413 | |
828f1ed3 KH |
1414 | if (! EQ (current_buffer->undo_list, Qt)) |
1415 | { | |
828f1ed3 | 1416 | if (nchars_del > 0) |
b16afa45 KH |
1417 | record_delete (from, prev_text); |
1418 | record_insert (from, len); | |
828f1ed3 | 1419 | } |
652838b5 KH |
1420 | |
1421 | if (len > nchars_del) | |
1422 | adjust_overlays_for_insert (from, len - nchars_del); | |
1423 | else if (len < nchars_del) | |
1424 | adjust_overlays_for_delete (from, nchars_del - len); | |
61415a25 | 1425 | if (BUF_INTERVALS (current_buffer) != 0) |
4a7cf15f KH |
1426 | { |
1427 | offset_intervals (current_buffer, from, len - nchars_del); | |
4a7cf15f | 1428 | } |
61415a25 | 1429 | |
b16afa45 KH |
1430 | if (from < PT) |
1431 | adjust_point (len - nchars_del, len_byte - nbytes_del); | |
61415a25 | 1432 | |
9f3ede3c | 1433 | /* As byte combining will decrease Z, we must check this again. */ |
a50df55b GM |
1434 | if (Z - GPT < END_UNCHANGED) |
1435 | END_UNCHANGED = Z - GPT; | |
9f3ede3c | 1436 | |
60ea6052 RS |
1437 | CHECK_MARKERS (); |
1438 | ||
1e9c7b7d | 1439 | if (len == 0) |
b58e3ca1 RS |
1440 | evaporate_overlays (from); |
1441 | MODIFF++; | |
3e145152 | 1442 | CHARS_MODIFF = MODIFF; |
b58e3ca1 RS |
1443 | } |
1444 | ||
1445 | /* Like adjust_after_replace, but doesn't require PREV_TEXT. | |
1446 | This is for use when undo is not enabled in the current buffer. */ | |
1447 | ||
1448 | void | |
1449 | adjust_after_replace_noundo (from, from_byte, nchars_del, nbytes_del, len, len_byte) | |
1450 | int from, from_byte, nchars_del, nbytes_del, len, len_byte; | |
1451 | { | |
1452 | #ifdef BYTE_COMBINING_DEBUG | |
1453 | if (count_combining_before (GPT_ADDR, len_byte, from, from_byte) | |
1454 | || count_combining_after (GPT_ADDR, len_byte, from, from_byte)) | |
1455 | abort (); | |
1456 | #endif | |
1457 | ||
1458 | /* Update various buffer positions for the new text. */ | |
1459 | GAP_SIZE -= len_byte; | |
1460 | ZV += len; Z+= len; | |
1461 | ZV_BYTE += len_byte; Z_BYTE += len_byte; | |
1462 | GPT += len; GPT_BYTE += len_byte; | |
1463 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1464 | ||
1465 | if (nchars_del > 0) | |
1466 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, | |
1467 | len, len_byte); | |
1468 | else | |
1469 | adjust_markers_for_insert (from, from_byte, | |
1470 | from + len, from_byte + len_byte, 0); | |
1471 | ||
1472 | if (len > nchars_del) | |
1473 | adjust_overlays_for_insert (from, len - nchars_del); | |
1474 | else if (len < nchars_del) | |
1475 | adjust_overlays_for_delete (from, nchars_del - len); | |
1476 | if (BUF_INTERVALS (current_buffer) != 0) | |
1477 | { | |
1478 | offset_intervals (current_buffer, from, len - nchars_del); | |
1479 | } | |
1480 | ||
1481 | if (from < PT) | |
1482 | adjust_point (len - nchars_del, len_byte - nbytes_del); | |
1483 | ||
1484 | /* As byte combining will decrease Z, we must check this again. */ | |
1485 | if (Z - GPT < END_UNCHANGED) | |
1486 | END_UNCHANGED = Z - GPT; | |
1487 | ||
1488 | CHECK_MARKERS (); | |
1489 | ||
1490 | if (len == 0) | |
1e9c7b7d KH |
1491 | evaporate_overlays (from); |
1492 | MODIFF++; | |
3e145152 | 1493 | CHARS_MODIFF = MODIFF; |
1e9c7b7d KH |
1494 | } |
1495 | ||
652838b5 KH |
1496 | /* Record undo information, adjust markers and position keepers for an |
1497 | insertion of a text from FROM (FROM_BYTE) to TO (TO_BYTE). The | |
1498 | text already exists in the current buffer but character length (TO | |
1499 | - FROM) may be incorrect, the correct length is NEWLEN. */ | |
1500 | ||
1501 | void | |
1502 | adjust_after_insert (from, from_byte, to, to_byte, newlen) | |
1503 | int from, from_byte, to, to_byte, newlen; | |
1504 | { | |
1505 | int len = to - from, len_byte = to_byte - from_byte; | |
1506 | ||
1507 | if (GPT != to) | |
1508 | move_gap_both (to, to_byte); | |
1509 | GAP_SIZE += len_byte; | |
1510 | GPT -= len; GPT_BYTE -= len_byte; | |
1511 | ZV -= len; ZV_BYTE -= len_byte; | |
1512 | Z -= len; Z_BYTE -= len_byte; | |
1513 | adjust_after_replace (from, from_byte, Qnil, newlen, len_byte); | |
1514 | } | |
085db7de | 1515 | \f |
3be11131 | 1516 | /* Replace the text from character positions FROM to TO with NEW, |
c5ca4d3a RS |
1517 | If PREPARE is nonzero, call prepare_to_modify_buffer. |
1518 | If INHERIT, the newly inserted text should inherit text properties | |
1519 | from the surrounding non-deleted text. */ | |
1520 | ||
1521 | /* Note that this does not yet handle markers quite right. | |
1522 | Also it needs to record a single undo-entry that does a replacement | |
1523 | rather than a separate delete and insert. | |
60aa777a RS |
1524 | That way, undo will also handle markers properly. |
1525 | ||
1526 | But if MARKERS is 0, don't relocate markers. */ | |
c5ca4d3a RS |
1527 | |
1528 | void | |
60aa777a | 1529 | replace_range (from, to, new, prepare, inherit, markers) |
c5ca4d3a | 1530 | Lisp_Object new; |
60aa777a | 1531 | int from, to, prepare, inherit, markers; |
c5ca4d3a | 1532 | { |
d5db4077 KR |
1533 | int inschars = SCHARS (new); |
1534 | int insbytes = SBYTES (new); | |
3be11131 RS |
1535 | int from_byte, to_byte; |
1536 | int nbytes_del, nchars_del; | |
c5ca4d3a RS |
1537 | register Lisp_Object temp; |
1538 | struct gcpro gcpro1; | |
ce97a2d7 | 1539 | INTERVAL intervals; |
1f90a790 | 1540 | int outgoing_insbytes = insbytes; |
23b20a70 | 1541 | Lisp_Object deletion; |
c5ca4d3a | 1542 | |
60ea6052 RS |
1543 | CHECK_MARKERS (); |
1544 | ||
c5ca4d3a | 1545 | GCPRO1 (new); |
6bbd7a29 | 1546 | deletion = Qnil; |
c5ca4d3a RS |
1547 | |
1548 | if (prepare) | |
1549 | { | |
1550 | int range_length = to - from; | |
1551 | prepare_to_modify_buffer (from, to, &from); | |
1552 | to = from + range_length; | |
1553 | } | |
1554 | ||
3be11131 RS |
1555 | UNGCPRO; |
1556 | ||
c5ca4d3a RS |
1557 | /* Make args be valid */ |
1558 | if (from < BEGV) | |
1559 | from = BEGV; | |
1560 | if (to > ZV) | |
1561 | to = ZV; | |
1562 | ||
3be11131 RS |
1563 | from_byte = CHAR_TO_BYTE (from); |
1564 | to_byte = CHAR_TO_BYTE (to); | |
c5ca4d3a | 1565 | |
3be11131 RS |
1566 | nchars_del = to - from; |
1567 | nbytes_del = to_byte - from_byte; | |
1568 | ||
1569 | if (nbytes_del <= 0 && insbytes == 0) | |
1570 | return; | |
c5ca4d3a | 1571 | |
1f90a790 RS |
1572 | /* Make OUTGOING_INSBYTES describe the text |
1573 | as it will be inserted in this buffer. */ | |
1574 | ||
1575 | if (NILP (current_buffer->enable_multibyte_characters)) | |
1576 | outgoing_insbytes = inschars; | |
2a1d8be0 | 1577 | else if (! STRING_MULTIBYTE (new)) |
1f90a790 | 1578 | outgoing_insbytes |
d5db4077 | 1579 | = count_size_as_multibyte (SDATA (new), insbytes); |
1f90a790 | 1580 | |
c5ca4d3a | 1581 | /* Make sure point-max won't overflow after this insertion. */ |
3be11131 RS |
1582 | XSETINT (temp, Z_BYTE - nbytes_del + insbytes); |
1583 | if (Z_BYTE - nbytes_del + insbytes != XINT (temp)) | |
1584 | error ("Maximum buffer size exceeded"); | |
c5ca4d3a | 1585 | |
c5ca4d3a RS |
1586 | GCPRO1 (new); |
1587 | ||
1588 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
1589 | if (from > GPT) | |
3be11131 | 1590 | gap_right (from, from_byte); |
c5ca4d3a | 1591 | if (to < GPT) |
3be11131 | 1592 | gap_left (to, to_byte, 0); |
c5ca4d3a | 1593 | |
039af53a KH |
1594 | /* Even if we don't record for undo, we must keep the original text |
1595 | because we may have to recover it because of inappropriate byte | |
1596 | combining. */ | |
b16afa45 KH |
1597 | if (! EQ (current_buffer->undo_list, Qt)) |
1598 | deletion = make_buffer_string_both (from, from_byte, to, to_byte, 1); | |
c5ca4d3a | 1599 | |
3be11131 RS |
1600 | GAP_SIZE += nbytes_del; |
1601 | ZV -= nchars_del; | |
1602 | Z -= nchars_del; | |
1603 | ZV_BYTE -= nbytes_del; | |
1604 | Z_BYTE -= nbytes_del; | |
c5ca4d3a | 1605 | GPT = from; |
3be11131 | 1606 | GPT_BYTE = from_byte; |
017e09ac | 1607 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
c5ca4d3a | 1608 | |
3be11131 RS |
1609 | if (GPT_BYTE < GPT) |
1610 | abort (); | |
1611 | ||
a50df55b GM |
1612 | if (GPT - BEG < BEG_UNCHANGED) |
1613 | BEG_UNCHANGED = GPT - BEG; | |
1614 | if (Z - GPT < END_UNCHANGED) | |
1615 | END_UNCHANGED = Z - GPT; | |
c5ca4d3a | 1616 | |
3be11131 RS |
1617 | if (GAP_SIZE < insbytes) |
1618 | make_gap (insbytes - GAP_SIZE); | |
c5ca4d3a | 1619 | |
1f90a790 RS |
1620 | /* Copy the string text into the buffer, perhaps converting |
1621 | between single-byte and multibyte. */ | |
d5db4077 | 1622 | copy_text (SDATA (new), GPT_ADDR, insbytes, |
2a1d8be0 | 1623 | STRING_MULTIBYTE (new), |
1f90a790 RS |
1624 | ! NILP (current_buffer->enable_multibyte_characters)); |
1625 | ||
b16afa45 | 1626 | #ifdef BYTE_COMBINING_DEBUG |
255c7dae RS |
1627 | /* We have copied text into the gap, but we have not marked |
1628 | it as part of the buffer. So we can use the old FROM and FROM_BYTE | |
1629 | here, for both the previous text and the following text. | |
1630 | Meanwhile, GPT_ADDR does point to | |
432f78d2 | 1631 | the text that has been stored by copy_text. */ |
b16afa45 KH |
1632 | if (count_combining_before (GPT_ADDR, outgoing_insbytes, from, from_byte) |
1633 | || count_combining_after (GPT_ADDR, outgoing_insbytes, from, from_byte)) | |
1634 | abort (); | |
1635 | #endif | |
432f78d2 | 1636 | |
23b20a70 KH |
1637 | if (! EQ (current_buffer->undo_list, Qt)) |
1638 | { | |
b16afa45 KH |
1639 | record_delete (from, deletion); |
1640 | record_insert (from, inschars); | |
23b20a70 | 1641 | } |
c5ca4d3a | 1642 | |
1f90a790 RS |
1643 | GAP_SIZE -= outgoing_insbytes; |
1644 | GPT += inschars; | |
1645 | ZV += inschars; | |
1646 | Z += inschars; | |
1647 | GPT_BYTE += outgoing_insbytes; | |
1648 | ZV_BYTE += outgoing_insbytes; | |
1649 | Z_BYTE += outgoing_insbytes; | |
c5ca4d3a RS |
1650 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
1651 | ||
3be11131 RS |
1652 | if (GPT_BYTE < GPT) |
1653 | abort (); | |
1654 | ||
c5ca4d3a RS |
1655 | /* Adjust the overlay center as needed. This must be done after |
1656 | adjusting the markers that bound the overlays. */ | |
3be11131 | 1657 | adjust_overlays_for_delete (from, nchars_del); |
1f90a790 | 1658 | adjust_overlays_for_insert (from, inschars); |
048a0fbb RS |
1659 | |
1660 | /* Adjust markers for the deletion and the insertion. */ | |
60aa777a | 1661 | if (markers) |
048a0fbb RS |
1662 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, |
1663 | inschars, outgoing_insbytes); | |
c5ca4d3a | 1664 | |
255c7dae | 1665 | offset_intervals (current_buffer, from, inschars - nchars_del); |
ce97a2d7 RS |
1666 | |
1667 | /* Get the intervals for the part of the string we are inserting-- | |
1668 | not including the combined-before bytes. */ | |
d5db4077 | 1669 | intervals = STRING_INTERVALS (new); |
ce97a2d7 | 1670 | /* Insert those intervals. */ |
1f90a790 | 1671 | graft_intervals_into_buffer (intervals, from, inschars, |
ce97a2d7 | 1672 | current_buffer, inherit); |
c5ca4d3a | 1673 | |
1f90a790 RS |
1674 | /* Relocate point as if it were a marker. */ |
1675 | if (from < PT) | |
8bedbe9d | 1676 | adjust_point ((from + inschars - (PT < to ? PT : to)), |
1f90a790 | 1677 | (from_byte + outgoing_insbytes |
8bedbe9d | 1678 | - (PT_BYTE < to_byte ? PT_BYTE : to_byte))); |
c5ca4d3a | 1679 | |
1f90a790 RS |
1680 | if (outgoing_insbytes == 0) |
1681 | evaporate_overlays (from); | |
93b882e8 | 1682 | |
60ea6052 RS |
1683 | CHECK_MARKERS (); |
1684 | ||
c5ca4d3a | 1685 | MODIFF++; |
3e145152 | 1686 | CHARS_MODIFF = MODIFF; |
c5ca4d3a RS |
1687 | UNGCPRO; |
1688 | ||
255c7dae | 1689 | signal_after_change (from, nchars_del, GPT - from); |
0ef71121 | 1690 | update_compositions (from, GPT, CHECK_BORDER); |
c5ca4d3a RS |
1691 | } |
1692 | \f | |
085db7de RS |
1693 | /* Replace the text from character positions FROM to TO with |
1694 | the text in INS of length INSCHARS. | |
1695 | Keep the text properties that applied to the old characters | |
1696 | (extending them to all the new chars if there are more new chars). | |
1697 | ||
1698 | Note that this does not yet handle markers quite right. | |
1699 | ||
1700 | If MARKERS is nonzero, relocate markers. | |
1701 | ||
1702 | Unlike most functions at this level, never call | |
1703 | prepare_to_modify_buffer and never call signal_after_change. */ | |
1704 | ||
1705 | void | |
1706 | replace_range_2 (from, from_byte, to, to_byte, ins, inschars, insbytes, markers) | |
1707 | int from, from_byte, to, to_byte; | |
1708 | char *ins; | |
1709 | int inschars, insbytes, markers; | |
1710 | { | |
1711 | int nbytes_del, nchars_del; | |
1712 | Lisp_Object temp; | |
1713 | ||
1714 | CHECK_MARKERS (); | |
1715 | ||
1716 | nchars_del = to - from; | |
1717 | nbytes_del = to_byte - from_byte; | |
1718 | ||
1719 | if (nbytes_del <= 0 && insbytes == 0) | |
1720 | return; | |
1721 | ||
1722 | /* Make sure point-max won't overflow after this insertion. */ | |
1723 | XSETINT (temp, Z_BYTE - nbytes_del + insbytes); | |
1724 | if (Z_BYTE - nbytes_del + insbytes != XINT (temp)) | |
1725 | error ("Maximum buffer size exceeded"); | |
1726 | ||
1727 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
1728 | if (from > GPT) | |
1729 | gap_right (from, from_byte); | |
1730 | if (to < GPT) | |
1731 | gap_left (to, to_byte, 0); | |
1732 | ||
1733 | GAP_SIZE += nbytes_del; | |
1734 | ZV -= nchars_del; | |
1735 | Z -= nchars_del; | |
1736 | ZV_BYTE -= nbytes_del; | |
1737 | Z_BYTE -= nbytes_del; | |
1738 | GPT = from; | |
1739 | GPT_BYTE = from_byte; | |
1740 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1741 | ||
1742 | if (GPT_BYTE < GPT) | |
1743 | abort (); | |
1744 | ||
1745 | if (GPT - BEG < BEG_UNCHANGED) | |
1746 | BEG_UNCHANGED = GPT - BEG; | |
1747 | if (Z - GPT < END_UNCHANGED) | |
1748 | END_UNCHANGED = Z - GPT; | |
1749 | ||
1750 | if (GAP_SIZE < insbytes) | |
1751 | make_gap (insbytes - GAP_SIZE); | |
1752 | ||
1753 | /* Copy the replacement text into the buffer. */ | |
1754 | bcopy (ins, GPT_ADDR, insbytes); | |
1755 | ||
1756 | #ifdef BYTE_COMBINING_DEBUG | |
1757 | /* We have copied text into the gap, but we have not marked | |
1758 | it as part of the buffer. So we can use the old FROM and FROM_BYTE | |
1759 | here, for both the previous text and the following text. | |
1760 | Meanwhile, GPT_ADDR does point to | |
1761 | the text that has been stored by copy_text. */ | |
1762 | if (count_combining_before (GPT_ADDR, insbytes, from, from_byte) | |
1763 | || count_combining_after (GPT_ADDR, insbytes, from, from_byte)) | |
1764 | abort (); | |
1765 | #endif | |
1766 | ||
1767 | GAP_SIZE -= insbytes; | |
1768 | GPT += inschars; | |
1769 | ZV += inschars; | |
1770 | Z += inschars; | |
1771 | GPT_BYTE += insbytes; | |
1772 | ZV_BYTE += insbytes; | |
1773 | Z_BYTE += insbytes; | |
1774 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ | |
1775 | ||
1776 | if (GPT_BYTE < GPT) | |
1777 | abort (); | |
1778 | ||
1779 | /* Adjust the overlay center as needed. This must be done after | |
1780 | adjusting the markers that bound the overlays. */ | |
1781 | if (nchars_del != inschars) | |
1782 | { | |
1783 | adjust_overlays_for_insert (from, inschars); | |
1784 | adjust_overlays_for_delete (from + inschars, nchars_del); | |
1785 | } | |
1786 | ||
1787 | /* Adjust markers for the deletion and the insertion. */ | |
1788 | if (markers | |
7077904e | 1789 | && ! (nchars_del == 1 && inschars == 1 && nbytes_del == insbytes)) |
085db7de RS |
1790 | adjust_markers_for_replace (from, from_byte, nchars_del, nbytes_del, |
1791 | inschars, insbytes); | |
1792 | ||
1793 | offset_intervals (current_buffer, from, inschars - nchars_del); | |
1794 | ||
1795 | /* Relocate point as if it were a marker. */ | |
7077904e KH |
1796 | if (from < PT && (nchars_del != inschars || nbytes_del != insbytes)) |
1797 | { | |
1798 | if (PT < to) | |
1799 | /* PT was within the deleted text. Move it to FROM. */ | |
1800 | adjust_point (from - PT, from_byte - PT_BYTE); | |
1801 | else | |
1802 | adjust_point (inschars - nchars_del, insbytes - nbytes_del); | |
1803 | } | |
085db7de RS |
1804 | |
1805 | if (insbytes == 0) | |
1806 | evaporate_overlays (from); | |
1807 | ||
1808 | CHECK_MARKERS (); | |
1809 | ||
1810 | MODIFF++; | |
3e145152 | 1811 | CHARS_MODIFF = MODIFF; |
085db7de RS |
1812 | } |
1813 | \f | |
b45433b3 | 1814 | /* Delete characters in current buffer |
3be11131 RS |
1815 | from FROM up to (but not including) TO. |
1816 | If TO comes before FROM, we delete nothing. */ | |
b45433b3 | 1817 | |
c660b094 | 1818 | void |
b45433b3 JB |
1819 | del_range (from, to) |
1820 | register int from, to; | |
47c64747 | 1821 | { |
7dae4502 | 1822 | del_range_1 (from, to, 1, 0); |
47c64747 RS |
1823 | } |
1824 | ||
7dae4502 SM |
1825 | /* Like del_range; PREPARE says whether to call prepare_to_modify_buffer. |
1826 | RET_STRING says to return the deleted text. */ | |
47c64747 | 1827 | |
7dae4502 SM |
1828 | Lisp_Object |
1829 | del_range_1 (from, to, prepare, ret_string) | |
1830 | int from, to, prepare, ret_string; | |
b45433b3 | 1831 | { |
3be11131 | 1832 | int from_byte, to_byte; |
7dae4502 SM |
1833 | Lisp_Object deletion; |
1834 | struct gcpro gcpro1; | |
3be11131 RS |
1835 | |
1836 | /* Make args be valid */ | |
1837 | if (from < BEGV) | |
1838 | from = BEGV; | |
1839 | if (to > ZV) | |
1840 | to = ZV; | |
1841 | ||
1842 | if (to <= from) | |
7dae4502 | 1843 | return Qnil; |
3be11131 RS |
1844 | |
1845 | if (prepare) | |
1846 | { | |
1847 | int range_length = to - from; | |
1848 | prepare_to_modify_buffer (from, to, &from); | |
0a411995 | 1849 | to = min (ZV, from + range_length); |
3be11131 RS |
1850 | } |
1851 | ||
1852 | from_byte = CHAR_TO_BYTE (from); | |
1853 | to_byte = CHAR_TO_BYTE (to); | |
1854 | ||
7dae4502 SM |
1855 | deletion = del_range_2 (from, from_byte, to, to_byte, ret_string); |
1856 | GCPRO1(deletion); | |
9c36993a | 1857 | signal_after_change (from, to - from, 0); |
233cc02d | 1858 | update_compositions (from, from, CHECK_HEAD); |
7dae4502 SM |
1859 | UNGCPRO; |
1860 | return deletion; | |
3be11131 RS |
1861 | } |
1862 | ||
1863 | /* Like del_range_1 but args are byte positions, not char positions. */ | |
1864 | ||
1865 | void | |
1866 | del_range_byte (from_byte, to_byte, prepare) | |
1867 | int from_byte, to_byte, prepare; | |
1868 | { | |
1869 | int from, to; | |
1870 | ||
1871 | /* Make args be valid */ | |
1872 | if (from_byte < BEGV_BYTE) | |
1873 | from_byte = BEGV_BYTE; | |
1874 | if (to_byte > ZV_BYTE) | |
1875 | to_byte = ZV_BYTE; | |
1876 | ||
1877 | if (to_byte <= from_byte) | |
1878 | return; | |
1879 | ||
1880 | from = BYTE_TO_CHAR (from_byte); | |
1881 | to = BYTE_TO_CHAR (to_byte); | |
b45433b3 | 1882 | |
d206af14 RS |
1883 | if (prepare) |
1884 | { | |
3be11131 | 1885 | int old_from = from, old_to = Z - to; |
d206af14 RS |
1886 | int range_length = to - from; |
1887 | prepare_to_modify_buffer (from, to, &from); | |
1888 | to = from + range_length; | |
3be11131 RS |
1889 | |
1890 | if (old_from != from) | |
1891 | from_byte = CHAR_TO_BYTE (from); | |
0a411995 GM |
1892 | if (to > ZV) |
1893 | { | |
1894 | to = ZV; | |
1895 | to_byte = ZV_BYTE; | |
1896 | } | |
1897 | else if (old_to == Z - to) | |
3be11131 | 1898 | to_byte = CHAR_TO_BYTE (to); |
d206af14 RS |
1899 | } |
1900 | ||
7dae4502 | 1901 | del_range_2 (from, from_byte, to, to_byte, 0); |
9c36993a | 1902 | signal_after_change (from, to - from, 0); |
0ef71121 | 1903 | update_compositions (from, from, CHECK_HEAD); |
3be11131 RS |
1904 | } |
1905 | ||
1906 | /* Like del_range_1, but positions are specified both as charpos | |
1907 | and bytepos. */ | |
1908 | ||
1909 | void | |
353800c7 KH |
1910 | del_range_both (from, from_byte, to, to_byte, prepare) |
1911 | int from, from_byte, to, to_byte, prepare; | |
3be11131 | 1912 | { |
b45433b3 | 1913 | /* Make args be valid */ |
3be11131 RS |
1914 | if (from_byte < BEGV_BYTE) |
1915 | from_byte = BEGV_BYTE; | |
1916 | if (to_byte > ZV_BYTE) | |
1917 | to_byte = ZV_BYTE; | |
1918 | ||
1919 | if (to_byte <= from_byte) | |
1920 | return; | |
1921 | ||
b45433b3 JB |
1922 | if (from < BEGV) |
1923 | from = BEGV; | |
1924 | if (to > ZV) | |
1925 | to = ZV; | |
1926 | ||
3be11131 RS |
1927 | if (prepare) |
1928 | { | |
1929 | int old_from = from, old_to = Z - to; | |
1930 | int range_length = to - from; | |
1931 | prepare_to_modify_buffer (from, to, &from); | |
1932 | to = from + range_length; | |
1933 | ||
1934 | if (old_from != from) | |
1935 | from_byte = CHAR_TO_BYTE (from); | |
0a411995 GM |
1936 | if (to > ZV) |
1937 | { | |
1938 | to = ZV; | |
1939 | to_byte = ZV_BYTE; | |
1940 | } | |
1941 | else if (old_to == Z - to) | |
3be11131 RS |
1942 | to_byte = CHAR_TO_BYTE (to); |
1943 | } | |
1944 | ||
7dae4502 | 1945 | del_range_2 (from, from_byte, to, to_byte, 0); |
9c36993a | 1946 | signal_after_change (from, to - from, 0); |
0ef71121 | 1947 | update_compositions (from, from, CHECK_HEAD); |
3be11131 RS |
1948 | } |
1949 | ||
1950 | /* Delete a range of text, specified both as character positions | |
1951 | and byte positions. FROM and TO are character positions, | |
7dae4502 SM |
1952 | while FROM_BYTE and TO_BYTE are byte positions. |
1953 | If RET_STRING is true, the deleted area is returned as a string. */ | |
3be11131 | 1954 | |
7dae4502 SM |
1955 | Lisp_Object |
1956 | del_range_2 (from, from_byte, to, to_byte, ret_string) | |
1957 | int from, from_byte, to, to_byte, ret_string; | |
3be11131 RS |
1958 | { |
1959 | register int nbytes_del, nchars_del; | |
628cea90 | 1960 | Lisp_Object deletion; |
3be11131 | 1961 | |
60ea6052 RS |
1962 | CHECK_MARKERS (); |
1963 | ||
3be11131 RS |
1964 | nchars_del = to - from; |
1965 | nbytes_del = to_byte - from_byte; | |
b45433b3 JB |
1966 | |
1967 | /* Make sure the gap is somewhere in or next to what we are deleting. */ | |
1968 | if (from > GPT) | |
3be11131 | 1969 | gap_right (from, from_byte); |
b45433b3 | 1970 | if (to < GPT) |
3be11131 | 1971 | gap_left (to, to_byte, 0); |
b45433b3 | 1972 | |
b16afa45 KH |
1973 | #ifdef BYTE_COMBINING_DEBUG |
1974 | if (count_combining_before (BUF_BYTE_ADDRESS (current_buffer, to_byte), | |
1975 | Z_BYTE - to_byte, from, from_byte)) | |
1976 | abort (); | |
1977 | #endif | |
628cea90 | 1978 | |
7dae4502 | 1979 | if (ret_string || ! EQ (current_buffer->undo_list, Qt)) |
b16afa45 | 1980 | deletion = make_buffer_string_both (from, from_byte, to, to_byte, 1); |
7dae4502 SM |
1981 | else |
1982 | deletion = Qnil; | |
1983 | ||
8948d317 RS |
1984 | /* Relocate all markers pointing into the new, larger gap |
1985 | to point at the end of the text before the gap. | |
3be11131 RS |
1986 | Do this before recording the deletion, |
1987 | so that undo handles this after reinserting the text. */ | |
1988 | adjust_markers_for_delete (from, from_byte, to, to_byte); | |
b16afa45 | 1989 | |
0aa8c4b2 | 1990 | if (! EQ (current_buffer->undo_list, Qt)) |
b16afa45 | 1991 | record_delete (from, deletion); |
be09561e | 1992 | MODIFF++; |
3e145152 | 1993 | CHARS_MODIFF = MODIFF; |
be09561e | 1994 | |
b45433b3 | 1995 | /* Relocate point as if it were a marker. */ |
2bcaed71 | 1996 | if (from < PT) |
3be11131 RS |
1997 | adjust_point (from - (PT < to ? PT : to), |
1998 | from_byte - (PT_BYTE < to_byte ? PT_BYTE : to_byte)); | |
b45433b3 | 1999 | |
3be11131 | 2000 | offset_intervals (current_buffer, from, - nchars_del); |
16032db6 | 2001 | |
adde4858 | 2002 | /* Adjust the overlay center as needed. This must be done after |
a7f38d28 | 2003 | adjusting the markers that bound the overlays. */ |
e3a87305 | 2004 | adjust_overlays_for_delete (from, nchars_del); |
adde4858 | 2005 | |
3be11131 RS |
2006 | GAP_SIZE += nbytes_del; |
2007 | ZV_BYTE -= nbytes_del; | |
2008 | Z_BYTE -= nbytes_del; | |
2009 | ZV -= nchars_del; | |
2010 | Z -= nchars_del; | |
b45433b3 | 2011 | GPT = from; |
3be11131 | 2012 | GPT_BYTE = from_byte; |
017e09ac | 2013 | if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */ |
e3a87305 | 2014 | |
3be11131 RS |
2015 | if (GPT_BYTE < GPT) |
2016 | abort (); | |
2017 | ||
a50df55b GM |
2018 | if (GPT - BEG < BEG_UNCHANGED) |
2019 | BEG_UNCHANGED = GPT - BEG; | |
2020 | if (Z - GPT < END_UNCHANGED) | |
2021 | END_UNCHANGED = Z - GPT; | |
b45433b3 | 2022 | |
60ea6052 RS |
2023 | CHECK_MARKERS (); |
2024 | ||
d386034e | 2025 | evaporate_overlays (from); |
7dae4502 SM |
2026 | |
2027 | return deletion; | |
b45433b3 JB |
2028 | } |
2029 | \f | |
3be11131 RS |
2030 | /* Call this if you're about to change the region of BUFFER from |
2031 | character positions START to END. This checks the read-only | |
2032 | properties of the region, calls the necessary modification hooks, | |
2033 | and warns the next redisplay that it should pay attention to that | |
3e145152 CY |
2034 | area. |
2035 | ||
2036 | If PRESERVE_CHARS_MODIFF is non-zero, do not update CHARS_MODIFF. | |
2037 | Otherwise set CHARS_MODIFF to the new value of MODIFF. */ | |
3be11131 | 2038 | |
c660b094 | 2039 | void |
3e145152 | 2040 | modify_region (buffer, start, end, preserve_chars_modiff) |
04a759c8 | 2041 | struct buffer *buffer; |
3e145152 | 2042 | int start, end, preserve_chars_modiff; |
b45433b3 | 2043 | { |
04a759c8 JB |
2044 | struct buffer *old_buffer = current_buffer; |
2045 | ||
2046 | if (buffer != old_buffer) | |
2047 | set_buffer_internal (buffer); | |
2048 | ||
d206af14 | 2049 | prepare_to_modify_buffer (start, end, NULL); |
b45433b3 | 2050 | |
a50df55b | 2051 | BUF_COMPUTE_UNCHANGED (buffer, start - 1, end); |
83010cd6 | 2052 | |
9fbf87cd | 2053 | if (MODIFF <= SAVE_MODIFF) |
83010cd6 | 2054 | record_first_change (); |
b45433b3 | 2055 | MODIFF++; |
3e145152 CY |
2056 | if (! preserve_chars_modiff) |
2057 | CHARS_MODIFF = MODIFF; | |
04a759c8 | 2058 | |
069cdc4f RS |
2059 | buffer->point_before_scroll = Qnil; |
2060 | ||
04a759c8 JB |
2061 | if (buffer != old_buffer) |
2062 | set_buffer_internal (old_buffer); | |
b45433b3 | 2063 | } |
d206af14 | 2064 | \f |
3be11131 RS |
2065 | /* Check that it is okay to modify the buffer between START and END, |
2066 | which are char positions. | |
2067 | ||
679194a6 JA |
2068 | Run the before-change-function, if any. If intervals are in use, |
2069 | verify that the text to be modified is not read-only, and call | |
d206af14 RS |
2070 | any modification properties the text may have. |
2071 | ||
2072 | If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR | |
2073 | by holding its value temporarily in a marker. */ | |
b45433b3 | 2074 | |
c660b094 | 2075 | void |
d206af14 | 2076 | prepare_to_modify_buffer (start, end, preserve_ptr) |
fb4ee5cd | 2077 | int start, end; |
d206af14 | 2078 | int *preserve_ptr; |
b45433b3 | 2079 | { |
234fb773 CY |
2080 | struct buffer *base_buffer; |
2081 | ||
d427b66a | 2082 | if (!NILP (current_buffer->read_only)) |
b45433b3 JB |
2083 | Fbarf_if_buffer_read_only (); |
2084 | ||
2e9f55fd GM |
2085 | /* Let redisplay consider other windows than selected_window |
2086 | if modifying another buffer. */ | |
2087 | if (XBUFFER (XWINDOW (selected_window)->buffer) != current_buffer) | |
2088 | ++windows_or_buffers_changed; | |
2089 | ||
9fbf87cd | 2090 | if (BUF_INTERVALS (current_buffer) != 0) |
d206af14 RS |
2091 | { |
2092 | if (preserve_ptr) | |
2093 | { | |
2094 | Lisp_Object preserve_marker; | |
2095 | struct gcpro gcpro1; | |
2096 | preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil); | |
2097 | GCPRO1 (preserve_marker); | |
2098 | verify_interval_modification (current_buffer, start, end); | |
2099 | *preserve_ptr = marker_position (preserve_marker); | |
dab0b04d | 2100 | unchain_marker (XMARKER (preserve_marker)); |
d206af14 RS |
2101 | UNGCPRO; |
2102 | } | |
2103 | else | |
2104 | verify_interval_modification (current_buffer, start, end); | |
2105 | } | |
b45433b3 | 2106 | |
234fb773 CY |
2107 | /* For indirect buffers, use the base buffer to check clashes. */ |
2108 | if (current_buffer->base_buffer != 0) | |
2109 | base_buffer = current_buffer->base_buffer; | |
2110 | else | |
2111 | base_buffer = current_buffer; | |
2112 | ||
b45433b3 | 2113 | #ifdef CLASH_DETECTION |
234fb773 | 2114 | if (!NILP (base_buffer->file_truename) |
ab6c5c0c | 2115 | /* Make binding buffer-file-name to nil effective. */ |
234fb773 | 2116 | && !NILP (base_buffer->filename) |
9fbf87cd | 2117 | && SAVE_MODIFF >= MODIFF) |
234fb773 | 2118 | lock_file (base_buffer->file_truename); |
b45433b3 JB |
2119 | #else |
2120 | /* At least warn if this file has changed on disk since it was visited. */ | |
234fb773 | 2121 | if (!NILP (base_buffer->filename) |
9fbf87cd | 2122 | && SAVE_MODIFF >= MODIFF |
d427b66a | 2123 | && NILP (Fverify_visited_file_modtime (Fcurrent_buffer ())) |
234fb773 | 2124 | && !NILP (Ffile_exists_p (base_buffer->filename))) |
b45433b3 | 2125 | call1 (intern ("ask-user-about-supersession-threat"), |
234fb773 | 2126 | base_buffer->filename); |
b45433b3 JB |
2127 | #endif /* not CLASH_DETECTION */ |
2128 | ||
d206af14 | 2129 | signal_before_change (start, end, preserve_ptr); |
2f545eea | 2130 | |
56e1065e JB |
2131 | if (current_buffer->newline_cache) |
2132 | invalidate_region_cache (current_buffer, | |
2133 | current_buffer->newline_cache, | |
2134 | start - BEG, Z - end); | |
2135 | if (current_buffer->width_run_cache) | |
2136 | invalidate_region_cache (current_buffer, | |
2137 | current_buffer->width_run_cache, | |
2138 | start - BEG, Z - end); | |
2139 | ||
2f545eea | 2140 | Vdeactivate_mark = Qt; |
b45433b3 JB |
2141 | } |
2142 | \f | |
d206af14 RS |
2143 | /* These macros work with an argument named `preserve_ptr' |
2144 | and a local variable named `preserve_marker'. */ | |
2145 | ||
2146 | #define PRESERVE_VALUE \ | |
2147 | if (preserve_ptr && NILP (preserve_marker)) \ | |
2148 | preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil) | |
2149 | ||
2150 | #define RESTORE_VALUE \ | |
2151 | if (! NILP (preserve_marker)) \ | |
2152 | { \ | |
2153 | *preserve_ptr = marker_position (preserve_marker); \ | |
dab0b04d | 2154 | unchain_marker (XMARKER (preserve_marker)); \ |
d206af14 RS |
2155 | } |
2156 | ||
b86e0aaf RS |
2157 | #define PRESERVE_START_END \ |
2158 | if (NILP (start_marker)) \ | |
2159 | start_marker = Fcopy_marker (start, Qnil); \ | |
2160 | if (NILP (end_marker)) \ | |
2161 | end_marker = Fcopy_marker (end, Qnil); | |
2162 | ||
2163 | #define FETCH_START \ | |
2164 | (! NILP (start_marker) ? Fmarker_position (start_marker) : start) | |
2165 | ||
2166 | #define FETCH_END \ | |
2167 | (! NILP (end_marker) ? Fmarker_position (end_marker) : end) | |
2168 | ||
eb8c3be9 | 2169 | /* Signal a change to the buffer immediately before it happens. |
d206af14 RS |
2170 | START_INT and END_INT are the bounds of the text to be changed. |
2171 | ||
2172 | If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR | |
2173 | by holding its value temporarily in a marker. */ | |
b45433b3 | 2174 | |
c660b094 | 2175 | void |
d206af14 | 2176 | signal_before_change (start_int, end_int, preserve_ptr) |
6022d493 | 2177 | int start_int, end_int; |
d206af14 | 2178 | int *preserve_ptr; |
b45433b3 | 2179 | { |
fb4ee5cd | 2180 | Lisp_Object start, end; |
b86e0aaf | 2181 | Lisp_Object start_marker, end_marker; |
d206af14 | 2182 | Lisp_Object preserve_marker; |
b86e0aaf | 2183 | struct gcpro gcpro1, gcpro2, gcpro3; |
fb4ee5cd | 2184 | |
fd16a4c6 KH |
2185 | if (inhibit_modification_hooks) |
2186 | return; | |
2187 | ||
fb4ee5cd RS |
2188 | start = make_number (start_int); |
2189 | end = make_number (end_int); | |
d206af14 | 2190 | preserve_marker = Qnil; |
b86e0aaf RS |
2191 | start_marker = Qnil; |
2192 | end_marker = Qnil; | |
2193 | GCPRO3 (preserve_marker, start_marker, end_marker); | |
fb4ee5cd | 2194 | |
b45433b3 | 2195 | /* If buffer is unmodified, run a special hook for that case. */ |
9fbf87cd | 2196 | if (SAVE_MODIFF >= MODIFF |
dbc4e1c1 JB |
2197 | && !NILP (Vfirst_change_hook) |
2198 | && !NILP (Vrun_hooks)) | |
d206af14 RS |
2199 | { |
2200 | PRESERVE_VALUE; | |
b86e0aaf | 2201 | PRESERVE_START_END; |
d206af14 RS |
2202 | call1 (Vrun_hooks, Qfirst_change_hook); |
2203 | } | |
dbc4e1c1 | 2204 | |
3d1e2d9c | 2205 | /* Now run the before-change-functions if any. */ |
e45fb8bf RS |
2206 | if (!NILP (Vbefore_change_functions)) |
2207 | { | |
3d1e2d9c RS |
2208 | Lisp_Object args[3]; |
2209 | Lisp_Object before_change_functions; | |
2210 | Lisp_Object after_change_functions; | |
2211 | struct gcpro gcpro1, gcpro2; | |
460e6bae GM |
2212 | struct buffer *old = current_buffer; |
2213 | struct buffer *new; | |
3d1e2d9c | 2214 | |
d206af14 | 2215 | PRESERVE_VALUE; |
b86e0aaf | 2216 | PRESERVE_START_END; |
d206af14 | 2217 | |
3d1e2d9c RS |
2218 | /* "Bind" before-change-functions and after-change-functions |
2219 | to nil--but in a way that errors don't know about. | |
2220 | That way, if there's an error in them, they will stay nil. */ | |
2221 | before_change_functions = Vbefore_change_functions; | |
2222 | after_change_functions = Vafter_change_functions; | |
c82c1da0 KH |
2223 | Vbefore_change_functions = Qnil; |
2224 | Vafter_change_functions = Qnil; | |
3d1e2d9c RS |
2225 | GCPRO2 (before_change_functions, after_change_functions); |
2226 | ||
2227 | /* Actually run the hook functions. */ | |
2228 | args[0] = Qbefore_change_functions; | |
b86e0aaf RS |
2229 | args[1] = FETCH_START; |
2230 | args[2] = FETCH_END; | |
3d1e2d9c RS |
2231 | run_hook_list_with_args (before_change_functions, 3, args); |
2232 | ||
460e6bae GM |
2233 | /* "Unbind" the variables we "bound" to nil. Beware a |
2234 | buffer-local hook which changes the buffer when run (e.g. W3). */ | |
2235 | if (old != current_buffer) | |
2236 | { | |
2237 | new = current_buffer; | |
2238 | set_buffer_internal (old); | |
2239 | Vbefore_change_functions = before_change_functions; | |
2240 | Vafter_change_functions = after_change_functions; | |
2241 | set_buffer_internal (new); | |
2242 | } | |
2243 | else | |
2244 | { | |
2245 | Vbefore_change_functions = before_change_functions; | |
2246 | Vafter_change_functions = after_change_functions; | |
2247 | } | |
3d1e2d9c | 2248 | UNGCPRO; |
e45fb8bf | 2249 | } |
d07c0804 | 2250 | |
fbebdf81 | 2251 | if (current_buffer->overlays_before || current_buffer->overlays_after) |
d206af14 RS |
2252 | { |
2253 | PRESERVE_VALUE; | |
b86e0aaf RS |
2254 | report_overlay_modification (FETCH_START, FETCH_END, 0, |
2255 | FETCH_START, FETCH_END, Qnil); | |
d206af14 RS |
2256 | } |
2257 | ||
b86e0aaf RS |
2258 | if (! NILP (start_marker)) |
2259 | free_marker (start_marker); | |
2260 | if (! NILP (end_marker)) | |
2261 | free_marker (end_marker); | |
d206af14 RS |
2262 | RESTORE_VALUE; |
2263 | UNGCPRO; | |
b45433b3 JB |
2264 | } |
2265 | ||
eb8c3be9 | 2266 | /* Signal a change immediately after it happens. |
3be11131 | 2267 | CHARPOS is the character position of the start of the changed text. |
b45433b3 JB |
2268 | LENDEL is the number of characters of the text before the change. |
2269 | (Not the whole buffer; just the part that was changed.) | |
8b09e5d0 RS |
2270 | LENINS is the number of characters in that part of the text |
2271 | after the change. */ | |
b45433b3 | 2272 | |
c660b094 | 2273 | void |
3be11131 RS |
2274 | signal_after_change (charpos, lendel, lenins) |
2275 | int charpos, lendel, lenins; | |
b45433b3 | 2276 | { |
fd16a4c6 KH |
2277 | if (inhibit_modification_hooks) |
2278 | return; | |
2279 | ||
fb2e7d14 RS |
2280 | /* If we are deferring calls to the after-change functions |
2281 | and there are no before-change functions, | |
2282 | just record the args that we were going to use. */ | |
2283 | if (! NILP (Vcombine_after_change_calls) | |
1675d086 | 2284 | && NILP (Vbefore_change_functions) |
fbebdf81 SM |
2285 | && !current_buffer->overlays_before |
2286 | && !current_buffer->overlays_after) | |
fb2e7d14 RS |
2287 | { |
2288 | Lisp_Object elt; | |
2289 | ||
2290 | if (!NILP (combine_after_change_list) | |
2291 | && current_buffer != XBUFFER (combine_after_change_buffer)) | |
2292 | Fcombine_after_change_execute (); | |
2293 | ||
3be11131 RS |
2294 | elt = Fcons (make_number (charpos - BEG), |
2295 | Fcons (make_number (Z - (charpos - lendel + lenins)), | |
fb2e7d14 RS |
2296 | Fcons (make_number (lenins - lendel), Qnil))); |
2297 | combine_after_change_list | |
2298 | = Fcons (elt, combine_after_change_list); | |
2299 | combine_after_change_buffer = Fcurrent_buffer (); | |
2300 | ||
2301 | return; | |
2302 | } | |
2303 | ||
177c0ea7 | 2304 | if (!NILP (combine_after_change_list)) |
fb2e7d14 RS |
2305 | Fcombine_after_change_execute (); |
2306 | ||
e45fb8bf RS |
2307 | if (!NILP (Vafter_change_functions)) |
2308 | { | |
3d1e2d9c RS |
2309 | Lisp_Object args[4]; |
2310 | Lisp_Object before_change_functions; | |
2311 | Lisp_Object after_change_functions; | |
460e6bae GM |
2312 | struct buffer *old = current_buffer; |
2313 | struct buffer *new; | |
3d1e2d9c RS |
2314 | struct gcpro gcpro1, gcpro2; |
2315 | ||
2316 | /* "Bind" before-change-functions and after-change-functions | |
2317 | to nil--but in a way that errors don't know about. | |
2318 | That way, if there's an error in them, they will stay nil. */ | |
2319 | before_change_functions = Vbefore_change_functions; | |
2320 | after_change_functions = Vafter_change_functions; | |
c82c1da0 KH |
2321 | Vbefore_change_functions = Qnil; |
2322 | Vafter_change_functions = Qnil; | |
3d1e2d9c RS |
2323 | GCPRO2 (before_change_functions, after_change_functions); |
2324 | ||
2325 | /* Actually run the hook functions. */ | |
2326 | args[0] = Qafter_change_functions; | |
3be11131 RS |
2327 | XSETFASTINT (args[1], charpos); |
2328 | XSETFASTINT (args[2], charpos + lenins); | |
3d1e2d9c RS |
2329 | XSETFASTINT (args[3], lendel); |
2330 | run_hook_list_with_args (after_change_functions, | |
2331 | 4, args); | |
2332 | ||
460e6bae GM |
2333 | /* "Unbind" the variables we "bound" to nil. Beware a |
2334 | buffer-local hook which changes the buffer when run (e.g. W3). */ | |
2335 | if (old != current_buffer) | |
2336 | { | |
2337 | new = current_buffer; | |
2338 | set_buffer_internal (old); | |
2339 | Vbefore_change_functions = before_change_functions; | |
2340 | Vafter_change_functions = after_change_functions; | |
2341 | set_buffer_internal (new); | |
2342 | } | |
2343 | else | |
2344 | { | |
2345 | Vbefore_change_functions = before_change_functions; | |
2346 | Vafter_change_functions = after_change_functions; | |
2347 | } | |
3d1e2d9c | 2348 | UNGCPRO; |
e45fb8bf | 2349 | } |
d07c0804 | 2350 | |
fbebdf81 | 2351 | if (current_buffer->overlays_before || current_buffer->overlays_after) |
3be11131 RS |
2352 | report_overlay_modification (make_number (charpos), |
2353 | make_number (charpos + lenins), | |
d07c0804 | 2354 | 1, |
3be11131 RS |
2355 | make_number (charpos), |
2356 | make_number (charpos + lenins), | |
d07c0804 | 2357 | make_number (lendel)); |
c5ca0786 RS |
2358 | |
2359 | /* After an insertion, call the text properties | |
2360 | insert-behind-hooks or insert-in-front-hooks. */ | |
2361 | if (lendel == 0) | |
d6b81c0f AS |
2362 | report_interval_modification (make_number (charpos), |
2363 | make_number (charpos + lenins)); | |
b45433b3 | 2364 | } |
fb2e7d14 RS |
2365 | |
2366 | Lisp_Object | |
2367 | Fcombine_after_change_execute_1 (val) | |
2368 | Lisp_Object val; | |
2369 | { | |
2370 | Vcombine_after_change_calls = val; | |
2371 | return val; | |
2372 | } | |
2373 | ||
2374 | DEFUN ("combine-after-change-execute", Fcombine_after_change_execute, | |
335c5470 PJ |
2375 | Scombine_after_change_execute, 0, 0, 0, |
2376 | doc: /* This function is for use internally in `combine-after-change-calls'. */) | |
2377 | () | |
fb2e7d14 | 2378 | { |
aed13378 | 2379 | int count = SPECPDL_INDEX (); |
fb2e7d14 RS |
2380 | int beg, end, change; |
2381 | int begpos, endpos; | |
2382 | Lisp_Object tail; | |
2383 | ||
101e446f KH |
2384 | if (NILP (combine_after_change_list)) |
2385 | return Qnil; | |
2386 | ||
fb2e7d14 RS |
2387 | record_unwind_protect (Fset_buffer, Fcurrent_buffer ()); |
2388 | ||
2389 | Fset_buffer (combine_after_change_buffer); | |
2390 | ||
2391 | /* # chars unchanged at beginning of buffer. */ | |
2392 | beg = Z - BEG; | |
2393 | /* # chars unchanged at end of buffer. */ | |
2394 | end = beg; | |
2395 | /* Total amount of insertion (negative for deletion). */ | |
2396 | change = 0; | |
2397 | ||
2398 | /* Scan the various individual changes, | |
2399 | accumulating the range info in BEG, END and CHANGE. */ | |
2400 | for (tail = combine_after_change_list; CONSP (tail); | |
03699b14 | 2401 | tail = XCDR (tail)) |
fb2e7d14 | 2402 | { |
e688a080 KH |
2403 | Lisp_Object elt; |
2404 | int thisbeg, thisend, thischange; | |
fb2e7d14 RS |
2405 | |
2406 | /* Extract the info from the next element. */ | |
03699b14 | 2407 | elt = XCAR (tail); |
fb2e7d14 RS |
2408 | if (! CONSP (elt)) |
2409 | continue; | |
03699b14 | 2410 | thisbeg = XINT (XCAR (elt)); |
fb2e7d14 | 2411 | |
03699b14 | 2412 | elt = XCDR (elt); |
fb2e7d14 RS |
2413 | if (! CONSP (elt)) |
2414 | continue; | |
03699b14 | 2415 | thisend = XINT (XCAR (elt)); |
fb2e7d14 | 2416 | |
03699b14 | 2417 | elt = XCDR (elt); |
fb2e7d14 RS |
2418 | if (! CONSP (elt)) |
2419 | continue; | |
03699b14 | 2420 | thischange = XINT (XCAR (elt)); |
fb2e7d14 RS |
2421 | |
2422 | /* Merge this range into the accumulated range. */ | |
2423 | change += thischange; | |
2424 | if (thisbeg < beg) | |
2425 | beg = thisbeg; | |
2426 | if (thisend < end) | |
2427 | end = thisend; | |
2428 | } | |
2429 | ||
2430 | /* Get the current start and end positions of the range | |
2431 | that was changed. */ | |
2432 | begpos = BEG + beg; | |
2433 | endpos = Z - end; | |
177c0ea7 | 2434 | |
fb2e7d14 RS |
2435 | /* We are about to handle these, so discard them. */ |
2436 | combine_after_change_list = Qnil; | |
2437 | ||
2438 | /* Now run the after-change functions for real. | |
2439 | Turn off the flag that defers them. */ | |
2440 | record_unwind_protect (Fcombine_after_change_execute_1, | |
2441 | Vcombine_after_change_calls); | |
2442 | signal_after_change (begpos, endpos - begpos - change, endpos - begpos); | |
0ef71121 | 2443 | update_compositions (begpos, endpos, CHECK_ALL); |
fb2e7d14 | 2444 | |
101e446f | 2445 | return unbind_to (count, Qnil); |
fb2e7d14 RS |
2446 | } |
2447 | \f | |
dfcf069d | 2448 | void |
fb2e7d14 RS |
2449 | syms_of_insdel () |
2450 | { | |
2451 | staticpro (&combine_after_change_list); | |
bf0bf758 | 2452 | staticpro (&combine_after_change_buffer); |
fb2e7d14 | 2453 | combine_after_change_list = Qnil; |
101e446f | 2454 | combine_after_change_buffer = Qnil; |
fb2e7d14 | 2455 | |
60ea6052 | 2456 | DEFVAR_BOOL ("check-markers-debug-flag", &check_markers_debug_flag, |
335c5470 | 2457 | doc: /* Non-nil means enable debugging checks for invalid marker positions. */); |
60ea6052 | 2458 | check_markers_debug_flag = 0; |
fb2e7d14 | 2459 | DEFVAR_LISP ("combine-after-change-calls", &Vcombine_after_change_calls, |
335c5470 | 2460 | doc: /* Used internally by the `combine-after-change-calls' macro. */); |
fb2e7d14 RS |
2461 | Vcombine_after_change_calls = Qnil; |
2462 | ||
7baf49cf | 2463 | DEFVAR_BOOL ("inhibit-modification-hooks", &inhibit_modification_hooks, |
335c5470 PJ |
2464 | doc: /* Non-nil means don't run any of the hooks that respond to buffer changes. |
2465 | This affects `before-change-functions' and `after-change-functions', | |
2466 | as well as hooks attached to text properties and overlays. */); | |
7baf49cf | 2467 | inhibit_modification_hooks = 0; |
27ea0af2 GM |
2468 | Qinhibit_modification_hooks = intern ("inhibit-modification-hooks"); |
2469 | staticpro (&Qinhibit_modification_hooks); | |
7baf49cf | 2470 | |
fb2e7d14 RS |
2471 | defsubr (&Scombine_after_change_execute); |
2472 | } | |
6b61353c KH |
2473 | |
2474 | /* arch-tag: 9b34b886-47d7-465e-a234-299af411b23d | |
2475 | (do not change this comment) */ |