|
| 1 | +# SPDX-FileCopyrightText: 2023 spdx contributors |
| 2 | +# |
| 3 | +# SPDX-License-Identifier: Apache-2.0 |
| 4 | +from pathlib import Path |
| 5 | +from typing import List |
| 6 | +from unittest import TestCase |
| 7 | + |
| 8 | +import pytest |
| 9 | + |
| 10 | +from spdx.graph_generation import generate_relationship_graph_from_spdx |
| 11 | +from spdx.model.document import Document |
| 12 | +from spdx.model.relationship import Relationship, RelationshipType |
| 13 | +from spdx.parser.parse_anything import parse_file |
| 14 | +from tests.spdx.fixtures import document_fixture, file_fixture, package_fixture |
| 15 | + |
| 16 | +try: |
| 17 | + import networkx # noqa: F401 |
| 18 | + import pygraphviz # noqa: F401 |
| 19 | +except ImportError: |
| 20 | + pytest.skip("Skip this module as the tests need optional dependencies to run.", allow_module_level=True) |
| 21 | + |
| 22 | + |
| 23 | +@pytest.mark.parametrize( |
| 24 | + "file_name, nodes_count, edges_count, relationship_node_keys", |
| 25 | + [ |
| 26 | + ( |
| 27 | + "SPDXJSONExample-v2.3.spdx.json", |
| 28 | + 22, |
| 29 | + 22, |
| 30 | + ["SPDXRef-Package_DYNAMIC_LINK", "SPDXRef-JenaLib_CONTAINS"], |
| 31 | + ), |
| 32 | + ( |
| 33 | + "SPDXJSONExample-v2.2.spdx.json", |
| 34 | + 20, |
| 35 | + 19, |
| 36 | + ["SPDXRef-Package_DYNAMIC_LINK", "SPDXRef-JenaLib_CONTAINS"], |
| 37 | + ), |
| 38 | + ( |
| 39 | + "SPDXRdfExample-v2.3.spdx.rdf.xml", |
| 40 | + 22, |
| 41 | + 22, |
| 42 | + ["SPDXRef-Package_DYNAMIC_LINK", "SPDXRef-JenaLib_CONTAINS"], |
| 43 | + ), |
| 44 | + ( |
| 45 | + "SPDXRdfExample-v2.2.spdx.rdf.xml", |
| 46 | + 20, |
| 47 | + 17, |
| 48 | + ["SPDXRef-Package_DYNAMIC_LINK", "SPDXRef-JenaLib_CONTAINS"], |
| 49 | + ), |
| 50 | + ( |
| 51 | + "SPDXTagExample-v2.3.spdx", |
| 52 | + 22, |
| 53 | + 22, |
| 54 | + ["SPDXRef-Package_DYNAMIC_LINK", "SPDXRef-JenaLib_CONTAINS"], |
| 55 | + ), |
| 56 | + ], |
| 57 | +) |
| 58 | +def test_generate_graph_from_spdx( |
| 59 | + file_name: str, |
| 60 | + nodes_count: int, |
| 61 | + edges_count: int, |
| 62 | + relationship_node_keys: List[str], |
| 63 | +) -> None: |
| 64 | + document = parse_file(str(Path(__file__).resolve().parent.parent / "spdx" / "data" / "formats" / file_name)) |
| 65 | + graph = generate_relationship_graph_from_spdx(document) |
| 66 | + |
| 67 | + assert document.creation_info.spdx_id in graph.nodes() |
| 68 | + assert graph.number_of_nodes() == nodes_count |
| 69 | + assert graph.number_of_edges() == edges_count |
| 70 | + assert "SPDXRef-DOCUMENT_DESCRIBES" in graph.nodes() |
| 71 | + for relationship_node_key in relationship_node_keys: |
| 72 | + assert relationship_node_key in graph.nodes() |
| 73 | + |
| 74 | + |
| 75 | +def test_complete_connected_graph() -> None: |
| 76 | + document = _create_minimal_document() |
| 77 | + |
| 78 | + graph = generate_relationship_graph_from_spdx(document) |
| 79 | + |
| 80 | + TestCase().assertCountEqual( |
| 81 | + graph.nodes(), |
| 82 | + [ |
| 83 | + "SPDXRef-DOCUMENT", |
| 84 | + "SPDXRef-Package-A", |
| 85 | + "SPDXRef-Package-B", |
| 86 | + "SPDXRef-File", |
| 87 | + "SPDXRef-DOCUMENT_DESCRIBES", |
| 88 | + "SPDXRef-Package-A_CONTAINS", |
| 89 | + "SPDXRef-Package-B_CONTAINS", |
| 90 | + ], |
| 91 | + ) |
| 92 | + TestCase().assertCountEqual( |
| 93 | + graph.edges(), |
| 94 | + [ |
| 95 | + ("SPDXRef-DOCUMENT", "SPDXRef-DOCUMENT_DESCRIBES"), |
| 96 | + ("SPDXRef-DOCUMENT_DESCRIBES", "SPDXRef-Package-A"), |
| 97 | + ("SPDXRef-DOCUMENT_DESCRIBES", "SPDXRef-Package-B"), |
| 98 | + ("SPDXRef-Package-A", "SPDXRef-Package-A_CONTAINS"), |
| 99 | + ("SPDXRef-Package-A_CONTAINS", "SPDXRef-File"), |
| 100 | + ("SPDXRef-Package-B", "SPDXRef-Package-B_CONTAINS"), |
| 101 | + ("SPDXRef-Package-B_CONTAINS", "SPDXRef-File"), |
| 102 | + ], |
| 103 | + ) |
| 104 | + |
| 105 | + |
| 106 | +def test_complete_unconnected_graph() -> None: |
| 107 | + document = _create_minimal_document() |
| 108 | + document.packages += [package_fixture(spdx_id="SPDXRef-Package-C", name="Package without connection to document")] |
| 109 | + |
| 110 | + graph = generate_relationship_graph_from_spdx(document) |
| 111 | + |
| 112 | + TestCase().assertCountEqual( |
| 113 | + graph.nodes(), |
| 114 | + [ |
| 115 | + "SPDXRef-DOCUMENT", |
| 116 | + "SPDXRef-Package-A", |
| 117 | + "SPDXRef-Package-B", |
| 118 | + "SPDXRef-File", |
| 119 | + "SPDXRef-DOCUMENT_DESCRIBES", |
| 120 | + "SPDXRef-Package-A_CONTAINS", |
| 121 | + "SPDXRef-Package-B_CONTAINS", |
| 122 | + "SPDXRef-Package-C", |
| 123 | + ], |
| 124 | + ) |
| 125 | + TestCase().assertCountEqual( |
| 126 | + graph.edges(), |
| 127 | + [ |
| 128 | + ("SPDXRef-DOCUMENT", "SPDXRef-DOCUMENT_DESCRIBES"), |
| 129 | + ("SPDXRef-DOCUMENT_DESCRIBES", "SPDXRef-Package-A"), |
| 130 | + ("SPDXRef-DOCUMENT_DESCRIBES", "SPDXRef-Package-B"), |
| 131 | + ("SPDXRef-Package-A", "SPDXRef-Package-A_CONTAINS"), |
| 132 | + ("SPDXRef-Package-A_CONTAINS", "SPDXRef-File"), |
| 133 | + ("SPDXRef-Package-B", "SPDXRef-Package-B_CONTAINS"), |
| 134 | + ("SPDXRef-Package-B_CONTAINS", "SPDXRef-File"), |
| 135 | + ], |
| 136 | + ) |
| 137 | + |
| 138 | + |
| 139 | +def _create_minimal_document() -> Document: |
| 140 | + packages = [ |
| 141 | + package_fixture(spdx_id="SPDXRef-Package-A", name="Package-A"), |
| 142 | + package_fixture(spdx_id="SPDXRef-Package-B", name="Package-B"), |
| 143 | + ] |
| 144 | + files = [ |
| 145 | + file_fixture(spdx_id="SPDXRef-File", name="File"), |
| 146 | + ] |
| 147 | + relationships = [ |
| 148 | + Relationship("SPDXRef-DOCUMENT", RelationshipType.DESCRIBES, "SPDXRef-Package-A"), |
| 149 | + Relationship("SPDXRef-DOCUMENT", RelationshipType.DESCRIBES, "SPDXRef-Package-B"), |
| 150 | + Relationship("SPDXRef-Package-A", RelationshipType.CONTAINS, "SPDXRef-File"), |
| 151 | + Relationship("SPDXRef-Package-B", RelationshipType.CONTAINS, "SPDXRef-File"), |
| 152 | + ] |
| 153 | + document = document_fixture(packages=packages, files=files, relationships=relationships, snippets=[]) |
| 154 | + |
| 155 | + return document |
0 commit comments