#include <vpr_types.h>

Detailed Description

All the parameters controlling the router's operation are in this structure.

first_iter_pres_fac: Present sharing penalty factor used for the very first (congestion mapping) Pathfinder iteration.
initial_pres_fac: Initial present sharing penalty factor for Pathfinder; used to set pres_fac on 2nd iteration.
pres_fac_mult: Amount by which pres_fac is multiplied each routing iteration.
acc_fac: Historical congestion cost multiplier. Used unchanged for all iterations.
bend_cost: Cost of a bend (usually non-zero only for global routing).
max_router_iterations: Maximum number of iterations before giving up.
bb_factor: Linear distance a route can go outside the net bounding box.
route_type: GLOBAL or DETAILED.
fixed_channel_width: Only attempt to route the design once, with the channel width given. If this variable is == NO_FIXED_CHANNEL_WIDTH, do a binary search on channel width. router_algorithm: BREADTH_FIRST or TIMING_DRIVEN. Selects the desired routing algorithm.
base_cost_type: Specifies how to compute the base cost of each type of rr_node. INTRINSIC_DELAY -> base_cost = intrinsic delay of each node. DELAY_NORMALIZED -> base_cost = "demand" x average delay to route past 1 CLB. DEMAND_ONLY -> expected demand of this node (old breadth-first costs).

The following parameters are used only by the timing-driven router.

astar_fac: Factor (alpha) used to weight expected future costs to target in the timing_driven router. astar_fac = 0 leads to an essentially breadth-first search, astar_fac = 1 is near the usual astar algorithm and astar_fac > 1 are more aggressive.
max_criticality: The maximum criticality factor (from 0 to 1) any sink will ever have (i.e. clip criticality to this number).
criticality_exp: Set criticality to (path_length(sink) / longest_path) ^ criticality_exp (then clip to max_criticality).
doRouting: True if routing is supposed to be done, FALSE otherwise

Definition at line 588 of file vpr_types.h.