# of unexpected failures	101->109

but actually, some new test passes causes several other failing test
to be tried, so it is not really a regression.

In other words, consider ">" and co as overloaded operators, not polymorphic ones.

For instance,
  node toto = map<<Lustre::if,  N>>(x, a, b);
is rejected.

The problem with this change is that we now also reject equations such as
   res = map<<+,  N>>(x, a, b);

which could be avoided. Probably L2lRmPoly does its job partially.

nb:  unexpected failures 127 -> 125

nb:  unexpected failures	144->143

The first one in Soc2cIdent.type_to_short_string when enum and int were both
translated by "i" ; as a consequence, some different soc ctx get the same name.

The second one was due to the fact that car ident in gao switches were
printed incorrectly (missing "ctx->" or "node_no_mem_ctx.").

nb:  unexpected failures 162-> 149

nb: 20 more tests passes.

Always use Soc2cPredef.gen_assign to generate var assignments.

Also, use affection for assigning structures.

nb: 21 more tests passes.

Also do not crash if the soc contains reference to extern types.

It generates C code that compile on at least one example.

Add the modes3x2 exemple of Pascal (its version + a la V6 version).

Fix the doc wrt the merge exemple (the tex was refering to a
non-existant file).

cf git sha 55d3d77c470f416befd16a1b7d47f751eb2171fc of rdbg

More precisely, it was always returning the default value when the
activation condition was false instead of returning "dft_val fby out".

A few Array.copy were necessary when updating the memory.

Actually, it was a misunderstanding of mine (R1) ; the behavior was consistent
with the lv6 doc, but not with the v4 behavior...

Indeed, # means "at most 1 among n", not "exactly one among n" as I tought...

nb: test run on trieves, not triglav that is down, so the time is meaningless

Also, check programs that should fail using lurette instead of just
lus2lic. Indeed, some programs are only suposed to fail at runtime.

Change the main node names of prog in should_fail as it is necessary
for Lurette non-reg scheme

By redirecting the stderr of ecexe onto stdout, ecexe now terminate properly when called from lurette.

Hence, I have no more unresolved test (they are now failures) and the exec
time is now 98s (versus 217!!)

Some failures were actually due to wrong programs (mved to should_fail/semantics)

nb : the change has actually been done in lurette.

when the arity of an alias node was wrong.

  #fail: 83 -> 81

itself calls another node on a non-trivial clock (i.e., using a when)
was not producing correct code.

I've fixed this by performing the fix-point on nodes rather than on
equations. Indeed its more natural and efficient, and it avoid the
problem above. However, I did not really fix the problem, but just
turn around it. All tests seems to work fine though.

nb : #FAILS=81->80 (and -2 unresolved, but because I fixed the prog)

Indeed, I've intentionally removed the when statements in clocked local var like this :

 var
    v:int;

because the following was producing a syntax error in ecexe:

 var
    v:int when c;

But Actually, the right thing to do was to generate the following:

 var
    (v:int) when c;

...

nb : #FAILS=90->89

nb : #FAILS=128->90

I though polymorphism was removed by l2lRmPoly.ml, but well, it was easy.

nb : #FAILS=131->128

nb : #FAILS=135->131

where equations such as " ok = (x=x_ref); " are translated into incorrect v' lustre
when x is a structure or an array.

nb : #FAILS=152->135

Actually it does not fix any test, but I feel it is a (slight)
progress, so I commit it... Well, to be fair, one objective progress
is that I can now compile the test suite with the -np option.

In order to do that, I've generalised the type of merge : now the clock
argument can be any expression. Some assert false still prevent its use,
but it should be easy to get rid of them (I'll do that latter).

In order to do that, I've generalised the type of merge : now the clock
argument can be any expression. Some assert false still prevent its use,
but it should be easy to get rid of them (I'll do that latter).

BTW, put everything that concerns node environement into the new
IdSolver module (from the Lic module).