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