diff options
author | Sergiusz Bazanski <q3k@q3k.org> | 2018-07-14 11:10:31 +0100 |
---|---|---|
committer | Sergiusz Bazanski <q3k@q3k.org> | 2018-07-14 11:10:31 +0100 |
commit | 9b17fe385cf7e8d3025747b5f7c7822ac2d99920 (patch) | |
tree | 1822cebedf1e346defe28f0707de7332d45a92cc /ice40/place_legaliser.cc | |
parent | a38b4fa1735bd0af78520f6d5320a264914fb838 (diff) | |
download | nextpnr-9b17fe385cf7e8d3025747b5f7c7822ac2d99920.tar.gz nextpnr-9b17fe385cf7e8d3025747b5f7c7822ac2d99920.tar.bz2 nextpnr-9b17fe385cf7e8d3025747b5f7c7822ac2d99920.zip |
Refactor proxies to nextpnr.
Diffstat (limited to 'ice40/place_legaliser.cc')
-rw-r--r-- | ice40/place_legaliser.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/ice40/place_legaliser.cc b/ice40/place_legaliser.cc index 10a6f3ff..fcb47cfd 100644 --- a/ice40/place_legaliser.cc +++ b/ice40/place_legaliser.cc @@ -253,7 +253,7 @@ class PlacementLegaliser } // Find Bel closest to a location, meeting chain requirements - std::tuple<int, int, int> find_closest_bel(ArchRWProxy &proxy, float target_x, float target_y, CellChain &chain) + std::tuple<int, int, int> find_closest_bel(MutateContext &proxy, float target_x, float target_y, CellChain &chain) { std::tuple<int, int, int> best_origin = std::make_tuple(-1, -1, -1); wirelen_t best_wirelength = std::numeric_limits<wirelen_t>::max(); @@ -283,7 +283,7 @@ class PlacementLegaliser } // Split a carry chain into multiple legal chains - std::vector<CellChain> split_carry_chain(const ArchRProxy &proxy, CellChain &carryc) + std::vector<CellChain> split_carry_chain(const ReadContext &proxy, CellChain &carryc) { bool start_of_chain = true; std::vector<CellChain> chains; @@ -335,7 +335,7 @@ class PlacementLegaliser } // Place a logic cell at a given grid location, handling rip-up etc - void place_lc(ArchRWProxy &proxy, CellInfo *cell, int x, int y, int z) + void place_lc(MutateContext &proxy, CellInfo *cell, int x, int y, int z) { auto &loc = logic_bels.at(x).at(y).at(z); NPNR_ASSERT(!loc.second); |