diff options
| author | Keith Rothman <537074+litghost@users.noreply.github.com> | 2021-01-28 19:08:14 -0800 |
|---|---|---|
| committer | Keith Rothman <537074+litghost@users.noreply.github.com> | 2021-02-02 07:34:56 -0800 |
| commit | d03d9d839b7e49a4bf3428e949bda85574adf403 (patch) | |
| tree | 9d680a06ccd312bc057544a093d28bee9979b607 /common/placer_heap.cc | |
| parent | 71e210dd4b12f1e91630f83396be236034f68e30 (diff) | |
| download | nextpnr-d03d9d839b7e49a4bf3428e949bda85574adf403.tar.gz nextpnr-d03d9d839b7e49a4bf3428e949bda85574adf403.tar.bz2 nextpnr-d03d9d839b7e49a4bf3428e949bda85574adf403.zip | |
Working compile of ECP5.
Signed-off-by: Keith Rothman <537074+litghost@users.noreply.github.com>
Diffstat (limited to 'common/placer_heap.cc')
| -rw-r--r-- | common/placer_heap.cc | 12 |
1 files changed, 7 insertions, 5 deletions
diff --git a/common/placer_heap.cc b/common/placer_heap.cc index d0771fc3..af073873 100644 --- a/common/placer_heap.cc +++ b/common/placer_heap.cc @@ -187,7 +187,7 @@ class HeAPPlacer heap_runs.push_back(std::unordered_set<PartitionId>{partition}); all_partitions.insert(partition); } - partition_count[cell->type]++; + partition_count[partition]++; } // If more than 98% of cells are one cell type, always solve all at once // Otherwise, follow full HeAP strategy of rotate&all @@ -252,8 +252,10 @@ class HeAPPlacer legal_hpwl = total_hpwl(); auto run_stopt = std::chrono::high_resolution_clock::now(); + + IdString partition_name = ctx->getPartitionName(*run.begin()); log_info(" at iteration #%d, type %s: wirelen solved = %d, spread = %d, legal = %d; time = %.02fs\n", - iter + 1, (run.size() > 1 ? "ALL" : run.begin()->c_str(ctx)), int(solved_hpwl), + iter + 1, (run.size() > 1 ? "ALL" : partition_name.c_str(ctx)), int(solved_hpwl), int(spread_hpwl), int(legal_hpwl), std::chrono::duration<double>(run_stopt - run_startt).count()); } @@ -558,7 +560,7 @@ class HeAPPlacer } // Setup the cells to be solved, returns the number of rows - int setup_solve_cells(std::unordered_set<IdString> *celltypes = nullptr) + int setup_solve_cells(std::unordered_set<PartitionId> *partitions = nullptr) { int row = 0; solve_cells.clear(); @@ -567,7 +569,7 @@ class HeAPPlacer cell.second->udata = dont_solve; // Then update cells to be placed, which excludes cell children for (auto cell : place_cells) { - if (celltypes && !celltypes->count(cell->type)) + if (partitions && !partitions->count(ctx->getPartitionForCellType(cell->type))) continue; cell->udata = row++; solve_cells.push_back(cell); @@ -958,7 +960,7 @@ class HeAPPlacer if (vc->region != nullptr && vc->region->constr_bels && !vc->region->bels.count(target)) goto fail; CellInfo *bound; - if (target == BelId() || ctx->isValidBelForCellType(vc->type, target)) + if (target == BelId() || !ctx->isValidBelForCellType(vc->type, target)) goto fail; bound = ctx->getBoundBelCell(target); // Chains cannot overlap |