HCoop
/
bpt
/
emacs.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
remove sigio blocking
[bpt/emacs.git]
/
src
/
intervals.c
diff --git
a/src/intervals.c
b/src/intervals.c
index
ded536c
..
842e0c2
100644
(file)
--- a/
src/intervals.c
+++ b/
src/intervals.c
@@
-1,5
+1,5
@@
/* Code for doing intervals.
/* Code for doing intervals.
- Copyright (C) 1993-1995, 1997-1998, 2001-201
3
Free Software
+ Copyright (C) 1993-1995, 1997-1998, 2001-201
4
Free Software
Foundation, Inc.
This file is part of GNU Emacs.
Foundation, Inc.
This file is part of GNU Emacs.
@@
-40,8
+40,6
@@
along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
#include <config.h>
#include <config.h>
-#define INTERVALS_INLINE EXTERN_INLINE
-
#include <intprops.h>
#include "lisp.h"
#include "intervals.h"
#include <intprops.h>
#include "lisp.h"
#include "intervals.h"
@@
-62,16
+60,7
@@
static INTERVAL reproduce_tree (INTERVAL, INTERVAL);
\f
/* Utility functions for intervals. */
\f
/* Utility functions for intervals. */
-/* Use these functions to set Lisp_Object
- or pointer slots of struct interval. */
-
-static void
-set_interval_object (INTERVAL i, Lisp_Object obj)
-{
- eassert (BUFFERP (obj) || STRINGP (obj));
- i->up_obj = 1;
- i->up.obj = obj;
-}
+/* Use these functions to set pointer slots of struct interval. */
static void
set_interval_left (INTERVAL i, INTERVAL left)
static void
set_interval_left (INTERVAL i, INTERVAL left)
@@
-121,13
+110,14
@@
create_root_interval (Lisp_Object parent)
set_string_intervals (parent, new);
new->position = 0;
}
set_string_intervals (parent, new);
new->position = 0;
}
-
+ eassert (LENGTH (new) > 0);
+
set_interval_object (new, parent);
return new;
}
set_interval_object (new, parent);
return new;
}
-/* Make the interval TARGET have exactly the properties of SOURCE */
+/* Make the interval TARGET have exactly the properties of SOURCE
.
*/
void
copy_properties (register INTERVAL source, register INTERVAL target)
void
copy_properties (register INTERVAL source, register INTERVAL target)
@@
-187,10
+177,10
@@
intervals_equal (INTERVAL i0, INTERVAL i1)
Lisp_Object i1_cdr, i1_val;
if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1))
Lisp_Object i1_cdr, i1_val;
if (DEFAULT_INTERVAL_P (i0) && DEFAULT_INTERVAL_P (i1))
- return
1
;
+ return
true
;
if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1))
if (DEFAULT_INTERVAL_P (i0) || DEFAULT_INTERVAL_P (i1))
- return
0
;
+ return
false
;
i0_cdr = i0->plist;
i1_cdr = i1->plist;
i0_cdr = i0->plist;
i1_cdr = i1->plist;
@@
-199,31
+189,31
@@
intervals_equal (INTERVAL i0, INTERVAL i1)
i0_sym = XCAR (i0_cdr);
i0_cdr = XCDR (i0_cdr);
if (!CONSP (i0_cdr))
i0_sym = XCAR (i0_cdr);
i0_cdr = XCDR (i0_cdr);
if (!CONSP (i0_cdr))
- return
0
;
+ return
false
;
i1_val = i1->plist;
while (CONSP (i1_val) && !EQ (XCAR (i1_val), i0_sym))
{
i1_val = XCDR (i1_val);
if (!CONSP (i1_val))
i1_val = i1->plist;
while (CONSP (i1_val) && !EQ (XCAR (i1_val), i0_sym))
{
i1_val = XCDR (i1_val);
if (!CONSP (i1_val))
- return
0
;
+ return
false
;
i1_val = XCDR (i1_val);
}
/* i0 has something i1 doesn't. */
if (EQ (i1_val, Qnil))
i1_val = XCDR (i1_val);
}
/* i0 has something i1 doesn't. */
if (EQ (i1_val, Qnil))
- return
0
;
+ return
false
;
/* i0 and i1 both have sym, but it has different values in each. */
if (!CONSP (i1_val)
|| (i1_val = XCDR (i1_val), !CONSP (i1_val))
|| !EQ (XCAR (i1_val), XCAR (i0_cdr)))
/* i0 and i1 both have sym, but it has different values in each. */
if (!CONSP (i1_val)
|| (i1_val = XCDR (i1_val), !CONSP (i1_val))
|| !EQ (XCAR (i1_val), XCAR (i0_cdr)))
- return
0
;
+ return
false
;
i0_cdr = XCDR (i0_cdr);
i1_cdr = XCDR (i1_cdr);
if (!CONSP (i1_cdr))
i0_cdr = XCDR (i0_cdr);
i1_cdr = XCDR (i1_cdr);
if (!CONSP (i1_cdr))
- return
0
;
+ return
false
;
i1_cdr = XCDR (i1_cdr);
}
i1_cdr = XCDR (i1_cdr);
}
@@
-343,39
+333,43
@@
root_interval (INTERVAL interval)
*/
static INTERVAL
*/
static INTERVAL
-rotate_right (INTERVAL
interval
)
+rotate_right (INTERVAL
A
)
{
{
- INTERVAL i;
- INTERVAL B = interval->left;
- ptrdiff_t old_total = interval->total_length;
+ INTERVAL B = A->left;
+ INTERVAL c = B->right;
+ ptrdiff_t old_total = A->total_length;
+
+ eassert (old_total > 0);
+ eassert (LENGTH (A) > 0);
+ eassert (LENGTH (B) > 0);
/* Deal with any Parent of A; make it point to B. */
/* Deal with any Parent of A; make it point to B. */
- if (! ROOT_INTERVAL_P (
interval
))
+ if (! ROOT_INTERVAL_P (
A
))
{
{
- if (AM_LEFT_CHILD (
interval
))
- set_interval_left (INTERVAL_PARENT (
interval
), B);
+ if (AM_LEFT_CHILD (
A
))
+ set_interval_left (INTERVAL_PARENT (
A
), B);
else
else
- set_interval_right (INTERVAL_PARENT (
interval
), B);
+ set_interval_right (INTERVAL_PARENT (
A
), B);
}
}
- copy_interval_parent (B,
interval
);
+ copy_interval_parent (B,
A
);
- /* Make B the parent of A */
- i = B->right;
- set_interval_right (B, interval);
- set_interval_parent (interval, B);
+ /* Make B the parent of A. */
+ set_interval_right (B, A);
+ set_interval_parent (A, B);
- /* Make A point to c */
- set_interval_left (
interval, i
);
- if (
i
)
- set_interval_parent (
i, interval
);
+ /* Make A point to c
.
*/
+ set_interval_left (
A, c
);
+ if (
c
)
+ set_interval_parent (
c, A
);
/* A's total length is decreased by the length of B and its left child. */
/* A's total length is decreased by the length of B and its left child. */
- interval->total_length -= B->total_length - LEFT_TOTAL_LENGTH (interval);
- eassert (TOTAL_LENGTH (interval) >= 0);
+ A->total_length -= B->total_length - TOTAL_LENGTH (c);
+ eassert (TOTAL_LENGTH (A) > 0);
+ eassert (LENGTH (A) > 0);
/* B must have the same total length of A. */
B->total_length = old_total;
/* B must have the same total length of A. */
B->total_length = old_total;
- eassert (
TOTAL_LENGTH (B) >=
0);
+ eassert (
LENGTH (B) >
0);
return B;
}
return B;
}
@@
-390,39
+384,43
@@
rotate_right (INTERVAL interval)
*/
static INTERVAL
*/
static INTERVAL
-rotate_left (INTERVAL
interval
)
+rotate_left (INTERVAL
A
)
{
{
- INTERVAL i;
- INTERVAL B = interval->right;
- ptrdiff_t old_total = interval->total_length;
+ INTERVAL B = A->right;
+ INTERVAL c = B->left;
+ ptrdiff_t old_total = A->total_length;
+
+ eassert (old_total > 0);
+ eassert (LENGTH (A) > 0);
+ eassert (LENGTH (B) > 0);
/* Deal with any parent of A; make it point to B. */
/* Deal with any parent of A; make it point to B. */
- if (! ROOT_INTERVAL_P (
interval
))
+ if (! ROOT_INTERVAL_P (
A
))
{
{
- if (AM_LEFT_CHILD (
interval
))
- set_interval_left (INTERVAL_PARENT (
interval
), B);
+ if (AM_LEFT_CHILD (
A
))
+ set_interval_left (INTERVAL_PARENT (
A
), B);
else
else
- set_interval_right (INTERVAL_PARENT (
interval
), B);
+ set_interval_right (INTERVAL_PARENT (
A
), B);
}
}
- copy_interval_parent (B,
interval
);
+ copy_interval_parent (B,
A
);
- /* Make B the parent of A */
- i = B->left;
- set_interval_left (B, interval);
- set_interval_parent (interval, B);
+ /* Make B the parent of A. */
+ set_interval_left (B, A);
+ set_interval_parent (A, B);
- /* Make A point to c */
- set_interval_right (
interval, i
);
- if (
i
)
- set_interval_parent (
i, interval
);
+ /* Make A point to c
.
*/
+ set_interval_right (
A, c
);
+ if (
c
)
+ set_interval_parent (
c, A
);
/* A's total length is decreased by the length of B and its right child. */
/* A's total length is decreased by the length of B and its right child. */
- interval->total_length -= B->total_length - RIGHT_TOTAL_LENGTH (interval);
- eassert (TOTAL_LENGTH (interval) >= 0);
+ A->total_length -= B->total_length - TOTAL_LENGTH (c);
+ eassert (TOTAL_LENGTH (A) > 0);
+ eassert (LENGTH (A) > 0);
/* B must have the same total length of A. */
B->total_length = old_total;
/* B must have the same total length of A. */
B->total_length = old_total;
- eassert (
TOTAL_LENGTH (B) >=
0);
+ eassert (
LENGTH (B) >
0);
return B;
}
return B;
}
@@
-435,6
+433,9
@@
balance_an_interval (INTERVAL i)
{
register ptrdiff_t old_diff, new_diff;
{
register ptrdiff_t old_diff, new_diff;
+ eassert (LENGTH (i) > 0);
+ eassert (TOTAL_LENGTH (i) >= LENGTH (i));
+
while (1)
{
old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i);
while (1)
{
old_diff = LEFT_TOTAL_LENGTH (i) - RIGHT_TOTAL_LENGTH (i);
@@
-471,16
+472,16
@@
static INTERVAL
balance_possible_root_interval (INTERVAL interval)
{
Lisp_Object parent;
balance_possible_root_interval (INTERVAL interval)
{
Lisp_Object parent;
- bool have_parent = 0;
-
- if (!INTERVAL_HAS_OBJECT (interval) && !INTERVAL_HAS_PARENT (interval))
- return interval;
+ bool have_parent = false;
if (INTERVAL_HAS_OBJECT (interval))
{
if (INTERVAL_HAS_OBJECT (interval))
{
- have_parent =
1
;
+ have_parent =
true
;
GET_INTERVAL_OBJECT (parent, interval);
}
GET_INTERVAL_OBJECT (parent, interval);
}
+ else if (!INTERVAL_HAS_PARENT (interval))
+ return interval;
+
interval = balance_an_interval (interval);
if (have_parent)
interval = balance_an_interval (interval);
if (have_parent)
@@
-556,7
+557,7
@@
split_interval_right (INTERVAL interval, ptrdiff_t offset)
{
set_interval_right (interval, new);
new->total_length = new_length;
{
set_interval_right (interval, new);
new->total_length = new_length;
- eassert (
TOTAL_LENGTH (new) >=
0);
+ eassert (
LENGTH (new) >
0);
}
else
{
}
else
{
@@
-565,7
+566,6
@@
split_interval_right (INTERVAL interval, ptrdiff_t offset)
set_interval_parent (interval->right, new);
set_interval_right (interval, new);
new->total_length = new_length + new->right->total_length;
set_interval_parent (interval->right, new);
set_interval_right (interval, new);
new->total_length = new_length + new->right->total_length;
- eassert (TOTAL_LENGTH (new) >= 0);
balance_an_interval (new);
}
balance_an_interval (new);
}
@@
-601,7
+601,7
@@
split_interval_left (INTERVAL interval, ptrdiff_t offset)
{
set_interval_left (interval, new);
new->total_length = new_length;
{
set_interval_left (interval, new);
new->total_length = new_length;
- eassert (
TOTAL_LENGTH (new) >=
0);
+ eassert (
LENGTH (new) >
0);
}
else
{
}
else
{
@@
-610,7
+610,6
@@
split_interval_left (INTERVAL interval, ptrdiff_t offset)
set_interval_parent (new->left, new);
set_interval_left (interval, new);
new->total_length = new_length + new->left->total_length;
set_interval_parent (new->left, new);
set_interval_left (interval, new);
new->total_length = new_length + new->left->total_length;
- eassert (TOTAL_LENGTH (new) >= 0);
balance_an_interval (new);
}
balance_an_interval (new);
}
@@
-678,6
+677,7
@@
find_interval (register INTERVAL tree, register ptrdiff_t position)
while (1)
{
while (1)
{
+ eassert (tree);
if (relative_position < LEFT_TOTAL_LENGTH (tree))
{
tree = tree->left;
if (relative_position < LEFT_TOTAL_LENGTH (tree))
{
tree = tree->left;
@@
-793,12
+793,12
@@
update_interval (register INTERVAL i, ptrdiff_t pos)
{
if (pos < i->position)
{
{
if (pos < i->position)
{
- /* Move left. */
+ /* Move left.
*/
if (pos >= i->position - TOTAL_LENGTH (i->left))
{
i->left->position = i->position - TOTAL_LENGTH (i->left)
+ LEFT_TOTAL_LENGTH (i->left);
if (pos >= i->position - TOTAL_LENGTH (i->left))
{
i->left->position = i->position - TOTAL_LENGTH (i->left)
+ LEFT_TOTAL_LENGTH (i->left);
- i = i->left; /* Move to the left child */
+ i = i->left; /* Move to the left child
.
*/
}
else if (NULL_PARENT (i))
error ("Point before start of properties");
}
else if (NULL_PARENT (i))
error ("Point before start of properties");
@@
-808,12
+808,12
@@
update_interval (register INTERVAL i, ptrdiff_t pos)
}
else if (pos >= INTERVAL_LAST_POS (i))
{
}
else if (pos >= INTERVAL_LAST_POS (i))
{
- /* Move right. */
+ /* Move right.
*/
if (pos < INTERVAL_LAST_POS (i) + TOTAL_LENGTH (i->right))
{
i->right->position = INTERVAL_LAST_POS (i)
+ LEFT_TOTAL_LENGTH (i->right);
if (pos < INTERVAL_LAST_POS (i) + TOTAL_LENGTH (i->right))
{
i->right->position = INTERVAL_LAST_POS (i)
+ LEFT_TOTAL_LENGTH (i->right);
- i = i->right; /* Move to the right child */
+ i = i->right; /* Move to the right child
.
*/
}
else if (NULL_PARENT (i))
error ("Point %"pD"d after end of properties", pos);
}
else if (NULL_PARENT (i))
error ("Point %"pD"d after end of properties", pos);
@@
-960,7
+960,6
@@
adjust_intervals_for_insertion (INTERVAL tree,
for (temp = prev ? prev : i; temp; temp = INTERVAL_PARENT_OR_NULL (temp))
{
temp->total_length += length;
for (temp = prev ? prev : i; temp; temp = INTERVAL_PARENT_OR_NULL (temp))
{
temp->total_length += length;
- eassert (TOTAL_LENGTH (temp) >= 0);
temp = balance_possible_root_interval (temp);
}
temp = balance_possible_root_interval (temp);
}
@@
-1016,7
+1015,6
@@
adjust_intervals_for_insertion (INTERVAL tree,
for (temp = i; temp; temp = INTERVAL_PARENT_OR_NULL (temp))
{
temp->total_length += length;
for (temp = i; temp; temp = INTERVAL_PARENT_OR_NULL (temp))
{
temp->total_length += length;
- eassert (TOTAL_LENGTH (temp) >= 0);
temp = balance_possible_root_interval (temp);
}
}
temp = balance_possible_root_interval (temp);
}
}
@@
-1218,9
+1216,10
@@
delete_node (register INTERVAL i)
this = this->left;
this->total_length += migrate_amt;
}
this = this->left;
this->total_length += migrate_amt;
}
- eassert (TOTAL_LENGTH (this) >= 0);
set_interval_left (this, migrate);
set_interval_parent (migrate, this);
set_interval_left (this, migrate);
set_interval_parent (migrate, this);
+ eassert (LENGTH (this) > 0);
+ eassert (LENGTH (i->right) > 0);
return i->right;
}
return i->right;
}
@@
-1300,7
+1299,7
@@
interval_deletion_adjustment (register INTERVAL tree, register ptrdiff_t from,
relative_position,
amount);
tree->total_length -= subtract;
relative_position,
amount);
tree->total_length -= subtract;
- eassert (
TOTAL_LENGTH (tree) >=
0);
+ eassert (
LENGTH (tree) >
0);
return subtract;
}
/* Right branch. */
return subtract;
}
/* Right branch. */
@@
-1315,7
+1314,7
@@
interval_deletion_adjustment (register INTERVAL tree, register ptrdiff_t from,
relative_position,
amount);
tree->total_length -= subtract;
relative_position,
amount);
tree->total_length -= subtract;
- eassert (
TOTAL_LENGTH (tree) >=
0);
+ eassert (
LENGTH (tree) >
0);
return subtract;
}
/* Here -- this node. */
return subtract;
}
/* Here -- this node. */
@@
-1330,7
+1329,7
@@
interval_deletion_adjustment (register INTERVAL tree, register ptrdiff_t from,
amount = my_amount;
tree->total_length -= amount;
amount = my_amount;
tree->total_length -= amount;
- eassert (
TOTAL_
LENGTH (tree) >= 0);
+ eassert (LENGTH (tree) >= 0);
if (LENGTH (tree) == 0)
delete_interval (tree);
if (LENGTH (tree) == 0)
delete_interval (tree);
@@
-1372,7
+1371,7
@@
adjust_intervals_for_deletion (struct buffer *buffer,
if (ONLY_INTERVAL_P (tree))
{
tree->total_length -= length;
if (ONLY_INTERVAL_P (tree))
{
tree->total_length -= length;
- eassert (
TOTAL_LENGTH (tree) >=
0);
+ eassert (
LENGTH (tree) >
0);
return;
}
return;
}
@@
-1406,10
+1405,7
@@
offset_intervals (struct buffer *buffer, ptrdiff_t start, ptrdiff_t length)
adjust_intervals_for_insertion (buffer_intervals (buffer),
start, length);
else
adjust_intervals_for_insertion (buffer_intervals (buffer),
start, length);
else
- {
- lint_assume (- TYPE_MAXIMUM (ptrdiff_t) <= length);
- adjust_intervals_for_deletion (buffer, start, -length);
- }
+ adjust_intervals_for_deletion (buffer, start, -length);
}
\f
/* Merge interval I with its lexicographic successor. The resulting
}
\f
/* Merge interval I with its lexicographic successor. The resulting
@@
-1435,12
+1431,12
@@
merge_interval_right (register INTERVAL i)
while (! NULL_LEFT_CHILD (successor))
{
successor->total_length += absorb;
while (! NULL_LEFT_CHILD (successor))
{
successor->total_length += absorb;
- eassert (
TOTAL_LENGTH (successor) >=
0);
+ eassert (
LENGTH (successor) >
0);
successor = successor->left;
}
successor->total_length += absorb;
successor = successor->left;
}
successor->total_length += absorb;
- eassert (
TOTAL_LENGTH (successor) >=
0);
+ eassert (
LENGTH (successor) >
0);
delete_interval (i);
return successor;
}
delete_interval (i);
return successor;
}
@@
-1462,7
+1458,7
@@
merge_interval_right (register INTERVAL i)
successor = INTERVAL_PARENT (successor);
successor->total_length -= absorb;
successor = INTERVAL_PARENT (successor);
successor->total_length -= absorb;
- eassert (
TOTAL_LENGTH (successor) >=
0);
+ eassert (
LENGTH (successor) >
0);
}
/* This must be the rightmost or last interval and cannot
}
/* This must be the rightmost or last interval and cannot
@@
-1491,12
+1487,12
@@
merge_interval_left (register INTERVAL i)
while (! NULL_RIGHT_CHILD (predecessor))
{
predecessor->total_length += absorb;
while (! NULL_RIGHT_CHILD (predecessor))
{
predecessor->total_length += absorb;
- eassert (
TOTAL_LENGTH (predecessor) >=
0);
+ eassert (
LENGTH (predecessor) >
0);
predecessor = predecessor->right;
}
predecessor->total_length += absorb;
predecessor = predecessor->right;
}
predecessor->total_length += absorb;
- eassert (
TOTAL_LENGTH (predecessor) >=
0);
+ eassert (
LENGTH (predecessor) >
0);
delete_interval (i);
return predecessor;
}
delete_interval (i);
return predecessor;
}
@@
-1518,7
+1514,7
@@
merge_interval_left (register INTERVAL i)
predecessor = INTERVAL_PARENT (predecessor);
predecessor->total_length -= absorb;
predecessor = INTERVAL_PARENT (predecessor);
predecessor->total_length -= absorb;
- eassert (
TOTAL_LENGTH (predecessor) >=
0);
+ eassert (
LENGTH (predecessor) >
0);
}
/* This must be the leftmost or first interval and cannot
}
/* This must be the leftmost or first interval and cannot
@@
-1533,6
+1529,8
@@
reproduce_interval (INTERVAL source)
{
register INTERVAL target = make_interval ();
{
register INTERVAL target = make_interval ();
+ eassert (LENGTH (source) > 0);
+
target->total_length = source->total_length;
target->position = source->position;
target->total_length = source->total_length;
target->position = source->position;
@@
-1543,6
+1541,7
@@
reproduce_interval (INTERVAL source)
if (! NULL_RIGHT_CHILD (source))
set_interval_right (target, reproduce_tree (source->right, target));
if (! NULL_RIGHT_CHILD (source))
set_interval_right (target, reproduce_tree (source->right, target));
+ eassert (LENGTH (target) > 0);
return target;
}
return target;
}
@@
-1771,7
+1770,7
@@
lookup_char_property (Lisp_Object plist, Lisp_Object prop, bool textprop)
if (! NILP (fallback))
return fallback;
if (! NILP (fallback))
return fallback;
- /* Check for alternative properties */
+ /* Check for alternative properties
.
*/
tail = Fassq (prop, Vchar_property_alias_alist);
if (! NILP (tail))
{
tail = Fassq (prop, Vchar_property_alias_alist);
if (! NILP (tail))
{
@@
-1794,8
+1793,7
@@
temp_set_point_both (struct buffer *buffer,
ptrdiff_t charpos, ptrdiff_t bytepos)
{
/* In a single-byte buffer, the two positions must be equal. */
ptrdiff_t charpos, ptrdiff_t bytepos)
{
/* In a single-byte buffer, the two positions must be equal. */
- if (BUF_ZV (buffer) == BUF_ZV_BYTE (buffer))
- eassert (charpos == bytepos);
+ eassert (BUF_ZV (buffer) != BUF_ZV_BYTE (buffer) || charpos == bytepos);
eassert (charpos <= bytepos);
eassert (charpos <= BUF_ZV (buffer) || BUF_BEGV (buffer) <= charpos);
eassert (charpos <= bytepos);
eassert (charpos <= BUF_ZV (buffer) || BUF_BEGV (buffer) <= charpos);
@@
-2238,7
+2236,7
@@
get_local_map (ptrdiff_t position, struct buffer *buffer, Lisp_Object type)
editing a field with a `local-map' property, we want insertion at the end
to obey the `local-map' property. */
if (NILP (prop))
editing a field with a `local-map' property, we want insertion at the end
to obey the `local-map' property. */
if (NILP (prop))
- prop = get_pos_property (lispy_position, type, lispy_buffer);
+ prop =
F
get_pos_property (lispy_position, type, lispy_buffer);
SET_BUF_BEGV_BOTH (buffer, old_begv, old_begv_byte);
SET_BUF_ZV_BOTH (buffer, old_zv, old_zv_byte);
SET_BUF_BEGV_BOTH (buffer, old_begv, old_begv_byte);
SET_BUF_ZV_BOTH (buffer, old_zv, old_zv_byte);
@@
-2440,7
+2438,7
@@
set_intervals_multibyte_1 (INTERVAL i, bool multi_flag,
end, end_byte);
}
end, end_byte);
}
- /* Rounding to char boundaries can theoretically ake this interval
+ /* Rounding to char boundaries can theoretically
m
ake this interval
spurious. If so, delete one child, and copy its property list
to this interval. */
if (LEFT_TOTAL_LENGTH (i) + RIGHT_TOTAL_LENGTH (i) >= TOTAL_LENGTH (i))
spurious. If so, delete one child, and copy its property list
to this interval. */
if (LEFT_TOTAL_LENGTH (i) + RIGHT_TOTAL_LENGTH (i) >= TOTAL_LENGTH (i))