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

Expand grids to maximal pin before removing blockages

This commit is contained in:
Matt Guthaus 2018-12-04 09:35:40 -08:00
parent 389bb91af4
commit 7fce6f06ca
3 changed files with 24 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
compiler/router/pin_group.py
View File

@ -608,7 +608,7 @@ class pin_group:
for pin_list in self.pins: for pin_list in self.pins:
for pin in pin_list: for pin in pin_list:
debug.info(2," Converting {0}".format(pin)) debug.warning(" Expanding conversion {0}".format(pin))
# Determine which tracks the pin overlaps # Determine which tracks the pin overlaps
pin_in_tracks=self.router.convert_pin_to_tracks(self.name, pin, expansion=1) pin_in_tracks=self.router.convert_pin_to_tracks(self.name, pin, expansion=1)
pin_set.update(pin_in_tracks) pin_set.update(pin_in_tracks)
@ -618,7 +618,7 @@ class pin_group:
self.router.write_debug_gds("blocked_pin.gds") self.router.write_debug_gds("blocked_pin.gds")
# We need to route each of the components, so don't combine the groups # We need to route each of the components, so don't combine the groups
self.grids = pin_set | blockage_set self.grids = pin_set
# Remember the secondary grids for removing adjacent pins in wide metal spacing # Remember the secondary grids for removing adjacent pins in wide metal spacing
self.secondary_grids = blockage_set - pin_set self.secondary_grids = blockage_set - pin_set

39
compiler/router/router.py
View File

@ -182,10 +182,10 @@ class router(router_tech):
#print_time("Combine pins",datetime.now(), start_time) #print_time("Combine pins",datetime.now(), start_time)
#self.write_debug_gds("debug_combine_pins.gds",stop_program=True) #self.write_debug_gds("debug_combine_pins.gds",stop_program=True)
# Separate any adjacent grids of differing net names to prevent wide metal DRC violations # Separate any adjacent grids of differing net names that overlap
# Must be done before enclosing pins # Must be done before enclosing pins
#start_time = datetime.now() #start_time = datetime.now()
#self.separate_adjacent_pins(self.supply_rail_space_width) self.separate_adjacent_pins(0)
#print_time("Separate pins",datetime.now(), start_time) #print_time("Separate pins",datetime.now(), start_time)
# For debug # For debug
#self.separate_adjacent_pins(1) #self.separate_adjacent_pins(1)
@ -515,7 +515,7 @@ class router(router_tech):
# scale the size bigger to include neaby tracks # scale the size bigger to include neaby tracks
ll=ll.scale(self.track_factor).floor() ll=ll.scale(self.track_factor).floor()
ur=ur.scale(self.track_factor).ceil() ur=ur.scale(self.track_factor).ceil()
#print(pin)
# Keep tabs on tracks with sufficient and insufficient overlap # Keep tabs on tracks with sufficient and insufficient overlap
sufficient_list = set() sufficient_list = set()
insufficient_list = set() insufficient_list = set()
@ -528,23 +528,26 @@ class router(router_tech):
sufficient_list.update([full_overlap]) sufficient_list.update([full_overlap])
if partial_overlap: if partial_overlap:
insufficient_list.update([partial_overlap]) insufficient_list.update([partial_overlap])
debug.info(3,"Converting [ {0} , {1} ] full={2} partial={3}".format(x,y, full_overlap, partial_overlap)) debug.info(2,"Converting [ {0} , {1} ] full={2} partial={3}".format(x,y, full_overlap, partial_overlap))
# Remove the blocked grids # Return all grids with any potential overlap (sufficient or not)
sufficient_list.difference_update(self.blocked_grids) return sufficient_list|insufficient_list
insufficient_list.difference_update(self.blocked_grids)
if len(sufficient_list)>0: # # Remove the blocked grids
return sufficient_list # sufficient_list.difference_update(self.blocked_grids)
elif expansion==0 and len(insufficient_list)>0: # insufficient_list.difference_update(self.blocked_grids)
best_pin = self.get_all_offgrid_pin(pin, insufficient_list)
#print(best_pin) # if len(sufficient_list)>0:
return best_pin # return sufficient_list
elif expansion>0: # elif expansion==0 and len(insufficient_list)>0:
nearest_pin = self.get_furthest_offgrid_pin(pin, insufficient_list) # best_pin = self.get_all_offgrid_pin(pin, insufficient_list)
return nearest_pin # #print(best_pin)
else: # return best_pin
return set() # elif expansion>0:
# nearest_pin = self.get_furthest_offgrid_pin(pin, insufficient_list)
# return nearest_pin
# else:
# return set()
def get_all_offgrid_pin(self, pin, insufficient_list): def get_all_offgrid_pin(self, pin, insufficient_list):
""" """

2
compiler/router/supply_router.py
View File

@ -71,7 +71,7 @@ class supply_router(router):
#start_time = datetime.now() #start_time = datetime.now()
self.find_pins_and_blockages([self.vdd_name, self.gnd_name]) self.find_pins_and_blockages([self.vdd_name, self.gnd_name])
#print_time("Pins and blockages",datetime.now(), start_time) #print_time("Pins and blockages",datetime.now(), start_time)
self.write_debug_gds("pin_enclosures.gds",stop_program=True) #self.write_debug_gds("pin_enclosures.gds",stop_program=True)
# Add the supply rails in a mesh network and connect H/V with vias # Add the supply rails in a mesh network and connect H/V with vias
#start_time = datetime.now() #start_time = datetime.now()