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