mirror of https://github.com/VLSIDA/OpenRAM.git
Return the path in source-to-target order
This commit is contained in:
parent
141a4e3380
commit
9df3c2ac59
|
|
@ -418,6 +418,7 @@ class graph:
|
||||||
path.append(current)
|
path.append(current)
|
||||||
current = came_from[current.id]
|
current = came_from[current.id]
|
||||||
path.append(current)
|
path.append(current)
|
||||||
|
path.reverse()
|
||||||
return path
|
return path
|
||||||
|
|
||||||
# Get the previous node to better calculate the next costs
|
# Get the previous node to better calculate the next costs
|
||||||
|
|
|
||||||
|
|
@ -67,7 +67,7 @@ class signal_escape_router(router):
|
||||||
debug.error("Couldn't route from {} to {}.".format(source, target), -1)
|
debug.error("Couldn't route from {} to {}.".format(source, target), -1)
|
||||||
# Create the path shapes on layout
|
# Create the path shapes on layout
|
||||||
new_shapes = self.add_path(path)
|
new_shapes = self.add_path(path)
|
||||||
self.new_pins[source.name] = new_shapes[0]
|
self.new_pins[source.name] = new_shapes[-1]
|
||||||
# Find the recently added shapes
|
# Find the recently added shapes
|
||||||
self.prepare_gds_reader()
|
self.prepare_gds_reader()
|
||||||
self.find_blockages(name)
|
self.find_blockages(name)
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue