Skip to content

Commit 4c710fc

Browse files
committed
[vpr][route][lookahead] fix comment
1 parent 0b9a366 commit 4c710fc

File tree

1 file changed

+5
-4
lines changed

1 file changed

+5
-4
lines changed

vpr/src/route/router_lookahead_map.cpp

Lines changed: 5 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -330,10 +330,11 @@ std::pair<float, float> MapLookahead::get_expected_delay_and_cong(RRNodeId from_
330330

331331
auto from_ptc = rr_graph.node_ptc_num(from_node);
332332

333-
/* get_cost_from_src_opin iterates over all routing segments passed to it (the first argument) and returns
334-
* the minimum cost among them. In the following for loop, we iterate over each layer and pass the routing segments
335-
* reachable from the OPIN/SOURCE to segments on that layer. This for loop then calculates and returns
336-
* the minimum cost from the given OPIN/SOURCE to the specified SINK across all layers.
333+
/* We could reach the sink by using an intermediate wire on any reachable layer. We consider all these options and return the minimum cost one.
334+
* get_cost_from_src_opin iterates over all routing segments passed to it (the first argument) and returns
335+
* the minimum cost among them. In the following for loop, we iterate over each layer and pass it the
336+
* routing segments on that layer reachable from the OPIN/SOURCE to segments on that layer. This for loop then calculates and returns
337+
* the minimum cost from the given OPIN/SOURCE to the specified SINK considering routing options across all layers.
337338
*/
338339
for (int layer_num = 0; layer_num < device_ctx.grid.get_num_layers(); layer_num++) {
339340
float this_delay_cost;

0 commit comments

Comments
 (0)