luke
/
OpenRAM
mirror of https://github.com/VLSIDA/OpenRAM.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Convert source and target lists to sets for faster contains check.

This commit is contained in:
Matt Guthaus 2019-01-30 11:15:47 -08:00
parent 07f4d639eb
commit 74fbe8fe63
4 changed files with 12 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
compiler/router/grid.py
View File

@ -21,8 +21,8 @@ class grid:
""" Initialize the map and define the costs. """ """ Initialize the map and define the costs. """
# list of the source/target grid coordinates # list of the source/target grid coordinates
self.source = [] self.source = set()
self.target = [] self.target = set()
self.track_width = track_width self.track_width = track_width
self.track_widths = [self.track_width, self.track_width, 1.0] self.track_widths = [self.track_width, self.track_width, 1.0]
@ -80,7 +80,7 @@ class grid:
else: else:
self.add_map(n) self.add_map(n)
self.map[n].source=value self.map[n].source=value
self.source.append(n) self.source.add(n)
def set_target(self,n,value=True): def set_target(self,n,value=True):
if isinstance(n, (list,tuple,set,frozenset)): if isinstance(n, (list,tuple,set,frozenset)):
@ -89,7 +89,7 @@ class grid:
else: else:
self.add_map(n) self.add_map(n)
self.map[n].target=value self.map[n].target=value
self.target.append(n) self.target.add(n)
def add_source(self,track_list,value=True): def add_source(self,track_list,value=True):

6
compiler/router/signal_grid.py
View File

@ -62,7 +62,8 @@ class signal_grid(grid):
# We set a cost bound of the HPWL for run-time. This can be # We set a cost bound of the HPWL for run-time. This can be
# over-ridden if the route fails due to pruning a feasible solution. # over-ridden if the route fails due to pruning a feasible solution.
cost_bound = detour_scale*self.cost_to_target(self.source[0])*grid.PREFERRED_COST any_source_element = next(iter(self.source))
cost_bound = detour_scale*self.cost_to_target(any_source_element)*grid.PREFERRED_COST
# Check if something in the queue is already a source and a target! # Check if something in the queue is already a source and a target!
for s in self.source: for s in self.source:
@ -153,7 +154,8 @@ class signal_grid(grid):
Find the cheapest HPWL distance to any target point ignoring Find the cheapest HPWL distance to any target point ignoring
blockages for A* search. blockages for A* search.
""" """
cost = self.hpwl(source,self.target[0]) any_target_element = next(iter(self.target))
cost = self.hpwl(source,any_target_element)
for t in self.target: for t in self.target:
cost = min(self.hpwl(source,t),cost) cost = min(self.hpwl(source,t),cost)

4
compiler/router/supply_grid.py
View File

@ -20,8 +20,8 @@ class supply_grid(signal_grid):
def reinit(self): def reinit(self):
""" Reinitialize everything for a new route. """ """ Reinitialize everything for a new route. """
self.source = [] self.source = set()
self.target = [] self.target = set()
# Reset all the cells in the map # Reset all the cells in the map
for p in self.map.values(): for p in self.map.values():
p.reset() p.reset()

3
compiler/view_profile.py
View File

@ -2,7 +2,8 @@
import pstats import pstats
p = pstats.Stats("profile.dat") p = pstats.Stats("profile.dat")
p.strip_dirs() p.strip_dirs()
p.sort_stats("cumulative") #p.sort_stats("cumulative")
p.sort_stats("tottime")
#p.print_stats(50) #p.print_stats(50)
p.print_stats() p.print_stats()