desug.ml 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258
  1. open Printf
  2. open Types
  3. open Util
  4. let rec var_init = function
  5. (* Move global initialisations to __init function *)
  6. | Program (decls, ann) ->
  7. let decls = flatten_blocks (List.map var_init decls) in
  8. let rec trav assigns = function
  9. | [] -> (assigns, [])
  10. | (Assign _ as hd) :: tl
  11. | (Allocate _ as hd) :: tl -> trav (assigns @ [hd]) tl
  12. | hd :: tl ->
  13. let (assigns, decls) = trav assigns tl in
  14. (assigns, (hd :: decls))
  15. in
  16. let (assigns, decls) = trav [] decls in (
  17. match assigns with
  18. | [] -> Program (decls, ann)
  19. | assigns ->
  20. let init_func = FunDef (true, Void, "__init", [], Block assigns, []) in
  21. Program (init_func :: decls, ann)
  22. )
  23. (* Global variable initialisation:
  24. * Add an assign statement and the Program node will remove it later on *)
  25. | GlobalDef (export, ctype, name, Some init, ann) ->
  26. Block [GlobalDef (export, ctype, name, None, ann);
  27. Assign (name, None, init, ann)]
  28. (* Global array definition:
  29. * - Create a new global variable for each dimension and initialise it to
  30. * the given expression
  31. * - create __allocate statement in __init *)
  32. | GlobalDef (export, Array (ctype, dims), name, None, ann) as dec ->
  33. let rec create_dimvars i = function
  34. | [] -> []
  35. | hd :: tl ->
  36. let dimname = name ^ "$" ^ string_of_int i in
  37. let var = Var (dimname, None, ann) in
  38. var :: (create_dimvars (i + 1) tl)
  39. in
  40. let dimvars = create_dimvars 1 dims in
  41. let create_globaldef dim = function
  42. | Var (dimname, None, ann) ->
  43. var_init (GlobalDef (export, Int, dimname, Some dim, ann))
  44. | _ -> raise InvalidNode
  45. in
  46. let vardecs = List.map2 create_globaldef dims dimvars in
  47. let alloc = [Allocate (dec, dimvars, ann)] in
  48. Block (vardecs @
  49. [GlobalDef (export, Array (ctype, dimvars), name, None, ann)] @
  50. alloc)
  51. (* Split local variable initialisations in declaration and assignment *)
  52. | FunDef (export, ret_type, name, params, body, ann) ->
  53. let inits = ref [] in
  54. let rec extract_inits = function
  55. (* Translate scalar array initialisation to ArrayScalar node,
  56. * for easy replacement later on *)
  57. | VarDec (Array _ as vtype, name, Some (Const _ as v), ann) ->
  58. let init = Some (ArrayInit (ArrayScalar v, vtype)) in
  59. extract_inits (VarDec (vtype, name, init, ann))
  60. (* Wrap ArrayConst in ArrayInit to pass dimensions *)
  61. | VarDec (Array _ as vtype, name, Some (ArrayConst _ as v), ann) ->
  62. let init = Some (ArrayInit (v, vtype)) in
  63. extract_inits (VarDec (vtype, name, init, ann))
  64. | VarDec (ctype, name, init, ann) as dec ->
  65. (* array definition: create __allocate statement *)
  66. let alloc = match ctype with
  67. | Array (_, dims) -> [Allocate (dec, dims, ann)]
  68. | _ -> []
  69. in
  70. (* initialisation: create assign statement *)
  71. let add = match init with
  72. | Some value -> alloc @ [Assign (name, None, value, ann)]
  73. | None -> alloc
  74. in
  75. inits := !inits @ add;
  76. VarDec (ctype, name, None, ann)
  77. | LocalFuns funs -> LocalFuns (List.map var_init funs)
  78. | node -> transform_children extract_inits node
  79. in
  80. let rec place_inits = function
  81. (* initialisations need to be placed after local functions *)
  82. | (LocalFuns _ as hd) :: tl -> hd :: !inits @ tl
  83. | hd :: tl -> hd :: (place_inits tl)
  84. | [] -> []
  85. in
  86. let params = flatten_blocks (List.map var_init params) in
  87. let body = flatten_blocks (place_inits (block_body (extract_inits body))) in
  88. FunDef (export, ret_type, name, params, Block body, ann)
  89. | node -> transform_children var_init node
  90. let rec replace_var var replacement node =
  91. let trav = (replace_var var replacement) in
  92. match node with
  93. | Var (name, None, ann) when name = var ->
  94. Var (replacement, None, ann)
  95. | For (counter, start, stop, step, body, ann) when counter = var ->
  96. For (replacement, trav start, trav stop, trav step, trav body, ann)
  97. | node ->
  98. transform_children trav node
  99. let for_to_while node =
  100. let rec traverse new_vars = function
  101. | FunDef (export, ret_type, name, params, body, ann) ->
  102. let new_vars = ref [] in
  103. let body = traverse new_vars body in
  104. let create_vardec name = VarDec (Int, name, None, []) in
  105. let new_vardecs = List.map create_vardec !new_vars in
  106. let _body = new_vardecs @ (flatten_blocks (block_body body)) in
  107. FunDef (export, ret_type, name, params, Block _body, ann)
  108. (* Transform for-loops to while-loops *)
  109. | For (counter, start, stop, step, body, ann) ->
  110. let _i = fresh_var counter in
  111. let _stop = fresh_const "stop" in
  112. let _step = fresh_const "step" in
  113. new_vars := !new_vars @ [_i; _stop; _step];
  114. let vi = Var (_i, None, []) in
  115. let vstop = Var (_stop, None, annof stop) in
  116. let vstep = Var (_step, None, annof step) in
  117. let cond = Cond (
  118. Binop (Gt, vstep, Const (IntVal 0, []), []),
  119. Binop (Lt, vi, vstop, []),
  120. Binop (Gt, vi, vstop, []),
  121. []
  122. ) in
  123. Block [
  124. Assign (_i, None, start, annof start);
  125. Assign (_stop, None, stop, annof stop);
  126. Assign (_step, None, step, annof step);
  127. traverse new_vars (While (cond, (Block (
  128. block_body (replace_var counter _i body) @
  129. [Assign (_i, None, Binop (Add, vi, vstep, []), [])]
  130. )), ann));
  131. ]
  132. (* DISABLED, while-loops are explicittly supported by the assembly phase
  133. (* Transform while-loops to do-while loops in if-statements *)
  134. | While (cond, body, ann) ->
  135. let cond = traverse new_vars cond in
  136. let body = traverse new_vars body in
  137. Block [If (cond, Block [DoWhile (cond, body, ann)], ann)]
  138. *)
  139. | node -> transform_children (traverse new_vars) node
  140. in
  141. traverse (ref []) node
  142. let rec array_init = function
  143. (* Transform scalar assignment into nested for-loops *)
  144. | Assign (name, None, ArrayInit (ArrayScalar value, Array (_, dims)), ann) ->
  145. let rec add_loop indices = function
  146. | [] ->
  147. Assign (name, Some indices, value, ann)
  148. | dim :: rest ->
  149. let counter = fresh_var "i" in
  150. let body = Block [add_loop (indices @ [Var (counter, None, [])]) rest] in
  151. For (counter, Const (IntVal 0, []), dim, Const (IntVal 1, []), body, [])
  152. in
  153. add_loop [] dims
  154. (* Transform array constant inisialisation into separate assign statements
  155. * for all entries in the constant array *)
  156. (* TODO: only allow when array dimensions are constant? *)
  157. | Assign (name, None, ArrayInit (ArrayConst _ as value, Array (_, dims)), ann) ->
  158. let ndims = list_size dims in
  159. let rec make_assigns depth i indices = function
  160. | [] -> []
  161. | hd :: tl ->
  162. let assigns = traverse depth (i :: indices) hd in
  163. make_assigns depth (i + 1) indices tl @ assigns
  164. and traverse depth indices = function
  165. | ArrayConst (values, _) ->
  166. make_assigns (depth + 1) 0 indices values
  167. | value when depth = ndims ->
  168. let indices = List.map (fun i -> Const (IntVal i, [])) indices in
  169. [Assign (name, Some (List.rev indices), value, ann)]
  170. | node ->
  171. let msg = sprintf
  172. "dimension mismatch: expected %d nesting levels, got %d"
  173. ndims depth
  174. in
  175. raise (NodeError (node, msg))
  176. in
  177. Block (List.rev (traverse 0 [] value))
  178. | node -> transform_children array_init node
  179. (* Generate new variables for array dimensions in function bodies, to avoid
  180. * re-evalutation after array dimension reduction. For example:
  181. *
  182. * int dims = 0;
  183. *
  184. * int dim() {
  185. * dims = dims 1; // Side effect => dims() should be called once
  186. * return 10;
  187. * }
  188. *
  189. * void foo() {
  190. * int[10, dim()] arr;
  191. * arr[0, 1] = 1;
  192. * }
  193. *
  194. * After dimension reduction, this would become:
  195. * void foo() {
  196. * int[] arr;
  197. * arr = allocate(10, dim());
  198. * arr[1 * dim() + 0] = 1;
  199. * }
  200. *
  201. * This behaviour is of course incorrect. To avoid dim() from being evaluated
  202. * twice, the snippet above is transformed into (note the $$ which will help
  203. * later during constant propagation):
  204. * void foo() {
  205. * int a$dim$$1 = 10;
  206. * int a$dim$$2 = dim();
  207. * int[a$dim$$1, a$dim$$2] arr;
  208. * arr[1, 2] = 1;
  209. * }
  210. *
  211. * ... which then becomes:
  212. * void foo() {
  213. * int a$dim$$1;
  214. * int a$dim$$2;
  215. * int[a$dim$$1, a$dim$$2] arr;
  216. * a$dim$1 = 10;
  217. * a$dim$2 = dim();
  218. * arr = __allocate(a$dim$1 * a$dim$2);
  219. * arr[1 * a$dim$2 * 0] = 1;
  220. * }
  221. * *)
  222. let rec array_dims = function
  223. | VarDec (Array (ctype, dims), name, init, ann) ->
  224. let make_dimname i _ = name ^ "$dim$$" ^ string_of_int (i + 1) in
  225. let dimnames = mapi make_dimname dims in
  226. let make_dimvar d n = Var (n, None, annof d) in
  227. let dimvars = List.map2 make_dimvar dims dimnames in
  228. let make_dimdec dimname dim = VarDec (Int, dimname, Some dim, []) in
  229. let dimdecs = List.map2 make_dimdec dimnames dims in
  230. Block (dimdecs @ [VarDec (Array (ctype, dimvars), name, init, ann)])
  231. | node -> transform_children array_dims node
  232. let phase = function
  233. | Ast node -> Ast (for_to_while (array_init (var_init (array_dims node))))
  234. | _ -> raise (InvalidInput "desugar")