by
- remove duplication (add a profile_info function ine Lv6Verbose
- be more efficient (computing Sys.time only when necessary
- control the time-profiling printing via the -dbg flag "profile", and
  not the verbosity level

Ditto for Misc and Compile

(which breaks lurettetop)

nb : Mamadou's change broke some tests (18->53). Empty body is
generated for nodes that have one eq.  I'll fix that later.

nb : the -exec mode was working because I did not use the generated soc,
which was completely wrong.

Note that to do that, I have modified the CURRENT variant of
Lic.val_exp, to attach it the clock the current holds on. Indeed, the
clock is mandatory to generated correct code...

In an ideal world, this clock information may have explicitely been
set by the user ("current(clk_of_X,X)" instead of "current(X)"), but
for historical reason, it is not the case.

Hence, this information is added as soon as it is available, namely,
during clock checking.

Indeed, once the activation condition has been true, and when it is
false it wax returning the default value instead of the previous one.

# of expected passes 		1512 -> 1519
# of unexpected failures	84 -> 78

# 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.

where I've removed the handling of polymorphism.

nb:  unexpected failures	144->143

The arrow soc now has a memory used to hold if the first step has be triggered.

The idea is that
- when it is not in the memory, it is considered as true
- it is set to false after each step is executed

To do that, I've used the (un)expand_profile function defined in SocExec
(and put the in a new module with a more neutral name: SocVar).

expected passes		1116 -> 1121
unexpected failures	282 -> 277

cf git sha 55d3d77c470f416befd16a1b7d47f751eb2171fc of rdbg

(cf 55d3d77c470f416befd16a1b7d47f751eb2171fc)

Also add support to rdbg to perform nonreg test. I do not plug yet it
as it's twice slower. but most of it seems due patch_ecexe. Indeed,
lus2lic -interface compile the whole program just to print the node
interface.

nb: it has detected a couple of existing bugs.

That was quite confusing for rdbg -lurette --*-stdio !!!

Fix a bug in socExec.ml (strangely untriggered before) along the way.

nb : I've finaly understood the performance/out of memory problems I
had for that last 6 months !!!!! It was due to the lurette.cov file
that was getting larger and larger.

ps : the new test pass because the -ei is also buggy (cf a forthcoming change).

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

when the arity of an alias node was wrong.

The test now runs in 150s (versus 417s)

[...] for some reasons, i cannot reproduce the 150s !!!

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=135->131

(to be kind with data plotters).

Add --gen-autotest option that generates  a Lutin file and an oracle Lustre file suitable to compare the result of 2 Lustre compilers

Some work to share the conde that is comon to Lutin/Lurette more properly
via Makefiles and using chmod to avoid editing the wrong files.

+ mv the lus2licRun.ml/mli file to the Lurette git repo.

As far as ldbg is concerned, it only traces the toplevel node, at
call event.

Note that I needed to rename quite a lot of modules to avoid name clashes
between lus2lic.a and ltop.

I've also merged the Verbose module with the one of Lutin so that
they can be shared (there were sharing 95% already).

Also Merge the Global and the MainArg module as they were
(bizzarely) both handling command args options.

I took the data type definition from SocExecValue to define a Data
module that is a strict extension of the Lutin Data module.

The duplicated Genlex module is now also identical to the one of
Lurette.

Quite boring, but simple thanks to the ocaml type system.

Now the arrow in handled as a predef statement; in order to know
if we are at the first step of a node, we do as for condact and
store the value of the first_step var in the current ctx.

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).

nb : programs do run, but I did not check that they run correctly...

Also fix a regression introduced in the previous change where
incorrect ec code was generated for diese.