Newer
Older
;;; Tests from gitlab issues
(defpackage :issues-tests
(:use :cl :lisp-unit))
(in-package "ISSUES-TESTS")
(defun square (x)
(expt x 2))
(define-compiler-macro square (&whole form arg)
(declare (ignore arg))
form)
(define-test issue.1.a
(:tag :issues)
(assert-equal
'(square x)
(funcall (compiler-macro-function 'square) '(square x) nil)))
(define-test issue.1.b
(:tag :issues)
(assert-equal
'(square x)
(funcall (compiler-macro-function 'square) '(funcall #'square x) nil)))
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
(define-test issue.4
(:tag :issues)
;; Compile up two versions of elt. F-LIST should get transformed to
;; LISP::LISP-ELT*, and F-VEC should be converted to AREF. Both of
;; thse should signal errors.
(let ((f-list (compile nil '(lambda (list n)
(declare (type list list)
(optimize (speed 1) (safety 1) (compilation-speed 1)
(space 1) (debug 1)))
(elt list n))))
(f-vec (compile nil '(lambda (vec n)
(declare (type (simple-array * (*)) vec)
(optimize (speed 1) (safety 1) (compilation-speed 1)
(space 1) (debug 1)))
(elt vec n)))))
;; Errors because the index is beyond the end of the sequence
(assert-error 'lisp::index-too-large-error (funcall f-list (list 0 1 2) 3))
(assert-error 'type-error (funcall f-vec (make-array 3 :initial-contents '(0 1 2)) 3))
;; Errors because the index is negative.
(assert-error 'type-error (funcall f-list (list 0 1 2) -1))
(assert-error 'type-error (funcall f-vec (make-array 3 :initial-contents '(0 1 2)) -1))))
(define-test issue.4.setters
(:tag :issues)
;; Compile up two versions of (SETF ELT). F-LIST should get transformed to
;; %SETELT, and F-VEC should be converted to (SETF AREF). Both of
;; thse should signal errors.
(let ((s-list (compile nil '(lambda (list n new)
(declare (type list list))
(setf (elt list n) new))))
(s-vec (compile nil '(lambda (vec n new)
(declare (type (simple-array * (*)) vec))
(setf (elt vec n) new)))))
;; Errors because the index is beyond the end of the sequence
(assert-error 'type-error (funcall s-list (list 0 1 2) 3 99))
(assert-error 'type-error (funcall s-vec (make-array 3 :initial-contents '(0 1 2)) 3 99))
;; Errors because the index is negative.
(assert-error 'type-error (funcall s-list (list 0 1 2) -1 99))
(assert-error 'type-error (funcall s-vec (make-array 3 :initial-contents '(0 1 2)) -1 99))))
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
;; Functions for testing issue-3
(defun sqr (x)
(expt x 2))
(define-compiler-macro sqr (x)
`(expt ,x 2))
(eval-when (:compile-toplevel :load-toplevel :execute)
(defmacro with-square-check (&body body &environment env)
(let ((text (if (compiler-macro-function 'sqr env)
"Yes"
"No")))
`(progn
(format t "SQUARE compiler macro present: ~A.~%" ,text)
,@body))))
(defun test/absent ()
(with-square-check
(sqr 2)))
(defun test/present ()
(flet ((sqr (x)
(print (expt x 3))))
(with-square-check
(sqr 2))))
(define-test issue.3
(:tag :issues)
(assert-prints "SQUARE compiler macro present: Yes."
(test/absent))
(assert-prints "SQUARE compiler macro present: No.
8"
(test/present)))
(defmacro xpop (place &environment env)
(multiple-value-bind (dummies vals new setter getter)
(get-setf-expansion place env)
`(let* (,@(mapcar #'list dummies vals) (,(car new) ,getter))
(if ,(cdr new) (error "Can't expand this."))
(prog1 (car ,(car new))
(setq ,(car new) (cdr ,(car new)))
,setter))))
(defsetf frob (x) (value)
`(setf (car ,x) ,value))
(define-test issue.7
(:tag :issues)
(assert-error 'error
(let ((z (list 1 2)))
(flet ((frob (x) (cdr x)))
(xpop (frob z))))))
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
(define-test issue.10-unsigned-byte-4
(:tag :issues)
(macrolet
((compiled-test-function (constant-index)
;; Compile the test function from the issue.
(compile nil `(lambda (v x)
(declare (type (integer 0 5) v)
(optimize (safety 0)))
(setf (aref (the (simple-array (integer 0 5) (1)) x)
,constant-index)
(the (integer 0 5) v))
x)))
(make-tests ()
;; Create a set of tests for a set of fixed constant indices,
;; one test for each constant index from 0 to 15.
(let (tests)
(dotimes (k 16)
(push
`(assert-equal 1
(aref (funcall (compiled-test-function ,k)
1
(make-array 16 :element-type '(integer 0 5) :initial-element 0))
,k))
tests))
`(progn ,@(nreverse tests)))))
(make-tests)))
(define-test issue.10-unsigned-byte-2
(:tag :issues)
(macrolet
((compiled-test-function (constant-index)
;; Compile the test function from the issue.
(compile nil `(lambda (v x)
(declare (type (integer 0 2) v)
(optimize (safety 0)))
(setf (aref (the (simple-array (integer 0 2) (1)) x)
,constant-index)
(the (integer 0 2) v))
x)))
(make-tests ()
;; Create a set of tests for a set of fixed constant indices,
;; one test for each constant index from 0 to 31.
(let (tests)
(dotimes (k 32)
(push
`(assert-equal 1
(aref (funcall (compiled-test-function ,k)
1
(make-array 32 :element-type '(integer 0 2) :initial-element 0))
,k))
tests))
`(progn ,@(nreverse tests)))))
(make-tests)))
(define-test issue.10-unsigned-byte-1
(:tag :issues)
(macrolet
((compiled-test-function (constant-index)
;; Compile the test function from the issue.
(compile nil `(lambda (v x)
(declare (type (integer 0 1) v)
(optimize (safety 0)))
(setf (aref (the (simple-array (integer 0 1) (1)) x)
,constant-index)
(the (integer 0 1) v))
x)))
(make-tests ()
;; Create a set of tests for a set of fixed constant indices,
;; one test for each constant index from 0 to 31.
(let (tests)
(dotimes (k 64)
(push
`(assert-equal 1
(aref (funcall (compiled-test-function ,k)
1
(make-array 64 :element-type '(integer 0 1) :initial-element 0))
,k))
tests))
`(progn ,@(nreverse tests)))))
(make-tests)))