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