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