Commit 5e4a6059 authored by Maxime Perrotin's avatar Maxime Perrotin
Browse files

Added complex nested type in test9

parent e0e6fac4
/* CIF PROCESS (150, 150), (150, 75) */ /* CIF PROCESS (150, 150), (150, 75) */
PROCESS challenge; PROCESS challenge;
/* CIF TEXT (-187, 64), (254, 104) */ /* CIF TEXT (0, 26), (502, 179) */
procedure test; procedure test;
fpar in first t_UInt8, fpar in first t_UInt8,
in/out second t_boolean; in/out second t_boolean;
external; external;
dcl testvalue t_boolean := true; dcl testvalue t_boolean := true;
/* CIF ENDTEXT */
/* CIF TEXT (587, 91), (298, 120) */
dcl count, actual_count CountTab; dcl nested Nested := {a {b {c {p {x 1, y 2}, l {3, 4}}}}};
/* CIF ENDTEXT */
/* CIF TEXT (922, 91), (298, 120) */
dcl count, actual_count CountTab;
dcl pow_value T_UInt32 := 0; dcl pow_value T_UInt32 := 0;
dcl check T_UInt8; dcl check T_UInt8;
dcl bitwise SeqBit; dcl bitwise SeqBit;
dcl bitwise2 SeqBit2; dcl bitwise2 SeqBit2;
dcl boolwise t_Boolean; dcl boolwise t_Boolean;
/* CIF ENDTEXT */ /* CIF ENDTEXT */
/* CIF START (337, 14), (68, 37) */ /* CIF START (672, 14), (68, 37) */
START; START;
/* CIF TASK (279, 66), (184, 72) */ /* CIF TASK (614, 66), (184, 72) */
TASK for x in count: TASK for x in count:
count(x) := count_max count(x) := count_max
actual_count(x) := 0 actual_count(x) := 0
endfor; endfor;
/* CIF NEXTSTATE (336, 153), (70, 35) */ /* CIF TASK (557, 153), (298, 35) */
NEXTSTATE Wait; TASK nested := {a {b {c {p {x 1, y 2}, l {3, 4}}}}};
/* CIF STATE (585, 11), (68, 35) */ /* CIF NEXTSTATE (671, 203), (70, 35) */
STATE Wait; NEXTSTATE Wait;
ENDSTATE; /* CIF STATE (760, 11), (68, 35) */
STATE Wait;
/* CIF STATE (336, 153), (70, 35) */ ENDSTATE;
STATE Wait; /* CIF STATE (671, 203), (70, 35) */
/* CIF INPUT (336, 208), (70, 35) */ STATE Wait;
INPUT run; /* CIF INPUT (671, 258), (70, 35) */
/* CIF PROCEDURECALL (288, 258), (166, 35) */ INPUT run;
CALL writeln('Computing'); /* CIF PROCEDURECALL (623, 308), (166, 35) */
/* CIF TASK (165, 308), (412, 216) */ CALL writeln('Computing');
TASK for x in range(exceed_nb): /* CIF TASK (500, 358), (412, 216) */
TASK for x in range(exceed_nb):
for n in range(nb_bit): for n in range(nb_bit):
call pow(2, n, pow_value); call pow(2, n, pow_value);
check := if val_max - x>0 and pow_value>0 then 1 else 0 fi check := if val_max - x>0 and pow_value>0 then 1 else 0 fi
...@@ -50,7 +54,7 @@ TASK for x in range(exceed_nb): ...@@ -50,7 +54,7 @@ TASK for x in range(exceed_nb):
call test((n+1) mod 255, testvalue); call test((n+1) mod 255, testvalue);
endfor endfor
endfor; endfor;
/* CIF NEXTSTATE (336, 539), (70, 35) */ /* CIF NEXTSTATE (671, 589), (70, 35) */
NEXTSTATE wait; NEXTSTATE wait;
ENDSTATE; ENDSTATE;
ENDPROCESS challenge; ENDPROCESS challenge;
\ No newline at end of file
...@@ -18,6 +18,28 @@ OctString ::= OCTET STRING (SIZE(4)) ...@@ -18,6 +18,28 @@ OctString ::= OCTET STRING (SIZE(4))
SeqBit ::= SEQUENCE (SIZE(32)) OF BOOLEAN SeqBit ::= SEQUENCE (SIZE(32)) OF BOOLEAN
SeqBit2 ::= SEQUENCE (SIZE(1..32)) OF BOOLEAN SeqBit2 ::= SEQUENCE (SIZE(1..32)) OF BOOLEAN
Int32 ::= INTEGER (-2147483648 .. 2147483647)
Point ::= SEQUENCE {
x Int32,
y Int32
}
List ::= SEQUENCE (SIZE (2)) OF Int32
Nested ::= SEQUENCE {
a SEQUENCE {
b SEQUENCE {
c SEQUENCE {
p Point,
l List
}
}
}
}
END END
TASTE-Dataview DEFINITIONS ::= TASTE-Dataview DEFINITIONS ::=
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment