Benjamin_Loison/Synchronous_reactive_systems
1
0
Fork 0
Code Issues 7 Pull Requests Packages Projects Releases Wiki Activity

[ast2C] init or not init (field added to the state of the node)

Browse Source
This commit is contained in:
dsac 2022-12-17 16:35:49 +01:00
parent bb99a5882b
commit 6291957be5
3 changed files with 6 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/c_utils.ml
View File

@ -20,6 +20,7 @@ open Ast
int ivars[nt_nb_int]; (or nothing if nt_nb_int = 0) int ivars[nt_nb_int]; (or nothing if nt_nb_int = 0)
int bvars[nt_nb_bool]; (or nothing if nt_nb_bool = 0) int bvars[nt_nb_bool]; (or nothing if nt_nb_bool = 0)
int rvars[nt_nb_real]; (or nothing if nt_nb_real = 0) int rvars[nt_nb_real]; (or nothing if nt_nb_real = 0)
bool is_init;
} t_state_<node name>; } t_state_<node name>;
*) *)
type node_state = type node_state =

8
src/cprint.ml
View File

@ -5,9 +5,9 @@ let cp_node_state fmt (st: node_state) =
let maybeprint fmt (ty, nb, name): unit = let maybeprint fmt (ty, nb, name): unit =
if nb = 0 if nb = 0
then () then ()
else Format.fprintf fmt "\n\t%s %s[%d]" ty name nb else Format.fprintf fmt "\n\t%s %s[%d];" ty name nb
in in
Format.fprintf fmt "typedef struct {%a%a%a\n} %s;\n\n" Format.fprintf fmt "typedef struct {%a%a%a\n\tbool is_init;\n} %s;\n\n"
maybeprint ("int", st.nt_nb_int, "ivars") maybeprint ("int", st.nt_nb_int, "ivars")
maybeprint ("bool", st.nt_nb_bool, "bvars") maybeprint ("bool", st.nt_nb_bool, "bvars")
maybeprint ("double", st.nt_nb_real, "rvars") maybeprint ("double", st.nt_nb_real, "rvars")
@ -58,6 +58,8 @@ let rec cp_prototypes fmt (nodes, h) =
(** The ollowing function prints the code to remember previous values of (** The ollowing function prints the code to remember previous values of
* variables used with the pre construct. *) * variables used with the pre construct. *)
let cp_prevars fmt (node, h) = let cp_prevars fmt (node, h) =
Format.fprintf fmt
"\n\t/* Remember the values of variables used in the [pre] construct */\n";
let node_st = Hashtbl.find h node.n_name in let node_st = Hashtbl.find h node.n_name in
List.iter List.iter
(fun v -> (** Note that «dst_array = src_array» should hold. *) (fun v -> (** Note that «dst_array = src_array» should hold. *)
@ -68,7 +70,7 @@ let cp_prevars fmt (node, h) =
node_st.nt_prevars node_st.nt_prevars
let rec cp_node fmt (node, h) = let rec cp_node fmt (node, h) =
Format.fprintf fmt "%a\n{\nTODO...\n%a}\n" Format.fprintf fmt "%a\n{\n\t\tTODO...\n\n\tstate->is_init = false;\n%a}\n"
cp_prototype (node, h) cp_prototype (node, h)
cp_prevars (node, h) cp_prevars (node, h)

8
src/test2.node
View File

@ -3,11 +3,3 @@ let
o1 = 10 -> pre (20 -> 30); o1 = 10 -> pre (20 -> 30);
tel tel
node flipflop(i: int) returns (z: int);
var x, y: int; c: bool;
let
c = true fby (not c);
x = 1 on c;
y = 2 on (not c);
z = merge c x y;
tel