- Jan 14, 2016
-
-
Erwan Jahier authored
Ditto for Misc and Compile
-
- Sep 25, 2015
-
-
Erwan Jahier authored
-
- Sep 23, 2015
-
-
Erwan Jahier authored
-
Erwan Jahier authored
Also, do not set the seed when comparing compilers.
-
- Sep 21, 2015
-
-
Erwan Jahier authored
-
- Aug 20, 2015
-
-
Erwan Jahier authored
-
- Aug 17, 2015
-
-
Erwan Jahier authored
Indeed, otherwise, in some cases, rdbg or lurette migth not realise that lus2lic exited in error.
-
- Jul 10, 2015
-
-
Erwan Jahier authored
Fix the bug detected in the previous commit where type instance were not propagated in package obtained from a model instance.
-
Erwan Jahier authored
More precisely, issuing an "exit 2" is not enough for the should_work proc in test/site.exp to state that the test fails. That fix revealed a certain number of bad programs. Some were not really wrong ; there were just not respecting the naming convention used to automated the test (i.e., main node name = file name). It also releaved a real bug due to the fact that type instanciatiation is not propagated during model instanciatiation, where creates a loop between (Lic2soc.process_node and Lic2soc.soc_of_node). Indeed it searches in the soc the table for an abstract profile.
-
Mamadou Ndiaye authored
-
- Jul 07, 2015
-
-
Erwan Jahier authored
-
- Jul 06, 2015
-
-
Pascal Raymond authored
* la syntaxe est changee pour l'accepter * la stucture IdSolver (compil "lazy") contient maintenant "all_srcs" qui permet d'acceder si besoin a n'importe quelle info source, notamment les params statiques des noeuds identifies par "Pack::name"
-
- Jul 03, 2015
-
-
Mamadou Ndiaye authored
-
- Jul 01, 2015
-
-
Erwan Jahier authored
-
Mamadou Ndiaye authored
-
- Jun 25, 2015
-
-
Erwan Jahier authored
-
- Jun 24, 2015
-
-
Mamadou Ndiaye authored
-
Erwan Jahier authored
To run it, just launch just: cd test/ make test.kcg
-
- Jun 23, 2015
-
-
Erwan Jahier authored
(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.
-
Erwan Jahier authored
(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.
-
- Jun 18, 2015
-
-
Erwan Jahier authored
-
- May 22, 2015
-
-
Erwan Jahier authored
lus2lic -h shows the basic options lus2lic -more shows more experimental options lus2lic -dev shows experimental/internal options
-
- Apr 10, 2015
-
-
Erwan Jahier authored
Indeed, I've missed that case and have no nonreg test for -2ch
-
Erwan Jahier authored
that I should have catched then. Sigh. only affect array concat
-
Erwan Jahier authored
by grouping instances of the same type into arrays. The rationale is to be able to generate for loops with iterators. The previous code was working, but probably by chance.
-
- Apr 08, 2015
-
-
Erwan Jahier authored
-
Erwan Jahier authored
Actually, that was the default behavior. Now the default behavior is to generate loops for iterators. nb : with -2ch, loops are still always inlined
-
- Mar 30, 2015
-
-
Erwan Jahier authored
Indeed, an iterator is a kind of node.
-
- Mar 24, 2015
-
-
Erwan Jahier authored
combined with -cc, actually computes the wcet. nb : only works if wcet tools are installed (owcet.arm, arm-elf-gcc)
-
Erwan Jahier authored
combined with -cc, actually computes the wcet. nb : only works if wcet tools are installed (owcet.arm, arm-elf-gcc)
-
- Mar 20, 2015
-
-
Erwan Jahier authored
-
- Mar 18, 2015
-
-
Erwan Jahier authored
Indeed, in order to sort Soc.gao, I currently process in 3 stages ; 1. compute a total ordering of Actions.t according to the deps 2. transform Actions.t into Soc.gao (List.map) 3. factorize Soc.gao by looking at consecutive gao that have the same guard With this change, between steps 1 and 2, I reorder the list of actions so that group of independent actions are sorted according to their clock. The idea is of course to provide to step 3 more opportunities of factorization. The result is not very convincing yet. I've also tried to sort the actions wrt their clock before performing the toposort. Seems not too bad. I've kept the old behavior by default though.
-
- Mar 03, 2015
-
-
Erwan Jahier authored
-
Erwan Jahier authored
Indeed, having two different mechanisms is bad. In the end, I've kept mine (and not the one of Pascal), because the it was depending on LicPrg.t, which was creating a circular dep (which could of course be fixed, but I am lazy).
-
- Feb 27, 2015
-
-
Erwan Jahier authored
-
- Feb 24, 2015
-
-
Erwan Jahier authored
e.g., for arrays. No test actually catches this bug.
-
- Feb 23, 2015
-
-
Erwan Jahier authored
Now all the tests that were ok in the heap mode are also ok in the stack mode ! However the code generated for programs that use fillred and co is weird. For instance, in should_work.pipeline.lus, in fillred_oneStep_pipe_10_step, accu_in is used both as an input and an output, which seems wrong in the stack mode as no copy is performed. Is it working by chance ?
-
- Feb 13, 2015
-
-
Erwan Jahier authored
Now all the tests that were ok in the heap mode are also ok in the stack mode ! However the code generated by fillred and co is weird. For instance, in should_work.pipeline.lus, in fillred_oneStep_pipe_10_step, accu_in is used both as an input and an output, which seems wrong in the stack mode as no copy is performed. Is it working by chance ?
-
Erwan Jahier authored
Indeed, in order to copy an array, I used to generate something like memcpy(out, in, sizeof(in)); but if 'out' and 'in' are arrays, and if 'in' is an argument of a function, sizeof() considers it as a pointer, not an array !!!! note that if 'in' is a local var, sizeof(in) works fine. To fix it, I use the type of the dest (instead of the id) as argument of sizeof. nb : The pb never occured before, as in the heap mode only the ctx is passed a args of step functions.
-
- Feb 12, 2015
-
-
Erwan Jahier authored
There were problems with: - a clash in the node_loop.c file with the local 's' counter (oups). - code generated for boolred - code generated for arrow on arrays
-