| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| * | DepGraph: support follow node filtering | serpilliere | 2015-03-23 | 1 | -37/+93 | |
| | | ||||||
| * | degraph: remove useless ira creation | Fabrice Desclaux | 2015-03-20 | 1 | -2/+1 | |
| | | ||||||
| * | Depgraph: add step to symbolic execution | Fabrice Desclaux | 2015-03-12 | 1 | -2/+2 | |
| | | ||||||
| * | Depgraph: rename variables | Fabrice Desclaux | 2015-03-12 | 1 | -3/+3 | |
| | | ||||||
| * | Depgraph: exprs in affected_lines must appear only once. | Fabrice Desclaux | 2015-03-12 | 1 | -2/+2 | |
| | | ||||||
| * | Depgraph: Clean each `depnodes` to purge and improve search in `done` | Ajax | 2015-03-06 | 1 | -0/+3 | |
| | | ||||||
| * | Depgraph: Modify the inter block `done` data structure to improve membership ↵ | Ajax | 2015-03-06 | 1 | -3/+4 | |
| | | | | | check | |||||
| * | Depgraph: In `filter_used_nodes`, `used_nodes` can be used as a done set | Ajax | 2015-03-06 | 1 | -0/+3 | |
| | | ||||||
| * | DepGraph: Normalize output by including heads from graph | Camille Mougey | 2015-02-24 | 1 | -2/+7 | |
| | | ||||||
| * | Depgraph: results should be copy of `done` elements | Camille Mougey | 2015-02-24 | 1 | -1/+1 | |
| | | ||||||
| * | Analysis: Introduce DependencyGraph, computing dependencies of elements | Camille Mougey | 2015-02-20 | 1 | -0/+608 | |
| The dependencies are computed through a list of blocs (IRA). APIs `.get*` return an iterator on DiGraph(DependencyNode). Each DiGraph contains only relevant DependencyNode, which stand for an element at a given line in a given basic block. That way, outputs contain each elements involved in the target value computation. Different outputs stand for different path through blocks (loop, ...). This algorithm has been co-developped with @serpillere. | ||||||