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