| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Rename miasm2 to miasm | Fabrice Desclaux | 2019-03-05 | 1 | -1017/+0 |
| | | |||||
| * | Support python2/python3 | Fabrice Desclaux | 2019-03-05 | 1 | -17/+22 |
| | | |||||
| * | Added description | Vladislav Hrčka | 2019-02-08 | 1 | -1/+14 |
| | | | | Added description according to: https://github.com/cea-sec/miasm/pull/963#issuecomment-461737259. Also added docstring for find_path | ||||
| * | Added function find_path_from_src | Vladislav Hrčka | 2019-02-08 | 1 | -0/+22 |
| | | | | The function find_path_from_src does the same as function find_path, but it searches the paths from src to dst, not vice versa like find_path, which might be more efficient in some cases. | ||||
| * | Fix typos & add codespell | Pierre LALET | 2018-12-23 | 1 | -6/+6 |
| | | |||||
| * | adding immediate postdominators computation. | GAJaloyan | 2018-10-26 | 1 | -0/+12 |
| | | |||||
| * | Graph: add reachable stop node | Fabrice Desclaux | 2018-08-06 | 1 | -0/+18 |
| | | |||||
| * | Analysis: Add SSA transformation | Tim Blazytko | 2018-07-09 | 1 | -0/+16 |
| | | | | | Joint work with Niko Schmidt | ||||
| * | Core: replace AsmLabel by LocKey | Fabrice Desclaux | 2018-06-09 | 1 | -3/+4 |
| | | |||||
| * | Fix __ne__ calls | Fabrice Desclaux | 2018-04-19 | 1 | -0/+3 |
| | | |||||
| * | DiGraph: fixed node order in natural loop backedges | Tim Blazytko | 2017-10-18 | 1 | -1/+1 |
| | | |||||
| * | Remove deprecated use of MatchExpr | Ajax | 2017-04-21 | 1 | -1/+1 |
| | | |||||
| * | Graph: add discard_edge | Fabrice Desclaux | 2017-04-21 | 1 | -0/+5 |
| | | |||||
| * | Core/Graph: add loop test | Fabrice Desclaux | 2016-03-23 | 1 | -0/+28 |
| | | |||||
| * | Remove unused variables | Ajax | 2016-02-04 | 1 | -3/+0 |
| | | |||||
| * | Autopep | Fabrice Desclaux | 2016-01-30 | 1 | -10/+15 |
| | | |||||
| * | Tipo: dictionary | Fabrice Desclaux | 2016-01-30 | 1 | -8/+8 |
| | | |||||
| * | Graph: generic html dot code | Fabrice Desclaux | 2016-01-30 | 1 | -21/+91 |
| | | |||||
| * | Introduce MatchGraph, the counterpart of MatchExpr for DiGraph | Ajax | 2016-01-27 | 1 | -0/+248 |
| | | |||||
| * | Graph: introduce GraphSimplifier, counterpart of ExpressionSimplifier | Ajax | 2016-01-26 | 1 | -0/+34 |
| | | | | | for Graph | ||||
| * | Graph: add_node return the previous status | Ajax | 2016-01-25 | 1 | -1/+6 |
| | | |||||
| * | Graph; introduce copy and merge | Ajax | 2016-01-25 | 1 | -0/+19 |
| | | |||||
| * | Graph: two graphs are equals if they have the same nodes and edges | Ajax | 2016-01-25 | 1 | -0/+7 |
| | | |||||
| * | DiGraph: refactored compute_strongly_connected_components | Tim Blazytko | 2015-09-06 | 1 | -18/+22 |
| | | |||||
| * | DiGraph: refactored compute_strongly_connected_components | Tim Blazytko | 2015-09-05 | 1 | -6/+6 |
| | | |||||
| * | DiGraph: fixed typo | Tim Blazytko | 2015-09-04 | 1 | -2/+2 |
| | | |||||
| * | DiGraph: added algorithm to retrieve the strongly connected components of a ↵ | Tim Blazytko | 2015-09-04 | 1 | -0/+73 |
| | | | | | graph | ||||
| * | DiGraph: added natural loop detection | Tim Blazytko | 2015-09-04 | 1 | -0/+52 |
| | | |||||
| * | DiGraph: added breadth and depth first traversals | Tim Blazytko | 2015-09-04 | 1 | -0/+39 |
| | | |||||
| * | DiGraph: compute_immediate_dominators depends now on walk_dominators | Tim Blazytko | 2015-06-02 | 1 | -7/+2 |
| | | |||||
| * | DiGraph: fixed order in dominance_frontier | Tim Blazytko | 2015-06-02 | 1 | -3/+3 |
| | | |||||
| * | DiGraph: refactored comments | Tim Blazytko | 2015-06-02 | 1 | -4/+11 |
| | | |||||
| * | DiGraph: renamed variables in dominance frontier and immediate dominators | Tim Blazytko | 2015-06-02 | 1 | -14/+14 |
| | | |||||
| * | DiGraph: fixed dominance_frontier for graphs with multiple heads | Tim Blazytko | 2015-06-02 | 1 | -0/+2 |
| | | |||||
| * | graph.py: replaced line for readability | Tim Blazytko | 2015-06-02 | 1 | -1/+1 |
| | | |||||
| * | graph.py: added computation of the dominance frontier | Tim Blazytko | 2015-06-02 | 1 | -0/+23 |
| | | |||||
| * | graph.py: added computation of immediate dominators | Tim Blazytko | 2015-06-02 | 1 | -0/+12 |
| | | |||||
| * | Core/Graph: add walk_dominator/walk_postdominator | Fabrice Desclaux | 2015-06-02 | 1 | -0/+71 |
| | | |||||
| * | Graph: replace forgotten root api | Fabrice Desclaux | 2015-04-29 | 1 | -2/+2 |
| | | |||||
| * | DiGraph: Refactoring | Ajax | 2015-04-28 | 1 | -64/+59 |
| | | |||||
| * | DepGraph: Speed up 'add_uniq_edge' in the mean case | Ajax | 2015-04-28 | 1 | -5/+5 |
| | | |||||
| * | DiGraph: Refactor internal structures to avoid duplication | Ajax | 2015-04-28 | 1 | -8/+8 |
| | | |||||
| * | DiGraph: Ambiguous name for internal structures | Ajax | 2015-04-28 | 1 | -15/+17 |
| | | |||||
| * | Graph: factorize dominator/postdominator code | serpilliere | 2015-03-13 | 1 | -63/+37 |
| | | |||||
| * | Graph: add postdominators computation | Fabrice Desclaux | 2015-03-12 | 1 | -0/+42 |
| | | |||||
| * | Graph: dominators computation can only be done regarding to *one* head | Fabrice Desclaux | 2015-03-12 | 1 | -27/+42 |
| | | | | | The 'get_all_parents' is replaced by 'reachable_parents' | ||||
| * | DiGraph: Inherite DiGraph from `object` | Camille Mougey | 2015-02-20 | 1 | -1/+1 |
| | | |||||
| * | Graph: add dominators computation | Fabrice Desclaux | 2015-01-18 | 1 | -0/+52 |
| | | |||||
| * | Add docstring/Fix variable name | Fabrice Desclaux | 2015-01-09 | 1 | -7/+10 |
| | | |||||
| * | Graph: Add get_all_parents/del_node | Fabrice Desclaux | 2015-01-09 | 1 | -0/+22 |
| | | |||||