Skip to content
Snippets Groups Projects
  1. May 29, 2015
  2. Apr 10, 2015
  3. Oct 02, 2014
  4. Jul 11, 2014
  5. Dec 04, 2013
  6. Sep 20, 2013
  7. Feb 22, 2013
  8. Oct 26, 2012
  9. Dec 05, 2011
  10. Jun 01, 2011
  11. May 19, 2011
  12. Sep 29, 2010
  13. Jul 02, 2010
  14. Apr 14, 2010
  15. Jan 22, 2010
  16. Jan 20, 2010
  17. Jan 13, 2010
  18. May 26, 2009
    • Erwan Jahier's avatar
      Attach the clock of Eff.val_exp to the val_exp itself, instead of · e7ef1b90
      Erwan Jahier authored
      maintaining (ugly and error-prone) hash tables.
      
      That change revealed an untriggered bug in EvalClock.check_args: it was wrong
      to add in subst the substitutions made of the parameters and the arguments (it
      is enough to unify the clocks of the pars and of the args). For instance, consider
      the node (in should_work/clock/clock.lus)
      
         node clock5(x :  bool; y:  bool when x; z: bool when y)
      
      and the call
      
        z2 = clock5(a, b when a, c when e);
      
      I was adding y/b in the subst, which was wrong.
      
      Other minor changes:
       - move const_to_val_eff from Eff to UnifyClock.
       - GetEff.translate_val_exp now returns a substitution, in order to be able
         to unify clock vars and propagate the resulting substitution.
      e7ef1b90
  19. Feb 09, 2009
  20. Feb 04, 2009
  21. Feb 03, 2009
    • Erwan Jahier's avatar
      The structure and array expanser was buggy in presence of polymorphic · cdb52a14
      Erwan Jahier authored
      nodes (e.g., map<<+,2>>). While fixing  that, I put all the functions
      that deals with polymorphism into a new (Eponymous) dedicated module.
      
      The idea to be able to expand polymorphic node is basically the same,
      as the one for printing polymorphic  nodes: we need to wait until the
      type is instanciated (in GetEff).  That delay is implemented by using
      a stack of nodes.
      cdb52a14
  22. Jan 30, 2009
  23. Dec 05, 2008
  24. Nov 28, 2008
Loading