308 lines
11 KiB
Python
308 lines
11 KiB
Python
"""
|
|
DeviceLibrary class for managing unique name->device mappings and
|
|
deferred loading or creation.
|
|
"""
|
|
from typing import Dict, Callable, TypeVar, TYPE_CHECKING
|
|
from typing import Any, Tuple, Union, Iterator
|
|
import logging
|
|
from pprint import pformat
|
|
|
|
from ..error import DeviceLibraryError
|
|
from ..library import Library
|
|
|
|
if TYPE_CHECKING:
|
|
from ..builder import Device
|
|
from .. import Pattern
|
|
|
|
|
|
logger = logging.getLogger(__name__)
|
|
|
|
|
|
L = TypeVar('L', bound='DeviceLibrary')
|
|
D = TypeVar('D', bound='LibDeviceLibrary')
|
|
|
|
|
|
class DeviceLibrary:
|
|
"""
|
|
This class maps names to functions which generate or load the
|
|
relevant `Device` object.
|
|
|
|
This class largely functions the same way as `Library`, but
|
|
operates on `Device`s rather than `Patterns` and thus has no
|
|
need for distinctions between primary/secondary devices (as
|
|
there is no inter-`Device` hierarchy).
|
|
|
|
Each device is cached the first time it is used. The cache can
|
|
be disabled by setting the `enable_cache` attribute to `False`.
|
|
"""
|
|
generators: Dict[str, Callable[[], 'Device']]
|
|
cache: Dict[Union[str, Tuple[str, str]], 'Device']
|
|
enable_cache: bool = True
|
|
|
|
def __init__(self) -> None:
|
|
self.generators = {}
|
|
self.cache = {}
|
|
|
|
def __setitem__(self, key: str, value: Callable[[], 'Device']) -> None:
|
|
self.generators[key] = value
|
|
if key in self.cache:
|
|
del self.cache[key]
|
|
|
|
def __delitem__(self, key: str) -> None:
|
|
del self.generators[key]
|
|
if key in self.cache:
|
|
del self.cache[key]
|
|
|
|
def __getitem__(self, key: str) -> 'Device':
|
|
if self.enable_cache and key in self.cache:
|
|
logger.debug(f'found {key} in cache')
|
|
return self.cache[key]
|
|
|
|
logger.debug(f'loading {key}')
|
|
dev = self.generators[key]()
|
|
self.cache[key] = dev
|
|
return dev
|
|
|
|
def __iter__(self) -> Iterator[str]:
|
|
return iter(self.keys())
|
|
|
|
def __contains__(self, key: str) -> bool:
|
|
return key in self.generators
|
|
|
|
def keys(self) -> Iterator[str]:
|
|
return iter(self.generators.keys())
|
|
|
|
def values(self) -> Iterator['Device']:
|
|
return iter(self[key] for key in self.keys())
|
|
|
|
def items(self) -> Iterator[Tuple[str, 'Device']]:
|
|
return iter((key, self[key]) for key in self.keys())
|
|
|
|
def __repr__(self) -> str:
|
|
return '<DeviceLibrary with keys ' + repr(list(self.generators.keys())) + '>'
|
|
|
|
def set_const(self, const: 'Device') -> None:
|
|
"""
|
|
Convenience function to avoid having to manually wrap
|
|
already-generated Device objects into callables.
|
|
|
|
Args:
|
|
const: Pre-generated device object
|
|
"""
|
|
self.generators[const.pattern.name] = lambda: const
|
|
|
|
def add(
|
|
self: D,
|
|
other: D,
|
|
use_ours: Callable[[str], bool] = lambda name: False,
|
|
use_theirs: Callable[[str], bool] = lambda name: False,
|
|
) -> D:
|
|
"""
|
|
Add keys from another library into this one.
|
|
|
|
There must be no conflicting keys.
|
|
|
|
Args:
|
|
other: The library to insert keys from
|
|
use_ours: Decision function for name conflicts. Will be called with duplicate cell names.
|
|
Should return `True` if the value from `self` should be used.
|
|
use_theirs: Decision function for name conflicts. Same format as `use_ours`.
|
|
Should return `True` if the value from `other` should be used.
|
|
`use_ours` takes priority over `use_theirs`.
|
|
|
|
Returns:
|
|
self
|
|
"""
|
|
duplicates = set(self.keys()) & set(other.keys())
|
|
keep_ours = set(name for name in duplicates if use_ours(name))
|
|
keep_theirs = set(name for name in duplicates - keep_ours if use_theirs(name))
|
|
conflicts = duplicates - keep_ours - keep_theirs
|
|
if conflicts:
|
|
raise DeviceLibraryError('Duplicate keys encountered in DeviceLibrary merge: '
|
|
+ pformat(conflicts))
|
|
|
|
for name in set(other.generators.keys()) - keep_ours:
|
|
self.generators[name] = other.generators[name]
|
|
if name in other.cache:
|
|
self.cache[name] = other.cache[name]
|
|
return self
|
|
|
|
def clear_cache(self: D) -> D:
|
|
"""
|
|
Clear the cache of this library.
|
|
This is usually used before modifying or deleting cells, e.g. when merging
|
|
with another library.
|
|
|
|
Returns:
|
|
self
|
|
"""
|
|
self.cache = {}
|
|
return self
|
|
|
|
def add_device(
|
|
self,
|
|
name: str,
|
|
fn: Callable[[], 'Device'],
|
|
dev2pat: Callable[['Device'], 'Pattern'],
|
|
prefix: str = '',
|
|
) -> None:
|
|
"""
|
|
Convenience function for adding a device to the library.
|
|
|
|
- The device is generated with the provided `fn()`
|
|
- Port info is written to the pattern using the provied dev2pat
|
|
- The pattern is renamed to match the provided `prefix + name`
|
|
- If `prefix` is non-empty, a wrapped copy is also added, named
|
|
`name` (no prefix). See `wrap_device()` for details.
|
|
|
|
Adding devices with this function helps to
|
|
- Make sure Pattern names are reflective of what the devices are named
|
|
- Ensure port info is written into the `Pattern`, so that the `Device`
|
|
can be reconstituted from the layout.
|
|
- Simplify adding a prefix to all device names, to make it easier to
|
|
track their provenance and purpose, while also allowing for
|
|
generic device names which can later be swapped out with different
|
|
underlying implementations.
|
|
|
|
Args:
|
|
name: Base name for the device. If a prefix is used, this is the
|
|
"generic" name (e.g. "L3_cavity" vs "2022_02_02_L3_cavity").
|
|
fn: Function which is called to generate the device.
|
|
dev2pat: Post-processing function which is called to add the port
|
|
info into the device's pattern.
|
|
prefix: If present, the actual device is named `prefix + name`, and
|
|
a second device with name `name` is also added (containing only
|
|
this one).
|
|
"""
|
|
def build_dev() -> 'Device':
|
|
dev = fn()
|
|
dev.pattern = dev2pat(dev)
|
|
dev.pattern.rename(prefix + name)
|
|
return dev
|
|
|
|
self[prefix + name] = build_dev
|
|
if prefix:
|
|
self.wrap_device(name, prefix + name)
|
|
|
|
|
|
class LibDeviceLibrary(DeviceLibrary):
|
|
"""
|
|
Extends `DeviceLibrary`, enabling it to ingest `Library` objects
|
|
(e.g. obtained by loading a GDS file).
|
|
|
|
Each `Library` object must be accompanied by a `pat2dev` function,
|
|
which takes in the `Pattern` and returns a full `Device` (including
|
|
port info). This is usually accomplished by scanning the `Pattern` for
|
|
port-related geometry, but could also bake in external info.
|
|
|
|
`Library` objects are ingested into `underlying`, which is a
|
|
`Library` which is kept in sync with the `DeviceLibrary` when
|
|
devices are removed (or new libraries added via `add_library()`).
|
|
"""
|
|
underlying: Library
|
|
|
|
def __init__(self) -> None:
|
|
DeviceLibrary.__init__(self)
|
|
self.underlying = Library()
|
|
|
|
def __delitem__(self, key: str) -> None:
|
|
DeviceLibrary.__delitem__(self, key)
|
|
if key in self.underlying:
|
|
del self.underlying[key]
|
|
|
|
def add_library(
|
|
self: L,
|
|
lib: Library,
|
|
pat2dev: Callable[['Pattern'], 'Device'],
|
|
use_ours: Callable[[str], bool] = lambda name: False,
|
|
use_theirs: Callable[[str], bool] = lambda name: False,
|
|
) -> L:
|
|
"""
|
|
Add a pattern `Library` into this `LibDeviceLibrary`.
|
|
|
|
This requires a `pat2dev` function which can transform each `Pattern`
|
|
into a `Device`. For example, this can be accomplished by scanning
|
|
the `Pattern` data for port location info or by looking up port info
|
|
based on the pattern name or other characteristics in a hardcoded or
|
|
user-supplied dictionary.
|
|
|
|
Args:
|
|
lib: Pattern library to add.
|
|
pat2dev: Function for transforming each `Pattern` object from `lib`
|
|
into a `Device` which will be returned by this device library.
|
|
use_ours: Decision function for name conflicts. Will be called with duplicate cell names.
|
|
Should return `True` if the value from `self` should be used.
|
|
use_theirs: Decision function for name conflicts. Same format as `use_ours`.
|
|
Should return `True` if the value from `other` should be used.
|
|
`use_ours` takes priority over `use_theirs`.
|
|
|
|
Returns:
|
|
self
|
|
"""
|
|
duplicates = set(lib.keys()) & set(self.keys())
|
|
keep_ours = set(name for name in duplicates if use_ours(name))
|
|
keep_theirs = set(name for name in duplicates - keep_ours if use_theirs(name))
|
|
bad_duplicates = duplicates - keep_ours - keep_theirs
|
|
if bad_duplicates:
|
|
raise DeviceLibraryError('Duplicate devices (no action specified): ' + pformat(bad_duplicates))
|
|
|
|
# No 'bad' duplicates, so all duplicates should be overwritten
|
|
for name in keep_theirs:
|
|
self.underlying.demote(name)
|
|
|
|
def use_ours_lib(name: Union[str, Tuple[str, str]]) -> bool:
|
|
if isinstance(name, str):
|
|
return use_ours(name)
|
|
return False #TODO maybe don't always return False for secondary key conflicts?
|
|
|
|
def use_theirs_lib(name: Union[str, Tuple[str, str]]) -> bool:
|
|
if isinstance(name, str):
|
|
return use_theirs(name)
|
|
return False
|
|
|
|
self.underlying.add(lib, use_ours_lib, use_theirs_lib)
|
|
|
|
for name in lib:
|
|
self.generators[name] = lambda name=name: pat2dev(self.underlying[name])
|
|
return self
|
|
|
|
def wrap_device(
|
|
self,
|
|
name: str,
|
|
old_name: str,
|
|
tag: str = '_wrap',
|
|
) -> None:
|
|
"""
|
|
Create a new device which simply contains an instance of an already-existing device.
|
|
|
|
This is useful for assigning an alternate name to a device, while still keeping
|
|
the underlying name available for traceability.
|
|
|
|
Args:
|
|
name: Name for the wrapped device.
|
|
old_name: Name of the existing device to wrap.
|
|
tag: Tag for the new entry in the `underyling` library. Default '_wrap'.
|
|
The default should be usable for most applications.
|
|
"""
|
|
logger.warning('wrap_device needs testing!!!')
|
|
#def build_wrapped_pat() -> Pattern:
|
|
# dev = self[old_name]
|
|
# wrapper = Pattern(name=name)
|
|
# wrapper.addsp(dev.pattern)
|
|
# return wrapper
|
|
## Need to set underlying entry to allow use as a subcomponent
|
|
#self.underlying.set_value(name, tag, build_wrapped_pat)
|
|
|
|
#def build_wrapped_dev() -> Device:
|
|
# dev = self[old_name]
|
|
# wrapper = self.underlying[name]
|
|
# return Device(wrapper, dev.ports)
|
|
|
|
def build_wrapped_dev() -> Device:
|
|
old_dev = self[old_name]
|
|
wrapper = Pattern(name=name)
|
|
wrapper.addsp(old_dev.pattern)
|
|
return Device(wrapper, old_dev.ports)
|
|
|
|
self[name] = build_wrapped_dev
|