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