CristalCaveGem » LustreC

  match_mem eq.eq_lhs eq.eq_rhs mems

let node_memory_variables nd =

let node_input_variables nd =

 List.fold_left (fun inputs v -> ISet.add v.var_id inputs) ISet.empty nd.node_inputs

    let first = List.hd eq.eq_lhs in

    List.iter (fun v -> Hashtbl.add eq_equiv v first) eq.eq_lhs

  )

  eq_equiv

(* Create a tuple of right dimension, according to [expr] type, *)

  instance_var_cpt := 0;

  let g = new_graph (), new_graph () in

  (* Basic dependencies *)

  g

end

	| Node nd ->

	  (*Format.eprintf "Computing deps of node %s@.@?" nd.node_id; *)

	  let accu = add_vertices [nd.node_id] accu in

	   (*Format.eprintf "%a@.@?" (Utils.fprintf_list ~sep:"@." Format.pp_print_string) deps; *)

	  add_edges [nd.node_id] deps accu

	| _ -> assert false (* should not happen *)

	match td.top_decl_desc with 

	| Node nd ->

	  let prednode n = is_generic_node (Hashtbl.find node_table n) in

	| _ -> ()

      ) prog

  module Cycles = Graph.Components.Make (IdentDepGraph)

  let mk_copy_var n id =

  let mk_copy_eq n var =

    let var_decl = get_node_var var n in

   - a modified acyclic version of [g]

*)

  let break_cycles node mems g =

    let rec break vdecls mem_eqs g =

      let scc_l = Cycles.scc_list g in

      let wrong = List.filter (wrong_partition g) scc_l in

  begin

    merge_with g_non_mems g_mems';

    add_external_dependency outputs mems g_non_mems;

    g_non_mems

  end