desug.ml 10 KB

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