1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
# SPDX-License-Identifier: BSD-2-Clause
""" This module provides details of the RTEMS specification. """
# Copyright (C) 2021, 2022 embedded brains GmbH & Co. KG
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
from typing import Any, List
from rtemsspec.items import create_unique_link, Item, ItemCache, Link
_NOT_PRE_QUALIFIED = set([
"/acfg/constraint/option-not-pre-qualified",
"/constraint/constant-not-pre-qualified",
"/constraint/directive-not-pre-qualified",
])
def is_pre_qualified(item: Item) -> bool:
""" Returns true, if the item is pre-qualified, otherwise false. """
return not bool(
set(parent.uid for parent in item.parents("constraint")).intersection(
_NOT_PRE_QUALIFIED))
_ENABLEMENT_ROLES = [
"interface-function", "interface-ingroup", "interface-ingroup-hidden",
"requirement-refinement", "validation"
]
def _link_is_enabled(_link: Link) -> bool:
return True
def recursive_is_enabled(enabled: List[str], item: Item) -> bool:
"""
Returns true, if the item is enabled and there exists a path to the root
item where each item on the path is enabled, otherwise false.
"""
if not item.is_enabled(enabled):
return False
result = True
for parent in item.parents(_ENABLEMENT_ROLES,
is_link_enabled=_link_is_enabled):
if recursive_is_enabled(enabled, parent):
return True
result = False
return result
def _add_link(item_cache: ItemCache, child: Item, data: Any) -> None:
parent = item_cache[child.to_abs_uid(data["uid"])]
create_unique_link(child, parent, data)
def augment_with_test_links(item_cache: ItemCache) -> None:
""" Augments links of test case items with links from their actions. """
for item in item_cache.items_by_type["test-case"]:
for actions in item["test-actions"]:
for checks in actions["checks"]:
for link in checks["links"]:
_add_link(item_cache, item, link)
for link in actions["links"]:
_add_link(item_cache, item, link)
|
