|
|
|
|
@ -1,3 +1,6 @@
|
|
|
|
|
"""
|
|
|
|
|
Main connectivity-checking functionality for `snarl`
|
|
|
|
|
"""
|
|
|
|
|
from typing import Tuple, List, Dict, Set, Optional, Union, Sequence, Mapping
|
|
|
|
|
from collections import defaultdict
|
|
|
|
|
from pprint import pformat
|
|
|
|
|
@ -21,19 +24,50 @@ def trace_connectivity(
|
|
|
|
|
polys: Mapping[layer_t, Sequence[ArrayLike]],
|
|
|
|
|
labels: Mapping[layer_t, Sequence[Tuple[float, float, str]]],
|
|
|
|
|
connectivity: Sequence[Tuple[layer_t, Optional[layer_t], layer_t]],
|
|
|
|
|
label_mapping: Optional[Mapping[layer_t, layer_t]] = None,
|
|
|
|
|
clipper_scale_factor: int = int(2 ** 24),
|
|
|
|
|
) -> NetsInfo:
|
|
|
|
|
"""
|
|
|
|
|
Analyze the electrical connectivity of the layout.
|
|
|
|
|
|
|
|
|
|
This is the primary purpose of `snarl`.
|
|
|
|
|
|
|
|
|
|
The resulting `NetsInfo` will contain only disjoint `nets`, and its `net_aliases` can be used to
|
|
|
|
|
understand which nets are shorted (and therefore known by more than one name).
|
|
|
|
|
|
|
|
|
|
Args:
|
|
|
|
|
polys: A full description of all conducting paths in the layout. Consists of lists of polygons
|
|
|
|
|
(Nx2 arrays of vertices), indexed by layer. The structure looks roughly like
|
|
|
|
|
`{layer0: [poly0, poly1, ..., [(x0, y0), (x1, y1), ...]], ...}`
|
|
|
|
|
labels: A list of "named points" which are used to assign names to the nets they touch.
|
|
|
|
|
A collection of lists of (x, y, name) tuples, indexed *by the layer they target*.
|
|
|
|
|
`{layer0: [(x0, y0, name0), (x1, y1, name1), ...], ...}`
|
|
|
|
|
connectivity: A sequence of 3-tuples specifying the electrical connectivity between layers.
|
|
|
|
|
Each 3-tuple looks like `(top_layer, via_layer, bottom_layer)` and indicates that
|
|
|
|
|
`top_layer` and `bottom_layer` are electrically connected at any location where
|
|
|
|
|
shapes are present on all three (top, via, and bottom) layers.
|
|
|
|
|
`via_layer` may be `None`, in which case any overlap between shapes on `top_layer`
|
|
|
|
|
and `bottom_layer` is automatically considered a short (with no third shape necessary).
|
|
|
|
|
clipper_scale_factor: `pyclipper` uses 64-bit integer math, while we accept either floats or ints.
|
|
|
|
|
The coordinates from `polys` are scaled by this factor to put them roughly in the middle of
|
|
|
|
|
the range `pyclipper` wants; you may need to adjust this if you are already using coordinates
|
|
|
|
|
with large integer values.
|
|
|
|
|
|
|
|
|
|
Returns:
|
|
|
|
|
`NetsInfo` object describing the various nets and their connectivities.
|
|
|
|
|
"""
|
|
|
|
|
#
|
|
|
|
|
# Figure out which layers are metals vs vias, and run initial union on each layer
|
|
|
|
|
#
|
|
|
|
|
metal_layers, via_layers = connectivity2layers(connectivity)
|
|
|
|
|
if label_mapping is None:
|
|
|
|
|
label_mapping = {layer: layer for layer in metal_layers}
|
|
|
|
|
|
|
|
|
|
metal_polys = {layer: union_input_polys(scale_to_clipper(polys[layer], clipper_scale_factor))
|
|
|
|
|
for layer in metal_layers}
|
|
|
|
|
via_polys = {layer: union_input_polys(scale_to_clipper(polys[layer], clipper_scale_factor))
|
|
|
|
|
for layer in via_layers}
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# Check each polygon for labels, and assign it to a net (possibly anonymous).
|
|
|
|
|
#
|
|
|
|
|
nets_info = NetsInfo()
|
|
|
|
|
|
|
|
|
|
merge_groups: List[List[NetName]] = []
|
|
|
|
|
@ -47,27 +81,29 @@ def trace_connectivity(
|
|
|
|
|
for poly in metal_polys[layer]:
|
|
|
|
|
found_nets = label_poly(poly, point_xys, point_names, clipper_scale_factor)
|
|
|
|
|
|
|
|
|
|
name: Optional[str]
|
|
|
|
|
if found_nets:
|
|
|
|
|
name = NetName(found_nets[0])
|
|
|
|
|
else:
|
|
|
|
|
name = NetName() # Anonymous net
|
|
|
|
|
|
|
|
|
|
nets_info.get(name, layer).append(poly)
|
|
|
|
|
nets_info.nets[name][layer].append(poly)
|
|
|
|
|
|
|
|
|
|
if len(found_nets) > 1:
|
|
|
|
|
# Found a short
|
|
|
|
|
logger.warning(f'Nets {found_nets} are shorted on layer {layer} in poly:\n {pformat(poly)}')
|
|
|
|
|
poly = pformat(scale_from_clipper(poly.Contour, clipper_scale_factor))
|
|
|
|
|
logger.warning(f'Nets {found_nets} are shorted on layer {layer} in poly:\n {poly}')
|
|
|
|
|
merge_groups.append([name] + [NetName(nn) for nn in found_nets[1:]])
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# Merge any nets that were shorted by having their labels on the same polygon
|
|
|
|
|
#
|
|
|
|
|
for group in merge_groups:
|
|
|
|
|
first_net, *defunct_nets = group
|
|
|
|
|
for defunct_net in defunct_nets:
|
|
|
|
|
nets_info.merge(first_net, defunct_net)
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# Take EVENODD union within each net
|
|
|
|
|
# & stay in EVENODD-friendly representation
|
|
|
|
|
# Convert to non-hierarchical polygon representation
|
|
|
|
|
#
|
|
|
|
|
for net in nets_info.nets.values():
|
|
|
|
|
for layer in net:
|
|
|
|
|
@ -77,7 +113,9 @@ def trace_connectivity(
|
|
|
|
|
for layer in via_polys:
|
|
|
|
|
via_polys[layer] = hier2oriented(via_polys[layer])
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# Figure out which nets are shorted by vias, then merge them
|
|
|
|
|
#
|
|
|
|
|
merge_pairs = find_merge_pairs(connectivity, nets_info.nets, via_polys)
|
|
|
|
|
for net_a, net_b in merge_pairs:
|
|
|
|
|
nets_info.merge(net_a, net_b)
|
|
|
|
|
@ -85,12 +123,33 @@ def trace_connectivity(
|
|
|
|
|
return nets_info
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def union_input_polys(polys: List[ArrayLike]) -> List[PyPolyNode]:
|
|
|
|
|
def union_input_polys(polys: Sequence[ArrayLike]) -> List[PyPolyNode]:
|
|
|
|
|
"""
|
|
|
|
|
Perform a union operation on the provided sequence of polygons, and return
|
|
|
|
|
a list of `PyPolyNode`s corresponding to all of the outer (i.e. non-hole)
|
|
|
|
|
contours.
|
|
|
|
|
|
|
|
|
|
Note that while islands are "outer" contours and returned in the list, they
|
|
|
|
|
also are still available through the `.Childs` property of the "hole" they
|
|
|
|
|
appear in. Meanwhile, "hole" contours are only accessible through the `.Childs`
|
|
|
|
|
property of their parent "outer" contour, and are not returned in the list.
|
|
|
|
|
|
|
|
|
|
Args:
|
|
|
|
|
polys: A sequence of polygons, `[[(x0, y0), (x1, y1), ...], poly1, poly2, ...]`
|
|
|
|
|
Polygons may be implicitly closed.
|
|
|
|
|
|
|
|
|
|
Returns:
|
|
|
|
|
List of PyPolyNodes, representing all "outer" contours (including islands) in
|
|
|
|
|
the union of `polys`.
|
|
|
|
|
"""
|
|
|
|
|
for poly in polys:
|
|
|
|
|
if (numpy.abs(poly) % 1).any():
|
|
|
|
|
logger.warning('Warning: union_polys got non-integer coordinates; all values will be truncated.')
|
|
|
|
|
break
|
|
|
|
|
|
|
|
|
|
#TODO: check if we need to reverse the order of points in some polygons
|
|
|
|
|
# via sum((x2-x1)(y2+y1)) (-ve means ccw)
|
|
|
|
|
|
|
|
|
|
poly_tree = union_nonzero(polys)
|
|
|
|
|
if poly_tree is None:
|
|
|
|
|
return []
|
|
|
|
|
@ -114,7 +173,27 @@ def label_poly(
|
|
|
|
|
point_names: Sequence[str],
|
|
|
|
|
clipper_scale_factor: int = int(2 ** 24),
|
|
|
|
|
) -> List[str]:
|
|
|
|
|
"""
|
|
|
|
|
Given a `PyPolyNode` (a polygon, possibly with holes) and a sequence of named points,
|
|
|
|
|
return the list of point names contained inside the polygon.
|
|
|
|
|
|
|
|
|
|
Args:
|
|
|
|
|
poly: A polygon, possibly with holes. "Islands" inside the holes (and deeper-nested
|
|
|
|
|
structures) are not considered (i.e. only one non-hole contour is considered).
|
|
|
|
|
point_xys: A sequence of point coordinates (Nx2, `[(x0, y0), (x1, y1), ...]`).
|
|
|
|
|
point_names: A sequence of point names (same length N as point_xys)
|
|
|
|
|
clipper_scale_factor: The PyPolyNode structure is from `pyclipper` and likely has
|
|
|
|
|
a scale factor applied in order to use integer arithmetic. Due to precision
|
|
|
|
|
limitations in `poly_contains_points`, it's prefereable to undo this scaling
|
|
|
|
|
rather than asking for similarly-scaled `point_xys` coordinates.
|
|
|
|
|
NOTE: This could be fixed by using `numpy.longdouble` in
|
|
|
|
|
`poly_contains_points`, but the exact length of long-doubles is platform-
|
|
|
|
|
dependent and so probably best avoided.
|
|
|
|
|
|
|
|
|
|
Result:
|
|
|
|
|
All the `point_names` which correspond to points inside the polygon (but not in
|
|
|
|
|
its holes).
|
|
|
|
|
"""
|
|
|
|
|
poly_contour = scale_from_clipper(poly.Contour, clipper_scale_factor)
|
|
|
|
|
inside = poly_contains_points(poly_contour, point_xys)
|
|
|
|
|
for hole in poly.Childs:
|
|
|
|
|
@ -134,9 +213,24 @@ def find_merge_pairs(
|
|
|
|
|
nets: Mapping[NetName, Mapping[layer_t, Sequence[contour_t]]],
|
|
|
|
|
via_polys: Mapping[layer_t, Sequence[contour_t]],
|
|
|
|
|
) -> Set[Tuple[NetName, NetName]]:
|
|
|
|
|
#
|
|
|
|
|
# Merge nets based on via connectivity
|
|
|
|
|
#
|
|
|
|
|
"""
|
|
|
|
|
Given a collection of (possibly anonymous) nets, figure out which pairs of
|
|
|
|
|
nets are shorted through a via (and thus should be merged).
|
|
|
|
|
|
|
|
|
|
Args:
|
|
|
|
|
connectivity: A sequence of 3-tuples specifying the electrical connectivity between layers.
|
|
|
|
|
Each 3-tuple looks like `(top_layer, via_layer, bottom_layer)` and indicates that
|
|
|
|
|
`top_layer` and `bottom_layer` are electrically connected at any location where
|
|
|
|
|
shapes are present on all three (top, via, and bottom) layers.
|
|
|
|
|
`via_layer` may be `None`, in which case any overlap between shapes on `top_layer`
|
|
|
|
|
and `bottom_layer` is automatically considered a short (with no third shape necessary).
|
|
|
|
|
nets: A collection of all nets (seqences of polygons in mappings indexed by `NetName`
|
|
|
|
|
and layer). See `NetsInfo.nets`.
|
|
|
|
|
via_polys: A collection of all vias (in a mapping indexed by layer).
|
|
|
|
|
|
|
|
|
|
Returns:
|
|
|
|
|
A set containing pairs of `NetName`s for each pair of nets which are shorted.
|
|
|
|
|
"""
|
|
|
|
|
merge_pairs = set()
|
|
|
|
|
for top_layer, via_layer, bot_layer in connectivity:
|
|
|
|
|
if via_layer is not None:
|
|
|
|
|
@ -152,7 +246,7 @@ def find_merge_pairs(
|
|
|
|
|
for bot_name in nets.keys():
|
|
|
|
|
if bot_name == top_name:
|
|
|
|
|
continue
|
|
|
|
|
name_pair = tuple(sorted((top_name, bot_name)))
|
|
|
|
|
name_pair: Tuple[NetName, NetName] = tuple(sorted((top_name, bot_name))) #type: ignore
|
|
|
|
|
if name_pair in merge_pairs:
|
|
|
|
|
continue
|
|
|
|
|
|
|
|
|
|
@ -164,7 +258,7 @@ def find_merge_pairs(
|
|
|
|
|
via_top = intersection_evenodd(top_polys, vias)
|
|
|
|
|
overlap = intersection_evenodd(via_top, bot_polys)
|
|
|
|
|
else:
|
|
|
|
|
overlap = intersection_evenodd(top_polys, bot_polys) # TODO verify there aren't any suspicious corner cases for this
|
|
|
|
|
overlap = intersection_evenodd(top_polys, bot_polys) # TODO verify there aren't any suspicious corner cases for this
|
|
|
|
|
|
|
|
|
|
if not overlap:
|
|
|
|
|
continue
|
|
|
|
|
|
jan
2 years ago