Changes between Version 1 and Version 2 of Commentary/Hpc


Ignore:
Timestamp:
Dec 5, 2006 5:50:15 PM (7 years ago)
Author:
AndyGill
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Commentary/Hpc

    v1 v2  
    2929The reason we do not translate tick boxes using. 
    3030{{{ 
    31  if e then (tick a e1) else (tick b e2) 
     31 if e then (tick a True) else (tick b False) 
    3232}}} 
    33 is tick<a> e1 is a CAF, and gets lifted to top level. This maintain the coverage information, but does not allow for entry counting. If the if/then/else is called 100 times, and no exceptions were thrown, then you would expect the binary tick count to add up to 100. We hope to use Hpc to do path optimization in the future, so real numbers are important. 
     33is tick<a> True is a CAF, and gets lifted to top level. This maintain the coverage information, but does not allow for entry counting. If the if/then/else is called 100 times, and no exceptions were thrown, then you would expect the binary tick count to add up to 100. We hope to use Hpc to do path optimization in the future, so real numbers are important. 
    3434  
    35 Also, we translate the tick late to allow case-of-case to work, allowing unboxed compares to work without generating boolean intermeduates. We still need to push one optimzation into the simpifier for this to work. 
     35Also, we translate the tick late to allow case-of-case to work, allowing unboxed compares to work without generating boolean intermeduates. We still need to push one optimzation into the simpifier for this to work well.