Mercurial > hg > xemacs-beta
comparison src/editfns.c @ 665:fdefd0186b75
[xemacs-hg @ 2001-09-20 06:28:42 by ben]
The great integral types renaming.
The purpose of this is to rationalize the names used for various
integral types, so that they match their intended uses and follow
consist conventions, and eliminate types that were not semantically
different from each other.
The conventions are:
-- All integral types that measure quantities of anything are
signed. Some people disagree vociferously with this, but their
arguments are mostly theoretical, and are vastly outweighed by
the practical headaches of mixing signed and unsigned values,
and more importantly by the far increased likelihood of
inadvertent bugs: Because of the broken "viral" nature of
unsigned quantities in C (operations involving mixed
signed/unsigned are done unsigned, when exactly the opposite is
nearly always wanted), even a single error in declaring a
quantity unsigned that should be signed, or even the even more
subtle error of comparing signed and unsigned values and
forgetting the necessary cast, can be catastrophic, as
comparisons will yield wrong results. -Wsign-compare is turned
on specifically to catch this, but this tends to result in a
great number of warnings when mixing signed and unsigned, and
the casts are annoying. More has been written on this
elsewhere.
-- All such quantity types just mentioned boil down to EMACS_INT,
which is 32 bits on 32-bit machines and 64 bits on 64-bit
machines. This is guaranteed to be the same size as Lisp
objects of type `int', and (as far as I can tell) of size_t
(unsigned!) and ssize_t. The only type below that is not an
EMACS_INT is Hashcode, which is an unsigned value of the same
size as EMACS_INT.
-- Type names should be relatively short (no more than 10
characters or so), with the first letter capitalized and no
underscores if they can at all be avoided.
-- "count" == a zero-based measurement of some quantity. Includes
sizes, offsets, and indexes.
-- "bpos" == a one-based measurement of a position in a buffer.
"Charbpos" and "Bytebpos" count text in the buffer, rather than
bytes in memory; thus Bytebpos does not directly correspond to
the memory representation. Use "Membpos" for this.
-- "Char" refers to internal-format characters, not to the C type
"char", which is really a byte.
-- For the actual name changes, see the script below.
I ran the following script to do the conversion. (NOTE: This script
is idempotent. You can safely run it multiple times and it will
not screw up previous results -- in fact, it will do nothing if
nothing has changed. Thus, it can be run repeatedly as necessary
to handle patches coming in from old workspaces, or old branches.)
There are two tags, just before and just after the change:
`pre-integral-type-rename' and `post-integral-type-rename'. When
merging code from the main trunk into a branch, the best thing to
do is first merge up to `pre-integral-type-rename', then apply the
script and associated changes, then merge from
`post-integral-type-change' to the present. (Alternatively, just do
the merging in one operation; but you may then have a lot of
conflicts needing to be resolved by hand.)
Script `fixtypes.sh' follows:
----------------------------------- cut ------------------------------------
files="*.[ch] s/*.h m/*.h config.h.in ../configure.in Makefile.in.in ../lib-src/*.[ch] ../lwlib/*.[ch]"
gr Memory_Count Bytecount $files
gr Lstream_Data_Count Bytecount $files
gr Element_Count Elemcount $files
gr Hash_Code Hashcode $files
gr extcount bytecount $files
gr bufpos charbpos $files
gr bytind bytebpos $files
gr memind membpos $files
gr bufbyte intbyte $files
gr Extcount Bytecount $files
gr Bufpos Charbpos $files
gr Bytind Bytebpos $files
gr Memind Membpos $files
gr Bufbyte Intbyte $files
gr EXTCOUNT BYTECOUNT $files
gr BUFPOS CHARBPOS $files
gr BYTIND BYTEBPOS $files
gr MEMIND MEMBPOS $files
gr BUFBYTE INTBYTE $files
gr MEMORY_COUNT BYTECOUNT $files
gr LSTREAM_DATA_COUNT BYTECOUNT $files
gr ELEMENT_COUNT ELEMCOUNT $files
gr HASH_CODE HASHCODE $files
----------------------------------- cut ------------------------------------
`fixtypes.sh' is a Bourne-shell script; it uses 'gr':
----------------------------------- cut ------------------------------------
#!/bin/sh
# Usage is like this:
# gr FROM TO FILES ...
# globally replace FROM with TO in FILES. FROM and TO are regular expressions.
# backup files are stored in the `backup' directory.
from="$1"
to="$2"
shift 2
echo ${1+"$@"} | xargs global-replace "s/$from/$to/g"
----------------------------------- cut ------------------------------------
`gr' in turn uses a Perl script to do its real work,
`global-replace', which follows:
----------------------------------- cut ------------------------------------
: #-*- Perl -*-
### global-modify --- modify the contents of a file by a Perl expression
## Copyright (C) 1999 Martin Buchholz.
## Copyright (C) 2001 Ben Wing.
## Authors: Martin Buchholz <martin@xemacs.org>, Ben Wing <ben@xemacs.org>
## Maintainer: Ben Wing <ben@xemacs.org>
## Current Version: 1.0, May 5, 2001
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2, or (at your option)
# any later version.
#
# This program 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 XEmacs; see the file COPYING. If not, write to the Free
# Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
# 02111-1307, USA.
eval 'exec perl -w -S $0 ${1+"$@"}'
if 0;
use strict;
use FileHandle;
use Carp;
use Getopt::Long;
use File::Basename;
(my $myName = $0) =~ s@.*/@@; my $usage="
Usage: $myName [--help] [--backup-dir=DIR] [--line-mode] [--hunk-mode]
PERLEXPR FILE ...
Globally modify a file, either line by line or in one big hunk.
Typical usage is like this:
[with GNU print, GNU xargs: guaranteed to handle spaces, quotes, etc.
in file names]
find . -name '*.[ch]' -print0 | xargs -0 $0 's/\bCONST\b/const/g'\n
[with non-GNU print, xargs]
find . -name '*.[ch]' -print | xargs $0 's/\bCONST\b/const/g'\n
The file is read in, either line by line (with --line-mode specified)
or in one big hunk (with --hunk-mode specified; it's the default), and
the Perl expression is then evalled with \$_ set to the line or hunk of
text, including the terminating newline if there is one. It should
destructively modify the value there, storing the changed result in \$_.
Files in which any modifications are made are backed up to the directory
specified using --backup-dir, or to `backup' by default. To disable this,
use --backup-dir= with no argument.
Hunk mode is the default because it is MUCH MUCH faster than line-by-line.
Use line-by-line only when it matters, e.g. you want to do a replacement
only once per line (the default without the `g' argument). Conversely,
when using hunk mode, *ALWAYS* use `g'; otherwise, you will only make one
replacement in the entire file!
";
my %options = ();
$Getopt::Long::ignorecase = 0;
&GetOptions (
\%options,
'help', 'backup-dir=s', 'line-mode', 'hunk-mode',
);
die $usage if $options{"help"} or @ARGV <= 1;
my $code = shift;
die $usage if grep (-d || ! -w, @ARGV);
sub SafeOpen {
open ((my $fh = new FileHandle), $_[0]);
confess "Can't open $_[0]: $!" if ! defined $fh;
return $fh;
}
sub SafeClose {
close $_[0] or confess "Can't close $_[0]: $!";
}
sub FileContents {
my $fh = SafeOpen ("< $_[0]");
my $olddollarslash = $/;
local $/ = undef;
my $contents = <$fh>;
$/ = $olddollarslash;
return $contents;
}
sub WriteStringToFile {
my $fh = SafeOpen ("> $_[0]");
binmode $fh;
print $fh $_[1] or confess "$_[0]: $!\n";
SafeClose $fh;
}
foreach my $file (@ARGV) {
my $changed_p = 0;
my $new_contents = "";
if ($options{"line-mode"}) {
my $fh = SafeOpen $file;
while (<$fh>) {
my $save_line = $_;
eval $code;
$changed_p = 1 if $save_line ne $_;
$new_contents .= $_;
}
} else {
my $orig_contents = $_ = FileContents $file;
eval $code;
if ($_ ne $orig_contents) {
$changed_p = 1;
$new_contents = $_;
}
}
if ($changed_p) {
my $backdir = $options{"backup-dir"};
$backdir = "backup" if !defined ($backdir);
if ($backdir) {
my ($name, $path, $suffix) = fileparse ($file, "");
my $backfulldir = $path . $backdir;
my $backfile = "$backfulldir/$name";
mkdir $backfulldir, 0755 unless -d $backfulldir;
print "modifying $file (original saved in $backfile)\n";
rename $file, $backfile;
}
WriteStringToFile ($file, $new_contents);
}
}
----------------------------------- cut ------------------------------------
In addition to those programs, I needed to fix up a few other
things, particularly relating to the duplicate definitions of
types, now that some types merged with others. Specifically:
1. in lisp.h, removed duplicate declarations of Bytecount. The
changed code should now look like this: (In each code snippet
below, the first and last lines are the same as the original, as
are all lines outside of those lines. That allows you to locate
the section to be replaced, and replace the stuff in that
section, verifying that there isn't anything new added that
would need to be kept.)
--------------------------------- snip -------------------------------------
/* Counts of bytes or chars */
typedef EMACS_INT Bytecount;
typedef EMACS_INT Charcount;
/* Counts of elements */
typedef EMACS_INT Elemcount;
/* Hash codes */
typedef unsigned long Hashcode;
/* ------------------------ dynamic arrays ------------------- */
--------------------------------- snip -------------------------------------
2. in lstream.h, removed duplicate declaration of Bytecount.
Rewrote the comment about this type. The changed code should
now look like this:
--------------------------------- snip -------------------------------------
#endif
/* The have been some arguments over the what the type should be that
specifies a count of bytes in a data block to be written out or read in,
using Lstream_read(), Lstream_write(), and related functions.
Originally it was long, which worked fine; Martin "corrected" these to
size_t and ssize_t on the grounds that this is theoretically cleaner and
is in keeping with the C standards. Unfortunately, this practice is
horribly error-prone due to design flaws in the way that mixed
signed/unsigned arithmetic happens. In fact, by doing this change,
Martin introduced a subtle but fatal error that caused the operation of
sending large mail messages to the SMTP server under Windows to fail.
By putting all values back to be signed, avoiding any signed/unsigned
mixing, the bug immediately went away. The type then in use was
Lstream_Data_Count, so that it be reverted cleanly if a vote came to
that. Now it is Bytecount.
Some earlier comments about why the type must be signed: This MUST BE
SIGNED, since it also is used in functions that return the number of
bytes actually read to or written from in an operation, and these
functions can return -1 to signal error.
Note that the standard Unix read() and write() functions define the
count going in as a size_t, which is UNSIGNED, and the count going
out as an ssize_t, which is SIGNED. This is a horrible design
flaw. Not only is it highly likely to lead to logic errors when a
-1 gets interpreted as a large positive number, but operations are
bound to fail in all sorts of horrible ways when a number in the
upper-half of the size_t range is passed in -- this number is
unrepresentable as an ssize_t, so code that checks to see how many
bytes are actually written (which is mandatory if you are dealing
with certain types of devices) will get completely screwed up.
--ben
*/
typedef enum lstream_buffering
--------------------------------- snip -------------------------------------
3. in dumper.c, there are four places, all inside of switch()
statements, where XD_BYTECOUNT appears twice as a case tag. In
each case, the two case blocks contain identical code, and you
should *REMOVE THE SECOND* and leave the first.
author | ben |
---|---|
date | Thu, 20 Sep 2001 06:31:11 +0000 |
parents | 6e99cc8c6ca5 |
children | a307f9a2021d |
comparison
equal
deleted
inserted
replaced
664:6e99cc8c6ca5 | 665:fdefd0186b75 |
---|---|
103 Convert CHARACTER to a one-character string containing that character. | 103 Convert CHARACTER to a one-character string containing that character. |
104 */ | 104 */ |
105 (character)) | 105 (character)) |
106 { | 106 { |
107 Bytecount len; | 107 Bytecount len; |
108 Bufbyte str[MAX_EMCHAR_LEN]; | 108 Intbyte str[MAX_EMCHAR_LEN]; |
109 | 109 |
110 if (EVENTP (character)) | 110 if (EVENTP (character)) |
111 { | 111 { |
112 Lisp_Object ch2 = Fevent_to_character (character, Qt, Qnil, Qnil); | 112 Lisp_Object ch2 = Fevent_to_character (character, Qt, Qnil, Qnil); |
113 if (NILP (ch2)) | 113 if (NILP (ch2)) |
140 return Qnil; | 140 return Qnil; |
141 } | 141 } |
142 | 142 |
143 | 143 |
144 static Lisp_Object | 144 static Lisp_Object |
145 buildmark (Bufpos val, Lisp_Object buffer) | 145 buildmark (Charbpos val, Lisp_Object buffer) |
146 { | 146 { |
147 Lisp_Object mark = Fmake_marker (); | 147 Lisp_Object mark = Fmake_marker (); |
148 Fset_marker (mark, make_int (val), buffer); | 148 Fset_marker (mark, make_int (val), buffer); |
149 return mark; | 149 return mark; |
150 } | 150 } |
178 } | 178 } |
179 | 179 |
180 /* The following two functions end up being identical but it's | 180 /* The following two functions end up being identical but it's |
181 cleaner to declare them separately. */ | 181 cleaner to declare them separately. */ |
182 | 182 |
183 Bufpos | 183 Charbpos |
184 bufpos_clip_to_bounds (Bufpos lower, Bufpos num, Bufpos upper) | 184 charbpos_clip_to_bounds (Charbpos lower, Charbpos num, Charbpos upper) |
185 { | 185 { |
186 return (num < lower ? lower : | 186 return (num < lower ? lower : |
187 num > upper ? upper : | 187 num > upper ? upper : |
188 num); | 188 num); |
189 } | 189 } |
190 | 190 |
191 Bytind | 191 Bytebpos |
192 bytind_clip_to_bounds (Bytind lower, Bytind num, Bytind upper) | 192 bytebpos_clip_to_bounds (Bytebpos lower, Bytebpos num, Bytebpos upper) |
193 { | 193 { |
194 return (num < lower ? lower : | 194 return (num < lower ? lower : |
195 num > upper ? upper : | 195 num > upper ? upper : |
196 num); | 196 num); |
197 } | 197 } |
214 Return value of POSITION, as an integer. | 214 Return value of POSITION, as an integer. |
215 */ | 215 */ |
216 (position, buffer)) | 216 (position, buffer)) |
217 { | 217 { |
218 struct buffer *b = decode_buffer (buffer, 1); | 218 struct buffer *b = decode_buffer (buffer, 1); |
219 Bufpos n = get_buffer_pos_char (b, position, GB_COERCE_RANGE); | 219 Charbpos n = get_buffer_pos_char (b, position, GB_COERCE_RANGE); |
220 BUF_SET_PT (b, n); | 220 BUF_SET_PT (b, n); |
221 atomic_extent_goto_char_p = 1; | 221 atomic_extent_goto_char_p = 1; |
222 return make_int (n); | 222 return make_int (n); |
223 } | 223 } |
224 | 224 |
330 struct buffer *b; | 330 struct buffer *b; |
331 | 331 |
332 /* #### Huh? --hniksic */ | 332 /* #### Huh? --hniksic */ |
333 /*if (preparing_for_armageddon) return Qnil;*/ | 333 /*if (preparing_for_armageddon) return Qnil;*/ |
334 | 334 |
335 #ifdef ERROR_CHECK_BUFPOS | 335 #ifdef ERROR_CHECK_CHARBPOS |
336 assert (XINT (Fpoint (Qnil)) == | 336 assert (XINT (Fpoint (Qnil)) == |
337 XINT (Fmarker_position (Fpoint_marker (Qt, Qnil)))); | 337 XINT (Fmarker_position (Fpoint_marker (Qt, Qnil)))); |
338 #endif | 338 #endif |
339 | 339 |
340 b = current_buffer; | 340 b = current_buffer; |
532 struct buffer *b = decode_buffer (buffer, 1); | 532 struct buffer *b = decode_buffer (buffer, 1); |
533 return BUF_PT (b) == BUF_ZV (b) ? Qt : Qnil; | 533 return BUF_PT (b) == BUF_ZV (b) ? Qt : Qnil; |
534 } | 534 } |
535 | 535 |
536 int | 536 int |
537 beginning_of_line_p (struct buffer *b, Bufpos pt) | 537 beginning_of_line_p (struct buffer *b, Charbpos pt) |
538 { | 538 { |
539 return pt <= BUF_BEGV (b) || BUF_FETCH_CHAR (b, pt - 1) == '\n'; | 539 return pt <= BUF_BEGV (b) || BUF_FETCH_CHAR (b, pt - 1) == '\n'; |
540 } | 540 } |
541 | 541 |
542 | 542 |
570 If BUFFER is nil, the current buffer is assumed. | 570 If BUFFER is nil, the current buffer is assumed. |
571 */ | 571 */ |
572 (pos, buffer)) | 572 (pos, buffer)) |
573 { | 573 { |
574 struct buffer *b = decode_buffer (buffer, 1); | 574 struct buffer *b = decode_buffer (buffer, 1); |
575 Bufpos n = (NILP (pos) ? BUF_PT (b) : | 575 Charbpos n = (NILP (pos) ? BUF_PT (b) : |
576 get_buffer_pos_char (b, pos, GB_NO_ERROR_IF_BAD)); | 576 get_buffer_pos_char (b, pos, GB_NO_ERROR_IF_BAD)); |
577 | 577 |
578 if (n < 0 || n == BUF_ZV (b)) | 578 if (n < 0 || n == BUF_ZV (b)) |
579 return Qnil; | 579 return Qnil; |
580 return make_char (BUF_FETCH_CHAR (b, n)); | 580 return make_char (BUF_FETCH_CHAR (b, n)); |
588 If BUFFER is nil, the current buffer is assumed. | 588 If BUFFER is nil, the current buffer is assumed. |
589 */ | 589 */ |
590 (pos, buffer)) | 590 (pos, buffer)) |
591 { | 591 { |
592 struct buffer *b = decode_buffer (buffer, 1); | 592 struct buffer *b = decode_buffer (buffer, 1); |
593 Bufpos n = (NILP (pos) ? BUF_PT (b) : | 593 Charbpos n = (NILP (pos) ? BUF_PT (b) : |
594 get_buffer_pos_char (b, pos, GB_NO_ERROR_IF_BAD)); | 594 get_buffer_pos_char (b, pos, GB_NO_ERROR_IF_BAD)); |
595 | 595 |
596 n--; | 596 n--; |
597 | 597 |
598 if (n < BUF_BEGV (b)) | 598 if (n < BUF_BEGV (b)) |
1104 characters appearing in the day and month names may be incorrect. | 1104 characters appearing in the day and month names may be incorrect. |
1105 */ | 1105 */ |
1106 (format_string, time_)) | 1106 (format_string, time_)) |
1107 { | 1107 { |
1108 time_t value; | 1108 time_t value; |
1109 Memory_Count size; | 1109 Bytecount size; |
1110 | 1110 |
1111 CHECK_STRING (format_string); | 1111 CHECK_STRING (format_string); |
1112 | 1112 |
1113 if (! lisp_to_time (time_, &value)) | 1113 if (! lisp_to_time (time_, &value)) |
1114 invalid_argument ("Invalid time specification", Qunbound); | 1114 invalid_argument ("Invalid time specification", Qunbound); |
1268 (specified_time)) | 1268 (specified_time)) |
1269 { | 1269 { |
1270 time_t value; | 1270 time_t value; |
1271 char *the_ctime; | 1271 char *the_ctime; |
1272 EMACS_INT len; /* this is what make_ext_string() accepts; #### | 1272 EMACS_INT len; /* this is what make_ext_string() accepts; #### |
1273 should it be an Extcount? */ | 1273 should it be an Bytecount? */ |
1274 | 1274 |
1275 if (! lisp_to_time (specified_time, &value)) | 1275 if (! lisp_to_time (specified_time, &value)) |
1276 value = -1; | 1276 value = -1; |
1277 the_ctime = ctime (&value); | 1277 the_ctime = ctime (&value); |
1278 | 1278 |
1589 text into. If BUFFER is nil, the current buffer is assumed. | 1589 text into. If BUFFER is nil, the current buffer is assumed. |
1590 */ | 1590 */ |
1591 (character, count, ignored, buffer)) | 1591 (character, count, ignored, buffer)) |
1592 { | 1592 { |
1593 /* This function can GC */ | 1593 /* This function can GC */ |
1594 REGISTER Bufbyte *string; | 1594 REGISTER Intbyte *string; |
1595 REGISTER int slen; | 1595 REGISTER int slen; |
1596 REGISTER int i, j; | 1596 REGISTER int i, j; |
1597 REGISTER Bytecount n; | 1597 REGISTER Bytecount n; |
1598 REGISTER Bytecount charlen; | 1598 REGISTER Bytecount charlen; |
1599 Bufbyte str[MAX_EMCHAR_LEN]; | 1599 Intbyte str[MAX_EMCHAR_LEN]; |
1600 struct buffer *b = decode_buffer (buffer, 1); | 1600 struct buffer *b = decode_buffer (buffer, 1); |
1601 int cou; | 1601 int cou; |
1602 | 1602 |
1603 CHECK_CHAR_COERCE_INT (character); | 1603 CHECK_CHAR_COERCE_INT (character); |
1604 if (NILP (count)) | 1604 if (NILP (count)) |
1612 charlen = set_charptr_emchar (str, XCHAR (character)); | 1612 charlen = set_charptr_emchar (str, XCHAR (character)); |
1613 n = cou * charlen; | 1613 n = cou * charlen; |
1614 if (n <= 0) | 1614 if (n <= 0) |
1615 return Qnil; | 1615 return Qnil; |
1616 slen = min (n, 768); | 1616 slen = min (n, 768); |
1617 string = alloca_array (Bufbyte, slen); | 1617 string = alloca_array (Intbyte, slen); |
1618 /* Write as many copies of the character into the temp string as will fit. */ | 1618 /* Write as many copies of the character into the temp string as will fit. */ |
1619 for (i = 0; i + charlen <= slen; i += charlen) | 1619 for (i = 0; i + charlen <= slen; i += charlen) |
1620 for (j = 0; j < charlen; j++) | 1620 for (j = 0; j < charlen; j++) |
1621 string[i + j] = str[j]; | 1621 string[i + j] = str[j]; |
1622 slen = i; | 1622 slen = i; |
1653 If BUFFER is nil, the current buffer is assumed. | 1653 If BUFFER is nil, the current buffer is assumed. |
1654 */ | 1654 */ |
1655 (start, end, buffer)) | 1655 (start, end, buffer)) |
1656 { | 1656 { |
1657 /* This function can GC */ | 1657 /* This function can GC */ |
1658 Bufpos begv, zv; | 1658 Charbpos begv, zv; |
1659 struct buffer *b = decode_buffer (buffer, 1); | 1659 struct buffer *b = decode_buffer (buffer, 1); |
1660 | 1660 |
1661 get_buffer_range_char (b, start, end, &begv, &zv, GB_ALLOW_NIL); | 1661 get_buffer_range_char (b, start, end, &begv, &zv, GB_ALLOW_NIL); |
1662 return make_string_from_buffer (b, begv, zv - begv); | 1662 return make_string_from_buffer (b, begv, zv - begv); |
1663 } | 1663 } |
1670 Return the text from START to END as a string, without copying the extents. | 1670 Return the text from START to END as a string, without copying the extents. |
1671 */ | 1671 */ |
1672 (start, end, buffer)) | 1672 (start, end, buffer)) |
1673 { | 1673 { |
1674 /* This function can GC */ | 1674 /* This function can GC */ |
1675 Bufpos begv, zv; | 1675 Charbpos begv, zv; |
1676 struct buffer *b = decode_buffer (buffer, 1); | 1676 struct buffer *b = decode_buffer (buffer, 1); |
1677 | 1677 |
1678 get_buffer_range_char (b, start, end, &begv, &zv, GB_ALLOW_NIL); | 1678 get_buffer_range_char (b, start, end, &begv, &zv, GB_ALLOW_NIL); |
1679 return make_string_from_buffer_no_extents (b, begv, zv - begv); | 1679 return make_string_from_buffer_no_extents (b, begv, zv - begv); |
1680 } | 1680 } |
1686 They default to the beginning and the end of BUFFER. | 1686 They default to the beginning and the end of BUFFER. |
1687 */ | 1687 */ |
1688 (buffer, start, end)) | 1688 (buffer, start, end)) |
1689 { | 1689 { |
1690 /* This function can GC */ | 1690 /* This function can GC */ |
1691 Bufpos b, e; | 1691 Charbpos b, e; |
1692 struct buffer *bp; | 1692 struct buffer *bp; |
1693 | 1693 |
1694 bp = XBUFFER (get_buffer (buffer, 1)); | 1694 bp = XBUFFER (get_buffer (buffer, 1)); |
1695 get_buffer_range_char (bp, start, end, &b, &e, GB_ALLOW_NIL); | 1695 get_buffer_range_char (bp, start, end, &b, &e, GB_ALLOW_NIL); |
1696 | 1696 |
1710 The value of `case-fold-search' in the current buffer | 1710 The value of `case-fold-search' in the current buffer |
1711 determines whether case is significant or ignored. | 1711 determines whether case is significant or ignored. |
1712 */ | 1712 */ |
1713 (buffer1, start1, end1, buffer2, start2, end2)) | 1713 (buffer1, start1, end1, buffer2, start2, end2)) |
1714 { | 1714 { |
1715 Bufpos begp1, endp1, begp2, endp2; | 1715 Charbpos begp1, endp1, begp2, endp2; |
1716 REGISTER Charcount len1, len2, length, i; | 1716 REGISTER Charcount len1, len2, length, i; |
1717 struct buffer *bp1, *bp2; | 1717 struct buffer *bp1, *bp2; |
1718 Lisp_Object trt = ((!NILP (current_buffer->case_fold_search)) ? | 1718 Lisp_Object trt = ((!NILP (current_buffer->case_fold_search)) ? |
1719 XCASE_TABLE_CANON (current_buffer->case_table) : Qnil); | 1719 XCASE_TABLE_CANON (current_buffer->case_table) : Qnil); |
1720 | 1720 |
1781 and don't mark the buffer as really changed. | 1781 and don't mark the buffer as really changed. |
1782 */ | 1782 */ |
1783 (start, end, fromchar, tochar, noundo)) | 1783 (start, end, fromchar, tochar, noundo)) |
1784 { | 1784 { |
1785 /* This function can GC */ | 1785 /* This function can GC */ |
1786 Bufpos pos, stop; | 1786 Charbpos pos, stop; |
1787 Emchar fromc, toc; | 1787 Emchar fromc, toc; |
1788 int mc_count; | 1788 int mc_count; |
1789 struct buffer *buf = current_buffer; | 1789 struct buffer *buf = current_buffer; |
1790 int count = specpdl_depth (); | 1790 int count = specpdl_depth (); |
1791 | 1791 |
1859 Returns the number of substitutions performed. | 1859 Returns the number of substitutions performed. |
1860 */ | 1860 */ |
1861 (start, end, table)) | 1861 (start, end, table)) |
1862 { | 1862 { |
1863 /* This function can GC */ | 1863 /* This function can GC */ |
1864 Bufpos pos, stop; /* Limits of the region. */ | 1864 Charbpos pos, stop; /* Limits of the region. */ |
1865 int cnt = 0; /* Number of changes made. */ | 1865 int cnt = 0; /* Number of changes made. */ |
1866 int mc_count; | 1866 int mc_count; |
1867 struct buffer *buf = current_buffer; | 1867 struct buffer *buf = current_buffer; |
1868 Emchar oc; | 1868 Emchar oc; |
1869 | 1869 |
1877 /* Under Mule, string_char(n) is O(n), so for large tables or | 1877 /* Under Mule, string_char(n) is O(n), so for large tables or |
1878 large regions it makes sense to create an array of Emchars. */ | 1878 large regions it makes sense to create an array of Emchars. */ |
1879 if (size * (stop - pos) > 65536) | 1879 if (size * (stop - pos) > 65536) |
1880 { | 1880 { |
1881 Emchar *etable = alloca_array (Emchar, size); | 1881 Emchar *etable = alloca_array (Emchar, size); |
1882 convert_bufbyte_string_into_emchar_string | 1882 convert_intbyte_string_into_emchar_string |
1883 (string_data (stable), string_length (stable), etable); | 1883 (string_data (stable), string_length (stable), etable); |
1884 for (; pos < stop && (oc = BUF_FETCH_CHAR (buf, pos), 1); pos++) | 1884 for (; pos < stop && (oc = BUF_FETCH_CHAR (buf, pos), 1); pos++) |
1885 { | 1885 { |
1886 if (oc < size) | 1886 if (oc < size) |
1887 { | 1887 { |
1995 If optional third arg BUFFER is nil, the current buffer is assumed. | 1995 If optional third arg BUFFER is nil, the current buffer is assumed. |
1996 */ | 1996 */ |
1997 (start, end, buffer)) | 1997 (start, end, buffer)) |
1998 { | 1998 { |
1999 /* This function can GC */ | 1999 /* This function can GC */ |
2000 Bufpos bp_start, bp_end; | 2000 Charbpos bp_start, bp_end; |
2001 struct buffer *buf = decode_buffer (buffer, 1); | 2001 struct buffer *buf = decode_buffer (buffer, 1); |
2002 | 2002 |
2003 get_buffer_range_char (buf, start, end, &bp_start, &bp_end, 0); | 2003 get_buffer_range_char (buf, start, end, &bp_start, &bp_end, 0); |
2004 buffer_delete_range (buf, bp_start, bp_end, 0); | 2004 buffer_delete_range (buf, bp_start, bp_end, 0); |
2005 return Qnil; | 2005 return Qnil; |
2052 When calling from a program, pass two arguments; positions (integers | 2052 When calling from a program, pass two arguments; positions (integers |
2053 or markers) bounding the text that should remain visible. | 2053 or markers) bounding the text that should remain visible. |
2054 */ | 2054 */ |
2055 (start, end, buffer)) | 2055 (start, end, buffer)) |
2056 { | 2056 { |
2057 Bufpos bp_start, bp_end; | 2057 Charbpos bp_start, bp_end; |
2058 struct buffer *buf = decode_buffer (buffer, 1); | 2058 struct buffer *buf = decode_buffer (buffer, 1); |
2059 Bytind bi_start, bi_end; | 2059 Bytebpos bi_start, bi_end; |
2060 | 2060 |
2061 get_buffer_range_char (buf, start, end, &bp_start, &bp_end, | 2061 get_buffer_range_char (buf, start, end, &bp_start, &bp_end, |
2062 GB_ALLOW_PAST_ACCESSIBLE); | 2062 GB_ALLOW_PAST_ACCESSIBLE); |
2063 bi_start = bufpos_to_bytind (buf, bp_start); | 2063 bi_start = charbpos_to_bytebpos (buf, bp_start); |
2064 bi_end = bufpos_to_bytind (buf, bp_end); | 2064 bi_end = charbpos_to_bytebpos (buf, bp_end); |
2065 | 2065 |
2066 SET_BOTH_BUF_BEGV (buf, bp_start, bi_start); | 2066 SET_BOTH_BUF_BEGV (buf, bp_start, bi_start); |
2067 SET_BOTH_BUF_ZV (buf, bp_end, bi_end); | 2067 SET_BOTH_BUF_ZV (buf, bp_end, bi_end); |
2068 if (BUF_PT (buf) < bp_start) | 2068 if (BUF_PT (buf) < bp_start) |
2069 BUF_SET_PT (buf, bp_start); | 2069 BUF_SET_PT (buf, bp_start); |
2117 newhead = 0; | 2117 newhead = 0; |
2118 newtail = 0; | 2118 newtail = 0; |
2119 } | 2119 } |
2120 | 2120 |
2121 { | 2121 { |
2122 Bufpos start, end; | 2122 Charbpos start, end; |
2123 Bytind bi_start, bi_end; | 2123 Bytebpos bi_start, bi_end; |
2124 | 2124 |
2125 start = BUF_BEG (buf) + newhead; | 2125 start = BUF_BEG (buf) + newhead; |
2126 end = BUF_Z (buf) - newtail; | 2126 end = BUF_Z (buf) - newtail; |
2127 | 2127 |
2128 bi_start = bufpos_to_bytind (buf, start); | 2128 bi_start = charbpos_to_bytebpos (buf, start); |
2129 bi_end = bufpos_to_bytind (buf, end); | 2129 bi_end = charbpos_to_bytebpos (buf, end); |
2130 | 2130 |
2131 if (BUF_BEGV (buf) != start) | 2131 if (BUF_BEGV (buf) != start) |
2132 { | 2132 { |
2133 local_clip_changed = 1; | 2133 local_clip_changed = 1; |
2134 SET_BOTH_BUF_BEGV (buf, start, bi_start); | 2134 SET_BOTH_BUF_BEGV (buf, start, bi_start); |
2143 if (local_clip_changed) | 2143 if (local_clip_changed) |
2144 MARK_CLIP_CHANGED; | 2144 MARK_CLIP_CHANGED; |
2145 | 2145 |
2146 /* If point is outside the new visible range, move it inside. */ | 2146 /* If point is outside the new visible range, move it inside. */ |
2147 BUF_SET_PT (buf, | 2147 BUF_SET_PT (buf, |
2148 bufpos_clip_to_bounds (BUF_BEGV (buf), | 2148 charbpos_clip_to_bounds (BUF_BEGV (buf), |
2149 BUF_PT (buf), | 2149 BUF_PT (buf), |
2150 BUF_ZV (buf))); | 2150 BUF_ZV (buf))); |
2151 | 2151 |
2152 return Qnil; | 2152 return Qnil; |
2153 } | 2153 } |
2305 rest untouched. Most of this is copied from adjust_markers in insdel.c. | 2305 rest untouched. Most of this is copied from adjust_markers in insdel.c. |
2306 | 2306 |
2307 It's the caller's job to see that (start1 <= end1 <= start2 <= end2). */ | 2307 It's the caller's job to see that (start1 <= end1 <= start2 <= end2). */ |
2308 | 2308 |
2309 void | 2309 void |
2310 transpose_markers (Bufpos start1, Bufpos end1, Bufpos start2, Bufpos end2) | 2310 transpose_markers (Charbpos start1, Charbpos end1, Charbpos start2, Charbpos end2) |
2311 { | 2311 { |
2312 Charcount amt1, amt2, diff; | 2312 Charcount amt1, amt2, diff; |
2313 Lisp_Object marker; | 2313 Lisp_Object marker; |
2314 struct buffer *buf = current_buffer; | 2314 struct buffer *buf = current_buffer; |
2315 | 2315 |
2341 amt2 = (end1 - start1) + (start2 - end1); | 2341 amt2 = (end1 - start1) + (start2 - end1); |
2342 | 2342 |
2343 for (marker = BUF_MARKERS (buf); !NILP (marker); | 2343 for (marker = BUF_MARKERS (buf); !NILP (marker); |
2344 marker = XMARKER (marker)->chain) | 2344 marker = XMARKER (marker)->chain) |
2345 { | 2345 { |
2346 Bufpos mpos = marker_position (marker); | 2346 Charbpos mpos = marker_position (marker); |
2347 if (mpos >= start1 && mpos < end2) | 2347 if (mpos >= start1 && mpos < end2) |
2348 { | 2348 { |
2349 if (mpos < end1) | 2349 if (mpos < end1) |
2350 mpos += amt1; | 2350 mpos += amt1; |
2351 else if (mpos < start2) | 2351 else if (mpos < start2) |
2370 | 2370 |
2371 Transposing beyond buffer boundaries is an error. | 2371 Transposing beyond buffer boundaries is an error. |
2372 */ | 2372 */ |
2373 (start1, end1, start2, end2, leave_markers)) | 2373 (start1, end1, start2, end2, leave_markers)) |
2374 { | 2374 { |
2375 Bufpos startr1, endr1, startr2, endr2; | 2375 Charbpos startr1, endr1, startr2, endr2; |
2376 Charcount len1, len2; | 2376 Charcount len1, len2; |
2377 Lisp_Object string1, string2; | 2377 Lisp_Object string1, string2; |
2378 struct buffer *buf = current_buffer; | 2378 struct buffer *buf = current_buffer; |
2379 | 2379 |
2380 get_buffer_range_char (buf, start1, end1, &startr1, &endr1, 0); | 2380 get_buffer_range_char (buf, start1, end1, &startr1, &endr1, 0); |