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