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