2 ;;; Copyright (c) 2005--2007, by A.J. Rossini <blindglobe@gmail.com>
3 ;;; See COPYRIGHT file for any additional restrictions (BSD license).
4 ;;; Since 1991, ANSI was finally finished. Edited for ANSI Common Lisp.
6 ;;;; ladata -- Data handling functions for linear algebra interface
8 ;;;; Copyright (c) 1991, by Luke Tierney. Permission is granted for
15 ;;(in-package #:lisp-stat-basics)
16 ;;(in-package :cl-user)
18 (defpackage :lisp-stat-linalg-data
24 :lisp-stat-compound-data
26 ;; probably some other functions as well, but not sure which.
28 (:export
;; lots of stuff... sigh.
29 +mode-in
+ +mode-re
+ +mode-cx
+ mode-of
31 la-data-mode la-allocate la-free
))
33 (in-package :lisp-stat-linalg-data
)
38 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
40 ;;; Data Mode Functions
42 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
45 ;;;; These constants need to be redefined if IN, RE or CX in linalg.h
49 ;;; FIXME:AJR: This is how Luke got around having appropriate
50 ;;; approaches for Linear Algebra. We want to cheat and instead use
51 ;;; CLEM or MATLISP as the underlying linear algebra package.
53 (defparameter +mode-in
+ 0)
54 (defparameter +mode-re
+ 1)
55 (defparameter +mode-cx
+ 2)
64 (defun la-data-mode (data)
65 (let ((data (compound-data-seq data
))
69 (let ((n (length data
)))
73 (setf mode
(max mode
(mode-of (aref data i
)))))))
74 ((consp data
) (dolist (x data mode
) (setf mode
(max mode
(mode-of x
)))))
75 (t (error "bad sequence - ~s" data
)))))
78 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
80 ;;;; Internal Allocation Funcitons
82 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
84 (defvar *la-allocations
* nil
)
87 ;;; CFFI glue for... Storage Allocation Functions
90 (defun null-ptr-p (p) (cffi:null-pointer-p p
))
91 (defun ptr-eq (p q
) (cffi:pointer-eq p q
))
93 (cffi:defcfun
("la_base_allocate" ccl-la-base-allocate
)
94 :pointer
(n :int
) (m :int
))
95 (defun la-base-allocate (n m
)
96 (ccl-la-base-allocate n m
))
98 (cffi:defcfun
("la_base_free_alloc" ccl-la-base-free-alloc
)
100 (defun la-base-free (p)
101 (ccl-la-base-free-alloc p
))
103 (cffi:defcfun
("la_mode_size" ccl-la-mode-size
)
106 (defun la-mode-size (mode)
107 (ccl-la-mode-size mode
))
110 ;;; Callbacks for Internal Storage
113 (cffi:defcallback lisp-la-allocate
:void
((n :long
) (m :long
))
114 (ccl-store-ptr (la-allocate n m
)))
115 (cffi:defcfun
("register_la_allocate" register-la-allocate
)
117 (register-la-allocate (cffi:callback lisp-la-allocate
))
118 (cffi:defcfun
("la_allocate" la
)
119 :pointer
(x :int
) (y :int
))
121 (cffi:defcallback lisp-la-free-alloc
125 (cffi:defcfun
("register_la_free_alloc" register-la-free-alloc
)
127 (register-la-free-alloc (cffi:callback lisp-la-free-alloc
))
128 (cffi:defcfun
("la_free_alloc" lf
)
133 ;;; CFFI glue for... Storage Access Functions
136 (cffi:defcfun
("la_get_integer" ccl-la-get-integer
)
137 :int
(p :pointer
) (i :int
))
138 (defun la-get-integer (p i
)
139 (ccl-la-get-integer p i
))
141 (cffi:defcfun
("la_get_double" ccl-la-get-double
)
142 :double
(p :pointer
) (i :int
))
143 (defun la-get-double (p i
)
144 (ccl-la-get-double p i
))
146 (cffi:defcfun
("la_get_complex_real" ccl-la-get-complex-real
)
147 :double
(p :pointer
) (i :int
))
148 (defun la-get-complex-real (p i
)
149 (ccl-la-get-complex-real p i
))
151 (cffi:defcfun
("la_get_complex_imag" ccl-la-get-complex-imag
)
152 :double
(p :pointer
) (i :int
))
153 (defun la-get-complex-imag (p i
)
154 (ccl-la-get-complex-imag p i
))
156 (defun la-get-complex (p i
)
157 (complex (la-get-complex-real p i
) (la-get-complex-imag p i
)))
159 (cffi:defcfun
("la_get_pointer" ccl-la-get-pointer
)
160 :pointer
(p :pointer
) (i :int
))
161 (defun la-get-pointer (p i
)
162 (ccl-la-get-pointer p i
))
165 ;;; CFFI glue for Storage Mutation Functions
167 (cffi:defcfun
("la_put_integer" ccl-la-put-integer
)
168 :void
(p :pointer
) (i :int
) (x :int
))
169 (defun la-put-integer (p i x
)
170 (ccl-la-put-integer p i x
))
172 (cffi:defcfun
("la_put_double" ccl-la-put-double
)
173 :void
(p :pointer
) (i :int
) (x :double
))
174 (defun la-put-double (p i x
)
175 (ccl-la-put-double p i
(float x
1d0
)))
177 (cffi:defcfun
("la_put_complex" ccl-la-put-complex
)
178 :void
(p :pointer
) (i :int
) (x :double
) (y :double
))
179 (defun la-put-complex (p i x y
)
180 (ccl-la-put-complex p i
(float x
1d0
) (float y
1d0
)))
182 (cffi:defcfun
("la_put_pointer" ccl-la-put-pointer
)
183 :void
(p :pointer
) (i :int
) (q :pointer
))
184 (defun la-put-pointer (p i q
)
185 (ccl-la-put-pointer p i q
))
188 ;; User interface (exported)
190 (defun la-allocate (n m
)
191 (let ((p (la-base-allocate n m
)))
192 (if (null-ptr-p p
) (error "allocation failed"))
193 (if (member p
*la-allocations
* :test
#'ptr-eq
)
194 (error "pointer is already on the list"))
195 (push p
*la-allocations
*)
199 (when (and (not (null-ptr-p p
)) (member p
*la-allocations
* :test
#'ptr-eq
))
200 (setf *la-allocations
* (delete p
*la-allocations
* :test
#'ptr-eq
))
203 (defun la-cleanup-allocations ()
204 (let ((allocs (copy-list *la-allocations
*)))
205 (dolist (p allocs
) (la-free p
))))
207 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
209 ;;;; C Vector and Array Allocation
211 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
213 (defun la-vector(n mode
) (la-allocate n
(la-mode-size mode
)))
214 (defun la-free-vector (v) (la-free v
))
216 (defun la-matrix (n m mode
)
217 (let ((matrix (la-allocate n
(la-mode-size +mode-in
+))))
219 (la-put-pointer matrix i
(la-allocate m
(la-mode-size mode
))))
222 (defun la-free-matrix (matrix n
)
224 (la-free (la-get-pointer matrix i
)))
228 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
230 ;;;; C to/from Lisp Data Conversion
232 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
234 (defun la-data-to-vector (data mode
)
235 (check-sequence data
)
236 (let* ((n (length data
))
237 (vec (la-vector n mode
))
238 (d (make-next-element data
)))
244 (la-put-integer vec i
(get-next-element d i
))))
248 (la-put-double vec i
(get-next-element d i
))))
252 (let ((x (get-next-element d i
)))
253 (la-put-complex vec i
(realpart x
) (imagpart x
))))))
256 (defun la-data-to-matrix (data mode
)
258 (let* ((n (num-rows data
))
260 (mat (la-matrix n m mode
)))
261 (declare (fixnum n m
))
266 (let ((vec (la-get-pointer mat i
)))
268 (la-put-integer vec j
(aref data i j
))))))
272 (let ((vec (la-get-pointer mat i
)))
274 (la-put-double vec j
(aref data i j
))))))
278 (let ((vec (la-get-pointer mat i
)))
280 (let ((x (aref data i j
)))
281 (la-put-complex vec i
(realpart x
) (imagpart x
))))))))
284 (defun la-vector-to-data (vec n mode data
)
286 (check-sequence data
)
287 (let ((d (make-next-element data
))
289 ((= mode
+mode-in
+) #'la-get-integer
)
290 ((= mode
+mode-re
+) #'la-get-double
)
291 ((= mode
+mode-cx
+) #'la-get-complex
))))
294 (set-next-element d i
(funcall gf vec i
))))
297 (defun la-matrix-to-data (mat n m mode result
)
298 (declare (fixnum n m
))
299 (check-matrix result
)
301 ((= mode
+mode-in
+) #'la-get-integer
)
302 ((= mode
+mode-re
+) #'la-get-double
)
303 ((= mode
+mode-cx
+) #'la-get-complex
))))
306 (let ((vec (la-get-pointer mat i
)))
309 (setf (aref result i j
) (funcall gf vec j
))))))