Changes between Version 16 and Version 17 of Hoopl/Cleanup


Ignore:
Timestamp:
Jan 11, 2016 7:27:13 AM (4 years ago)
Author:
jstolarek
Comment:

Typos

Legend:

Unmodified
Added
Removed
Modified
  • Hoopl/Cleanup

    v16 v17  
    1111  * Forwards analysis starts with a list of entry labels (typically just one), and it makes sense to have an in-flowing fact for each such label.  Yes, it could default to bottom, but it's probably a user error not to supply such a fact.
    1212
    13   * If forwards analysis ''does'' is given a fact for each entry label, ''Hoopl never needs to know the bottom of the lattice''; indeed there doesn't need to ''be'' a bottom.  Hoopl treats the block in dependency order, so it always has an in-flowing fact before it starts to analyse a block.  It needs still a join for the lattice, of course.
     13  * If forwards analysis is given a fact for each entry label, ''Hoopl never needs to know the bottom of the lattice''; indeed there doesn't need to ''be'' a bottom.  Hoopl treats the block in dependency order, so it always has an in-flowing fact before it starts to analyse a block.  It needs still a join for the lattice, of course.
    1414
    1515  * For some analyses, it's quite clumsy to have a bottom element. Consider constant-propagation, where we want to transform
     
    3030
    3131 * Backwards analysis currently takes a list of entry points, so
    32    that it find the reachable code and enumerate it in reverse
     32   that it finds the reachable code and enumerates it in reverse
    3333   order.  But that's ''all'' the entry point list does.  It'd be just fine
    3434   to enumerate ''all the blocks in the graph'' in reverse order, and not supply