(and (symbolp obj1) (macroexp-const-p obj2) (cons obj1 obj2))
(and (symbolp obj2) (macroexp-const-p obj1) (cons obj2 obj1))))
+(defconst byte-compile--default-val (cons nil nil) "A unique object.")
+
(defun byte-compile-cond-jump-table-info (clauses)
"If CLAUSES is a `cond' form where:
The condition for each clause is of the form (TEST VAR VALUE).
(not (assq obj2 cases)))
(push (list (if (consp obj2) (eval obj2) obj2) body) cases)
(if (and (macroexp-const-p condition) condition)
- (progn (push (list 'default (or body `(,condition))) cases)
+ (progn (push (list byte-compile--default-val
+ (or body `(,condition)))
+ cases)
(throw 'break t))
(setq ok nil)
(throw 'break nil))))))
(when (and cases (not (= (length cases) 1)))
;; TODO: Once :linear-search is implemented for `make-hash-table'
;; set it to `t' for cond forms with a small number of cases.
- (setq jump-table (make-hash-table :test test
- :purecopy t
- :size (if (assq 'default cases)
- (1- (length cases))
- (length cases)))
+ (setq jump-table (make-hash-table
+ :test test
+ :purecopy t
+ :size (if (assq byte-compile--default-val cases)
+ (1- (length cases))
+ (length cases)))
default-tag (byte-compile-make-tag)
donetag (byte-compile-make-tag))
;; The structure of byte-switch code:
(let ((byte-compile-depth byte-compile-depth))
(byte-compile-goto 'byte-goto default-tag))
- (when (assq 'default cases)
- (setq default-case (cadr (assq 'default cases))
- cases (butlast cases 1)))
+ (let ((default-match (assq byte-compile--default-val cases)))
+ (when default-match
+ (setq default-case (cadr default-match)
+ cases (butlast cases))))
(dolist (case cases)
(setq tag (byte-compile-make-tag)
(t)))
(let ((a))
(cond ((eq a 'foo) 'incorrect)
- ('correct))))
+ ('correct)))
+ ;; Bug#31734
+ (let ((variable 0))
+ (cond
+ ((eq variable 'default)
+ (message "equal"))
+ (t
+ (message "not equal")))))
"List of expression for test.
Each element will be executed by interpreter and with
bytecompiled code, and their results compared.")