1991-01-05 15:12:15 +00:00
|
|
|
|
/* Buffer insertion/deletion and gap motion for GNU Emacs.
|
1998-01-21 23:32:12 +00:00
|
|
|
|
Copyright (C) 1985, 86, 93, 94, 95, 97, 1998 Free Software Foundation, Inc.
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
This file is part of GNU Emacs.
|
|
|
|
|
|
|
|
|
|
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
|
1995-06-15 20:42:24 +00:00
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
1991-01-05 15:12:15 +00:00
|
|
|
|
any later version.
|
|
|
|
|
|
|
|
|
|
GNU Emacs is distributed in the hope that it will be useful,
|
|
|
|
|
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
|
1996-01-15 09:18:04 +00:00
|
|
|
|
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
|
|
Boston, MA 02111-1307, USA. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
|
1993-09-10 06:15:46 +00:00
|
|
|
|
#include <config.h>
|
1991-01-05 15:12:15 +00:00
|
|
|
|
#include "lisp.h"
|
1992-10-01 00:56:11 +00:00
|
|
|
|
#include "intervals.h"
|
1991-01-05 15:12:15 +00:00
|
|
|
|
#include "buffer.h"
|
1997-02-20 06:50:03 +00:00
|
|
|
|
#include "charset.h"
|
1991-01-05 15:12:15 +00:00
|
|
|
|
#include "window.h"
|
1993-04-07 22:11:21 +00:00
|
|
|
|
#include "blockinput.h"
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
#ifndef NULL
|
|
|
|
|
#define NULL 0
|
|
|
|
|
#endif
|
|
|
|
|
|
1995-05-05 03:02:02 +00:00
|
|
|
|
#define min(x, y) ((x) < (y) ? (x) : (y))
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
static void insert_from_string_1 P_ ((Lisp_Object, int, int, int, int, int, int));
|
1994-10-22 04:45:57 +00:00
|
|
|
|
static void insert_from_buffer_1 ();
|
1998-01-01 07:03:19 +00:00
|
|
|
|
static void gap_left P_ ((int, int, int));
|
|
|
|
|
static void gap_right P_ ((int, int));
|
|
|
|
|
static void adjust_markers_gap_motion P_ ((int, int, int));
|
|
|
|
|
static void adjust_markers_for_insert P_ ((int, int, int, int, int));
|
|
|
|
|
static void adjust_markers_for_delete P_ ((int, int, int, int));
|
|
|
|
|
static void adjust_point P_ ((int, int));
|
1994-04-08 00:44:35 +00:00
|
|
|
|
|
1996-11-09 21:36:00 +00:00
|
|
|
|
Lisp_Object Fcombine_after_change_execute ();
|
|
|
|
|
|
|
|
|
|
/* Non-nil means don't call the after-change-functions right away,
|
|
|
|
|
just record an element in Vcombine_after_change_calls_list. */
|
|
|
|
|
Lisp_Object Vcombine_after_change_calls;
|
|
|
|
|
|
|
|
|
|
/* List of elements of the form (BEG-UNCHANGED END-UNCHANGED CHANGE-AMOUNT)
|
|
|
|
|
describing changes which happened while combine_after_change_calls
|
|
|
|
|
was nonzero. We use this to decide how to call them
|
|
|
|
|
once the deferral ends.
|
|
|
|
|
|
|
|
|
|
In each element.
|
|
|
|
|
BEG-UNCHANGED is the number of chars before the changed range.
|
|
|
|
|
END-UNCHANGED is the number of chars after the changed range,
|
|
|
|
|
and CHANGE-AMOUNT is the number of characters inserted by the change
|
|
|
|
|
(negative for a deletion). */
|
|
|
|
|
Lisp_Object combine_after_change_list;
|
|
|
|
|
|
|
|
|
|
/* Buffer which combine_after_change_list is about. */
|
|
|
|
|
Lisp_Object combine_after_change_buffer;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Move gap to position CHARPOS.
|
1991-01-05 15:12:15 +00:00
|
|
|
|
Note that this can quit! */
|
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
move_gap (charpos)
|
|
|
|
|
int charpos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
move_gap_both (charpos, charpos_to_bytepos (charpos));
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Move gap to byte position BYTEPOS, which is also char position CHARPOS.
|
|
|
|
|
Note that this can quit! */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
move_gap_both (charpos, bytepos)
|
|
|
|
|
int charpos, bytepos;
|
|
|
|
|
{
|
|
|
|
|
if (bytepos < GPT_BYTE)
|
|
|
|
|
gap_left (charpos, bytepos, 0);
|
|
|
|
|
else if (bytepos > GPT_BYTE)
|
|
|
|
|
gap_right (charpos, bytepos);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Move the gap to a position less than the current GPT.
|
|
|
|
|
BYTEPOS describes the new position as a byte position,
|
|
|
|
|
and CHARPOS is the corresponding char position.
|
1991-01-05 15:12:15 +00:00
|
|
|
|
If NEWGAP is nonzero, then don't update beg_unchanged and end_unchanged. */
|
|
|
|
|
|
1994-04-26 02:11:35 +00:00
|
|
|
|
static void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_left (charpos, bytepos, newgap)
|
|
|
|
|
register int charpos, bytepos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
int newgap;
|
|
|
|
|
{
|
|
|
|
|
register unsigned char *to, *from;
|
|
|
|
|
register int i;
|
|
|
|
|
int new_s1;
|
|
|
|
|
|
|
|
|
|
if (!newgap)
|
|
|
|
|
{
|
1996-09-15 01:57:44 +00:00
|
|
|
|
if (unchanged_modified == MODIFF
|
|
|
|
|
&& overlay_unchanged_modified == OVERLAY_MODIFF)
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
beg_unchanged = charpos - BEG;
|
|
|
|
|
end_unchanged = Z - charpos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
if (Z - GPT < end_unchanged)
|
|
|
|
|
end_unchanged = Z - GPT;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (charpos < beg_unchanged)
|
|
|
|
|
beg_unchanged = charpos - BEG;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
i = GPT_BYTE;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
to = GAP_END_ADDR;
|
|
|
|
|
from = GPT_ADDR;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
new_s1 = GPT_BYTE;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Now copy the characters. To move the gap down,
|
|
|
|
|
copy characters up. */
|
|
|
|
|
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
|
|
|
|
/* I gets number of characters left to copy. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
i = new_s1 - bytepos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (i == 0)
|
|
|
|
|
break;
|
|
|
|
|
/* If a quit is requested, stop copying now.
|
1998-01-01 07:03:19 +00:00
|
|
|
|
Change BYTEPOS to be where we have actually moved the gap to. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (QUITP)
|
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
bytepos = new_s1;
|
|
|
|
|
charpos = BYTE_TO_CHAR (bytepos);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
/* Move at most 32000 chars before checking again for a quit. */
|
|
|
|
|
if (i > 32000)
|
|
|
|
|
i = 32000;
|
|
|
|
|
#ifdef GAP_USE_BCOPY
|
|
|
|
|
if (i >= 128
|
|
|
|
|
/* bcopy is safe if the two areas of memory do not overlap
|
|
|
|
|
or on systems where bcopy is always safe for moving upward. */
|
|
|
|
|
&& (BCOPY_UPWARD_SAFE
|
|
|
|
|
|| to - from >= 128))
|
|
|
|
|
{
|
|
|
|
|
/* If overlap is not safe, avoid it by not moving too many
|
|
|
|
|
characters at once. */
|
|
|
|
|
if (!BCOPY_UPWARD_SAFE && i > to - from)
|
|
|
|
|
i = to - from;
|
|
|
|
|
new_s1 -= i;
|
|
|
|
|
from -= i, to -= i;
|
|
|
|
|
bcopy (from, to, i);
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
new_s1 -= i;
|
|
|
|
|
while (--i >= 0)
|
|
|
|
|
*--to = *--from;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Adjust markers, and buffer data structure, to put the gap at BYTEPOS.
|
|
|
|
|
BYTEPOS is where the loop above stopped, which may be what was specified
|
1991-01-05 15:12:15 +00:00
|
|
|
|
or may be where a quit was detected. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_markers_gap_motion (bytepos, GPT_BYTE, GAP_SIZE);
|
|
|
|
|
GPT_BYTE = bytepos;
|
|
|
|
|
GPT = charpos;
|
|
|
|
|
if (bytepos < charpos)
|
|
|
|
|
abort ();
|
1997-02-20 06:50:03 +00:00
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
QUIT;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Move the gap to a position greater than than the current GPT.
|
|
|
|
|
BYTEPOS describes the new position as a byte position,
|
|
|
|
|
and CHARPOS is the corresponding char position. */
|
|
|
|
|
|
1994-04-26 02:11:35 +00:00
|
|
|
|
static void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_right (charpos, bytepos)
|
|
|
|
|
register int charpos, bytepos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
|
|
|
|
register unsigned char *to, *from;
|
|
|
|
|
register int i;
|
|
|
|
|
int new_s1;
|
|
|
|
|
|
1996-09-15 01:57:44 +00:00
|
|
|
|
if (unchanged_modified == MODIFF
|
|
|
|
|
&& overlay_unchanged_modified == OVERLAY_MODIFF)
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
beg_unchanged = charpos - BEG;
|
|
|
|
|
end_unchanged = Z - charpos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (Z - charpos - 1 < end_unchanged)
|
|
|
|
|
end_unchanged = Z - charpos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (GPT - BEG < beg_unchanged)
|
|
|
|
|
beg_unchanged = GPT - BEG;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
i = GPT_BYTE;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
from = GAP_END_ADDR;
|
|
|
|
|
to = GPT_ADDR;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
new_s1 = GPT_BYTE;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Now copy the characters. To move the gap up,
|
|
|
|
|
copy characters down. */
|
|
|
|
|
|
|
|
|
|
while (1)
|
|
|
|
|
{
|
|
|
|
|
/* I gets number of characters left to copy. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
i = bytepos - new_s1;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (i == 0)
|
|
|
|
|
break;
|
|
|
|
|
/* If a quit is requested, stop copying now.
|
1998-01-01 07:03:19 +00:00
|
|
|
|
Change BYTEPOS to be where we have actually moved the gap to. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (QUITP)
|
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
bytepos = new_s1;
|
|
|
|
|
charpos = BYTE_TO_CHAR (bytepos);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
/* Move at most 32000 chars before checking again for a quit. */
|
|
|
|
|
if (i > 32000)
|
|
|
|
|
i = 32000;
|
|
|
|
|
#ifdef GAP_USE_BCOPY
|
|
|
|
|
if (i >= 128
|
|
|
|
|
/* bcopy is safe if the two areas of memory do not overlap
|
|
|
|
|
or on systems where bcopy is always safe for moving downward. */
|
|
|
|
|
&& (BCOPY_DOWNWARD_SAFE
|
|
|
|
|
|| from - to >= 128))
|
|
|
|
|
{
|
|
|
|
|
/* If overlap is not safe, avoid it by not moving too many
|
|
|
|
|
characters at once. */
|
|
|
|
|
if (!BCOPY_DOWNWARD_SAFE && i > from - to)
|
|
|
|
|
i = from - to;
|
|
|
|
|
new_s1 += i;
|
|
|
|
|
bcopy (from, to, i);
|
|
|
|
|
from += i, to += i;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
#endif
|
|
|
|
|
{
|
|
|
|
|
new_s1 += i;
|
|
|
|
|
while (--i >= 0)
|
|
|
|
|
*to++ = *from++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_markers_gap_motion (GPT_BYTE + GAP_SIZE, bytepos + GAP_SIZE,
|
|
|
|
|
- GAP_SIZE);
|
|
|
|
|
GPT = charpos;
|
|
|
|
|
GPT_BYTE = bytepos;
|
|
|
|
|
if (bytepos < charpos)
|
|
|
|
|
abort ();
|
1997-02-20 06:50:03 +00:00
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
QUIT;
|
|
|
|
|
}
|
1998-01-09 22:46:07 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Add AMOUNT to the byte position of every marker in the current buffer
|
|
|
|
|
whose current byte position is between FROM (exclusive) and TO (inclusive).
|
1996-02-03 18:06:29 +00:00
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
Also, any markers past the outside of that interval, in the direction
|
|
|
|
|
of adjustment, are first moved back to the near end of the interval
|
1996-02-03 18:06:29 +00:00
|
|
|
|
and then adjusted by AMOUNT.
|
|
|
|
|
|
|
|
|
|
When the latter adjustment is done, if AMOUNT is negative,
|
|
|
|
|
we record the adjustment for undo. (This case happens only for
|
1998-01-01 07:03:19 +00:00
|
|
|
|
deletion.)
|
|
|
|
|
|
|
|
|
|
The markers' character positions are not altered,
|
|
|
|
|
because gap motion does not affect character positions. */
|
|
|
|
|
|
|
|
|
|
int adjust_markers_test;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1994-04-26 02:11:35 +00:00
|
|
|
|
static void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_markers_gap_motion (from, to, amount)
|
1991-01-05 15:12:15 +00:00
|
|
|
|
register int from, to, amount;
|
|
|
|
|
{
|
1998-01-02 21:29:48 +00:00
|
|
|
|
/* Now that a marker has a bytepos, not counting the gap,
|
|
|
|
|
nothing needs to be done here. */
|
|
|
|
|
#if 0
|
1991-01-05 15:12:15 +00:00
|
|
|
|
Lisp_Object marker;
|
|
|
|
|
register struct Lisp_Marker *m;
|
|
|
|
|
register int mpos;
|
|
|
|
|
|
1995-01-02 09:21:30 +00:00
|
|
|
|
marker = BUF_MARKERS (current_buffer);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1992-01-13 21:48:03 +00:00
|
|
|
|
while (!NILP (marker))
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
|
|
|
|
m = XMARKER (marker);
|
1998-01-02 21:29:48 +00:00
|
|
|
|
mpos = m->bytepos;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (amount > 0)
|
|
|
|
|
{
|
|
|
|
|
if (mpos > to && mpos < to + amount)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
{
|
|
|
|
|
if (adjust_markers_test)
|
|
|
|
|
abort ();
|
|
|
|
|
mpos = to + amount;
|
|
|
|
|
}
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1996-02-03 18:06:29 +00:00
|
|
|
|
/* Here's the case where a marker is inside text being deleted.
|
|
|
|
|
AMOUNT can be negative for gap motion, too,
|
|
|
|
|
but then this range contains no markers. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (mpos > from + amount && mpos <= from)
|
1996-02-03 18:06:29 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (adjust_markers_test)
|
|
|
|
|
abort ();
|
|
|
|
|
mpos = from + amount;
|
1996-02-03 18:06:29 +00:00
|
|
|
|
}
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
if (mpos > from && mpos <= to)
|
|
|
|
|
mpos += amount;
|
|
|
|
|
m->bufpos = mpos;
|
|
|
|
|
marker = m->chain;
|
|
|
|
|
}
|
1998-01-02 21:29:48 +00:00
|
|
|
|
#endif
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
1998-01-09 22:46:07 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Adjust all markers for a deletion
|
|
|
|
|
whose range in bytes is FROM_BYTE to TO_BYTE.
|
|
|
|
|
The range in charpos is FROM to TO.
|
|
|
|
|
|
|
|
|
|
This function assumes that the gap is adjacent to
|
|
|
|
|
or inside of the range being deleted. */
|
1995-09-03 18:51:47 +00:00
|
|
|
|
|
|
|
|
|
static void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_markers_for_delete (from, from_byte, to, to_byte)
|
|
|
|
|
register int from, from_byte, to, to_byte;
|
|
|
|
|
{
|
|
|
|
|
Lisp_Object marker;
|
|
|
|
|
register struct Lisp_Marker *m;
|
|
|
|
|
register int charpos;
|
|
|
|
|
/* This is what GAP_SIZE will be when this deletion is finished. */
|
|
|
|
|
int coming_gap_size = GAP_SIZE + to_byte - from_byte;
|
|
|
|
|
|
|
|
|
|
marker = BUF_MARKERS (current_buffer);
|
|
|
|
|
|
|
|
|
|
while (!NILP (marker))
|
|
|
|
|
{
|
|
|
|
|
m = XMARKER (marker);
|
|
|
|
|
charpos = m->charpos;
|
|
|
|
|
|
|
|
|
|
if (charpos > Z)
|
|
|
|
|
abort ();
|
|
|
|
|
|
|
|
|
|
/* If the marker is after the deletion,
|
1998-01-02 21:29:48 +00:00
|
|
|
|
relocate by number of chars / bytes deleted. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (charpos > to)
|
1998-01-02 21:29:48 +00:00
|
|
|
|
{
|
|
|
|
|
m->charpos -= to - from;
|
|
|
|
|
m->bytepos -= to_byte - from_byte;
|
|
|
|
|
}
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
1998-01-02 21:29:48 +00:00
|
|
|
|
/* Here's the case where a marker is inside text being deleted. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
else if (charpos > from)
|
|
|
|
|
{
|
|
|
|
|
record_marker_adjustment (marker, from - charpos);
|
|
|
|
|
m->charpos = from;
|
1998-01-02 21:29:48 +00:00
|
|
|
|
m->bytepos = from_byte;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* In a single-byte buffer, a marker's two positions must be equal. */
|
|
|
|
|
if (Z == Z_BYTE)
|
|
|
|
|
{
|
1998-01-02 21:29:48 +00:00
|
|
|
|
register int i = m->bytepos;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
1998-01-02 21:29:48 +00:00
|
|
|
|
#if 0
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* We use FROM_BYTE here instead of GPT_BYTE
|
|
|
|
|
because FROM_BYTE is where the gap will be after the deletion. */
|
|
|
|
|
if (i > from_byte + coming_gap_size)
|
|
|
|
|
i -= coming_gap_size;
|
|
|
|
|
else if (i > from_byte)
|
|
|
|
|
i = from_byte;
|
1998-01-02 21:29:48 +00:00
|
|
|
|
#endif
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
if (m->charpos != i)
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
marker = m->chain;
|
|
|
|
|
}
|
|
|
|
|
}
|
1998-01-09 22:46:07 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Adjust markers for an insertion at CHARPOS / BYTEPOS
|
|
|
|
|
consisting of NCHARS chars, which are NBYTES bytes.
|
|
|
|
|
|
|
|
|
|
We have to relocate the charpos of every marker that points
|
1998-01-02 21:29:48 +00:00
|
|
|
|
after the insertion (but not their bytepos).
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
When a marker points at the insertion point,
|
|
|
|
|
we advance it if either its insertion-type is t
|
|
|
|
|
or BEFORE_MARKERS is true. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
adjust_markers_for_insert (from, from_byte, to, to_byte, before_markers)
|
|
|
|
|
register int from, from_byte, to, to_byte, before_markers;
|
1995-09-03 18:51:47 +00:00
|
|
|
|
{
|
|
|
|
|
Lisp_Object marker;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
int adjusted = 0;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int nchars = to - from;
|
|
|
|
|
int nbytes = to_byte - from_byte;
|
1995-09-03 18:51:47 +00:00
|
|
|
|
|
|
|
|
|
marker = BUF_MARKERS (current_buffer);
|
|
|
|
|
|
|
|
|
|
while (!NILP (marker))
|
|
|
|
|
{
|
|
|
|
|
register struct Lisp_Marker *m = XMARKER (marker);
|
1998-01-02 21:29:48 +00:00
|
|
|
|
if (m->bytepos == from_byte
|
1998-01-01 07:03:19 +00:00
|
|
|
|
&& (m->insertion_type || before_markers))
|
1997-02-20 06:50:03 +00:00
|
|
|
|
{
|
1998-01-02 21:29:48 +00:00
|
|
|
|
m->bytepos += nbytes;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
m->charpos += nchars;
|
|
|
|
|
if (m->insertion_type)
|
|
|
|
|
adjusted = 1;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
}
|
1998-01-02 21:29:48 +00:00
|
|
|
|
else if (m->bytepos > from_byte)
|
|
|
|
|
{
|
|
|
|
|
m->bytepos += nbytes;
|
|
|
|
|
m->charpos += nchars;
|
|
|
|
|
}
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
/* In a single-byte buffer, a marker's two positions must be equal. */
|
|
|
|
|
if (Z == Z_BYTE)
|
|
|
|
|
{
|
1998-01-02 21:29:48 +00:00
|
|
|
|
register int i = m->bytepos;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
1998-01-02 21:29:48 +00:00
|
|
|
|
#if 0
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (i > GPT_BYTE + GAP_SIZE)
|
|
|
|
|
i -= GAP_SIZE;
|
|
|
|
|
else if (i > GPT_BYTE)
|
|
|
|
|
i = GPT_BYTE;
|
1998-01-02 21:29:48 +00:00
|
|
|
|
#endif
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
if (m->charpos != i)
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
|
1995-09-03 18:51:47 +00:00
|
|
|
|
marker = m->chain;
|
|
|
|
|
}
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
/* Adjusting only markers whose insertion-type is t may result in
|
|
|
|
|
disordered overlays in the slot `overlays_before'. */
|
1997-02-20 06:50:03 +00:00
|
|
|
|
if (adjusted)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
fix_overlays_before (current_buffer, from, to);
|
1995-09-03 18:51:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Adjust point for an insertion of NBYTES bytes, which are NCHARS characters.
|
|
|
|
|
|
|
|
|
|
This is used only when the value of point changes due to an insert
|
|
|
|
|
or delete; it does not represent a conceptual change in point as a
|
|
|
|
|
marker. In particular, point is not crossing any interval
|
|
|
|
|
boundaries, so there's no need to use the usual SET_PT macro. In
|
|
|
|
|
fact it would be incorrect to do so, because either the old or the
|
|
|
|
|
new value of point is out of sync with the current set of
|
|
|
|
|
intervals. */
|
|
|
|
|
|
1994-04-26 02:22:52 +00:00
|
|
|
|
static void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_point (nchars, nbytes)
|
|
|
|
|
int nchars, nbytes;
|
1994-04-26 02:22:52 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
BUF_PT (current_buffer) += nchars;
|
|
|
|
|
BUF_PT_BYTE (current_buffer) += nbytes;
|
|
|
|
|
|
|
|
|
|
/* In a single-byte buffer, the two positions must be equal. */
|
|
|
|
|
if (ZV == ZV_BYTE
|
|
|
|
|
&& PT != PT_BYTE)
|
|
|
|
|
abort ();
|
1994-04-26 02:22:52 +00:00
|
|
|
|
}
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Make the gap NBYTES_ADDED bytes longer. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
make_gap (nbytes_added)
|
|
|
|
|
int nbytes_added;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
|
|
|
|
unsigned char *result;
|
|
|
|
|
Lisp_Object tem;
|
|
|
|
|
int real_gap_loc;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int real_gap_loc_byte;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
int old_gap_size;
|
|
|
|
|
|
|
|
|
|
/* If we have to get more space, get enough to last a while. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
nbytes_added += 2000;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-05-04 22:16:18 +00:00
|
|
|
|
/* Don't allow a buffer size that won't fit in an int
|
|
|
|
|
even if it will fit in a Lisp integer.
|
|
|
|
|
That won't work because so many places use `int'. */
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (Z_BYTE - BEG_BYTE + GAP_SIZE + nbytes_added
|
1995-10-31 02:34:16 +00:00
|
|
|
|
>= ((unsigned) 1 << (min (BITS_PER_INT, VALBITS) - 1)))
|
1995-05-05 03:02:02 +00:00
|
|
|
|
error ("Buffer exceeds maximum size");
|
1995-05-04 22:16:18 +00:00
|
|
|
|
|
Put interrupt input blocking in a separate file from xterm.h.
This isn't specific to X, and it allows us to avoid #including
xterm.h in files that don't really have anything to do with X.
* blockinput.h: New file.
* xterm.h (BLOCK_INPUT, UNBLOCK_INPUT, TOTALLY_UNBLOCK_INPUT,
UNBLOCK_INPUT_RESIGNAL): These are now in blockinput.h.
(x_input_blocked, x_pending_input): Deleted; there are analogs
in blockinput.h called interrupt_input_blocked and
interrupt_input_pending.
* keyboard.c (interrupt_input_blocked, interrupt_input_pending):
New variables, used by the macros in blockinput.h.
* xterm.c: #include blockinput.h.
(x_input_blocked, x_pending_input): Deleted.
(XTread_socket): Test and set interrupt_input_blocked and
interrupt_input_pending instead of the old variables.
* alloc.c, xfaces.c, xfns.c, xmenu.c, xselect.c, keymap.c:
#include blockinput.h.
* eval.c: #include blockinput.h instead of xterm.h.
* keyboard.c: #include blockinput.h.
(input_poll_signal): Just test
interrupt_input_blocked, instead of testing HAVE_X_WINDOWS and
x_input_blocked.
Block the processing of interrupt input while we're manipulating the
malloc heap.
* alloc.c: (xfree): New function, to make it easy to free things
safely.
(xmalloc, xrealloc): Block X input while doing the deed.
(VALIDATE_LISP_STORAGE, gc_sweep, compact_strings): Use xfree
instead of free.
(uninterrupt_malloc): New function, to install input-blocking
hooks into the GNU malloc routines.
* emacs.c [not SYSTEM_MALLOC] (main): Call uninterrupt_malloc
on startup.
* alloc.c: (make_interval, make_float, Fcons, Fmake_vector,
Fmake_symbol, Fmake_marker, make_uninit_string, Fgarbage_collect):
Use xmalloc instead of malloc; don't bother to check if out of
memory here.
(Fgarbage_collect): Call xrealloc instead of realloc.
* buffer.c: Use xmalloc and xfree instead of malloc and free;
don't bother to check if out of memory here.
(Fget_buffer_create): Put BLOCK_INPUT/UNBLOCK_INPUT pair around
calls to ralloc routines.
* insdel.c: Same.
* lisp.h (xfree): New extern declaration.
* xfaces.c (xfree): Don't #define this to be free; use the
definition in alloc.c.
* dispnew.c, doc.c, doprnt.c, fileio.c, lread.c, term.c, xfns.c,
xmenu.c, xterm.c: Use xfree instead of free.
* hftctl.c: Use xfree and xmalloc instead of free and malloc.
* keymap.c (current_minor_maps): BLOCK_INPUT while calling realloc
and malloc.
* search.c: Since the regexp routines can malloc, BLOCK_INPUT
while runing them. #include blockinput.h.
* sysdep.c: #include blockinput.h. Call xfree and xmalloc instead
of free and malloc. BLOCK_INPUT around routines which we know
will call malloc.
ymakefile (keyboard.o, keymap.o, search.o, sysdep.o, xfaces.o,
xfns.o, xmenu.o, xterm.o, xselect.o, alloc.o, eval.o): Note that
these depend on blockinput.h.
1993-03-31 10:55:33 +00:00
|
|
|
|
BLOCK_INPUT;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
/* We allocate extra 1-byte `\0' at the tail for anchoring a search. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
result = BUFFER_REALLOC (BEG_ADDR, (Z_BYTE - BEG_BYTE
|
|
|
|
|
+ GAP_SIZE + nbytes_added + 1));
|
Put interrupt input blocking in a separate file from xterm.h.
This isn't specific to X, and it allows us to avoid #including
xterm.h in files that don't really have anything to do with X.
* blockinput.h: New file.
* xterm.h (BLOCK_INPUT, UNBLOCK_INPUT, TOTALLY_UNBLOCK_INPUT,
UNBLOCK_INPUT_RESIGNAL): These are now in blockinput.h.
(x_input_blocked, x_pending_input): Deleted; there are analogs
in blockinput.h called interrupt_input_blocked and
interrupt_input_pending.
* keyboard.c (interrupt_input_blocked, interrupt_input_pending):
New variables, used by the macros in blockinput.h.
* xterm.c: #include blockinput.h.
(x_input_blocked, x_pending_input): Deleted.
(XTread_socket): Test and set interrupt_input_blocked and
interrupt_input_pending instead of the old variables.
* alloc.c, xfaces.c, xfns.c, xmenu.c, xselect.c, keymap.c:
#include blockinput.h.
* eval.c: #include blockinput.h instead of xterm.h.
* keyboard.c: #include blockinput.h.
(input_poll_signal): Just test
interrupt_input_blocked, instead of testing HAVE_X_WINDOWS and
x_input_blocked.
Block the processing of interrupt input while we're manipulating the
malloc heap.
* alloc.c: (xfree): New function, to make it easy to free things
safely.
(xmalloc, xrealloc): Block X input while doing the deed.
(VALIDATE_LISP_STORAGE, gc_sweep, compact_strings): Use xfree
instead of free.
(uninterrupt_malloc): New function, to install input-blocking
hooks into the GNU malloc routines.
* emacs.c [not SYSTEM_MALLOC] (main): Call uninterrupt_malloc
on startup.
* alloc.c: (make_interval, make_float, Fcons, Fmake_vector,
Fmake_symbol, Fmake_marker, make_uninit_string, Fgarbage_collect):
Use xmalloc instead of malloc; don't bother to check if out of
memory here.
(Fgarbage_collect): Call xrealloc instead of realloc.
* buffer.c: Use xmalloc and xfree instead of malloc and free;
don't bother to check if out of memory here.
(Fget_buffer_create): Put BLOCK_INPUT/UNBLOCK_INPUT pair around
calls to ralloc routines.
* insdel.c: Same.
* lisp.h (xfree): New extern declaration.
* xfaces.c (xfree): Don't #define this to be free; use the
definition in alloc.c.
* dispnew.c, doc.c, doprnt.c, fileio.c, lread.c, term.c, xfns.c,
xmenu.c, xterm.c: Use xfree instead of free.
* hftctl.c: Use xfree and xmalloc instead of free and malloc.
* keymap.c (current_minor_maps): BLOCK_INPUT while calling realloc
and malloc.
* search.c: Since the regexp routines can malloc, BLOCK_INPUT
while runing them. #include blockinput.h.
* sysdep.c: #include blockinput.h. Call xfree and xmalloc instead
of free and malloc. BLOCK_INPUT around routines which we know
will call malloc.
ymakefile (keyboard.o, keymap.o, search.o, sysdep.o, xfaces.o,
xfns.o, xmenu.o, xterm.o, xselect.o, alloc.o, eval.o): Note that
these depend on blockinput.h.
1993-03-31 10:55:33 +00:00
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (result == 0)
|
1994-10-07 17:40:50 +00:00
|
|
|
|
{
|
|
|
|
|
UNBLOCK_INPUT;
|
|
|
|
|
memory_full ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* We can't unblock until the new address is properly stored. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
BEG_ADDR = result;
|
1994-10-07 17:40:50 +00:00
|
|
|
|
UNBLOCK_INPUT;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Prevent quitting in move_gap. */
|
|
|
|
|
tem = Vinhibit_quit;
|
|
|
|
|
Vinhibit_quit = Qt;
|
|
|
|
|
|
|
|
|
|
real_gap_loc = GPT;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
real_gap_loc_byte = GPT_BYTE;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
old_gap_size = GAP_SIZE;
|
|
|
|
|
|
|
|
|
|
/* Call the newly allocated space a gap at the end of the whole space. */
|
|
|
|
|
GPT = Z + GAP_SIZE;
|
1998-01-02 23:12:03 +00:00
|
|
|
|
GPT_BYTE = Z_BYTE + GAP_SIZE;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GAP_SIZE = nbytes_added;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Move the new gap down to be consecutive with the end of the old one.
|
|
|
|
|
This adjusts the markers properly too. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_left (real_gap_loc + old_gap_size, real_gap_loc_byte + old_gap_size, 1);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Now combine the two into one large gap. */
|
|
|
|
|
GAP_SIZE += old_gap_size;
|
|
|
|
|
GPT = real_gap_loc;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GPT_BYTE = real_gap_loc_byte;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1997-02-20 06:50:03 +00:00
|
|
|
|
/* Put an anchor. */
|
|
|
|
|
*(Z_ADDR) = 0;
|
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
Vinhibit_quit = tem;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Copy NBYTES bytes of text from FROM_ADDR to TO_ADDR.
|
|
|
|
|
FROM_MULTIBYTE says whether the incoming text is multibyte.
|
|
|
|
|
TO_MULTIBYTE says whether to store the text as multibyte.
|
|
|
|
|
If FROM_MULTIBYTE != TO_MULTIBYTE, we convert.
|
|
|
|
|
|
|
|
|
|
Return the number of bytes stored at TO_ADDR. */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
copy_text (from_addr, to_addr, nbytes,
|
|
|
|
|
from_multibyte, to_multibyte)
|
|
|
|
|
unsigned char *from_addr;
|
|
|
|
|
unsigned char *to_addr;
|
|
|
|
|
int nbytes;
|
|
|
|
|
int from_multibyte, to_multibyte;
|
|
|
|
|
{
|
|
|
|
|
if (from_multibyte == to_multibyte)
|
|
|
|
|
{
|
|
|
|
|
bcopy (from_addr, to_addr, nbytes);
|
|
|
|
|
return nbytes;
|
|
|
|
|
}
|
|
|
|
|
else if (from_multibyte)
|
|
|
|
|
{
|
|
|
|
|
int nchars = 0;
|
|
|
|
|
int bytes_left = nbytes;
|
|
|
|
|
|
|
|
|
|
/* Convert multibyte to single byte. */
|
|
|
|
|
while (bytes_left > 0)
|
|
|
|
|
{
|
|
|
|
|
int thislen, c;
|
|
|
|
|
c = STRING_CHAR_AND_LENGTH (from_addr, bytes_left, thislen);
|
1998-02-04 11:23:28 +00:00
|
|
|
|
*to_addr++ = SINGLE_BYTE_CHAR_P (c) ? c : (c & 0177) + 0200;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
from_addr += thislen;
|
|
|
|
|
bytes_left--;
|
|
|
|
|
nchars++;
|
|
|
|
|
}
|
|
|
|
|
return nchars;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
unsigned char *initial_to_addr = to_addr;
|
|
|
|
|
|
|
|
|
|
/* Convert single-byte to multibyte. */
|
|
|
|
|
while (nbytes > 0)
|
|
|
|
|
{
|
|
|
|
|
int c = *from_addr++;
|
|
|
|
|
unsigned char workbuf[4], *str;
|
|
|
|
|
int len;
|
|
|
|
|
|
1998-03-03 01:29:16 +00:00
|
|
|
|
if (c >= 0240 && c < 0400)
|
1998-01-09 22:46:07 +00:00
|
|
|
|
{
|
1998-03-03 01:29:16 +00:00
|
|
|
|
c = unibyte_char_to_multibyte (c);
|
1998-01-09 22:46:07 +00:00
|
|
|
|
len = CHAR_STRING (c, workbuf, str);
|
|
|
|
|
bcopy (str, to_addr, len);
|
|
|
|
|
to_addr += len;
|
|
|
|
|
nbytes--;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
/* Special case for speed. */
|
|
|
|
|
*to_addr++ = c, nbytes--;
|
|
|
|
|
}
|
|
|
|
|
return to_addr - initial_to_addr;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the number of bytes it would take
|
|
|
|
|
to convert some single-byte text to multibyte.
|
|
|
|
|
The single-byte text consists of NBYTES bytes at PTR. */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
count_size_as_multibyte (ptr, nbytes)
|
|
|
|
|
unsigned char *ptr;
|
|
|
|
|
int nbytes;
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
int outgoing_nbytes = 0;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < nbytes; i++)
|
|
|
|
|
{
|
|
|
|
|
unsigned int c = *ptr++;
|
1998-03-03 01:29:16 +00:00
|
|
|
|
|
|
|
|
|
if (c < 0240)
|
|
|
|
|
outgoing_nbytes++;
|
|
|
|
|
else
|
1998-01-09 22:46:07 +00:00
|
|
|
|
{
|
1998-03-03 01:29:16 +00:00
|
|
|
|
c = unibyte_char_to_multibyte (c);
|
|
|
|
|
outgoing_nbytes += XINT (Fchar_bytes (make_number (c)));
|
1998-01-09 22:46:07 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return outgoing_nbytes;
|
|
|
|
|
}
|
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
/* Insert a string of specified length before point.
|
1998-01-09 22:46:07 +00:00
|
|
|
|
This function judges multibyteness based on
|
|
|
|
|
enable_multibyte_characters in the current buffer;
|
|
|
|
|
it never converts between single-byte and multibyte.
|
|
|
|
|
|
1994-10-22 04:45:57 +00:00
|
|
|
|
DO NOT use this for the contents of a Lisp string or a Lisp buffer!
|
|
|
|
|
prepare_to_modify_buffer could relocate the text. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
insert (string, nbytes)
|
1991-01-05 15:12:15 +00:00
|
|
|
|
register unsigned char *string;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
register nbytes;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (nbytes > 0)
|
1994-04-08 00:44:35 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int opoint = PT;
|
|
|
|
|
insert_1 (string, nbytes, 0, 1, 0);
|
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
1994-08-28 06:07:37 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Likewise, but inherit text properties from neighboring characters. */
|
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
insert_and_inherit (string, nbytes)
|
1994-08-28 06:07:37 +00:00
|
|
|
|
register unsigned char *string;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
register nbytes;
|
1994-08-28 06:07:37 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (nbytes > 0)
|
1994-08-28 06:07:37 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int opoint = PT;
|
|
|
|
|
insert_1 (string, nbytes, 1, 1, 0);
|
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
1994-04-08 00:44:35 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Insert the character C before point. Do not inherit text properties. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
insert_char (c)
|
|
|
|
|
int c;
|
|
|
|
|
{
|
|
|
|
|
unsigned char workbuf[4], *str;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
int len;
|
|
|
|
|
|
|
|
|
|
if (! NILP (current_buffer->enable_multibyte_characters))
|
|
|
|
|
len = CHAR_STRING (c, workbuf, str);
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
len = 1;
|
|
|
|
|
workbuf[0] = c;
|
|
|
|
|
str = workbuf;
|
|
|
|
|
}
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
insert (str, len);
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Insert the null-terminated string S before point. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
insert_string (s)
|
|
|
|
|
char *s;
|
|
|
|
|
{
|
|
|
|
|
insert (s, strlen (s));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Like `insert' except that all markers pointing at the place where
|
|
|
|
|
the insertion happens are adjusted to point after it.
|
|
|
|
|
Don't use this function to insert part of a Lisp string,
|
|
|
|
|
since gc could happen and relocate it. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
insert_before_markers (string, nbytes)
|
|
|
|
|
unsigned char *string;
|
|
|
|
|
register int nbytes;
|
|
|
|
|
{
|
|
|
|
|
if (nbytes > 0)
|
|
|
|
|
{
|
|
|
|
|
int opoint = PT;
|
|
|
|
|
|
|
|
|
|
insert_1 (string, nbytes, 0, 1, 1);
|
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Likewise, but inherit text properties from neighboring characters. */
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
void
|
|
|
|
|
insert_before_markers_and_inherit (string, nbytes)
|
|
|
|
|
unsigned char *string;
|
|
|
|
|
register int nbytes;
|
|
|
|
|
{
|
|
|
|
|
if (nbytes > 0)
|
|
|
|
|
{
|
|
|
|
|
int opoint = PT;
|
|
|
|
|
|
|
|
|
|
insert_1 (string, nbytes, 1, 1, 1);
|
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
|
|
|
|
}
|
|
|
|
|
}
|
1998-01-09 22:46:07 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Subroutine used by the insert functions above. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
insert_1 (string, nbytes, inherit, prepare, before_markers)
|
1994-04-08 00:44:35 +00:00
|
|
|
|
register unsigned char *string;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
register int nbytes;
|
|
|
|
|
int inherit, prepare, before_markers;
|
1994-04-08 00:44:35 +00:00
|
|
|
|
{
|
|
|
|
|
register Lisp_Object temp;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int nchars = chars_in_text (string, nbytes);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
if (prepare)
|
1997-06-25 06:50:16 +00:00
|
|
|
|
prepare_to_modify_buffer (PT, PT, NULL);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1994-04-26 02:11:35 +00:00
|
|
|
|
if (PT != GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
move_gap_both (PT, PT_BYTE);
|
|
|
|
|
if (GAP_SIZE < nbytes)
|
|
|
|
|
make_gap (nbytes - GAP_SIZE);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
record_insert (PT, nchars);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
MODIFF++;
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
bcopy (string, GPT_ADDR, nbytes);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1994-09-02 23:30:24 +00:00
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
1995-01-02 09:21:30 +00:00
|
|
|
|
if (BUF_INTERVALS (current_buffer) != 0)
|
1994-09-02 23:30:24 +00:00
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
offset_intervals (current_buffer, PT, nchars);
|
1994-09-02 23:30:24 +00:00
|
|
|
|
#endif
|
1992-10-01 00:56:11 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GAP_SIZE -= nbytes;
|
|
|
|
|
GPT += nchars;
|
|
|
|
|
ZV += nchars;
|
|
|
|
|
Z += nchars;
|
|
|
|
|
GPT_BYTE += nbytes;
|
|
|
|
|
ZV_BYTE += nbytes;
|
|
|
|
|
Z_BYTE += nbytes;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_overlays_for_insert (PT, nchars);
|
|
|
|
|
adjust_markers_for_insert (PT, PT_BYTE, PT + nchars, PT_BYTE + nbytes,
|
|
|
|
|
before_markers);
|
|
|
|
|
adjust_point (nchars, nbytes);
|
|
|
|
|
|
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
1994-08-28 06:07:37 +00:00
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
|
|
|
|
if (!inherit && BUF_INTERVALS (current_buffer) != 0)
|
|
|
|
|
Fset_text_properties (make_number (PT - nchars), make_number (PT),
|
|
|
|
|
Qnil, Qnil);
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Insert a sequence of NCHARS chars which occupy NBYTES bytes
|
|
|
|
|
starting at STRING. INHERIT, PREPARE and BEFORE_MARKERS
|
|
|
|
|
are the same as in insert_1. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
insert_1_both (string, nchars, nbytes, inherit, prepare, before_markers)
|
|
|
|
|
register unsigned char *string;
|
|
|
|
|
register int nchars, nbytes;
|
|
|
|
|
int inherit, prepare, before_markers;
|
|
|
|
|
{
|
|
|
|
|
register Lisp_Object temp;
|
|
|
|
|
|
1998-03-03 07:18:46 +00:00
|
|
|
|
if (NILP (current_buffer->enable_multibyte_characters))
|
|
|
|
|
nchars = nbytes;
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
if (prepare)
|
|
|
|
|
prepare_to_modify_buffer (PT, PT, NULL);
|
|
|
|
|
|
|
|
|
|
if (PT != GPT)
|
|
|
|
|
move_gap_both (PT, PT_BYTE);
|
|
|
|
|
if (GAP_SIZE < nbytes)
|
|
|
|
|
make_gap (nbytes - GAP_SIZE);
|
|
|
|
|
|
|
|
|
|
record_insert (PT, nchars);
|
|
|
|
|
MODIFF++;
|
|
|
|
|
|
|
|
|
|
bcopy (string, GPT_ADDR, nbytes);
|
|
|
|
|
|
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
|
|
|
|
if (BUF_INTERVALS (current_buffer) != 0)
|
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES. */
|
|
|
|
|
offset_intervals (current_buffer, PT, nchars);
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
GAP_SIZE -= nbytes;
|
|
|
|
|
GPT += nchars;
|
|
|
|
|
ZV += nchars;
|
|
|
|
|
Z += nchars;
|
|
|
|
|
GPT_BYTE += nbytes;
|
|
|
|
|
ZV_BYTE += nbytes;
|
|
|
|
|
Z_BYTE += nbytes;
|
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
|
|
|
|
adjust_overlays_for_insert (PT, nchars);
|
|
|
|
|
adjust_markers_for_insert (PT, PT_BYTE, PT + nchars, PT_BYTE + nbytes,
|
|
|
|
|
before_markers);
|
|
|
|
|
adjust_point (nchars, nbytes);
|
|
|
|
|
|
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
|
|
|
|
|
1994-09-02 23:30:24 +00:00
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
1995-01-02 09:21:30 +00:00
|
|
|
|
if (!inherit && BUF_INTERVALS (current_buffer) != 0)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
Fset_text_properties (make_number (PT - nchars), make_number (PT),
|
1994-08-28 06:07:37 +00:00
|
|
|
|
Qnil, Qnil);
|
1994-09-02 23:30:24 +00:00
|
|
|
|
#endif
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
1992-10-01 00:56:11 +00:00
|
|
|
|
/* Insert the part of the text of STRING, a Lisp object assumed to be
|
1998-01-09 22:46:07 +00:00
|
|
|
|
of type string, consisting of the LENGTH characters (LENGTH_BYTE bytes)
|
|
|
|
|
starting at position POS / POS_BYTE. If the text of STRING has properties,
|
|
|
|
|
copy them into the buffer.
|
1992-10-01 00:56:11 +00:00
|
|
|
|
|
|
|
|
|
It does not work to use `insert' for this, because a GC could happen
|
1991-05-08 06:23:29 +00:00
|
|
|
|
before we bcopy the stuff into the buffer, and relocate the string
|
|
|
|
|
without insert noticing. */
|
1992-10-01 00:56:11 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-09 22:46:07 +00:00
|
|
|
|
insert_from_string (string, pos, pos_byte, length, length_byte, inherit)
|
1991-01-05 15:12:15 +00:00
|
|
|
|
Lisp_Object string;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
register int pos, pos_byte, length, length_byte;
|
1993-09-14 12:08:02 +00:00
|
|
|
|
int inherit;
|
1994-04-08 00:44:35 +00:00
|
|
|
|
{
|
|
|
|
|
if (length > 0)
|
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int opoint = PT;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
insert_from_string_1 (string, pos, pos_byte, length, length_byte,
|
|
|
|
|
inherit, 0);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
1994-04-08 00:44:35 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Like `insert_from_string' except that all markers pointing
|
|
|
|
|
at the place where the insertion happens are adjusted to point after it. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
void
|
1998-01-09 22:46:07 +00:00
|
|
|
|
insert_from_string_before_markers (string, pos, pos_byte,
|
|
|
|
|
length, length_byte, inherit)
|
1994-04-08 00:44:35 +00:00
|
|
|
|
Lisp_Object string;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
register int pos, pos_byte, length, length_byte;
|
1994-04-08 00:44:35 +00:00
|
|
|
|
int inherit;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
{
|
|
|
|
|
if (length > 0)
|
|
|
|
|
{
|
|
|
|
|
int opoint = PT;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
insert_from_string_1 (string, pos, pos_byte, length, length_byte,
|
|
|
|
|
inherit, 1);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Subroutine of the insertion functions above. */
|
|
|
|
|
|
|
|
|
|
static void
|
1998-01-09 22:46:07 +00:00
|
|
|
|
insert_from_string_1 (string, pos, pos_byte, nchars, nbytes,
|
|
|
|
|
inherit, before_markers)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
Lisp_Object string;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
register int pos, pos_byte, nchars, nbytes;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int inherit, before_markers;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
|
|
|
|
register Lisp_Object temp;
|
|
|
|
|
struct gcpro gcpro1;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
int outgoing_nbytes = nbytes;
|
|
|
|
|
|
|
|
|
|
/* Make OUTGOING_NBYTES describe the text
|
|
|
|
|
as it will be inserted in this buffer. */
|
|
|
|
|
|
|
|
|
|
if (NILP (current_buffer->enable_multibyte_characters))
|
|
|
|
|
outgoing_nbytes = nchars;
|
|
|
|
|
else if (nchars == nbytes)
|
|
|
|
|
outgoing_nbytes
|
|
|
|
|
= count_size_as_multibyte (&XSTRING (string)->data[pos_byte],
|
|
|
|
|
nbytes);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Make sure point-max won't overflow after this insertion. */
|
1998-01-09 22:46:07 +00:00
|
|
|
|
XSETINT (temp, outgoing_nbytes + Z);
|
|
|
|
|
if (outgoing_nbytes + Z != XINT (temp))
|
1998-01-01 07:03:19 +00:00
|
|
|
|
error ("Maximum buffer size exceeded");
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
GCPRO1 (string);
|
1997-06-25 06:50:16 +00:00
|
|
|
|
prepare_to_modify_buffer (PT, PT, NULL);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1994-04-26 02:11:35 +00:00
|
|
|
|
if (PT != GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
move_gap_both (PT, PT_BYTE);
|
|
|
|
|
if (GAP_SIZE < nbytes)
|
1998-01-09 22:46:07 +00:00
|
|
|
|
make_gap (outgoing_nbytes - GAP_SIZE);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
record_insert (PT, nchars);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
MODIFF++;
|
|
|
|
|
UNGCPRO;
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
/* Copy the string text into the buffer, perhaps converting
|
|
|
|
|
between single-byte and multibyte. */
|
|
|
|
|
copy_text (XSTRING (string)->data + pos_byte, GPT_ADDR, nbytes,
|
|
|
|
|
/* If these are equal, it is a single-byte string.
|
|
|
|
|
Its chars are either ASCII, in which case copy_text
|
|
|
|
|
won't change it, or single-byte non-ASCII chars,
|
|
|
|
|
that need to be changed. */
|
|
|
|
|
nchars != nbytes,
|
|
|
|
|
! NILP (current_buffer->enable_multibyte_characters));
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1992-10-01 00:56:11 +00:00
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
offset_intervals (current_buffer, PT, nchars);
|
|
|
|
|
|
1998-01-12 05:49:45 +00:00
|
|
|
|
GAP_SIZE -= outgoing_nbytes;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GPT += nchars;
|
|
|
|
|
ZV += nchars;
|
|
|
|
|
Z += nchars;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
GPT_BYTE += outgoing_nbytes;
|
|
|
|
|
ZV_BYTE += outgoing_nbytes;
|
|
|
|
|
Z_BYTE += outgoing_nbytes;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_overlays_for_insert (PT, nchars);
|
1998-01-09 22:46:07 +00:00
|
|
|
|
adjust_markers_for_insert (PT, PT_BYTE, PT + nchars,
|
|
|
|
|
PT_BYTE + outgoing_nbytes,
|
1998-01-01 07:03:19 +00:00
|
|
|
|
before_markers);
|
|
|
|
|
|
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
1992-10-01 00:56:11 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
graft_intervals_into_buffer (XSTRING (string)->intervals, PT, nchars,
|
1993-09-14 12:08:02 +00:00
|
|
|
|
current_buffer, inherit);
|
1992-10-01 00:56:11 +00:00
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
adjust_point (nchars, outgoing_nbytes);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
/* Insert text from BUF, NCHARS characters starting at CHARPOS, into the
|
1994-10-22 04:45:57 +00:00
|
|
|
|
current buffer. If the text in BUF has properties, they are absorbed
|
|
|
|
|
into the current buffer.
|
|
|
|
|
|
|
|
|
|
It does not work to use `insert' for this, because a malloc could happen
|
|
|
|
|
and relocate BUF's text before the bcopy happens. */
|
|
|
|
|
|
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
insert_from_buffer (buf, charpos, nchars, inherit)
|
1994-10-22 04:45:57 +00:00
|
|
|
|
struct buffer *buf;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int charpos, nchars;
|
1994-10-22 04:45:57 +00:00
|
|
|
|
int inherit;
|
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (nchars > 0)
|
1994-10-22 04:45:57 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int opoint = PT;
|
|
|
|
|
|
|
|
|
|
insert_from_buffer_1 (buf, charpos, nchars, inherit);
|
|
|
|
|
signal_after_change (opoint, 0, PT - opoint);
|
1994-10-22 04:45:57 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
insert_from_buffer_1 (buf, from, nchars, inherit)
|
1994-10-22 04:45:57 +00:00
|
|
|
|
struct buffer *buf;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int from, nchars;
|
1994-10-22 04:45:57 +00:00
|
|
|
|
int inherit;
|
|
|
|
|
{
|
|
|
|
|
register Lisp_Object temp;
|
|
|
|
|
int chunk;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int from_byte = buf_charpos_to_bytepos (buf, from);
|
|
|
|
|
int to_byte = buf_charpos_to_bytepos (buf, from + nchars);
|
1998-01-09 22:46:07 +00:00
|
|
|
|
int incoming_nbytes = to_byte - from_byte;
|
|
|
|
|
int outgoing_nbytes = incoming_nbytes;
|
|
|
|
|
|
|
|
|
|
/* Make OUTGOING_NBYTES describe the text
|
|
|
|
|
as it will be inserted in this buffer. */
|
|
|
|
|
|
|
|
|
|
if (NILP (current_buffer->enable_multibyte_characters))
|
|
|
|
|
outgoing_nbytes = nchars;
|
|
|
|
|
else if (NILP (buf->enable_multibyte_characters))
|
|
|
|
|
outgoing_nbytes
|
|
|
|
|
= count_size_as_multibyte (BUF_BYTE_ADDRESS (buf, from_byte),
|
|
|
|
|
incoming_nbytes);
|
1994-10-22 04:45:57 +00:00
|
|
|
|
|
|
|
|
|
/* Make sure point-max won't overflow after this insertion. */
|
1998-01-09 22:46:07 +00:00
|
|
|
|
XSETINT (temp, outgoing_nbytes + Z);
|
|
|
|
|
if (outgoing_nbytes + Z != XINT (temp))
|
1998-01-01 07:03:19 +00:00
|
|
|
|
error ("Maximum buffer size exceeded");
|
1994-10-22 04:45:57 +00:00
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
prepare_to_modify_buffer (PT, PT, NULL);
|
1994-10-22 04:45:57 +00:00
|
|
|
|
|
|
|
|
|
if (PT != GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
move_gap_both (PT, PT_BYTE);
|
1998-01-09 22:46:07 +00:00
|
|
|
|
if (GAP_SIZE < outgoing_nbytes)
|
|
|
|
|
make_gap (outgoing_nbytes - GAP_SIZE);
|
1994-10-22 04:45:57 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
record_insert (PT, nchars);
|
1994-10-22 04:45:57 +00:00
|
|
|
|
MODIFF++;
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (from < BUF_GPT (buf))
|
1994-10-22 04:45:57 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
chunk = BUF_GPT_BYTE (buf) - from_byte;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
if (chunk > incoming_nbytes)
|
|
|
|
|
chunk = incoming_nbytes;
|
|
|
|
|
copy_text (BUF_BYTE_ADDRESS (buf, from_byte),
|
|
|
|
|
GPT_ADDR, chunk,
|
|
|
|
|
! NILP (buf->enable_multibyte_characters),
|
|
|
|
|
! NILP (current_buffer->enable_multibyte_characters));
|
1994-10-22 04:45:57 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
chunk = 0;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
if (chunk < incoming_nbytes)
|
|
|
|
|
copy_text (BUF_BYTE_ADDRESS (buf, from_byte + chunk),
|
|
|
|
|
GPT_ADDR + chunk, incoming_nbytes - chunk,
|
|
|
|
|
! NILP (buf->enable_multibyte_characters),
|
|
|
|
|
! NILP (current_buffer->enable_multibyte_characters));
|
1994-10-22 04:45:57 +00:00
|
|
|
|
|
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
1995-01-02 09:21:30 +00:00
|
|
|
|
if (BUF_INTERVALS (current_buffer) != 0)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
offset_intervals (current_buffer, PT, nchars);
|
1994-10-22 04:45:57 +00:00
|
|
|
|
#endif
|
|
|
|
|
|
1998-01-09 22:46:07 +00:00
|
|
|
|
GAP_SIZE -= outgoing_nbytes;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GPT += nchars;
|
|
|
|
|
ZV += nchars;
|
|
|
|
|
Z += nchars;
|
1998-01-09 22:46:07 +00:00
|
|
|
|
GPT_BYTE += outgoing_nbytes;
|
|
|
|
|
ZV_BYTE += outgoing_nbytes;
|
|
|
|
|
Z_BYTE += outgoing_nbytes;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_overlays_for_insert (PT, nchars);
|
1998-01-09 22:46:07 +00:00
|
|
|
|
adjust_markers_for_insert (PT, PT_BYTE, PT + nchars,
|
|
|
|
|
PT_BYTE + outgoing_nbytes, 0);
|
|
|
|
|
adjust_point (nchars, outgoing_nbytes);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
1994-10-22 04:45:57 +00:00
|
|
|
|
|
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */
|
1995-01-02 09:21:30 +00:00
|
|
|
|
graft_intervals_into_buffer (copy_intervals (BUF_INTERVALS (buf),
|
1998-01-01 07:03:19 +00:00
|
|
|
|
from, nchars),
|
|
|
|
|
PT - nchars, nchars,
|
|
|
|
|
current_buffer, inherit);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
|
1998-02-20 01:40:47 +00:00
|
|
|
|
/* This function should be called after moving gap to FROM and before
|
1998-03-03 01:29:16 +00:00
|
|
|
|
altering text between FROM and TO. This adjusts various position
|
|
|
|
|
keepers and markers as if the text is deleted. Don't forget to
|
|
|
|
|
call adjust_after_replace after you actually alter the text. */
|
1998-02-20 01:40:47 +00:00
|
|
|
|
|
1998-01-22 01:26:45 +00:00
|
|
|
|
void
|
|
|
|
|
adjust_before_replace (from, from_byte, to, to_byte)
|
|
|
|
|
int from, from_byte, to, to_byte;
|
|
|
|
|
{
|
|
|
|
|
adjust_markers_for_delete (from, from_byte, to, to_byte);
|
|
|
|
|
record_delete (from, to - from);
|
|
|
|
|
}
|
|
|
|
|
|
1998-02-20 01:40:47 +00:00
|
|
|
|
/* This function should be called after altering the text between FROM
|
|
|
|
|
and TO to a new text of LEN chars (LEN_BYTE bytes). */
|
|
|
|
|
|
1998-01-22 01:26:45 +00:00
|
|
|
|
void
|
|
|
|
|
adjust_after_replace (from, from_byte, to, to_byte, len, len_byte)
|
|
|
|
|
int from, from_byte, to, to_byte, len, len_byte;
|
|
|
|
|
{
|
|
|
|
|
record_insert (from, len);
|
|
|
|
|
if (from < PT)
|
1998-02-20 01:40:47 +00:00
|
|
|
|
adjust_point (len - (to - from), len_byte - (to_byte - from_byte));
|
1998-01-22 01:26:45 +00:00
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
|
|
|
|
offset_intervals (current_buffer, PT, len - (to - from));
|
|
|
|
|
#endif
|
|
|
|
|
adjust_overlays_for_delete (from, to - from);
|
|
|
|
|
adjust_overlays_for_insert (from, len);
|
|
|
|
|
adjust_markers_for_insert (from, from_byte,
|
|
|
|
|
from + len, from_byte + len_byte, 0);
|
|
|
|
|
if (len == 0)
|
|
|
|
|
evaporate_overlays (from);
|
|
|
|
|
MODIFF++;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Replace the text from character positions FROM to TO with NEW,
|
1997-07-17 06:51:28 +00:00
|
|
|
|
If PREPARE is nonzero, call prepare_to_modify_buffer.
|
|
|
|
|
If INHERIT, the newly inserted text should inherit text properties
|
|
|
|
|
from the surrounding non-deleted text. */
|
|
|
|
|
|
|
|
|
|
/* Note that this does not yet handle markers quite right.
|
|
|
|
|
Also it needs to record a single undo-entry that does a replacement
|
|
|
|
|
rather than a separate delete and insert.
|
|
|
|
|
That way, undo will also handle markers properly. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
replace_range (from, to, new, prepare, inherit)
|
|
|
|
|
Lisp_Object new;
|
|
|
|
|
int from, to, prepare, inherit;
|
|
|
|
|
{
|
1998-01-09 22:46:07 +00:00
|
|
|
|
int inschars = XSTRING (new)->size;
|
|
|
|
|
int insbytes = XSTRING (new)->size_byte;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int from_byte, to_byte;
|
|
|
|
|
int nbytes_del, nchars_del;
|
1997-07-17 06:51:28 +00:00
|
|
|
|
register Lisp_Object temp;
|
|
|
|
|
struct gcpro gcpro1;
|
|
|
|
|
|
|
|
|
|
GCPRO1 (new);
|
|
|
|
|
|
|
|
|
|
if (prepare)
|
|
|
|
|
{
|
|
|
|
|
int range_length = to - from;
|
|
|
|
|
prepare_to_modify_buffer (from, to, &from);
|
|
|
|
|
to = from + range_length;
|
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
UNGCPRO;
|
|
|
|
|
|
1997-07-17 06:51:28 +00:00
|
|
|
|
/* Make args be valid */
|
|
|
|
|
if (from < BEGV)
|
|
|
|
|
from = BEGV;
|
|
|
|
|
if (to > ZV)
|
|
|
|
|
to = ZV;
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
from_byte = CHAR_TO_BYTE (from);
|
|
|
|
|
to_byte = CHAR_TO_BYTE (to);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
nchars_del = to - from;
|
|
|
|
|
nbytes_del = to_byte - from_byte;
|
|
|
|
|
|
|
|
|
|
if (nbytes_del <= 0 && insbytes == 0)
|
|
|
|
|
return;
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
|
|
|
|
/* Make sure point-max won't overflow after this insertion. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
XSETINT (temp, Z_BYTE - nbytes_del + insbytes);
|
|
|
|
|
if (Z_BYTE - nbytes_del + insbytes != XINT (temp))
|
|
|
|
|
error ("Maximum buffer size exceeded");
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
|
|
|
|
GCPRO1 (new);
|
|
|
|
|
|
|
|
|
|
/* Make sure the gap is somewhere in or next to what we are deleting. */
|
|
|
|
|
if (from > GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_right (from, from_byte);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
if (to < GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_left (to, to_byte, 0);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
|
|
|
|
/* Relocate all markers pointing into the new, larger gap
|
|
|
|
|
to point at the end of the text before the gap.
|
1998-01-01 07:03:19 +00:00
|
|
|
|
Do this before recording the deletion,
|
|
|
|
|
so that undo handles this after reinserting the text. */
|
|
|
|
|
adjust_markers_for_delete (from, from_byte, to, to_byte);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
record_delete (from, nchars_del);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GAP_SIZE += nbytes_del;
|
|
|
|
|
ZV -= nchars_del;
|
|
|
|
|
Z -= nchars_del;
|
|
|
|
|
ZV_BYTE -= nbytes_del;
|
|
|
|
|
Z_BYTE -= nbytes_del;
|
1997-07-17 06:51:28 +00:00
|
|
|
|
GPT = from;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GPT_BYTE = from_byte;
|
1997-07-17 06:51:28 +00:00
|
|
|
|
*(GPT_ADDR) = 0; /* Put an anchor. */
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
|
|
|
|
|
1997-07-17 06:51:28 +00:00
|
|
|
|
if (GPT - BEG < beg_unchanged)
|
|
|
|
|
beg_unchanged = GPT - BEG;
|
|
|
|
|
if (Z - GPT < end_unchanged)
|
|
|
|
|
end_unchanged = Z - GPT;
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (GAP_SIZE < insbytes)
|
|
|
|
|
make_gap (insbytes - GAP_SIZE);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
record_insert (from, inschars);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
bcopy (XSTRING (new)->data, GPT_ADDR, insbytes);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
|
|
|
|
/* Relocate point as if it were a marker. */
|
|
|
|
|
if (from < PT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_point (from + inschars - (PT < to ? PT : to),
|
|
|
|
|
(from_byte + insbytes
|
|
|
|
|
- (PT_BYTE < to_byte ? PT_BYTE : to_byte)));
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
1998-01-01 07:03:19 +00:00
|
|
|
|
offset_intervals (current_buffer, PT, inschars - nchars_del);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
#endif
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GAP_SIZE -= insbytes;
|
|
|
|
|
GPT += inschars;
|
|
|
|
|
ZV += inschars;
|
|
|
|
|
Z += inschars;
|
|
|
|
|
GPT_BYTE += insbytes;
|
|
|
|
|
ZV_BYTE += insbytes;
|
|
|
|
|
ZV_BYTE += insbytes;
|
1997-07-17 06:51:28 +00:00
|
|
|
|
if (GAP_SIZE > 0) *(GPT_ADDR) = 0; /* Put an anchor. */
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
|
|
|
|
|
1997-07-17 06:51:28 +00:00
|
|
|
|
/* Adjust the overlay center as needed. This must be done after
|
|
|
|
|
adjusting the markers that bound the overlays. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_overlays_for_delete (from, nchars_del);
|
|
|
|
|
adjust_overlays_for_insert (from, inschars);
|
|
|
|
|
adjust_markers_for_insert (from, from_byte, from + inschars,
|
|
|
|
|
from_byte + insbytes, 0);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
|
|
|
|
|
#ifdef USE_TEXT_PROPERTIES
|
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
graft_intervals_into_buffer (XSTRING (new)->intervals, from,
|
|
|
|
|
inschars, current_buffer, inherit);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
#endif
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (insbytes == 0)
|
1997-07-17 06:51:28 +00:00
|
|
|
|
evaporate_overlays (from);
|
|
|
|
|
|
|
|
|
|
MODIFF++;
|
|
|
|
|
UNGCPRO;
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
signal_after_change (from, nchars_del, inschars);
|
1997-07-17 06:51:28 +00:00
|
|
|
|
}
|
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
/* Delete characters in current buffer
|
1998-01-01 07:03:19 +00:00
|
|
|
|
from FROM up to (but not including) TO.
|
|
|
|
|
If TO comes before FROM, we delete nothing. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1991-01-05 15:12:15 +00:00
|
|
|
|
del_range (from, to)
|
|
|
|
|
register int from, to;
|
1994-03-02 00:55:05 +00:00
|
|
|
|
{
|
1995-01-11 01:40:25 +00:00
|
|
|
|
del_range_1 (from, to, 1);
|
1994-03-02 00:55:05 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Like del_range; PREPARE says whether to call prepare_to_modify_buffer. */
|
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1994-03-02 00:55:05 +00:00
|
|
|
|
del_range_1 (from, to, prepare)
|
1997-06-25 06:50:16 +00:00
|
|
|
|
int from, to, prepare;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int from_byte, to_byte;
|
|
|
|
|
|
|
|
|
|
/* Make args be valid */
|
|
|
|
|
if (from < BEGV)
|
|
|
|
|
from = BEGV;
|
|
|
|
|
if (to > ZV)
|
|
|
|
|
to = ZV;
|
|
|
|
|
|
|
|
|
|
if (to <= from)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
if (prepare)
|
|
|
|
|
{
|
|
|
|
|
int range_length = to - from;
|
|
|
|
|
prepare_to_modify_buffer (from, to, &from);
|
|
|
|
|
to = from + range_length;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
from_byte = CHAR_TO_BYTE (from);
|
|
|
|
|
to_byte = CHAR_TO_BYTE (to);
|
|
|
|
|
|
1998-02-27 22:09:33 +00:00
|
|
|
|
del_range_2 (from, from_byte, to, to_byte);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Like del_range_1 but args are byte positions, not char positions. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
del_range_byte (from_byte, to_byte, prepare)
|
|
|
|
|
int from_byte, to_byte, prepare;
|
|
|
|
|
{
|
|
|
|
|
int from, to;
|
|
|
|
|
|
|
|
|
|
/* Make args be valid */
|
|
|
|
|
if (from_byte < BEGV_BYTE)
|
|
|
|
|
from_byte = BEGV_BYTE;
|
|
|
|
|
if (to_byte > ZV_BYTE)
|
|
|
|
|
to_byte = ZV_BYTE;
|
|
|
|
|
|
|
|
|
|
if (to_byte <= from_byte)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
from = BYTE_TO_CHAR (from_byte);
|
|
|
|
|
to = BYTE_TO_CHAR (to_byte);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
if (prepare)
|
|
|
|
|
{
|
1998-01-01 07:03:19 +00:00
|
|
|
|
int old_from = from, old_to = Z - to;
|
1997-06-25 06:50:16 +00:00
|
|
|
|
int range_length = to - from;
|
|
|
|
|
prepare_to_modify_buffer (from, to, &from);
|
|
|
|
|
to = from + range_length;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
|
|
|
|
|
if (old_from != from)
|
|
|
|
|
from_byte = CHAR_TO_BYTE (from);
|
|
|
|
|
if (old_to == Z - to)
|
|
|
|
|
to_byte = CHAR_TO_BYTE (to);
|
1997-06-25 06:50:16 +00:00
|
|
|
|
}
|
|
|
|
|
|
1998-02-27 22:09:33 +00:00
|
|
|
|
del_range_2 (from, from_byte, to, to_byte);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Like del_range_1, but positions are specified both as charpos
|
|
|
|
|
and bytepos. */
|
|
|
|
|
|
|
|
|
|
void
|
1998-02-25 23:18:15 +00:00
|
|
|
|
del_range_both (from, from_byte, to, to_byte, prepare)
|
|
|
|
|
int from, from_byte, to, to_byte, prepare;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
{
|
1991-01-05 15:12:15 +00:00
|
|
|
|
/* Make args be valid */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (from_byte < BEGV_BYTE)
|
|
|
|
|
from_byte = BEGV_BYTE;
|
|
|
|
|
if (to_byte > ZV_BYTE)
|
|
|
|
|
to_byte = ZV_BYTE;
|
|
|
|
|
|
|
|
|
|
if (to_byte <= from_byte)
|
|
|
|
|
return;
|
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (from < BEGV)
|
|
|
|
|
from = BEGV;
|
|
|
|
|
if (to > ZV)
|
|
|
|
|
to = ZV;
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (prepare)
|
|
|
|
|
{
|
|
|
|
|
int old_from = from, old_to = Z - to;
|
|
|
|
|
int range_length = to - from;
|
|
|
|
|
prepare_to_modify_buffer (from, to, &from);
|
|
|
|
|
to = from + range_length;
|
|
|
|
|
|
|
|
|
|
if (old_from != from)
|
|
|
|
|
from_byte = CHAR_TO_BYTE (from);
|
|
|
|
|
if (old_to == Z - to)
|
|
|
|
|
to_byte = CHAR_TO_BYTE (to);
|
|
|
|
|
}
|
|
|
|
|
|
1998-02-27 22:09:33 +00:00
|
|
|
|
del_range_2 (from, from_byte, to, to_byte);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Delete a range of text, specified both as character positions
|
|
|
|
|
and byte positions. FROM and TO are character positions,
|
|
|
|
|
while FROM_BYTE and TO_BYTE are byte positions. */
|
|
|
|
|
|
|
|
|
|
void
|
1998-02-27 22:09:33 +00:00
|
|
|
|
del_range_2 (from, from_byte, to, to_byte)
|
|
|
|
|
int from, from_byte, to, to_byte;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
{
|
|
|
|
|
register int nbytes_del, nchars_del;
|
|
|
|
|
|
|
|
|
|
nchars_del = to - from;
|
|
|
|
|
nbytes_del = to_byte - from_byte;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
/* Make sure the gap is somewhere in or next to what we are deleting. */
|
|
|
|
|
if (from > GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_right (from, from_byte);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (to < GPT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
gap_left (to, to_byte, 0);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1996-02-03 18:06:29 +00:00
|
|
|
|
/* Relocate all markers pointing into the new, larger gap
|
|
|
|
|
to point at the end of the text before the gap.
|
1998-01-01 07:03:19 +00:00
|
|
|
|
Do this before recording the deletion,
|
|
|
|
|
so that undo handles this after reinserting the text. */
|
|
|
|
|
adjust_markers_for_delete (from, from_byte, to, to_byte);
|
1996-02-03 18:06:29 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
record_delete (from, nchars_del);
|
1992-09-28 13:10:15 +00:00
|
|
|
|
MODIFF++;
|
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
/* Relocate point as if it were a marker. */
|
1994-04-26 02:11:35 +00:00
|
|
|
|
if (from < PT)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_point (from - (PT < to ? PT : to),
|
|
|
|
|
from_byte - (PT_BYTE < to_byte ? PT_BYTE : to_byte));
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1993-03-01 08:55:35 +00:00
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
offset_intervals (current_buffer, from, - nchars_del);
|
1993-03-01 08:55:35 +00:00
|
|
|
|
|
1995-04-17 23:16:23 +00:00
|
|
|
|
/* Adjust the overlay center as needed. This must be done after
|
1995-07-20 20:02:38 +00:00
|
|
|
|
adjusting the markers that bound the overlays. */
|
1998-01-01 07:03:19 +00:00
|
|
|
|
adjust_overlays_for_delete (from_byte, nchars_del);
|
1995-04-17 23:16:23 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GAP_SIZE += nbytes_del;
|
|
|
|
|
ZV_BYTE -= nbytes_del;
|
|
|
|
|
Z_BYTE -= nbytes_del;
|
|
|
|
|
ZV -= nchars_del;
|
|
|
|
|
Z -= nchars_del;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
GPT = from;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
GPT_BYTE = from_byte;
|
1997-02-20 06:50:03 +00:00
|
|
|
|
*(GPT_ADDR) = 0; /* Put an anchor. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
if (GPT_BYTE < GPT)
|
|
|
|
|
abort ();
|
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
if (GPT - BEG < beg_unchanged)
|
|
|
|
|
beg_unchanged = GPT - BEG;
|
|
|
|
|
if (Z - GPT < end_unchanged)
|
|
|
|
|
end_unchanged = Z - GPT;
|
|
|
|
|
|
1994-09-17 01:51:58 +00:00
|
|
|
|
evaporate_overlays (from);
|
1998-01-01 07:03:19 +00:00
|
|
|
|
signal_after_change (from, nchars_del, 0);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Call this if you're about to change the region of BUFFER from
|
|
|
|
|
character positions START to END. This checks the read-only
|
|
|
|
|
properties of the region, calls the necessary modification hooks,
|
|
|
|
|
and warns the next redisplay that it should pay attention to that
|
|
|
|
|
area. */
|
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1993-05-14 14:43:30 +00:00
|
|
|
|
modify_region (buffer, start, end)
|
|
|
|
|
struct buffer *buffer;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
int start, end;
|
|
|
|
|
{
|
1993-05-14 14:43:30 +00:00
|
|
|
|
struct buffer *old_buffer = current_buffer;
|
|
|
|
|
|
|
|
|
|
if (buffer != old_buffer)
|
|
|
|
|
set_buffer_internal (buffer);
|
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
prepare_to_modify_buffer (start, end, NULL);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1996-09-15 01:57:44 +00:00
|
|
|
|
if (start - 1 < beg_unchanged
|
|
|
|
|
|| (unchanged_modified == MODIFF
|
|
|
|
|
&& overlay_unchanged_modified == OVERLAY_MODIFF))
|
1991-01-05 15:12:15 +00:00
|
|
|
|
beg_unchanged = start - 1;
|
|
|
|
|
if (Z - end < end_unchanged
|
1996-09-15 01:57:44 +00:00
|
|
|
|
|| (unchanged_modified == MODIFF
|
|
|
|
|
&& overlay_unchanged_modified == OVERLAY_MODIFF))
|
1991-01-05 15:12:15 +00:00
|
|
|
|
end_unchanged = Z - end;
|
1993-12-23 01:19:25 +00:00
|
|
|
|
|
1995-01-02 09:21:30 +00:00
|
|
|
|
if (MODIFF <= SAVE_MODIFF)
|
1993-12-23 01:19:25 +00:00
|
|
|
|
record_first_change ();
|
1991-01-05 15:12:15 +00:00
|
|
|
|
MODIFF++;
|
1993-05-14 14:43:30 +00:00
|
|
|
|
|
1995-01-27 07:47:15 +00:00
|
|
|
|
buffer->point_before_scroll = Qnil;
|
|
|
|
|
|
1993-05-14 14:43:30 +00:00
|
|
|
|
if (buffer != old_buffer)
|
|
|
|
|
set_buffer_internal (old_buffer);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
1997-06-25 06:50:16 +00:00
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
/* Check that it is okay to modify the buffer between START and END,
|
|
|
|
|
which are char positions.
|
|
|
|
|
|
1992-10-01 00:56:11 +00:00
|
|
|
|
Run the before-change-function, if any. If intervals are in use,
|
|
|
|
|
verify that the text to be modified is not read-only, and call
|
1997-06-25 06:50:16 +00:00
|
|
|
|
any modification properties the text may have.
|
|
|
|
|
|
|
|
|
|
If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR
|
|
|
|
|
by holding its value temporarily in a marker. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1997-06-25 06:50:16 +00:00
|
|
|
|
prepare_to_modify_buffer (start, end, preserve_ptr)
|
1996-09-04 03:34:04 +00:00
|
|
|
|
int start, end;
|
1997-06-25 06:50:16 +00:00
|
|
|
|
int *preserve_ptr;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1992-01-13 21:48:03 +00:00
|
|
|
|
if (!NILP (current_buffer->read_only))
|
1991-01-05 15:12:15 +00:00
|
|
|
|
Fbarf_if_buffer_read_only ();
|
|
|
|
|
|
1992-10-01 00:56:11 +00:00
|
|
|
|
/* Only defined if Emacs is compiled with USE_TEXT_PROPERTIES */
|
1995-01-02 09:21:30 +00:00
|
|
|
|
if (BUF_INTERVALS (current_buffer) != 0)
|
1997-06-25 06:50:16 +00:00
|
|
|
|
{
|
|
|
|
|
if (preserve_ptr)
|
|
|
|
|
{
|
|
|
|
|
Lisp_Object preserve_marker;
|
|
|
|
|
struct gcpro gcpro1;
|
|
|
|
|
preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil);
|
|
|
|
|
GCPRO1 (preserve_marker);
|
|
|
|
|
verify_interval_modification (current_buffer, start, end);
|
|
|
|
|
*preserve_ptr = marker_position (preserve_marker);
|
|
|
|
|
unchain_marker (preserve_marker);
|
|
|
|
|
UNGCPRO;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
verify_interval_modification (current_buffer, start, end);
|
|
|
|
|
}
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
|
|
|
|
#ifdef CLASH_DETECTION
|
1995-05-02 18:13:47 +00:00
|
|
|
|
if (!NILP (current_buffer->file_truename)
|
1995-07-20 20:47:20 +00:00
|
|
|
|
/* Make binding buffer-file-name to nil effective. */
|
|
|
|
|
&& !NILP (current_buffer->filename)
|
1995-01-02 09:21:30 +00:00
|
|
|
|
&& SAVE_MODIFF >= MODIFF)
|
1995-05-02 18:13:47 +00:00
|
|
|
|
lock_file (current_buffer->file_truename);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
#else
|
|
|
|
|
/* At least warn if this file has changed on disk since it was visited. */
|
1992-01-13 21:48:03 +00:00
|
|
|
|
if (!NILP (current_buffer->filename)
|
1995-01-02 09:21:30 +00:00
|
|
|
|
&& SAVE_MODIFF >= MODIFF
|
1992-01-13 21:48:03 +00:00
|
|
|
|
&& NILP (Fverify_visited_file_modtime (Fcurrent_buffer ()))
|
|
|
|
|
&& !NILP (Ffile_exists_p (current_buffer->filename)))
|
1991-01-05 15:12:15 +00:00
|
|
|
|
call1 (intern ("ask-user-about-supersession-threat"),
|
|
|
|
|
current_buffer->filename);
|
|
|
|
|
#endif /* not CLASH_DETECTION */
|
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
signal_before_change (start, end, preserve_ptr);
|
1993-03-07 09:33:13 +00:00
|
|
|
|
|
1994-10-08 22:14:58 +00:00
|
|
|
|
if (current_buffer->newline_cache)
|
|
|
|
|
invalidate_region_cache (current_buffer,
|
|
|
|
|
current_buffer->newline_cache,
|
|
|
|
|
start - BEG, Z - end);
|
|
|
|
|
if (current_buffer->width_run_cache)
|
|
|
|
|
invalidate_region_cache (current_buffer,
|
|
|
|
|
current_buffer->width_run_cache,
|
|
|
|
|
start - BEG, Z - end);
|
|
|
|
|
|
1993-03-07 09:33:13 +00:00
|
|
|
|
Vdeactivate_mark = Qt;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
/* These macros work with an argument named `preserve_ptr'
|
|
|
|
|
and a local variable named `preserve_marker'. */
|
|
|
|
|
|
|
|
|
|
#define PRESERVE_VALUE \
|
|
|
|
|
if (preserve_ptr && NILP (preserve_marker)) \
|
|
|
|
|
preserve_marker = Fcopy_marker (make_number (*preserve_ptr), Qnil)
|
|
|
|
|
|
|
|
|
|
#define RESTORE_VALUE \
|
|
|
|
|
if (! NILP (preserve_marker)) \
|
|
|
|
|
{ \
|
|
|
|
|
*preserve_ptr = marker_position (preserve_marker); \
|
|
|
|
|
unchain_marker (preserve_marker); \
|
|
|
|
|
}
|
|
|
|
|
|
1997-08-13 04:13:22 +00:00
|
|
|
|
#define PRESERVE_START_END \
|
|
|
|
|
if (NILP (start_marker)) \
|
|
|
|
|
start_marker = Fcopy_marker (start, Qnil); \
|
|
|
|
|
if (NILP (end_marker)) \
|
|
|
|
|
end_marker = Fcopy_marker (end, Qnil);
|
|
|
|
|
|
|
|
|
|
#define FETCH_START \
|
|
|
|
|
(! NILP (start_marker) ? Fmarker_position (start_marker) : start)
|
|
|
|
|
|
|
|
|
|
#define FETCH_END \
|
|
|
|
|
(! NILP (end_marker) ? Fmarker_position (end_marker) : end)
|
|
|
|
|
|
1993-06-09 11:59:12 +00:00
|
|
|
|
/* Signal a change to the buffer immediately before it happens.
|
1997-06-25 06:50:16 +00:00
|
|
|
|
START_INT and END_INT are the bounds of the text to be changed.
|
|
|
|
|
|
|
|
|
|
If PRESERVE_PTR is nonzero, we relocate *PRESERVE_PTR
|
|
|
|
|
by holding its value temporarily in a marker. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1997-06-25 06:50:16 +00:00
|
|
|
|
signal_before_change (start_int, end_int, preserve_ptr)
|
1996-09-10 19:52:09 +00:00
|
|
|
|
int start_int, end_int;
|
1997-06-25 06:50:16 +00:00
|
|
|
|
int *preserve_ptr;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1996-09-04 03:34:04 +00:00
|
|
|
|
Lisp_Object start, end;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
Lisp_Object start_marker, end_marker;
|
1997-06-25 06:50:16 +00:00
|
|
|
|
Lisp_Object preserve_marker;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
struct gcpro gcpro1, gcpro2, gcpro3;
|
1996-09-04 03:34:04 +00:00
|
|
|
|
|
|
|
|
|
start = make_number (start_int);
|
|
|
|
|
end = make_number (end_int);
|
1997-06-25 06:50:16 +00:00
|
|
|
|
preserve_marker = Qnil;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
start_marker = Qnil;
|
|
|
|
|
end_marker = Qnil;
|
|
|
|
|
GCPRO3 (preserve_marker, start_marker, end_marker);
|
1996-09-04 03:34:04 +00:00
|
|
|
|
|
1991-01-05 15:12:15 +00:00
|
|
|
|
/* If buffer is unmodified, run a special hook for that case. */
|
1995-01-02 09:21:30 +00:00
|
|
|
|
if (SAVE_MODIFF >= MODIFF
|
1993-01-26 01:58:16 +00:00
|
|
|
|
&& !NILP (Vfirst_change_hook)
|
|
|
|
|
&& !NILP (Vrun_hooks))
|
1997-06-25 06:50:16 +00:00
|
|
|
|
{
|
|
|
|
|
PRESERVE_VALUE;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
PRESERVE_START_END;
|
1997-06-25 06:50:16 +00:00
|
|
|
|
call1 (Vrun_hooks, Qfirst_change_hook);
|
|
|
|
|
}
|
1993-01-26 01:58:16 +00:00
|
|
|
|
|
1995-08-05 22:57:13 +00:00
|
|
|
|
/* Run the before-change-function if any.
|
|
|
|
|
We don't bother "binding" this variable to nil
|
|
|
|
|
because it is obsolete anyway and new code should not use it. */
|
1992-01-13 21:48:03 +00:00
|
|
|
|
if (!NILP (Vbefore_change_function))
|
1997-06-25 06:50:16 +00:00
|
|
|
|
{
|
|
|
|
|
PRESERVE_VALUE;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
PRESERVE_START_END;
|
|
|
|
|
call2 (Vbefore_change_function, FETCH_START, FETCH_END);
|
1997-06-25 06:50:16 +00:00
|
|
|
|
}
|
1994-04-10 02:34:02 +00:00
|
|
|
|
|
1995-08-05 22:57:13 +00:00
|
|
|
|
/* Now run the before-change-functions if any. */
|
1994-04-10 02:34:02 +00:00
|
|
|
|
if (!NILP (Vbefore_change_functions))
|
|
|
|
|
{
|
1995-08-05 22:57:13 +00:00
|
|
|
|
Lisp_Object args[3];
|
|
|
|
|
Lisp_Object before_change_functions;
|
|
|
|
|
Lisp_Object after_change_functions;
|
|
|
|
|
struct gcpro gcpro1, gcpro2;
|
|
|
|
|
|
1997-06-25 06:50:16 +00:00
|
|
|
|
PRESERVE_VALUE;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
PRESERVE_START_END;
|
1997-06-25 06:50:16 +00:00
|
|
|
|
|
1995-08-05 22:57:13 +00:00
|
|
|
|
/* "Bind" before-change-functions and after-change-functions
|
|
|
|
|
to nil--but in a way that errors don't know about.
|
|
|
|
|
That way, if there's an error in them, they will stay nil. */
|
|
|
|
|
before_change_functions = Vbefore_change_functions;
|
|
|
|
|
after_change_functions = Vafter_change_functions;
|
1995-08-07 17:53:17 +00:00
|
|
|
|
Vbefore_change_functions = Qnil;
|
|
|
|
|
Vafter_change_functions = Qnil;
|
1995-08-05 22:57:13 +00:00
|
|
|
|
GCPRO2 (before_change_functions, after_change_functions);
|
|
|
|
|
|
|
|
|
|
/* Actually run the hook functions. */
|
|
|
|
|
args[0] = Qbefore_change_functions;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
args[1] = FETCH_START;
|
|
|
|
|
args[2] = FETCH_END;
|
1995-08-05 22:57:13 +00:00
|
|
|
|
run_hook_list_with_args (before_change_functions, 3, args);
|
|
|
|
|
|
|
|
|
|
/* "Unbind" the variables we "bound" to nil. */
|
|
|
|
|
Vbefore_change_functions = before_change_functions;
|
|
|
|
|
Vafter_change_functions = after_change_functions;
|
|
|
|
|
UNGCPRO;
|
1994-04-10 02:34:02 +00:00
|
|
|
|
}
|
1994-12-11 11:24:16 +00:00
|
|
|
|
|
|
|
|
|
if (!NILP (current_buffer->overlays_before)
|
|
|
|
|
|| !NILP (current_buffer->overlays_after))
|
1997-06-25 06:50:16 +00:00
|
|
|
|
{
|
|
|
|
|
PRESERVE_VALUE;
|
1997-08-13 04:13:22 +00:00
|
|
|
|
report_overlay_modification (FETCH_START, FETCH_END, 0,
|
|
|
|
|
FETCH_START, FETCH_END, Qnil);
|
1997-06-25 06:50:16 +00:00
|
|
|
|
}
|
|
|
|
|
|
1997-08-13 04:13:22 +00:00
|
|
|
|
if (! NILP (start_marker))
|
|
|
|
|
free_marker (start_marker);
|
|
|
|
|
if (! NILP (end_marker))
|
|
|
|
|
free_marker (end_marker);
|
1997-06-25 06:50:16 +00:00
|
|
|
|
RESTORE_VALUE;
|
|
|
|
|
UNGCPRO;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
|
|
|
|
|
1993-06-09 11:59:12 +00:00
|
|
|
|
/* Signal a change immediately after it happens.
|
1998-01-01 07:03:19 +00:00
|
|
|
|
CHARPOS is the character position of the start of the changed text.
|
1991-01-05 15:12:15 +00:00
|
|
|
|
LENDEL is the number of characters of the text before the change.
|
|
|
|
|
(Not the whole buffer; just the part that was changed.)
|
1996-05-01 21:25:49 +00:00
|
|
|
|
LENINS is the number of characters in that part of the text
|
|
|
|
|
after the change. */
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1995-01-11 01:40:25 +00:00
|
|
|
|
void
|
1998-01-01 07:03:19 +00:00
|
|
|
|
signal_after_change (charpos, lendel, lenins)
|
|
|
|
|
int charpos, lendel, lenins;
|
1991-01-05 15:12:15 +00:00
|
|
|
|
{
|
1996-11-09 21:36:00 +00:00
|
|
|
|
/* If we are deferring calls to the after-change functions
|
|
|
|
|
and there are no before-change functions,
|
|
|
|
|
just record the args that we were going to use. */
|
|
|
|
|
if (! NILP (Vcombine_after_change_calls)
|
|
|
|
|
&& NILP (Vbefore_change_function) && NILP (Vbefore_change_functions)
|
|
|
|
|
&& NILP (current_buffer->overlays_before)
|
|
|
|
|
&& NILP (current_buffer->overlays_after))
|
|
|
|
|
{
|
|
|
|
|
Lisp_Object elt;
|
|
|
|
|
|
|
|
|
|
if (!NILP (combine_after_change_list)
|
|
|
|
|
&& current_buffer != XBUFFER (combine_after_change_buffer))
|
|
|
|
|
Fcombine_after_change_execute ();
|
|
|
|
|
|
1998-01-01 07:03:19 +00:00
|
|
|
|
elt = Fcons (make_number (charpos - BEG),
|
|
|
|
|
Fcons (make_number (Z - (charpos - lendel + lenins)),
|
1996-11-09 21:36:00 +00:00
|
|
|
|
Fcons (make_number (lenins - lendel), Qnil)));
|
|
|
|
|
combine_after_change_list
|
|
|
|
|
= Fcons (elt, combine_after_change_list);
|
|
|
|
|
combine_after_change_buffer = Fcurrent_buffer ();
|
|
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!NILP (combine_after_change_list))
|
|
|
|
|
Fcombine_after_change_execute ();
|
|
|
|
|
|
1995-08-05 22:57:13 +00:00
|
|
|
|
/* Run the after-change-function if any.
|
|
|
|
|
We don't bother "binding" this variable to nil
|
|
|
|
|
because it is obsolete anyway and new code should not use it. */
|
1992-01-13 21:48:03 +00:00
|
|
|
|
if (!NILP (Vafter_change_function))
|
1995-08-05 22:57:13 +00:00
|
|
|
|
call3 (Vafter_change_function,
|
1998-01-01 07:03:19 +00:00
|
|
|
|
make_number (charpos), make_number (charpos + lenins),
|
1995-08-05 22:57:13 +00:00
|
|
|
|
make_number (lendel));
|
1991-01-05 15:12:15 +00:00
|
|
|
|
|
1994-04-10 02:34:02 +00:00
|
|
|
|
if (!NILP (Vafter_change_functions))
|
|
|
|
|
{
|
1995-08-05 22:57:13 +00:00
|
|
|
|
Lisp_Object args[4];
|
|
|
|
|
Lisp_Object before_change_functions;
|
|
|
|
|
Lisp_Object after_change_functions;
|
|
|
|
|
struct gcpro gcpro1, gcpro2;
|
|
|
|
|
|
|
|
|
|
/* "Bind" before-change-functions and after-change-functions
|
|
|
|
|
to nil--but in a way that errors don't know about.
|
|
|
|
|
That way, if there's an error in them, they will stay nil. */
|
|
|
|
|
before_change_functions = Vbefore_change_functions;
|
|
|
|
|
after_change_functions = Vafter_change_functions;
|
1995-08-07 17:53:17 +00:00
|
|
|
|
Vbefore_change_functions = Qnil;
|
|
|
|
|
Vafter_change_functions = Qnil;
|
1995-08-05 22:57:13 +00:00
|
|
|
|
GCPRO2 (before_change_functions, after_change_functions);
|
|
|
|
|
|
|
|
|
|
/* Actually run the hook functions. */
|
|
|
|
|
args[0] = Qafter_change_functions;
|
1998-01-01 07:03:19 +00:00
|
|
|
|
XSETFASTINT (args[1], charpos);
|
|
|
|
|
XSETFASTINT (args[2], charpos + lenins);
|
1995-08-05 22:57:13 +00:00
|
|
|
|
XSETFASTINT (args[3], lendel);
|
|
|
|
|
run_hook_list_with_args (after_change_functions,
|
|
|
|
|
4, args);
|
|
|
|
|
|
|
|
|
|
/* "Unbind" the variables we "bound" to nil. */
|
|
|
|
|
Vbefore_change_functions = before_change_functions;
|
|
|
|
|
Vafter_change_functions = after_change_functions;
|
|
|
|
|
UNGCPRO;
|
1994-04-10 02:34:02 +00:00
|
|
|
|
}
|
1994-12-11 11:24:16 +00:00
|
|
|
|
|
|
|
|
|
if (!NILP (current_buffer->overlays_before)
|
|
|
|
|
|| !NILP (current_buffer->overlays_after))
|
1998-01-01 07:03:19 +00:00
|
|
|
|
report_overlay_modification (make_number (charpos),
|
|
|
|
|
make_number (charpos + lenins),
|
1994-12-11 11:24:16 +00:00
|
|
|
|
1,
|
1998-01-01 07:03:19 +00:00
|
|
|
|
make_number (charpos),
|
|
|
|
|
make_number (charpos + lenins),
|
1994-12-11 11:24:16 +00:00
|
|
|
|
make_number (lendel));
|
1995-09-12 17:37:02 +00:00
|
|
|
|
|
|
|
|
|
/* After an insertion, call the text properties
|
|
|
|
|
insert-behind-hooks or insert-in-front-hooks. */
|
|
|
|
|
if (lendel == 0)
|
1998-01-01 07:03:19 +00:00
|
|
|
|
report_interval_modification (charpos, charpos + lenins);
|
1991-01-05 15:12:15 +00:00
|
|
|
|
}
|
1996-11-09 21:36:00 +00:00
|
|
|
|
|
|
|
|
|
Lisp_Object
|
|
|
|
|
Fcombine_after_change_execute_1 (val)
|
|
|
|
|
Lisp_Object val;
|
|
|
|
|
{
|
|
|
|
|
Vcombine_after_change_calls = val;
|
|
|
|
|
return val;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
DEFUN ("combine-after-change-execute", Fcombine_after_change_execute,
|
|
|
|
|
Scombine_after_change_execute, 0, 0, 0,
|
|
|
|
|
"This function is for use internally in `combine-after-change-calls'.")
|
|
|
|
|
()
|
|
|
|
|
{
|
|
|
|
|
register Lisp_Object val;
|
|
|
|
|
int count = specpdl_ptr - specpdl;
|
|
|
|
|
int beg, end, change;
|
|
|
|
|
int begpos, endpos;
|
|
|
|
|
Lisp_Object tail;
|
|
|
|
|
|
|
|
|
|
record_unwind_protect (Fset_buffer, Fcurrent_buffer ());
|
|
|
|
|
|
|
|
|
|
Fset_buffer (combine_after_change_buffer);
|
|
|
|
|
|
|
|
|
|
/* # chars unchanged at beginning of buffer. */
|
|
|
|
|
beg = Z - BEG;
|
|
|
|
|
/* # chars unchanged at end of buffer. */
|
|
|
|
|
end = beg;
|
|
|
|
|
/* Total amount of insertion (negative for deletion). */
|
|
|
|
|
change = 0;
|
|
|
|
|
|
|
|
|
|
/* Scan the various individual changes,
|
|
|
|
|
accumulating the range info in BEG, END and CHANGE. */
|
|
|
|
|
for (tail = combine_after_change_list; CONSP (tail);
|
|
|
|
|
tail = XCONS (tail)->cdr)
|
|
|
|
|
{
|
1997-04-10 22:37:54 +00:00
|
|
|
|
Lisp_Object elt;
|
|
|
|
|
int thisbeg, thisend, thischange;
|
1996-11-09 21:36:00 +00:00
|
|
|
|
|
|
|
|
|
/* Extract the info from the next element. */
|
|
|
|
|
elt = XCONS (tail)->car;
|
|
|
|
|
if (! CONSP (elt))
|
|
|
|
|
continue;
|
|
|
|
|
thisbeg = XINT (XCONS (elt)->car);
|
|
|
|
|
|
|
|
|
|
elt = XCONS (elt)->cdr;
|
|
|
|
|
if (! CONSP (elt))
|
|
|
|
|
continue;
|
|
|
|
|
thisend = XINT (XCONS (elt)->car);
|
|
|
|
|
|
|
|
|
|
elt = XCONS (elt)->cdr;
|
|
|
|
|
if (! CONSP (elt))
|
|
|
|
|
continue;
|
|
|
|
|
thischange = XINT (XCONS (elt)->car);
|
|
|
|
|
|
|
|
|
|
/* Merge this range into the accumulated range. */
|
|
|
|
|
change += thischange;
|
|
|
|
|
if (thisbeg < beg)
|
|
|
|
|
beg = thisbeg;
|
|
|
|
|
if (thisend < end)
|
|
|
|
|
end = thisend;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Get the current start and end positions of the range
|
|
|
|
|
that was changed. */
|
|
|
|
|
begpos = BEG + beg;
|
|
|
|
|
endpos = Z - end;
|
|
|
|
|
|
|
|
|
|
/* We are about to handle these, so discard them. */
|
|
|
|
|
combine_after_change_list = Qnil;
|
|
|
|
|
|
|
|
|
|
/* Now run the after-change functions for real.
|
|
|
|
|
Turn off the flag that defers them. */
|
|
|
|
|
record_unwind_protect (Fcombine_after_change_execute_1,
|
|
|
|
|
Vcombine_after_change_calls);
|
|
|
|
|
signal_after_change (begpos, endpos - begpos - change, endpos - begpos);
|
|
|
|
|
|
|
|
|
|
return unbind_to (count, val);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
syms_of_insdel ()
|
|
|
|
|
{
|
|
|
|
|
staticpro (&combine_after_change_list);
|
|
|
|
|
combine_after_change_list = Qnil;
|
|
|
|
|
|
|
|
|
|
DEFVAR_LISP ("combine-after-change-calls", &Vcombine_after_change_calls,
|
|
|
|
|
"Used internally by the `combine-after-change-calls' macro.");
|
|
|
|
|
Vcombine_after_change_calls = Qnil;
|
|
|
|
|
|
|
|
|
|
defsubr (&Scombine_after_change_execute);
|
|
|
|
|
}
|