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