summaryrefslogtreecommitdiff
path: root/module/language/cps/elide-values.scm
blob: 81ccfc200f61d234b91f7287856c97b85f4f1cc6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
;;; Continuation-passing style (CPS) intermediate language (IL)

;; Copyright (C) 2013, 2014, 2015 Free Software Foundation, Inc.

;;;; This library is free software; you can redistribute it and/or
;;;; modify it under the terms of the GNU Lesser General Public
;;;; License as published by the Free Software Foundation; either
;;;; version 3 of the License, or (at your option) any later version.
;;;;
;;;; This library is distributed in the hope that it will be useful,
;;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
;;;; Lesser General Public License for more details.
;;;;
;;;; You should have received a copy of the GNU Lesser General Public
;;;; License along with this library; if not, write to the Free Software
;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

;;; Commentary:
;;;
;;; Primcalls that don't correspond to VM instructions are treated as if
;;; they are calls, and indeed the later reify-primitives pass turns
;;; them into calls.  Because no return arity checking is done for these
;;; primitives, if a later optimization pass simplifies the primcall to
;;; a VM operation, the tail of the simplification has to be a
;;; primcall to 'values.  Most of these primcalls can be elided, and
;;; that is the job of this pass.
;;;
;;; Code:

(define-module (language cps elide-values)
  #:use-module (ice-9 match)
  #:use-module (language cps)
  #:use-module (language cps utils)
  #:use-module (language cps with-cps)
  #:use-module (language cps intmap)
  #:export (elide-values))

(define (inline-values cps k src args)
  (match (intmap-ref cps k)
    (($ $ktail)
     (with-cps cps
       (build-term
         ($continue k src ($values args)))))
    (($ $kreceive ($ $arity req () rest () #f) kargs)
     (cond
      ((and (not rest) (= (length args) (length req)))
       (with-cps cps
         (build-term
           ($continue kargs src ($values args)))))
      ((and rest (>= (length args) (length req)))
       (let ()
         (define (build-rest cps k tail)
           (match tail
             (()
              (with-cps cps
                (build-term ($continue k src ($const '())))))
             ((v . tail)
              (with-cps cps
                (letv rest)
                (letk krest ($kargs ('rest) (rest)
                              ($continue k src ($primcall 'cons (v rest)))))
                ($ (build-rest krest tail))))))
         (with-cps cps
           (letv rest)
           (letk krest ($kargs ('rest) (rest)
                         ($continue kargs src
                           ($values ,(append (list-head args (length req))
                                             (list rest))))))
           ($ (build-rest krest (list-tail args (length req)))))))
      (else (with-cps cps #f))))))

(define (elide-values conts)
  (with-fresh-name-state conts
    (persistent-intmap
     (intmap-fold
      (lambda (label cont out)
        (match cont
          (($ $kargs names vars ($ $continue k src ($ $primcall 'values args)))
           (call-with-values (lambda () (inline-values out k src args))
             (lambda (out term)
               (if term
                   (let ((cont (build-cont ($kargs names vars ,term))))
                     (intmap-replace! out label cont))
                   out))))
          (_ out)))
      conts
      conts))))