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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
(* Copyright (c) 2008, Adam Chlipala
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - The names of contributors may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*)
structure ESpecialize :> ESPECIALIZE = struct
open Core
structure E = CoreEnv
structure U = CoreUtil
structure ILK = struct
type ord_key = int list
val compare = Order.joinL Int.compare
end
structure ILM = BinaryMapFn(ILK)
structure IM = IntBinaryMap
type func = {
name : string,
args : int ILM.map,
body : exp,
typ : con,
tag : string
}
type state = {
maxName : int,
funcs : func IM.map,
decls : (string * int * con * exp * string) list
}
fun kind (k, st) = (k, st)
fun con (c, st) = (c, st)
fun exp (e, st : state) =
let
fun getApp e =
case e of
ENamed f => SOME (f, [], [])
| EApp (e1, (ENamed x, _)) =>
(case getApp (#1 e1) of
NONE => NONE
| SOME (f, xs, xs') => SOME (f, xs @ [x], xs'))
| EApp (e1, e2) =>
(case getApp (#1 e1) of
NONE => NONE
| SOME (f, xs, xs') => SOME (f, xs, xs' @ [e2]))
| _ => NONE
in
case getApp e of
NONE => (e, st)
| SOME (_, [], _) => (e, st)
| SOME (f, xs, xs') =>
case IM.find (#funcs st, f) of
NONE => (e, st)
| SOME {name, args, body, typ, tag} =>
case ILM.find (args, xs) of
SOME f' => (#1 (foldl (fn (e, arg) => (EApp (e, arg), ErrorMsg.dummySpan))
(ENamed f', ErrorMsg.dummySpan) xs'),
st)
| NONE =>
let
fun subBody (body, typ, xs) =
case (#1 body, #1 typ, xs) of
(_, _, []) => SOME (body, typ)
| (EAbs (_, _, _, body'), TFun (_, typ'), x :: xs) =>
subBody (E.subExpInExp (0, (ENamed x, ErrorMsg.dummySpan)) body',
typ',
xs)
| _ => NONE
in
case subBody (body, typ, xs) of
NONE => (e, st)
| SOME (body', typ') =>
let
val f' = #maxName st
val funcs = IM.insert (#funcs st, f, {name = name,
args = ILM.insert (args, xs, f'),
body = body,
typ = typ,
tag = tag})
val st = {
maxName = f' + 1,
funcs = funcs,
decls = #decls st
}
val (body', st) = specExp st body'
val e' = foldl (fn (e, arg) => (EApp (e, arg), ErrorMsg.dummySpan))
(ENamed f', ErrorMsg.dummySpan) xs'
in
(#1 e',
{maxName = #maxName st,
funcs = #funcs st,
decls = (name, f', typ', body', tag ^ "_espec") :: #decls st})
end
end
end
and specExp st = U.Exp.foldMap {kind = kind, con = con, exp = exp} st
fun decl (d, st) = (d, st)
val specDecl = U.Decl.foldMap {kind = kind, con = con, exp = exp, decl = decl}
fun specialize file =
let
fun doDecl (d, st) =
let
val (d', st) = specDecl st d
val funcs = #funcs st
val funcs =
case #1 d of
DVal (x, n, c, e as (EAbs _, _), tag) =>
IM.insert (funcs, n, {name = x,
args = ILM.empty,
body = e,
typ = c,
tag = tag})
| DValRec vis =>
foldl (fn ((x, n, c, e, tag), funcs) =>
IM.insert (funcs, n, {name = x,
args = ILM.empty,
body = e,
typ = c,
tag = tag}))
funcs vis
| _ => funcs
val ds =
case #decls st of
[] => [d']
| vis => [(DValRec vis, ErrorMsg.dummySpan), d']
in
(ds, {maxName = #maxName st,
funcs = funcs,
decls = []})
end
val (ds, _) = ListUtil.foldlMapConcat doDecl
{maxName = U.File.maxName file + 1,
funcs = IM.empty,
decls = []}
file
in
ds
end
end
|
