X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=src%2Fcompiler%2Flocall.lisp;h=4fe1a0e3c9508d631ee70dda9bb3f7bc17221baa;hb=6d69dfcc438b3530fa922e518919158ccf1af497;hp=ee3b1e34d215757d463c25622a55d1ce3c3412b8;hpb=1840d888d2ef13fe0ea5aaa06f1fef3300da682b;p=sbcl.git diff --git a/src/compiler/locall.lisp b/src/compiler/locall.lisp index ee3b1e3..4fe1a0e 100644 --- a/src/compiler/locall.lisp +++ b/src/compiler/locall.lisp @@ -43,21 +43,30 @@ (setf (car args) nil))) (values)) + +(defun handle-nested-dynamic-extent-lvars (arg) + (let ((use (lvar-uses arg))) + ;; Stack analysis wants DX value generators to end their + ;; blocks. Uses of mupltiple used LVARs already end their blocks, + ;; so we just need to process used-once LVARs. + (when (node-p use) + (node-ends-block use)) + ;; If the function result is DX, so are its arguments... This + ;; assumes that all our DX functions do not store their arguments + ;; anywhere -- just use, and maybe return. + (if (basic-combination-p use) + (cons arg (funcall (lambda (lists) + (reduce #'append lists)) + (mapcar #'handle-nested-dynamic-extent-lvars (basic-combination-args use)))) + (list arg)))) + (defun recognize-dynamic-extent-lvars (call fun) (declare (type combination call) (type clambda fun)) (loop for arg in (basic-combination-args call) and var in (lambda-vars fun) - when (and arg - (lambda-var-dynamic-extent var) + when (and arg (lambda-var-dynamic-extent var) (not (lvar-dynamic-extent arg))) - collect arg into dx-lvars - and do (let ((use (lvar-uses arg))) - ;; Stack analysis wants DX value generators to end - ;; their blocks. Uses of mupltiple used LVARs already - ;; end their blocks, so we just need to process - ;; used-once LVARs. - (when (node-p use) - (node-ends-block use))) + append (handle-nested-dynamic-extent-lvars arg) into dx-lvars finally (when dx-lvars (binding* ((before-ctran (node-prev call)) (nil (ensure-block-start before-ctran)) @@ -191,7 +200,7 @@ (optional-dispatch-entry-point-fun fun 0) (loop for ep in (optional-dispatch-entry-points fun) and n from min - do (entries `((= ,n-supplied ,n) + do (entries `((eql ,n-supplied ,n) (%funcall ,(force ep) ,@(subseq temps 0 n))))) `(lambda (,n-supplied ,@temps) ;; FIXME: Make sure that INDEX type distinguishes between @@ -201,7 +210,9 @@ (cond ,@(if more (butlast (entries)) (entries)) ,@(when more - `((,(if (zerop min) t `(>= ,n-supplied ,max)) + ;; KLUDGE: (NOT (< ...)) instead of >= avoids one round of + ;; deftransforms and lambda-conversion. + `((,(if (zerop min) t `(not (< ,n-supplied ,max))) ,(let ((n-context (gensym)) (n-count (gensym))) `(multiple-value-bind (,n-context ,n-count) @@ -355,8 +366,7 @@ (loop (let ((did-something nil)) (dolist (clambda clambdas) - (let* ((component (lambda-component clambda)) - (*all-components* (list component))) + (let ((component (lambda-component clambda))) ;; The original CMU CL code seemed to implicitly assume that ;; COMPONENT is the only one here. Let's make that explicit. (aver (= 1 (length (functional-components clambda))))