jeltz/heptagon
1
0
Fork 0
Code Issues Pull requests Releases Activity

Special case for merge in the scheduling

Browse source 
For merge equations, the generated code will be 
on a different rate than the activation clock of
the equation.
This commit is contained in:
Cédric Pasteur 2012-02-01 11:19:25 +01:00
parent 1cb4b1154b
commit f66c9045df
1 changed files with 9 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
compiler/minils/transformations/schedule_interf.ml
View file

@ -6,6 +6,13 @@ open Mls_utils
open Misc open Misc
open Sgraph open Sgraph
(** In order to put together equations with the same control structure, we have to take into
account merge equations, that will to be translated to two instructions on slow clocks
although the activation clock of the equation is fast. *)
let control_ck eq =
match eq.eq_rhs.e_desc with
| Emerge (_, (_, w)::_) -> w.w_ck
| _ -> Mls_utils.Vars.clock eq
module Cost = module Cost =
struct struct
@ -74,7 +81,7 @@ struct
in in
let eqs_wcost = let eqs_wcost =
List.map List.map
(fun eq -> (eq, cost eq, Clocks.same_control (Mls_utils.Vars.clock eq) ck)) (fun eq -> (eq, cost eq, Clocks.same_control (control_ck eq) ck))
rem_eqs rem_eqs
in in
let (eq, c, same_ctrl), eqs_wcost = Misc.assert_1min eqs_wcost in let (eq, c, same_ctrl), eqs_wcost = Misc.assert_1min eqs_wcost in
@ -125,7 +132,7 @@ let schedule eq_list inputs node_list =
let rem_eqs = free_eqs node_list in let rem_eqs = free_eqs node_list in
(* compute new costs for the next step *) (* compute new costs for the next step *)
let costs = Cost.update_cost eq uses costs in let costs = Cost.update_cost eq uses costs in
schedule_aux rem_eqs (eq::sched_eqs) node_list (Mls_utils.Vars.clock eq) costs schedule_aux rem_eqs (eq::sched_eqs) node_list (control_ck eq) costs
in in
let costs = Cost.init_cost uses inputs in let costs = Cost.init_cost uses inputs in
let rem_eqs = free_eqs node_list in let rem_eqs = free_eqs node_list in