Mercurial > hg > xemacs-beta
comparison src/dumper.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 | b39c14581166 |
children | 943eaba38521 |
comparison
equal
deleted
inserted
replaced
664:6e99cc8c6ca5 | 665:fdefd0186b75 |
---|---|
43 #endif | 43 #endif |
44 | 44 |
45 typedef struct | 45 typedef struct |
46 { | 46 { |
47 const void *varaddress; | 47 const void *varaddress; |
48 Memory_Count size; | 48 Bytecount size; |
49 } pdump_opaque; | 49 } pdump_opaque; |
50 | 50 |
51 typedef struct | 51 typedef struct |
52 { | 52 { |
53 Dynarr_declare (pdump_opaque); | 53 Dynarr_declare (pdump_opaque); |
82 static Lisp_Object_ptr_dynarr *pdump_weak_object_chains; | 82 static Lisp_Object_ptr_dynarr *pdump_weak_object_chains; |
83 | 83 |
84 /* Mark SIZE bytes at non-heap address VARADDRESS for dumping as is, | 84 /* Mark SIZE bytes at non-heap address VARADDRESS for dumping as is, |
85 without any bit-twiddling. */ | 85 without any bit-twiddling. */ |
86 void | 86 void |
87 dump_add_opaque (const void *varaddress, Memory_Count size) | 87 dump_add_opaque (const void *varaddress, Bytecount size) |
88 { | 88 { |
89 pdump_opaque info; | 89 pdump_opaque info; |
90 info.varaddress = varaddress; | 90 info.varaddress = varaddress; |
91 info.size = size; | 91 info.size = size; |
92 if (pdump_opaques == NULL) | 92 if (pdump_opaques == NULL) |
127 Dynarr_add (pdump_weak_object_chains, varaddress); | 127 Dynarr_add (pdump_weak_object_chains, varaddress); |
128 } | 128 } |
129 | 129 |
130 | 130 |
131 inline static void | 131 inline static void |
132 pdump_align_stream (FILE *stream, Memory_Count alignment) | 132 pdump_align_stream (FILE *stream, Bytecount alignment) |
133 { | 133 { |
134 long offset = ftell (stream); | 134 long offset = ftell (stream); |
135 long adjustment = ALIGN_SIZE (offset, alignment) - offset; | 135 long adjustment = ALIGN_SIZE (offset, alignment) - offset; |
136 if (adjustment) | 136 if (adjustment) |
137 fseek (stream, adjustment, SEEK_CUR); | 137 fseek (stream, adjustment, SEEK_CUR); |
213 int nb_opaques; | 213 int nb_opaques; |
214 } pdump_header; | 214 } pdump_header; |
215 | 215 |
216 char *pdump_start; | 216 char *pdump_start; |
217 char *pdump_end; | 217 char *pdump_end; |
218 static Memory_Count pdump_length; | 218 static Bytecount pdump_length; |
219 | 219 |
220 #ifdef WIN32_NATIVE | 220 #ifdef WIN32_NATIVE |
221 /* Handle for the dump file */ | 221 /* Handle for the dump file */ |
222 static HANDLE pdump_hFile = INVALID_HANDLE_VALUE; | 222 static HANDLE pdump_hFile = INVALID_HANDLE_VALUE; |
223 /* Handle for the file mapping object for the dump file */ | 223 /* Handle for the file mapping object for the dump file */ |
233 32, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, | 233 32, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, |
234 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1 | 234 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1 |
235 }; | 235 }; |
236 | 236 |
237 static inline int | 237 static inline int |
238 pdump_size_to_align (Memory_Count size) | 238 pdump_size_to_align (Bytecount size) |
239 { | 239 { |
240 return pdump_align_table[size % countof (pdump_align_table)]; | 240 return pdump_align_table[size % countof (pdump_align_table)]; |
241 } | 241 } |
242 | 242 |
243 typedef struct pdump_entry_list_elt | 243 typedef struct pdump_entry_list_elt |
244 { | 244 { |
245 struct pdump_entry_list_elt *next; | 245 struct pdump_entry_list_elt *next; |
246 const void *obj; | 246 const void *obj; |
247 Memory_Count size; | 247 Bytecount size; |
248 int count; | 248 int count; |
249 EMACS_INT save_offset; | 249 EMACS_INT save_offset; |
250 } pdump_entry_list_elt; | 250 } pdump_entry_list_elt; |
251 | 251 |
252 typedef struct | 252 typedef struct |
274 static pdump_struct_list pdump_struct_table; | 274 static pdump_struct_list pdump_struct_table; |
275 | 275 |
276 static int *pdump_alert_undump_object; | 276 static int *pdump_alert_undump_object; |
277 | 277 |
278 static unsigned long cur_offset; | 278 static unsigned long cur_offset; |
279 static Memory_Count max_size; | 279 static Bytecount max_size; |
280 static int pdump_fd; | 280 static int pdump_fd; |
281 static void *pdump_buf; | 281 static void *pdump_buf; |
282 static FILE *pdump_out; | 282 static FILE *pdump_out; |
283 | 283 |
284 #define PDUMP_HASHSIZE 200001 | 284 #define PDUMP_HASHSIZE 200001 |
311 } | 311 } |
312 return 0; | 312 return 0; |
313 } | 313 } |
314 | 314 |
315 static void | 315 static void |
316 pdump_add_entry (pdump_entry_list *list, const void *obj, Memory_Count size, | 316 pdump_add_entry (pdump_entry_list *list, const void *obj, Bytecount size, |
317 int count) | 317 int count) |
318 { | 318 { |
319 pdump_entry_list_elt *e; | 319 pdump_entry_list_elt *e; |
320 int pos = pdump_make_hash (obj); | 320 int pos = pdump_make_hash (obj); |
321 | 321 |
421 int delta = XD_INDIRECT_DELTA (code); | 421 int delta = XD_INDIRECT_DELTA (code); |
422 | 422 |
423 irdata = ((char *)idata) + idesc[line].offset; | 423 irdata = ((char *)idata) + idesc[line].offset; |
424 switch (idesc[line].type) | 424 switch (idesc[line].type) |
425 { | 425 { |
426 case XD_MEMORY_COUNT: | 426 case XD_BYTECOUNT: |
427 count = *(Memory_Count *)irdata; | 427 count = *(Bytecount *)irdata; |
428 break; | 428 break; |
429 case XD_ELEMENT_COUNT: | 429 case XD_ELEMCOUNT: |
430 count = *(Element_Count *)irdata; | 430 count = *(Elemcount *)irdata; |
431 break; | 431 break; |
432 case XD_HASH_CODE: | 432 case XD_HASHCODE: |
433 count = *(Hash_Code *)irdata; | 433 count = *(Hashcode *)irdata; |
434 break; | 434 break; |
435 case XD_INT: | 435 case XD_INT: |
436 count = *(int *)irdata; | 436 count = *(int *)irdata; |
437 break; | 437 break; |
438 case XD_LONG: | 438 case XD_LONG: |
439 count = *(long *)irdata; | 439 count = *(long *)irdata; |
440 break; | 440 break; |
441 case XD_BYTECOUNT: | |
442 count = *(Bytecount *)irdata; | |
443 break; | |
444 default: | 441 default: |
445 stderr_out ("Unsupported count type : %d (line = %d, code=%ld)\n", | 442 stderr_out ("Unsupported count type : %d (line = %d, code=%ld)\n", |
446 idesc[line].type, line, (long)code); | 443 idesc[line].type, line, (long)code); |
447 pdump_backtrace (); | 444 pdump_backtrace (); |
448 count = 0; /* warning suppression */ | 445 count = 0; /* warning suppression */ |
469 { | 466 { |
470 case XD_SPECIFIER_END: | 467 case XD_SPECIFIER_END: |
471 pos = 0; | 468 pos = 0; |
472 desc = ((const Lisp_Specifier *)data)->methods->extra_description; | 469 desc = ((const Lisp_Specifier *)data)->methods->extra_description; |
473 goto restart; | 470 goto restart; |
474 case XD_MEMORY_COUNT: | 471 case XD_BYTECOUNT: |
475 case XD_ELEMENT_COUNT: | 472 case XD_ELEMCOUNT: |
476 case XD_HASH_CODE: | 473 case XD_HASHCODE: |
477 case XD_INT: | 474 case XD_INT: |
478 case XD_LONG: | 475 case XD_LONG: |
479 case XD_BYTECOUNT: | |
480 case XD_INT_RESET: | 476 case XD_INT_RESET: |
481 case XD_LO_LINK: | 477 case XD_LO_LINK: |
482 break; | 478 break; |
483 case XD_OPAQUE_DATA_PTR: | 479 case XD_OPAQUE_DATA_PTR: |
484 { | 480 { |
632 | 628 |
633 static void | 629 static void |
634 pdump_dump_data (pdump_entry_list_elt *elt, | 630 pdump_dump_data (pdump_entry_list_elt *elt, |
635 const struct lrecord_description *desc) | 631 const struct lrecord_description *desc) |
636 { | 632 { |
637 Memory_Count size = elt->size; | 633 Bytecount size = elt->size; |
638 int count = elt->count; | 634 int count = elt->count; |
639 if (desc) | 635 if (desc) |
640 { | 636 { |
641 int pos, i; | 637 int pos, i; |
642 memcpy (pdump_buf, elt->obj, size*count); | 638 memcpy (pdump_buf, elt->obj, size*count); |
651 switch (desc[pos].type) | 647 switch (desc[pos].type) |
652 { | 648 { |
653 case XD_SPECIFIER_END: | 649 case XD_SPECIFIER_END: |
654 desc = ((const Lisp_Specifier *)(elt->obj))->methods->extra_description; | 650 desc = ((const Lisp_Specifier *)(elt->obj))->methods->extra_description; |
655 goto restart; | 651 goto restart; |
656 case XD_MEMORY_COUNT: | 652 case XD_BYTECOUNT: |
657 case XD_ELEMENT_COUNT: | 653 case XD_ELEMCOUNT: |
658 case XD_HASH_CODE: | 654 case XD_HASHCODE: |
659 case XD_INT: | 655 case XD_INT: |
660 case XD_LONG: | 656 case XD_LONG: |
661 case XD_BYTECOUNT: | |
662 break; | 657 break; |
663 case XD_INT_RESET: | 658 case XD_INT_RESET: |
664 { | 659 { |
665 EMACS_INT val = desc[pos].data1; | 660 EMACS_INT val = desc[pos].data1; |
666 if (XD_IS_INDIRECT (val)) | 661 if (XD_IS_INDIRECT (val)) |
749 { | 744 { |
750 case XD_SPECIFIER_END: | 745 case XD_SPECIFIER_END: |
751 pos = 0; | 746 pos = 0; |
752 desc = ((const Lisp_Specifier *)data)->methods->extra_description; | 747 desc = ((const Lisp_Specifier *)data)->methods->extra_description; |
753 goto restart; | 748 goto restart; |
754 case XD_MEMORY_COUNT: | 749 case XD_BYTECOUNT: |
755 case XD_ELEMENT_COUNT: | 750 case XD_ELEMCOUNT: |
756 case XD_HASH_CODE: | 751 case XD_HASHCODE: |
757 case XD_INT: | 752 case XD_INT: |
758 case XD_LONG: | 753 case XD_LONG: |
759 case XD_BYTECOUNT: | |
760 case XD_INT_RESET: | 754 case XD_INT_RESET: |
761 break; | 755 break; |
762 case XD_OPAQUE_DATA_PTR: | 756 case XD_OPAQUE_DATA_PTR: |
763 case XD_C_STRING: | 757 case XD_C_STRING: |
764 case XD_STRUCT_PTR: | 758 case XD_STRUCT_PTR: |
814 | 808 |
815 static void | 809 static void |
816 pdump_allocate_offset (pdump_entry_list_elt *elt, | 810 pdump_allocate_offset (pdump_entry_list_elt *elt, |
817 const struct lrecord_description *desc) | 811 const struct lrecord_description *desc) |
818 { | 812 { |
819 Memory_Count size = elt->count * elt->size; | 813 Bytecount size = elt->count * elt->size; |
820 elt->save_offset = cur_offset; | 814 elt->save_offset = cur_offset; |
821 if (size>max_size) | 815 if (size>max_size) |
822 max_size = size; | 816 max_size = size; |
823 cur_offset += size; | 817 cur_offset += size; |
824 } | 818 } |
855 | 849 |
856 static void | 850 static void |
857 pdump_dump_root_struct_ptrs (void) | 851 pdump_dump_root_struct_ptrs (void) |
858 { | 852 { |
859 int i; | 853 int i; |
860 Element_Count count = Dynarr_length (pdump_root_struct_ptrs); | 854 Elemcount count = Dynarr_length (pdump_root_struct_ptrs); |
861 pdump_static_pointer *data = alloca_array (pdump_static_pointer, count); | 855 pdump_static_pointer *data = alloca_array (pdump_static_pointer, count); |
862 for (i = 0; i < count; i++) | 856 for (i = 0; i < count; i++) |
863 { | 857 { |
864 data[i].address = (char **) Dynarr_atp (pdump_root_struct_ptrs, i)->ptraddress; | 858 data[i].address = (char **) Dynarr_atp (pdump_root_struct_ptrs, i)->ptraddress; |
865 data[i].value = (char *) pdump_get_entry (* data[i].address)->save_offset; | 859 data[i].value = (char *) pdump_get_entry (* data[i].address)->save_offset; |
931 } | 925 } |
932 | 926 |
933 static void | 927 static void |
934 pdump_dump_root_objects (void) | 928 pdump_dump_root_objects (void) |
935 { | 929 { |
936 Element_Count count = (Dynarr_length (pdump_root_objects) + | 930 Elemcount count = (Dynarr_length (pdump_root_objects) + |
937 Dynarr_length (pdump_weak_object_chains)); | 931 Dynarr_length (pdump_weak_object_chains)); |
938 Element_Count i; | 932 Elemcount i; |
939 | 933 |
940 PDUMP_WRITE_ALIGNED (Element_Count, count); | 934 PDUMP_WRITE_ALIGNED (Elemcount, count); |
941 PDUMP_ALIGN_OUTPUT (pdump_static_Lisp_Object); | 935 PDUMP_ALIGN_OUTPUT (pdump_static_Lisp_Object); |
942 | 936 |
943 for (i = 0; i < Dynarr_length (pdump_root_objects); i++) | 937 for (i = 0; i < Dynarr_length (pdump_root_objects); i++) |
944 { | 938 { |
945 pdump_static_Lisp_Object obj; | 939 pdump_static_Lisp_Object obj; |
1153 if (!(--count)) | 1147 if (!(--count)) |
1154 break; | 1148 break; |
1155 } | 1149 } |
1156 | 1150 |
1157 /* Put the pdump_root_objects variables in place */ | 1151 /* Put the pdump_root_objects variables in place */ |
1158 i = PDUMP_READ_ALIGNED (p, Element_Count); | 1152 i = PDUMP_READ_ALIGNED (p, Elemcount); |
1159 p = (char *) ALIGN_PTR (p, ALIGNOF (pdump_static_Lisp_Object)); | 1153 p = (char *) ALIGN_PTR (p, ALIGNOF (pdump_static_Lisp_Object)); |
1160 while (i--) | 1154 while (i--) |
1161 { | 1155 { |
1162 pdump_static_Lisp_Object obj = PDUMP_READ (p, pdump_static_Lisp_Object); | 1156 pdump_static_Lisp_Object obj = PDUMP_READ (p, pdump_static_Lisp_Object); |
1163 | 1157 |
1269 if (pdump_start == NULL) | 1263 if (pdump_start == NULL) |
1270 return 0; | 1264 return 0; |
1271 | 1265 |
1272 pdump_free = pdump_resource_free; | 1266 pdump_free = pdump_resource_free; |
1273 pdump_length = SizeofResource (NULL, hRes); | 1267 pdump_length = SizeofResource (NULL, hRes); |
1274 if (pdump_length <= (Memory_Count) sizeof (pdump_header)) | 1268 if (pdump_length <= (Bytecount) sizeof (pdump_header)) |
1275 { | 1269 { |
1276 pdump_start = 0; | 1270 pdump_start = 0; |
1277 return 0; | 1271 return 0; |
1278 } | 1272 } |
1279 | 1273 |
1302 int fd = open (path, O_RDONLY | OPEN_BINARY); | 1296 int fd = open (path, O_RDONLY | OPEN_BINARY); |
1303 if (fd<0) | 1297 if (fd<0) |
1304 return 0; | 1298 return 0; |
1305 | 1299 |
1306 pdump_length = lseek (fd, 0, SEEK_END); | 1300 pdump_length = lseek (fd, 0, SEEK_END); |
1307 if (pdump_length < (Memory_Count) sizeof (pdump_header)) | 1301 if (pdump_length < (Bytecount) sizeof (pdump_header)) |
1308 { | 1302 { |
1309 close (fd); | 1303 close (fd); |
1310 return 0; | 1304 return 0; |
1311 } | 1305 } |
1312 | 1306 |