Mercurial > hg > xemacs-beta
comparison src/marker.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 | 183866b06e0b |
children | e38acbeb1cae |
comparison
equal
deleted
inserted
replaced
664:6e99cc8c6ca5 | 665:fdefd0186b75 |
---|---|
79 { | 79 { |
80 Lisp_Marker *marker1 = XMARKER (obj1); | 80 Lisp_Marker *marker1 = XMARKER (obj1); |
81 Lisp_Marker *marker2 = XMARKER (obj2); | 81 Lisp_Marker *marker2 = XMARKER (obj2); |
82 | 82 |
83 return ((marker1->buffer == marker2->buffer) && | 83 return ((marker1->buffer == marker2->buffer) && |
84 (marker1->memind == marker2->memind || | 84 (marker1->membpos == marker2->membpos || |
85 /* All markers pointing nowhere are equal */ | 85 /* All markers pointing nowhere are equal */ |
86 !marker1->buffer)); | 86 !marker1->buffer)); |
87 } | 87 } |
88 | 88 |
89 static unsigned long | 89 static unsigned long |
90 marker_hash (Lisp_Object obj, int depth) | 90 marker_hash (Lisp_Object obj, int depth) |
91 { | 91 { |
92 unsigned long hash = (unsigned long) XMARKER (obj)->buffer; | 92 unsigned long hash = (unsigned long) XMARKER (obj)->buffer; |
93 if (hash) | 93 if (hash) |
94 hash = HASH2 (hash, XMARKER (obj)->memind); | 94 hash = HASH2 (hash, XMARKER (obj)->membpos); |
95 return hash; | 95 return hash; |
96 } | 96 } |
97 | 97 |
98 static const struct lrecord_description marker_description[] = { | 98 static const struct lrecord_description marker_description[] = { |
99 { XD_LISP_OBJECT, offsetof (Lisp_Marker, next) }, | 99 { XD_LISP_OBJECT, offsetof (Lisp_Marker, next) }, |
169 | 169 |
170 static Lisp_Object | 170 static Lisp_Object |
171 set_marker_internal (Lisp_Object marker, Lisp_Object position, | 171 set_marker_internal (Lisp_Object marker, Lisp_Object position, |
172 Lisp_Object buffer, int restricted_p) | 172 Lisp_Object buffer, int restricted_p) |
173 { | 173 { |
174 Bufpos charno; | 174 Charbpos charno; |
175 struct buffer *b; | 175 struct buffer *b; |
176 Lisp_Marker *m; | 176 Lisp_Marker *m; |
177 int point_p; | 177 int point_p; |
178 | 178 |
179 CHECK_MARKER (marker); | 179 CHECK_MARKER (marker); |
235 marker); | 235 marker); |
236 #endif | 236 #endif |
237 } | 237 } |
238 else | 238 else |
239 { | 239 { |
240 m->memind = bufpos_to_memind (b, charno); | 240 m->membpos = charbpos_to_membpos (b, charno); |
241 } | 241 } |
242 | 242 |
243 if (m->buffer != b) | 243 if (m->buffer != b) |
244 { | 244 { |
245 if (point_p) | 245 if (point_p) |
317 #endif | 317 #endif |
318 | 318 |
319 marker->buffer = 0; | 319 marker->buffer = 0; |
320 } | 320 } |
321 | 321 |
322 Bytind | 322 Bytebpos |
323 bi_marker_position (Lisp_Object marker) | 323 bi_marker_position (Lisp_Object marker) |
324 { | 324 { |
325 Lisp_Marker *m = XMARKER (marker); | 325 Lisp_Marker *m = XMARKER (marker); |
326 struct buffer *buf = m->buffer; | 326 struct buffer *buf = m->buffer; |
327 Bytind pos; | 327 Bytebpos pos; |
328 | 328 |
329 if (!buf) | 329 if (!buf) |
330 invalid_argument ("Marker does not point anywhere", Qunbound); | 330 invalid_argument ("Marker does not point anywhere", Qunbound); |
331 | 331 |
332 /* FSF claims that marker indices could end up denormalized, i.e. | 332 /* FSF claims that marker indices could end up denormalized, i.e. |
333 in the gap. This is way bogus if it ever happens, and means | 333 in the gap. This is way bogus if it ever happens, and means |
334 something fucked up elsewhere. Since I've overhauled all this | 334 something fucked up elsewhere. Since I've overhauled all this |
335 shit, I don't think this can happen. In any case, the following | 335 shit, I don't think this can happen. In any case, the following |
336 macro has an assert() in it that will catch these denormalized | 336 macro has an assert() in it that will catch these denormalized |
337 positions. */ | 337 positions. */ |
338 pos = memind_to_bytind (buf, m->memind); | 338 pos = membpos_to_bytebpos (buf, m->membpos); |
339 | 339 |
340 #ifdef ERROR_CHECK_BUFPOS | 340 #ifdef ERROR_CHECK_CHARBPOS |
341 if (pos < BI_BUF_BEG (buf) || pos > BI_BUF_Z (buf)) | 341 if (pos < BI_BUF_BEG (buf) || pos > BI_BUF_Z (buf)) |
342 abort (); | 342 abort (); |
343 #endif | 343 #endif |
344 | 344 |
345 return pos; | 345 return pos; |
346 } | 346 } |
347 | 347 |
348 Bufpos | 348 Charbpos |
349 marker_position (Lisp_Object marker) | 349 marker_position (Lisp_Object marker) |
350 { | 350 { |
351 struct buffer *buf = XMARKER (marker)->buffer; | 351 struct buffer *buf = XMARKER (marker)->buffer; |
352 | 352 |
353 if (!buf) | 353 if (!buf) |
354 invalid_argument ("Marker does not point anywhere", Qunbound); | 354 invalid_argument ("Marker does not point anywhere", Qunbound); |
355 | 355 |
356 return bytind_to_bufpos (buf, bi_marker_position (marker)); | 356 return bytebpos_to_charbpos (buf, bi_marker_position (marker)); |
357 } | 357 } |
358 | 358 |
359 void | 359 void |
360 set_bi_marker_position (Lisp_Object marker, Bytind pos) | 360 set_bi_marker_position (Lisp_Object marker, Bytebpos pos) |
361 { | 361 { |
362 Lisp_Marker *m = XMARKER (marker); | 362 Lisp_Marker *m = XMARKER (marker); |
363 struct buffer *buf = m->buffer; | 363 struct buffer *buf = m->buffer; |
364 | 364 |
365 if (!buf) | 365 if (!buf) |
366 invalid_argument ("Marker does not point anywhere", Qunbound); | 366 invalid_argument ("Marker does not point anywhere", Qunbound); |
367 | 367 |
368 #ifdef ERROR_CHECK_BUFPOS | 368 #ifdef ERROR_CHECK_CHARBPOS |
369 if (pos < BI_BUF_BEG (buf) || pos > BI_BUF_Z (buf)) | 369 if (pos < BI_BUF_BEG (buf) || pos > BI_BUF_Z (buf)) |
370 abort (); | 370 abort (); |
371 #endif | 371 #endif |
372 | 372 |
373 m->memind = bytind_to_memind (buf, pos); | 373 m->membpos = bytebpos_to_membpos (buf, pos); |
374 } | 374 } |
375 | 375 |
376 void | 376 void |
377 set_marker_position (Lisp_Object marker, Bufpos pos) | 377 set_marker_position (Lisp_Object marker, Charbpos pos) |
378 { | 378 { |
379 struct buffer *buf = XMARKER (marker)->buffer; | 379 struct buffer *buf = XMARKER (marker)->buffer; |
380 | 380 |
381 if (!buf) | 381 if (!buf) |
382 invalid_argument ("Marker does not point anywhere", Qunbound); | 382 invalid_argument ("Marker does not point anywhere", Qunbound); |
383 | 383 |
384 set_bi_marker_position (marker, bufpos_to_bytind (buf, pos)); | 384 set_bi_marker_position (marker, charbpos_to_bytebpos (buf, pos)); |
385 } | 385 } |
386 | 386 |
387 static Lisp_Object | 387 static Lisp_Object |
388 copy_marker_1 (Lisp_Object marker, Lisp_Object type, int noseeum) | 388 copy_marker_1 (Lisp_Object marker, Lisp_Object type, int noseeum) |
389 { | 389 { |
465 Return t if there are markers pointing at POSITION in the current buffer. | 465 Return t if there are markers pointing at POSITION in the current buffer. |
466 */ | 466 */ |
467 (position)) | 467 (position)) |
468 { | 468 { |
469 Lisp_Marker *marker; | 469 Lisp_Marker *marker; |
470 Memind pos; | 470 Membpos pos; |
471 | 471 |
472 /* A small optimization trick: convert POS to memind now, rather | 472 /* A small optimization trick: convert POS to membpos now, rather |
473 than converting every marker's memory index to bufpos. */ | 473 than converting every marker's memory index to charbpos. */ |
474 pos = bytind_to_memind (current_buffer, | 474 pos = bytebpos_to_membpos (current_buffer, |
475 get_buffer_pos_byte (current_buffer, position, | 475 get_buffer_pos_byte (current_buffer, position, |
476 GB_COERCE_RANGE)); | 476 GB_COERCE_RANGE)); |
477 | 477 |
478 for (marker = BUF_MARKERS (current_buffer); | 478 for (marker = BUF_MARKERS (current_buffer); |
479 marker; | 479 marker; |
480 marker = marker_next (marker)) | 480 marker = marker_next (marker)) |
481 { | 481 { |
482 /* We use marker->memind, so we don't have to go through the | 482 /* We use marker->membpos, so we don't have to go through the |
483 unwieldy operation of creating a Lisp_Object for | 483 unwieldy operation of creating a Lisp_Object for |
484 marker_position() every time around. */ | 484 marker_position() every time around. */ |
485 if (marker->memind == pos) | 485 if (marker->membpos == pos) |
486 return Qt; | 486 return Qt; |
487 } | 487 } |
488 | 488 |
489 return Qnil; | 489 return Qnil; |
490 } | 490 } |