;;; Return true if a constant LEAF is of a type which we can legally
;;; directly reference in code. Named constants with arbitrary pointer
;;; values cannot, since we must preserve EQLness.
+;;;
+;;; FIXME: why not? The values in a function's constant vector are
+;;; subject to being moved by the garbage collector. Having arbitrary
+;;; values in said vector doesn't seem like a problem.
(defun legal-immediate-constant-p (leaf)
(declare (type constant leaf))
(or (not (leaf-has-source-name-p leaf))
- (typecase (constant-value leaf)
- ((or number character) t)
- (symbol (symbol-package (constant-value leaf)))
- (t nil))))
+ ;; Specialized arrays are legal, too. KLUDGE: this would be
+ ;; *much* cleaner if SIMPLE-UNBOXED-ARRAY was defined on the host.
+ #.(loop for saetp across sb!vm:*specialized-array-element-type-properties*
+ unless (eq t (sb!vm:saetp-specifier saetp))
+ collect `((simple-array ,(sb!vm:saetp-specifier saetp) (*)) t) into cases
+ finally (return
+ `(typecase (constant-value leaf)
+ ((or number character) t)
+ (symbol (symbol-package (constant-value leaf)))
+ ,@cases
+ (t nil))))))
;;; If LVAR is used only by a REF to a leaf that can be delayed, then
;;; return the leaf, otherwise return NIL.
(setf (ir2-lvar-kind info) :delayed))
(t (let ((tn (make-normal-tn (ir2-lvar-primitive-type info))))
(setf (ir2-lvar-locs info) (list tn))
- #!+stack-grows-downward-not-upward
(when (lvar-dynamic-extent lvar)
(setf (ir2-lvar-stack-pointer info)
(make-stack-pointer-tn)))))))
(setf (lvar-info lvar) info)
(when (lvar-dynamic-extent lvar)
(aver (proper-list-of-length-p types 1))
- #!+stack-grows-downward-not-upward
(setf (ir2-lvar-stack-pointer info)
(make-stack-pointer-tn))))
(ltn-annotate-casts lvar)
(when (and (cast-type-check cast)
(not (node-lvar cast)))
;; FIXME
- (bug "IR2 type checking of unused values in not implemented.")
+ (bug "IR2 type checking of unused values is not implemented.")
)
(values))