forked from chipsalliance/verible
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDPI_test.cc
131 lines (121 loc) · 3.84 KB
/
DPI_test.cc
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
// Copyright 2017-2020 The Verible Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "verilog/CST/DPI.h"
#include <utility>
#include "common/analysis/syntax_tree_search.h"
#include "common/analysis/syntax_tree_search_test_utils.h"
#include "common/text/text_structure.h"
#include "common/text/token_info_test_util.h"
#include "common/text/tree_utils.h"
#include "common/util/range.h"
#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "verilog/CST/match_test_utils.h"
#include "verilog/analysis/verilog_analyzer.h"
#undef ASSERT_OK
#define ASSERT_OK(value) ASSERT_TRUE((value).ok())
namespace verilog {
namespace {
using verible::SyntaxTreeSearchTestCase;
using verible::TextStructureView;
using verible::TreeSearchMatch;
TEST(FindAllDPIImportsTest, CountMatches) {
constexpr int kTag = 1; // don't care
const SyntaxTreeSearchTestCase kTestCases[] = {
{""},
{"module m;\nendmodule\n"},
{"class c;\nendclass\n"},
{"function f;\nendfunction\n"},
{"package p;\nendpackage\n"},
{"task t;\nendtask\n"},
{"module m;\n"
" function int add();\n"
" endfunction\n"
"endmodule\n"},
{"module m;\n"
" ",
{kTag, "import \"DPI-C\" function int add();"},
"\n"
"endmodule\n"},
{"module m;\n"
" ",
{kTag, "import \"DPI-C\" function int add();"},
"\n"
" foo bar();\n"
"endmodule\n"},
{"module m;\n"
" ",
{kTag, "import \"DPI-C\" function int add();"},
"\n"
" foo bar();\n"
" ",
{kTag, "import \"DPI-C\" function int sub(input int x, y);"},
"\n"
"endmodule\n"},
};
for (const auto& test : kTestCases) {
TestVerilogSyntaxRangeMatches(
__FUNCTION__, test, [](const TextStructureView& text_structure) {
const auto& root = text_structure.SyntaxTree();
return FindAllDPIImports(*ABSL_DIE_IF_NULL(root));
});
}
}
TEST(GetDPIImportPrototypeTest, Various) {
constexpr int kTag = 1; // value doesn't matter
const SyntaxTreeSearchTestCase kTestCases[] = {
// each of these test cases should match exactly one DPI import
{"module m;\n"
" import \"DPI-C\" ",
{kTag, "function void foo"},
";",
"\n"
"endmodule\n"},
{"module m;\n"
" wire w;\n"
" import \"DPI-C\" ",
{kTag, "function void foo"},
";",
"\n"
" logic l;\n"
"endmodule\n"},
{"module m;\n"
" import \"DPI-C\" ",
{kTag, "function int add()"},
";",
"\n"
"endmodule\n"},
{"module m;\n"
" import \"DPI-C\" ",
{kTag, "function int add( input int x , y)"},
";",
"\n"
"endmodule\n"},
};
for (const auto& test : kTestCases) {
TestVerilogSyntaxRangeMatches(
__FUNCTION__, test, [](const TextStructureView& text_structure) {
const auto& root = text_structure.SyntaxTree();
const auto dpi_imports = FindAllDPIImports(*ABSL_DIE_IF_NULL(root));
std::vector<TreeSearchMatch> prototypes;
for (const auto& dpi_import : dpi_imports) {
prototypes.push_back(TreeSearchMatch{
GetDPIImportPrototype(*dpi_import.match), /* no context */});
}
return prototypes;
});
}
}
} // namespace
} // namespace verilog