aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--lisp/emacs-lisp/comp.el13
1 files changed, 6 insertions, 7 deletions
diff --git a/lisp/emacs-lisp/comp.el b/lisp/emacs-lisp/comp.el
index ab5a06e7e86..82799a4d4ee 100644
--- a/lisp/emacs-lisp/comp.el
+++ b/lisp/emacs-lisp/comp.el
@@ -193,7 +193,7 @@ Note that when `no-byte-compile' is set to non-nil it overrides the value of
193`no-native-compile'. 193`no-native-compile'.
194This is normally set in local file variables at the end of the elisp file: 194This is normally set in local file variables at the end of the elisp file:
195 195
196\;; Local Variables:\n;; no-native-compile: t\n;; End: ") 196\;; Local Variables:\n;; no-native-compile: t\n;; End:")
197;;;###autoload(put 'no-native-compile 'safe-local-variable 'booleanp) 197;;;###autoload(put 'no-native-compile 'safe-local-variable 'booleanp)
198 198
199(defvar comp-log-time-report nil 199(defvar comp-log-time-report nil
@@ -561,7 +561,7 @@ Useful to hook into pass checkers.")
561 for cstr = (comp-type-spec-to-cstr type-spec) 561 for cstr = (comp-type-spec-to-cstr type-spec)
562 do (puthash f cstr h) 562 do (puthash f cstr h)
563 finally return h) 563 finally return h)
564 "Hash table function -> `comp-constraint'") 564 "Hash table function -> `comp-constraint'.")
565 565
566(defconst comp-known-predicates 566(defconst comp-known-predicates
567 '((arrayp . array) 567 '((arrayp . array)
@@ -598,7 +598,7 @@ Useful to hook into pass checkers.")
598 for cstr = (comp-type-spec-to-cstr type-spec) 598 for cstr = (comp-type-spec-to-cstr type-spec)
599 do (puthash pred cstr h) 599 do (puthash pred cstr h)
600 finally return h) 600 finally return h)
601 "Hash table function -> `comp-constraint'") 601 "Hash table function -> `comp-constraint'.")
602 602
603(defun comp-known-predicate-p (predicate) 603(defun comp-known-predicate-p (predicate)
604 "Return t if PREDICATE is known." 604 "Return t if PREDICATE is known."
@@ -692,7 +692,7 @@ Useful to hook into pass checkers.")
692 (- (comp-vec-end vec) (comp-vec-beg vec))) 692 (- (comp-vec-end vec) (comp-vec-beg vec)))
693 693
694(defsubst comp-vec--verify-idx (vec idx) 694(defsubst comp-vec--verify-idx (vec idx)
695 "Check whether idx is in bounds for VEC." 695 "Check whether IDX is in bounds for VEC."
696 (cl-assert (and (< idx (comp-vec-end vec)) 696 (cl-assert (and (< idx (comp-vec-end vec))
697 (>= idx (comp-vec-beg vec))))) 697 (>= idx (comp-vec-beg vec)))))
698 698
@@ -949,7 +949,7 @@ To be used by all entry points."
949 (when (memq function '(eq eql equal)) t)) 949 (when (memq function '(eq eql equal)) t))
950 950
951(defun comp-arithm-cmp-fun-p (function) 951(defun comp-arithm-cmp-fun-p (function)
952 "Predicate for arithmetic comparision functions." 952 "Predicate for arithmetic comparison functions."
953 (when (memq function '(= > < >= <=)) t)) 953 (when (memq function '(= > < >= <=)) t))
954 954
955(defun comp-set-op-p (op) 955(defun comp-set-op-p (op)
@@ -3269,7 +3269,6 @@ FUNCTION can be a function-name or byte compiled function."
3269 (gethash func (comp-ctxt-byte-func-to-func-h comp-ctxt)))) 3269 (gethash func (comp-ctxt-byte-func-to-func-h comp-ctxt))))
3270 3270
3271(defun comp-call-optim-form-call (callee args) 3271(defun comp-call-optim-form-call (callee args)
3272 ""
3273 (cl-flet ((fill-args (args total) 3272 (cl-flet ((fill-args (args total)
3274 ;; Fill missing args to reach TOTAL 3273 ;; Fill missing args to reach TOTAL
3275 (append args (cl-loop repeat (- total (length args)) 3274 (append args (cl-loop repeat (- total (length args))
@@ -3482,7 +3481,7 @@ These are substituted with a normal 'set' op."
3482;;; Final pass specific code. 3481;;; Final pass specific code.
3483 3482
3484(defun comp-args-to-lambda-list (args) 3483(defun comp-args-to-lambda-list (args)
3485 "Return a lambda list for args." 3484 "Return a lambda list for ARGS."
3486 (cl-loop 3485 (cl-loop
3487 with res 3486 with res
3488 repeat (comp-args-base-min args) 3487 repeat (comp-args-base-min args)