1 ;;; Continuation-passing style (CPS) intermediate language (IL)
3 ;; Copyright (C) 2013, 2014, 2015 Free Software Foundation, Inc.
5 ;;;; This library is free software; you can redistribute it and/or
6 ;;;; modify it under the terms of the GNU Lesser General Public
7 ;;;; License as published by the Free Software Foundation; either
8 ;;;; version 3 of the License, or (at your option) any later version.
10 ;;;; This library is distributed in the hope that it will be useful,
11 ;;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
12 ;;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 ;;;; Lesser General Public License for more details.
15 ;;;; You should have received a copy of the GNU Lesser General Public
16 ;;;; License along with this library; if not, write to the Free Software
17 ;;;; Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 ;;; A pass to reify lone $prim's that were never folded into a
22 ;;; $primcall, and $primcall's to primitives that don't have a
23 ;;; corresponding VM op.
27 (define-module (language cps reify-primitives)
28 #:use-module (ice-9 match)
29 #:use-module (language cps)
30 #:use-module (language cps dfg)
31 #:use-module (language cps primitives)
32 #:use-module (language bytecode)
33 #:export (reify-primitives))
35 (define (module-box src module name public? bound? val-proc)
36 (let-fresh (kbox) (module-var name-var public?-var bound?-var box)
38 ($letconst (('module module-var module)
40 ('public? public?-var public?)
41 ('bound? bound?-var bound?))
42 ($letk ((kbox ($kargs ('box) (box) ,(val-proc box))))
44 ($primcall 'cached-module-box
45 (module-var name-var public?-var bound?-var))))))))
47 (define (primitive-module name)
52 bytevector-u8-ref bytevector-u8-set!
53 bytevector-s8-ref bytevector-s8-set!
55 bytevector-u16-ref bytevector-u16-set!
56 bytevector-u16-native-ref bytevector-u16-native-set!
57 bytevector-s16-ref bytevector-s16-set!
58 bytevector-s16-native-ref bytevector-s16-native-set!
60 bytevector-u32-ref bytevector-u32-set!
61 bytevector-u32-native-ref bytevector-u32-native-set!
62 bytevector-s32-ref bytevector-s32-set!
63 bytevector-s32-native-ref bytevector-s32-native-set!
65 bytevector-u64-ref bytevector-u64-set!
66 bytevector-u64-native-ref bytevector-u64-native-set!
67 bytevector-s64-ref bytevector-s64-set!
68 bytevector-s64-native-ref bytevector-s64-native-set!
70 bytevector-ieee-single-ref bytevector-ieee-single-set!
71 bytevector-ieee-single-native-ref bytevector-ieee-single-native-set!
72 bytevector-ieee-double-ref bytevector-ieee-double-set!
73 bytevector-ieee-double-native-ref bytevector-ieee-double-native-set!)
75 ((class-of) '(oop goops))
78 (define (primitive-ref name k src)
79 (module-box #f (primitive-module name) name #f #t
82 ($continue k src ($primcall 'box-ref (box)))))))
84 (define (builtin-ref idx k src)
85 (let-fresh () (idx-var)
87 ($letconst (('idx idx-var idx))
89 ($primcall 'builtin-ref (idx-var)))))))
91 (define (reify-clause ktail)
92 (let-fresh (kclause kbody kthrow) (wna false str eol throw)
94 (kclause ($kclause ('() '() #f '() #f)
97 ($letconst (('wna wna 'wrong-number-of-args)
99 ('str str "Wrong number of arguments")
102 ($kargs ('throw) (throw)
105 (wna false str eol false))))))
106 ,(primitive-ref 'throw kthrow #f)))))
109 (define (reify-primitives/1 fun single-value-conts)
110 (define (visit-clause cont)
111 (rewrite-cps-cont cont
112 (($ $cont label ($ $kclause arity body alternate))
113 (label ($kclause ,arity ,(visit-cont body)
114 ,(and alternate (visit-clause alternate)))))))
115 (define (visit-cont cont)
116 (rewrite-cps-cont cont
117 (($ $cont label ($ $kargs (name) (var) body))
119 (bitvector-set! single-value-conts label #t)
121 (label ($kargs (name) (var) ,(visit-term body))))))
122 (($ $cont label ($ $kargs names vars body))
123 (label ($kargs names vars ,(visit-term body))))
126 (define (visit-term term)
128 (($ $letk conts body)
129 ;; Visit continuations before their uses.
130 (let ((conts (map visit-cont conts)))
132 ($letk ,conts ,(visit-term body)))))
133 (($ $continue k src exp)
136 (if (bitvector-ref single-value-conts k)
138 ((builtin-name->index name)
140 (builtin-ref idx k src)))
141 (else (primitive-ref name k src)))
142 (build-cps-term ($continue k src
143 ($const *unspecified*)))))
144 (($ $primcall 'call-thunk/no-inline (proc))
146 ($continue k src ($call proc ()))))
147 (($ $primcall name args)
149 ((or (prim-instruction name) (branching-primitive? name))
150 ;; Assume arities are correct.
155 ($letk ((k* ($kargs (v) (v)
156 ($continue k src ($call v args)))))
158 ((builtin-name->index name)
160 (builtin-ref idx k* src)))
161 (else (primitive-ref name k* src)))))))))
164 (rewrite-cps-cont fun
165 (($ $cont label ($ $kfun src meta self (and tail ($ $cont ktail)) #f))
166 ;; A case-lambda with no clauses. Reify a clause.
167 (label ($kfun src meta self ,tail ,(reify-clause ktail))))
168 (($ $cont label ($ $kfun src meta self tail clause))
169 (label ($kfun src meta self ,tail ,(visit-clause clause))))))
171 (define (reify-primitives term)
172 (with-fresh-name-state term
173 (let ((single-value-conts (make-bitvector (label-counter) #f)))
174 (rewrite-cps-term term
176 ($program ,(map (lambda (cont)
177 (reify-primitives/1 cont single-value-conts))