Camille Mougey 5f1a1e6e4c Analysis: Introduce DependencyGraph, computing dependencies of elements ...

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.

2015-02-20 19:30:49 +01:00

..

__init__.py

Miasm v2

2014-06-03 10:27:56 +02:00

binary.py

analysis: replace wildcard imports

2015-02-18 10:45:26 +01:00

data_analysis.py

analysis: replace wildcard imports

2015-02-18 10:45:26 +01:00

debugging.py

PyLint: Import errors, pointless statements (fds), bad indentation

2015-02-18 20:42:54 +01:00

depgraph.py

Analysis: Introduce DependencyGraph, computing dependencies of elements

2015-02-20 19:30:49 +01:00

disasm_cb.py

analysis: replace wildcard imports

2015-02-18 10:45:26 +01:00

gdbserver.py

Remove vm_ prefix /!\ API MODIF

2014-10-07 17:44:50 +02:00

machine.py

PyLint: Import errors, pointless statements (fds), bad indentation

2015-02-18 20:42:54 +01:00

sandbox.py

Use wrapper named_arguments to log function calls

2015-02-17 12:50:05 +01:00