Project

General

Profile

« Previous | Next » 

Revision a7062da6

Added by LĂ©lio Brun over 3 years ago

another step towards refactoring

View differences:

src/causality.mli
10 10

  
11 11
val pp_error: Format.formatter -> error -> unit
12 12

  
13
val world: ident
14

  
13 15
module NodeDep: sig
14 16
  val dependence_graph: program_t -> IdentDepGraph.t
15 17
  val filter_static_inputs: var_decl list -> expr list -> Dimension.t list
18
  val compute_generic_calls: program_t -> unit
19
  val get_callee: expr -> (ident * expr list) option
20
  val get_calls: (ident -> bool) -> node_desc -> expr list
16 21
end
17 22

  
18 23
(* Look for cycles in a dependency graph *)
......
32 37
  val mk_instance_var: ident -> ident
33 38
  val is_instance_var: ident -> bool
34 39
  val is_ghost_var: ident -> bool
40
  val is_read_var: ident -> bool
35 41
  val undo_instance_var: ident -> ident
42
  val undo_read_var: ident -> ident
36 43
  val node_eq_equiv: node_desc -> (ident, ident) Hashtbl.t
37 44
  val node_input_variables: node_desc -> ISet.t
45
  val node_local_variables: node_desc -> ISet.t
46
  val node_output_variables: node_desc -> ISet.t
47
  val node_memory_variables: node_desc -> ISet.t
38 48
end
39 49

  
40 50
(* Module used to compute static disjunction of variables based upon their
......
46 56
     order, maybe removing shorter branches *)
47 57
  type disjoint_map = (ident, CISet.t) Hashtbl.t
48 58

  
59
  val pp_ciset: Format.formatter -> CISet.t -> unit
60

  
49 61
  val clock_disjoint_map: var_decl list -> disjoint_map
62

  
63
  val pp_disjoint_map: Format.formatter -> disjoint_map -> unit
50 64
end
51 65

  
52 66
(* Tests whether [v] is a root of graph [g], i.e. a source *)

Also available in: Unified diff