aboutsummaryrefslogtreecommitdiffstats
path: root/fpga_interchange/cost_map.cc
diff options
context:
space:
mode:
authormyrtle <gatecat@ds0.me>2022-12-07 10:26:17 +0100
committerGitHub <noreply@github.com>2022-12-07 10:26:17 +0100
commit519011533a3b7582b984226536cb424d462d1599 (patch)
tree31ee37d2c50481ab5f5a5bec2b07ac46d7d7d9ca /fpga_interchange/cost_map.cc
parenta342b96bb0d4370d3e575a0189da2273b94ea765 (diff)
parentd1afd6c0f1f8452d7461bbf33c84dbfd59236d03 (diff)
downloadnextpnr-519011533a3b7582b984226536cb424d462d1599.tar.gz
nextpnr-519011533a3b7582b984226536cb424d462d1599.tar.bz2
nextpnr-519011533a3b7582b984226536cb424d462d1599.zip
Merge pull request #1058 from YosysHQ/gatecat/bounds-refactor
refactor: rename ArcBounds -> BoundingBox and use this in HeAP
Diffstat (limited to 'fpga_interchange/cost_map.cc')
-rw-r--r--fpga_interchange/cost_map.cc4
1 files changed, 2 insertions, 2 deletions
diff --git a/fpga_interchange/cost_map.cc b/fpga_interchange/cost_map.cc
index c20ba11b..d960c7cf 100644
--- a/fpga_interchange/cost_map.cc
+++ b/fpga_interchange/cost_map.cc
@@ -184,7 +184,7 @@ static void assign_min_entry(delay_t *dst, const delay_t &src)
}
std::pair<delay_t, int> CostMap::get_nearby_cost_entry(const boost::multi_array<delay_t, 2> &matrix, int cx, int cy,
- const ArcBounds &bounds)
+ const BoundingBox &bounds)
{
#ifdef DEBUG_FILL
log_info("Filling %d, %d within (%d, %d, %d, %d)\n", cx, cy, bounds.x0, bounds.y0, bounds.x1, bounds.y1);
@@ -249,7 +249,7 @@ void CostMap::fill_holes(const Context *ctx, const TypeWirePair &type_pair, boos
// find missing cost entries and fill them in by copying a nearby cost entry
std::vector<std::tuple<unsigned, unsigned, delay_t>> missing;
bool couldnt_fill = false;
- auto shifted_bounds = ArcBounds(0, 0, matrix.shape()[0] - 1, matrix.shape()[1] - 1);
+ auto shifted_bounds = BoundingBox(0, 0, matrix.shape()[0] - 1, matrix.shape()[1] - 1);
int max_fill = 0;
for (unsigned ix = 0; ix < matrix.shape()[0]; ix++) {
for (unsigned iy = 0; iy < matrix.shape()[1]; iy++) {