AMF-Placer  2.0
An Open-Source Timing-driven Analytical Mixed-size FPGA Placer
globalPlacement Directory Reference
Directory dependency graph for globalPlacement:
src/lib/HiFPlacer/placement/globalPlacement

Files

file  ClusterPlacer.cc [code]
 This implementation file contains APIs' implementation of the ClusterPlacer which cluster nodes in the given netlist and place the clusters on the device based on simulated-annealing as initial placement.
 
file  ClusterPlacer.h [code]
 This header file contains the definitions of ClusterPlacer class and its internal modules and APIs which cluster nodes in the given netlist and place the clusters on the device based on simulated-annealing as initial placement.
 
file  GeneralSpreader.cc [code]
 This implementation file contains APIs' implementation of the GeneralSpreader which accounts for the cell spreading, which controls the cell density of specific resource type, under the device constraints for specific regions.
 
file  GeneralSpreader.h [code]
 This header file contains the definitions of GeneralSpreader class and its internal modules and APIs which account for the cell spreading, which controls the cell density of specific resource type, under the device constraints for specific regions.
 
file  GlobalPlacer.cc [code]
 This implementation file contains APIs' implementation of the GlobalPlacer which organizes/configures other modules to handle global placement.
 
file  GlobalPlacer.h [code]
 This header file contains the definitions of GlobalPlacer class and its internal modules and APIs which organize/configure other modules to handle global placement.
 
file  WirelengthOptimizer.cc [code]
 This implementation file contains APIs' implementation of the WirelengthOptimizer which builds numerical models based on the element locations and calls solvers to find an optimal solution of the placement.
 
file  WirelengthOptimizer.h [code]
 This header file contains the definitions of GlobalPlacer class and its internal modules and APIs which build numerical models based on the element locations and calls solvers to find an optimal solution of the placement.