Skip to content

Router Debug #2569

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Jun 6, 2024
Merged

Router Debug #2569

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
08c0e47
[vpr][source][route] don't get prev edge is the node type is of the t…
amin1377 May 29, 2024
d69cb90
[vpr][route] fix a typo
amin1377 May 30, 2024
0cd7e0d
Merge branch 'master' of https://github.com/verilog-to-routing/vtr-ve…
amin1377 Jun 4, 2024
ff2e0b6
[vpr][rr_graph] check for the validity of the edge before returning e…
amin1377 Jun 4, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions libs/librrgraph/src/base/rr_graph_storage.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -338,11 +338,13 @@ class t_rr_graph_storage {

/** @brief Get the source node for the specified edge. */
RRNodeId edge_src_node(const RREdgeId& edge) const {
VTR_ASSERT_DEBUG(edge.is_valid());
return edge_src_node_[edge];
}

/** @brief Get the destination node for the specified edge. */
RRNodeId edge_sink_node(const RREdgeId& edge) const {
VTR_ASSERT_DEBUG(edge.is_valid());
return edge_dest_node_[edge];
}

Expand Down
2 changes: 1 addition & 1 deletion vpr/src/route/connection_router.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -372,7 +372,7 @@ void ConnectionRouter<Heap>::timing_driven_expand_cheapest(t_heap* cheapest,
VTR_LOGV_DEBUG(router_debug_, " Better cost to %d\n", inode);
VTR_LOGV_DEBUG(router_debug_, " New total cost: %g\n", new_total_cost);
VTR_LOGV_DEBUG(router_debug_, " New back cost: %g\n", new_back_cost);
VTR_LOGV_DEBUG(router_debug_, " Setting path costs for associated node %d (from %d edge %zu)\n",
VTR_LOGV_DEBUG(router_debug_ && (rr_nodes_.node_type(RRNodeId(cheapest->index)) != t_rr_type::SOURCE), " Setting path costs for associated node %d (from %d edge %zu)\n",
cheapest->index,
static_cast<size_t>(rr_graph_->edge_src_node(cheapest->prev_edge())),
static_cast<size_t>(cheapest->prev_edge()));
Expand Down
Loading