+(flet ((optimized ()
+ (declare (optimize (speed 2) (debug 1))) ; tail call elimination
+ (/ 42 0))
+ (not-optimized ()
+ (declare (optimize (speed 1) (debug 2))) ; no tail call elimination
+ (/ 42 0))
+ (test (fun)
+ (declare (optimize (speed 1) (debug 2))) ; no tail call elimination
+ (funcall fun)))
+ (with-test (:name (:divide-by-zero :bug-346)
+ :fails-on :alpha) ; bug 346
+ (assert (verify-backtrace (lambda () (test #'optimized))
+ (list '(/ 42 &rest)
+ (list `(flet test :in ,*p*) #'optimized)))))
+ (with-test (:name (:divide-by-zero :bug-356)
+ :fails-on :alpha) ; bug 356
+ (assert (verify-backtrace (lambda () (test #'not-optimized))
+ (list '(/ 42 &rest)
+ `((flet not-optimized :in ,*p*))
+ (list `(flet test :in ,*p*) #'not-optimized))))))
+
+(with-test (:name (:throw :no-such-tag)
+ :fails-on '(or
+ (and :sparc :linux)
+ :alpha
+ :mips))
+ (progn
+ (defun throw-test ()
+ (throw 'no-such-tag t))
+ (assert (verify-backtrace #'throw-test '((throw-test))))))
+
+(defun bug-308926 (x)
+ (let ((v "foo"))
+ (flet ((bar (z)
+ (oops v z)
+ (oops z v)))
+ (bar x)
+ (bar v))))
+
+(with-test (:name :bug-308926)
+ (assert (verify-backtrace (lambda () (bug-308926 13))
+ '(((flet bar :in bug-308926) 13)
+ (bug-308926 &rest t)))))
+
+;;; test entry point handling in backtraces
+
+(defun oops ()
+ (error "oops"))
+
+(defmacro defbt (n ll &body body)
+ `(progn
+ ;; normal debug info
+ (defun ,(intern (format nil "BT.~A.1" n)) ,ll
+ ,@body)
+ ;; no arguments saved
+ (defun ,(intern (format nil "BT.~A.2" n)) ,ll
+ (declare (optimize (debug 1) (speed 3)))
+ ,@body)
+ ;; no lambda-list saved
+ (defun ,(intern (format nil "BT.~A.3" n)) ,ll
+ (declare (optimize (debug 0)))
+ ,@body)))
+
+(defbt 1 (&key key)
+ (list key))
+
+(defbt 2 (x)
+ (list x))
+
+(defbt 3 (&key (key (oops)))
+ (list key))
+
+;;; ERROR instead of OOPS so that tail call elimination doesn't happen
+(defbt 4 (&optional opt)
+ (list (error "error")))
+
+(defbt 5 (&optional (opt (oops)))
+ (list opt))
+
+(defmacro with-details (bool &body body)
+ `(let ((sb-debug:*show-entry-point-details* ,bool))
+ ,@body))
+
+(defun bug-354 (x)
+ (error "XEPs in backtraces: ~S" x))
+
+(with-test (:name :bug-354)
+ (with-details t
+ (assert (not (verify-backtrace (lambda () (bug-354 354))
+ '((bug-354 &rest)
+ ((sb-c::tl-xep bug-354) &rest))))))
+ (assert (verify-backtrace (lambda () (bug-354 354)) '((bug-354 354)))))
+
+;;; FIXME: This test really should be broken into smaller pieces
+(with-test (:name (:backtrace :tl-xep))
+ (with-details t
+ (assert (verify-backtrace #'namestring
+ '(((sb-c::tl-xep namestring) 0 ?)))))
+ (with-details nil
+ (assert (verify-backtrace #'namestring
+ '((namestring))))))
+
+(with-test (:name (:backtrace :more-processor))
+ (with-details t
+ (assert (verify-backtrace (lambda () (bt.1.1 :key))
+ '(((sb-c::&more-processor bt.1.1) &rest))))
+ (assert (verify-backtrace (lambda () (bt.1.2 :key))
+ '(((sb-c::&more-processor bt.1.2) &rest))))
+ (assert (verify-backtrace (lambda () (bt.1.3 :key))
+ '(((sb-c::&more-processor bt.1.3) &rest)))))
+ (with-details nil
+ (assert (verify-backtrace (lambda () (bt.1.1 :key))
+ '((bt.1.1 :key))))
+ (assert (verify-backtrace (lambda () (bt.1.2 :key))
+ '((bt.1.2 &rest))))
+ (assert (verify-backtrace (lambda () (bt.1.3 :key))
+ '((bt.1.3 &rest))))))
+
+(with-test (:name (:backtrace :xep))
+ (with-details t
+ (assert (verify-backtrace #'bt.2.1
+ '(((sb-c::xep bt.2.1) 0 ?))))
+ (assert (verify-backtrace #'bt.2.2
+ '(((sb-c::xep bt.2.2) &rest))))
+ (assert (verify-backtrace #'bt.2.3
+ '(((sb-c::xep bt.2.3) &rest)))))
+ (with-details nil
+ (assert (verify-backtrace #'bt.2.1
+ '((bt.2.1))))
+ (assert (verify-backtrace #'bt.2.2
+ '((bt.2.2 &rest))))
+ (assert (verify-backtrace #'bt.2.3
+ '((bt.2.3 &rest))))))
+
+(with-test (:name (:backtrace :varargs-entry))
+ (with-details t
+ (assert (verify-backtrace #'bt.3.1
+ '(((sb-c::varargs-entry bt.3.1) :key nil))))
+ (assert (verify-backtrace #'bt.3.2
+ '(((sb-c::varargs-entry bt.3.2) :key ?))))
+ (assert (verify-backtrace #'bt.3.3
+ '(((sb-c::varargs-entry bt.3.3) &rest)))))
+ (with-details nil
+ (assert (verify-backtrace #'bt.3.1
+ '((bt.3.1 :key nil))))
+ (assert (verify-backtrace #'bt.3.2
+ '((bt.3.2 :key ?))))
+ (assert (verify-backtrace #'bt.3.3
+ '((bt.3.3 &rest))))))
+
+(with-test (:name (:backtrace :hairy-args-processor))
+ (with-details t
+ (assert (verify-backtrace #'bt.4.1
+ '(((sb-c::hairy-arg-processor bt.4.1) ?))))
+ (assert (verify-backtrace #'bt.4.2
+ '(((sb-c::hairy-arg-processor bt.4.2) ?))))
+ (assert (verify-backtrace #'bt.4.3
+ '(((sb-c::hairy-arg-processor bt.4.3) &rest)))))
+ (with-details nil
+ (assert (verify-backtrace #'bt.4.1
+ '((bt.4.1 ?))))
+ (assert (verify-backtrace #'bt.4.2
+ '((bt.4.2 ?))))
+ (assert (verify-backtrace #'bt.4.3
+ '((bt.4.3 &rest))))))
+
+
+(with-test (:name (:backtrace :optional-processor))
+ (with-details t
+ (assert (verify-backtrace #'bt.5.1
+ '(((sb-c::&optional-processor bt.5.1)))))
+ (assert (verify-backtrace #'bt.5.2
+ '(((sb-c::&optional-processor bt.5.2) &rest))))
+ (assert (verify-backtrace #'bt.5.3
+ '(((sb-c::&optional-processor bt.5.3) &rest)))))
+ (with-details nil
+ (assert (verify-backtrace #'bt.5.1
+ '((bt.5.1))))
+ (assert (verify-backtrace #'bt.5.2
+ '((bt.5.2 &rest))))
+ (assert (verify-backtrace #'bt.5.3
+ '((bt.5.3 &rest))))))
+
+(write-line "//compile nil")
+(defvar *compile-nil-error* (compile nil '(lambda (x) (cons (when x (error "oops")) nil))))
+(defvar *compile-nil-non-tc* (compile nil '(lambda (y) (cons (funcall *compile-nil-error* y) nil))))
+(with-test (:name (:compile nil))
+ (assert (verify-backtrace (lambda () (funcall *compile-nil-non-tc* 13))
+ `(((lambda (x) :in ,*p*) 13)
+ ((lambda (y) :in ,*p*) 13)))))
+
+(with-test (:name :clos-slot-typecheckfun-named)
+ (assert
+ (verify-backtrace
+ (lambda ()
+ (eval `(locally (declare (optimize safety))
+ (defclass clos-typecheck-test ()
+ ((slot :type fixnum)))
+ (setf (slot-value (make-instance 'clos-typecheck-test) 'slot) t))))
+ '(((sb-pcl::slot-typecheck fixnum) t)))))
+
+(with-test (:name :clos-emf-named)
+ (assert
+ (verify-backtrace
+ (lambda ()
+ (eval `(progn
+ (defmethod clos-emf-named-test ((x symbol)) x)
+ (defmethod clos-emf-named-test :before (x) (assert x))
+ (clos-emf-named-test nil))))
+ '(((sb-pcl::emf clos-emf-named-test) ? ? nil)))))
+
+(with-test (:name :bug-310173)
+ (flet ((make-fun (n)
+ (let* ((names '(a b))
+ (req (loop repeat n collect (pop names))))
+ (compile nil
+ `(lambda (,@req &rest rest)
+ (let ((* *)) ; no tail-call
+ (apply '/ ,@req rest)))))))
+ (assert
+ (verify-backtrace (lambda ()
+ (funcall (make-fun 0) 10 11 0))
+ `((sb-kernel:two-arg-/ 10/11 0)
+ (/ 10 11 0)
+ ((lambda (&rest rest) :in ,*p*) 10 11 0))))
+ (assert
+ (verify-backtrace (lambda ()
+ (funcall (make-fun 1) 10 11 0))
+ `((sb-kernel:two-arg-/ 10/11 0)
+ (/ 10 11 0)
+ ((lambda (a &rest rest) :in ,*p*) 10 11 0))))
+ (assert
+ (verify-backtrace (lambda ()
+ (funcall (make-fun 2) 10 11 0))
+ `((sb-kernel:two-arg-/ 10/11 0)
+ (/ 10 11 0)
+ ((lambda (a b &rest rest) :in ,*p*) 10 11 0))))))
+
+;;;; test TRACE
+
+(defun trace-this ()
+ 'ok)
+
+(defun trace-fact (n)
+ (if (zerop n)
+ 1
+ (* n (trace-fact (1- n)))))
+
+(with-test (:name (trace :simple))
+ (let ((out (with-output-to-string (*trace-output*)
+ (trace trace-this)
+ (assert (eq 'ok (trace-this)))
+ (untrace))))
+ (assert (search "TRACE-THIS" out))
+ (assert (search "returned OK" out))))
+
+;;; bug 379
+;;; This is not a WITH-TEST :FAILS-ON PPC DARWIN since there are
+;;; suspicions that the breakpoint trace might corrupt the whole image
+;;; on that platform.
+(with-test (:name (trace :encapsulate nil)
+ :fails-on '(or (and :ppc (not :linux)) :sparc :mips)
+ :broken-on '(or :darwin :sunos))
+ (let ((out (with-output-to-string (*trace-output*)
+ (trace trace-this :encapsulate nil)
+ (assert (eq 'ok (trace-this)))
+ (untrace))))
+ (assert (search "TRACE-THIS" out))
+ (assert (search "returned OK" out))))
+
+(with-test (:name (trace-recursive :encapsulate nil)
+ :fails-on '(or (and :ppc (not :linux)) :sparc :mips :sunos)
+ :broken-on '(or :darwin (and :x86 :sunos)))
+ (let ((out (with-output-to-string (*trace-output*)
+ (trace trace-fact :encapsulate nil)
+ (assert (= 120 (trace-fact 5)))
+ (untrace))))
+ (assert (search "TRACE-FACT" out))
+ (assert (search "returned 1" out))
+ (assert (search "returned 120" out))))
+
+(defun trace-and-fmakunbound-this (x)
+ x)
+
+(with-test (:name :bug-667657)
+ (trace trace-and-fmakunbound-this)
+ (fmakunbound 'trace-and-fmakunbound-this)
+ (untrace)
+ (assert (not (trace))))
+
+(with-test (:name :bug-414)
+ (handler-bind ((warning #'error))
+ (load (compile-file "bug-414.lisp"))
+ (disassemble 'bug-414)))
+
+(with-test (:name :bug-310175 :fails-on '(not :stack-allocatable-lists))
+ ;; KLUDGE: Not all DX-enabled platforms DX CONS, and the compiler
+ ;; transforms two-arg-LIST* (and one-arg-LIST) to CONS. Therefore,
+ ;; use two-arg-LIST, which should get through to VOP LIST, and thus
+ ;; stack-allocate on a predictable set of machines.
+ (let ((dx-arg (list t t)))
+ (declare (dynamic-extent dx-arg))
+ (flet ((dx-arg-backtrace (x)
+ (declare (optimize (debug 2)))
+ (prog1 (sb-debug:backtrace-as-list 10)
+ (assert (sb-debug::stack-allocated-p x)))))
+ (declare (notinline dx-arg-backtrace))
+ (assert (member-if (lambda (frame)
+ (and (consp frame)
+ (consp (car frame))
+ (equal '(flet dx-arg-backtrace :in) (butlast (car frame)))
+ (notany #'sb-debug::stack-allocated-p (cdr frame))))
+ (dx-arg-backtrace dx-arg))))))
+
+(with-test (:name :bug-795245)
+ (assert
+ (eq :ok
+ (catch 'done
+ (handler-bind
+ ((error (lambda (e)
+ (declare (ignore e))
+ (handler-case
+ (sb-debug:backtrace 100 (make-broadcast-stream))
+ (error ()
+ (throw 'done :error))
+ (:no-error ()
+ (throw 'done :ok))))))
+ (apply '/= nil 1 2 nil))))))
+
+;;;; test infinite error protection
+
+(defmacro nest-errors (n-levels error-form)
+ (if (< 0 n-levels)
+ `(handler-bind ((error (lambda (condition)
+ (declare (ignore condition))
+ ,error-form)))
+ (nest-errors ,(1- n-levels) ,error-form))
+ error-form))
+
+(defun erroring-debugger-hook (condition old-debugger-hook)
+ (let ((*debugger-hook* old-debugger-hook))
+ (format t "recursive condition: ~A~%" condition) (force-output)
+ (error "recursive condition: ~A" condition)))
+
+(defun test-inifinite-error-protection ()
+ ;; after 50 successful throws to SB-IMPL::TOPLEVEL-CATCHER sbcl used
+ ;; to halt, it produces so much garbage that's hard to suppress that
+ ;; it is tested only once
+ (write-line "--HARMLESS BUT ALARMING BACKTRACE COMING UP--")
+ (let ((*debugger-hook* #'erroring-debugger-hook))
+ (loop repeat 1 do
+ (let ((error-counter 0)
+ (*terminal-io* (make-broadcast-stream)))
+ (assert
+ (not (eq
+ :normal-exit
+ (catch 'sb-impl::toplevel-catcher
+ (nest-errors 20 (error "infinite error ~s"
+ (incf error-counter)))
+ :normal-exit)))))))
+ (write-line "--END OF H-B-A-B--"))
+
+(with-test (:name infinite-error-protection)
+ (enable-debugger)
+ (test-inifinite-error-protection))
+
+(with-test (:name (infinite-error-protection :thread)
+ :skipped-on '(not :sb-thread))
+ (enable-debugger)
+ (let ((thread (sb-thread:make-thread #'test-inifinite-error-protection)))
+ (loop while (sb-thread:thread-alive-p thread))))
+
+;; unconditional, in case either previous left it enabled
+(disable-debugger)
+\f
+;;;; test some limitations of MAKE-LISP-OBJ
+
+;;; Older GENCGC systems had a bug in the pointer validation used by
+;;; MAKE-LISP-OBJ that made SIMPLE-FUN objects always fail to
+;;; validate.
+(with-test (:name (make-lisp-obj :simple-funs))
+ (sb-sys:without-gcing
+ (assert (eq #'identity
+ (sb-kernel:make-lisp-obj
+ (sb-kernel:get-lisp-obj-address
+ #'identity))))))
+
+;;; Older CHENEYGC systems didn't perform any real pointer validity
+;;; checks beyond "is this pointer to somewhere in heap space".
+(with-test (:name (make-lisp-obj :pointer-validation))
+ ;; Fun and games: We need to test MAKE-LISP-OBJ with a known-bogus
+ ;; address, but we also need the GC to not pitch a fit if it sees an
+ ;; object with said bogus address. Thus, construct our known-bogus
+ ;; object within an area of unboxed storage (a vector) in static
+ ;; space. We'll make it a simple object, (CONS 0 0), which has an
+ ;; in-memory representation of two consecutive zero words. We
+ ;; allocate a three-word vector so that we can guarantee a
+ ;; double-word aligned double-word of zeros no matter what happens
+ ;; with the vector-data-offset (currently double-word aligned).
+ (let* ((memory (sb-int:make-static-vector 3 :element-type `(unsigned-byte ,sb-vm:n-word-bits)
+ :initial-element 0))
+ (vector-data-address (sb-sys:sap-int (sb-kernel::vector-sap memory)))
+ (object-base-address (logandc2 (+ vector-data-address sb-vm:lowtag-mask) sb-vm:lowtag-mask))
+ (object-tagged-address (+ object-base-address sb-vm:list-pointer-lowtag)))
+ (multiple-value-bind
+ (object valid-p)
+ (sb-kernel:make-lisp-obj object-tagged-address nil)
+ (assert (not valid-p)))))
+
+(write-line "/debug.impure.lisp done")