Mercurial > hg > xemacs-beta
annotate lisp/update-elc-2.el @ 5157:1fae11d56ad2
redo memory-usage mechanism, add way of dynamically initializing Lisp objects
-------------------- ChangeLog entries follow: --------------------
lisp/ChangeLog addition:
2010-03-18 Ben Wing <ben@xemacs.org>
* diagnose.el (show-memory-usage):
Rewrite to take into account API changes in memory-usage functions.
src/ChangeLog addition:
2010-03-18 Ben Wing <ben@xemacs.org>
* alloc.c:
* alloc.c (disksave_object_finalization_1):
* alloc.c (lisp_object_storage_size):
* alloc.c (listu):
* alloc.c (listn):
* alloc.c (Fobject_memory_usage_stats):
* alloc.c (compute_memusage_stats_length):
* alloc.c (Fobject_memory_usage):
* alloc.c (Ftotal_object_memory_usage):
* alloc.c (malloced_storage_size):
* alloc.c (common_init_alloc_early):
* alloc.c (reinit_alloc_objects_early):
* alloc.c (reinit_alloc_early):
* alloc.c (init_alloc_once_early):
* alloc.c (syms_of_alloc):
* alloc.c (reinit_vars_of_alloc):
* buffer.c:
* buffer.c (struct buffer_stats):
* buffer.c (compute_buffer_text_usage):
* buffer.c (compute_buffer_usage):
* buffer.c (buffer_memory_usage):
* buffer.c (buffer_objects_create):
* buffer.c (syms_of_buffer):
* buffer.c (vars_of_buffer):
* console-impl.h (struct console_methods):
* dynarr.c (Dynarr_memory_usage):
* emacs.c (main_1):
* events.c (clear_event_resource):
* extents.c:
* extents.c (compute_buffer_extent_usage):
* extents.c (extent_objects_create):
* extents.h:
* faces.c:
* faces.c (compute_face_cachel_usage):
* faces.c (face_objects_create):
* faces.h:
* general-slots.h:
* glyphs.c:
* glyphs.c (compute_glyph_cachel_usage):
* glyphs.c (glyph_objects_create):
* glyphs.h:
* lisp.h:
* lisp.h (struct usage_stats):
* lrecord.h:
* lrecord.h (enum lrecord_type):
* lrecord.h (struct lrecord_implementation):
* lrecord.h (MC_ALLOC_CALL_FINALIZER_FOR_DISKSAVE):
* lrecord.h (DEFINE_DUMPABLE_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_SIZABLE_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_FROB_BLOCK_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_FROB_BLOCK_SIZABLE_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_INTERNAL_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_SIZABLE_INTERNAL_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_SIZABLE_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_FROB_BLOCK_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_FROB_BLOCK_SIZABLE_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_INTERNAL_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_SIZABLE_INTERNAL_LISP_OBJECT):
* lrecord.h (MAKE_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_MODULE_LISP_OBJECT):
* lrecord.h (DEFINE_DUMPABLE_MODULE_SIZABLE_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_MODULE_LISP_OBJECT):
* lrecord.h (DEFINE_NODUMP_MODULE_SIZABLE_LISP_OBJECT):
* lrecord.h (MAKE_MODULE_LISP_OBJECT):
* lrecord.h (INIT_LISP_OBJECT):
* lrecord.h (INIT_MODULE_LISP_OBJECT):
* lrecord.h (UNDEF_LISP_OBJECT):
* lrecord.h (UNDEF_MODULE_LISP_OBJECT):
* lrecord.h (DECLARE_LISP_OBJECT):
* lrecord.h (DECLARE_MODULE_API_LISP_OBJECT):
* lrecord.h (DECLARE_MODULE_LISP_OBJECT):
* lstream.c:
* lstream.c (syms_of_lstream):
* lstream.c (vars_of_lstream):
* marker.c:
* marker.c (compute_buffer_marker_usage):
* mc-alloc.c (mc_alloced_storage_size):
* mc-alloc.h:
* mule-charset.c:
* mule-charset.c (struct charset_stats):
* mule-charset.c (compute_charset_usage):
* mule-charset.c (charset_memory_usage):
* mule-charset.c (mule_charset_objects_create):
* mule-charset.c (syms_of_mule_charset):
* mule-charset.c (vars_of_mule_charset):
* redisplay.c:
* redisplay.c (compute_rune_dynarr_usage):
* redisplay.c (compute_display_block_dynarr_usage):
* redisplay.c (compute_glyph_block_dynarr_usage):
* redisplay.c (compute_display_line_dynarr_usage):
* redisplay.c (compute_line_start_cache_dynarr_usage):
* redisplay.h:
* scrollbar-gtk.c (gtk_compute_scrollbar_instance_usage):
* scrollbar-msw.c (mswindows_compute_scrollbar_instance_usage):
* scrollbar-x.c (x_compute_scrollbar_instance_usage):
* scrollbar.c (compute_scrollbar_instance_usage):
* scrollbar.h:
* symbols.c:
* symbols.c (reinit_symbol_objects_early):
* symbols.c (init_symbols_once_early):
* symbols.c (reinit_symbols_early):
* symbols.c (defsymbol_massage_name_1):
* symsinit.h:
* ui-gtk.c:
* ui-gtk.c (emacs_gtk_object_getprop):
* ui-gtk.c (emacs_gtk_object_putprop):
* ui-gtk.c (ui_gtk_objects_create):
* unicode.c (compute_from_unicode_table_size_1):
* unicode.c (compute_to_unicode_table_size_1):
* unicode.c (compute_from_unicode_table_size):
* unicode.c (compute_to_unicode_table_size):
* window.c:
* window.c (struct window_stats):
* window.c (compute_window_mirror_usage):
* window.c (compute_window_usage):
* window.c (window_memory_usage):
* window.c (window_objects_create):
* window.c (syms_of_window):
* window.c (vars_of_window):
* window.h:
Redo memory-usage mechanism, make it general; add way of dynamically
initializing Lisp object types -- OBJECT_HAS_METHOD(), similar to
CONSOLE_HAS_METHOD().
(1) Create OBJECT_HAS_METHOD(), OBJECT_HAS_PROPERTY() etc. for
specifying that a Lisp object type has a particular method or
property. Call such methods with OBJECT_METH, MAYBE_OBJECT_METH,
OBJECT_METH_OR_GIVEN; retrieve properties with OBJECT_PROPERTY.
Methods that formerly required a DEFINE_*GENERAL_LISP_OBJECT() to
specify them (getprop, putprop, remprop, plist, disksave) now
instead use the dynamic-method mechanism. The main benefit of
this is that new methods or properties can be added without
requiring that the declaration statements of all existing methods
be modified. We have to make the `struct lrecord_implementation'
non-const, but I don't think this should have any effect on speed --
the only possible method that's really speed-critical is the
mark method, and we already extract those out into a separate
(non-const) array for increased cache locality.
Object methods need to be reinitialized after pdump, so we put
them in separate functions such as face_objects_create(),
extent_objects_create() and call them appropriately from emacs.c
The only current object property (`memusage_stats_list') that
objects can specify is a Lisp object and gets staticpro()ed so it
only needs to be set during dump time, but because it references
symbols that might not exist in a syms_of_() function, we
initialize it in vars_of_(). There is also an object property
(`num_extra_memusage_stats') that is automatically initialized based
on `memusage_stats_list'; we do that in reinit_vars_of_alloc(),
which is called after all vars_of_() functions are called.
`disksaver' method was renamed `disksave' to correspond with the
name normally given to the function (e.g. disksave_lstream()).
(2) Generalize the memory-usage mechanism in `buffer-memory-usage',
`window-memory-usage', `charset-memory-usage' into an object-type-
specific mechanism called by a single function
`object-memory-usage'. (Former function `object-memory-usage'
renamed to `total-object-memory-usage'). Generalize the mechanism
of different "slices" so that we can have different "classes" of
memory described and different "slices" onto each class; `t'
separates classes, `nil' separates slices. Currently we have
three classes defined: the memory of an object itself,
non-Lisp-object memory associated with the object (e.g. arrays or
dynarrs stored as fields in the object), and Lisp-object memory
associated with the object (other internal Lisp objects stored in
the object). This isn't completely finished yet and we might need
to further separate the "other internal Lisp objects" class into
two classes.
The memory-usage mechanism uses a `struct usage_stats' (renamed
from `struct overhead_stats') to describe a malloc-view onto a set
of allocated memory (listing how much was requested and various
types of overhead) and a more general `struct generic_usage_stats'
(with a `struct usage_stats' in it) to hold all statistics about
object memory. `struct generic_usage_stats' contains an array of
32 Bytecounts, which are statistics of unspecified semantics. The
intention is that individual types declare a corresponding struct
(e.g. `struct window_stats') with the same structure but with
specific fields in place of the array, corresponding to specific
statistics. The number of such statistics is an object property
computed from the list of tags (Lisp symbols describing the
statistics) stored in `memusage_stats_list'. The idea here is to
allow particular object types to customize the number and
semantics of the statistics where completely avoiding consing.
This doesn't matter so much yet, but the intention is to have the
memory usage of all objects computed at the end of GC, at the same
time as other statistics are currently computed. The values for
all statistics for a single type would be added up to compute
aggregate values for all objects of a specific type. To make this
efficient, we can't allow any memory allocation at all.
(3) Create some additional functions for creating lists that
specify the elements directly as args rather than indirectly through
an array: listn() (number of args given), listu() (list terminated
by Qunbound).
(4) Delete a bit of remaining unused C window_config stuff, also
unused lrecord_type_popup_data.
author | Ben Wing <ben@xemacs.org> |
---|---|
date | Thu, 18 Mar 2010 10:50:06 -0500 |
parents | 9fec7fedbf1b |
children | 308d34e9f07d |
rev | line source |
---|---|
442 | 1 ;;; update-elc-2.el --- Recompile remaining .el files, post-dumping |
2 | |
3 ;; Copyright (C) 1997 by Free Software Foundation, Inc. | |
1261 | 4 ;; Copyright (C) 2000, 2003 Ben Wing. |
442 | 5 |
6 ;; Author: Ben Wing <ben@xemacs.org>, based on cleantree.el by | |
7 ;; Steven L Baur <steve@xemacs.org> | |
8 ;; Maintainer: XEmacs Development Team | |
9 ;; Keywords: internal | |
10 | |
11 ;; This file is part of XEmacs. | |
12 | |
13 ;; XEmacs is free software; you can redistribute it and/or modify it | |
14 ;; under the terms of the GNU General Public License as published by | |
15 ;; the Free Software Foundation; either version 2, or (at your option) | |
16 ;; any later version. | |
17 | |
18 ;; XEmacs is distributed in the hope that it will be useful, but | |
19 ;; WITHOUT ANY WARRANTY; without even the implied warranty of | |
20 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
21 ;; General Public License for more details. | |
22 | |
23 ;; You should have received a copy of the GNU General Public License | |
24 ;; along with XEmacs; see the file COPYING. If not, write to the Free | |
25 ;; Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA | |
26 ;; 02111-1307, USA. | |
27 | |
28 ;;; Synched up with: Not in FSF | |
29 | |
30 ;;; Commentary: | |
31 | |
32 ;; This file should be used after XEmacs has been dumped, to recompile | |
33 ;; all remaining out-of-date .els and clean up orphaned .elcs. It should | |
34 ;; be called as | |
35 ;; | |
36 ;; xemacs -batch -vanilla -l update-elc-2.el -f batch-update-elc-2 ${dirname} | |
37 ;; | |
38 ;; where ${dirname} is the directory tree to recompile, usually `lisp'. | |
39 ;; | |
40 ;; Note that this is very different from update-elc.el, which is called | |
41 ;; BEFORE dumping, handles only the files needed to dump, and is called | |
42 ;; from temacs instead of xemacs. | |
43 ;; | |
44 ;; The original cleantree.el had the comment: This code is derived | |
45 ;; from Gnus based on a suggestion by David Moore <dmoore@ucsd.edu> | |
46 | |
47 ;;; Code: | |
48 | |
1261 | 49 ;; Help debug problems. |
50 (setq stack-trace-on-error t | |
51 load-always-display-messages t) | |
52 | |
442 | 53 (defvar update-elc-ignored-dirs |
54 `("." ".." "CVS" "SCCS" "RCS" ,@(unless (featurep 'mule) '("mule")))) | |
55 | |
56 (defvar update-elc-ignored-files | |
57 ;; note: entries here are regexps | |
58 '("^," ;; #### huh? | |
444 | 59 "^paths\\.el$" |
60 "^loadup\\.el$" | |
61 "^loadup-el\\.el$" | |
62 "^update-elc\\.el$" | |
63 "^update-elc-2\\.el$" | |
64 "^dumped-lisp\\.el$" | |
65 "^make-docfile\\.el$" | |
66 "^site-start\\.el$" | |
67 "^site-load\\.el$" | |
4246 | 68 "^site-init\\.el$")) |
442 | 69 |
1298 | 70 (defvar dirfiles-table (make-hash-table :test 'equal)) |
71 | |
442 | 72 ;; SEEN accumulates the list of already-handled dirs. |
73 (defun do-update-elc-2 (dir compile-stage-p seen) | |
74 (setq dir (file-name-as-directory dir)) | |
75 ;; Only scan this sub-tree if we haven't been here yet. | |
76 (unless (member (file-truename dir) seen) | |
77 (push (file-truename dir) seen) | |
78 | |
1298 | 79 (let ((files (or (gethash dir dirfiles-table) |
80 (directory-files dir t nil t)))) | |
81 | |
82 ;; Do this directory. | |
83 (if compile-stage-p | |
84 ;; Stage 2: Recompile necessary .els | |
85 (dolist (file files) | |
86 (when (string-match "\\.el$" file) | |
87 (let ((file-c (concat file "c"))) | |
88 (when (and (not (member file-c files)) | |
89 ;; no need to check for out-of-date-ness because | |
90 ;; that was already done, and .elc removed. | |
91 (let (ignore) | |
92 (mapcar | |
93 #'(lambda (regexp) | |
94 (if (string-match | |
95 regexp | |
96 (file-name-nondirectory file)) | |
97 (setq ignore t))) | |
98 update-elc-ignored-files) | |
99 (not ignore))) | |
100 (byte-compile-file file))))) | |
442 | 101 |
1298 | 102 ;; Stage 1. |
103 ;; Remove out-of-date elcs | |
104 (let (deleted) | |
105 (dolist (file files) | |
106 (when (string-match "\\.el$" file) | |
107 (let ((file-c (concat file "c"))) | |
108 (when (and (member file-c files) | |
109 (file-newer-than-file-p file file-c)) | |
110 (message "Removing out-of-date %s" file-c) | |
111 (delete-file file-c) | |
112 (push file-c deleted))))) | |
442 | 113 |
1298 | 114 ;; Remove elcs without corresponding el |
115 (dolist (file-c files) | |
116 (when (string-match "\\.elc$" file-c) | |
117 (let ((file (replace-in-string file-c "c$" ""))) | |
118 (when (not (member file files)) | |
119 (message "Removing %s; no corresponding .el" file-c) | |
120 (delete-file file-c) | |
121 (push file-c deleted))))) | |
442 | 122 |
1303 | 123 (setq files (set-difference files deleted :test 'equal)))) |
1298 | 124 |
125 (puthash dir files dirfiles-table) | |
126 | |
127 ;; We descend recursively. On my Windows machine, it is much faster | |
128 ;; to call directory-files again to recompute than to call | |
129 ;; file-directory-p on each member of the files list. | |
130 (dolist (dir (directory-files dir t nil t 'dir)) | |
131 (when (not (member (file-name-nondirectory dir) | |
132 update-elc-ignored-dirs)) | |
133 (do-update-elc-2 dir compile-stage-p seen)))))) | |
442 | 134 |
135 (defun batch-update-elc-2 () | |
136 (defvar command-line-args-left) | |
137 (unless noninteractive | |
138 (error "`batch-update-elc-2' is to be used only with -batch")) | |
139 (let ((dir (car command-line-args-left))) | |
1298 | 140 ;; don't depend on being able to autoload `update-autoload-files'! |
141 (load "autoload") | |
142 (load "bytecomp") | |
143 (load "byte-optimize") | |
144 ;; #### the API used here is deprecated, convert to one with explicit | |
145 ;; arguments when it is available | |
146 ;; update-elc.el signals us to rebuild the autoloads when necessary. | |
147 ;; in some cases it will rebuild the autoloads itself, but doing it this | |
148 ;; way is slow, so we avoid it when possible. | |
1330 | 149 (when (file-exists-p (expand-file-name "REBUILD_AUTOLOADS" |
150 invocation-directory)) | |
2548 | 151 ;; if we were instructed to rebuild the autoloads, force the file |
152 ;; to be touched even w/o changes; otherwise, we won't ever stop | |
153 ;; being told to rebuild them. | |
154 (update-autoload-files dir "auto" nil t) | |
155 (byte-recompile-file (expand-file-name "auto-autoloads.el" dir) 0) | |
1298 | 156 (when (featurep 'mule) |
2548 | 157 (let ((muledir (expand-file-name "../lisp/mule" (file-truename dir)))) |
1330 | 158 ;; force here just like above. |
2548 | 159 (update-autoload-files muledir "mule" nil t) |
160 (byte-recompile-file (expand-file-name "auto-autoloads.el" dir) 0)))) | |
1298 | 161 (when (featurep 'modules) |
162 (let* ((moddir (expand-file-name "../modules" (file-truename dir))) | |
2548 | 163 (autofile (expand-file-name "auto-autoloads.el" moddir))) |
164 (update-autoload-files | |
1298 | 165 (delete (concat (file-name-as-directory moddir) ".") |
166 (delete (concat (file-name-as-directory moddir) "..") | |
167 (directory-files moddir t nil nil 0))) | |
2548 | 168 "modules" autofile) |
169 (byte-recompile-file autofile 0))) | |
1298 | 170 ;; now load the (perhaps newly rebuilt) autoloads; we were called with |
171 ;; -no-autoloads so they're not already loaded. | |
1330 | 172 (load (expand-file-name "auto-autoloads" lisp-directory)) |
1298 | 173 (when (featurep 'mule) |
1330 | 174 (load (expand-file-name "mule/auto-autoloads" lisp-directory))) |
442 | 175 ;; We remove all the bad .elcs before any byte-compilation, because |
176 ;; there may be dependencies between one .el and another (even across | |
177 ;; directories), and we don't want to load an out-of-date .elc while | |
178 ;; byte-compiling a file. | |
179 (message "Removing old or spurious .elcs in directory tree `%s'..." dir) | |
180 (do-update-elc-2 dir nil nil) | |
181 (message "Removing old or spurious .elcs in directory tree `%s'...done" | |
182 dir) | |
183 (message "Recompiling updated .els in directory tree `%s'..." dir) | |
184 (do-update-elc-2 dir t nil) | |
528 | 185 (message "Recompiling updated .els in directory tree `%s'...done" dir) |
186 ;; likewise here. | |
187 (load "cus-dep") | |
188 (Custom-make-dependencies dir) | |
189 (byte-recompile-file (expand-file-name "custom-load.el" dir) 0) | |
190 (when (featurep 'mule) | |
191 (Custom-make-dependencies (expand-file-name "mule" dir)) | |
4246 | 192 (byte-recompile-file (expand-file-name "mule/custom-load.el" dir) 0) |
193 ;; See the eval-when-compile in the definition of | |
194 ;; Installation-file-coding-system; if the file name sniffing or the | |
195 ;; available coding systems have changed, version.elc should be | |
196 ;; rebuilt. | |
197 (byte-recompile-file (expand-file-name "version.el" dir) 0))) | |
442 | 198 (setq command-line-args-left nil)) |
199 | |
444 | 200 ;;; update-elc-2.el ends here |