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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/*
module owner: Ronny Wichers Schreur
*/
implementation module typereify
import syntax
import typesupport
class makeTypeFun a :: Ident Position SymbolType *VarHeap *SymbolTable
-> (a, *VarHeap, *SymbolTable)
instance makeTypeFun FunDef where
makeTypeFun ident position symbol_type var_heap symbol_table
= (function, var_heap, symbol_table)
where
function =
{ fun_ident = ident
, fun_arity = 1
, fun_priority = NoPrio
, fun_body = GeneratedBody
, fun_type = Yes symbol_type
, fun_pos = position
, fun_kind = FK_Function False
, fun_lifted = 0
, fun_info = EmptyFunInfo
}
instance makeTypeFun FunType where
makeTypeFun ident position symbol_type var_heap symbol_table
# (entry, symbol_table)
= readPtr ident.id_info symbol_table
# entry
= { entry & ste_kind = STE_DclFunction}
# symbol_table
= writePtr ident.id_info entry symbol_table
# (ft_type_ptr, var_heap)
= newPtr VI_Empty var_heap
= ({ ft_ident = ident
, ft_arity = 1
, ft_priority = NoPrio
, ft_type = symbol_type
, ft_pos = position
, ft_specials = FSP_None
, ft_type_ptr = ft_type_ptr
}, var_heap, symbol_table)
class isTypeSynonym a :: a -> Bool
instance isTypeSynonym (TypeDef a) | isTypeSynonym a where
isTypeSynonym {td_rhs}
= isTypeSynonym td_rhs
// Currently type functions are generated for all types, including type
// synonyms. This should be changed to only type synonyms that are abstract.
instance isTypeSynonym TypeRhs where
isTypeSynonym (AlgType _)
= False
isTypeSynonym (RecordType _)
= False
isTypeSynonym (AbstractType _)
= False
isTypeSynonym (SynType _)
= False
isTypeSynonym (AbstractSynType _ _)
= False
isTypeSynonym (NewType _)
= False
add_dcl_type_fun_types :: TypeSymbIdent Int *{#DclModule} *VarHeap *SymbolTable
-> (*{#DclModule},*VarHeap,*SymbolTable)
add_dcl_type_fun_types ctListDefSymb n_cached_dcls dcl_mods var_heap symbols
# (n, dcl_mods) = usize dcl_mods
= add_type_fun_types n_cached_dcls n ctListDefSymb dcl_mods var_heap symbols
where
add_type_fun_types :: Int Int TypeSymbIdent *{#DclModule} *VarHeap *SymbolTable
-> (*{#DclModule},*VarHeap,*SymbolTable)
add_type_fun_types module_n n ctListDefSymb dcl_mods var_heap symbols
| module_n >= n
= (dcl_mods, var_heap, symbols)
| module_n == cPredefinedModuleIndex
= add_type_fun_types (module_n+1) n ctListDefSymb dcl_mods var_heap symbols
# (dcl_mod, dcl_mods) = dcl_mods![module_n]
# (dcl_mod, var_heap, symbols)
= add_fun_types ctListDefSymb dcl_mod var_heap symbols
# dcl_mods = {dcl_mods & [module_n] = dcl_mod}
= add_type_fun_types (module_n+1) n ctListDefSymb dcl_mods var_heap symbols
add_fun_types :: TypeSymbIdent DclModule *VarHeap *SymbolTable
-> (DclModule,*VarHeap,*SymbolTable)
add_fun_types ctListDefSymb dcl_mod=:{dcl_name, dcl_functions, dcl_common={com_type_defs}} var_heap symbols
# n_functions = size dcl_functions
(type_funs, com_type_defs, var_heap, symbols)
= addTypeFunctionsA dcl_name n_functions ctListDefSymb {def \\ def <-: com_type_defs} var_heap symbols
dcl_functions = {function \\ function <- [e \\ e <-: dcl_functions] ++ type_funs}
dcl_type_funs = {ir_from = n_functions, ir_to = size dcl_functions}
dcl_mod = { dcl_mod & dcl_functions = dcl_functions
, dcl_common.com_type_defs = com_type_defs
, dcl_type_funs = dcl_type_funs
}
= (dcl_mod, var_heap, symbols)
getListTypeSymb predefs
# ({pds_module, pds_def}, predefs) = predefs![PD_ListType]
ident = predefined_idents.[PD_ListType]
type_symb = {MakeNewTypeSymbIdent ident 0 & type_index.glob_module = pds_module, type_index.glob_object = pds_def}
= (type_symb, predefs)
getNilSymb :: *PredefinedSymbols -> (SymbIdent, !*PredefinedSymbols)
getNilSymb predefs
# ({pds_module, pds_def}, predefs) = predefs![PD_NilSymbol]
pds_ident = predefined_idents.[PD_NilSymbol]
symbol = { symb_ident = pds_ident, symb_kind = SK_Constructor { glob_module = pds_module, glob_object = pds_def} }
= (symbol, predefs)
addTypeFunctions :: Ident Int *{#DclModule} *{#FunDef} *CommonDefs *PredefinedSymbols *VarHeap *SymbolTable
-> (IndexRange, *{#DclModule},*{#FunDef},*CommonDefs,*PredefinedSymbols,*VarHeap,*SymbolTable)
addTypeFunctions mod_ident nr_cached_dcls dcl_modules icl_functions icl_common predefs var_heap symbols
# (ctTypeDefSymb, predefs) = getListTypeSymb predefs
# (dcl_modules, var_heap, symbols)
= add_dcl_type_fun_types ctTypeDefSymb nr_cached_dcls dcl_modules var_heap symbols
# (icl_type_fun_range, icl_functions, icl_common, var_heap, symbols)
= add_icl_type_functions icl_functions ctTypeDefSymb icl_common var_heap symbols
with
add_icl_type_functions :: *{#FunDef} TypeSymbIdent *CommonDefs *VarHeap *SymbolTable
-> (IndexRange, *{#FunDef}, *CommonDefs, *VarHeap, *SymbolTable)
add_icl_type_functions icl_functions ctTypeDefSymb icl_common=:{com_type_defs} var_heap symbols
# (n_functions_before, icl_functions) = usize icl_functions
# (type_funs, com_type_defs, var_heap, symbols)
= addTypeFunctionsA mod_ident n_functions_before ctTypeDefSymb com_type_defs var_heap symbols
# icl_common = {icl_common & com_type_defs=com_type_defs}
# icl_functions = {function \\ function <- [e \\ e <-: icl_functions] ++ type_funs}
# (n_functions_after, icl_functions) = usize icl_functions
# type_fun_range = {ir_from=n_functions_before,ir_to=n_functions_after}
= (type_fun_range, icl_functions, icl_common, var_heap, symbols)
# (nr_of_functions, icl_functions) = usize icl_functions
= (icl_type_fun_range, dcl_modules, icl_functions, icl_common, predefs, var_heap, symbols)
:: BuildTypeFunState =
!{ bs_predefs :: !.PredefinedSymbols
, bs_type_heaps :: !.TypeHeaps
, bs_var_heap :: !.VarHeap
}
:: Info = { ri_main :: !Int, ri_common_defs :: !{#CommonDefs} }
buildTypeFunctions :: !Int !*{#FunDef} !{#CommonDefs}
*PredefinedSymbols *VarHeap *TypeHeaps
-> (*{#FunDef}, *PredefinedSymbols, *VarHeap, *TypeHeaps)
buildTypeFunctions main icl_functions common_defs predefs var_heap type_heaps
# bs_state =
{ bs_predefs = predefs
, bs_var_heap = var_heap
, bs_type_heaps = type_heaps
}
# type_defs = common_defs.[main].com_type_defs
# (type_funs, bs_state)
= build 0 (size type_defs) type_defs icl_functions bs_state
= (type_funs, bs_state.bs_predefs, bs_state.bs_var_heap, bs_state.bs_type_heaps)
where
build i n type_defs functions bs_state
| i < n
# info = {ri_main = main, ri_common_defs = common_defs}
# (functions, bs_state)
= buildTypeFunction type_defs.[i] functions info bs_state
= build (i+1) n type_defs functions bs_state
= (functions, bs_state)
buildTypeFunction :: CheckedTypeDef *{#FunDef} Info *BuildTypeFunState
-> (*{#FunDef}, *BuildTypeFunState)
buildTypeFunction type_def=:{td_fun_index, td_args} functions info bs_state
| td_fun_index == NoIndex
= (functions, bs_state)
// otherwise
# (new_info_ptr, bs_var_heap) = newPtr VI_Empty bs_state.bs_var_heap
bs_state & bs_var_heap=bs_var_heap
var_id = {id_name = "_x", id_info = nilPtr}
# (symb_Nil, bs_predefs) = getNilSymb bs_state.bs_predefs
bs_state & bs_predefs = bs_predefs
rhs = App {app_symb = symb_Nil, app_args = [], app_info_ptr = nilPtr}
# lhs_free_var = {fv_def_level = NotALevel, fv_ident = var_id, fv_info_ptr = new_info_ptr, fv_count = 0}
# body = {tb_args = [lhs_free_var], tb_rhs = rhs}
# functions = {functions & [td_fun_index].fun_body=TransformedBody body}
= (functions, bs_state)
addTypeFunctionsA :: Ident Int TypeSymbIdent *{#CheckedTypeDef} *VarHeap *SymbolTable
-> ([a], *{#CheckedTypeDef}, *VarHeap, *SymbolTable) | makeTypeFun a
addTypeFunctionsA mod first_td_fun_index ct_type_def type_defs var_heap symbol_table
= add_td_fun_defs first_td_fun_index ct_type_def type_defs var_heap symbol_table
where
add_td_fun_defs :: Int TypeSymbIdent *{#CheckedTypeDef} *VarHeap *SymbolTable
-> ([a], *{#CheckedTypeDef}, *VarHeap, *SymbolTable) | makeTypeFun a
add_td_fun_defs type_fun_index ct_type_def type_defs var_heap symbol_table
# (n, type_defs)
= usize type_defs
= add_td_funs_acc 0 n type_fun_index ct_type_def type_defs [] var_heap symbol_table
add_td_funs_acc :: Int Int Int TypeSymbIdent *{#CheckedTypeDef} [a] *VarHeap *SymbolTable
-> ([a], *{#CheckedTypeDef}, *VarHeap, *SymbolTable) | makeTypeFun a
add_td_funs_acc i n index ct_type_def type_defs rev_type_fun_defs var_heap symbol_table
| i >= n
= (reverse rev_type_fun_defs, type_defs, var_heap, symbol_table)
# (type_def, type_defs) = type_defs![i]
| isTypeSynonym type_def || is_dictionary type_def
= add_td_funs_acc (i+1) n index ct_type_def type_defs rev_type_fun_defs var_heap symbol_table
# (type_fun_def, var_heap, symbol_table)
= add_td_fun_def index ct_type_def type_def var_heap symbol_table
# type_defs = {type_defs & [i].td_fun_index = index}
# rev_type_fun_defs = [type_fun_def : rev_type_fun_defs]
= add_td_funs_acc (i+1) n (index+1) ct_type_def type_defs rev_type_fun_defs var_heap symbol_table
is_dictionary {td_ident} // FIXME, fragile
= name.[size name - 1] == ';'
where
name = td_ident.id_name
add_td_fun_def :: Int TypeSymbIdent CheckedTypeDef *VarHeap *SymbolTable
-> (a, *VarHeap, *SymbolTable) | makeTypeFun a
add_td_fun_def index ct_type_def type_def=:{td_ident, td_pos} var_heap symbol_table
# entry = { ste_kind = STE_Empty
, ste_index = index
, ste_def_level = -1
, ste_previous = EmptySymbolTableEntry
}
# (fun_ident, symbol_table)
= newPtr entry symbol_table
# type_fun_ident = {id_name="TD;"+++td_ident.id_name, id_info=fun_ident}
# result_type = TA ct_type_def [{at_attribute = TA_None, at_type = TB BT_Bool}]
# symbol_type =
{ st_vars = []
, st_args = [{at_attribute= TA_None, at_type = TB BT_Bool}]
, st_args_strictness = NotStrict
, st_arity = 1
, st_result = {at_attribute = TA_None, at_type = result_type}
, st_context = []
, st_attr_vars = []
, st_attr_env = []
}
= makeTypeFun type_fun_ident td_pos symbol_type var_heap symbol_table
|
