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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
|
/*
* nextpnr -- Next Generation Place and Route
*
* Copyright (C) 2018 Clifford Wolf <clifford@symbioticeda.com>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*
*/
#include "log.h"
#include "nextpnr.h"
#if 0
#define dbg(...) log(__VA_ARGS__)
#else
#define dbg(...)
#endif
USING_NEXTPNR_NAMESPACE
namespace {
void archcheck_names(const Context *ctx)
{
log_info("Checking entity names.\n");
log_info("Checking bel names..\n");
for (BelId bel : ctx->getBels()) {
IdString name = ctx->getBelName(bel);
BelId bel2 = ctx->getBelByName(name);
if (bel != bel2) {
log_error("bel != bel2, name = %s\n", name.c_str(ctx));
}
}
log_info("Checking wire names..\n");
for (WireId wire : ctx->getWires()) {
IdString name = ctx->getWireName(wire);
WireId wire2 = ctx->getWireByName(name);
if (wire != wire2) {
log_error("wire != wire2, name = %s\n", name.c_str(ctx));
}
}
log_info("Checking partition names..\n");
for(PartitionId partition : ctx->getPartitions()) {
IdString name = ctx->getPartitionName(partition);
PartitionId partition2 = ctx->getPartitionByName(name);
if (partition != partition2) {
log_error("partition != partition2, name = %s\n", name.c_str(ctx));
}
}
#ifndef ARCH_ECP5
log_info("Checking pip names..\n");
for (PipId pip : ctx->getPips()) {
IdString name = ctx->getPipName(pip);
PipId pip2 = ctx->getPipByName(name);
if (pip != pip2) {
log_error("pip != pip2, name = %s\n", name.c_str(ctx));
}
}
#endif
log_break();
}
void archcheck_locs(const Context *ctx)
{
log_info("Checking location data.\n");
log_info("Checking all bels..\n");
for (BelId bel : ctx->getBels()) {
log_assert(bel != BelId());
dbg("> %s\n", ctx->getBelName(bel).c_str(ctx));
Loc loc = ctx->getBelLocation(bel);
dbg(" ... %d %d %d\n", loc.x, loc.y, loc.z);
log_assert(0 <= loc.x);
log_assert(0 <= loc.y);
log_assert(0 <= loc.z);
log_assert(loc.x < ctx->getGridDimX());
log_assert(loc.y < ctx->getGridDimY());
log_assert(loc.z < ctx->getTileBelDimZ(loc.x, loc.y));
BelId bel2 = ctx->getBelByLocation(loc);
dbg(" ... %s\n", ctx->getBelName(bel2).c_str(ctx));
log_assert(bel == bel2);
}
log_info("Checking all locations..\n");
for (int x = 0; x < ctx->getGridDimX(); x++)
for (int y = 0; y < ctx->getGridDimY(); y++) {
dbg("> %d %d\n", x, y);
std::unordered_set<int> usedz;
for (int z = 0; z < ctx->getTileBelDimZ(x, y); z++) {
BelId bel = ctx->getBelByLocation(Loc(x, y, z));
if (bel == BelId())
continue;
Loc loc = ctx->getBelLocation(bel);
dbg(" + %d %s\n", z, ctx->getBelName(bel).c_str(ctx));
log_assert(x == loc.x);
log_assert(y == loc.y);
log_assert(z == loc.z);
usedz.insert(z);
}
for (BelId bel : ctx->getBelsByTile(x, y)) {
Loc loc = ctx->getBelLocation(bel);
dbg(" - %d %s\n", loc.z, ctx->getBelName(bel).c_str(ctx));
log_assert(x == loc.x);
log_assert(y == loc.y);
log_assert(usedz.count(loc.z));
usedz.erase(loc.z);
}
log_assert(usedz.empty());
}
log_break();
}
void archcheck_conn(const Context *ctx)
{
log_info("Checking connectivity data.\n");
log_info("Checking all wires...\n");
std::unordered_map<PipId, WireId> pips_downhill;
std::unordered_map<PipId, WireId> pips_uphill;
for (WireId wire : ctx->getWires()) {
for (BelPin belpin : ctx->getWireBelPins(wire)) {
WireId wire2 = ctx->getBelPinWire(belpin.bel, belpin.pin);
log_assert(wire == wire2);
}
for (PipId pip : ctx->getPipsDownhill(wire)) {
WireId wire2 = ctx->getPipSrcWire(pip);
log_assert(wire == wire2);
auto result = pips_downhill.emplace(pip, wire);
log_assert(result.second);
}
for (PipId pip : ctx->getPipsUphill(wire)) {
WireId wire2 = ctx->getPipDstWire(pip);
log_assert(wire == wire2);
auto result = pips_uphill.emplace(pip, wire);
log_assert(result.second);
}
}
log_info("Checking all BELs...\n");
for (BelId bel : ctx->getBels()) {
for (IdString pin : ctx->getBelPins(bel)) {
WireId wire = ctx->getBelPinWire(bel, pin);
if (wire == WireId()) {
continue;
}
bool found_belpin = false;
for (BelPin belpin : ctx->getWireBelPins(wire)) {
if (belpin.bel == bel && belpin.pin == pin) {
found_belpin = true;
break;
}
}
log_assert(found_belpin);
}
}
log_info("Checking all PIPs...\n");
for (PipId pip : ctx->getPips()) {
WireId src_wire = ctx->getPipSrcWire(pip);
if (src_wire != WireId()) {
log_assert(pips_downhill.at(pip) == src_wire);
}
WireId dst_wire = ctx->getPipDstWire(pip);
if (dst_wire != WireId()) {
log_assert(pips_uphill.at(pip) == dst_wire);
}
}
}
void archcheck_partitions(const Context *ctx)
{
log_info("Checking partition data.\n");
// Partitions should be subsets of BELs that form an exact cover.
// In particular that means cell types in a partition should only be
// placable in that partition.
for(PartitionId partition : ctx->getPartitions()) {
// Find out which cell types are in this partition.
std::unordered_set<IdString> cell_types_in_partition;
for(IdString cell_type : ctx->getCellTypes()) {
if(ctx->getPartitionForCellType(cell_type) == partition) {
cell_types_in_partition.insert(cell_type);
}
}
// Make sure that all cell types in this partition have at least one
// BelId they can be placed at.
std::unordered_set<IdString> cell_types_unused;
std::unordered_set<BelId> bels_in_partition;
for(BelId bel : ctx->getBelsForPartition(partition)) {
PartitionId partition2 = ctx->getPartitionForBel(bel);
log_assert(partition == partition2);
bels_in_partition.insert(bel);
// Check to see if a cell type not in this partition can be
// placed at a BEL in this partition.
for(IdString cell_type : ctx->getCellTypes()) {
if(ctx->getPartitionForCellType(cell_type) == partition) {
if(ctx->isValidBelForCellType(cell_type, bel)) {
cell_types_unused.erase(cell_type);
}
} else {
log_assert(!ctx->isValidBelForCellType(cell_type, bel));
}
}
}
// Verify that any BEL not in this partition reports a different
// partition.
for(BelId bel : ctx->getBels()) {
if(ctx->getPartitionForBel(bel) != partition) {
log_assert(bels_in_partition.count(bel) == 0);
}
}
log_assert(cell_types_unused.empty());
}
}
} // namespace
NEXTPNR_NAMESPACE_BEGIN
void Context::archcheck() const
{
log_info("Running architecture database integrity check.\n");
log_break();
archcheck_names(this);
archcheck_locs(this);
archcheck_conn(this);
archcheck_partitions(this);
}
NEXTPNR_NAMESPACE_END
|