Basically, I've missed some substitutions in Merge and in clocks.

This one was spotted by willie.

More precisely, it was introduced here ea40dfa0
when addind the -enc option.

Indeed, in -ec, since them I've decided to only output the main
node. Hence when no main is specified, one was taken at random. But
it the chosen nide is a predef one, no code is generated !

To fix this, I now chose a user def node.

More precisely, it was introduced here 6c7bc562

bug1: Soc2cGenAssign.f was calling Soc2cIdent.type_to_short_string,
which was generating bad idents (ie, containing "::").

bug2 : some _assign_array_types macro def were missing.

to be continued...

For the time being, we simple try to factorise out the test of
consecutive gao that holds on the same clock.

ps : also fix a pb (infinite loop in SortActions.topo_sort)
introduced in the previous change that, for a strange reason
(Makefile issue), was not catched by the test (almost all test were
failing !!).

pps : it actually seems to break quite a lot of test, but its my test
script that wrong ! since version 527 (we are 534), the compiler used
to perform the test in the tmp dirs is not upadated ! (well it is,
but on the wrong machine...).

I commit this change still as it introduces no more test failures.

Indeed, computing the dependencies and choosing an order for actions
(that may optimize test openning in the near futurea) are 2 different
things.

i.e., by providing a default macro definition that uses memcpy()
(versus generating a nop function).

As suggested by Willie, it allows it to be specialized when it is
called more than once.

The rationale is to prepare the work for a future --2s-stack option.

Instead, print a warning and consider the input as unbound.
Is it really the right thing to do?

cf git sha 55d3d77c470f416befd16a1b7d47f751eb2171fc of rdbg

cf git sha 142783a77cad1a0f7ef91972b8376f0b0e44b878 of rdbg

(cf 55d3d77c470f416befd16a1b7d47f751eb2171fc)

Some generated intermediary variables where declared as int instead
of bool.  Funnily, ecexe was ok with that...

More specifically, replace @ by rev_append and flatten+map by fold_left.

On a file that has 11000 equations (normal.ec), I win a factor 4: 60s -> 15s

The main difference is that I use a map instead of list to store
visited nodes.  The compilation time of normal.ec is divided by 2!!
(35s->15s)

We do not really see the difference in the time of the non-reg tests
since the execution of normal.ec still exceeds the 10s timeouts.

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.