apply recursive decomposition in DECOMPOSE-STRING

[sbcl.git] / src / compiler / hppa / array.lisp

diff --git a/src/compiler/hppa/array.lisp b/src/compiler/hppa/array.lisp
index 9afaf87..7fe73ba 100644 (file)
--- a/src/compiler/hppa/array.lisp
+++ b/src/compiler/hppa/array.lisp
@@ -22,7 +22,7 @@
   (:temporary (:scs (non-descriptor-reg)) header)
   (:results (result :scs (descriptor-reg)))
   (:generator 13
-    ; Note: Cant use addi, the immediate is too large
+    ;; Note: Cant use addi, the immediate is too large
     (inst li (+ (* (1+ array-dimensions-offset) n-word-bytes)
                 lowtag-mask) header)
     (inst add header rank bytes)
@@ -130,9 +130,9 @@
   (def-partial-data-vector-frobs simple-array-signed-byte-16 tagged-num
     :short t signed-reg)
 
-  (def-full-data-vector-frobs simple-array-unsigned-byte-29 positive-fixnum
+  (def-full-data-vector-frobs simple-array-unsigned-fixnum positive-fixnum
                               any-reg)
-  (def-full-data-vector-frobs simple-array-signed-byte-30 tagged-num
+  (def-full-data-vector-frobs simple-array-fixnum tagged-num
                               any-reg)
 
   (def-full-data-vector-frobs simple-array-signed-byte-32 signed-num
@@ -377,10 +377,6 @@
 \f
 ;;; These vops are useful for accessing the bits of a vector irrespective of
 ;;; what type of vector it is.
-(define-full-reffer raw-bits * 0 other-pointer-lowtag (unsigned-reg) unsigned-num
-  %raw-bits)
-(define-full-setter set-raw-bits * 0 other-pointer-lowtag (unsigned-reg)
-  unsigned-num %set-raw-bits)
 (define-full-reffer vector-raw-bits * vector-data-offset other-pointer-lowtag
   (unsigned-reg) unsigned-num %vector-raw-bits)
 (define-full-setter set-vector-raw-bits * vector-data-offset other-pointer-lowtag