Commit | Line | Data |
---|---|---|
c6953be1 | 1 | /* undo handling for GNU Emacs. |
429ab54e | 2 | Copyright (C) 1990, 1993, 1994, 2000, 2001, 2002, 2003, 2004, |
8cabe764 | 3 | 2005, 2006, 2007, 2008 Free Software Foundation, Inc. |
c6953be1 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 |
3b7ad313 | 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. | |
3b7ad313 | 11 | |
c6953be1 | 12 | GNU Emacs is distributed in the hope that it will be useful, |
3b7ad313 EN |
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/>. */ |
c6953be1 JB |
19 | |
20 | ||
18160b98 | 21 | #include <config.h> |
c6953be1 JB |
22 | #include "lisp.h" |
23 | #include "buffer.h" | |
4e665715 | 24 | #include "commands.h" |
91e25f5e | 25 | #include "window.h" |
c6953be1 | 26 | |
137e23ea RS |
27 | /* Limits controlling how much undo information to keep. */ |
28 | ||
29 | EMACS_INT undo_limit; | |
30 | EMACS_INT undo_strong_limit; | |
81c1cf71 RS |
31 | |
32 | Lisp_Object Vundo_outer_limit; | |
137e23ea RS |
33 | |
34 | /* Function to call when undo_outer_limit is exceeded. */ | |
35 | ||
36 | Lisp_Object Vundo_outer_limit_function; | |
37 | ||
c6953be1 | 38 | /* Last buffer for which undo information was recorded. */ |
4591d6cb SM |
39 | /* BEWARE: This is not traced by the GC, so never dereference it! */ |
40 | struct buffer *last_undo_buffer; | |
41 | ||
42 | /* Position of point last time we inserted a boundary. */ | |
43 | struct buffer *last_boundary_buffer; | |
44 | EMACS_INT last_boundary_position; | |
c6953be1 | 45 | |
f87a68b3 RS |
46 | Lisp_Object Qinhibit_read_only; |
47 | ||
49be18c9 KS |
48 | /* Marker for function call undo list elements. */ |
49 | ||
50 | Lisp_Object Qapply; | |
51 | ||
c58632fc RS |
52 | /* The first time a command records something for undo. |
53 | it also allocates the undo-boundary object | |
54 | which will be added to the list at the end of the command. | |
55 | This ensures we can't run out of space while trying to make | |
56 | an undo-boundary. */ | |
57 | Lisp_Object pending_boundary; | |
58 | ||
8abe0f97 MR |
59 | /* Nonzero means do not record point in record_point. */ |
60 | ||
61 | int undo_inhibit_record_point; | |
62 | ||
6396140a | 63 | /* Record point as it was at beginning of this command (if necessary) |
8abe0f97 | 64 | and prepare the undo info for recording a change. |
6396140a SM |
65 | PT is the position of point that will naturally occur as a result of the |
66 | undo record that will be added just after this command terminates. */ | |
c6953be1 | 67 | |
6396140a SM |
68 | static void |
69 | record_point (pt) | |
f45bedd4 | 70 | int pt; |
c6953be1 | 71 | { |
6396140a | 72 | int at_boundary; |
bdbe6f28 | 73 | |
4591d6cb | 74 | /* Don't record position of pt when undo_inhibit_record_point holds. */ |
8abe0f97 MR |
75 | if (undo_inhibit_record_point) |
76 | return; | |
77 | ||
c58632fc RS |
78 | /* Allocate a cons cell to be the undo boundary after this command. */ |
79 | if (NILP (pending_boundary)) | |
80 | pending_boundary = Fcons (Qnil, Qnil); | |
81 | ||
4591d6cb | 82 | if (current_buffer != last_undo_buffer) |
c6953be1 | 83 | Fundo_boundary (); |
4591d6cb | 84 | last_undo_buffer = current_buffer; |
c6953be1 | 85 | |
6396140a SM |
86 | if (CONSP (current_buffer->undo_list)) |
87 | { | |
88 | /* Set AT_BOUNDARY to 1 only when we have nothing other than | |
89 | marker adjustment before undo boundary. */ | |
90 | ||
91 | Lisp_Object tail = current_buffer->undo_list, elt; | |
92 | ||
93 | while (1) | |
94 | { | |
95 | if (NILP (tail)) | |
96 | elt = Qnil; | |
97 | else | |
98 | elt = XCAR (tail); | |
99 | if (NILP (elt) || ! (CONSP (elt) && MARKERP (XCAR (elt)))) | |
100 | break; | |
101 | tail = XCDR (tail); | |
102 | } | |
103 | at_boundary = NILP (elt); | |
104 | } | |
105 | else | |
106 | at_boundary = 1; | |
107 | ||
ad9cdce4 | 108 | if (MODIFF <= SAVE_MODIFF) |
c6953be1 JB |
109 | record_first_change (); |
110 | ||
177c0ea7 | 111 | /* If we are just after an undo boundary, and |
6396140a SM |
112 | point wasn't at start of deleted range, record where it was. */ |
113 | if (at_boundary | |
4591d6cb SM |
114 | && current_buffer == last_boundary_buffer |
115 | && last_boundary_position != pt) | |
116 | current_buffer->undo_list | |
117 | = Fcons (make_number (last_boundary_position), current_buffer->undo_list); | |
6396140a SM |
118 | } |
119 | ||
120 | /* Record an insertion that just happened or is about to happen, | |
121 | for LENGTH characters at position BEG. | |
122 | (It is possible to record an insertion before or after the fact | |
123 | because we don't need to record the contents.) */ | |
124 | ||
125 | void | |
126 | record_insert (beg, length) | |
127 | int beg, length; | |
128 | { | |
129 | Lisp_Object lbeg, lend; | |
130 | ||
131 | if (EQ (current_buffer->undo_list, Qt)) | |
132 | return; | |
133 | ||
134 | record_point (beg); | |
135 | ||
c6953be1 JB |
136 | /* If this is following another insertion and consecutive with it |
137 | in the buffer, combine the two. */ | |
38c0d37c | 138 | if (CONSP (current_buffer->undo_list)) |
c6953be1 JB |
139 | { |
140 | Lisp_Object elt; | |
c1d497be | 141 | elt = XCAR (current_buffer->undo_list); |
38c0d37c | 142 | if (CONSP (elt) |
c1d497be KR |
143 | && INTEGERP (XCAR (elt)) |
144 | && INTEGERP (XCDR (elt)) | |
145 | && XINT (XCDR (elt)) == beg) | |
c6953be1 | 146 | { |
f3fbd155 | 147 | XSETCDR (elt, make_number (beg + length)); |
c6953be1 JB |
148 | return; |
149 | } | |
150 | } | |
151 | ||
53480e99 KH |
152 | XSETFASTINT (lbeg, beg); |
153 | XSETINT (lend, beg + length); | |
213861c7 JB |
154 | current_buffer->undo_list = Fcons (Fcons (lbeg, lend), |
155 | current_buffer->undo_list); | |
c6953be1 JB |
156 | } |
157 | ||
158 | /* Record that a deletion is about to take place, | |
e928d437 | 159 | of the characters in STRING, at location BEG. */ |
c6953be1 | 160 | |
ff1aa840 | 161 | void |
e928d437 RS |
162 | record_delete (beg, string) |
163 | int beg; | |
164 | Lisp_Object string; | |
c6953be1 | 165 | { |
e928d437 | 166 | Lisp_Object sbeg; |
c6953be1 | 167 | |
bdbe6f28 RS |
168 | if (EQ (current_buffer->undo_list, Qt)) |
169 | return; | |
170 | ||
d5db4077 | 171 | if (PT == beg + SCHARS (string)) |
cbc1b668 | 172 | { |
6396140a SM |
173 | XSETINT (sbeg, -beg); |
174 | record_point (PT); | |
cbc1b668 KH |
175 | } |
176 | else | |
6396140a SM |
177 | { |
178 | XSETFASTINT (sbeg, beg); | |
179 | record_point (beg); | |
180 | } | |
350bce56 | 181 | |
c6953be1 | 182 | current_buffer->undo_list |
e928d437 | 183 | = Fcons (Fcons (string, sbeg), current_buffer->undo_list); |
c6953be1 JB |
184 | } |
185 | ||
714bced9 RS |
186 | /* Record the fact that MARKER is about to be adjusted by ADJUSTMENT. |
187 | This is done only when a marker points within text being deleted, | |
188 | because that's the only case where an automatic marker adjustment | |
189 | won't be inverted automatically by undoing the buffer modification. */ | |
190 | ||
ff1aa840 | 191 | void |
714bced9 RS |
192 | record_marker_adjustment (marker, adjustment) |
193 | Lisp_Object marker; | |
194 | int adjustment; | |
195 | { | |
196 | if (EQ (current_buffer->undo_list, Qt)) | |
197 | return; | |
198 | ||
199 | /* Allocate a cons cell to be the undo boundary after this command. */ | |
200 | if (NILP (pending_boundary)) | |
201 | pending_boundary = Fcons (Qnil, Qnil); | |
202 | ||
4591d6cb | 203 | if (current_buffer != last_undo_buffer) |
714bced9 | 204 | Fundo_boundary (); |
4591d6cb | 205 | last_undo_buffer = current_buffer; |
714bced9 RS |
206 | |
207 | current_buffer->undo_list | |
208 | = Fcons (Fcons (marker, make_number (adjustment)), | |
209 | current_buffer->undo_list); | |
210 | } | |
211 | ||
c6953be1 JB |
212 | /* Record that a replacement is about to take place, |
213 | for LENGTH characters at location BEG. | |
e928d437 | 214 | The replacement must not change the number of characters. */ |
c6953be1 | 215 | |
ff1aa840 | 216 | void |
c6953be1 JB |
217 | record_change (beg, length) |
218 | int beg, length; | |
219 | { | |
e928d437 | 220 | record_delete (beg, make_buffer_string (beg, beg + length, 1)); |
c6953be1 JB |
221 | record_insert (beg, length); |
222 | } | |
223 | \f | |
224 | /* Record that an unmodified buffer is about to be changed. | |
225 | Record the file modification date so that when undoing this entry | |
226 | we can tell whether it is obsolete because the file was saved again. */ | |
227 | ||
90dd3e4f | 228 | void |
c6953be1 JB |
229 | record_first_change () |
230 | { | |
231 | Lisp_Object high, low; | |
ad9cdce4 | 232 | struct buffer *base_buffer = current_buffer; |
0736cafe RS |
233 | |
234 | if (EQ (current_buffer->undo_list, Qt)) | |
235 | return; | |
236 | ||
4591d6cb | 237 | if (current_buffer != last_undo_buffer) |
0736cafe | 238 | Fundo_boundary (); |
4591d6cb | 239 | last_undo_buffer = current_buffer; |
0736cafe | 240 | |
ad9cdce4 RS |
241 | if (base_buffer->base_buffer) |
242 | base_buffer = base_buffer->base_buffer; | |
243 | ||
244 | XSETFASTINT (high, (base_buffer->modtime >> 16) & 0xffff); | |
245 | XSETFASTINT (low, base_buffer->modtime & 0xffff); | |
c6953be1 JB |
246 | current_buffer->undo_list = Fcons (Fcons (Qt, Fcons (high, low)), current_buffer->undo_list); |
247 | } | |
248 | ||
da9319d5 RS |
249 | /* Record a change in property PROP (whose old value was VAL) |
250 | for LENGTH characters starting at position BEG in BUFFER. */ | |
251 | ||
90dd3e4f | 252 | void |
da9319d5 RS |
253 | record_property_change (beg, length, prop, value, buffer) |
254 | int beg, length; | |
255 | Lisp_Object prop, value, buffer; | |
256 | { | |
257 | Lisp_Object lbeg, lend, entry; | |
4591d6cb | 258 | struct buffer *obuf = current_buffer, *buf = XBUFFER (buffer); |
da9319d5 RS |
259 | int boundary = 0; |
260 | ||
4591d6cb | 261 | if (EQ (buf->undo_list, Qt)) |
bdbe6f28 RS |
262 | return; |
263 | ||
c58632fc RS |
264 | /* Allocate a cons cell to be the undo boundary after this command. */ |
265 | if (NILP (pending_boundary)) | |
266 | pending_boundary = Fcons (Qnil, Qnil); | |
267 | ||
4591d6cb | 268 | if (buf != last_undo_buffer) |
da9319d5 | 269 | boundary = 1; |
4591d6cb | 270 | last_undo_buffer = buf; |
da9319d5 | 271 | |
da9319d5 | 272 | /* Switch temporarily to the buffer that was changed. */ |
4591d6cb | 273 | current_buffer = buf; |
da9319d5 RS |
274 | |
275 | if (boundary) | |
276 | Fundo_boundary (); | |
277 | ||
ad9cdce4 | 278 | if (MODIFF <= SAVE_MODIFF) |
da9319d5 RS |
279 | record_first_change (); |
280 | ||
552bdbcf KH |
281 | XSETINT (lbeg, beg); |
282 | XSETINT (lend, beg + length); | |
da9319d5 RS |
283 | entry = Fcons (Qnil, Fcons (prop, Fcons (value, Fcons (lbeg, lend)))); |
284 | current_buffer->undo_list = Fcons (entry, current_buffer->undo_list); | |
285 | ||
286 | current_buffer = obuf; | |
287 | } | |
288 | ||
c6953be1 | 289 | DEFUN ("undo-boundary", Fundo_boundary, Sundo_boundary, 0, 0, 0, |
8c1a1077 PJ |
290 | doc: /* Mark a boundary between units of undo. |
291 | An undo command will stop at this point, | |
292 | but another undo command will undo to the previous boundary. */) | |
293 | () | |
c6953be1 JB |
294 | { |
295 | Lisp_Object tem; | |
296 | if (EQ (current_buffer->undo_list, Qt)) | |
297 | return Qnil; | |
298 | tem = Fcar (current_buffer->undo_list); | |
265a9e55 | 299 | if (!NILP (tem)) |
c58632fc RS |
300 | { |
301 | /* One way or another, cons nil onto the front of the undo list. */ | |
302 | if (!NILP (pending_boundary)) | |
303 | { | |
304 | /* If we have preallocated the cons cell to use here, | |
305 | use that one. */ | |
f3fbd155 | 306 | XSETCDR (pending_boundary, current_buffer->undo_list); |
c58632fc RS |
307 | current_buffer->undo_list = pending_boundary; |
308 | pending_boundary = Qnil; | |
309 | } | |
310 | else | |
311 | current_buffer->undo_list = Fcons (Qnil, current_buffer->undo_list); | |
312 | } | |
4591d6cb SM |
313 | last_boundary_position = PT; |
314 | last_boundary_buffer = current_buffer; | |
c6953be1 JB |
315 | return Qnil; |
316 | } | |
317 | ||
318 | /* At garbage collection time, make an undo list shorter at the end, | |
137e23ea RS |
319 | returning the truncated list. How this is done depends on the |
320 | variables undo-limit, undo-strong-limit and undo-outer-limit. | |
321 | In some cases this works by calling undo-outer-limit-function. */ | |
322 | ||
323 | void | |
324 | truncate_undo_list (b) | |
325 | struct buffer *b; | |
c6953be1 | 326 | { |
137e23ea | 327 | Lisp_Object list; |
c6953be1 JB |
328 | Lisp_Object prev, next, last_boundary; |
329 | int size_so_far = 0; | |
330 | ||
137e23ea RS |
331 | /* Make sure that calling undo-outer-limit-function |
332 | won't cause another GC. */ | |
333 | int count = inhibit_garbage_collection (); | |
334 | ||
335 | /* Make the buffer current to get its local values of variables such | |
336 | as undo_limit. Also so that Vundo_outer_limit_function can | |
337 | tell which buffer to operate on. */ | |
338 | record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ()); | |
339 | set_buffer_internal (b); | |
340 | ||
341 | list = b->undo_list; | |
342 | ||
c6953be1 JB |
343 | prev = Qnil; |
344 | next = list; | |
345 | last_boundary = Qnil; | |
346 | ||
137e23ea | 347 | /* If the first element is an undo boundary, skip past it. */ |
c1d497be | 348 | if (CONSP (next) && NILP (XCAR (next))) |
c6953be1 JB |
349 | { |
350 | /* Add in the space occupied by this element and its chain link. */ | |
351 | size_so_far += sizeof (struct Lisp_Cons); | |
352 | ||
353 | /* Advance to next element. */ | |
354 | prev = next; | |
c1d497be | 355 | next = XCDR (next); |
c6953be1 | 356 | } |
e3d5ca1e | 357 | |
137e23ea RS |
358 | /* Always preserve at least the most recent undo record |
359 | unless it is really horribly big. | |
360 | ||
361 | Skip, skip, skip the undo, skip, skip, skip the undo, | |
362 | Skip, skip, skip the undo, skip to the undo bound'ry. */ | |
363 | ||
c1d497be | 364 | while (CONSP (next) && ! NILP (XCAR (next))) |
c6953be1 JB |
365 | { |
366 | Lisp_Object elt; | |
c1d497be | 367 | elt = XCAR (next); |
c6953be1 JB |
368 | |
369 | /* Add in the space occupied by this element and its chain link. */ | |
370 | size_so_far += sizeof (struct Lisp_Cons); | |
38c0d37c | 371 | if (CONSP (elt)) |
c6953be1 JB |
372 | { |
373 | size_so_far += sizeof (struct Lisp_Cons); | |
c1d497be | 374 | if (STRINGP (XCAR (elt))) |
c6953be1 | 375 | size_so_far += (sizeof (struct Lisp_String) - 1 |
d5db4077 | 376 | + SCHARS (XCAR (elt))); |
c6953be1 JB |
377 | } |
378 | ||
379 | /* Advance to next element. */ | |
380 | prev = next; | |
c1d497be | 381 | next = XCDR (next); |
c6953be1 | 382 | } |
e3d5ca1e | 383 | |
137e23ea RS |
384 | /* If by the first boundary we have already passed undo_outer_limit, |
385 | we're heading for memory full, so offer to clear out the list. */ | |
81c1cf71 RS |
386 | if (INTEGERP (Vundo_outer_limit) |
387 | && size_so_far > XINT (Vundo_outer_limit) | |
137e23ea RS |
388 | && !NILP (Vundo_outer_limit_function)) |
389 | { | |
4591d6cb SM |
390 | Lisp_Object tem; |
391 | struct buffer *temp = last_undo_buffer; | |
137e23ea RS |
392 | |
393 | /* Normally the function this calls is undo-outer-limit-truncate. */ | |
88fde92a KR |
394 | tem = call1 (Vundo_outer_limit_function, make_number (size_so_far)); |
395 | if (! NILP (tem)) | |
137e23ea RS |
396 | { |
397 | /* The function is responsible for making | |
398 | any desired changes in buffer-undo-list. */ | |
399 | unbind_to (count, Qnil); | |
400 | return; | |
401 | } | |
402 | /* That function probably used the minibuffer, and if so, that | |
403 | changed last_undo_buffer. Change it back so that we don't | |
404 | force next change to make an undo boundary here. */ | |
405 | last_undo_buffer = temp; | |
406 | } | |
407 | ||
38c0d37c | 408 | if (CONSP (next)) |
c6953be1 JB |
409 | last_boundary = prev; |
410 | ||
137e23ea | 411 | /* Keep additional undo data, if it fits in the limits. */ |
38c0d37c | 412 | while (CONSP (next)) |
c6953be1 JB |
413 | { |
414 | Lisp_Object elt; | |
c1d497be | 415 | elt = XCAR (next); |
c6953be1 JB |
416 | |
417 | /* When we get to a boundary, decide whether to truncate | |
137e23ea | 418 | either before or after it. The lower threshold, undo_limit, |
c6953be1 | 419 | tells us to truncate after it. If its size pushes past |
137e23ea | 420 | the higher threshold undo_strong_limit, we truncate before it. */ |
265a9e55 | 421 | if (NILP (elt)) |
c6953be1 | 422 | { |
137e23ea | 423 | if (size_so_far > undo_strong_limit) |
c6953be1 JB |
424 | break; |
425 | last_boundary = prev; | |
137e23ea | 426 | if (size_so_far > undo_limit) |
c6953be1 JB |
427 | break; |
428 | } | |
429 | ||
430 | /* Add in the space occupied by this element and its chain link. */ | |
431 | size_so_far += sizeof (struct Lisp_Cons); | |
38c0d37c | 432 | if (CONSP (elt)) |
c6953be1 JB |
433 | { |
434 | size_so_far += sizeof (struct Lisp_Cons); | |
c1d497be | 435 | if (STRINGP (XCAR (elt))) |
c6953be1 | 436 | size_so_far += (sizeof (struct Lisp_String) - 1 |
d5db4077 | 437 | + SCHARS (XCAR (elt))); |
c6953be1 JB |
438 | } |
439 | ||
440 | /* Advance to next element. */ | |
441 | prev = next; | |
c1d497be | 442 | next = XCDR (next); |
c6953be1 JB |
443 | } |
444 | ||
445 | /* If we scanned the whole list, it is short enough; don't change it. */ | |
265a9e55 | 446 | if (NILP (next)) |
137e23ea | 447 | ; |
c6953be1 | 448 | /* Truncate at the boundary where we decided to truncate. */ |
137e23ea RS |
449 | else if (!NILP (last_boundary)) |
450 | XSETCDR (last_boundary, Qnil); | |
451 | /* There's nothing we decided to keep, so clear it out. */ | |
c6953be1 | 452 | else |
137e23ea RS |
453 | b->undo_list = Qnil; |
454 | ||
455 | unbind_to (count, Qnil); | |
c6953be1 JB |
456 | } |
457 | \f | |
458 | DEFUN ("primitive-undo", Fprimitive_undo, Sprimitive_undo, 2, 2, 0, | |
8c1a1077 PJ |
459 | doc: /* Undo N records from the front of the list LIST. |
460 | Return what remains of the list. */) | |
461 | (n, list) | |
063fb61f | 462 | Lisp_Object n, list; |
c6953be1 | 463 | { |
de65837b KH |
464 | struct gcpro gcpro1, gcpro2; |
465 | Lisp_Object next; | |
331379bf | 466 | int count = SPECPDL_INDEX (); |
de65837b | 467 | register int arg; |
4ac03187 KS |
468 | Lisp_Object oldlist; |
469 | int did_apply = 0; | |
177c0ea7 | 470 | |
c6953be1 JB |
471 | #if 0 /* This is a good feature, but would make undo-start |
472 | unable to do what is expected. */ | |
473 | Lisp_Object tem; | |
474 | ||
475 | /* If the head of the list is a boundary, it is the boundary | |
476 | preceding this command. Get rid of it and don't count it. */ | |
477 | tem = Fcar (list); | |
265a9e55 | 478 | if (NILP (tem)) |
c6953be1 JB |
479 | list = Fcdr (list); |
480 | #endif | |
481 | ||
b7826503 | 482 | CHECK_NUMBER (n); |
de65837b KH |
483 | arg = XINT (n); |
484 | next = Qnil; | |
485 | GCPRO2 (next, list); | |
4ac03187 KS |
486 | /* I don't think we need to gcpro oldlist, as we use it only |
487 | to check for EQ. ++kfs */ | |
de65837b | 488 | |
38d56be3 GM |
489 | /* In a writable buffer, enable undoing read-only text that is so |
490 | because of text properties. */ | |
491 | if (NILP (current_buffer->read_only)) | |
f87a68b3 RS |
492 | specbind (Qinhibit_read_only, Qt); |
493 | ||
8c757fd7 GM |
494 | /* Don't let `intangible' properties interfere with undo. */ |
495 | specbind (Qinhibit_point_motion_hooks, Qt); | |
496 | ||
4ac03187 KS |
497 | oldlist = current_buffer->undo_list; |
498 | ||
c6953be1 JB |
499 | while (arg > 0) |
500 | { | |
c3b09bbf | 501 | while (CONSP (list)) |
c6953be1 | 502 | { |
c3b09bbf SM |
503 | next = XCAR (list); |
504 | list = XCDR (list); | |
350bce56 | 505 | /* Exit inner loop at undo boundary. */ |
265a9e55 | 506 | if (NILP (next)) |
c6953be1 | 507 | break; |
350bce56 | 508 | /* Handle an integer by setting point to that value. */ |
38c0d37c | 509 | if (INTEGERP (next)) |
350bce56 | 510 | SET_PT (clip_to_bounds (BEGV, XINT (next), ZV)); |
38c0d37c | 511 | else if (CONSP (next)) |
c6953be1 | 512 | { |
350bce56 RS |
513 | Lisp_Object car, cdr; |
514 | ||
c3b09bbf SM |
515 | car = XCAR (next); |
516 | cdr = XCDR (next); | |
350bce56 | 517 | if (EQ (car, Qt)) |
c6953be1 | 518 | { |
350bce56 RS |
519 | /* Element (t high . low) records previous modtime. */ |
520 | Lisp_Object high, low; | |
521 | int mod_time; | |
ad9cdce4 | 522 | struct buffer *base_buffer = current_buffer; |
350bce56 RS |
523 | |
524 | high = Fcar (cdr); | |
525 | low = Fcdr (cdr); | |
d8552b2f | 526 | mod_time = (XFASTINT (high) << 16) + XFASTINT (low); |
ad9cdce4 RS |
527 | |
528 | if (current_buffer->base_buffer) | |
529 | base_buffer = current_buffer->base_buffer; | |
530 | ||
350bce56 RS |
531 | /* If this records an obsolete save |
532 | (not matching the actual disk file) | |
533 | then don't mark unmodified. */ | |
ad9cdce4 | 534 | if (mod_time != base_buffer->modtime) |
103dcb38 | 535 | continue; |
e6dd6080 | 536 | #ifdef CLASH_DETECTION |
350bce56 | 537 | Funlock_buffer (); |
e6dd6080 | 538 | #endif /* CLASH_DETECTION */ |
350bce56 | 539 | Fset_buffer_modified_p (Qnil); |
c6953be1 | 540 | } |
d8552b2f | 541 | else if (EQ (car, Qnil)) |
da9319d5 | 542 | { |
6887bce5 | 543 | /* Element (nil PROP VAL BEG . END) is property change. */ |
da9319d5 RS |
544 | Lisp_Object beg, end, prop, val; |
545 | ||
546 | prop = Fcar (cdr); | |
547 | cdr = Fcdr (cdr); | |
548 | val = Fcar (cdr); | |
549 | cdr = Fcdr (cdr); | |
550 | beg = Fcar (cdr); | |
551 | end = Fcdr (cdr); | |
552 | ||
9e568684 CY |
553 | if (XINT (beg) < BEGV || XINT (end) > ZV) |
554 | error ("Changes to be undone are outside visible portion of buffer"); | |
da9319d5 RS |
555 | Fput_text_property (beg, end, prop, val, Qnil); |
556 | } | |
38c0d37c | 557 | else if (INTEGERP (car) && INTEGERP (cdr)) |
c6953be1 | 558 | { |
350bce56 | 559 | /* Element (BEG . END) means range was inserted. */ |
350bce56 RS |
560 | |
561 | if (XINT (car) < BEGV | |
562 | || XINT (cdr) > ZV) | |
c6953be1 | 563 | error ("Changes to be undone are outside visible portion of buffer"); |
f28f04cc RS |
564 | /* Set point first thing, so that undoing this undo |
565 | does not send point back to where it is now. */ | |
350bce56 | 566 | Fgoto_char (car); |
f28f04cc | 567 | Fdelete_region (car, cdr); |
350bce56 | 568 | } |
49be18c9 | 569 | else if (EQ (car, Qapply)) |
6887bce5 | 570 | { |
3419757d | 571 | /* Element (apply FUN . ARGS) means call FUN to undo. */ |
a7a39468 KS |
572 | struct buffer *save_buffer = current_buffer; |
573 | ||
49be18c9 | 574 | car = Fcar (cdr); |
3419757d | 575 | cdr = Fcdr (cdr); |
49be18c9 KS |
576 | if (INTEGERP (car)) |
577 | { | |
3419757d SM |
578 | /* Long format: (apply DELTA START END FUN . ARGS). */ |
579 | Lisp_Object delta = car; | |
580 | Lisp_Object start = Fcar (cdr); | |
581 | Lisp_Object end = Fcar (Fcdr (cdr)); | |
582 | Lisp_Object start_mark = Fcopy_marker (start, Qnil); | |
583 | Lisp_Object end_mark = Fcopy_marker (end, Qt); | |
584 | ||
585 | cdr = Fcdr (Fcdr (cdr)); | |
586 | apply1 (Fcar (cdr), Fcdr (cdr)); | |
587 | ||
588 | /* Check that the function did what the entry said it | |
589 | would do. */ | |
590 | if (!EQ (start, Fmarker_position (start_mark)) | |
591 | || (XINT (delta) + XINT (end) | |
592 | != marker_position (end_mark))) | |
593 | error ("Changes to be undone by function different than announced"); | |
594 | Fset_marker (start_mark, Qnil, Qnil); | |
595 | Fset_marker (end_mark, Qnil, Qnil); | |
49be18c9 | 596 | } |
3419757d SM |
597 | else |
598 | apply1 (car, cdr); | |
a7a39468 KS |
599 | |
600 | if (save_buffer != current_buffer) | |
601 | error ("Undo function switched buffer"); | |
4ac03187 | 602 | did_apply = 1; |
6887bce5 | 603 | } |
38c0d37c | 604 | else if (STRINGP (car) && INTEGERP (cdr)) |
350bce56 RS |
605 | { |
606 | /* Element (STRING . POS) means STRING was deleted. */ | |
607 | Lisp_Object membuf; | |
608 | int pos = XINT (cdr); | |
609 | ||
610 | membuf = car; | |
611 | if (pos < 0) | |
612 | { | |
613 | if (-pos < BEGV || -pos > ZV) | |
614 | error ("Changes to be undone are outside visible portion of buffer"); | |
615 | SET_PT (-pos); | |
616 | Finsert (1, &membuf); | |
617 | } | |
618 | else | |
619 | { | |
620 | if (pos < BEGV || pos > ZV) | |
621 | error ("Changes to be undone are outside visible portion of buffer"); | |
622 | SET_PT (pos); | |
623 | ||
b2adc409 RS |
624 | /* Now that we record marker adjustments |
625 | (caused by deletion) for undo, | |
626 | we should always insert after markers, | |
627 | so that undoing the marker adjustments | |
628 | put the markers back in the right place. */ | |
629 | Finsert (1, &membuf); | |
350bce56 RS |
630 | SET_PT (pos); |
631 | } | |
c6953be1 | 632 | } |
714bced9 RS |
633 | else if (MARKERP (car) && INTEGERP (cdr)) |
634 | { | |
635 | /* (MARKER . INTEGER) means a marker MARKER | |
636 | was adjusted by INTEGER. */ | |
637 | if (XMARKER (car)->buffer) | |
638 | Fset_marker (car, | |
639 | make_number (marker_position (car) - XINT (cdr)), | |
640 | Fmarker_buffer (car)); | |
641 | } | |
c6953be1 JB |
642 | } |
643 | } | |
644 | arg--; | |
645 | } | |
646 | ||
4ac03187 KS |
647 | |
648 | /* Make sure an apply entry produces at least one undo entry, | |
649 | so the test in `undo' for continuing an undo series | |
650 | will work right. */ | |
651 | if (did_apply | |
652 | && EQ (oldlist, current_buffer->undo_list)) | |
653 | current_buffer->undo_list | |
654 | = Fcons (list3 (Qapply, Qcdr, Qnil), current_buffer->undo_list); | |
655 | ||
de65837b | 656 | UNGCPRO; |
f87a68b3 | 657 | return unbind_to (count, list); |
c6953be1 | 658 | } |
6887bce5 | 659 | \f |
dfcf069d | 660 | void |
c6953be1 JB |
661 | syms_of_undo () |
662 | { | |
f87a68b3 RS |
663 | Qinhibit_read_only = intern ("inhibit-read-only"); |
664 | staticpro (&Qinhibit_read_only); | |
665 | ||
49be18c9 KS |
666 | Qapply = intern ("apply"); |
667 | staticpro (&Qapply); | |
668 | ||
c58632fc RS |
669 | pending_boundary = Qnil; |
670 | staticpro (&pending_boundary); | |
671 | ||
4591d6cb SM |
672 | last_undo_buffer = NULL; |
673 | last_boundary_buffer = NULL; | |
674 | ||
c6953be1 JB |
675 | defsubr (&Sprimitive_undo); |
676 | defsubr (&Sundo_boundary); | |
137e23ea RS |
677 | |
678 | DEFVAR_INT ("undo-limit", &undo_limit, | |
679 | doc: /* Keep no more undo information once it exceeds this size. | |
680 | This limit is applied when garbage collection happens. | |
681 | When a previous command increases the total undo list size past this | |
682 | value, the earlier commands that came before it are forgotten. | |
683 | ||
684 | The size is counted as the number of bytes occupied, | |
685 | which includes both saved text and other data. */); | |
686 | undo_limit = 20000; | |
687 | ||
688 | DEFVAR_INT ("undo-strong-limit", &undo_strong_limit, | |
689 | doc: /* Don't keep more than this much size of undo information. | |
690 | This limit is applied when garbage collection happens. | |
691 | When a previous command increases the total undo list size past this | |
692 | value, that command and the earlier commands that came before it are forgotten. | |
693 | However, the most recent buffer-modifying command's undo info | |
694 | is never discarded for this reason. | |
695 | ||
696 | The size is counted as the number of bytes occupied, | |
697 | which includes both saved text and other data. */); | |
698 | undo_strong_limit = 30000; | |
699 | ||
81c1cf71 | 700 | DEFVAR_LISP ("undo-outer-limit", &Vundo_outer_limit, |
137e23ea RS |
701 | doc: /* Outer limit on size of undo information for one command. |
702 | At garbage collection time, if the current command has produced | |
62d776fd LT |
703 | more than this much undo information, it discards the info and displays |
704 | a warning. This is a last-ditch limit to prevent memory overflow. | |
137e23ea | 705 | |
62d776fd LT |
706 | The size is counted as the number of bytes occupied, which includes |
707 | both saved text and other data. A value of nil means no limit. In | |
708 | this case, accumulating one huge undo entry could make Emacs crash as | |
709 | a result of memory overflow. | |
137e23ea RS |
710 | |
711 | In fact, this calls the function which is the value of | |
712 | `undo-outer-limit-function' with one argument, the size. | |
713 | The text above describes the behavior of the function | |
714 | that variable usually specifies. */); | |
6de38aa3 | 715 | Vundo_outer_limit = make_number (3000000); |
137e23ea RS |
716 | |
717 | DEFVAR_LISP ("undo-outer-limit-function", &Vundo_outer_limit_function, | |
718 | doc: /* Function to call when an undo list exceeds `undo-outer-limit'. | |
719 | This function is called with one argument, the current undo list size | |
720 | for the most recent command (since the last undo boundary). | |
721 | If the function returns t, that means truncation has been fully handled. | |
722 | If it returns nil, the other forms of truncation are done. | |
723 | ||
724 | Garbage collection is inhibited around the call to this function, | |
725 | so it must make sure not to do a lot of consing. */); | |
726 | Vundo_outer_limit_function = Qnil; | |
8abe0f97 MR |
727 | |
728 | DEFVAR_BOOL ("undo-inhibit-record-point", &undo_inhibit_record_point, | |
729 | doc: /* Non-nil means do not record `point' in `buffer-undo-list'. */); | |
730 | undo_inhibit_record_point = 0; | |
c6953be1 | 731 | } |
ab5796a9 MB |
732 | |
733 | /* arch-tag: d546ee01-4aed-4ffb-bb8b-eefaae50d38a | |
734 | (do not change this comment) */ |