desug.ml 10 KB

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