CristalCaveGem » LustreC

   For variables still unrelated, standard compare is used to choose the minimal element.

   This priority is used since it helps a lot in factorizing generated code.

   Moreover, the dependency graph is browsed in a depth-first manner whenever possible,

   In the following functions:

   - [eq_equiv] is the equivalence relation between vars of the same equation lhs

   - [g] the (imperative) graph to be topologically sorted

 List.exists ExprDep.is_instance_var (IdentDepGraph.succ g choice)

(* Adds successors of [v] in graph [g] in [pending] or [frontier] sets, wrt [eq_equiv],

*)

let add_successors eq_equiv g v pending frontier =

  let succs_v = IdentDepGraph.succ g v in

  begin

    IdentDepGraph.remove_vertex g v;

	   else

	      frontier := ISet.add v' !frontier)

      ) succs_v;

      with Not_found -> false in

    let n', g = global_dependency n in

	Format.fprintf fmt

	  n'.node_id

	  pp_dep_graph g

      );

    (* TODO X: extend the graph with inputs (adapt the causality analysis to deal with inputs

     compute: coi predecessors of outputs

     warning (no modification) when memories are non used (do not impact output) or when inputs are not used (do not impact output)

    if !Options.print_reuse

    then

      begin

	    Format.fprintf fmt

	      "OPT:%B@." (try (Hashtbl.iter (fun s1 v2 -> if s1 = v2.var_id then raise Not_found) reuse; false) with Not_found -> true)

	  );

	    Format.fprintf fmt

	      n'.node_id

	      Disjunction.pp_disjoint_map disjoint

	  );

	    Format.fprintf fmt

	      n'.node_id

	      Liveness.pp_reuse_policy reuse

	  );

  List.fold_right (

    fun top_decl (accu_prog, sch_map)  ->

      match top_decl.top_decl_desc with

	  let nd', report = schedule_node nd in

	  IMap.add nd.node_id report sch_map

	| _ -> top_decl::accu_prog, sch_map

    prog

    ([],IMap.empty)

  | []  -> assert false

  | [v] -> Format.fprintf fmt "%s" v

  | _   -> Format.fprintf fmt "(%a)" (fprintf_list ~sep:" , " (fun fmt v -> Format.fprintf fmt "%s" v)) vl

let pp_schedule fmt node_schs =

 IMap.iter

   (fun nd report ->