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

This file is part of GNU Emacs.

6 7 8 9 10
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
11
GNU Emacs is distributed in the hope that it will be useful,
12 13 14 15 16 17 18 19
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
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.  */
Jim Blandy's avatar
Jim Blandy committed
20 21


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

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

EMACS_INT undo_limit;
EMACS_INT undo_strong_limit;
31 32

Lisp_Object Vundo_outer_limit;
33 34 35 36 37

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

Lisp_Object Vundo_outer_limit_function;

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

41 42
Lisp_Object Qinhibit_read_only;

43 44 45 46 47 48 49
/* 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
50 51 52 53
/* 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
54

Stefan Monnier's avatar
Stefan Monnier committed
55 56
static void
record_point (pt)
Dave Love's avatar
Dave Love committed
57
     int pt;
Jim Blandy's avatar
Jim Blandy committed
58
{
Stefan Monnier's avatar
Stefan Monnier committed
59
  int at_boundary;
60

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

65 66
  if (!BUFFERP (last_undo_buffer)
      || current_buffer != XBUFFER (last_undo_buffer))
Jim Blandy's avatar
Jim Blandy committed
67
    Fundo_boundary ();
68
  XSETBUFFER (last_undo_buffer, current_buffer);
Jim Blandy's avatar
Jim Blandy committed
69

Stefan Monnier's avatar
Stefan Monnier committed
70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91
  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;

92
  if (MODIFF <= SAVE_MODIFF)
Jim Blandy's avatar
Jim Blandy committed
93 94
    record_first_change ();

95
  /* If we are just after an undo boundary, and
Stefan Monnier's avatar
Stefan Monnier committed
96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121
     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
122 123
  /* If this is following another insertion and consecutive with it
     in the buffer, combine the two.  */
124
  if (CONSP (current_buffer->undo_list))
Jim Blandy's avatar
Jim Blandy committed
125 126
    {
      Lisp_Object elt;
127
      elt = XCAR (current_buffer->undo_list);
128
      if (CONSP (elt)
129 130 131
	  && INTEGERP (XCAR (elt))
	  && INTEGERP (XCDR (elt))
	  && XINT (XCDR (elt)) == beg)
Jim Blandy's avatar
Jim Blandy committed
132
	{
133
	  XSETCDR (elt, make_number (beg + length));
Jim Blandy's avatar
Jim Blandy committed
134 135 136 137
	  return;
	}
    }

138 139
  XSETFASTINT (lbeg, beg);
  XSETINT (lend, beg + length);
140 141
  current_buffer->undo_list = Fcons (Fcons (lbeg, lend),
                                     current_buffer->undo_list);
Jim Blandy's avatar
Jim Blandy committed
142 143 144
}

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

147
void
148 149 150
record_delete (beg, string)
     int beg;
     Lisp_Object string;
Jim Blandy's avatar
Jim Blandy committed
151
{
152
  Lisp_Object sbeg;
Jim Blandy's avatar
Jim Blandy committed
153

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

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

Jim Blandy's avatar
Jim Blandy committed
168
  current_buffer->undo_list
169
    = Fcons (Fcons (string, sbeg), current_buffer->undo_list);
Jim Blandy's avatar
Jim Blandy committed
170 171
}

172 173 174 175 176
/* 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.  */

177
void
178 179 180 181 182 183 184 185 186 187 188
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);

189
  if (!BUFFERP (last_undo_buffer)
190
      || current_buffer != XBUFFER (last_undo_buffer))
191 192 193 194 195 196 197 198
    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
199 200
/* Record that a replacement is about to take place,
   for LENGTH characters at location BEG.
201
   The replacement must not change the number of characters.  */
Jim Blandy's avatar
Jim Blandy committed
202

203
void
Jim Blandy's avatar
Jim Blandy committed
204 205 206
record_change (beg, length)
     int beg, length;
{
207
  record_delete (beg, make_buffer_string (beg, beg + length, 1));
Jim Blandy's avatar
Jim Blandy committed
208 209 210 211 212 213 214
  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.  */

215
void
Jim Blandy's avatar
Jim Blandy committed
216 217 218
record_first_change ()
{
  Lisp_Object high, low;
219
  struct buffer *base_buffer = current_buffer;
220 221 222 223

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

224 225
  if (!BUFFERP (last_undo_buffer)
      || current_buffer != XBUFFER (last_undo_buffer))
226
    Fundo_boundary ();
227
  XSETBUFFER (last_undo_buffer, current_buffer);
228

229 230 231 232 233
  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
234 235 236
  current_buffer->undo_list = Fcons (Fcons (Qt, Fcons (high, low)), current_buffer->undo_list);
}

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 242 243 244 245 246 247 248
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;

249
  if (EQ (XBUFFER (buffer)->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 257 258 259 260 261 262 263 264 265
  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 ();

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

269 270
  XSETINT (lbeg, beg);
  XSETINT (lend, beg + length);
271 272 273 274 275 276
  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
277
DEFUN ("undo-boundary", Fundo_boundary, Sundo_boundary, 0, 0, 0,
278 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.  */)
     ()
Jim Blandy's avatar
Jim Blandy committed
282 283 284 285 286
{
  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
287
  if (!NILP (tem))
288 289 290 291 292 293
    {
      /* 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.  */
294
	  XSETCDR (pending_boundary, current_buffer->undo_list);
295 296 297 298 299 300
	  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
301 302 303 304
  return Qnil;
}

/* At garbage collection time, make an undo list shorter at the end,
305 306 307 308 309 310 311
   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
312
{
313
  Lisp_Object list;
Jim Blandy's avatar
Jim Blandy committed
314 315 316
  Lisp_Object prev, next, last_boundary;
  int size_so_far = 0;

317 318 319 320 321 322 323 324 325 326 327 328
  /* 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
329 330 331 332
  prev = Qnil;
  next = list;
  last_boundary = Qnil;

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

344 345 346 347 348 349
  /* 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.  */

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

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

      /* Advance to next element.  */
      prev = next;
367
      next = XCDR (next);
Jim Blandy's avatar
Jim Blandy committed
368
    }
369

370 371
  /* 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.  */
372 373
  if (INTEGERP (Vundo_outer_limit)
      && size_so_far > XINT (Vundo_outer_limit)
374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392
      && !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;
    }

393
  if (CONSP (next))
Jim Blandy's avatar
Jim Blandy committed
394 395
    last_boundary = prev;

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

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

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

      /* Advance to next element.  */
      prev = next;
427
      next = XCDR (next);
Jim Blandy's avatar
Jim Blandy committed
428 429 430
    }

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

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

Jim Blandy's avatar
Jim Blandy committed
454 455 456 457 458 459 460
#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
461
  if (NILP (tem))
Jim Blandy's avatar
Jim Blandy committed
462 463 464
    list = Fcdr (list);
#endif

465
  CHECK_NUMBER (n);
466 467 468 469
  arg = XINT (n);
  next = Qnil;
  GCPRO2 (next, list);

470 471 472
  /* In a writable buffer, enable undoing read-only text that is so
     because of text properties.  */
  if (NILP (current_buffer->read_only))
473 474
    specbind (Qinhibit_read_only, Qt);

475 476 477
  /* Don't let `intangible' properties interfere with undo.  */
  specbind (Qinhibit_point_motion_hooks, Qt);

Jim Blandy's avatar
Jim Blandy committed
478 479
  while (arg > 0)
    {
480
      while (CONSP (list))
Jim Blandy's avatar
Jim Blandy committed
481
	{
482 483
	  next = XCAR (list);
	  list = XCDR (list);
484
	  /* Exit inner loop at undo boundary.  */
Jim Blandy's avatar
Jim Blandy committed
485
	  if (NILP (next))
Jim Blandy's avatar
Jim Blandy committed
486
	    break;
487
	  /* Handle an integer by setting point to that value.  */
488
	  if (INTEGERP (next))
489
	    SET_PT (clip_to_bounds (BEGV, XINT (next), ZV));
490
	  else if (CONSP (next))
Jim Blandy's avatar
Jim Blandy committed
491
	    {
492 493
	      Lisp_Object car, cdr;

494 495
	      car = XCAR (next);
	      cdr = XCDR (next);
496
	      if (EQ (car, Qt))
Jim Blandy's avatar
Jim Blandy committed
497
		{
498 499 500
		  /* Element (t high . low) records previous modtime.  */
		  Lisp_Object high, low;
		  int mod_time;
501
		  struct buffer *base_buffer = current_buffer;
502 503 504

		  high = Fcar (cdr);
		  low = Fcdr (cdr);
505
		  mod_time = (XFASTINT (high) << 16) + XFASTINT (low);
506 507 508 509

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

510 511 512
		  /* If this records an obsolete save
		     (not matching the actual disk file)
		     then don't mark unmodified.  */
513
		  if (mod_time != base_buffer->modtime)
514
		    continue;
515
#ifdef CLASH_DETECTION
516
		  Funlock_buffer ();
517
#endif /* CLASH_DETECTION */
518
		  Fset_buffer_modified_p (Qnil);
Jim Blandy's avatar
Jim Blandy committed
519
		}
520
	      else if (EQ (car, Qnil))
521
		{
522
		  /* Element (nil prop val beg . end) is property change.  */
523 524 525 526 527 528 529 530 531 532 533
		  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);
		}
534
	      else if (INTEGERP (car) && INTEGERP (cdr))
Jim Blandy's avatar
Jim Blandy committed
535
		{
536 537 538 539
		  /* Element (BEG . END) means range was inserted.  */

		  if (XINT (car) < BEGV
		      || XINT (cdr) > ZV)
Jim Blandy's avatar
Jim Blandy committed
540
		    error ("Changes to be undone are outside visible portion of buffer");
541 542
		  /* Set point first thing, so that undoing this undo
		     does not send point back to where it is now.  */
543
		  Fgoto_char (car);
544
		  Fdelete_region (car, cdr);
545
		}
546
	      else if (STRINGP (car) && INTEGERP (cdr))
547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565
		{
		  /* 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);

566 567 568 569 570 571
		      /* 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);
572 573
		      SET_PT (pos);
		    }
Jim Blandy's avatar
Jim Blandy committed
574
		}
575 576 577 578 579 580 581 582 583
	      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
584 585 586 587 588
	    }
	}
      arg--;
    }

589
  UNGCPRO;
590
  return unbind_to (count, list);
Jim Blandy's avatar
Jim Blandy committed
591 592
}

Andreas Schwab's avatar
Andreas Schwab committed
593
void
Jim Blandy's avatar
Jim Blandy committed
594 595
syms_of_undo ()
{
596 597 598
  Qinhibit_read_only = intern ("inhibit-read-only");
  staticpro (&Qinhibit_read_only);

599 600 601
  pending_boundary = Qnil;
  staticpro (&pending_boundary);

Jim Blandy's avatar
Jim Blandy committed
602 603
  defsubr (&Sprimitive_undo);
  defsubr (&Sundo_boundary);
604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626

  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;

627
  DEFVAR_LISP ("undo-outer-limit", &Vundo_outer_limit,
628 629 630 631 632 633 634 635 636 637 638 639
	      doc: /* Outer limit on size of undo information for one command.
At garbage collection time, if the current command has produced
more than this much undo information, it asks you whether to delete
the information.  This is a last-ditch limit to prevent memory overflow.

The size is counted as the number of bytes occupied,
which includes both saved text and other data.

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.  */);
640
  Vundo_outer_limit = make_number (300000);
641 642 643 644 645 646 647 648 649 650 651

  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
652
}
Miles Bader's avatar
Miles Bader committed
653 654 655

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