Skip to content

Commit ab88ee1

Browse files
committed
Added comments to routine that intersects range limit with floorplan constraints during place moves
1 parent 5adce06 commit ab88ee1

File tree

3 files changed

+15
-1
lines changed

3 files changed

+15
-1
lines changed

vpr/src/pack/output_clustering.cpp

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -124,7 +124,6 @@ static void print_stats() {
124124
}
125125
VTR_LOG("Absorbed logical nets %d out of %d nets, %d nets not absorbed.\n",
126126
total_nets_absorbed, (int)atom_ctx.nlist.nets().size(), (int)atom_ctx.nlist.nets().size() - total_nets_absorbed);
127-
VTR_LOG("Netlist num_blocks: %d \n", cluster_ctx.clb_nlist.blocks().size());
128127
free(num_clb_types);
129128
free(num_clb_inputs_used);
130129
free(num_clb_outputs_used);

vpr/src/place/move_utils.cpp

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -893,6 +893,13 @@ bool intersect_range_limit_with_floorplan_constraints(t_logical_block_type_ptr t
893893
regions = pr.get_partition_region();
894894
}
895895
Region intersect_reg;
896+
/*
897+
* If region size is greater than 1, the block is constrained to more than one rectangular region.
898+
* In this case, we return true (i.e. the range limit intersects with
899+
* the floorplan constraints) to simplify the problem. This simplification can be done because
900+
* this routine is done for cpu time optimization, so we do not have to necessarily check each
901+
* complicated case to get correct functionality during place moves.
902+
*/
896903
if (regions.size() == 1) {
897904
intersect_reg = intersection(regions[0], range_reg);
898905

vpr/src/place/move_utils.h

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -179,6 +179,14 @@ bool find_compatible_compressed_loc_in_range(t_logical_block_type_ptr type, int
179179
*
180180
* Returns false if there is no intersection between the range limit and the floorplan constraint,
181181
* true otherwise.
182+
*
183+
*
184+
* If region size of the block's floorplan constraints is greater than 1, the block is constrained to more than one rectangular region.
185+
* In this case, we return true (i.e. the range limit intersects with
186+
* the floorplan constraints) to simplify the problem. This simplification can be done because
187+
* this routine is done for cpu time optimization, so we do not have to necessarily check each
188+
* complicated case to get correct functionality during place moves.
189+
*
182190
*/
183191
bool intersect_range_limit_with_floorplan_constraints(t_logical_block_type_ptr type, ClusterBlockId b_from, int& min_cx, int& min_cy, int& max_cx, int& max_cy, int& delta_cx);
184192

0 commit comments

Comments
 (0)