about summary refs log tree commit diff stats
path: root/miasm2/core/graph.py (follow)
Commit message (Expand)AuthorAgeFilesLines
* Rename miasm2 to miasmFabrice Desclaux2019-03-051-1017/+0
* Support python2/python3Fabrice Desclaux2019-03-051-17/+22
* Added descriptionVladislav Hrčka2019-02-081-1/+14
* Added function find_path_from_srcVladislav Hrčka2019-02-081-0/+22
* Fix typos & add codespellPierre LALET2018-12-231-6/+6
* adding immediate postdominators computation.GAJaloyan2018-10-261-0/+12
* Graph: add reachable stop nodeFabrice Desclaux2018-08-061-0/+18
* Analysis: Add SSA transformationTim Blazytko2018-07-091-0/+16
* Core: replace AsmLabel by LocKeyFabrice Desclaux2018-06-091-3/+4
* Fix __ne__ callsFabrice Desclaux2018-04-191-0/+3
* DiGraph: fixed node order in natural loop backedgesTim Blazytko2017-10-181-1/+1
* Remove deprecated use of MatchExprAjax2017-04-211-1/+1
* Graph: add discard_edgeFabrice Desclaux2017-04-211-0/+5
* Core/Graph: add loop testFabrice Desclaux2016-03-231-0/+28
* Remove unused variablesAjax2016-02-041-3/+0
* AutopepFabrice Desclaux2016-01-301-10/+15
* Tipo: dictionaryFabrice Desclaux2016-01-301-8/+8
* Graph: generic html dot codeFabrice Desclaux2016-01-301-21/+91
* Introduce MatchGraph, the counterpart of MatchExpr for DiGraphAjax2016-01-271-0/+248
* Graph: introduce GraphSimplifier, counterpart of ExpressionSimplifierAjax2016-01-261-0/+34
* Graph: add_node return the previous statusAjax2016-01-251-1/+6
* Graph; introduce copy and mergeAjax2016-01-251-0/+19
* Graph: two graphs are equals if they have the same nodes and edgesAjax2016-01-251-0/+7
* DiGraph: refactored compute_strongly_connected_componentsTim Blazytko2015-09-061-18/+22
* DiGraph: refactored compute_strongly_connected_componentsTim Blazytko2015-09-051-6/+6
* DiGraph: fixed typoTim Blazytko2015-09-041-2/+2
* DiGraph: added algorithm to retrieve the strongly connected components of a g...Tim Blazytko2015-09-041-0/+73
* DiGraph: added natural loop detectionTim Blazytko2015-09-041-0/+52
* DiGraph: added breadth and depth first traversalsTim Blazytko2015-09-041-0/+39
* DiGraph: compute_immediate_dominators depends now on walk_dominatorsTim Blazytko2015-06-021-7/+2
* DiGraph: fixed order in dominance_frontierTim Blazytko2015-06-021-3/+3
* DiGraph: refactored commentsTim Blazytko2015-06-021-4/+11
* DiGraph: renamed variables in dominance frontier and immediate dominatorsTim Blazytko2015-06-021-14/+14
* DiGraph: fixed dominance_frontier for graphs with multiple headsTim Blazytko2015-06-021-0/+2
* graph.py: replaced line for readabilityTim Blazytko2015-06-021-1/+1
* graph.py: added computation of the dominance frontierTim Blazytko2015-06-021-0/+23
* graph.py: added computation of immediate dominatorsTim Blazytko2015-06-021-0/+12
* Core/Graph: add walk_dominator/walk_postdominatorFabrice Desclaux2015-06-021-0/+71
* Graph: replace forgotten root apiFabrice Desclaux2015-04-291-2/+2
* DiGraph: RefactoringAjax2015-04-281-64/+59
* DepGraph: Speed up 'add_uniq_edge' in the mean caseAjax2015-04-281-5/+5
* DiGraph: Refactor internal structures to avoid duplicationAjax2015-04-281-8/+8
* DiGraph: Ambiguous name for internal structuresAjax2015-04-281-15/+17
* Graph: factorize dominator/postdominator codeserpilliere2015-03-131-63/+37
* Graph: add postdominators computationFabrice Desclaux2015-03-121-0/+42
* Graph: dominators computation can only be done regarding to *one* headFabrice Desclaux2015-03-121-27/+42
* DiGraph: Inherite DiGraph from `object`Camille Mougey2015-02-201-1/+1
* Graph: add dominators computationFabrice Desclaux2015-01-181-0/+52
* Add docstring/Fix variable nameFabrice Desclaux2015-01-091-7/+10
* Graph: Add get_all_parents/del_nodeFabrice Desclaux2015-01-091-0/+22