diff options
| author | Fabrice Desclaux <fabrice.desclaux@cea.fr> | 2016-03-23 16:29:53 +0100 |
|---|---|---|
| committer | Fabrice Desclaux <fabrice.desclaux@cea.fr> | 2016-03-23 16:38:34 +0100 |
| commit | 8c436da764b0616976c74c43fefd5494d3889ebb (patch) | |
| tree | 0c77d019f6ed232bb4815791047ad98f2039edb6 /miasm2/analysis/depgraph.py | |
| parent | 359357f4c5609cded790c5890c0c0dd7a2cf73d6 (diff) | |
| download | miasm-8c436da764b0616976c74c43fefd5494d3889ebb.tar.gz miasm-8c436da764b0616976c74c43fefd5494d3889ebb.zip | |
Depgraph: use has_loop algorithm to spot data flow loops; fix reg test
Diffstat (limited to 'miasm2/analysis/depgraph.py')
| -rw-r--r-- | miasm2/analysis/depgraph.py | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/miasm2/analysis/depgraph.py b/miasm2/analysis/depgraph.py index aec159aa..b574e421 100644 --- a/miasm2/analysis/depgraph.py +++ b/miasm2/analysis/depgraph.py @@ -252,10 +252,10 @@ class DependencyResult(DependencyState): @property def has_loop(self): - """True if current dictionary has a loop""" + """True iff there is at least one data dependencies cycle (regarding + the associated depgraph)""" if self._has_loop is None: - self._has_loop = (len(self.relevant_labels) != - len(set(self.relevant_labels))) + self._has_loop = self.graph.has_loop() return self._has_loop def irblock_slice(self, irb): |