Brad Bishop | 6e60e8b | 2018-02-01 10:27:11 -0500 | [diff] [blame] | 1 | # Copyright (C) 2016 Intel Corporation |
| 2 | # Released under the MIT license (see COPYING.MIT) |
| 3 | |
| 4 | from unittest import SkipTest |
| 5 | |
| 6 | from oeqa.core.exception import OEQADependency |
| 7 | |
| 8 | from . import OETestDiscover, registerDecorator |
| 9 | |
| 10 | def _add_depends(registry, case, depends): |
| 11 | module_name = case.__module__ |
| 12 | class_name = case.__class__.__name__ |
| 13 | |
| 14 | case_id = case.id() |
| 15 | |
| 16 | for depend in depends: |
| 17 | dparts = depend.split('.') |
| 18 | |
| 19 | if len(dparts) == 1: |
| 20 | depend_id = ".".join((module_name, class_name, dparts[0])) |
| 21 | elif len(dparts) == 2: |
| 22 | depend_id = ".".join((module_name, dparts[0], dparts[1])) |
| 23 | else: |
| 24 | depend_id = depend |
| 25 | |
| 26 | if not case_id in registry: |
| 27 | registry[case_id] = [] |
| 28 | if not depend_id in registry[case_id]: |
| 29 | registry[case_id].append(depend_id) |
| 30 | |
| 31 | def _validate_test_case_depends(cases, depends): |
| 32 | for case in depends: |
| 33 | if not case in cases: |
| 34 | continue |
| 35 | for dep in depends[case]: |
| 36 | if not dep in cases: |
| 37 | raise OEQADependency("TestCase %s depends on %s and isn't available"\ |
| 38 | ", cases available %s." % (case, dep, str(cases.keys()))) |
| 39 | |
| 40 | def _order_test_case_by_depends(cases, depends): |
| 41 | def _dep_resolve(graph, node, resolved, seen): |
| 42 | seen.append(node) |
| 43 | for edge in graph[node]: |
| 44 | if edge not in resolved: |
| 45 | if edge in seen: |
| 46 | raise OEQADependency("Test cases %s and %s have a circular" \ |
| 47 | " dependency." % (node, edge)) |
| 48 | _dep_resolve(graph, edge, resolved, seen) |
| 49 | resolved.append(node) |
| 50 | |
| 51 | dep_graph = {} |
| 52 | dep_graph['__root__'] = cases.keys() |
| 53 | for case in cases: |
| 54 | if case in depends: |
| 55 | dep_graph[case] = depends[case] |
| 56 | else: |
| 57 | dep_graph[case] = [] |
| 58 | |
| 59 | cases_ordered = [] |
| 60 | _dep_resolve(dep_graph, '__root__', cases_ordered, []) |
| 61 | cases_ordered.remove('__root__') |
| 62 | |
| 63 | return [cases[case_id] for case_id in cases_ordered] |
| 64 | |
| 65 | def _skipTestDependency(case, depends): |
Brad Bishop | 1a4b7ee | 2018-12-16 17:11:34 -0800 | [diff] [blame^] | 66 | for dep in depends: |
| 67 | found = False |
| 68 | for test, _ in case.tc.results.successes: |
| 69 | if test.id() == dep: |
| 70 | found = True |
| 71 | break |
| 72 | if not found: |
| 73 | raise SkipTest("Test case %s depends on %s but it didn't pass/run." \ |
| 74 | % (case.id(), dep)) |
Brad Bishop | 6e60e8b | 2018-02-01 10:27:11 -0500 | [diff] [blame] | 75 | |
| 76 | @registerDecorator |
| 77 | class OETestDepends(OETestDiscover): |
| 78 | attrs = ('depends',) |
| 79 | |
| 80 | def bind(self, registry, case): |
| 81 | super(OETestDepends, self).bind(registry, case) |
| 82 | if not registry.get('depends'): |
| 83 | registry['depends'] = {} |
| 84 | _add_depends(registry['depends'], case, self.depends) |
| 85 | |
| 86 | @staticmethod |
| 87 | def discover(registry): |
| 88 | if registry.get('depends'): |
| 89 | _validate_test_case_depends(registry['cases'], registry['depends']) |
| 90 | return _order_test_case_by_depends(registry['cases'], registry['depends']) |
| 91 | else: |
| 92 | return [registry['cases'][case_id] for case_id in registry['cases']] |
| 93 | |
| 94 | def setUpDecorator(self): |
| 95 | _skipTestDependency(self.case, self.depends) |