about summary refs log tree commit diff stats
path: root/miasm2/analysis/depgraph.py (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Ir: make AssignBlock immutableFabrice Desclaux2017-04-201-3/+3
|
* Core/asmbloc: move asmbloc to asmblockFabrice Desclaux2017-03-131-1/+1
|
* Asmbloc: rename asm_label to AsmLabelFabrice Desclaux2017-03-131-8/+8
|
* IR: rename blocs to blocksFabrice Desclaux2017-03-131-3/+3
|
* IR/ir: rename irbloc to IRBlockFabrice Desclaux2017-03-131-3/+3
|
* IR/Symbexec: rename symbexec to SymbolicExecutionEngineFabrice Desclaux2017-03-131-3/+3
|
* DepGraph: fix emulationFabrice Desclaux2017-01-091-18/+30
|
* DepGraph: clean stepFabrice Desclaux2016-12-231-14/+3
|
* Depgraph: use has_loop algorithm to spot data flow loops; fix reg testFabrice Desclaux2016-03-231-3/+3
|
* DependencyGraph: emul minimum effectsFabrice Desclaux2016-03-211-20/+29
|
* Depgraph: updt apiFabrice Desclaux2016-03-211-17/+16
|
* Depgraph: implicit emulFabrice Desclaux2016-03-171-3/+112
|
* Depgraph: simplified algorithmFabrice Desclaux2016-03-171-680/+175
|
* AssignBlockFabrice Desclaux2016-02-261-5/+5
|
* Tipo: dictionaryFabrice Desclaux2016-01-301-7/+7
|
* IR: replace `.g` with a lazy built `.graph`, avoiding the need of `gen_graph`Ajax2015-12-071-5/+1
|
* Depgraph: fix nameFabrice Desclaux2015-10-051-1/+2
|
* Depgraph: fix follow mem/callFabrice Desclaux2015-10-051-37/+49
|
* Analysis/depgraph: improve get_modifiers complexityFabrice Desclaux2015-08-271-34/+46
|
* Analysis/depgraph: use slots to be memory friendlyFabrice Desclaux2015-08-261-0/+6
|
* Analysis/Depgraph: Coding convention and cleanupsCaroline Leman2015-08-241-20/+32
|
* Analysis/Depgraph: Remove duplicates treatmentsCaroline Leman2015-08-241-7/+25
|
* Analysis/Depgraph: pylint and pep8 compliance + docstringsCaroline Leman2015-08-051-54/+86
|
* Analysis/Depgraph: DependecyGraph precision improvement + regressions tests.Caroline Leman2015-08-051-27/+168
| | | | | | | | | The DependencyNodes are now distincts, in order to handle dependency loops p (cf test graph 13) The emulation part of DependencyResult will emulate the value along the path specified by the DependencyGraph (loops included). This commit includes depgraph regression tests.
* replaced redundant codeTim Blazytko2015-04-301-1/+1
|
* fixed typoTim Blazytko2015-04-301-2/+2
|
* Depgraph: Simplify the implicit algorithm (creds @serpilliere)Ajax2015-04-281-29/+24
|
* DepGraph: Avoid failing if z3 is not presentAjax2015-04-281-1/+4
|
* DepGraph: Introduce implicit result management, with constraint solving APIAjax2015-04-281-1/+70
|
* DepGraphResult: Add an initial context optionAjax2015-04-271-2/+7
|
* DepGraph: Introduce the `implicit` optionAjax2015-04-241-3/+30
|
* DepGraph: Extend FollowExpr to include relative methodsAjax2015-04-241-20/+33
|
* DepGraph: Refactor internals APIAjax2015-04-241-12/+19
|
* DepGraph: support follow node filteringserpilliere2015-03-231-37/+93
|
* degraph: remove useless ira creationFabrice Desclaux2015-03-201-2/+1
|
* Depgraph: add step to symbolic executionFabrice Desclaux2015-03-121-2/+2
|
* Depgraph: rename variablesFabrice Desclaux2015-03-121-3/+3
|
* Depgraph: exprs in affected_lines must appear only once.Fabrice Desclaux2015-03-121-2/+2
|
* Depgraph: Clean each `depnodes` to purge and improve search in `done`Ajax2015-03-061-0/+3
|
* Depgraph: Modify the inter block `done` data structure to improve membership ↵Ajax2015-03-061-3/+4
| | | | check
* Depgraph: In `filter_used_nodes`, `used_nodes` can be used as a done setAjax2015-03-061-0/+3
|
* DepGraph: Normalize output by including heads from graphCamille Mougey2015-02-241-2/+7
|
* Depgraph: results should be copy of `done` elementsCamille Mougey2015-02-241-1/+1
|
* Analysis: Introduce DependencyGraph, computing dependencies of elementsCamille Mougey2015-02-201-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.