desug.ml 10 KB

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