@@ -370,16 +370,16 @@ void B2BSolver::populate_matrix(PartialPlacement &p_placement) {
370
370
size_t num_nodes = node_ids_no_duplicate.size ();
371
371
for (size_t node_id = 0 ; node_id < num_nodes; node_id++) {
372
372
if (node_id != maxXId && node_id != minXId) {
373
- add_node (node_id, maxXId, node_ids_no_duplicate. size () , true );
374
- add_node (node_id, minXId, node_ids_no_duplicate. size () , true );
373
+ add_node (node_id, maxXId, num_nodes , true );
374
+ add_node (node_id, minXId, num_nodes , true );
375
375
}
376
376
if (node_id != maxYId && node_id != minYId) {
377
- add_node (node_id, maxYId, node_ids_no_duplicate. size () , false );
378
- add_node (node_id, minYId, node_ids_no_duplicate. size () , false );
377
+ add_node (node_id, maxYId, num_nodes , false );
378
+ add_node (node_id, minYId, num_nodes , false );
379
379
}
380
380
}
381
- add_node (maxXId, minXId, node_ids_no_duplicate. size () , true );
382
- add_node (maxYId, minYId, node_ids_no_duplicate. size () , false );
381
+ add_node (maxXId, minXId, num_nodes , true );
382
+ add_node (maxYId, minYId, num_nodes , false );
383
383
}
384
384
A_sparse_x.setFromTriplets (tripletList_x.begin (), tripletList_x.end ());
385
385
A_sparse_y.setFromTriplets (tripletList_y.begin (), tripletList_y.end ());
@@ -414,7 +414,6 @@ void B2BSolver::populate_matrix_anchor(PartialPlacement& p_placement, unsigned i
414
414
void B2BSolver::b2b_solve_loop (unsigned iteration, PartialPlacement &p_placement){
415
415
double previous_hpwl, current_hpwl = std::numeric_limits<double >::max ();
416
416
for (unsigned counter = 0 ; counter < inner_iterations; counter++) {
417
- counter++;
418
417
previous_hpwl = current_hpwl;
419
418
VTR_LOG (" placement hpwl in b2b loop: %f\n " , p_placement.get_HPWL ());
420
419
VTR_ASSERT (p_placement.is_valid_partial_placement () && " did not produce a valid placement in b2b solve loop" );
0 commit comments