Mercurial > hg > xemacs-beta
annotate lisp/byte-optimize.el @ 5043:d0c14ea98592
various frame-geometry fixes
-------------------- ChangeLog entries follow: --------------------
src/ChangeLog addition:
2010-02-15 Ben Wing <ben@xemacs.org>
* EmacsFrame.c:
* EmacsFrame.c (EmacsFrameResize):
* console-msw-impl.h:
* console-msw-impl.h (struct mswindows_frame):
* console-msw-impl.h (FRAME_MSWINDOWS_TARGET_RECT):
* device-tty.c:
* device-tty.c (tty_asynch_device_change):
* event-msw.c:
* event-msw.c (mswindows_wnd_proc):
* faces.c (Fface_list):
* faces.h:
* frame-gtk.c:
* frame-gtk.c (gtk_set_initial_frame_size):
* frame-gtk.c (gtk_set_frame_size):
* frame-msw.c:
* frame-msw.c (mswindows_init_frame_1):
* frame-msw.c (mswindows_set_frame_size):
* frame-msw.c (mswindows_size_frame_internal):
* frame-msw.c (msprinter_init_frame_3):
* frame.c:
* frame.c (enum):
* frame.c (Fmake_frame):
* frame.c (adjust_frame_size):
* frame.c (store_minibuf_frame_prop):
* frame.c (Fframe_property):
* frame.c (Fframe_properties):
* frame.c (Fframe_displayable_pixel_height):
* frame.c (Fframe_displayable_pixel_width):
* frame.c (internal_set_frame_size):
* frame.c (Fset_frame_height):
* frame.c (Fset_frame_pixel_height):
* frame.c (Fset_frame_displayable_pixel_height):
* frame.c (Fset_frame_width):
* frame.c (Fset_frame_pixel_width):
* frame.c (Fset_frame_displayable_pixel_width):
* frame.c (Fset_frame_size):
* frame.c (Fset_frame_pixel_size):
* frame.c (Fset_frame_displayable_pixel_size):
* frame.c (frame_conversion_internal_1):
* frame.c (get_frame_displayable_pixel_size):
* frame.c (change_frame_size_1):
* frame.c (change_frame_size):
* frame.c (generate_title_string):
* frame.h:
* gtk-xemacs.c:
* gtk-xemacs.c (gtk_xemacs_size_request):
* gtk-xemacs.c (gtk_xemacs_size_allocate):
* gtk-xemacs.c (gtk_xemacs_paint):
* gutter.c:
* gutter.c (update_gutter_geometry):
* redisplay.c (end_hold_frame_size_changes):
* redisplay.c (redisplay_frame):
* toolbar.c:
* toolbar.c (update_frame_toolbars_geometry):
* window.c:
* window.c (frame_pixsize_valid_p):
* window.c (check_frame_size):
Various fixes to frame geometry to make it a bit easier to understand
and fix some bugs.
1. IMPORTANT: Some renamings. Will need to be applied carefully to
the carbon repository, in the following order:
-- pixel_to_char_size -> pixel_to_frame_unit_size
-- char_to_pixel_size -> frame_unit_to_pixel_size
-- pixel_to_real_char_size -> pixel_to_char_size
-- char_to_real_pixel_size -> char_to_pixel_size
-- Reverse second and third arguments of change_frame_size() and
change_frame_size_1() to try to make functions consistent in
putting width before height.
-- Eliminate old round_size_to_char, because it didn't really
do anything differently from round_size_to_real_char()
-- round_size_to_real_char -> round_size_to_char; any places that
called the old round_size_to_char should just call the new one.
2. IMPORTANT FOR CARBON: The set_frame_size() method is now passed
sizes in "frame units", like all other frame-sizing functions,
rather than some hacked-up combination of char-cell units and
total pixel size. This only affects window systems that use
"pixelated geometry", and I'm not sure if Carbon is one of them.
MS Windows is pixelated, X and GTK are not. For pixelated-geometry
systems, the size in set_frame_size() is in displayable pixels
rather than total pixels and needs to be converted appropriately;
take a look at the changes made to mswindows_set_frame_size()
method if necessary.
3. Add a big long comment in frame.c describing how frame geometry
works.
4. Remove MS Windows-specific character height and width fields,
duplicative and unused.
5. frame-displayable-pixel-* and set-frame-displayable-pixel-*
didn't use to work on MS Windows, but they do now.
6. In general, clean up the handling of "pixelated geometry" so
that fewer functions have to worry about this. This is really
an abomination that should be removed entirely but that will
have to happen later. Fix some buggy code in
frame_conversion_internal() that happened to "work" because it
was countered by oppositely buggy code in change_frame_size().
7. Clean up some frame-size code in toolbar.c and use functions
already provided in frame.c instead of rolling its own.
8. Fix check_frame_size() in window.c, which formerly didn't take
pixelated geometry into account.
| author | Ben Wing <ben@xemacs.org> |
|---|---|
| date | Mon, 15 Feb 2010 22:14:11 -0600 |
| parents | 755ae5b97edb |
| children | 2d0937dc83cf |
| rev | line source |
|---|---|
| 428 | 1 ;;; byte-optimize.el --- the optimization passes of the emacs-lisp byte compiler. |
| 2 | |
| 3 ;;; Copyright (c) 1991, 1994 Free Software Foundation, Inc. | |
| 4 | |
| 446 | 5 ;; Authors: Jamie Zawinski <jwz@jwz.org> |
| 6 ;; Hallvard Furuseth <hbf@ulrik.uio.no> | |
| 7 ;; Martin Buchholz <martin@xemacs.org> | |
| 428 | 8 ;; Keywords: internal |
| 9 | |
| 10 ;; This file is part of XEmacs. | |
| 11 | |
| 12 ;; XEmacs is free software; you can redistribute it and/or modify it | |
| 13 ;; under the terms of the GNU General Public License as published by | |
| 14 ;; the Free Software Foundation; either version 2, or (at your option) | |
| 15 ;; any later version. | |
| 16 | |
| 17 ;; XEmacs is distributed in the hope that it will be useful, but | |
| 18 ;; WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 19 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 20 ;; General Public License for more details. | |
| 21 | |
| 22 ;; You should have received a copy of the GNU General Public License | |
| 440 | 23 ;; along with XEmacs; see the file COPYING. If not, write to the |
| 428 | 24 ;; Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 25 ;; Boston, MA 02111-1307, USA. | |
| 26 | |
| 1297 | 27 ;;; Synched up with: FSF 20.7 except where marked. |
| 28 ;;; [[ Synched up with: FSF 20.7. ]] | |
| 29 ;;; DO NOT PUT IN AN INVALID SYNC MESSAGE WHEN YOU DO A PARTIAL SYNC. --ben | |
| 30 | |
| 31 ;; BEGIN SYNC WITH 20.7. | |
| 428 | 32 |
| 33 ;;; Commentary: | |
| 34 | |
| 35 ;; ======================================================================== | |
| 36 ;; "No matter how hard you try, you can't make a racehorse out of a pig. | |
| 37 ;; You can, however, make a faster pig." | |
| 38 ;; | |
| 39 ;; Or, to put it another way, the emacs byte compiler is a VW Bug. This code | |
| 440 | 40 ;; makes it be a VW Bug with fuel injection and a turbocharger... You're |
| 428 | 41 ;; still not going to make it go faster than 70 mph, but it might be easier |
| 42 ;; to get it there. | |
| 43 ;; | |
| 44 | |
| 45 ;; TO DO: | |
| 46 ;; | |
| 47 ;; (apply #'(lambda (x &rest y) ...) 1 (foo)) | |
| 48 ;; | |
| 49 ;; maintain a list of functions known not to access any global variables | |
| 50 ;; (actually, give them a 'dynamically-safe property) and then | |
| 51 ;; (let ( v1 v2 ... vM vN ) <...dynamically-safe...> ) ==> | |
| 52 ;; (let ( v1 v2 ... vM ) vN <...dynamically-safe...> ) | |
| 53 ;; by recursing on this, we might be able to eliminate the entire let. | |
| 54 ;; However certain variables should never have their bindings optimized | |
| 55 ;; away, because they affect everything. | |
| 56 ;; (put 'debug-on-error 'binding-is-magic t) | |
| 57 ;; (put 'debug-on-abort 'binding-is-magic t) | |
| 58 ;; (put 'debug-on-next-call 'binding-is-magic t) | |
| 59 ;; (put 'inhibit-quit 'binding-is-magic t) | |
| 60 ;; (put 'quit-flag 'binding-is-magic t) | |
| 61 ;; (put 't 'binding-is-magic t) | |
| 62 ;; (put 'nil 'binding-is-magic t) | |
| 63 ;; possibly also | |
| 64 ;; (put 'gc-cons-threshold 'binding-is-magic t) | |
| 65 ;; (put 'track-mouse 'binding-is-magic t) | |
| 66 ;; others? | |
| 67 ;; | |
| 68 ;; Simple defsubsts often produce forms like | |
| 69 ;; (let ((v1 (f1)) (v2 (f2)) ...) | |
| 70 ;; (FN v1 v2 ...)) | |
| 440 | 71 ;; It would be nice if we could optimize this to |
| 428 | 72 ;; (FN (f1) (f2) ...) |
| 73 ;; but we can't unless FN is dynamically-safe (it might be dynamically | |
| 74 ;; referring to the bindings that the lambda arglist established.) | |
| 75 ;; One of the uncountable lossages introduced by dynamic scope... | |
| 76 ;; | |
| 440 | 77 ;; Maybe there should be a control-structure that says "turn on |
| 428 | 78 ;; fast-and-loose type-assumptive optimizations here." Then when |
| 79 ;; we see a form like (car foo) we can from then on assume that | |
| 80 ;; the variable foo is of type cons, and optimize based on that. | |
| 440 | 81 ;; But, this won't win much because of (you guessed it) dynamic |
| 428 | 82 ;; scope. Anything down the stack could change the value. |
| 83 ;; (Another reason it doesn't work is that it is perfectly valid | |
| 84 ;; to call car with a null argument.) A better approach might | |
| 85 ;; be to allow type-specification of the form | |
| 86 ;; (put 'foo 'arg-types '(float (list integer) dynamic)) | |
| 87 ;; (put 'foo 'result-type 'bool) | |
| 88 ;; It should be possible to have these types checked to a certain | |
| 89 ;; degree. | |
| 90 ;; | |
| 91 ;; collapse common subexpressions | |
| 92 ;; | |
| 93 ;; It would be nice if redundant sequences could be factored out as well, | |
| 94 ;; when they are known to have no side-effects: | |
| 95 ;; (list (+ a b c) (+ a b c)) --> a b add c add dup list-2 | |
| 96 ;; but beware of traps like | |
| 97 ;; (cons (list x y) (list x y)) | |
| 98 ;; | |
| 99 ;; Tail-recursion elimination is not really possible in Emacs Lisp. | |
| 100 ;; Tail-recursion elimination is almost always impossible when all variables | |
| 101 ;; have dynamic scope, but given that the "return" byteop requires the | |
| 102 ;; binding stack to be empty (rather than emptying it itself), there can be | |
| 103 ;; no truly tail-recursive Emacs Lisp functions that take any arguments or | |
| 104 ;; make any bindings. | |
| 105 ;; | |
| 106 ;; Here is an example of an Emacs Lisp function which could safely be | |
| 107 ;; byte-compiled tail-recursively: | |
| 108 ;; | |
| 109 ;; (defun tail-map (fn list) | |
| 110 ;; (cond (list | |
| 111 ;; (funcall fn (car list)) | |
| 112 ;; (tail-map fn (cdr list))))) | |
| 113 ;; | |
| 114 ;; However, if there was even a single let-binding around the COND, | |
| 115 ;; it could not be byte-compiled, because there would be an "unbind" | |
| 440 | 116 ;; byte-op between the final "call" and "return." Adding a |
| 428 | 117 ;; Bunbind_all byteop would fix this. |
| 118 ;; | |
| 119 ;; (defun foo (x y z) ... (foo a b c)) | |
| 120 ;; ... (const foo) (varref a) (varref b) (varref c) (call 3) END: (return) | |
| 121 ;; ... (varref a) (varbind x) (varref b) (varbind y) (varref c) (varbind z) (goto 0) END: (unbind-all) (return) | |
| 122 ;; ... (varref a) (varset x) (varref b) (varset y) (varref c) (varset z) (goto 0) END: (return) | |
| 123 ;; | |
| 124 ;; this also can be considered tail recursion: | |
| 125 ;; | |
| 126 ;; ... (const foo) (varref a) (call 1) (goto X) ... X: (return) | |
| 127 ;; could generalize this by doing the optimization | |
| 128 ;; (goto X) ... X: (return) --> (return) | |
| 129 ;; | |
| 130 ;; But this doesn't solve all of the problems: although by doing tail- | |
| 131 ;; recursion elimination in this way, the call-stack does not grow, the | |
| 132 ;; binding-stack would grow with each recursive step, and would eventually | |
| 133 ;; overflow. I don't believe there is any way around this without lexical | |
| 134 ;; scope. | |
| 135 ;; | |
| 136 ;; Wouldn't it be nice if Emacs Lisp had lexical scope. | |
| 137 ;; | |
| 440 | 138 ;; Idea: the form (lexical-scope) in a file means that the file may be |
| 139 ;; compiled lexically. This proclamation is file-local. Then, within | |
| 428 | 140 ;; that file, "let" would establish lexical bindings, and "let-dynamic" |
| 141 ;; would do things the old way. (Or we could use CL "declare" forms.) | |
| 142 ;; We'd have to notice defvars and defconsts, since those variables should | |
| 143 ;; always be dynamic, and attempting to do a lexical binding of them | |
| 144 ;; should simply do a dynamic binding instead. | |
| 145 ;; But! We need to know about variables that were not necessarily defvarred | |
| 146 ;; in the file being compiled (doing a boundp check isn't good enough.) | |
| 147 ;; Fdefvar() would have to be modified to add something to the plist. | |
| 148 ;; | |
| 440 | 149 ;; A major disadvantage of this scheme is that the interpreter and compiler |
| 150 ;; would have different semantics for files compiled with (dynamic-scope). | |
| 428 | 151 ;; Since this would be a file-local optimization, there would be no way to |
| 440 | 152 ;; modify the interpreter to obey this (unless the loader was hacked |
| 428 | 153 ;; in some grody way, but that's a really bad idea.) |
| 154 ;; | |
| 155 ;; HA! RMS removed the following paragraph from his version of | |
| 156 ;; byte-optimize.el. | |
| 157 ;; | |
| 158 ;; Really the Right Thing is to make lexical scope the default across | |
| 440 | 159 ;; the board, in the interpreter and compiler, and just FIX all of |
| 428 | 160 ;; the code that relies on dynamic scope of non-defvarred variables. |
| 161 | |
| 162 ;; Other things to consider: | |
| 163 | |
| 164 ;; Associative math should recognize subcalls to identical function: | |
| 165 ;;(disassemble #'(lambda (x) (+ (+ (foo) 1) (+ (bar) 2)))) | |
| 166 ;; This should generate the same as (1+ x) and (1- x) | |
| 167 | |
| 168 ;;(disassemble #'(lambda (x) (cons (+ x 1) (- x 1)))) | |
| 169 ;; An awful lot of functions always return a non-nil value. If they're | |
| 170 ;; error free also they may act as true-constants. | |
| 171 | |
| 172 ;;(disassemble #'(lambda (x) (and (point) (foo)))) | |
| 440 | 173 ;; When |
| 428 | 174 ;; - all but one arguments to a function are constant |
| 175 ;; - the non-constant argument is an if-expression (cond-expression?) | |
| 176 ;; then the outer function can be distributed. If the guarding | |
| 177 ;; condition is side-effect-free [assignment-free] then the other | |
| 178 ;; arguments may be any expressions. Since, however, the code size | |
| 179 ;; can increase this way they should be "simple". Compare: | |
| 180 | |
| 181 ;;(disassemble #'(lambda (x) (eq (if (point) 'a 'b) 'c))) | |
| 182 ;;(disassemble #'(lambda (x) (if (point) (eq 'a 'c) (eq 'b 'c)))) | |
| 183 | |
| 444 | 184 ;; (car (cons A B)) -> (prog1 A B) |
| 428 | 185 ;;(disassemble #'(lambda (x) (car (cons (foo) 42)))) |
| 186 | |
| 187 ;; (cdr (cons A B)) -> (progn A B) | |
| 188 ;;(disassemble #'(lambda (x) (cdr (cons 42 (foo))))) | |
| 189 | |
| 444 | 190 ;; (car (list A B ...)) -> (prog1 A ... B) |
| 428 | 191 ;;(disassemble #'(lambda (x) (car (list (foo) 42 (bar))))) |
| 192 | |
| 193 ;; (cdr (list A B ...)) -> (progn A (list B ...)) | |
| 194 ;;(disassemble #'(lambda (x) (cdr (list 42 (foo) (bar))))) | |
| 195 | |
| 196 | |
| 197 ;;; Code: | |
| 198 | |
| 199 (require 'byte-compile "bytecomp") | |
| 200 | |
| 201 (defun byte-compile-log-lap-1 (format &rest args) | |
| 202 (if (aref byte-code-vector 0) | |
| 203 (error "The old version of the disassembler is loaded. Reload new-bytecomp as well.")) | |
| 204 (byte-compile-log-1 | |
| 205 (apply 'format format | |
| 206 (let (c a) | |
| 207 (mapcar | |
| 208 #'(lambda (arg) | |
| 209 (if (not (consp arg)) | |
| 210 (if (and (symbolp arg) | |
| 211 (string-match "^byte-" (symbol-name arg))) | |
| 212 (intern (substring (symbol-name arg) 5)) | |
| 213 arg) | |
| 214 (if (integerp (setq c (car arg))) | |
| 215 (error "non-symbolic byte-op %s" c)) | |
| 216 (if (eq c 'TAG) | |
| 217 (setq c arg) | |
| 218 (setq a (cond ((memq c byte-goto-ops) | |
| 219 (car (cdr (cdr arg)))) | |
| 220 ((memq c byte-constref-ops) | |
| 221 (car (cdr arg))) | |
| 222 (t (cdr arg)))) | |
| 223 (setq c (symbol-name c)) | |
| 224 (if (string-match "^byte-." c) | |
| 225 (setq c (intern (substring c 5))))) | |
| 226 (if (eq c 'constant) (setq c 'const)) | |
| 227 (if (and (eq (cdr arg) 0) | |
| 228 (not (memq c '(unbind call const)))) | |
| 229 c | |
| 230 (format "(%s %s)" c a)))) | |
| 231 args))))) | |
| 232 | |
| 233 (defmacro byte-compile-log-lap (format-string &rest args) | |
| 234 (list 'and | |
| 235 '(memq byte-optimize-log '(t byte)) | |
| 236 (cons 'byte-compile-log-lap-1 | |
| 237 (cons format-string args)))) | |
| 238 | |
| 239 | |
| 240 ;;; byte-compile optimizers to support inlining | |
| 241 | |
| 242 (put 'inline 'byte-optimizer 'byte-optimize-inline-handler) | |
| 243 | |
| 244 (defun byte-optimize-inline-handler (form) | |
| 245 "byte-optimize-handler for the `inline' special-form." | |
| 246 (cons | |
| 247 'progn | |
| 248 (mapcar | |
| 249 #'(lambda (sexp) | |
| 250 (let ((fn (car-safe sexp))) | |
| 251 (if (and (symbolp fn) | |
| 252 (or (cdr (assq fn byte-compile-function-environment)) | |
| 253 (and (fboundp fn) | |
| 254 (not (or (cdr (assq fn byte-compile-macro-environment)) | |
| 255 (and (consp (setq fn (symbol-function fn))) | |
| 256 (eq (car fn) 'macro)) | |
| 257 (subrp fn)))))) | |
| 258 (byte-compile-inline-expand sexp) | |
| 259 sexp))) | |
| 260 (cdr form)))) | |
| 261 | |
| 262 | |
| 263 ;; Splice the given lap code into the current instruction stream. | |
| 264 ;; If it has any labels in it, you're responsible for making sure there | |
| 265 ;; are no collisions, and that byte-compile-tag-number is reasonable | |
| 266 ;; after this is spliced in. The provided list is destroyed. | |
| 267 (defun byte-inline-lapcode (lap) | |
| 268 (setq byte-compile-output (nconc (nreverse lap) byte-compile-output))) | |
| 269 | |
| 270 | |
| 271 (defun byte-compile-inline-expand (form) | |
| 272 (let* ((name (car form)) | |
| 273 (fn (or (cdr (assq name byte-compile-function-environment)) | |
| 274 (and (fboundp name) (symbol-function name))))) | |
| 275 (if (null fn) | |
| 276 (progn | |
| 277 (byte-compile-warn "attempt to inline %s before it was defined" name) | |
| 278 form) | |
| 279 ;; else | |
| 280 (if (and (consp fn) (eq (car fn) 'autoload)) | |
| 281 (progn | |
| 282 (load (nth 1 fn)) | |
| 283 (setq fn (or (cdr (assq name byte-compile-function-environment)) | |
| 284 (and (fboundp name) (symbol-function name)))))) | |
| 285 (if (and (consp fn) (eq (car fn) 'autoload)) | |
| 286 (error "file \"%s\" didn't define \"%s\"" (nth 1 fn) name)) | |
| 287 (if (symbolp fn) | |
| 288 (byte-compile-inline-expand (cons fn (cdr form))) | |
| 289 (if (compiled-function-p fn) | |
| 290 (progn | |
| 291 (fetch-bytecode fn) | |
| 292 (cons (list 'lambda (compiled-function-arglist fn) | |
| 293 (list 'byte-code | |
| 294 (compiled-function-instructions fn) | |
| 295 (compiled-function-constants fn) | |
| 296 (compiled-function-stack-depth fn))) | |
| 297 (cdr form))) | |
| 1297 | 298 (if (eq (car-safe fn) 'lambda) |
| 299 (cons fn (cdr form)) | |
| 300 ;; Give up on inlining. | |
| 301 form)))))) | |
| 428 | 302 |
| 303 ;;; ((lambda ...) ...) | |
| 440 | 304 ;;; |
| 428 | 305 (defun byte-compile-unfold-lambda (form &optional name) |
| 306 (or name (setq name "anonymous lambda")) | |
| 307 (let ((lambda (car form)) | |
| 308 (values (cdr form))) | |
| 309 (if (compiled-function-p lambda) | |
| 310 (setq lambda (list 'lambda (compiled-function-arglist lambda) | |
| 311 (list 'byte-code | |
| 312 (compiled-function-instructions lambda) | |
| 313 (compiled-function-constants lambda) | |
| 314 (compiled-function-stack-depth lambda))))) | |
| 315 (let ((arglist (nth 1 lambda)) | |
| 316 (body (cdr (cdr lambda))) | |
| 317 optionalp restp | |
| 318 bindings) | |
| 319 (if (and (stringp (car body)) (cdr body)) | |
| 320 (setq body (cdr body))) | |
| 321 (if (and (consp (car body)) (eq 'interactive (car (car body)))) | |
| 322 (setq body (cdr body))) | |
| 323 (while arglist | |
| 324 (cond ((eq (car arglist) '&optional) | |
| 325 ;; ok, I'll let this slide because funcall_lambda() does... | |
| 326 ;; (if optionalp (error "multiple &optional keywords in %s" name)) | |
| 327 (if restp (error "&optional found after &rest in %s" name)) | |
| 328 (if (null (cdr arglist)) | |
| 329 (error "nothing after &optional in %s" name)) | |
| 330 (setq optionalp t)) | |
| 331 ((eq (car arglist) '&rest) | |
| 332 ;; ...but it is by no stretch of the imagination a reasonable | |
| 333 ;; thing that funcall_lambda() allows (&rest x y) and | |
| 334 ;; (&rest x &optional y) in arglists. | |
| 335 (if (null (cdr arglist)) | |
| 336 (error "nothing after &rest in %s" name)) | |
| 337 (if (cdr (cdr arglist)) | |
| 338 (error "multiple vars after &rest in %s" name)) | |
| 339 (setq restp t)) | |
| 340 (restp | |
| 341 (setq bindings (cons (list (car arglist) | |
| 342 (and values (cons 'list values))) | |
| 343 bindings) | |
| 344 values nil)) | |
| 345 ((and (not optionalp) (null values)) | |
| 346 (byte-compile-warn "attempt to open-code %s with too few arguments" name) | |
| 347 (setq arglist nil values 'too-few)) | |
| 348 (t | |
| 349 (setq bindings (cons (list (car arglist) (car values)) | |
| 350 bindings) | |
| 351 values (cdr values)))) | |
| 352 (setq arglist (cdr arglist))) | |
| 353 (if values | |
| 354 (progn | |
| 355 (or (eq values 'too-few) | |
| 356 (byte-compile-warn | |
| 357 "attempt to open-code %s with too many arguments" name)) | |
| 358 form) | |
| 1297 | 359 (setq body (mapcar 'byte-optimize-form body)) |
| 440 | 360 (let ((newform |
| 428 | 361 (if bindings |
| 362 (cons 'let (cons (nreverse bindings) body)) | |
| 363 (cons 'progn body)))) | |
| 364 (byte-compile-log " %s\t==>\t%s" form newform) | |
| 365 newform))))) | |
| 366 | |
| 367 | |
| 368 ;;; implementing source-level optimizers | |
| 369 | |
| 370 (defun byte-optimize-form-code-walker (form for-effect) | |
| 371 ;; | |
| 372 ;; For normal function calls, We can just mapcar the optimizer the cdr. But | |
|
4905
755ae5b97edb
Change "special form" to "special operator" in our sources.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4885
diff
changeset
|
373 ;; we need to have special knowledge of the syntax of the special operators |
|
755ae5b97edb
Change "special form" to "special operator" in our sources.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4885
diff
changeset
|
374 ;; like let and defun (that's why they're special operators :-). (Actually, |
| 428 | 375 ;; the important aspect is that they are subrs that don't evaluate all of |
| 376 ;; their args.) | |
| 377 ;; | |
| 378 (let ((fn (car-safe form)) | |
| 379 tmp) | |
| 380 (cond ((not (consp form)) | |
| 381 (if (not (and for-effect | |
| 382 (or byte-compile-delete-errors | |
| 383 (not (symbolp form)) | |
| 384 (eq form t)))) | |
| 385 form)) | |
| 386 ((eq fn 'quote) | |
| 387 (if (cdr (cdr form)) | |
| 388 (byte-compile-warn "malformed quote form: %s" | |
| 389 (prin1-to-string form))) | |
| 390 ;; map (quote nil) to nil to simplify optimizer logic. | |
| 391 ;; map quoted constants to nil if for-effect (just because). | |
| 392 (and (nth 1 form) | |
| 393 (not for-effect) | |
| 394 form)) | |
| 395 ((or (compiled-function-p fn) | |
| 396 (eq 'lambda (car-safe fn))) | |
| 397 (byte-compile-unfold-lambda form)) | |
| 398 ((memq fn '(let let*)) | |
| 399 ;; recursively enter the optimizer for the bindings and body | |
| 400 ;; of a let or let*. This for depth-firstness: forms that | |
| 401 ;; are more deeply nested are optimized first. | |
| 402 (cons fn | |
| 403 (cons | |
| 404 (mapcar | |
| 405 #'(lambda (binding) | |
| 406 (if (symbolp binding) | |
| 407 binding | |
| 408 (if (cdr (cdr binding)) | |
| 409 (byte-compile-warn "malformed let binding: %s" | |
| 410 (prin1-to-string binding))) | |
| 411 (list (car binding) | |
| 412 (byte-optimize-form (nth 1 binding) nil)))) | |
| 413 (nth 1 form)) | |
| 414 (byte-optimize-body (cdr (cdr form)) for-effect)))) | |
| 415 ((eq fn 'cond) | |
| 416 (cons fn | |
| 417 (mapcar | |
| 418 #'(lambda (clause) | |
| 419 (if (consp clause) | |
| 420 (cons | |
| 421 (byte-optimize-form (car clause) nil) | |
| 422 (byte-optimize-body (cdr clause) for-effect)) | |
| 423 (byte-compile-warn "malformed cond form: %s" | |
| 424 (prin1-to-string clause)) | |
| 425 clause)) | |
| 426 (cdr form)))) | |
| 427 ((eq fn 'progn) | |
| 428 ;; as an extra added bonus, this simplifies (progn <x>) --> <x> | |
| 429 (if (cdr (cdr form)) | |
| 430 (progn | |
| 431 (setq tmp (byte-optimize-body (cdr form) for-effect)) | |
| 432 (if (cdr tmp) (cons 'progn tmp) (car tmp))) | |
| 433 (byte-optimize-form (nth 1 form) for-effect))) | |
| 434 ((eq fn 'prog1) | |
| 435 (if (cdr (cdr form)) | |
| 436 (cons 'prog1 | |
| 437 (cons (byte-optimize-form (nth 1 form) for-effect) | |
| 438 (byte-optimize-body (cdr (cdr form)) t))) | |
|
4686
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
439 (byte-optimize-form `(or ,(nth 1 form) nil) for-effect))) |
| 428 | 440 ((eq fn 'prog2) |
| 441 (cons 'prog2 | |
| 442 (cons (byte-optimize-form (nth 1 form) t) | |
| 443 (cons (byte-optimize-form (nth 2 form) for-effect) | |
| 444 (byte-optimize-body (cdr (cdr (cdr form))) t))))) | |
| 440 | 445 |
| 428 | 446 ((memq fn '(save-excursion save-restriction save-current-buffer)) |
| 447 ;; those subrs which have an implicit progn; it's not quite good | |
| 448 ;; enough to treat these like normal function calls. | |
| 449 ;; This can turn (save-excursion ...) into (save-excursion) which | |
| 450 ;; will be optimized away in the lap-optimize pass. | |
| 451 (cons fn (byte-optimize-body (cdr form) for-effect))) | |
| 440 | 452 |
| 428 | 453 ((eq fn 'with-output-to-temp-buffer) |
| 454 ;; this is just like the above, except for the first argument. | |
| 455 (cons fn | |
| 456 (cons | |
| 457 (byte-optimize-form (nth 1 form) nil) | |
| 458 (byte-optimize-body (cdr (cdr form)) for-effect)))) | |
| 440 | 459 |
| 428 | 460 ((eq fn 'if) |
| 461 (cons fn | |
| 462 (cons (byte-optimize-form (nth 1 form) nil) | |
| 463 (cons | |
| 464 (byte-optimize-form (nth 2 form) for-effect) | |
| 465 (byte-optimize-body (nthcdr 3 form) for-effect))))) | |
| 440 | 466 |
| 428 | 467 ((memq fn '(and or)) ; remember, and/or are control structures. |
| 468 ;; take forms off the back until we can't any more. | |
| 469 ;; In the future it could conceivably be a problem that the | |
| 470 ;; subexpressions of these forms are optimized in the reverse | |
| 471 ;; order, but it's ok for now. | |
| 472 (if for-effect | |
| 473 (let ((backwards (reverse (cdr form)))) | |
| 474 (while (and backwards | |
| 475 (null (setcar backwards | |
| 476 (byte-optimize-form (car backwards) | |
| 477 for-effect)))) | |
| 478 (setq backwards (cdr backwards))) | |
| 479 (if (and (cdr form) (null backwards)) | |
| 480 (byte-compile-log | |
| 481 " all subforms of %s called for effect; deleted" form)) | |
| 452 | 482 (when backwards |
| 483 ;; Now optimize the rest of the forms. We need the return | |
| 484 ;; values. We already did the car. | |
| 485 (setcdr backwards | |
| 486 (mapcar 'byte-optimize-form (cdr backwards)))) | |
| 487 (cons fn (nreverse backwards))) | |
| 428 | 488 (cons fn (mapcar 'byte-optimize-form (cdr form))))) |
| 489 | |
| 490 ((eq fn 'interactive) | |
| 491 (byte-compile-warn "misplaced interactive spec: %s" | |
| 492 (prin1-to-string form)) | |
| 493 nil) | |
| 440 | 494 |
| 428 | 495 ((memq fn '(defun defmacro function |
| 496 condition-case save-window-excursion)) | |
| 497 ;; These forms are compiled as constants or by breaking out | |
| 498 ;; all the subexpressions and compiling them separately. | |
| 499 form) | |
| 500 | |
| 501 ((eq fn 'unwind-protect) | |
| 502 ;; the "protected" part of an unwind-protect is compiled (and thus | |
| 503 ;; optimized) as a top-level form, so don't do it here. But the | |
| 504 ;; non-protected part has the same for-effect status as the | |
| 505 ;; unwind-protect itself. (The protected part is always for effect, | |
| 506 ;; but that isn't handled properly yet.) | |
| 507 (cons fn | |
| 508 (cons (byte-optimize-form (nth 1 form) for-effect) | |
| 509 (cdr (cdr form))))) | |
| 440 | 510 |
| 428 | 511 ((eq fn 'catch) |
| 512 ;; the body of a catch is compiled (and thus optimized) as a | |
| 513 ;; top-level form, so don't do it here. The tag is never | |
| 514 ;; for-effect. The body should have the same for-effect status | |
| 515 ;; as the catch form itself, but that isn't handled properly yet. | |
| 516 (cons fn | |
| 517 (cons (byte-optimize-form (nth 1 form) nil) | |
| 518 (cdr (cdr form))))) | |
| 519 | |
| 520 ;; If optimization is on, this is the only place that macros are | |
| 521 ;; expanded. If optimization is off, then macroexpansion happens | |
| 522 ;; in byte-compile-form. Otherwise, the macros are already expanded | |
| 523 ;; by the time that is reached. | |
| 524 ((not (eq form | |
| 525 (setq form (macroexpand form | |
| 526 byte-compile-macro-environment)))) | |
| 527 (byte-optimize-form form for-effect)) | |
| 440 | 528 |
| 1297 | 529 ;; Support compiler macros as in cl.el. |
| 530 ((and (fboundp 'compiler-macroexpand) | |
| 531 (symbolp (car-safe form)) | |
| 532 (get (car-safe form) 'cl-compiler-macro) | |
| 533 (not (eq form | |
| 534 (setq form (compiler-macroexpand form))))) | |
| 535 (byte-optimize-form form for-effect)) | |
| 536 | |
| 428 | 537 ((not (symbolp fn)) |
| 538 (or (eq 'mocklisp (car-safe fn)) ; ha! | |
| 539 (byte-compile-warn "%s is a malformed function" | |
| 540 (prin1-to-string fn))) | |
| 541 form) | |
| 542 | |
| 543 ((and for-effect (setq tmp (get fn 'side-effect-free)) | |
| 544 (or byte-compile-delete-errors | |
| 545 (eq tmp 'error-free) | |
| 546 (progn | |
| 547 (byte-compile-warn "%s called for effect" | |
| 548 (prin1-to-string form)) | |
| 549 nil))) | |
| 550 (byte-compile-log " %s called for effect; deleted" fn) | |
| 551 ;; appending a nil here might not be necessary, but it can't hurt. | |
| 552 (byte-optimize-form | |
| 553 (cons 'progn (append (cdr form) '(nil))) t)) | |
| 440 | 554 |
| 428 | 555 (t |
| 556 ;; Otherwise, no args can be considered to be for-effect, | |
| 557 ;; even if the called function is for-effect, because we | |
| 558 ;; don't know anything about that function. | |
| 559 (cons fn (mapcar 'byte-optimize-form (cdr form))))))) | |
| 560 | |
| 561 | |
| 562 (defun byte-optimize-form (form &optional for-effect) | |
| 563 "The source-level pass of the optimizer." | |
| 564 ;; | |
| 565 ;; First, optimize all sub-forms of this one. | |
| 566 (setq form (byte-optimize-form-code-walker form for-effect)) | |
| 567 ;; | |
| 568 ;; After optimizing all subforms, optimize this form until it doesn't | |
| 569 ;; optimize any further. This means that some forms will be passed through | |
| 570 ;; the optimizer many times, but that's necessary to make the for-effect | |
| 571 ;; processing do as much as possible. | |
| 572 ;; | |
| 573 (let (opt new) | |
| 574 (if (and (consp form) | |
| 575 (symbolp (car form)) | |
| 576 (or (and for-effect | |
| 577 ;; we don't have any of these yet, but we might. | |
| 578 (setq opt (get (car form) 'byte-for-effect-optimizer))) | |
| 579 (setq opt (get (car form) 'byte-optimizer))) | |
| 580 (not (eq form (setq new (funcall opt form))))) | |
| 581 (progn | |
| 582 ;; (if (equal form new) (error "bogus optimizer -- %s" opt)) | |
| 583 (byte-compile-log " %s\t==>\t%s" form new) | |
| 1297 | 584 (setq new (byte-optimize-form new for-effect)) |
| 585 new) | |
| 428 | 586 form))) |
| 587 | |
| 588 | |
| 589 (defun byte-optimize-body (forms all-for-effect) | |
| 590 ;; Optimize the cdr of a progn or implicit progn; `forms' is a list of | |
| 591 ;; forms, all but the last of which are optimized with the assumption that | |
| 592 ;; they are being called for effect. The last is for-effect as well if | |
| 593 ;; all-for-effect is true. Returns a new list of forms. | |
| 594 (let ((rest forms) | |
| 595 (result nil) | |
| 596 fe new) | |
| 597 (while rest | |
| 598 (setq fe (or all-for-effect (cdr rest))) | |
| 599 (setq new (and (car rest) (byte-optimize-form (car rest) fe))) | |
| 600 (if (or new (not fe)) | |
| 601 (setq result (cons new result))) | |
| 602 (setq rest (cdr rest))) | |
| 603 (nreverse result))) | |
| 604 | |
| 605 | |
| 606 ;;; some source-level optimizers | |
| 607 ;;; | |
| 608 ;;; when writing optimizers, be VERY careful that the optimizer returns | |
| 609 ;;; something not EQ to its argument if and ONLY if it has made a change. | |
| 610 ;;; This implies that you cannot simply destructively modify the list; | |
| 611 ;;; you must return something not EQ to it if you make an optimization. | |
| 612 ;;; | |
| 613 ;;; It is now safe to optimize code such that it introduces new bindings. | |
| 614 | |
| 615 ;; I'd like this to be a defsubst, but let's not be self-referential... | |
| 616 (defmacro byte-compile-trueconstp (form) | |
| 617 ;; Returns non-nil if FORM is a non-nil constant. | |
| 618 `(cond ((consp ,form) (eq (car ,form) 'quote)) | |
| 619 ((not (symbolp ,form))) | |
| 620 ((eq ,form t)) | |
| 621 ((keywordp ,form)))) | |
| 622 | |
| 623 ;; If the function is being called with constant numeric args, | |
| 440 | 624 ;; evaluate as much as possible at compile-time. This optimizer |
| 428 | 625 ;; assumes that the function is associative, like + or *. |
| 626 (defun byte-optimize-associative-math (form) | |
| 627 (let ((args nil) | |
| 628 (constants nil) | |
| 629 (rest (cdr form))) | |
| 630 (while rest | |
| 631 (if (numberp (car rest)) | |
| 632 (setq constants (cons (car rest) constants)) | |
| 633 (setq args (cons (car rest) args))) | |
| 634 (setq rest (cdr rest))) | |
| 635 (if (cdr constants) | |
| 636 (if args | |
| 637 (list (car form) | |
| 638 (apply (car form) constants) | |
| 639 (if (cdr args) | |
| 640 (cons (car form) (nreverse args)) | |
| 641 (car args))) | |
| 642 (apply (car form) constants)) | |
| 643 form))) | |
| 644 | |
| 645 ;; If the function is being called with constant numeric args, | |
| 646 ;; evaluate as much as possible at compile-time. This optimizer | |
| 647 ;; assumes that the function satisfies | |
| 648 ;; (op x1 x2 ... xn) == (op ...(op (op x1 x2) x3) ...xn) | |
| 649 ;; like - and /. | |
| 650 (defun byte-optimize-nonassociative-math (form) | |
| 651 (if (or (not (numberp (car (cdr form)))) | |
| 652 (not (numberp (car (cdr (cdr form)))))) | |
| 653 form | |
| 654 (let ((constant (car (cdr form))) | |
| 655 (rest (cdr (cdr form)))) | |
| 656 (while (numberp (car rest)) | |
| 657 (setq constant (funcall (car form) constant (car rest)) | |
| 658 rest (cdr rest))) | |
| 659 (if rest | |
| 660 (cons (car form) (cons constant rest)) | |
| 661 constant)))) | |
| 662 | |
| 663 ;;(defun byte-optimize-associative-two-args-math (form) | |
| 664 ;; (setq form (byte-optimize-associative-math form)) | |
| 665 ;; (if (consp form) | |
| 666 ;; (byte-optimize-two-args-left form) | |
| 667 ;; form)) | |
| 668 | |
| 669 ;;(defun byte-optimize-nonassociative-two-args-math (form) | |
| 670 ;; (setq form (byte-optimize-nonassociative-math form)) | |
| 671 ;; (if (consp form) | |
| 672 ;; (byte-optimize-two-args-right form) | |
| 673 ;; form)) | |
| 674 | |
| 675 ;; jwz: (byte-optimize-approx-equal 0.0 0.0) was returning nil | |
| 676 ;; in xemacs 19.15 because it used < instead of <=. | |
| 677 (defun byte-optimize-approx-equal (x y) | |
| 678 (<= (* (abs (- x y)) 100) (abs (+ x y)))) | |
| 679 | |
| 680 ;; Collect all the constants from FORM, after the STARTth arg, | |
| 681 ;; and apply FUN to them to make one argument at the end. | |
| 682 ;; For functions that can handle floats, that optimization | |
| 683 ;; can be incorrect because reordering can cause an overflow | |
| 684 ;; that would otherwise be avoided by encountering an arg that is a float. | |
| 685 ;; We avoid this problem by (1) not moving float constants and | |
| 686 ;; (2) not moving anything if it would cause an overflow. | |
| 687 (defun byte-optimize-delay-constants-math (form start fun) | |
| 688 ;; Merge all FORM's constants from number START, call FUN on them | |
| 689 ;; and put the result at the end. | |
| 690 (let ((rest (nthcdr (1- start) form)) | |
| 691 (orig form) | |
| 692 ;; t means we must check for overflow. | |
| 693 (overflow (memq fun '(+ *)))) | |
| 694 (while (cdr (setq rest (cdr rest))) | |
| 695 (if (integerp (car rest)) | |
| 696 (let (constants) | |
| 697 (setq form (copy-sequence form) | |
| 698 rest (nthcdr (1- start) form)) | |
| 699 (while (setq rest (cdr rest)) | |
| 700 (cond ((integerp (car rest)) | |
| 701 (setq constants (cons (car rest) constants)) | |
| 702 (setcar rest nil)))) | |
| 703 ;; If necessary, check now for overflow | |
| 704 ;; that might be caused by reordering. | |
| 705 (if (and overflow | |
| 706 ;; We have overflow if the result of doing the arithmetic | |
| 707 ;; on floats is not even close to the result | |
| 708 ;; of doing it on integers. | |
| 709 (not (byte-optimize-approx-equal | |
| 710 (apply fun (mapcar 'float constants)) | |
| 711 (float (apply fun constants))))) | |
| 712 (setq form orig) | |
| 713 (setq form (nconc (delq nil form) | |
| 714 (list (apply fun (nreverse constants))))))))) | |
| 715 form)) | |
| 716 | |
| 1297 | 717 ;; END SYNC WITH 20.7. |
| 718 | |
| 446 | 719 ;;; It is not safe to optimize calls to arithmetic ops with one arg |
| 720 ;;; away entirely (actually, it would be safe if we know the sole arg | |
| 721 ;;; is not a marker or if it appears in other arithmetic). | |
| 428 | 722 |
| 446 | 723 ;;; But this degree of paranoia is normally unjustified, so optimize unless |
| 547 | 724 ;;; the user has done (declaim (optimize (safety 3))). See bytecomp.el. |
| 442 | 725 |
| 446 | 726 (defun byte-optimize-plus (form) |
| 727 (byte-optimize-predicate (byte-optimize-delay-constants-math form 1 '+))) | |
| 428 | 728 |
| 729 (defun byte-optimize-multiply (form) | |
| 730 (setq form (byte-optimize-delay-constants-math form 1 '*)) | |
| 442 | 731 ;; If there is a constant integer in FORM, it is now the last element. |
| 446 | 732 |
| 733 (case (car (last form)) | |
| 734 ;; (* x y 0) --> (progn x y 0) | |
| 735 (0 (cons 'progn (cdr form))) | |
| 736 (t (byte-optimize-predicate form)))) | |
| 737 | |
| 738 (defun byte-optimize-minus (form) | |
| 739 ;; Put constants at the end, except the first arg. | |
| 740 (setq form (byte-optimize-delay-constants-math form 2 '+)) | |
| 741 ;; Now only the first and last args can be integers. | |
| 742 (let ((last (car (last (nthcdr 3 form))))) | |
| 743 (cond | |
| 744 ;; If form is (- CONST foo... CONST), merge first and last. | |
| 745 ((and (numberp (nth 1 form)) (numberp last)) | |
| 746 (decf (nth 1 form) last) | |
| 747 (butlast form)) | |
| 748 | |
| 464 | 749 ;; (- 0 ...) --> |
| 750 ((eq 0 (nth 1 form)) | |
| 751 (case (length form) | |
| 752 ;; (- 0) --> 0 | |
| 753 (2 0) | |
| 754 ;; (- 0 x) --> (- x) | |
| 755 (3 `(- ,(nth 2 form))) | |
| 756 ;; (- 0 x y ...) --> (- (- x) y ...) | |
| 757 (t `(- (- ,(nth 2 form)) ,@(nthcdr 3 form))))) | |
| 446 | 758 |
| 759 (t (byte-optimize-predicate form))))) | |
| 428 | 760 |
| 761 (defun byte-optimize-divide (form) | |
| 446 | 762 ;; Put constants at the end, except the first arg. |
| 428 | 763 (setq form (byte-optimize-delay-constants-math form 2 '*)) |
| 446 | 764 ;; Now only the first and last args can be integers. |
| 765 (let ((last (car (last (nthcdr 3 form))))) | |
| 440 | 766 (cond |
| 446 | 767 ;; If form is (/ CONST foo... CONST), merge first and last. |
| 768 ((and (numberp (nth 1 form)) (numberp last)) | |
| 769 (condition-case nil | |
| 770 (cons (nth 0 form) | |
| 771 (cons (/ (nth 1 form) last) | |
| 772 (butlast (cdr (cdr form))))) | |
| 773 (error form))) | |
| 774 | |
| 775 ;; (/ 0 x y) --> (progn x y 0) | |
| 442 | 776 ((eq (nth 1 form) 0) |
| 777 (append '(progn) (cdr (cdr form)) '(0))) | |
| 446 | 778 |
| 779 ;; We don't have to check for divide-by-zero because `/' does. | |
| 780 (t (byte-optimize-predicate form))))) | |
| 428 | 781 |
| 1297 | 782 ;; BEGIN SYNC WITH 20.7. |
| 783 | |
| 428 | 784 (defun byte-optimize-logmumble (form) |
| 785 (setq form (byte-optimize-delay-constants-math form 1 (car form))) | |
| 786 (byte-optimize-predicate | |
| 787 (cond ((memq 0 form) | |
| 788 (setq form (if (eq (car form) 'logand) | |
| 789 (cons 'progn (cdr form)) | |
| 790 (delq 0 (copy-sequence form))))) | |
| 791 ((and (eq (car-safe form) 'logior) | |
| 792 (memq -1 form)) | |
| 793 (cons 'progn (cdr form))) | |
| 794 (form)))) | |
| 795 | |
| 796 | |
| 797 (defun byte-optimize-binary-predicate (form) | |
| 798 (if (byte-compile-constp (nth 1 form)) | |
| 799 (if (byte-compile-constp (nth 2 form)) | |
| 800 (condition-case () | |
| 801 (list 'quote (eval form)) | |
| 802 (error form)) | |
| 803 ;; This can enable some lapcode optimizations. | |
| 804 (list (car form) (nth 2 form) (nth 1 form))) | |
| 805 form)) | |
| 806 | |
| 807 (defun byte-optimize-predicate (form) | |
| 808 (let ((ok t) | |
| 809 (rest (cdr form))) | |
| 810 (while (and rest ok) | |
| 811 (setq ok (byte-compile-constp (car rest)) | |
| 812 rest (cdr rest))) | |
| 813 (if ok | |
| 446 | 814 (condition-case err |
| 428 | 815 (list 'quote (eval form)) |
| 446 | 816 (error |
| 817 (byte-compile-warn "evaluating %s: %s" form err) | |
| 818 form)) | |
| 428 | 819 form))) |
| 820 | |
| 821 (defun byte-optimize-identity (form) | |
| 822 (if (and (cdr form) (null (cdr (cdr form)))) | |
| 823 (nth 1 form) | |
| 824 (byte-compile-warn "identity called with %d arg%s, but requires 1" | |
| 825 (length (cdr form)) | |
| 826 (if (= 1 (length (cdr form))) "" "s")) | |
| 827 form)) | |
| 828 | |
| 444 | 829 (defun byte-optimize-car (form) |
| 830 (let ((arg (cadr form))) | |
| 831 (cond | |
| 832 ((and (byte-compile-trueconstp arg) | |
| 833 (not (and (consp arg) | |
| 834 (eq (car arg) 'quote) | |
| 835 (listp (cadr arg))))) | |
| 836 (byte-compile-warn | |
| 837 "taking car of a constant: %s" arg) | |
| 838 form) | |
| 839 ((and (eq (car-safe arg) 'cons) | |
| 840 (eq (length arg) 3)) | |
| 841 `(prog1 ,(nth 1 arg) ,(nth 2 arg))) | |
| 842 ((eq (car-safe arg) 'list) | |
| 843 `(prog1 ,@(cdr arg))) | |
| 844 (t | |
| 845 (byte-optimize-predicate form))))) | |
| 846 | |
| 847 (defun byte-optimize-cdr (form) | |
| 848 (let ((arg (cadr form))) | |
| 849 (cond | |
| 850 ((and (byte-compile-trueconstp arg) | |
| 851 (not (and (consp arg) | |
| 852 (eq (car arg) 'quote) | |
| 853 (listp (cadr arg))))) | |
| 854 (byte-compile-warn | |
| 855 "taking cdr of a constant: %s" arg) | |
| 856 form) | |
| 857 ((and (eq (car-safe arg) 'cons) | |
| 858 (eq (length arg) 3)) | |
| 859 `(progn ,(nth 1 arg) ,(nth 2 arg))) | |
| 860 ((eq (car-safe arg) 'list) | |
| 861 (if (> (length arg) 2) | |
| 862 `(progn ,(cadr arg) (list ,@(cddr arg))) | |
| 863 (cadr arg))) | |
| 864 (t | |
| 865 (byte-optimize-predicate form))))) | |
| 866 | |
| 428 | 867 (put 'identity 'byte-optimizer 'byte-optimize-identity) |
| 868 | |
| 869 (put '+ 'byte-optimizer 'byte-optimize-plus) | |
| 870 (put '* 'byte-optimizer 'byte-optimize-multiply) | |
| 871 (put '- 'byte-optimizer 'byte-optimize-minus) | |
| 872 (put '/ 'byte-optimizer 'byte-optimize-divide) | |
| 446 | 873 (put '% 'byte-optimizer 'byte-optimize-predicate) |
| 428 | 874 (put 'max 'byte-optimizer 'byte-optimize-associative-math) |
| 875 (put 'min 'byte-optimizer 'byte-optimize-associative-math) | |
| 876 | |
| 877 (put 'eq 'byte-optimizer 'byte-optimize-binary-predicate) | |
| 878 (put 'eql 'byte-optimizer 'byte-optimize-binary-predicate) | |
| 879 (put 'equal 'byte-optimizer 'byte-optimize-binary-predicate) | |
| 880 (put 'string= 'byte-optimizer 'byte-optimize-binary-predicate) | |
| 881 (put 'string-equal 'byte-optimizer 'byte-optimize-binary-predicate) | |
| 882 | |
| 550 | 883 (put '= 'byte-optimizer 'byte-optimize-predicate) |
| 428 | 884 (put '< 'byte-optimizer 'byte-optimize-predicate) |
| 885 (put '> 'byte-optimizer 'byte-optimize-predicate) | |
| 886 (put '<= 'byte-optimizer 'byte-optimize-predicate) | |
| 887 (put '>= 'byte-optimizer 'byte-optimize-predicate) | |
| 888 (put '1+ 'byte-optimizer 'byte-optimize-predicate) | |
| 889 (put '1- 'byte-optimizer 'byte-optimize-predicate) | |
| 890 (put 'not 'byte-optimizer 'byte-optimize-predicate) | |
| 891 (put 'null 'byte-optimizer 'byte-optimize-predicate) | |
| 892 (put 'memq 'byte-optimizer 'byte-optimize-predicate) | |
| 893 (put 'consp 'byte-optimizer 'byte-optimize-predicate) | |
| 894 (put 'listp 'byte-optimizer 'byte-optimize-predicate) | |
| 895 (put 'symbolp 'byte-optimizer 'byte-optimize-predicate) | |
| 896 (put 'stringp 'byte-optimizer 'byte-optimize-predicate) | |
| 897 (put 'string< 'byte-optimizer 'byte-optimize-predicate) | |
| 898 (put 'string-lessp 'byte-optimizer 'byte-optimize-predicate) | |
| 440 | 899 (put 'length 'byte-optimizer 'byte-optimize-predicate) |
| 428 | 900 |
| 901 (put 'logand 'byte-optimizer 'byte-optimize-logmumble) | |
| 902 (put 'logior 'byte-optimizer 'byte-optimize-logmumble) | |
| 903 (put 'logxor 'byte-optimizer 'byte-optimize-logmumble) | |
| 904 (put 'lognot 'byte-optimizer 'byte-optimize-predicate) | |
| 905 | |
| 444 | 906 (put 'car 'byte-optimizer 'byte-optimize-car) |
| 907 (put 'cdr 'byte-optimizer 'byte-optimize-cdr) | |
| 428 | 908 (put 'car-safe 'byte-optimizer 'byte-optimize-predicate) |
| 909 (put 'cdr-safe 'byte-optimizer 'byte-optimize-predicate) | |
| 910 | |
| 911 | |
| 440 | 912 ;; I'm not convinced that this is necessary. Doesn't the optimizer loop |
| 428 | 913 ;; take care of this? - Jamie |
| 914 ;; I think this may some times be necessary to reduce eg. (quote 5) to 5, | |
| 915 ;; so arithmetic optimizers recognize the numeric constant. - Hallvard | |
| 916 (put 'quote 'byte-optimizer 'byte-optimize-quote) | |
| 917 (defun byte-optimize-quote (form) | |
| 918 (if (or (consp (nth 1 form)) | |
| 919 (and (symbolp (nth 1 form)) | |
| 920 ;; XEmacs addition: | |
| 921 (not (keywordp (nth 1 form))) | |
| 922 (not (memq (nth 1 form) '(nil t))))) | |
| 923 form | |
| 924 (nth 1 form))) | |
| 925 | |
| 926 (defun byte-optimize-zerop (form) | |
| 927 (cond ((numberp (nth 1 form)) | |
| 928 (eval form)) | |
| 929 (byte-compile-delete-errors | |
| 930 (list '= (nth 1 form) 0)) | |
| 931 (form))) | |
| 932 | |
| 933 (put 'zerop 'byte-optimizer 'byte-optimize-zerop) | |
| 934 | |
| 935 (defun byte-optimize-and (form) | |
| 936 ;; Simplify if less than 2 args. | |
| 937 ;; if there is a literal nil in the args to `and', throw it and following | |
| 938 ;; forms away, and surround the `and' with (progn ... nil). | |
| 939 (cond ((null (cdr form))) | |
| 940 ((memq nil form) | |
| 941 (list 'progn | |
| 942 (byte-optimize-and | |
| 943 (prog1 (setq form (copy-sequence form)) | |
| 944 (while (nth 1 form) | |
| 945 (setq form (cdr form))) | |
| 946 (setcdr form nil))) | |
| 947 nil)) | |
| 948 ((null (cdr (cdr form))) | |
| 949 (nth 1 form)) | |
| 950 ((byte-optimize-predicate form)))) | |
| 951 | |
| 952 (defun byte-optimize-or (form) | |
|
4686
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
953 ;; Throw away unneeded nils, and simplify if less than 2 args. |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
954 ;; XEmacs; change to be more careful about discarding multiple values. |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
955 (let* ((memqueued (memq nil form)) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
956 (trailing-nil (and (cdr memqueued) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
957 (equal '(nil) (last form)))) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
958 rest) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
959 ;; A trailing nil indicates to discard multiple values, and we need to |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
960 ;; respect that: |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
961 (when (and memqueued (cdr memqueued)) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
962 (setq form (delq nil (copy-sequence form))) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
963 (when trailing-nil |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
964 (setcdr (last form) '(nil)))) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
965 (setq rest form) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
966 ;; If there is a literal non-nil constant in the args to `or', throw |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
967 ;; away all following forms. We can do this because a literal non-nil |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
968 ;; constant cannot be multiple. |
| 428 | 969 (while (cdr (setq rest (cdr rest))) |
| 970 (if (byte-compile-trueconstp (car rest)) | |
| 971 (setq form (copy-sequence form) | |
| 972 rest (setcdr (memq (car rest) form) nil)))) | |
| 973 (if (cdr (cdr form)) | |
| 974 (byte-optimize-predicate form) | |
| 975 (nth 1 form)))) | |
| 976 | |
| 1297 | 977 ;; END SYNC WITH 20.7. |
| 978 | |
| 448 | 979 ;;; For the byte optimizer, `cond' is just overly sweet syntactic sugar. |
| 980 ;;; So we rewrite (cond ...) in terms of `if' and `or', | |
| 981 ;;; which are easier to optimize. | |
| 428 | 982 (defun byte-optimize-cond (form) |
| 448 | 983 (byte-optimize-cond-1 (cdr form))) |
| 984 | |
| 985 (defun byte-optimize-cond-1 (clauses) | |
| 986 (cond | |
| 987 ((null clauses) nil) | |
| 988 ((consp (car clauses)) | |
| 989 (nconc | |
| 990 (case (length (car clauses)) | |
|
4686
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
991 (1 (if (cdr clauses) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
992 `(or ,(nth 0 (car clauses))) |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
993 ;; XEmacs: don't pass any multiple values back: |
|
cdabd56ce1b5
Fix various small issues with the multiple-value implementation.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4677
diff
changeset
|
994 `(or ,(nth 0 (car clauses)) nil))) |
| 448 | 995 (2 `(if ,(nth 0 (car clauses)) ,(nth 1 (car clauses)))) |
| 996 (t `(if ,(nth 0 (car clauses)) (progn ,@(cdr (car clauses)))))) | |
| 997 (when (cdr clauses) (list (byte-optimize-cond-1 (cdr clauses)))))) | |
| 998 (t (error "malformed cond clause %s" (car clauses))))) | |
| 428 | 999 |
| 1297 | 1000 ;; BEGIN SYNC WITH 20.7. |
| 1001 | |
| 428 | 1002 (defun byte-optimize-if (form) |
| 1003 ;; (if <true-constant> <then> <else...>) ==> <then> | |
| 1004 ;; (if <false-constant> <then> <else...>) ==> (progn <else...>) | |
| 1005 ;; (if <test> nil <else...>) ==> (if (not <test>) (progn <else...>)) | |
| 1006 ;; (if <test> <then> nil) ==> (if <test> <then>) | |
| 1007 (let ((clause (nth 1 form))) | |
| 1008 (cond ((byte-compile-trueconstp clause) | |
| 1009 (nth 2 form)) | |
| 1010 ((null clause) | |
| 1011 (if (nthcdr 4 form) | |
| 1012 (cons 'progn (nthcdr 3 form)) | |
| 1013 (nth 3 form))) | |
| 1014 ((nth 2 form) | |
| 1015 (if (equal '(nil) (nthcdr 3 form)) | |
| 1016 (list 'if clause (nth 2 form)) | |
| 1017 form)) | |
| 1018 ((or (nth 3 form) (nthcdr 4 form)) | |
| 1019 (list 'if | |
| 1020 ;; Don't make a double negative; | |
| 1021 ;; instead, take away the one that is there. | |
| 1022 (if (and (consp clause) (memq (car clause) '(not null)) | |
| 1023 (= (length clause) 2)) ; (not xxxx) or (not (xxxx)) | |
| 1024 (nth 1 clause) | |
| 1025 (list 'not clause)) | |
| 1026 (if (nthcdr 4 form) | |
| 1027 (cons 'progn (nthcdr 3 form)) | |
| 1028 (nth 3 form)))) | |
| 1029 (t | |
| 1030 (list 'progn clause nil))))) | |
| 1031 | |
| 1032 (defun byte-optimize-while (form) | |
| 1033 (if (nth 1 form) | |
| 1034 form)) | |
| 1035 | |
| 1036 (put 'and 'byte-optimizer 'byte-optimize-and) | |
| 1037 (put 'or 'byte-optimizer 'byte-optimize-or) | |
| 1038 (put 'cond 'byte-optimizer 'byte-optimize-cond) | |
| 1039 (put 'if 'byte-optimizer 'byte-optimize-if) | |
| 1040 (put 'while 'byte-optimizer 'byte-optimize-while) | |
| 1041 | |
| 446 | 1042 ;; The supply of bytecodes is small and constrained by backward compatibility. |
| 1043 ;; Several functions have byte-coded versions and hence are very efficient. | |
| 1044 ;; Related functions which can be expressed in terms of the byte-coded | |
| 1045 ;; ones should be transformed into bytecoded calls for efficiency. | |
| 1046 ;; This is especially the case for functions with a backward- and | |
| 1047 ;; forward- version, but with a bytecode only for the forward one. | |
| 1048 | |
| 1049 ;; Some programmers have hand-optimized calls like (backward-char) | |
| 1050 ;; into the call (forward-char -1). | |
| 1051 ;; But it's so much nicer for the byte-compiler to do this automatically! | |
| 1052 | |
| 1053 ;; (char-before) ==> (char-after (1- (point))) | |
| 1054 (put 'char-before 'byte-optimizer 'byte-optimize-char-before) | |
| 434 | 1055 (defun byte-optimize-char-before (form) |
| 446 | 1056 `(char-after |
| 1057 ,(cond | |
| 1058 ((null (nth 1 form)) | |
| 1059 '(1- (point))) | |
| 1060 ((equal '(point) (nth 1 form)) | |
| 1061 '(1- (point))) | |
| 1062 (t `(1- (or ,(nth 1 form) (point))))) | |
| 1063 ,@(cdr (cdr form)))) | |
| 1064 | |
| 1065 ;; (backward-char n) ==> (forward-char (- n)) | |
| 1066 (put 'backward-char 'byte-optimizer 'byte-optimize-backward-char) | |
| 1067 (defun byte-optimize-backward-char (form) | |
| 1068 `(forward-char | |
| 1069 ,(typecase (nth 1 form) | |
| 1070 (null -1) | |
| 1071 (integer (- (nth 1 form))) | |
| 1072 (t `(- (or ,(nth 1 form) 1)))) | |
| 1073 ,@(cdr (cdr form)))) | |
| 440 | 1074 |
| 446 | 1075 ;; (backward-word n) ==> (forward-word (- n)) |
| 1076 (put 'backward-word 'byte-optimizer 'byte-optimize-backward-word) | |
| 1077 (defun byte-optimize-backward-word (form) | |
| 1078 `(forward-word | |
| 1079 ,(typecase (nth 1 form) | |
| 1080 (null -1) | |
| 1081 (integer (- (nth 1 form))) | |
| 1082 (t `(- (or ,(nth 1 form) 1)))) | |
| 1083 ,@(cdr (cdr form)))) | |
| 1084 | |
| 1085 ;; The following would be a valid optimization of the above kind, but | |
| 1086 ;; the gain in performance is very small, since the saved funcall is | |
| 1087 ;; counterbalanced by the necessity of adding a bytecode for (point). | |
| 1088 ;; | |
| 1089 ;; Also, users are more likely to have modified the behavior of | |
| 1090 ;; delete-char via advice or some similar mechanism. This is much | |
| 1091 ;; less of a problem for the previous functions because it wouldn't | |
| 1092 ;; make sense to modify the behaviour of `backward-char' without also | |
| 1093 ;; modifying `forward-char', for example. | |
| 1094 | |
| 1095 ;; (delete-char n) ==> (delete-region (point) (+ (point) n)) | |
| 1096 ;; (put 'delete-char 'byte-optimizer 'byte-optimize-delete-char) | |
| 1097 ;; (defun byte-optimize-delete-char (form) | |
| 1098 ;; (case (length (cdr form)) | |
| 1099 ;; (0 `(delete-region (point) (1+ (point)))) | |
| 1100 ;; (1 `(delete-region (point) (+ (point) ,(nth 1 form)))) | |
| 1101 ;; (t form))) | |
| 434 | 1102 |
| 428 | 1103 ;; byte-compile-negation-optimizer lives in bytecomp.el |
| 1104 ;(put '/= 'byte-optimizer 'byte-compile-negation-optimizer) | |
| 1105 (put 'atom 'byte-optimizer 'byte-compile-negation-optimizer) | |
| 1106 (put 'nlistp 'byte-optimizer 'byte-compile-negation-optimizer) | |
| 1107 | |
| 1108 (defun byte-optimize-funcall (form) | |
|
4677
8f1ee2d15784
Support full Common Lisp multiple values in C.
Aidan Kehoe <kehoea@parhasard.net>
parents:
4601
diff
changeset
|
1109 ;; (funcall #'(lambda ...) ...) ==> ((lambda ...) ...) |
| 428 | 1110 ;; (funcall 'foo ...) ==> (foo ...) |
| 1111 (let ((fn (nth 1 form))) | |
| 1112 (if (memq (car-safe fn) '(quote function)) | |
| 1113 (cons (nth 1 fn) (cdr (cdr form))) | |
| 1114 form))) | |
| 1115 | |
| 1116 (defun byte-optimize-apply (form) | |
| 1117 ;; If the last arg is a literal constant, turn this into a funcall. | |
| 1118 ;; The funcall optimizer can then transform (funcall 'foo ...) -> (foo ...). | |
| 1119 (let ((fn (nth 1 form)) | |
| 1120 (last (nth (1- (length form)) form))) ; I think this really is fastest | |
| 1121 (or (if (or (null last) | |
| 1122 (eq (car-safe last) 'quote)) | |
| 1123 (if (listp (nth 1 last)) | |
| 1124 (let ((butlast (nreverse (cdr (reverse (cdr (cdr form))))))) | |
| 1125 (nconc (list 'funcall fn) butlast | |
| 1126 (mapcar #'(lambda (x) (list 'quote x)) (nth 1 last)))) | |
| 1127 (byte-compile-warn | |
| 1128 "last arg to apply can't be a literal atom: %s" | |
| 1129 (prin1-to-string last)) | |
| 1130 nil)) | |
| 1131 form))) | |
| 1132 | |
| 1133 (put 'funcall 'byte-optimizer 'byte-optimize-funcall) | |
| 1134 (put 'apply 'byte-optimizer 'byte-optimize-apply) | |
| 1135 | |
| 1136 | |
| 1137 (put 'let 'byte-optimizer 'byte-optimize-letX) | |
| 1138 (put 'let* 'byte-optimizer 'byte-optimize-letX) | |
| 1139 (defun byte-optimize-letX (form) | |
| 1140 (cond ((null (nth 1 form)) | |
| 1141 ;; No bindings | |
| 1142 (cons 'progn (cdr (cdr form)))) | |
| 1143 ((or (nth 2 form) (nthcdr 3 form)) | |
| 1144 form) | |
| 1145 ;; The body is nil | |
| 1146 ((eq (car form) 'let) | |
| 1147 (append '(progn) (mapcar 'car-safe (mapcar 'cdr-safe (nth 1 form))) | |
| 1148 '(nil))) | |
| 1149 (t | |
| 1150 (let ((binds (reverse (nth 1 form)))) | |
| 1151 (list 'let* (reverse (cdr binds)) (nth 1 (car binds)) nil))))) | |
| 1152 | |
| 1153 | |
| 1154 (put 'nth 'byte-optimizer 'byte-optimize-nth) | |
| 1155 (defun byte-optimize-nth (form) | |
| 1156 (if (and (= (safe-length form) 3) (memq (nth 1 form) '(0 1))) | |
| 1157 (list 'car (if (zerop (nth 1 form)) | |
| 1158 (nth 2 form) | |
| 1159 (list 'cdr (nth 2 form)))) | |
| 1160 (byte-optimize-predicate form))) | |
| 1161 | |
| 1162 (put 'nthcdr 'byte-optimizer 'byte-optimize-nthcdr) | |
| 1163 (defun byte-optimize-nthcdr (form) | |
| 1164 (if (and (= (safe-length form) 3) (not (memq (nth 1 form) '(0 1 2)))) | |
| 1165 (byte-optimize-predicate form) | |
| 1166 (let ((count (nth 1 form))) | |
| 1167 (setq form (nth 2 form)) | |
| 1168 (while (>= (setq count (1- count)) 0) | |
| 1169 (setq form (list 'cdr form))) | |
| 1170 form))) | |
| 444 | 1171 |
| 1172 (put 'concat 'byte-optimizer 'byte-optimize-concat) | |
| 1173 (defun byte-optimize-concat (form) | |
| 1174 (let ((args (cdr form)) | |
| 1175 (constant t)) | |
| 1176 (while (and args constant) | |
| 1177 (or (byte-compile-constp (car args)) | |
| 1178 (setq constant nil)) | |
| 1179 (setq args (cdr args))) | |
| 1180 (if constant | |
| 1181 (eval form) | |
| 1182 form))) | |
| 4160 | 1183 |
| 4228 | 1184 (defvar byte-optimize-ever-present-features |
| 1185 '(xemacs cl cl-extra cl-19 backquote)) | |
| 1186 | |
| 1187 (put 'featurep 'byte-optimizer 'byte-optimize-featurep) | |
| 1188 (defun byte-optimize-featurep (form) | |
| 4288 | 1189 (if (memq (car-safe |
| 1190 (cdr-safe | |
| 1191 (car-safe | |
| 1192 (cdr-safe | |
| 1193 form)))) | |
| 1194 byte-optimize-ever-present-features) | |
| 1195 t | |
| 1196 form)) | |
| 4228 | 1197 |
| 428 | 1198 |
| 440 | 1199 ;;; enumerating those functions which need not be called if the returned |
| 428 | 1200 ;;; value is not used. That is, something like |
| 1201 ;;; (progn (list (something-with-side-effects) (yow)) | |
| 1202 ;;; (foo)) | |
| 1203 ;;; may safely be turned into | |
| 1204 ;;; (progn (progn (something-with-side-effects) (yow)) | |
| 1205 ;;; (foo)) | |
| 1206 ;;; Further optimizations will turn (progn (list 1 2 3) 'foo) into 'foo. | |
| 1207 | |
| 1208 ;;; I wonder if I missed any :-\) | |
| 1209 (let ((side-effect-free-fns | |
| 1210 '(% * + - / /= 1+ 1- < <= = > >= abs acos append aref ash asin atan | |
| 1211 assoc assq | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1212 bigfloat-get-precision boundp buffer-file-name buffer-local-variables |
|
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1213 buffer-modified-p buffer-substring |
| 428 | 1214 capitalize car-less-than-car car cdr ceiling concat |
| 1215 ;; coordinates-in-window-p not in XEmacs | |
| 1216 copy-marker cos count-lines | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1217 default-boundp default-value denominator documentation downcase |
| 428 | 1218 elt exp expt fboundp featurep |
| 1219 file-directory-p file-exists-p file-locked-p file-name-absolute-p | |
| 1220 file-newer-than-file-p file-readable-p file-symlink-p file-writable-p | |
| 1221 float floor format | |
| 1222 get get-buffer get-buffer-window getenv get-file-buffer | |
| 1223 ;; hash-table functions | |
| 1224 make-hash-table copy-hash-table | |
| 1225 gethash | |
| 1226 hash-table-count | |
| 1227 hash-table-rehash-size | |
| 1228 hash-table-rehash-threshold | |
| 1229 hash-table-size | |
| 1230 hash-table-test | |
| 1231 hash-table-type | |
| 1232 ;; | |
| 1233 int-to-string | |
| 1234 length log log10 logand logb logior lognot logxor lsh | |
| 1235 marker-buffer max member memq min mod | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1236 next-window nth nthcdr number-to-string numerator |
| 440 | 1237 parse-colon-path plist-get previous-window |
| 428 | 1238 radians-to-degrees rassq regexp-quote reverse round |
| 1239 sin sqrt string< string= string-equal string-lessp string-to-char | |
| 1240 string-to-int string-to-number substring symbol-plist | |
| 1241 tan upcase user-variable-p vconcat | |
| 1242 ;; XEmacs change: window-edges -> window-pixel-edges | |
| 1243 window-buffer window-dedicated-p window-pixel-edges window-height | |
| 1244 window-hscroll window-minibuffer-p window-width | |
| 1245 zerop | |
| 1246 ;; functions defined by cl | |
| 1247 oddp evenp plusp minusp | |
| 1248 abs expt signum last butlast ldiff | |
| 1249 pairlis gcd lcm | |
| 1250 isqrt floor* ceiling* truncate* round* mod* rem* subseq | |
| 440 | 1251 list-length getf |
| 428 | 1252 )) |
| 1253 (side-effect-and-error-free-fns | |
| 1254 '(arrayp atom | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1255 bigfloatp bignump bobp bolp buffer-end buffer-list buffer-size |
|
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1256 buffer-string bufferp |
| 428 | 1257 car-safe case-table-p cdr-safe char-or-string-p char-table-p |
| 1258 characterp commandp cons | |
| 1259 consolep console-live-p consp | |
| 1260 current-buffer | |
| 1261 ;; XEmacs: extent functions, frame-live-p, various other stuff | |
| 1262 devicep device-live-p | |
| 1263 dot dot-marker eobp eolp eq eql equal eventp extentp | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1264 extent-live-p fixnump floatingp floatp framep frame-live-p |
| 428 | 1265 get-largest-window get-lru-window |
| 1266 hash-table-p | |
| 1267 identity ignore integerp integer-or-marker-p interactive-p | |
| 1268 invocation-directory invocation-name | |
| 444 | 1269 keymapp list listp |
| 428 | 1270 make-marker mark mark-marker markerp memory-limit minibuffer-window |
| 1271 ;; mouse-movement-p not in XEmacs | |
| 1272 natnump nlistp not null number-or-marker-p numberp | |
| 1273 one-window-p ;; overlayp not in XEmacs | |
| 1274 point point-marker point-min point-max processp | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1275 rationalp ratiop range-table-p realp |
| 428 | 1276 selected-window sequencep stringp subrp symbolp syntax-table-p |
| 1277 user-full-name user-login-name user-original-login-name | |
| 1278 user-real-login-name user-real-uid user-uid | |
| 1279 vector vectorp | |
| 1280 window-configuration-p window-live-p windowp | |
| 1281 ;; Functions defined by cl | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1282 eql list* subst acons equalp random-state-p |
| 428 | 1283 copy-tree sublis |
| 1284 ))) | |
| 1285 (dolist (fn side-effect-free-fns) | |
| 1286 (put fn 'side-effect-free t)) | |
| 1287 (dolist (fn side-effect-and-error-free-fns) | |
| 1288 (put fn 'side-effect-free 'error-free))) | |
| 1289 | |
| 1290 | |
| 1291 (defun byte-compile-splice-in-already-compiled-code (form) | |
| 1292 ;; form is (byte-code "..." [...] n) | |
| 446 | 1293 (if (not (memq byte-optimize '(t byte))) |
| 428 | 1294 (byte-compile-normal-call form) |
| 1295 (byte-inline-lapcode | |
| 1296 (byte-decompile-bytecode-1 (nth 1 form) (nth 2 form) t)) | |
| 1297 (setq byte-compile-maxdepth (max (+ byte-compile-depth (nth 3 form)) | |
| 1298 byte-compile-maxdepth)) | |
| 1299 (setq byte-compile-depth (1+ byte-compile-depth)))) | |
| 1300 | |
| 1301 (put 'byte-code 'byte-compile 'byte-compile-splice-in-already-compiled-code) | |
| 1302 | |
| 1303 | |
| 1304 (defconst byte-constref-ops | |
| 1305 '(byte-constant byte-constant2 byte-varref byte-varset byte-varbind)) | |
| 1306 | |
| 1307 ;;; This function extracts the bitfields from variable-length opcodes. | |
| 1308 ;;; Originally defined in disass.el (which no longer uses it.) | |
| 1309 | |
| 1310 (defun disassemble-offset () | |
| 1311 "Don't call this!" | |
| 1312 ;; fetch and return the offset for the current opcode. | |
| 1313 ;; return NIL if this opcode has no offset | |
| 1314 ;; OP, PTR and BYTES are used and set dynamically | |
| 442 | 1315 (declare (special op ptr bytes)) |
| 428 | 1316 (cond ((< op byte-nth) |
| 1317 (let ((tem (logand op 7))) | |
| 1318 (setq op (logand op 248)) | |
| 1319 (cond ((eq tem 6) | |
| 1320 (setq ptr (1+ ptr)) ;offset in next byte | |
| 1321 ;; char-to-int to avoid downstream problems | |
| 1322 ;; caused by chars appearing where ints are | |
| 1323 ;; expected. In bytecode the bytes in the | |
| 1324 ;; opcode string are always interpreted as ints. | |
| 1325 (char-to-int (aref bytes ptr))) | |
| 1326 ((eq tem 7) | |
| 1327 (setq ptr (1+ ptr)) ;offset in next 2 bytes | |
| 1328 (+ (aref bytes ptr) | |
| 1329 (progn (setq ptr (1+ ptr)) | |
| 1330 (lsh (aref bytes ptr) 8)))) | |
| 1331 (t tem)))) ;offset was in opcode | |
| 1332 ((>= op byte-constant) | |
| 1333 (prog1 (- op byte-constant) ;offset in opcode | |
| 1334 (setq op byte-constant))) | |
| 1335 ((and (>= op byte-constant2) | |
| 1336 (<= op byte-goto-if-not-nil-else-pop)) | |
| 1337 (setq ptr (1+ ptr)) ;offset in next 2 bytes | |
| 1338 (+ (aref bytes ptr) | |
| 1339 (progn (setq ptr (1+ ptr)) | |
| 1340 (lsh (aref bytes ptr) 8)))) | |
| 1341 ;; XEmacs: this code was here before. FSF's first comparison | |
| 1342 ;; is (>= op byte-listN). It appears that the rel-goto stuff | |
| 1343 ;; does not exist in FSF 19.30. It doesn't exist in 19.28 | |
| 1344 ;; either, so I'm going to assume that this is an improvement | |
| 1345 ;; on our part and leave it in. --ben | |
| 1346 ((and (>= op byte-rel-goto) | |
| 1347 (<= op byte-insertN)) | |
| 1348 (setq ptr (1+ ptr)) ;offset in next byte | |
| 1349 ;; Use char-to-int to avoid downstream problems caused by | |
| 1350 ;; chars appearing where ints are expected. In bytecode | |
| 1351 ;; the bytes in the opcode string are always interpreted as | |
| 1352 ;; ints. | |
| 1353 (char-to-int (aref bytes ptr))))) | |
| 1354 | |
| 1355 | |
| 1356 ;;; This de-compiler is used for inline expansion of compiled functions, | |
| 1357 ;;; and by the disassembler. | |
| 1358 ;;; | |
| 1359 ;;; This list contains numbers, which are pc values, | |
| 1360 ;;; before each instruction. | |
| 1361 (defun byte-decompile-bytecode (bytes constvec) | |
| 1362 "Turns BYTECODE into lapcode, referring to CONSTVEC." | |
| 1363 (let ((byte-compile-constants nil) | |
| 1364 (byte-compile-variables nil) | |
| 1365 (byte-compile-tag-number 0)) | |
| 1366 (byte-decompile-bytecode-1 bytes constvec))) | |
| 1367 | |
| 1368 ;; As byte-decompile-bytecode, but updates | |
| 1369 ;; byte-compile-{constants, variables, tag-number}. | |
| 1370 ;; If MAKE-SPLICEABLE is true, then `return' opcodes are replaced | |
| 1371 ;; with `goto's destined for the end of the code. | |
| 1372 ;; That is for use by the compiler. | |
| 1373 ;; If MAKE-SPLICEABLE is nil, we are being called for the disassembler. | |
| 1374 ;; In that case, we put a pc value into the list | |
| 1375 ;; before each insn (or its label). | |
| 1376 (defun byte-decompile-bytecode-1 (bytes constvec &optional make-spliceable) | |
| 1377 (let ((length (length bytes)) | |
| 1378 (ptr 0) optr tags op offset | |
| 1379 ;; tag unused | |
| 1380 lap tmp | |
| 1381 endtag | |
| 1382 ;; (retcount 0) unused | |
| 1383 ) | |
| 1384 (while (not (= ptr length)) | |
| 1385 (or make-spliceable | |
| 1386 (setq lap (cons ptr lap))) | |
| 1387 (setq op (aref bytes ptr) | |
| 1388 optr ptr | |
| 1389 offset (disassemble-offset)) ; this does dynamic-scope magic | |
| 1390 (setq op (aref byte-code-vector op)) | |
| 1391 ;; XEmacs: the next line in FSF 19.30 reads | |
| 1392 ;; (cond ((memq op byte-goto-ops) | |
| 1393 ;; see the comment above about byte-rel-goto in XEmacs. | |
| 1394 (cond ((or (memq op byte-goto-ops) | |
| 1395 (cond ((memq op byte-rel-goto-ops) | |
| 1396 (setq op (aref byte-code-vector | |
| 1397 (- (symbol-value op) | |
| 1398 (- byte-rel-goto byte-goto)))) | |
| 1399 (setq offset (+ ptr (- offset 127))) | |
| 1400 t))) | |
| 1401 ;; it's a pc | |
| 1402 (setq offset | |
| 1403 (cdr (or (assq offset tags) | |
| 1404 (car (setq tags | |
| 1405 (cons (cons offset | |
| 1406 (byte-compile-make-tag)) | |
| 1407 tags))))))) | |
| 1408 ((cond ((eq op 'byte-constant2) (setq op 'byte-constant) t) | |
| 1409 ((memq op byte-constref-ops))) | |
| 1297 | 1410 (setq tmp (if (>= offset (length constvec)) |
| 1411 (list 'out-of-range offset) | |
| 1412 (aref constvec offset)) | |
| 428 | 1413 offset (if (eq op 'byte-constant) |
| 1414 (byte-compile-get-constant tmp) | |
| 1415 (or (assq tmp byte-compile-variables) | |
| 1416 (car (setq byte-compile-variables | |
| 1417 (cons (list tmp) | |
| 1418 byte-compile-variables))))))) | |
| 1419 ((and make-spliceable | |
| 1420 (eq op 'byte-return)) | |
| 1421 (if (= ptr (1- length)) | |
| 1422 (setq op nil) | |
| 1423 (setq offset (or endtag (setq endtag (byte-compile-make-tag))) | |
| 1424 op 'byte-goto)))) | |
| 1425 ;; lap = ( [ (pc . (op . arg)) ]* ) | |
| 1426 (setq lap (cons (cons optr (cons op (or offset 0))) | |
| 1427 lap)) | |
| 1428 (setq ptr (1+ ptr))) | |
| 1429 ;; take off the dummy nil op that we replaced a trailing "return" with. | |
| 1430 (let ((rest lap)) | |
| 1431 (while rest | |
| 1432 (cond ((numberp (car rest))) | |
| 1433 ((setq tmp (assq (car (car rest)) tags)) | |
| 1434 ;; this addr is jumped to | |
| 1435 (setcdr rest (cons (cons nil (cdr tmp)) | |
| 1436 (cdr rest))) | |
| 1437 (setq tags (delq tmp tags)) | |
| 1438 (setq rest (cdr rest)))) | |
| 1439 (setq rest (cdr rest)))) | |
| 1440 (if tags (error "optimizer error: missed tags %s" tags)) | |
| 1441 (if (null (car (cdr (car lap)))) | |
| 1442 (setq lap (cdr lap))) | |
| 1443 (if endtag | |
| 1444 (setq lap (cons (cons nil endtag) lap))) | |
| 1445 ;; remove addrs, lap = ( [ (op . arg) | (TAG tagno) ]* ) | |
| 1446 (mapcar #'(lambda (elt) (if (numberp elt) elt (cdr elt))) | |
| 1447 (nreverse lap)))) | |
| 1448 | |
| 1449 | |
| 1450 ;;; peephole optimizer | |
| 1451 | |
| 1452 (defconst byte-tagref-ops (cons 'TAG byte-goto-ops)) | |
| 1453 | |
| 1454 (defconst byte-conditional-ops | |
| 1455 '(byte-goto-if-nil byte-goto-if-not-nil byte-goto-if-nil-else-pop | |
| 1456 byte-goto-if-not-nil-else-pop)) | |
| 1457 | |
| 1458 (defconst byte-after-unbind-ops | |
| 1459 '(byte-constant byte-dup | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1460 byte-symbolp byte-consp byte-stringp byte-listp byte-numberp byte-fixnump |
| 444 | 1461 byte-eq byte-not |
| 428 | 1462 byte-cons byte-list1 byte-list2 ; byte-list3 byte-list4 |
| 1463 byte-interactive-p) | |
| 1464 ;; How about other side-effect-free-ops? Is it safe to move an | |
| 1465 ;; error invocation (such as from nth) out of an unwind-protect? | |
| 444 | 1466 ;; No, it is not, because the unwind-protect forms can alter |
| 1467 ;; the inside of the object to which nth would apply. | |
| 1468 ;; For the same reason, byte-equal was deleted from this list. | |
| 428 | 1469 "Byte-codes that can be moved past an unbind.") |
| 1470 | |
| 1471 (defconst byte-compile-side-effect-and-error-free-ops | |
| 1472 '(byte-constant byte-dup byte-symbolp byte-consp byte-stringp byte-listp | |
|
4885
6772ce4d982b
Fix hash tables, #'member*, #'assoc*, #'eql compiler macros if bignums
Aidan Kehoe <kehoea@parhasard.net>
parents:
4686
diff
changeset
|
1473 byte-fixnump byte-numberp byte-eq byte-equal byte-not byte-car-safe |
| 428 | 1474 byte-cdr-safe byte-cons byte-list1 byte-list2 byte-point byte-point-max |
| 1475 byte-point-min byte-following-char byte-preceding-char | |
| 1476 byte-current-column byte-eolp byte-eobp byte-bolp byte-bobp | |
| 1477 byte-current-buffer byte-interactive-p)) | |
| 1478 | |
| 1479 (defconst byte-compile-side-effect-free-ops | |
| 440 | 1480 (nconc |
| 428 | 1481 '(byte-varref byte-nth byte-memq byte-car byte-cdr byte-length byte-aref |
| 1482 byte-symbol-value byte-get byte-concat2 byte-concat3 byte-sub1 byte-add1 | |
| 1483 byte-eqlsign byte-gtr byte-lss byte-leq byte-geq byte-diff byte-negate | |
| 1484 byte-plus byte-max byte-min byte-mult byte-char-after byte-char-syntax | |
| 1485 byte-buffer-substring byte-string= byte-string< byte-nthcdr byte-elt | |
| 1486 byte-member byte-assq byte-quo byte-rem) | |
| 1487 byte-compile-side-effect-and-error-free-ops)) | |
| 1488 | |
| 1489 ;;; This piece of shit is because of the way DEFVAR_BOOL() variables work. | |
| 1490 ;;; Consider the code | |
| 1491 ;;; | |
| 1492 ;;; (defun foo (flag) | |
| 1493 ;;; (let ((old-pop-ups pop-up-windows) | |
| 1494 ;;; (pop-up-windows flag)) | |
| 1495 ;;; (cond ((not (eq pop-up-windows old-pop-ups)) | |
| 1496 ;;; (setq old-pop-ups pop-up-windows) | |
| 1497 ;;; ...)))) | |
| 1498 ;;; | |
| 1499 ;;; Uncompiled, old-pop-ups will always be set to nil or t, even if FLAG is | |
| 1500 ;;; something else. But if we optimize | |
| 1501 ;;; | |
| 1502 ;;; varref flag | |
| 1503 ;;; varbind pop-up-windows | |
| 1504 ;;; varref pop-up-windows | |
| 1505 ;;; not | |
| 1506 ;;; to | |
| 1507 ;;; varref flag | |
| 1508 ;;; dup | |
| 1509 ;;; varbind pop-up-windows | |
| 1510 ;;; not | |
| 1511 ;;; | |
| 440 | 1512 ;;; we break the program, because it will appear that pop-up-windows and |
| 428 | 1513 ;;; old-pop-ups are not EQ when really they are. So we have to know what |
| 1514 ;;; the BOOL variables are, and not perform this optimization on them. | |
| 1515 ;;; | |
| 1516 | |
| 1517 ;;; This used to hold a large list of boolean variables, which had to | |
| 1518 ;;; be updated every time a new DEFVAR_BOOL is added, making it very | |
| 1519 ;;; hard to maintain. Such a list is not necessary under XEmacs, | |
| 1520 ;;; where we can use `built-in-variable-type' to query for boolean | |
| 1521 ;;; variables. | |
| 1522 | |
| 1523 ;(defconst byte-boolean-vars | |
| 1297 | 1524 ; ...) |
| 428 | 1525 |
| 1526 (defun byte-optimize-lapcode (lap &optional for-effect) | |
| 1527 "Simple peephole optimizer. LAP is both modified and returned." | |
| 442 | 1528 (let (lap0 |
| 1529 lap1 | |
| 1530 lap2 | |
| 1531 variable-frequency | |
| 428 | 1532 (keep-going 'first-time) |
| 1533 (add-depth 0) | |
| 1534 rest tmp tmp2 tmp3 | |
| 1535 (side-effect-free (if byte-compile-delete-errors | |
| 1536 byte-compile-side-effect-free-ops | |
| 1537 byte-compile-side-effect-and-error-free-ops))) | |
| 1538 (while keep-going | |
| 1539 (or (eq keep-going 'first-time) | |
| 1540 (byte-compile-log-lap " ---- next pass")) | |
| 1541 (setq rest lap | |
| 1542 keep-going nil) | |
| 1543 (while rest | |
| 1544 (setq lap0 (car rest) | |
| 1545 lap1 (nth 1 rest) | |
| 1546 lap2 (nth 2 rest)) | |
| 1547 | |
| 1548 ;; You may notice that sequences like "dup varset discard" are | |
| 1549 ;; optimized but sequences like "dup varset TAG1: discard" are not. | |
| 1550 ;; You may be tempted to change this; resist that temptation. | |
| 1551 (cond ;; | |
| 1552 ;; <side-effect-free> pop --> <deleted> | |
| 1553 ;; ...including: | |
| 1554 ;; const-X pop --> <deleted> | |
| 1555 ;; varref-X pop --> <deleted> | |
| 1556 ;; dup pop --> <deleted> | |
| 1557 ;; | |
| 1558 ((and (eq 'byte-discard (car lap1)) | |
| 1559 (memq (car lap0) side-effect-free)) | |
| 1560 (setq keep-going t) | |
| 1561 (setq tmp (aref byte-stack+-info (symbol-value (car lap0)))) | |
| 1562 (setq rest (cdr rest)) | |
| 1563 (cond ((= tmp 1) | |
| 1564 (byte-compile-log-lap | |
| 1565 " %s discard\t-->\t<deleted>" lap0) | |
| 1566 (setq lap (delq lap0 (delq lap1 lap)))) | |
| 1567 ((= tmp 0) | |
| 1568 (byte-compile-log-lap | |
| 1569 " %s discard\t-->\t<deleted> discard" lap0) | |
| 1570 (setq lap (delq lap0 lap))) | |
| 1571 ((= tmp -1) | |
| 1572 (byte-compile-log-lap | |
| 1573 " %s discard\t-->\tdiscard discard" lap0) | |
| 1574 (setcar lap0 'byte-discard) | |
| 1575 (setcdr lap0 0)) | |
| 1576 ((error "Optimizer error: too much on the stack")))) | |
| 1577 ;; | |
| 1578 ;; goto*-X X: --> X: | |
| 1579 ;; | |
| 1580 ((and (memq (car lap0) byte-goto-ops) | |
| 1581 (eq (cdr lap0) lap1)) | |
| 1582 (cond ((eq (car lap0) 'byte-goto) | |
| 1583 (setq lap (delq lap0 lap)) | |
| 1584 (setq tmp "<deleted>")) | |
| 1585 ((memq (car lap0) byte-goto-always-pop-ops) | |
| 1586 (setcar lap0 (setq tmp 'byte-discard)) | |
| 1587 (setcdr lap0 0)) | |
| 1588 ((error "Depth conflict at tag %d" (nth 2 lap0)))) | |
| 1589 (and (memq byte-optimize-log '(t byte)) | |
| 1590 (byte-compile-log " (goto %s) %s:\t-->\t%s %s:" | |
| 1591 (nth 1 lap1) (nth 1 lap1) | |
| 1592 tmp (nth 1 lap1))) | |
| 1593 (setq keep-going t)) | |
| 1594 ;; | |
| 1595 ;; varset-X varref-X --> dup varset-X | |
| 1596 ;; varbind-X varref-X --> dup varbind-X | |
| 1597 ;; const/dup varset-X varref-X --> const/dup varset-X const/dup | |
| 1598 ;; const/dup varbind-X varref-X --> const/dup varbind-X const/dup | |
| 1599 ;; The latter two can enable other optimizations. | |
| 1600 ;; | |
| 1601 ((and (eq 'byte-varref (car lap2)) | |
| 1602 (eq (cdr lap1) (cdr lap2)) | |
| 1603 (memq (car lap1) '(byte-varset byte-varbind))) | |
| 1604 (if (and (setq tmp (eq (built-in-variable-type (car (cdr lap2))) | |
| 1605 'boolean)) | |
| 1606 (not (eq (car lap0) 'byte-constant))) | |
| 1607 nil | |
| 1608 (setq keep-going t) | |
| 1609 (if (memq (car lap0) '(byte-constant byte-dup)) | |
| 1610 (progn | |
| 1611 (setq tmp (if (or (not tmp) | |
| 1612 (memq (car (cdr lap0)) '(nil t))) | |
| 1613 (cdr lap0) | |
| 1614 (byte-compile-get-constant t))) | |
| 1615 (byte-compile-log-lap " %s %s %s\t-->\t%s %s %s" | |
| 1616 lap0 lap1 lap2 lap0 lap1 | |
| 1617 (cons (car lap0) tmp)) | |
| 1618 (setcar lap2 (car lap0)) | |
| 1619 (setcdr lap2 tmp)) | |
| 1620 (byte-compile-log-lap " %s %s\t-->\tdup %s" lap1 lap2 lap1) | |
| 1621 (setcar lap2 (car lap1)) | |
| 1622 (setcar lap1 'byte-dup) | |
| 1623 (setcdr lap1 0) | |
| 1624 ;; The stack depth gets locally increased, so we will | |
| 1625 ;; increase maxdepth in case depth = maxdepth here. | |
| 1626 ;; This can cause the third argument to byte-code to | |
| 1627 ;; be larger than necessary. | |
| 1628 (setq add-depth 1)))) | |
| 1629 ;; | |
| 1630 ;; dup varset-X discard --> varset-X | |
| 1631 ;; dup varbind-X discard --> varbind-X | |
| 1632 ;; (the varbind variant can emerge from other optimizations) | |
| 1633 ;; | |
| 1634 ((and (eq 'byte-dup (car lap0)) | |
| 1635 (eq 'byte-discard (car lap2)) | |
| 1636 (memq (car lap1) '(byte-varset byte-varbind))) | |
| 1637 (byte-compile-log-lap " dup %s discard\t-->\t%s" lap1 lap1) | |
| 1638 (setq keep-going t | |
| 1639 rest (cdr rest)) | |
| 1640 (setq lap (delq lap0 (delq lap2 lap)))) | |
| 1641 ;; | |
| 1642 ;; not goto-X-if-nil --> goto-X-if-non-nil | |
| 1643 ;; not goto-X-if-non-nil --> goto-X-if-nil | |
| 1644 ;; | |
| 1645 ;; it is wrong to do the same thing for the -else-pop variants. | |
| 1646 ;; | |
| 1647 ((and (eq 'byte-not (car lap0)) | |
| 1648 (or (eq 'byte-goto-if-nil (car lap1)) | |
| 1649 (eq 'byte-goto-if-not-nil (car lap1)))) | |
| 1650 (byte-compile-log-lap " not %s\t-->\t%s" | |
| 1651 lap1 | |
| 1652 (cons | |
| 1653 (if (eq (car lap1) 'byte-goto-if-nil) | |
| 1654 'byte-goto-if-not-nil | |
| 1655 'byte-goto-if-nil) | |
| 1656 (cdr lap1))) | |
| 1657 (setcar lap1 (if (eq (car lap1) 'byte-goto-if-nil) | |
| 1658 'byte-goto-if-not-nil | |
| 1659 'byte-goto-if-nil)) | |
| 1660 (setq lap (delq lap0 lap)) | |
| 1661 (setq keep-going t)) | |
| 1662 ;; | |
| 1663 ;; goto-X-if-nil goto-Y X: --> goto-Y-if-non-nil X: | |
| 1664 ;; goto-X-if-non-nil goto-Y X: --> goto-Y-if-nil X: | |
| 1665 ;; | |
| 1666 ;; it is wrong to do the same thing for the -else-pop variants. | |
| 440 | 1667 ;; |
| 428 | 1668 ((and (or (eq 'byte-goto-if-nil (car lap0)) |
| 1669 (eq 'byte-goto-if-not-nil (car lap0))) ; gotoX | |
| 1670 (eq 'byte-goto (car lap1)) ; gotoY | |
| 1671 (eq (cdr lap0) lap2)) ; TAG X | |
| 1672 (let ((inverse (if (eq 'byte-goto-if-nil (car lap0)) | |
| 1673 'byte-goto-if-not-nil 'byte-goto-if-nil))) | |
| 1674 (byte-compile-log-lap " %s %s %s:\t-->\t%s %s:" | |
| 1675 lap0 lap1 lap2 | |
| 1676 (cons inverse (cdr lap1)) lap2) | |
| 1677 (setq lap (delq lap0 lap)) | |
| 1678 (setcar lap1 inverse) | |
| 1679 (setq keep-going t))) | |
| 1680 ;; | |
| 1681 ;; const goto-if-* --> whatever | |
| 1682 ;; | |
| 1683 ((and (eq 'byte-constant (car lap0)) | |
| 1684 (memq (car lap1) byte-conditional-ops)) | |
| 1685 (cond ((if (or (eq (car lap1) 'byte-goto-if-nil) | |
| 1686 (eq (car lap1) 'byte-goto-if-nil-else-pop)) | |
| 1687 (car (cdr lap0)) | |
| 1688 (not (car (cdr lap0)))) | |
| 1689 (byte-compile-log-lap " %s %s\t-->\t<deleted>" | |
| 1690 lap0 lap1) | |
| 1691 (setq rest (cdr rest) | |
| 1692 lap (delq lap0 (delq lap1 lap)))) | |
| 1693 (t | |
| 1694 (if (memq (car lap1) byte-goto-always-pop-ops) | |
| 1695 (progn | |
| 1696 (byte-compile-log-lap " %s %s\t-->\t%s" | |
| 1697 lap0 lap1 (cons 'byte-goto (cdr lap1))) | |
| 1698 (setq lap (delq lap0 lap))) | |
| 1699 (byte-compile-log-lap " %s %s\t-->\t%s" lap0 lap1 | |
| 1700 (cons 'byte-goto (cdr lap1)))) | |
| 1701 (setcar lap1 'byte-goto))) | |
| 1702 (setq keep-going t)) | |
| 1703 ;; | |
| 1704 ;; varref-X varref-X --> varref-X dup | |
| 1705 ;; varref-X [dup ...] varref-X --> varref-X [dup ...] dup | |
| 1706 ;; We don't optimize the const-X variations on this here, | |
| 1707 ;; because that would inhibit some goto optimizations; we | |
| 1708 ;; optimize the const-X case after all other optimizations. | |
| 1709 ;; | |
| 1710 ((and (eq 'byte-varref (car lap0)) | |
| 1711 (progn | |
| 1712 (setq tmp (cdr rest)) | |
| 1713 (while (eq (car (car tmp)) 'byte-dup) | |
| 1714 (setq tmp (cdr tmp))) | |
| 1715 t) | |
| 1716 (eq (cdr lap0) (cdr (car tmp))) | |
| 1717 (eq 'byte-varref (car (car tmp)))) | |
| 1718 (if (memq byte-optimize-log '(t byte)) | |
| 1719 (let ((str "")) | |
| 1720 (setq tmp2 (cdr rest)) | |
| 1721 (while (not (eq tmp tmp2)) | |
| 1722 (setq tmp2 (cdr tmp2) | |
| 1723 str (concat str " dup"))) | |
| 1724 (byte-compile-log-lap " %s%s %s\t-->\t%s%s dup" | |
| 1725 lap0 str lap0 lap0 str))) | |
| 1726 (setq keep-going t) | |
| 1727 (setcar (car tmp) 'byte-dup) | |
| 1728 (setcdr (car tmp) 0) | |
| 1729 (setq rest tmp)) | |
| 1730 ;; | |
| 1731 ;; TAG1: TAG2: --> TAG1: <deleted> | |
| 1732 ;; (and other references to TAG2 are replaced with TAG1) | |
| 1733 ;; | |
| 1734 ((and (eq (car lap0) 'TAG) | |
| 1735 (eq (car lap1) 'TAG)) | |
| 1736 (and (memq byte-optimize-log '(t byte)) | |
| 1737 (byte-compile-log " adjacent tags %d and %d merged" | |
| 1738 (nth 1 lap1) (nth 1 lap0))) | |
| 1739 (setq tmp3 lap) | |
| 1740 (while (setq tmp2 (rassq lap0 tmp3)) | |
| 1741 (setcdr tmp2 lap1) | |
| 1742 (setq tmp3 (cdr (memq tmp2 tmp3)))) | |
| 1743 (setq lap (delq lap0 lap) | |
| 1744 keep-going t)) | |
| 1745 ;; | |
| 1746 ;; unused-TAG: --> <deleted> | |
| 1747 ;; | |
| 1748 ((and (eq 'TAG (car lap0)) | |
| 1749 (not (rassq lap0 lap))) | |
| 1750 (and (memq byte-optimize-log '(t byte)) | |
| 1751 (byte-compile-log " unused tag %d removed" (nth 1 lap0))) | |
| 1752 (setq lap (delq lap0 lap) | |
| 1753 keep-going t)) | |
| 1754 ;; | |
| 1755 ;; goto ... --> goto <delete until TAG or end> | |
| 1756 ;; return ... --> return <delete until TAG or end> | |
| 1757 ;; | |
| 1758 ((and (memq (car lap0) '(byte-goto byte-return)) | |
| 1759 (not (memq (car lap1) '(TAG nil)))) | |
| 1760 (setq tmp rest) | |
| 1761 (let ((i 0) | |
| 1762 (opt-p (memq byte-optimize-log '(t lap))) | |
| 1763 str deleted) | |
| 1764 (while (and (setq tmp (cdr tmp)) | |
| 1765 (not (eq 'TAG (car (car tmp))))) | |
| 1766 (if opt-p (setq deleted (cons (car tmp) deleted) | |
| 1767 str (concat str " %s") | |
| 1768 i (1+ i)))) | |
| 1769 (if opt-p | |
| 440 | 1770 (let ((tagstr |
| 428 | 1771 (if (eq 'TAG (car (car tmp))) |
| 1772 (format "%d:" (car (cdr (car tmp)))) | |
| 1773 (or (car tmp) "")))) | |
| 1774 (if (< i 6) | |
| 1775 (apply 'byte-compile-log-lap-1 | |
| 1776 (concat " %s" str | |
| 1777 " %s\t-->\t%s <deleted> %s") | |
| 1778 lap0 | |
| 1779 (nconc (nreverse deleted) | |
| 1780 (list tagstr lap0 tagstr))) | |
| 1781 (byte-compile-log-lap | |
| 1782 " %s <%d unreachable op%s> %s\t-->\t%s <deleted> %s" | |
| 1783 lap0 i (if (= i 1) "" "s") | |
| 1784 tagstr lap0 tagstr)))) | |
| 1785 (rplacd rest tmp)) | |
| 1786 (setq keep-going t)) | |
| 1787 ;; | |
| 1788 ;; <safe-op> unbind --> unbind <safe-op> | |
| 1789 ;; (this may enable other optimizations.) | |
| 1790 ;; | |
| 1791 ((and (eq 'byte-unbind (car lap1)) | |
| 1792 (memq (car lap0) byte-after-unbind-ops)) | |
| 1793 (byte-compile-log-lap " %s %s\t-->\t%s %s" lap0 lap1 lap1 lap0) | |
| 1794 (setcar rest lap1) | |
| 1795 (setcar (cdr rest) lap0) | |
| 1796 (setq keep-going t)) | |
| 1797 ;; | |
| 1798 ;; varbind-X unbind-N --> discard unbind-(N-1) | |
| 1799 ;; save-excursion unbind-N --> unbind-(N-1) | |
| 1800 ;; save-restriction unbind-N --> unbind-(N-1) | |
| 1801 ;; | |
| 1802 ((and (eq 'byte-unbind (car lap1)) | |
| 1803 (memq (car lap0) '(byte-varbind byte-save-excursion | |
| 1804 byte-save-restriction)) | |
| 1805 (< 0 (cdr lap1))) | |
| 1806 (if (zerop (setcdr lap1 (1- (cdr lap1)))) | |
| 1807 (delq lap1 rest)) | |
| 1808 (if (eq (car lap0) 'byte-varbind) | |
| 1809 (setcar rest (cons 'byte-discard 0)) | |
| 1810 (setq lap (delq lap0 lap))) | |
| 1811 (byte-compile-log-lap " %s %s\t-->\t%s %s" | |
| 1812 lap0 (cons (car lap1) (1+ (cdr lap1))) | |
| 1813 (if (eq (car lap0) 'byte-varbind) | |
| 1814 (car rest) | |
| 1815 (car (cdr rest))) | |
| 1816 (if (and (/= 0 (cdr lap1)) | |
| 1817 (eq (car lap0) 'byte-varbind)) | |
| 1818 (car (cdr rest)) | |
| 1819 "")) | |
| 1820 (setq keep-going t)) | |
| 1821 ;; | |
| 1822 ;; goto*-X ... X: goto-Y --> goto*-Y | |
| 1823 ;; goto-X ... X: return --> return | |
| 1824 ;; | |
| 1825 ((and (memq (car lap0) byte-goto-ops) | |
| 1826 (memq (car (setq tmp (nth 1 (memq (cdr lap0) lap)))) | |
| 1827 '(byte-goto byte-return))) | |
| 1828 (cond ((and (not (eq tmp lap0)) | |
| 1829 (or (eq (car lap0) 'byte-goto) | |
| 1830 (eq (car tmp) 'byte-goto))) | |
| 1831 (byte-compile-log-lap " %s [%s]\t-->\t%s" | |
| 1832 (car lap0) tmp tmp) | |
| 1833 (if (eq (car tmp) 'byte-return) | |
| 1834 (setcar lap0 'byte-return)) | |
| 1835 (setcdr lap0 (cdr tmp)) | |
| 1836 (setq keep-going t)))) | |
| 1837 ;; | |
| 1838 ;; goto-*-else-pop X ... X: goto-if-* --> whatever | |
| 1839 ;; goto-*-else-pop X ... X: discard --> whatever | |
| 1840 ;; | |
| 1841 ((and (memq (car lap0) '(byte-goto-if-nil-else-pop | |
| 1842 byte-goto-if-not-nil-else-pop)) | |
| 1843 (memq (car (car (setq tmp (cdr (memq (cdr lap0) lap))))) | |
| 1844 (eval-when-compile | |
| 1845 (cons 'byte-discard byte-conditional-ops))) | |
| 1846 (not (eq lap0 (car tmp)))) | |
| 1847 (setq tmp2 (car tmp)) | |
| 1848 (setq tmp3 (assq (car lap0) '((byte-goto-if-nil-else-pop | |
| 1849 byte-goto-if-nil) | |
| 1850 (byte-goto-if-not-nil-else-pop | |
| 1851 byte-goto-if-not-nil)))) | |
| 1852 (if (memq (car tmp2) tmp3) | |
| 1853 (progn (setcar lap0 (car tmp2)) | |
| 1854 (setcdr lap0 (cdr tmp2)) | |
| 1855 (byte-compile-log-lap " %s-else-pop [%s]\t-->\t%s" | |
| 1856 (car lap0) tmp2 lap0)) | |
| 1857 ;; Get rid of the -else-pop's and jump one step further. | |
| 1858 (or (eq 'TAG (car (nth 1 tmp))) | |
| 1859 (setcdr tmp (cons (byte-compile-make-tag) | |
| 1860 (cdr tmp)))) | |
| 1861 (byte-compile-log-lap " %s [%s]\t-->\t%s <skip>" | |
| 1862 (car lap0) tmp2 (nth 1 tmp3)) | |
| 1863 (setcar lap0 (nth 1 tmp3)) | |
| 1864 (setcdr lap0 (nth 1 tmp))) | |
| 1865 (setq keep-going t)) | |
| 1866 ;; | |
| 1867 ;; const goto-X ... X: goto-if-* --> whatever | |
| 1868 ;; const goto-X ... X: discard --> whatever | |
| 1869 ;; | |
| 1870 ((and (eq (car lap0) 'byte-constant) | |
| 1871 (eq (car lap1) 'byte-goto) | |
| 1872 (memq (car (car (setq tmp (cdr (memq (cdr lap1) lap))))) | |
| 1873 (eval-when-compile | |
| 1874 (cons 'byte-discard byte-conditional-ops))) | |
| 1875 (not (eq lap1 (car tmp)))) | |
| 1876 (setq tmp2 (car tmp)) | |
| 1877 (cond ((memq (car tmp2) | |
| 1878 (if (null (car (cdr lap0))) | |
| 1879 '(byte-goto-if-nil byte-goto-if-nil-else-pop) | |
| 1880 '(byte-goto-if-not-nil | |
| 1881 byte-goto-if-not-nil-else-pop))) | |
| 1882 (byte-compile-log-lap " %s goto [%s]\t-->\t%s %s" | |
| 1883 lap0 tmp2 lap0 tmp2) | |
| 1884 (setcar lap1 (car tmp2)) | |
| 1885 (setcdr lap1 (cdr tmp2)) | |
| 1886 ;; Let next step fix the (const,goto-if*) sequence. | |
| 1887 (setq rest (cons nil rest))) | |
| 1888 (t | |
| 1889 ;; Jump one step further | |
| 1890 (byte-compile-log-lap | |
| 1891 " %s goto [%s]\t-->\t<deleted> goto <skip>" | |
| 1892 lap0 tmp2) | |
| 1893 (or (eq 'TAG (car (nth 1 tmp))) | |
| 1894 (setcdr tmp (cons (byte-compile-make-tag) | |
| 1895 (cdr tmp)))) | |
| 1896 (setcdr lap1 (car (cdr tmp))) | |
| 1897 (setq lap (delq lap0 lap)))) | |
| 1898 (setq keep-going t)) | |
| 1899 ;; | |
| 1900 ;; X: varref-Y ... varset-Y goto-X --> | |
| 1901 ;; X: varref-Y Z: ... dup varset-Y goto-Z | |
| 1902 ;; (varset-X goto-BACK, BACK: varref-X --> copy the varref down.) | |
| 1903 ;; (This is so usual for while loops that it is worth handling). | |
| 1904 ;; | |
| 1905 ((and (eq (car lap1) 'byte-varset) | |
| 1906 (eq (car lap2) 'byte-goto) | |
| 1907 (not (memq (cdr lap2) rest)) ;Backwards jump | |
| 1908 (eq (car (car (setq tmp (cdr (memq (cdr lap2) lap))))) | |
| 1909 'byte-varref) | |
| 1910 (eq (cdr (car tmp)) (cdr lap1)) | |
| 1911 (not (eq (built-in-variable-type (car (cdr lap1))) | |
| 1912 'boolean))) | |
| 1913 ;;(byte-compile-log-lap " Pulled %s to end of loop" (car tmp)) | |
| 1914 (let ((newtag (byte-compile-make-tag))) | |
| 1915 (byte-compile-log-lap | |
| 1916 " %s: %s ... %s %s\t-->\t%s: %s %s: ... %s %s %s" | |
| 1917 (nth 1 (cdr lap2)) (car tmp) | |
| 1918 lap1 lap2 | |
| 1919 (nth 1 (cdr lap2)) (car tmp) | |
| 1920 (nth 1 newtag) 'byte-dup lap1 | |
| 1921 (cons 'byte-goto newtag) | |
| 1922 ) | |
| 1923 (setcdr rest (cons (cons 'byte-dup 0) (cdr rest))) | |
| 1924 (setcdr tmp (cons (setcdr lap2 newtag) (cdr tmp)))) | |
| 1925 (setq add-depth 1) | |
| 1926 (setq keep-going t)) | |
| 1927 ;; | |
| 1928 ;; goto-X Y: ... X: goto-if*-Y --> goto-if-not-*-X+1 Y: | |
| 1929 ;; (This can pull the loop test to the end of the loop) | |
| 1930 ;; | |
| 1931 ((and (eq (car lap0) 'byte-goto) | |
| 1932 (eq (car lap1) 'TAG) | |
| 1933 (eq lap1 | |
| 1934 (cdr (car (setq tmp (cdr (memq (cdr lap0) lap)))))) | |
| 1935 (memq (car (car tmp)) | |
| 1936 '(byte-goto byte-goto-if-nil byte-goto-if-not-nil | |
| 1937 byte-goto-if-nil-else-pop))) | |
| 1938 ;; (byte-compile-log-lap " %s %s, %s %s --> moved conditional" | |
| 1939 ;; lap0 lap1 (cdr lap0) (car tmp)) | |
| 1940 (let ((newtag (byte-compile-make-tag))) | |
| 1941 (byte-compile-log-lap | |
| 1942 "%s %s: ... %s: %s\t-->\t%s ... %s:" | |
| 1943 lap0 (nth 1 lap1) (nth 1 (cdr lap0)) (car tmp) | |
| 1944 (cons (cdr (assq (car (car tmp)) | |
| 1945 '((byte-goto-if-nil . byte-goto-if-not-nil) | |
| 1946 (byte-goto-if-not-nil . byte-goto-if-nil) | |
| 1947 (byte-goto-if-nil-else-pop . | |
| 1948 byte-goto-if-not-nil-else-pop) | |
| 1949 (byte-goto-if-not-nil-else-pop . | |
| 1950 byte-goto-if-nil-else-pop)))) | |
| 1951 newtag) | |
| 440 | 1952 |
| 428 | 1953 (nth 1 newtag) |
| 1954 ) | |
| 1955 (setcdr tmp (cons (setcdr lap0 newtag) (cdr tmp))) | |
| 1956 (if (eq (car (car tmp)) 'byte-goto-if-nil-else-pop) | |
| 1957 ;; We can handle this case but not the -if-not-nil case, | |
| 1958 ;; because we won't know which non-nil constant to push. | |
| 1959 (setcdr rest (cons (cons 'byte-constant | |
| 1960 (byte-compile-get-constant nil)) | |
| 1961 (cdr rest)))) | |
| 1962 (setcar lap0 (nth 1 (memq (car (car tmp)) | |
| 1963 '(byte-goto-if-nil-else-pop | |
| 1964 byte-goto-if-not-nil | |
| 1965 byte-goto-if-nil | |
| 1966 byte-goto-if-not-nil | |
| 1967 byte-goto byte-goto)))) | |
| 1968 ) | |
| 1969 (setq keep-going t)) | |
| 1970 ) | |
| 1971 (setq rest (cdr rest))) | |
| 1972 ) | |
| 1973 ;; Cleanup stage: | |
| 1974 ;; Rebuild byte-compile-constants / byte-compile-variables. | |
| 1975 ;; Simple optimizations that would inhibit other optimizations if they | |
| 1976 ;; were done in the optimizing loop, and optimizations which there is no | |
| 442 | 1977 ;; need to do more than once. |
| 428 | 1978 (setq byte-compile-constants nil |
| 442 | 1979 byte-compile-variables nil |
| 1980 variable-frequency (make-hash-table :test 'eq)) | |
| 428 | 1981 (setq rest lap) |
| 1982 (while rest | |
| 1983 (setq lap0 (car rest) | |
| 1984 lap1 (nth 1 rest)) | |
| 1297 | 1985 (if (memq (car lap0) byte-constref-ops) |
| 1986 (if (not (eq (car lap0) 'byte-constant)) | |
| 1987 (progn | |
| 1988 (incf (gethash (cdr lap0) variable-frequency 0)) | |
| 1989 (or (memq (cdr lap0) byte-compile-variables) | |
| 1990 (setq byte-compile-variables | |
| 1991 (cons (cdr lap0) byte-compile-variables)))) | |
| 1992 (or (memq (cdr lap0) byte-compile-constants) | |
| 1993 (setq byte-compile-constants (cons (cdr lap0) | |
| 1994 byte-compile-constants))))) | |
| 428 | 1995 (cond (;; |
| 442 | 1996 ;; const-C varset-X const-C --> const-C dup varset-X |
| 428 | 1997 ;; const-C varbind-X const-C --> const-C dup varbind-X |
| 1998 ;; | |
| 1999 (and (eq (car lap0) 'byte-constant) | |
| 2000 (eq (car (nth 2 rest)) 'byte-constant) | |
| 442 | 2001 (eq (cdr lap0) (cdr (nth 2 rest))) |
| 428 | 2002 (memq (car lap1) '(byte-varbind byte-varset))) |
| 2003 (byte-compile-log-lap " %s %s %s\t-->\t%s dup %s" | |
| 2004 lap0 lap1 lap0 lap0 lap1) | |
| 2005 (setcar (cdr (cdr rest)) (cons (car lap1) (cdr lap1))) | |
| 2006 (setcar (cdr rest) (cons 'byte-dup 0)) | |
| 2007 (setq add-depth 1)) | |
| 2008 ;; | |
| 2009 ;; const-X [dup/const-X ...] --> const-X [dup ...] dup | |
| 2010 ;; varref-X [dup/varref-X ...] --> varref-X [dup ...] dup | |
| 2011 ;; | |
| 2012 ((memq (car lap0) '(byte-constant byte-varref)) | |
| 2013 (setq tmp rest | |
| 2014 tmp2 nil) | |
| 2015 (while (progn | |
| 2016 (while (eq 'byte-dup (car (car (setq tmp (cdr tmp)))))) | |
| 2017 (and (eq (cdr lap0) (cdr (car tmp))) | |
| 2018 (eq (car lap0) (car (car tmp))))) | |
| 2019 (setcar tmp (cons 'byte-dup 0)) | |
| 2020 (setq tmp2 t)) | |
| 2021 (if tmp2 | |
| 2022 (byte-compile-log-lap | |
| 2023 " %s [dup/%s]...\t-->\t%s dup..." lap0 lap0 lap0))) | |
| 2024 ;; | |
| 2025 ;; unbind-N unbind-M --> unbind-(N+M) | |
| 2026 ;; | |
| 2027 ((and (eq 'byte-unbind (car lap0)) | |
| 2028 (eq 'byte-unbind (car lap1))) | |
| 2029 (byte-compile-log-lap " %s %s\t-->\t%s" lap0 lap1 | |
| 2030 (cons 'byte-unbind | |
| 2031 (+ (cdr lap0) (cdr lap1)))) | |
| 2032 (setq keep-going t) | |
| 2033 (setq lap (delq lap0 lap)) | |
| 2034 (setcdr lap1 (+ (cdr lap1) (cdr lap0)))) | |
| 2035 ) | |
| 2036 (setq rest (cdr rest))) | |
| 442 | 2037 ;; Since the first 6 entries of the compiled-function constants |
| 2038 ;; vector are most efficient for varref/set/bind ops, we sort by | |
| 2039 ;; reference count. This generates maximally space efficient and | |
| 2040 ;; pretty time-efficient byte-code. See `byte-compile-constants-vector'. | |
| 2041 (setq byte-compile-variables | |
| 2042 (sort byte-compile-variables | |
| 2043 #'(lambda (v1 v2) | |
| 2044 (< (gethash v1 variable-frequency) | |
| 2045 (gethash v2 variable-frequency))))) | |
| 2046 ;; Another hack - put the most used variable in position 6, for | |
| 2047 ;; better locality of reference with adjoining constants. | |
| 2048 (let ((tail (last byte-compile-variables 6))) | |
| 2049 (setq byte-compile-variables | |
| 2050 (append (nbutlast byte-compile-variables 6) | |
| 2051 (nreverse tail)))) | |
| 428 | 2052 (setq byte-compile-maxdepth (+ byte-compile-maxdepth add-depth))) |
| 2053 lap) | |
| 2054 | |
| 2055 (provide 'byte-optimize) | |
| 2056 | |
| 2057 | |
| 2058 ;; To avoid "lisp nesting exceeds max-lisp-eval-depth" when this file compiles | |
| 2059 ;; itself, compile some of its most used recursive functions (at load time). | |
| 2060 ;; | |
| 2061 (eval-when-compile | |
| 2062 (or (compiled-function-p (symbol-function 'byte-optimize-form)) | |
| 2063 (assq 'byte-code (symbol-function 'byte-optimize-form)) | |
| 2064 (let ((byte-optimize nil) | |
| 2065 (byte-compile-warnings nil)) | |
| 2066 (mapcar | |
| 2067 #'(lambda (x) | |
| 2068 (or noninteractive (message "compiling %s..." x)) | |
| 2069 (byte-compile x) | |
| 2070 (or noninteractive (message "compiling %s...done" x))) | |
| 2071 '(byte-optimize-form | |
| 2072 byte-optimize-body | |
| 2073 byte-optimize-predicate | |
| 2074 byte-optimize-binary-predicate | |
| 2075 ;; Inserted some more than necessary, to speed it up. | |
| 2076 byte-optimize-form-code-walker | |
| 2077 byte-optimize-lapcode)))) | |
| 2078 nil) | |
| 2079 | |
| 1297 | 2080 ;; END SYNC WITH 20.7. |
| 2081 | |
| 428 | 2082 ;;; byte-optimize.el ends here |