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

This file is part of GNU Emacs.

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

Jim Blandy's avatar
Jim Blandy committed
12
GNU Emacs is distributed in the hope that it will be useful,
13 14 15 16 17 18
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
along with GNU Emacs; see the file COPYING.  If not, write to
Lute Kamstra's avatar
Lute Kamstra committed
19 20
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.  */
Jim Blandy's avatar
Jim Blandy committed
21 22


23
#include <config.h>
Jim Blandy's avatar
Jim Blandy committed
24 25
#include "lisp.h"
#include "buffer.h"
26
#include "commands.h"
Jim Blandy's avatar
Jim Blandy committed
27

28 29 30 31
/* Limits controlling how much undo information to keep.  */

EMACS_INT undo_limit;
EMACS_INT undo_strong_limit;
32 33

Lisp_Object Vundo_outer_limit;
34 35 36 37 38

/* Function to call when undo_outer_limit is exceeded.  */

Lisp_Object Vundo_outer_limit_function;

Jim Blandy's avatar
Jim Blandy committed
39 40 41
/* Last buffer for which undo information was recorded.  */
Lisp_Object last_undo_buffer;

42 43
Lisp_Object Qinhibit_read_only;

Kim F. Storm's avatar
Kim F. Storm committed
44 45 46 47
/* Marker for function call undo list elements.  */

Lisp_Object Qapply;

48 49 50 51 52 53 54
/* 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.  */
Lisp_Object pending_boundary;

Stefan Monnier's avatar
Stefan Monnier committed
55 56 57 58
/* Record point as it was at beginning of this command (if necessary)
   And prepare the undo info for recording a change.
   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
59

Stefan Monnier's avatar
Stefan Monnier committed
60 61
static void
record_point (pt)
Dave Love's avatar
Dave Love committed
62
     int pt;
Jim Blandy's avatar
Jim Blandy committed
63
{
Stefan Monnier's avatar
Stefan Monnier committed
64
  int at_boundary;
65

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

70 71
  if (!BUFFERP (last_undo_buffer)
      || current_buffer != XBUFFER (last_undo_buffer))
Jim Blandy's avatar
Jim Blandy committed
72
    Fundo_boundary ();
73
  XSETBUFFER (last_undo_buffer, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
74

Stefan Monnier's avatar
Stefan Monnier committed
75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96
  if (CONSP (current_buffer->undo_list))
    {
      /* Set AT_BOUNDARY to 1 only when we have nothing other than
         marker adjustment before undo boundary.  */

      Lisp_Object tail = current_buffer->undo_list, elt;

      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;

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

100
  /* If we are just after an undo boundary, and
Stefan Monnier's avatar
Stefan Monnier committed
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126
     point wasn't at start of deleted range, record where it was.  */
  if (at_boundary
      && last_point_position != pt
      /* If we're called from batch mode, this could be nil.  */
      && BUFFERP (last_point_position_buffer)
      && current_buffer == XBUFFER (last_point_position_buffer))
    current_buffer->undo_list
      = Fcons (make_number (last_point_position), current_buffer->undo_list);
}

/* 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
record_insert (beg, length)
     int beg, length;
{
  Lisp_Object lbeg, lend;

  if (EQ (current_buffer->undo_list, Qt))
    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.  */
129
  if (CONSP (current_buffer->undo_list))
Jim Blandy's avatar
Jim Blandy committed
130 131
    {
      Lisp_Object elt;
132
      elt = XCAR (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);
145 146
  current_buffer->undo_list = Fcons (Fcons (lbeg, lend),
                                     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 154 155
record_delete (beg, string)
     int beg;
     Lisp_Object string;
Jim Blandy's avatar
Jim Blandy committed
156
{
157
  Lisp_Object sbeg;
Jim Blandy's avatar
Jim Blandy committed
158

159 160 161
  if (EQ (current_buffer->undo_list, Qt))
    return;

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

Jim Blandy's avatar
Jim Blandy committed
173
  current_buffer->undo_list
174
    = Fcons (Fcons (string, sbeg), current_buffer->undo_list);
Jim Blandy's avatar
Jim Blandy committed
175 176
}

177 178 179 180 181
/* 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.  */

182
void
183 184 185 186 187 188 189 190 191 192 193
record_marker_adjustment (marker, adjustment)
     Lisp_Object marker;
     int adjustment;
{
  if (EQ (current_buffer->undo_list, Qt))
    return;

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

194
  if (!BUFFERP (last_undo_buffer)
195
      || current_buffer != XBUFFER (last_undo_buffer))
196 197 198 199 200 201 202 203
    Fundo_boundary ();
  XSETBUFFER (last_undo_buffer, current_buffer);

  current_buffer->undo_list
    = Fcons (Fcons (marker, make_number (adjustment)),
	     current_buffer->undo_list);
}

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

208
void
Jim Blandy's avatar
Jim Blandy committed
209 210 211
record_change (beg, length)
     int beg, length;
{
212
  record_delete (beg, make_buffer_string (beg, beg + length, 1));
Jim Blandy's avatar
Jim Blandy committed
213 214 215 216 217 218 219
  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.  */

220
void
Jim Blandy's avatar
Jim Blandy committed
221 222 223
record_first_change ()
{
  Lisp_Object high, low;
224
  struct buffer *base_buffer = current_buffer;
225 226 227 228

  if (EQ (current_buffer->undo_list, Qt))
    return;

229 230
  if (!BUFFERP (last_undo_buffer)
      || current_buffer != XBUFFER (last_undo_buffer))
231
    Fundo_boundary ();
232
  XSETBUFFER (last_undo_buffer, current_buffer);
233

234 235 236 237 238
  if (base_buffer->base_buffer)
    base_buffer = base_buffer->base_buffer;

  XSETFASTINT (high, (base_buffer->modtime >> 16) & 0xffff);
  XSETFASTINT (low, base_buffer->modtime & 0xffff);
Jim Blandy's avatar
Jim Blandy committed
239 240 241
  current_buffer->undo_list = Fcons (Fcons (Qt, Fcons (high, low)), current_buffer->undo_list);
}

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

245
void
246 247 248 249 250 251 252 253
record_property_change (beg, length, prop, value, buffer)
     int beg, length;
     Lisp_Object prop, value, buffer;
{
  Lisp_Object lbeg, lend, entry;
  struct buffer *obuf = current_buffer;
  int boundary = 0;

254
  if (EQ (XBUFFER (buffer)->undo_list, Qt))
255 256
    return;

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

261 262 263 264 265 266 267 268 269 270
  if (!EQ (buffer, last_undo_buffer))
    boundary = 1;
  last_undo_buffer = buffer;

  /* Switch temporarily to the buffer that was changed.  */
  current_buffer = XBUFFER (buffer);

  if (boundary)
    Fundo_boundary ();

271
  if (MODIFF <= SAVE_MODIFF)
272 273
    record_first_change ();

274 275
  XSETINT (lbeg, beg);
  XSETINT (lend, beg + length);
276 277 278 279 280 281
  entry = Fcons (Qnil, Fcons (prop, Fcons (value, Fcons (lbeg, lend))));
  current_buffer->undo_list = Fcons (entry, current_buffer->undo_list);

  current_buffer = obuf;
}

Jim Blandy's avatar
Jim Blandy committed
282
DEFUN ("undo-boundary", Fundo_boundary, Sundo_boundary, 0, 0, 0,
283 284 285 286
       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.  */)
     ()
Jim Blandy's avatar
Jim Blandy committed
287 288 289 290 291
{
  Lisp_Object tem;
  if (EQ (current_buffer->undo_list, Qt))
    return Qnil;
  tem = Fcar (current_buffer->undo_list);
Jim Blandy's avatar
Jim Blandy committed
292
  if (!NILP (tem))
293 294 295 296 297 298
    {
      /* 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.  */
299
	  XSETCDR (pending_boundary, current_buffer->undo_list);
300 301 302 303 304 305
	  current_buffer->undo_list = pending_boundary;
	  pending_boundary = Qnil;
	}
      else
	current_buffer->undo_list = Fcons (Qnil, current_buffer->undo_list);
    }
Jim Blandy's avatar
Jim Blandy committed
306 307 308 309
  return Qnil;
}

/* At garbage collection time, make an undo list shorter at the end,
310 311 312 313 314 315 316
   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
truncate_undo_list (b)
     struct buffer *b;
Jim Blandy's avatar
Jim Blandy committed
317
{
318
  Lisp_Object list;
Jim Blandy's avatar
Jim Blandy committed
319 320 321
  Lisp_Object prev, next, last_boundary;
  int size_so_far = 0;

322 323 324 325 326 327 328 329 330 331 332 333
  /* Make sure that calling undo-outer-limit-function
     won't cause another GC.  */
  int count = inhibit_garbage_collection ();

  /* 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.  */
  record_unwind_protect (set_buffer_if_live, Fcurrent_buffer ());
  set_buffer_internal (b);

  list = b->undo_list;

Jim Blandy's avatar
Jim Blandy committed
334 335 336 337
  prev = Qnil;
  next = list;
  last_boundary = Qnil;

338
  /* If the first element is an undo boundary, skip past it.  */
339
  if (CONSP (next) && NILP (XCAR (next)))
Jim Blandy's avatar
Jim Blandy committed
340 341 342 343 344 345
    {
      /* 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;
346
      next = XCDR (next);
Jim Blandy's avatar
Jim Blandy committed
347
    }
348

349 350 351 352 353 354
  /* 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.  */

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

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

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

375 376
  /* 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.  */
377 378
  if (INTEGERP (Vundo_outer_limit)
      && size_so_far > XINT (Vundo_outer_limit)
379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397
      && !NILP (Vundo_outer_limit_function))
    {
      Lisp_Object temp = last_undo_buffer;

      /* Normally the function this calls is undo-outer-limit-truncate.  */
      if (! NILP (call1 (Vundo_outer_limit_function,
			 make_number (size_so_far))))
	{
	  /* 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;
    }

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

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

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

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

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

  /* If we scanned the whole list, it is short enough; don't change it.  */
Jim Blandy's avatar
Jim Blandy committed
436
  if (NILP (next))
437
    ;
Jim Blandy's avatar
Jim Blandy committed
438
  /* Truncate at the boundary where we decided to truncate.  */
439 440 441
  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
442
  else
443 444 445
    b->undo_list = Qnil;

  unbind_to (count, Qnil);
Jim Blandy's avatar
Jim Blandy committed
446 447 448
}

DEFUN ("primitive-undo", Fprimitive_undo, Sprimitive_undo, 2, 2, 0,
449 450 451
       doc: /* Undo N records from the front of the list LIST.
Return what remains of the list.  */)
     (n, list)
452
     Lisp_Object n, list;
Jim Blandy's avatar
Jim Blandy committed
453
{
454 455
  struct gcpro gcpro1, gcpro2;
  Lisp_Object next;
456
  int count = SPECPDL_INDEX ();
457
  register int arg;
458 459
  Lisp_Object oldlist;
  int did_apply = 0;
460

Jim Blandy's avatar
Jim Blandy committed
461 462 463 464 465 466 467
#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
468
  if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
469 470 471
    list = Fcdr (list);
#endif

472
  CHECK_NUMBER (n);
473 474 475
  arg = XINT (n);
  next = Qnil;
  GCPRO2 (next, list);
476 477
  /* I don't think we need to gcpro oldlist, as we use it only
     to check for EQ.  ++kfs  */
478

479 480 481
  /* In a writable buffer, enable undoing read-only text that is so
     because of text properties.  */
  if (NILP (current_buffer->read_only))
482 483
    specbind (Qinhibit_read_only, Qt);

484 485 486
  /* Don't let `intangible' properties interfere with undo.  */
  specbind (Qinhibit_point_motion_hooks, Qt);

487 488
  oldlist = current_buffer->undo_list;

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

505 506
	      car = XCAR (next);
	      cdr = XCDR (next);
507
	      if (EQ (car, Qt))
Jim Blandy's avatar
Jim Blandy committed
508
		{
509 510 511
		  /* Element (t high . low) records previous modtime.  */
		  Lisp_Object high, low;
		  int mod_time;
512
		  struct buffer *base_buffer = current_buffer;
513 514 515

		  high = Fcar (cdr);
		  low = Fcdr (cdr);
516
		  mod_time = (XFASTINT (high) << 16) + XFASTINT (low);
517 518 519 520

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

521 522 523
		  /* If this records an obsolete save
		     (not matching the actual disk file)
		     then don't mark unmodified.  */
524
		  if (mod_time != base_buffer->modtime)
525
		    continue;
526
#ifdef CLASH_DETECTION
527
		  Funlock_buffer ();
528
#endif /* CLASH_DETECTION */
529
		  Fset_buffer_modified_p (Qnil);
Jim Blandy's avatar
Jim Blandy committed
530
		}
531
	      else if (EQ (car, Qnil))
532
		{
533
		  /* Element (nil PROP VAL BEG . END) is property change.  */
534 535 536 537 538 539 540 541 542 543 544
		  Lisp_Object beg, end, prop, val;

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

		  Fput_text_property (beg, end, prop, val, Qnil);
		}
545
	      else if (INTEGERP (car) && INTEGERP (cdr))
Jim Blandy's avatar
Jim Blandy committed
546
		{
547 548 549 550
		  /* Element (BEG . END) means range was inserted.  */

		  if (XINT (car) < BEGV
		      || XINT (cdr) > ZV)
Jim Blandy's avatar
Jim Blandy committed
551
		    error ("Changes to be undone are outside visible portion of buffer");
552 553
		  /* Set point first thing, so that undoing this undo
		     does not send point back to where it is now.  */
554
		  Fgoto_char (car);
555
		  Fdelete_region (car, cdr);
556
		}
Kim F. Storm's avatar
Kim F. Storm committed
557
	      else if (EQ (car, Qapply))
558
		{
559
		  /* Element (apply FUN . ARGS) means call FUN to undo.  */
560 561
		  struct buffer *save_buffer = current_buffer;

Kim F. Storm's avatar
Kim F. Storm committed
562
		  car = Fcar (cdr);
563
		  cdr = Fcdr (cdr);
Kim F. Storm's avatar
Kim F. Storm committed
564 565
		  if (INTEGERP (car))
		    {
566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583
		      /* 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
584
		    }
585 586
		  else
		    apply1 (car, cdr);
587 588 589

		  if (save_buffer != current_buffer)
		    error ("Undo function switched buffer");
590
		  did_apply = 1;
591
		}
592
	      else if (STRINGP (car) && INTEGERP (cdr))
593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611
		{
		  /* Element (STRING . POS) means STRING was deleted.  */
		  Lisp_Object membuf;
		  int pos = XINT (cdr);

		  membuf = car;
		  if (pos < 0)
		    {
		      if (-pos < BEGV || -pos > ZV)
			error ("Changes to be undone are outside visible portion of buffer");
		      SET_PT (-pos);
		      Finsert (1, &membuf);
		    }
		  else
		    {
		      if (pos < BEGV || pos > ZV)
			error ("Changes to be undone are outside visible portion of buffer");
		      SET_PT (pos);

612 613 614 615 616 617
		      /* 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);
618 619
		      SET_PT (pos);
		    }
Jim Blandy's avatar
Jim Blandy committed
620
		}
621 622 623 624 625 626 627 628 629
	      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
630 631 632 633 634
	    }
	}
      arg--;
    }

635 636 637 638 639 640 641 642 643

  /* 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
      && EQ (oldlist, current_buffer->undo_list))
    current_buffer->undo_list
      = Fcons (list3 (Qapply, Qcdr, Qnil), current_buffer->undo_list);

644
  UNGCPRO;
645
  return unbind_to (count, list);
Jim Blandy's avatar
Jim Blandy committed
646
}
647

Andreas Schwab's avatar
Andreas Schwab committed
648
void
Jim Blandy's avatar
Jim Blandy committed
649 650
syms_of_undo ()
{
651 652 653
  Qinhibit_read_only = intern ("inhibit-read-only");
  staticpro (&Qinhibit_read_only);

Kim F. Storm's avatar
Kim F. Storm committed
654 655 656
  Qapply = intern ("apply");
  staticpro (&Qapply);

657 658 659
  pending_boundary = Qnil;
  staticpro (&pending_boundary);

Jim Blandy's avatar
Jim Blandy committed
660 661
  defsubr (&Sprimitive_undo);
  defsubr (&Sundo_boundary);
662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684

  DEFVAR_INT ("undo-limit", &undo_limit,
	      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.  */);
  undo_limit = 20000;

  DEFVAR_INT ("undo-strong-limit", &undo_strong_limit,
	      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.  */);
  undo_strong_limit = 30000;

685
  DEFVAR_LISP ("undo-outer-limit", &Vundo_outer_limit,
686 687
	      doc: /* Outer limit on size of undo information for one command.
At garbage collection time, if the current command has produced
688 689
more than this much undo information, it discards the info and displays
a warning.  This is a last-ditch limit to prevent memory overflow.
690

691 692 693 694
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.
695 696 697 698 699

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.  */);
700
  Vundo_outer_limit = make_number (3000000);
701 702 703 704 705 706 707 708 709 710 711

  DEFVAR_LISP ("undo-outer-limit-function", &Vundo_outer_limit_function,
	       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;
Jim Blandy's avatar
Jim Blandy committed
712
}
Miles Bader's avatar
Miles Bader committed
713 714 715

/* arch-tag: d546ee01-4aed-4ffb-bb8b-eefaae50d38a
   (do not change this comment) */