Skip to content
Snippets Groups Projects
Commit d1247662 authored by ram's avatar ram
Browse files

Fixed some broken declarations and the file header comment.

parent c92e8e92
No related branches found
No related tags found
No related merge requests found
...@@ -9,9 +9,10 @@ ...@@ -9,9 +9,10 @@
;;; ;;;
;;; This file implements local call analysis. A local call is a function ;;; This file implements local call analysis. A local call is a function
;;; call between functions being compiled at the same time. If we can tell at ;;; call between functions being compiled at the same time. If we can tell at
;;; compile time that such a call is legal, then we modify the flow graph to ;;; compile time that such a call is legal, then we change the combination
;;; represent the control transfers previously implicit in the call. This ;;; to call the correct lambda, mark it as local, and add this link to our call
;;; change allows us to do inter-routine flow analysis. ;;; graph. Once a call is local, it is then eligible for let conversion, which
;;; places the body of the function inline.
;;; ;;;
;;; We cannot always do a local call even when we do have the function being ;;; We cannot always do a local call even when we do have the function being
;;; called. Local call can be explicitly disabled by a NOTINLINE declaration. ;;; called. Local call can be explicitly disabled by a NOTINLINE declaration.
...@@ -342,8 +343,8 @@ ...@@ -342,8 +343,8 @@
;;; we give a warning and mark the Ref as :Notinline to remove it from future ;;; we give a warning and mark the Ref as :Notinline to remove it from future
;;; consideration. If the argcount is O.K. then we just convert it. ;;; consideration. If the argcount is O.K. then we just convert it.
;;; ;;;
(proclaim '(function convert-lambda-call (ref combination lambda) void))
(defun convert-lambda-call (ref call fun) (defun convert-lambda-call (ref call fun)
(declare (type ref ref) (type combination call) (type clambda fun))
(let ((nargs (length (lambda-vars fun))) (let ((nargs (length (lambda-vars fun)))
(call-args (length (combination-args call)))) (call-args (length (combination-args call))))
(cond ((= call-args nargs) (cond ((= call-args nargs)
...@@ -407,9 +408,9 @@ ...@@ -407,9 +408,9 @@
;;; new function and the entry point immediately so that everything gets ;;; new function and the entry point immediately so that everything gets
;;; converted during the single pass. ;;; converted during the single pass.
;;; ;;;
(proclaim '(function convert-hairy-fun-entry
(ref combination lambda list list list)))
(defun convert-hairy-fun-entry (ref call entry vars ignores args) (defun convert-hairy-fun-entry (ref call entry vars ignores args)
(declare (list vars ignores args) (type ref ref) (type combination call)
(type clambda entry))
(let ((new-fun (let ((new-fun
(with-ir1-environment call (with-ir1-environment call
(ir1-convert-lambda (ir1-convert-lambda
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment