;;;; character support
;;; In our implementation there are really only BASE-CHARs.
+#+nil
(define-source-transform characterp (obj)
`(base-char-p ,obj))
\f
(give-up-ir1-transform)
`(etypecase string
((simple-array character (*)) (data-vector-ref string index))
+ #!+sb-unicode
+ ((simple-array base-char (*)) (data-vector-ref string index))
((simple-array nil (*)) (data-vector-ref string index))))))
(deftransform hairy-data-vector-ref ((array index) (array t) *)
`(etypecase string
((simple-array character (*))
(data-vector-set string index new-value))
+ #!+sb-unicode
+ ((simple-array base-char (*))
+ (data-vector-set string index new-value))
((simple-array nil (*))
(data-vector-set string index new-value))))))
(length bit-array-2)
(length result-bit-array))
(error "Argument and/or result bit arrays are not the same length:~
- ~% ~S~% ~S ~% ~S"
+ ~% ~S~% ~S ~% ~S"
bit-array-1
bit-array-2
result-bit-array))))
'((unless (= (length bit-array)
(length result-bit-array))
(error "Argument and result bit arrays are not the same length:~
- ~% ~S~% ~S"
+ ~% ~S~% ~S"
bit-array result-bit-array))))
(let ((length (length result-bit-array)))
(if (= length 0)
- ;; We avoid doing anything to 0-length bit-vectors, or
- ;; rather, the memory that follows them. Other
- ;; divisible-by-32 cases are handled by the (1- length),
- ;; below. CSR, 2002-04-24
+ ;; We avoid doing anything to 0-length bit-vectors, or rather,
+ ;; the memory that follows them. Other divisible-by
+ ;; n-word-bits cases are handled by the (1- length), below.
+ ;; CSR, 2002-04-24
result-bit-array
(do ((index sb!vm:vector-data-offset (1+ index))
(end-1 (+ sb!vm:vector-data-offset
- ;; bit-vectors of length 1-32 need precisely
- ;; one (SETF %RAW-BITS), done here in the
- ;; epilogue. - CSR, 2002-04-24
+ ;; bit-vectors of length 1 to n-word-bits need
+ ;; precisely one (SETF %RAW-BITS), done here in
+ ;; the epilogue. - CSR, 2002-04-24
(truncate (truly-the index (1- length))
sb!vm:n-word-bits))))
((= index end-1)
(:big-endian
'(- sb!vm:n-word-bits extra))))
(%raw-bits y i))))
- (declare (type (integer 0 31) extra)
+ (declare (type (mod #.sb!vm:n-word-bits)
+ extra)
(type sb!vm:word mask numx numy))
(= numx numy)))
(declare (type index i end-1))
(unless (= numx numy)
(return nil))))))))
-(deftransform count ((sequence item) (simple-bit-vector bit) *
+(deftransform count ((item sequence) (bit simple-bit-vector) *
:policy (>= speed space))
`(let ((length (length sequence)))
(if (zerop length)
(:big-endian
'(- sb!vm:n-word-bits extra))))
(%raw-bits sequence index))))
+ (declare (type (mod #.sb!vm:n-word-bits) extra))
(declare (type sb!vm:word mask bits))
;; could consider LOGNOT for the zero case instead of
;; doing the subtraction...
(let ((value (if (constant-lvar-p item)
(if (= (lvar-value item) 0)
0
- #.(1- (ash 1 32)))
- `(if (= item 0) 0 #.(1- (ash 1 32))))))
+ #.(1- (ash 1 sb!vm:n-word-bits)))
+ `(if (= item 0) 0 #.(1- (ash 1 sb!vm:n-word-bits))))))
`(let ((length (length sequence))
(value ,value))
(if (= length 0)
sequence
(do ((index sb!vm:vector-data-offset (1+ index))
(end-1 (+ sb!vm:vector-data-offset
- ;; bit-vectors of length 1-32 need precisely
- ;; one (SETF %RAW-BITS), done here in the
- ;; epilogue. - CSR, 2002-04-24
+ ;; bit-vectors of length 1 to n-word-bits need
+ ;; precisely one (SETF %RAW-BITS), done here
+ ;; in the epilogue. - CSR, 2002-04-24
(truncate (truly-the index (1- length))
sb!vm:n-word-bits))))
((= index end-1)
:policy (>= speed space))
(let ((value (if (constant-lvar-p item)
(let* ((char (lvar-value item))
- (code (sb!xc:char-code char)))
- (logior code (ash code 8) (ash code 16) (ash code 24)))
+ (code (sb!xc:char-code char))
+ (accum 0))
+ (dotimes (i sb!vm:n-word-bytes accum)
+ (setf accum (logior accum (ash code (* 8 i))))))
`(let ((code (sb!xc:char-code item)))
- (logior code (ash code 8) (ash code 16) (ash code 24))))))
+ (logior ,@(loop for i from 0 below sb!vm:n-word-bytes
+ collect `(ash code ,(* 8 i))))))))
`(let ((length (length sequence))
(value ,value))
(multiple-value-bind (times rem)
- (truncate length 4)
+ (truncate length sb!vm:n-word-bytes)
(do ((index sb!vm:vector-data-offset (1+ index))
(end (+ times sb!vm:vector-data-offset)))
((= index end)
- (let ((place (* times 4)))
+ (let ((place (* times sb!vm:n-word-bytes)))
(declare (fixnum place))
(dotimes (j rem sequence)
(declare (index j))
((def (name width)
`(progn
(defknown ,name (integer (integer 0)) (unsigned-byte ,width)
- (foldable flushable movable))
+ (foldable flushable movable))
(define-modular-fun-optimizer ash ((integer count) :width width)
(when (and (<= width ,width)
- (constant-lvar-p count) ;?
- (plusp (lvar-value count)))
+ (or (and (constant-lvar-p count)
+ (plusp (lvar-value count)))
+ (csubtypep (lvar-type count)
+ (specifier-type '(and unsigned-byte
+ fixnum)))))
(cut-to-width integer width)
',name))
(setf (gethash ',name *modular-versions*) `(ash ,',width)))))
- #!+#.(cl:if (cl:= 32 sb!vm:n-word-bits) '(and) '(or))
+ ;; This should really be dependent on SB!VM:N-WORD-BITS, but since we
+ ;; don't have a true Alpha64 port yet, we'll have to stick to
+ ;; SB!VM:N-MACHINE-WORD-BITS for the time being. --njf, 2004-08-14
+ #!+#.(cl:if (cl:= 32 sb!vm:n-machine-word-bits) '(and) '(or))
(def sb!vm::ash-left-mod32 32)
- #!+#.(cl:if (cl:= 64 sb!vm:n-word-bits) '(and) '(or))
+ #!+#.(cl:if (cl:= 64 sb!vm:n-machine-word-bits) '(and) '(or))
(def sb!vm::ash-left-mod64 64))
\f
;;; generate efficient code.
(define-source-transform word-logical-not (x)
- `(logand (lognot (the sb!vm:word ,x) #.(1- (ash 1 sb!vm:n-word-bits)))))
+ `(logand (lognot (the sb!vm:word ,x)) #.(1- (ash 1 sb!vm:n-word-bits))))
(deftransform word-logical-and ((x y))
'(logand x y))
projects / sbcl.git / blobdiff