Extra information about each rr_node needed only during routing (i.e. during the maze expansion).
More...
#include <vpr_types.h>
Extra information about each rr_node needed only during routing (i.e. during the maze expansion).
- Parameters
-
| prev_node | Index of the previous node (on the lowest cost path known to reach this node); used to generate the traceback. If there is no predecessor, prev_node = NO_PREVIOUS. |
| prev_edge | Index of the edge (from 0 to num_edges-1 of prev_node) that was used to reach this node from the previous node. If there is no predecessor, prev_edge = NO_PREVIOUS. |
| pres_cost | Present congestion cost term for this node. |
| acc_cost | Accumulated cost term from previous Pathfinder iterations. |
| path_cost | Total cost of the path up to and including this node + the expected cost to the target if the timing_driven router is being used. |
| backward_path_cost | Total cost of the path up to and including this node. Not used by breadth-first router. |
| target_flag | Is this node a target (sink) for the current routing? Number of times this node must be reached to fully route. |
| occ | The current occupancy of the associated rr node |
◆ occ()
| short t_rr_node_route_inf::occ |
( |
| ) |
const |
|
inline |
◆ set_occ()
| void t_rr_node_route_inf::set_occ |
( |
int |
new_occ | ) |
|
|
inline |
◆ acc_cost
| float t_rr_node_route_inf::acc_cost |
◆ backward_path_cost
| float t_rr_node_route_inf::backward_path_cost |
◆ occ_
| short t_rr_node_route_inf::occ_ = 0 |
|
private |
◆ path_cost
| float t_rr_node_route_inf::path_cost |
◆ pres_cost
| float t_rr_node_route_inf::pres_cost |
◆ prev_edge
| RREdgeId t_rr_node_route_inf::prev_edge |
◆ prev_node
| int t_rr_node_route_inf::prev_node |
◆ target_flag
| short t_rr_node_route_inf::target_flag |
The documentation for this struct was generated from the following file:
