undo.c 21.7 KB
Newer Older
Jim Blandy's avatar
Jim Blandy committed
1
/* undo handling for GNU Emacs.
2
   Copyright (C) 1990, 1993-1994, 2000-2012  Free Software Foundation, Inc.
Jim Blandy's avatar
Jim Blandy committed
3 4 5

This file is part of GNU Emacs.

6
GNU Emacs is free software: you can redistribute it and/or modify
7
it under the terms of the GNU General Public License as published by
8 9
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
10

Jim Blandy's avatar
Jim Blandy committed
11
GNU Emacs is distributed in the hope that it will be useful,
12 13 14 15 16
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
17
along with GNU Emacs.  If not, see <http://www.gnu.org/licenses/>.  */
Jim Blandy's avatar
Jim Blandy committed
18 19


20
#include <config.h>
21
#include <setjmp.h>
Jim Blandy's avatar
Jim Blandy committed
22
#include "lisp.h"
23
#include "character.h"
Jim Blandy's avatar
Jim Blandy committed
24
#include "buffer.h"
25
#include "commands.h"
Richard M. Stallman's avatar
Richard M. Stallman committed
26
#include "window.h"
Jim Blandy's avatar
Jim Blandy committed
27 28

/* Last buffer for which undo information was recorded.  */
29
/* BEWARE: This is not traced by the GC, so never dereference it!  */
30
static struct buffer *last_undo_buffer;
31 32

/* Position of point last time we inserted a boundary.  */
33
static struct buffer *last_boundary_buffer;
34
static ptrdiff_t last_boundary_position;
Jim Blandy's avatar
Jim Blandy committed
35

36 37
Lisp_Object Qinhibit_read_only;

Kim F. Storm's avatar
Kim F. Storm committed
38 39 40 41
/* Marker for function call undo list elements.  */

Lisp_Object Qapply;

42 43 44 45 46
/* The first time a command records something for undo.
   it also allocates the undo-boundary object
   which will be added to the list at the end of the command.
   This ensures we can't run out of space while trying to make
   an undo-boundary.  */
47
static Lisp_Object pending_boundary;
48

Stefan Monnier's avatar
Stefan Monnier committed
49
/* Record point as it was at beginning of this command (if necessary)
50
   and prepare the undo info for recording a change.
Stefan Monnier's avatar
Stefan Monnier committed
51 52
   PT is the position of point that will naturally occur as a result of the
   undo record that will be added just after this command terminates.  */
Jim Blandy's avatar
Jim Blandy committed
53

Stefan Monnier's avatar
Stefan Monnier committed
54
static void
55
record_point (ptrdiff_t pt)
Jim Blandy's avatar
Jim Blandy committed
56
{
Stefan Monnier's avatar
Stefan Monnier committed
57
  int at_boundary;
58

59
  /* Don't record position of pt when undo_inhibit_record_point holds.  */
60 61 62
  if (undo_inhibit_record_point)
    return;

63 64 65 66
  /* Allocate a cons cell to be the undo boundary after this command.  */
  if (NILP (pending_boundary))
    pending_boundary = Fcons (Qnil, Qnil);

67 68 69 70 71 72 73
  if ((current_buffer != last_undo_buffer)
      /* Don't call Fundo_boundary for the first change.  Otherwise we
	 risk overwriting last_boundary_position in Fundo_boundary with
	 PT of the current buffer and as a consequence not insert an
	 undo boundary because last_boundary_position will equal pt in
	 the test at the end of the present function (Bug#731).  */
      && (MODIFF > SAVE_MODIFF))
Jim Blandy's avatar
Jim Blandy committed
74
    Fundo_boundary ();
75
  last_undo_buffer = current_buffer;
Jim Blandy's avatar
Jim Blandy committed
76

Tom Tromey's avatar
Tom Tromey committed
77
  if (CONSP (BVAR (current_buffer, undo_list)))
Stefan Monnier's avatar
Stefan Monnier committed
78 79 80 81
    {
      /* Set AT_BOUNDARY to 1 only when we have nothing other than
         marker adjustment before undo boundary.  */

Tom Tromey's avatar
Tom Tromey committed
82
      Lisp_Object tail = BVAR (current_buffer, undo_list), elt;
Stefan Monnier's avatar
Stefan Monnier committed
83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98

      while (1)
	{
	  if (NILP (tail))
	    elt = Qnil;
	  else
	    elt = XCAR (tail);
	  if (NILP (elt) || ! (CONSP (elt) && MARKERP (XCAR (elt))))
	    break;
	  tail = XCDR (tail);
	}
      at_boundary = NILP (elt);
    }
  else
    at_boundary = 1;

99
  if (MODIFF <= SAVE_MODIFF)
Jim Blandy's avatar
Jim Blandy committed
100 101
    record_first_change ();

102
  /* If we are just after an undo boundary, and
Stefan Monnier's avatar
Stefan Monnier committed
103 104
     point wasn't at start of deleted range, record where it was.  */
  if (at_boundary
105 106
      && current_buffer == last_boundary_buffer
      && last_boundary_position != pt)
Paul Eggert's avatar
Paul Eggert committed
107 108 109
    bset_undo_list (current_buffer,
		    Fcons (make_number (last_boundary_position),
			   BVAR (current_buffer, undo_list)));
Stefan Monnier's avatar
Stefan Monnier committed
110 111 112 113 114 115 116 117
}

/* Record an insertion that just happened or is about to happen,
   for LENGTH characters at position BEG.
   (It is possible to record an insertion before or after the fact
   because we don't need to record the contents.)  */

void
118
record_insert (ptrdiff_t beg, ptrdiff_t length)
Stefan Monnier's avatar
Stefan Monnier committed
119 120 121
{
  Lisp_Object lbeg, lend;

Tom Tromey's avatar
Tom Tromey committed
122
  if (EQ (BVAR (current_buffer, undo_list), Qt))
Stefan Monnier's avatar
Stefan Monnier committed
123 124 125 126
    return;

  record_point (beg);

Jim Blandy's avatar
Jim Blandy committed
127 128
  /* If this is following another insertion and consecutive with it
     in the buffer, combine the two.  */
Tom Tromey's avatar
Tom Tromey committed
129
  if (CONSP (BVAR (current_buffer, undo_list)))
Jim Blandy's avatar
Jim Blandy committed
130 131
    {
      Lisp_Object elt;
Tom Tromey's avatar
Tom Tromey committed
132
      elt = XCAR (BVAR (current_buffer, undo_list));
133
      if (CONSP (elt)
134 135 136
	  && INTEGERP (XCAR (elt))
	  && INTEGERP (XCDR (elt))
	  && XINT (XCDR (elt)) == beg)
Jim Blandy's avatar
Jim Blandy committed
137
	{
138
	  XSETCDR (elt, make_number (beg + length));
Jim Blandy's avatar
Jim Blandy committed
139 140 141 142
	  return;
	}
    }

143 144
  XSETFASTINT (lbeg, beg);
  XSETINT (lend, beg + length);
Paul Eggert's avatar
Paul Eggert committed
145 146
  bset_undo_list (current_buffer,
		  Fcons (Fcons (lbeg, lend), BVAR (current_buffer, undo_list)));
Jim Blandy's avatar
Jim Blandy committed
147 148 149
}

/* Record that a deletion is about to take place,
150
   of the characters in STRING, at location BEG.  */
Jim Blandy's avatar
Jim Blandy committed
151

152
void
153
record_delete (ptrdiff_t beg, Lisp_Object string)
Jim Blandy's avatar
Jim Blandy committed
154
{
155
  Lisp_Object sbeg;
Jim Blandy's avatar
Jim Blandy committed
156

Tom Tromey's avatar
Tom Tromey committed
157
  if (EQ (BVAR (current_buffer, undo_list), Qt))
158 159
    return;

160
  if (PT == beg + SCHARS (string))
161
    {
Stefan Monnier's avatar
Stefan Monnier committed
162 163
      XSETINT (sbeg, -beg);
      record_point (PT);
164 165
    }
  else
Stefan Monnier's avatar
Stefan Monnier committed
166 167 168 169
    {
      XSETFASTINT (sbeg, beg);
      record_point (beg);
    }
170

Paul Eggert's avatar
Paul Eggert committed
171 172 173
  bset_undo_list
    (current_buffer,
     Fcons (Fcons (string, sbeg), BVAR (current_buffer, undo_list)));
Jim Blandy's avatar
Jim Blandy committed
174 175
}

176 177 178 179 180
/* Record the fact that MARKER is about to be adjusted by ADJUSTMENT.
   This is done only when a marker points within text being deleted,
   because that's the only case where an automatic marker adjustment
   won't be inverted automatically by undoing the buffer modification.  */

181
void
182
record_marker_adjustment (Lisp_Object marker, ptrdiff_t adjustment)
183
{
Tom Tromey's avatar
Tom Tromey committed
184
  if (EQ (BVAR (current_buffer, undo_list), Qt))
185 186 187 188 189 190
    return;

  /* Allocate a cons cell to be the undo boundary after this command.  */
  if (NILP (pending_boundary))
    pending_boundary = Fcons (Qnil, Qnil);

191
  if (current_buffer != last_undo_buffer)
192
    Fundo_boundary ();
193
  last_undo_buffer = current_buffer;
194

Paul Eggert's avatar
Paul Eggert committed
195 196 197 198
  bset_undo_list
    (current_buffer,
     Fcons (Fcons (marker, make_number (adjustment)),
	    BVAR (current_buffer, undo_list)));
199 200
}

Jim Blandy's avatar
Jim Blandy committed
201 202
/* Record that a replacement is about to take place,
   for LENGTH characters at location BEG.
203
   The replacement must not change the number of characters.  */
Jim Blandy's avatar
Jim Blandy committed
204

205
void
206
record_change (ptrdiff_t beg, ptrdiff_t length)
Jim Blandy's avatar
Jim Blandy committed
207
{
208
  record_delete (beg, make_buffer_string (beg, beg + length, 1));
Jim Blandy's avatar
Jim Blandy committed
209 210 211 212 213 214 215
  record_insert (beg, length);
}

/* Record that an unmodified buffer is about to be changed.
   Record the file modification date so that when undoing this entry
   we can tell whether it is obsolete because the file was saved again.  */

216
void
217
record_first_change (void)
Jim Blandy's avatar
Jim Blandy committed
218
{
219
  struct buffer *base_buffer = current_buffer;
220

Tom Tromey's avatar
Tom Tromey committed
221
  if (EQ (BVAR (current_buffer, undo_list), Qt))
222 223
    return;

224
  if (current_buffer != last_undo_buffer)
225
    Fundo_boundary ();
226
  last_undo_buffer = current_buffer;
227

228 229 230
  if (base_buffer->base_buffer)
    base_buffer = base_buffer->base_buffer;

Paul Eggert's avatar
Paul Eggert committed
231 232 233 234
  bset_undo_list
    (current_buffer,
     Fcons (Fcons (Qt, make_lisp_time (base_buffer->modtime)),
	    BVAR (current_buffer, undo_list)));
Jim Blandy's avatar
Jim Blandy committed
235 236
}

237 238 239
/* Record a change in property PROP (whose old value was VAL)
   for LENGTH characters starting at position BEG in BUFFER.  */

240
void
241
record_property_change (ptrdiff_t beg, ptrdiff_t length,
242 243
			Lisp_Object prop, Lisp_Object value,
			Lisp_Object buffer)
244 245
{
  Lisp_Object lbeg, lend, entry;
246
  struct buffer *obuf = current_buffer, *buf = XBUFFER (buffer);
247 248
  int boundary = 0;

Tom Tromey's avatar
Tom Tromey committed
249
  if (EQ (BVAR (buf, undo_list), Qt))
250 251
    return;

252 253 254 255
  /* Allocate a cons cell to be the undo boundary after this command.  */
  if (NILP (pending_boundary))
    pending_boundary = Fcons (Qnil, Qnil);

256
  if (buf != last_undo_buffer)
257
    boundary = 1;
258
  last_undo_buffer = buf;
259 260

  /* Switch temporarily to the buffer that was changed.  */
261
  current_buffer = buf;
262 263 264 265

  if (boundary)
    Fundo_boundary ();

266
  if (MODIFF <= SAVE_MODIFF)
267 268
    record_first_change ();

269 270
  XSETINT (lbeg, beg);
  XSETINT (lend, beg + length);
271
  entry = Fcons (Qnil, Fcons (prop, Fcons (value, Fcons (lbeg, lend))));
Paul Eggert's avatar
Paul Eggert committed
272 273
  bset_undo_list (current_buffer,
		  Fcons (entry, BVAR (current_buffer, undo_list)));
274 275 276 277

  current_buffer = obuf;
}

Paul Eggert's avatar
Paul Eggert committed
278
DEFUN ("undo-boundary", Fundo_boundary, Sundo_boundary, 0, 0, 0,
279 280 281
       doc: /* Mark a boundary between units of undo.
An undo command will stop at this point,
but another undo command will undo to the previous boundary.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
282
  (void)
Jim Blandy's avatar
Jim Blandy committed
283 284
{
  Lisp_Object tem;
Tom Tromey's avatar
Tom Tromey committed
285
  if (EQ (BVAR (current_buffer, undo_list), Qt))
Jim Blandy's avatar
Jim Blandy committed
286
    return Qnil;
Tom Tromey's avatar
Tom Tromey committed
287
  tem = Fcar (BVAR (current_buffer, undo_list));
Jim Blandy's avatar
Jim Blandy committed
288
  if (!NILP (tem))
289 290 291 292 293 294
    {
      /* One way or another, cons nil onto the front of the undo list.  */
      if (!NILP (pending_boundary))
	{
	  /* If we have preallocated the cons cell to use here,
	     use that one.  */
Tom Tromey's avatar
Tom Tromey committed
295
	  XSETCDR (pending_boundary, BVAR (current_buffer, undo_list));
Paul Eggert's avatar
Paul Eggert committed
296
	  bset_undo_list (current_buffer, pending_boundary);
297 298 299
	  pending_boundary = Qnil;
	}
      else
Paul Eggert's avatar
Paul Eggert committed
300 301
	bset_undo_list (current_buffer,
			Fcons (Qnil, BVAR (current_buffer, undo_list)));
302
    }
303 304
  last_boundary_position = PT;
  last_boundary_buffer = current_buffer;
Jim Blandy's avatar
Jim Blandy committed
305 306 307 308
  return Qnil;
}

/* At garbage collection time, make an undo list shorter at the end,
309 310 311 312 313
   returning the truncated list.  How this is done depends on the
   variables undo-limit, undo-strong-limit and undo-outer-limit.
   In some cases this works by calling undo-outer-limit-function.  */

void
314
truncate_undo_list (struct buffer *b)
Jim Blandy's avatar
Jim Blandy committed
315
{
316
  Lisp_Object list;
Jim Blandy's avatar
Jim Blandy committed
317
  Lisp_Object prev, next, last_boundary;
318
  EMACS_INT size_so_far = 0;
Jim Blandy's avatar
Jim Blandy committed
319

320 321
  /* Make sure that calling undo-outer-limit-function
     won't cause another GC.  */
322
  ptrdiff_t count = inhibit_garbage_collection ();
323 324 325 326

  /* Make the buffer current to get its local values of variables such
     as undo_limit.  Also so that Vundo_outer_limit_function can
     tell which buffer to operate on.  */
327
  record_unwind_current_buffer ();
328 329
  set_buffer_internal (b);

Tom Tromey's avatar
Tom Tromey committed
330
  list = BVAR (b, undo_list);
331

Jim Blandy's avatar
Jim Blandy committed
332 333 334 335
  prev = Qnil;
  next = list;
  last_boundary = Qnil;

336
  /* If the first element is an undo boundary, skip past it.  */
337
  if (CONSP (next) && NILP (XCAR (next)))
Jim Blandy's avatar
Jim Blandy committed
338 339 340 341 342 343
    {
      /* Add in the space occupied by this element and its chain link.  */
      size_so_far += sizeof (struct Lisp_Cons);

      /* Advance to next element.  */
      prev = next;
344
      next = XCDR (next);
Jim Blandy's avatar
Jim Blandy committed
345
    }
346

347 348 349 350 351 352
  /* Always preserve at least the most recent undo record
     unless it is really horribly big.

     Skip, skip, skip the undo, skip, skip, skip the undo,
     Skip, skip, skip the undo, skip to the undo bound'ry.  */

353
  while (CONSP (next) && ! NILP (XCAR (next)))
Jim Blandy's avatar
Jim Blandy committed
354 355
    {
      Lisp_Object elt;
356
      elt = XCAR (next);
Jim Blandy's avatar
Jim Blandy committed
357 358 359

      /* Add in the space occupied by this element and its chain link.  */
      size_so_far += sizeof (struct Lisp_Cons);
360
      if (CONSP (elt))
Jim Blandy's avatar
Jim Blandy committed
361 362
	{
	  size_so_far += sizeof (struct Lisp_Cons);
363
	  if (STRINGP (XCAR (elt)))
Jim Blandy's avatar
Jim Blandy committed
364
	    size_so_far += (sizeof (struct Lisp_String) - 1
365
			    + SCHARS (XCAR (elt)));
Jim Blandy's avatar
Jim Blandy committed
366 367 368 369
	}

      /* Advance to next element.  */
      prev = next;
370
      next = XCDR (next);
Jim Blandy's avatar
Jim Blandy committed
371
    }
372

373 374
  /* If by the first boundary we have already passed undo_outer_limit,
     we're heading for memory full, so offer to clear out the list.  */
375 376
  if (INTEGERP (Vundo_outer_limit)
      && size_so_far > XINT (Vundo_outer_limit)
377 378
      && !NILP (Vundo_outer_limit_function))
    {
379 380
      Lisp_Object tem;
      struct buffer *temp = last_undo_buffer;
381 382

      /* Normally the function this calls is undo-outer-limit-truncate.  */
383 384
      tem = call1 (Vundo_outer_limit_function, make_number (size_so_far));
      if (! NILP (tem))
385 386 387 388 389 390 391 392 393 394 395 396
	{
	  /* The function is responsible for making
	     any desired changes in buffer-undo-list.  */
	  unbind_to (count, Qnil);
	  return;
	}
      /* That function probably used the minibuffer, and if so, that
	 changed last_undo_buffer.  Change it back so that we don't
	 force next change to make an undo boundary here.  */
      last_undo_buffer = temp;
    }

397
  if (CONSP (next))
Jim Blandy's avatar
Jim Blandy committed
398 399
    last_boundary = prev;

400
  /* Keep additional undo data, if it fits in the limits.  */
401
  while (CONSP (next))
Jim Blandy's avatar
Jim Blandy committed
402 403
    {
      Lisp_Object elt;
404
      elt = XCAR (next);
Jim Blandy's avatar
Jim Blandy committed
405 406

      /* When we get to a boundary, decide whether to truncate
407
	 either before or after it.  The lower threshold, undo_limit,
Jim Blandy's avatar
Jim Blandy committed
408
	 tells us to truncate after it.  If its size pushes past
409
	 the higher threshold undo_strong_limit, we truncate before it.  */
Jim Blandy's avatar
Jim Blandy committed
410
      if (NILP (elt))
Jim Blandy's avatar
Jim Blandy committed
411
	{
412
	  if (size_so_far > undo_strong_limit)
Jim Blandy's avatar
Jim Blandy committed
413 414
	    break;
	  last_boundary = prev;
415
	  if (size_so_far > undo_limit)
Jim Blandy's avatar
Jim Blandy committed
416 417 418 419 420
	    break;
	}

      /* Add in the space occupied by this element and its chain link.  */
      size_so_far += sizeof (struct Lisp_Cons);
421
      if (CONSP (elt))
Jim Blandy's avatar
Jim Blandy committed
422 423
	{
	  size_so_far += sizeof (struct Lisp_Cons);
424
	  if (STRINGP (XCAR (elt)))
Jim Blandy's avatar
Jim Blandy committed
425
	    size_so_far += (sizeof (struct Lisp_String) - 1
426
			    + SCHARS (XCAR (elt)));
Jim Blandy's avatar
Jim Blandy committed
427 428 429 430
	}

      /* Advance to next element.  */
      prev = next;
431
      next = XCDR (next);
Jim Blandy's avatar
Jim Blandy committed
432 433 434
    }

  /* If we scanned the whole list, it is short enough; don't change it.  */
Jim Blandy's avatar
Jim Blandy committed
435
  if (NILP (next))
436
    ;
Jim Blandy's avatar
Jim Blandy committed
437
  /* Truncate at the boundary where we decided to truncate.  */
438 439 440
  else if (!NILP (last_boundary))
    XSETCDR (last_boundary, Qnil);
  /* There's nothing we decided to keep, so clear it out.  */
Jim Blandy's avatar
Jim Blandy committed
441
  else
Paul Eggert's avatar
Paul Eggert committed
442
    bset_undo_list (b, Qnil);
443 444

  unbind_to (count, Qnil);
Jim Blandy's avatar
Jim Blandy committed
445
}
446

447 448
static _Noreturn void
user_error (const char *msg)
449 450 451 452
{
  xsignal1 (Quser_error, build_string (msg));
}

Jim Blandy's avatar
Jim Blandy committed
453 454

DEFUN ("primitive-undo", Fprimitive_undo, Sprimitive_undo, 2, 2, 0,
455 456
       doc: /* Undo N records from the front of the list LIST.
Return what remains of the list.  */)
Dan Nicolaescu's avatar
Dan Nicolaescu committed
457
  (Lisp_Object n, Lisp_Object list)
Jim Blandy's avatar
Jim Blandy committed
458
{
459 460
  struct gcpro gcpro1, gcpro2;
  Lisp_Object next;
461 462
  ptrdiff_t count = SPECPDL_INDEX ();
  register EMACS_INT arg;
463 464
  Lisp_Object oldlist;
  int did_apply = 0;
465

Jim Blandy's avatar
Jim Blandy committed
466 467 468 469 470 471 472
#if 0  /* This is a good feature, but would make undo-start
	  unable to do what is expected.  */
  Lisp_Object tem;

  /* If the head of the list is a boundary, it is the boundary
     preceding this command.  Get rid of it and don't count it.  */
  tem = Fcar (list);
Jim Blandy's avatar
Jim Blandy committed
473
  if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
474 475 476
    list = Fcdr (list);
#endif

477
  CHECK_NUMBER (n);
478 479 480
  arg = XINT (n);
  next = Qnil;
  GCPRO2 (next, list);
481 482
  /* I don't think we need to gcpro oldlist, as we use it only
     to check for EQ.  ++kfs  */
483

484 485
  /* In a writable buffer, enable undoing read-only text that is so
     because of text properties.  */
Tom Tromey's avatar
Tom Tromey committed
486
  if (NILP (BVAR (current_buffer, read_only)))
487 488
    specbind (Qinhibit_read_only, Qt);

489 490 491
  /* Don't let `intangible' properties interfere with undo.  */
  specbind (Qinhibit_point_motion_hooks, Qt);

Tom Tromey's avatar
Tom Tromey committed
492
  oldlist = BVAR (current_buffer, undo_list);
493

Jim Blandy's avatar
Jim Blandy committed
494 495
  while (arg > 0)
    {
496
      while (CONSP (list))
Jim Blandy's avatar
Jim Blandy committed
497
	{
498 499
	  next = XCAR (list);
	  list = XCDR (list);
500
	  /* Exit inner loop at undo boundary.  */
Jim Blandy's avatar
Jim Blandy committed
501
	  if (NILP (next))
Jim Blandy's avatar
Jim Blandy committed
502
	    break;
503
	  /* Handle an integer by setting point to that value.  */
504
	  if (INTEGERP (next))
505
	    SET_PT (clip_to_bounds (BEGV, XINT (next), ZV));
506
	  else if (CONSP (next))
Jim Blandy's avatar
Jim Blandy committed
507
	    {
508 509
	      Lisp_Object car, cdr;

510 511
	      car = XCAR (next);
	      cdr = XCDR (next);
512
	      if (EQ (car, Qt))
Jim Blandy's avatar
Jim Blandy committed
513
		{
514 515 516
		  /* Element (t . TIME) records previous modtime.
		     Preserve any flag of NONEXISTENT_MODTIME_NSECS or
		     UNKNOWN_MODTIME_NSECS.  */
517
		  struct buffer *base_buffer = current_buffer;
518 519 520 521 522 523 524 525
		  EMACS_TIME mod_time;

		  if (CONSP (cdr)
		      && CONSP (XCDR (cdr))
		      && CONSP (XCDR (XCDR (cdr)))
		      && CONSP (XCDR (XCDR (XCDR (cdr))))
		      && INTEGERP (XCAR (XCDR (XCDR (XCDR (cdr)))))
		      && XINT (XCAR (XCDR (XCDR (XCDR (cdr))))) < 0)
526 527 528
		    mod_time =
		      (make_emacs_time
		       (0, XINT (XCAR (XCDR (XCDR (XCDR (cdr))))) / 1000));
529
		  else
530
		    mod_time = lisp_time_argument (cdr);
531 532 533 534

		  if (current_buffer->base_buffer)
		    base_buffer = current_buffer->base_buffer;

535 536 537
		  /* If this records an obsolete save
		     (not matching the actual disk file)
		     then don't mark unmodified.  */
538
		  if (EMACS_TIME_NE (mod_time, base_buffer->modtime))
539
		    continue;
540
#ifdef CLASH_DETECTION
541
		  Funlock_buffer ();
542
#endif /* CLASH_DETECTION */
543
		  Fset_buffer_modified_p (Qnil);
Jim Blandy's avatar
Jim Blandy committed
544
		}
545
	      else if (EQ (car, Qnil))
546
		{
547
		  /* Element (nil PROP VAL BEG . END) is property change.  */
548 549 550 551 552 553 554 555 556
		  Lisp_Object beg, end, prop, val;

		  prop = Fcar (cdr);
		  cdr = Fcdr (cdr);
		  val = Fcar (cdr);
		  cdr = Fcdr (cdr);
		  beg = Fcar (cdr);
		  end = Fcdr (cdr);

557
		  if (XINT (beg) < BEGV || XINT (end) > ZV)
558
		    user_error ("Changes to be undone are outside visible portion of buffer");
559 560
		  Fput_text_property (beg, end, prop, val, Qnil);
		}
561
	      else if (INTEGERP (car) && INTEGERP (cdr))
Jim Blandy's avatar
Jim Blandy committed
562
		{
563 564 565 566
		  /* Element (BEG . END) means range was inserted.  */

		  if (XINT (car) < BEGV
		      || XINT (cdr) > ZV)
567
		    user_error ("Changes to be undone are outside visible portion of buffer");
568 569
		  /* Set point first thing, so that undoing this undo
		     does not send point back to where it is now.  */
570
		  Fgoto_char (car);
571
		  Fdelete_region (car, cdr);
572
		}
Kim F. Storm's avatar
Kim F. Storm committed
573
	      else if (EQ (car, Qapply))
574
		{
575
		  /* Element (apply FUN . ARGS) means call FUN to undo.  */
576 577
		  struct buffer *save_buffer = current_buffer;

Kim F. Storm's avatar
Kim F. Storm committed
578
		  car = Fcar (cdr);
579
		  cdr = Fcdr (cdr);
Kim F. Storm's avatar
Kim F. Storm committed
580 581
		  if (INTEGERP (car))
		    {
582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599
		      /* Long format: (apply DELTA START END FUN . ARGS).  */
		      Lisp_Object delta = car;
		      Lisp_Object start = Fcar (cdr);
		      Lisp_Object end   = Fcar (Fcdr (cdr));
		      Lisp_Object start_mark = Fcopy_marker (start, Qnil);
		      Lisp_Object end_mark   = Fcopy_marker (end, Qt);

		      cdr = Fcdr (Fcdr (cdr));
		      apply1 (Fcar (cdr), Fcdr (cdr));

		      /* Check that the function did what the entry said it
			 would do.  */
		      if (!EQ (start, Fmarker_position (start_mark))
			  || (XINT (delta) + XINT (end)
			      != marker_position (end_mark)))
			error ("Changes to be undone by function different than announced");
		      Fset_marker (start_mark, Qnil, Qnil);
		      Fset_marker (end_mark, Qnil, Qnil);
Kim F. Storm's avatar
Kim F. Storm committed
600
		    }
601 602
		  else
		    apply1 (car, cdr);
603 604 605

		  if (save_buffer != current_buffer)
		    error ("Undo function switched buffer");
606
		  did_apply = 1;
607
		}
608
	      else if (STRINGP (car) && INTEGERP (cdr))
609 610 611
		{
		  /* Element (STRING . POS) means STRING was deleted.  */
		  Lisp_Object membuf;
612
		  EMACS_INT pos = XINT (cdr);
613 614 615 616 617

		  membuf = car;
		  if (pos < 0)
		    {
		      if (-pos < BEGV || -pos > ZV)
618
			user_error ("Changes to be undone are outside visible portion of buffer");
619 620 621 622 623 624
		      SET_PT (-pos);
		      Finsert (1, &membuf);
		    }
		  else
		    {
		      if (pos < BEGV || pos > ZV)
625
			user_error ("Changes to be undone are outside visible portion of buffer");
626 627
		      SET_PT (pos);

628 629 630 631 632 633
		      /* Now that we record marker adjustments
			 (caused by deletion) for undo,
			 we should always insert after markers,
			 so that undoing the marker adjustments
			 put the markers back in the right place.  */
		      Finsert (1, &membuf);
634 635
		      SET_PT (pos);
		    }
Jim Blandy's avatar
Jim Blandy committed
636
		}
637 638 639 640 641 642 643 644 645
	      else if (MARKERP (car) && INTEGERP (cdr))
		{
		  /* (MARKER . INTEGER) means a marker MARKER
		     was adjusted by INTEGER.  */
		  if (XMARKER (car)->buffer)
		    Fset_marker (car,
				 make_number (marker_position (car) - XINT (cdr)),
				 Fmarker_buffer (car));
		}
Jim Blandy's avatar
Jim Blandy committed
646 647 648 649 650
	    }
	}
      arg--;
    }

651 652 653 654 655

  /* Make sure an apply entry produces at least one undo entry,
     so the test in `undo' for continuing an undo series
     will work right.  */
  if (did_apply
Tom Tromey's avatar
Tom Tromey committed
656
      && EQ (oldlist, BVAR (current_buffer, undo_list)))
Paul Eggert's avatar
Paul Eggert committed
657 658 659
    bset_undo_list
      (current_buffer,
       Fcons (list3 (Qapply, Qcdr, Qnil), BVAR (current_buffer, undo_list)));
660

661
  UNGCPRO;
662
  return unbind_to (count, list);
Jim Blandy's avatar
Jim Blandy committed
663
}
664

Andreas Schwab's avatar
Andreas Schwab committed
665
void
666
syms_of_undo (void)
Jim Blandy's avatar
Jim Blandy committed
667
{
668 669
  DEFSYM (Qinhibit_read_only, "inhibit-read-only");
  DEFSYM (Qapply, "apply");
Kim F. Storm's avatar
Kim F. Storm committed
670

671 672 673
  pending_boundary = Qnil;
  staticpro (&pending_boundary);

674 675 676
  last_undo_buffer = NULL;
  last_boundary_buffer = NULL;

Jim Blandy's avatar
Jim Blandy committed
677 678
  defsubr (&Sprimitive_undo);
  defsubr (&Sundo_boundary);
679

680
  DEFVAR_INT ("undo-limit", undo_limit,
681 682 683 684 685 686 687
	      doc: /* Keep no more undo information once it exceeds this size.
This limit is applied when garbage collection happens.
When a previous command increases the total undo list size past this
value, the earlier commands that came before it are forgotten.

The size is counted as the number of bytes occupied,
which includes both saved text and other data.  */);
688
  undo_limit = 80000;
689

690
  DEFVAR_INT ("undo-strong-limit", undo_strong_limit,
691 692 693 694 695 696 697 698 699
	      doc: /* Don't keep more than this much size of undo information.
This limit is applied when garbage collection happens.
When a previous command increases the total undo list size past this
value, that command and the earlier commands that came before it are forgotten.
However, the most recent buffer-modifying command's undo info
is never discarded for this reason.

The size is counted as the number of bytes occupied,
which includes both saved text and other data.  */);
700
  undo_strong_limit = 120000;
701

702
  DEFVAR_LISP ("undo-outer-limit", Vundo_outer_limit,
703 704
	      doc: /* Outer limit on size of undo information for one command.
At garbage collection time, if the current command has produced
705 706
more than this much undo information, it discards the info and displays
a warning.  This is a last-ditch limit to prevent memory overflow.
707

708 709 710 711
The size is counted as the number of bytes occupied, which includes
both saved text and other data.  A value of nil means no limit.  In
this case, accumulating one huge undo entry could make Emacs crash as
a result of memory overflow.
712 713 714 715 716

In fact, this calls the function which is the value of
`undo-outer-limit-function' with one argument, the size.
The text above describes the behavior of the function
that variable usually specifies.  */);
717
  Vundo_outer_limit = make_number (12000000);
718

719
  DEFVAR_LISP ("undo-outer-limit-function", Vundo_outer_limit_function,
720 721 722 723 724 725 726 727 728
	       doc: /* Function to call when an undo list exceeds `undo-outer-limit'.
This function is called with one argument, the current undo list size
for the most recent command (since the last undo boundary).
If the function returns t, that means truncation has been fully handled.
If it returns nil, the other forms of truncation are done.

Garbage collection is inhibited around the call to this function,
so it must make sure not to do a lot of consing.  */);
  Vundo_outer_limit_function = Qnil;
729

730
  DEFVAR_BOOL ("undo-inhibit-record-point", undo_inhibit_record_point,
731 732
	       doc: /* Non-nil means do not record `point' in `buffer-undo-list'.  */);
  undo_inhibit_record_point = 0;
Jim Blandy's avatar
Jim Blandy committed
733
}