desug.ml 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314
  1. open Printf
  2. open Types
  3. open Util
  4. (* Create new constant variables for all assigned array values so that they are
  5. * only evaluated once *)
  6. let rec consts_to_vars node =
  7. let rec create_vars new_vars values = function
  8. | [] -> (new_vars, values)
  9. | hd :: tl ->
  10. let (new_vars, value) = match hd with
  11. | ArrayConst (values, ann) ->
  12. let (new_vars, values) = create_vars new_vars [] values in
  13. (new_vars, ArrayConst (values, ann))
  14. | value ->
  15. let index = fresh_const "const" in
  16. (new_vars @ [(index, value)], Var (index, None, annof value))
  17. in
  18. create_vars new_vars (values @ [value]) tl
  19. in
  20. match node with
  21. (* Add vardecs for values in arrayconst *)
  22. | VarDec (ArrayDims _ as ctype, name, Some (ArrayConst (values, vann)), ann) ->
  23. let (new_vars, values) = create_vars [] [] values in
  24. let value = ArrayConst (values, vann) in
  25. let create_vardec (name, value) =
  26. VarDec (basetypeof node, name, Some value, annof value)
  27. in
  28. let new_vardecs = List.map create_vardec new_vars in
  29. Block (new_vardecs @ [VarDec (ctype, name, Some value, ann)])
  30. (* Add vardec for scalar value *)
  31. | VarDec (ArrayDims _ as ctype, name, Some value, ann) as node ->
  32. let scalar_name = fresh_const "scalar" in
  33. Block [
  34. VarDec (basetypeof node, scalar_name, Some value, ann);
  35. VarDec (ctype, name, Some (Var (scalar_name, None, annof value)), ann);
  36. ]
  37. | node -> traverse_unit consts_to_vars node
  38. let make_dims make_dimname values make_dec =
  39. let names = mapi make_dimname values in
  40. let decs = List.map2 make_dec values names in
  41. let make_dim value name = Dim (name, annof value) in
  42. let dims = List.map2 make_dim values names in
  43. (decs, dims)
  44. (* Generate new variables for array dimensions, to avoid re-evalutation when
  45. * array dimensions are used (e.g., after array dimension reduction). *)
  46. let rec array_dims node =
  47. match node with
  48. | VarDec (ArrayDims (ctype, values), name, init, ann) ->
  49. (* Names for VarDec dimensions must be unique to avoid weid errors when
  50. * during context analysis, when an array variable is redeclared within the
  51. * same scope *)
  52. let make_dimname i _ = fresh_const (name ^ "_" ^ string_of_int (i + 1)) in
  53. let make_dec value name = VarDec (Int, name, Some value, []) in
  54. let (decs, dims) = make_dims make_dimname values make_dec in
  55. Block (decs @ [VarDec (ArrayDims (ctype, dims), name, init, ann)])
  56. | GlobalDef (export, ArrayDims (ctype, values), name, init, ann) ->
  57. (* For global decs, the name must be derived from the array base name, but
  58. * not constant (no trailing __) since the variable must exist for exporting
  59. * (and not pruned during constant propagation) *)
  60. let make_dimname i _ = generate_id name (i + 1) in
  61. let make_dec value name = GlobalDef (export, Int, name, Some value, []) in
  62. let (decs, dims) = make_dims make_dimname values make_dec in
  63. Block (decs @ [GlobalDef (export, ArrayDims (ctype, dims), name, init, ann)])
  64. (* DISABLED, this is also done in extern.ml
  65. | GlobalDec (ArrayDims (ctype, values), name, ann) ->
  66. (*
  67. let rec make_decs = function
  68. | [] -> []
  69. | Dim (name, ann) :: tl -> GlobalDec (Int, name, ann) :: (make_decs tl)
  70. | _ -> raise InvalidNode
  71. in
  72. let decs = make_decs values in
  73. Block (decs @ [GlobalDec (ArrayDims (ctype, dims), name, ann)])
  74. *)
  75. let make_dec value name = GlobalDec (Int, name, []) in
  76. let (decs, dims) = make_dims name values make_dec in
  77. Block (decs @ [GlobalDec (ArrayDims (ctype, dims), name, ann)])
  78. *)
  79. | node -> traverse_unit array_dims node
  80. (* Split variable initialisation into declaration and assignment *)
  81. let rec split_inits = function
  82. (* Wrap array initialisation in ArrayInit to pass dimensions *)
  83. | VarDec (ArrayDims (_, dims) as ctype, name, Some value, ann) ->
  84. Block [
  85. VarDec (ctype, name, None, ann);
  86. Assign (name, None, ArrayInit (value, dims), ann);
  87. ]
  88. | GlobalDef (export, (ArrayDims (_, dims) as ctype), name, Some value, ann) ->
  89. Block [
  90. GlobalDef (export, ctype, name, None, ann);
  91. Assign (name, None, ArrayInit (value, dims), ann);
  92. ]
  93. | VarDec (ctype, name, Some init, ann) ->
  94. Block [
  95. VarDec (ctype, name, None, ann);
  96. Assign (name, None, init, ann);
  97. ]
  98. | GlobalDef (export, ctype, name, Some init, ann) ->
  99. Block [
  100. GlobalDef (export, ctype, name, None, ann);
  101. Assign (name, None, init, ann);
  102. ]
  103. | node -> traverse_unit split_inits node
  104. (* Add <allocate> statements after array declarations *)
  105. let rec add_allocs node =
  106. let create_dimvar = function
  107. | Dim (name, _) -> Var (name, None, [])
  108. | _ -> raise InvalidNode
  109. in
  110. match node with
  111. | VarDec (ArrayDims (_, dims), _, _, ann) ->
  112. Block [node; Allocate (node, List.map create_dimvar dims, ann)]
  113. | GlobalDef (_, ArrayDims (_, dims), _, _, ann) ->
  114. Block [node; Allocate (node, List.map create_dimvar dims, ann)]
  115. | node -> traverse_unit add_allocs node
  116. let extract_inits lst =
  117. let rec trav inits = function
  118. | [] ->
  119. (List.rev inits, [])
  120. | (Assign _ as hd) :: tl
  121. | (Allocate _ as hd) :: tl ->
  122. trav (hd :: inits) tl
  123. | hd :: tl ->
  124. let (inits, tl) = trav inits tl in
  125. (inits, (hd :: tl))
  126. in trav [] lst
  127. let rec move_inits = function
  128. (* Move global initialisations to __init function *)
  129. | Program (decls, ann) ->
  130. let decls = List.map move_inits decls in
  131. begin match extract_inits decls with
  132. | ([], _) -> Program (decls, ann)
  133. | (inits, decls) ->
  134. let body = Block (VarDecs [] :: LocalFuns [] :: inits) in
  135. let init_func = FunDef (true, Void, "__init", [], body, []) in
  136. Program (init_func :: decls, ann)
  137. end
  138. (* Split local variable initialisations in declaration and assignment *)
  139. | FunDef (export, ret_type, name, params, Block body, ann) ->
  140. let rec place_inits inits = function
  141. | VarDecs lst :: tl ->
  142. let (inits, decs) = extract_inits lst in
  143. VarDecs decs :: (place_inits inits tl)
  144. | LocalFuns _ as hd :: tl ->
  145. hd :: inits @ tl
  146. | _ -> raise InvalidNode
  147. in
  148. let body = Block (place_inits [] body) in
  149. FunDef (export, ret_type, name, params, body, ann)
  150. | node -> traverse_unit move_inits node
  151. let for_to_while node =
  152. let rec replace_var var replacement node =
  153. let trav = (replace_var var replacement) in
  154. match node with
  155. | Var (name, None, ann) when name = var ->
  156. Var (replacement, None, ann)
  157. | For (counter, start, stop, step, body, ann) when counter = var ->
  158. For (replacement, trav start, trav stop, trav step, trav body, ann)
  159. | node ->
  160. traverse_unit trav node
  161. in
  162. let rec traverse new_vars = function
  163. | FunDef (export, ret_type, name, params, body, ann) ->
  164. let rec place_decs decs = function
  165. | Block (VarDecs lst :: tl) -> Block (VarDecs (decs @ lst) :: tl)
  166. | _ -> raise InvalidNode
  167. in
  168. let new_vars = ref [] in
  169. let body = traverse new_vars body in
  170. let create_vardec name = VarDec (Int, name, None, []) in
  171. let new_vardecs = List.map create_vardec !new_vars in
  172. let body = place_decs new_vardecs body in
  173. FunDef (export, ret_type, name, params, body, ann)
  174. (* Transform for-loops to while-loops *)
  175. | For (counter, start, stop, step, body, ann) ->
  176. let _i = fresh_id counter in
  177. let _stop = fresh_const "stop" in
  178. let _step = fresh_const "step" in
  179. new_vars := !new_vars @ [_i; _stop; _step];
  180. let vi = Var (_i, None, []) in
  181. let vstop = Var (_stop, None, annof stop) in
  182. let vstep = Var (_step, None, annof step) in
  183. let cond = Cond (
  184. Binop (Gt, vstep, Const (IntVal 0, []), []),
  185. Binop (Lt, vi, vstop, []),
  186. Binop (Gt, vi, vstop, []),
  187. []
  188. ) in
  189. Block [
  190. Assign (_i, None, start, annof start);
  191. Assign (_stop, None, stop, annof stop);
  192. Assign (_step, None, step, annof step);
  193. traverse new_vars (While (cond, (Block (
  194. block_body (replace_var counter _i body) @
  195. [Assign (_i, None, Binop (Add, vi, vstep, []), [])]
  196. )), ann));
  197. ]
  198. (* Transform while-loops to do-while loops in if-statements *)
  199. (* DISABLED, while-loops are explicitly supported by the assembly phase
  200. | While (cond, body, ann) ->
  201. let cond = traverse new_vars cond in
  202. let body = traverse new_vars body in
  203. Block [If (cond, Block [DoWhile (cond, body, ann)], ann)]
  204. *)
  205. | node -> traverse_unit (traverse new_vars) node
  206. in
  207. traverse (ref []) node
  208. let rec sublist n = function
  209. | [] when n > 0 -> raise (Invalid_argument "n")
  210. | [] -> []
  211. | lst when n = 0 -> lst
  212. | _ :: tl -> sublist (n - 1) tl
  213. let rec array_init = function
  214. (* Transform array constant initialisation into separate assign statements
  215. * for all entries in the constant array *)
  216. | Assign (name, None, ArrayInit (ArrayConst _ as value, dims), ann) ->
  217. let ndims = List.length dims in
  218. let rec make_assigns depth i indices = function
  219. | [] -> []
  220. | hd :: tl ->
  221. let assigns = traverse depth (i :: indices) hd in
  222. make_assigns depth (i + 1) indices tl @ assigns
  223. and traverse depth indices = function
  224. | ArrayConst (values, _) ->
  225. make_assigns (depth + 1) 0 indices values
  226. | value when depth = ndims ->
  227. let indices = List.map (fun i -> Const (IntVal i, [])) indices in
  228. [Assign (name, Some (List.rev indices), value, ann)]
  229. | value when depth < ndims ->
  230. (* Use the for-loops constructed for scalar assignment *)
  231. let value = ArrayInit (value, dims) in
  232. let indices = List.map (fun i -> Const (IntVal i, [])) indices in
  233. [array_init (Assign (name, Some (List.rev indices), value, ann))]
  234. | node ->
  235. let msg = sprintf
  236. "dimension mismatch: expected %d nesting levels, got %d"
  237. ndims depth
  238. in
  239. raise (FatalError (NodeMsg (node, msg)))
  240. in
  241. Block (List.rev (traverse 0 [] value))
  242. (* Replace no indices with empty indices to have a list below *)
  243. | Assign (name, None, (ArrayInit _ as value), ann) ->
  244. array_init (Assign (name, Some [], value, ann))
  245. | Assign (name, Some indices, ArrayInit (value, dims), ann) ->
  246. let rec add_loop indices = function
  247. | [] ->
  248. array_init (Assign (name, Some indices, value, ann))
  249. | dim :: rest ->
  250. let counter = fresh_id "i" in
  251. let start = Const (IntVal 0, []) in
  252. let step = Const (IntVal 1, []) in
  253. let body = Block [add_loop (indices @ [Var (counter, None, [])]) rest] in
  254. let stop = match dim with
  255. | Dim (name, ann) -> Var (name, None, ann)
  256. | _ -> dim
  257. in
  258. For (counter, start, stop, step, body, [])
  259. in
  260. let dims_left = sublist (List.length indices) dims in
  261. add_loop indices dims_left
  262. | node -> traverse_unit array_init node
  263. let phase = function
  264. | Ast node ->
  265. (* Generate variable declarations for expressions that must be evaluated
  266. * once and used multiple times *)
  267. let node = consts_to_vars (array_dims node) in
  268. (* Split variable initialisations into declarations and assignments, and
  269. * move the assignments to the function body *)
  270. let node = move_inits (add_allocs (split_inits node)) in
  271. (* Transform ArrayConst assignment to assignments in for-loops, and
  272. * transform all for-loops to while-loops afterwards *)
  273. Ast (for_to_while (array_init (node)))
  274. | _ -> raise InvalidInput