b4419a6760
There are now 3 kinds of nodes: Eprim : primitive nodes, Enode: nodes with memory, Efun: nodes without memory. Typing now sets correct eq_statefull and b_statefull for equations and blocks. Resets are only added when a node with memory is called. The calling convention is the generated code needs to be modified so that we can remove the context for nodes without memory.
58 lines
1.8 KiB
OCaml
58 lines
1.8 KiB
OCaml
(**************************************************************************)
|
|
(* *)
|
|
(* Heptagon *)
|
|
(* *)
|
|
(* Author : Marc Pouzet *)
|
|
(* Organization : Demons, LRI, University of Paris-Sud, Orsay *)
|
|
(* *)
|
|
(**************************************************************************)
|
|
(* global data in the symbol tables *)
|
|
open Names
|
|
open Types
|
|
open Static
|
|
|
|
(** Warning: Whenever these types are modified,
|
|
interface_format_version should be incremented. *)
|
|
let interface_format_version = "7"
|
|
|
|
(** Node argument *)
|
|
type arg = { a_name : name option; a_type : ty }
|
|
|
|
type param = { p_name : name }
|
|
|
|
(** Node signature *)
|
|
type node =
|
|
{ node_inputs : arg list;
|
|
node_outputs : arg list;
|
|
node_statefull : bool;
|
|
node_params : param list; (** Static parameters *)
|
|
node_params_constraints : size_constr list }
|
|
|
|
type field = { f_name : name; f_type : ty }
|
|
type structure = field list
|
|
|
|
type type_def = | Tabstract | Tenum of name list | Tstruct of structure
|
|
|
|
|
|
let names_of_arg_list l = List.map (fun ad -> ad.a_name) l
|
|
|
|
let types_of_arg_list l = List.map (fun ad -> ad.a_type) l
|
|
|
|
let mk_arg name ty = { a_type = ty; a_name = name }
|
|
|
|
let mk_param name = { p_name = name }
|
|
|
|
|
|
let print_param ff p = Names.print_name ff p.p_name
|
|
|
|
let mk_field n ty =
|
|
{ f_name = n; f_type = ty }
|
|
|
|
let rec field_assoc f = function
|
|
| [] -> raise Not_found
|
|
| { f_name = n; f_type = ty }::l ->
|
|
if shortname f = n then
|
|
ty
|
|
else
|
|
field_assoc f l
|