najaeda 0.1.11__cp313-cp313-macosx_11_0_arm64.whl → 0.1.13__cp313-cp313-macosx_11_0_arm64.whl

najaeda/docs/source/common_classes.rst

@@ -0,0 +1,11 @@
+Common Classes
+==============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+
+.. autoclass:: najaeda.netlist.Attribute
+    :members:
+    :undoc-members:
+    :show-inheritance:

najaeda/docs/source/index.rst

@@ -11,9 +11,7 @@ najaeda documentation
    :caption: Contents:
 
    introduction
-   instance
-   term
-   net
-   equipotential
+   netlist_classes
+   common_classes
    examples
    api

najaeda/docs/source/netlist_classes.rst

@@ -0,0 +1,11 @@
+Netlist Classes
+===============
+
+.. toctree::
+   :maxdepth: 2
+   :caption: Contents:
+   
+   instance
+   term
+   net
+   equipotential

najaeda/net_visitor.py

@@ -0,0 +1,53 @@
+# SPDX-FileCopyrightText: 2024 The Naja authors
+# <https://github.com/najaeda/naja/blob/main/AUTHORS>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+# from typing import Callable
+# from najaeda import netlist
+#
+#
+# class VisitorConfig:
+#     def __init__(
+#         self,
+#         enter_condition: Callable[[netlist.Instance], bool] = lambda node: True,
+#         callback: Callable[..., None] = lambda node, *args, **kwargs: None,
+#         args: tuple = (),
+#         kwargs: dict = None,
+#     ):
+#         """
+#         :param enter_condition: A callable that takes a node (dict)
+#             and returns True if the visitor should enter.
+#         :param callback: A callable that takes a node (dict) and performs an operation on it.
+#         :param args: Positional arguments to pass to the callback.
+#         :param kwargs: Keyword arguments to pass to the callback.
+#         """
+#         self.enter_condition = enter_condition
+#         self.callback = callback
+#         self.args = args
+#         self.kwargs = kwargs or {}
+#
+#
+# def visit(equipotential: netlist.Equipotential, config: VisitorConfig):
+#     """Recursively visits nodes in the netlist hierarchy.
+#
+#     :param instance: The current node in the netlist instance hierarchy.
+#     :param config: VisitorConfig object defining conditions and callbacks.
+#     """
+#     # Execute the callback
+#     config.callback(equipotential, *config.args, **config.kwargs)
+#
+#     # Check if we should proceed to children
+#     if config.enter_condition(equipotential):
+#         for component in equipotential.get .get_child_instances():
+#             visit(child, config)
+#
+# def visit(term: netlist.Term, config: VisitorConfig):
+#     config.callback(term, *config.args, **config.kwargs)
+#
+#     #get the corresponding iterms
+#     instance = term.get_instance()
+#     if instance is not None:
+#         for iterm in instance.get_iterms():
+#             visit(iterm, config)
+#

najaeda/netlist.py

@@ -8,11 +8,16 @@ import time
 import logging
 import hashlib
 import struct
+import sys
 from enum import Enum
 
 from najaeda import snl
 
 
+def get_none_existent():
+    return sys.maxsize
+
+
 def consistent_hash(obj):
     def default_serializer(o):
         if isinstance(o, (str, int, float, bool, type(None))):
@@ -40,14 +45,14 @@ def consistent_hash(obj):
 
 
 def get_snl_instance_from_id_list(id_list: list) -> snl.SNLInstance:
-    top = snl.SNLUniverse.get().getTopDesign()
-    design = top
-    instance = None
-    for id in id_list:
-        instance = design.getInstanceByID(id)
-        assert instance is not None
-        design = instance.getModel()
-    return instance
+    design = snl.SNLUniverse.get().getTopDesign()
+    # instance = None
+    # for id in id_list:
+    #     instance = design.getInstanceByID(id)
+    #     assert instance is not None
+    #     design = instance.getModel()
+    # return instance
+    return design.getInstanceByIDList(id_list)
 
 
 def get_snl_path_from_id_list(id_list: list) -> snl.SNLPath:
@@ -71,7 +76,8 @@ class Equipotential:
     """
 
     def __init__(self, term):
-        snl_term = get_snl_term_for_ids(term.pathIDs, term.termIDs)
+        path = get_snl_path_from_id_list(term.pathIDs)
+        snl_term = get_snl_term_for_ids_with_path(path, term.termIDs)
         inst_term = None
         if isinstance(snl_term, snl.SNLBusTerm):
             raise ValueError("Equipotential cannot be constructed on bus term")
@@ -85,10 +91,10 @@ class Equipotential:
                 self.equi = None
                 return
             else:
+                path = snl.SNLPath(path, get_snl_instance_from_id_list(inst_term.pathIDs))
                 snl_term = get_snl_term_for_ids(inst_term.pathIDs, inst_term.termIDs)
         else:
             inst_term = term
-        path = get_snl_path_from_id_list(inst_term.pathIDs)
         ito = snl.SNLNetComponentOccurrence(
             path.getHeadPath(), path.getTailInstance().getInstTerm(snl_term)
         )
@@ -109,10 +115,10 @@ class Equipotential:
         """
         if self.equi is not None:
             for term in self.equi.getInstTermOccurrences():
-                yield Term(
-                    snl.SNLPath(term.getPath(), term.getInstTerm().getInstance()),
-                    term.getInstTerm().getBitTerm(),
-                )
+                path = term.getPath().getPathIDs()
+                path.append(term.getInstTerm().getInstance().getID())
+                yield Term(path,
+                    term.getInstTerm().getBitTerm())
 
     def get_top_terms(self):
         """Iterate over the top terminals of this equipotential.
@@ -130,12 +136,10 @@ class Equipotential:
                 direction = term.getInstTerm().getDirection()
                 if direction != snl.SNLTerm.Direction.Output:
                     if term.getInstTerm().getInstance().getModel().isLeaf():
-                        yield Term(
-                            snl.SNLPath(
-                                term.getPath(), term.getInstTerm().getInstance()
-                            ),
-                            term.getInstTerm().getBitTerm(),
-                        )
+                        path = term.getPath().getPathIDs()
+                        path.append(term.getInstTerm().getInstance().getID())
+                        yield Term(path,
+                            term.getInstTerm().getBitTerm())
 
     def get_leaf_drivers(self):
         if self.equi is not None:
@@ -143,26 +147,24 @@ class Equipotential:
                 direction = term.getInstTerm().getDirection()
                 if direction != snl.SNLTerm.Direction.Input:
                     if term.getInstTerm().getInstance().getModel().isLeaf():
-                        yield Term(
-                            snl.SNLPath(
-                                term.getPath(), term.getInstTerm().getInstance()
-                            ),
-                            term.getInstTerm().getBitTerm(),
-                        )
+                        path = term.getPath().getPathIDs()
+                        path.append(term.getInstTerm().getInstance().getID())
+                        yield Term(path,
+                            term.getInstTerm().getBitTerm())
 
     def get_top_readers(self):
         if self.equi is not None:
             for term in self.equi.getTerms():
                 direction = term.getDirection()
                 if direction != snl.SNLTerm.Direction.Input:
-                    yield Term(snl.SNLPath(), term)
+                    yield Term([], term)
 
     def get_top_drivers(self):
         if self.equi is not None:
             for term in self.equi.getTerms():
                 direction = term.getDirection()
                 if direction != snl.SNLTerm.Direction.Output:
-                    yield Term(snl.SNLPath(), term)
+                    yield Term([], term)
 
 
 class Net:
@@ -343,10 +345,11 @@ class Net:
         """
         if hasattr(self, "net_concat"):
             raise ValueError("Cannot get inst terms from a net_concat")
+        path = self.pathIDs.copy()
         for term in self.net.getInstTerms():
-            path = self.pathIDs.copy()
             path.append(term.getInstance().getID())
             yield Term(path, term.getBitTerm())
+            path.pop()
 
     def get_design_terms(self):
         """
@@ -374,12 +377,28 @@ def get_snl_term_for_ids(pathIDs, termIDs):
         model = snl.SNLUniverse.get().getTopDesign()
     else:
         model = path.getTailInstance().getModel()
-    if termIDs[1] == -1:
+    if termIDs[1] == get_none_existent():
         return model.getTermByID(termIDs[0])
     else:
         snlterm = model.getTermByID(termIDs[0])
         if isinstance(snlterm, snl.SNLBusTerm):
-            return snlterm.getBit(termIDs[1])
+            return snlterm.getBusTermBit(termIDs[1])
+        else:
+            return snlterm
+
+
+def get_snl_term_for_ids_with_path(path, termIDs):
+    model = None
+    if path.size() == 0:
+        model = snl.SNLUniverse.get().getTopDesign()
+    else:
+        model = path.getTailInstance().getModel()
+    if termIDs[1] == get_none_existent():
+        return model.getTermByID(termIDs[0])
+    else:
+        snlterm = model.getTermByID(termIDs[0])
+        if isinstance(snlterm, snl.SNLBusTerm):
+            return snlterm.getBusTermBit(termIDs[1])
         else:
             return snlterm
 
@@ -390,19 +409,12 @@ class Term:
     INOUT = snl.SNLTerm.Direction.InOut
 
     def __init__(self, path, term):
-        self.termIDs = []
-        if isinstance(term, snl.SNLBusTerm):
-            self.termIDs = [term.getID(), -1]
-        else:
-            self.termIDs = [term.getID(), term.getBit()]
-
-        if isinstance(path, snl.SNLPath):
-            if path.size() > 0:
-                self.pathIDs = path.getPathIDs()
-            else:
-                self.pathIDs = []
-        elif isinstance(path, list):
-            self.pathIDs = path.copy()
+        # self.termIDs = []
+        # if isinstance(term, snl.SNLBusTerm):
+        #     self.termIDs = [term.getID(), -1]
+        # else:
+        self.termIDs = [term.getID(), term.getBit()]
+        self.pathIDs = path.copy()
 
     def __eq__(self, other) -> bool:
         return self.pathIDs == other.pathIDs and self.termIDs == other.termIDs
@@ -434,13 +446,19 @@ class Term:
         return consistent_hash((self.pathIDs, termIDs))
 
     def __str__(self):
+        term_str = ""
         path = get_snl_path_from_id_list(self.pathIDs)
         if path.size() == 0:
-            return get_snl_term_for_ids(self.pathIDs, self.termIDs).getName()
+            term_str = get_snl_term_for_ids(self.pathIDs, self.termIDs).getName()
         else:
-            return (
+            term_str = (
                 f"{path}/{get_snl_term_for_ids(self.pathIDs, self.termIDs).getName()}"
             )
+        if self.is_bus:
+            term_str += f"[{self.get_msb()}:{self.get_lsb()}]"
+        elif self.is_bus_bit:
+            term_str += f"[{self.get_lsb()}]"
+        return term_str
 
     def __repr__(self) -> str:
         path = get_snl_path_from_id_list(self.pathIDs)
@@ -486,6 +504,17 @@ class Term:
         """
         return self.is_scalar() or self.is_bus_bit()
 
+    def get_bit_number(self):
+        """
+        :return: the bit index of the term if it is a bit.
+        :rtype: int or None
+        """
+        if isinstance(
+            get_snl_term_for_ids(self.pathIDs, self.termIDs), snl.SNLBusTermBit
+        ):
+            return get_snl_term_for_ids(self.pathIDs, self.termIDs).getBit()
+        return None
+
     def get_msb(self) -> int:
         """
         :return: the most significant bit of the term if it is a bus.
@@ -651,7 +680,7 @@ class Term:
         if isinstance(get_snl_term_for_ids(self.pathIDs, self.termIDs), snl.SNLBusTerm):
             return Term(
                 self.pathIDs,
-                get_snl_term_for_ids(self.pathIDs, self.termIDs).getBit(index),
+                get_snl_term_for_ids(self.pathIDs, self.termIDs).getBusTermBit(index),
             )
         return None
 
@@ -727,12 +756,24 @@ class Attribute:
         return str(self.snlAttribute)
 
     def get_name(self):
+        """
+        :return: the name of the attribute.
+        :rtype: str
+        """
         return self.snlAttribute.getName()
 
     def has_value(self):
+        """
+        :return: True if the attribute has a value.
+        :rtype: bool
+        """
         return self.snlAttribute.hasValue()
 
     def get_value(self):
+        """
+        :return: the value of the attribute.
+        :rtype: str
+        """
         return self.snlAttribute.getValue()
 
 
@@ -742,13 +783,23 @@ class Instance:
     """
 
     def __init__(self, path=snl.SNLPath()):
+        self.inst = None
+        self.revisionCount = 0
+        self.SNLID = [0, 0, 0, 0, 0, 0]
         if isinstance(path, snl.SNLPath):
             if path.size() > 0:
                 self.pathIDs = path.getPathIDs()
+                self.revisionCount = path.getTailInstance().getModel().getRevisionCount()
+                self.inst = path.getTailInstance()
             else:
                 self.pathIDs = []
         elif isinstance(path, list):
             self.pathIDs = path.copy()
+            if len(path) > 0:
+                self.inst = get_snl_instance_from_id_list(path)
+                self.revisionCount = self.inst.getModel().getRevisionCount()
+        if self.inst is not None:
+            self.SNLID = self.inst.getModel().getSNLID()
 
     def __eq__(self, other) -> bool:
         return self.pathIDs == other.pathIDs
@@ -774,6 +825,7 @@ class Instance:
     def get_leaf_children(self):
         """Iterate over the leaf children of this Instance.
         Equivalent to the underlying leaves of the instanciation tree.
+
         :return: an iterator over the leaf children Instance of this Instance.
         :rtype: Iterator[Instance]
         """
@@ -801,7 +853,7 @@ class Instance:
         return len(self.pathIDs) == 0
 
     def is_assign(self) -> bool:
-        """Example: (assign a=b) will create an instance of assign connecting
+        """(assign a=b) will create an instance of assign connecting
         the wire a to the output of the assign and b to the input.
 
         :return: True if this is an assign. Assigns are represented with
@@ -859,11 +911,24 @@ class Instance:
         """
         return self.__get_snl_model().isInv()
 
+    def is_basic_primitive(instance):
+        design = instance.__get_snl_model()
+        return (
+            design.isConst0() or design.isConst1() or design.isBuf() or design.isInv()
+        )
+
     def __get_snl_model(self):
         if self.is_top():
             return snl.SNLUniverse.get().getTopDesign()
-        instance = get_snl_instance_from_id_list(self.pathIDs)
-        return instance.getModel()
+        if (
+            self.inst.getModel().getRevisionCount() != self.revisionCount or
+            self.inst.getModel().getSNLID() != self.SNLID
+        ):
+            self.inst = get_snl_instance_from_id_list(self.pathIDs)
+            self.revisionCount = self.inst.getModel().getRevisionCount()
+            self.SNLID = self.inst.getModel().getSNLID()
+
+        return self.inst.getModel()
 
     def __get_leaf_snl_object(self):
         if self.is_top():
@@ -906,10 +971,11 @@ class Instance:
         :return: an iterator over the child instances of this instance.
         :rtype: Iterator[Instance]
         """
+        path = get_snl_path_from_id_list(self.pathIDs)
         for inst in self.__get_snl_model().getInstances():
-            path = self.pathIDs.copy()
-            path.append(inst.getID())
-            yield Instance(path)
+            path_child = snl.SNLPath(path, inst)
+            yield Instance(path_child)
+            # path.pop()
 
     def get_number_of_child_instances(self) -> int:
         """
@@ -1041,8 +1107,11 @@ class Instance:
                 yield Term(self.pathIDs, term)
 
     def get_flat_output_terms(self):
-        """Return the flat output terms of the instance.
-        This will iterate over all scalar output terms and bus output term bits.
+        """Iterate over all scalar output terms and bus output term bits
+        of this Instance.
+
+        :return: the flat output terms of this Instance.
+        :rtype: Iterator[Term]
         """
         for term in self.__get_snl_model().getTerms():
             if term.getDirection() != snl.SNLTerm.Direction.Input:
@@ -1053,6 +1122,11 @@ class Instance:
                     yield Term(self.pathIDs, term)
 
     def get_attributes(self):
+        """Iterate over the attributes of this Instance.
+
+        :return: the attributes of this Instance.
+        :rtype: Iterator[Attribute]
+        """
         leaf_object = self.__get_leaf_snl_object()
         for attribute in leaf_object.getAttributes():
             yield Attribute(attribute)
@@ -1160,7 +1234,7 @@ class Instance:
             path = get_snl_path_from_id_list(self.pathIDs)
         design = self.__get_snl_model()
         newSNLTerm = snl.SNLScalarTerm.create(design, direction, name)
-        return Term(path, newSNLTerm)
+        return Term(path.getPathIDs(), newSNLTerm)
 
     def create_output_term(self, name: str) -> Term:
         """Create an output Term in this Instance with the given name.
@@ -1191,6 +1265,7 @@ class Instance:
 
     def create_bus_term(self, name: str, msb: int, lsb: int, direction) -> Term:
         """Create a bus Term in this Instance with the given name, msb, lsb and direction.
+
         :param str name: the name of the Term to create.
         :param int msb: the most significant bit of the Term to create.
         :param int lsb: the least significant bit of the Term to create.
@@ -1200,10 +1275,9 @@ class Instance:
         path = get_snl_path_from_id_list(self.pathIDs)
         if path.size() > 0:
             snl.SNLUniquifier(path)
-            path = get_snl_path_from_id_list(self.pathIDs)
         design = self.__get_snl_model()
         newSNLTerm = snl.SNLBusTerm.create(design, direction, msb, lsb, name)
-        return Term(path, newSNLTerm)
+        return Term(self.pathIDs, newSNLTerm)
 
     def create_inout_bus_term(self, name: str, msb: int, lsb: int) -> Term:
         """Create an inout bus Term in this Instance with the given name, msb and lsb.
@@ -1312,10 +1386,17 @@ def create_top(name: str) -> Instance:
     return Instance()
 
 
-def load_verilog(files: list):
+class VerilogConfig:
+    def __init__(self, keep_assigns=True):
+        self.keep_assigns = keep_assigns
+
+
+def load_verilog(files: list, config: VerilogConfig = None) -> Instance:
+    if config is None:
+        config = VerilogConfig()  # Use default settings
     start_time = time.time()
     logging.info(f"Loading verilog: {', '.join(files)}")
-    get_top_db().loadVerilog(files)
+    get_top_db().loadVerilog(files, keep_assigns=config.keep_assigns)
     execution_time = time.time() - start_time
     logging.info(f"Loading done in {execution_time:.2f} seconds")
     return get_top()
@@ -1328,7 +1409,9 @@ def load_liberty(files: list):
 
 def load_primitives(name: str):
     """Loads a primitive library embedded in najaeda.
+
     Currently supported libraries are:
+
     - xilinx
     """
     if name == "xilinx":

najaeda/primitives/xilinx.py

@@ -2,6 +2,7 @@
 #
 # SPDX-License-Identifier: Apache-2.0
 
+import logging
 from najaeda import snl
 
 
@@ -426,6 +427,7 @@ def constructRAMB36E1(lib):
 
 
 def load(db):
+    logging.info("Loading Xilinx primitives")
     lib = snl.SNLLibrary.createPrimitives(db, "xilinx")
     constructIBUF(lib)
     constructOBUF(lib)

najaeda/stats.py

@@ -150,10 +150,8 @@ class InstanceStats:
             )
 
 
-def is_basic_primitive(design):
-    return (
-        design.is_const0() or design.is_const1() or design.is_buf() or design.is_inv()
-    )
+def is_basic_primitive(instance):
+    return instance.is_basic_primitive()
 
 
 def compute_instance_stats(instance, instances_stats):

najaeda-0.1.13.dist-info/METADATA

@@ -0,0 +1,79 @@
+Metadata-Version: 2.1
+Name: najaeda
+Version: 0.1.13
+Summary: Naja EDA Python package
+Author-Email: Naja Authors <contact@keplertech.io>
+License: Apache License 2.0
+Project-URL: Homepage, https://github.com/najaeda/naja
+Requires-Python: >=3.8
+Description-Content-Type: text/x-rst
+
+Naja EDA Python Package
+=======================
+
+Naja EDA is a Python package that provides data structures and APIs for developing post-synthesis Electronic Design Automation (EDA) algorithms.
+
+Naja EDA provides a powerful yet simple framework designed to help software
+and hardware developers efficiently navigate and manipulate electronic
+design automation (EDA) workflows.
+
+With Naja EDA, you can:
+
+* Explore Netlists with Ease:
+
+  * Navigate netlist hierarchy and connectivity effortlessly.
+  * Browse at multiple levels of detail:
+
+    * Bit-level or bus-level granularity.
+    * Instance-by-instance exploration or flattened views at the primitives level.
+    * Localized per-instance connections or comprehensive equipotential views.
+
+* Perform ECO (Engineering Change Order) Transformations:
+
+  * Seamlessly apply and manage changes to your designs.
+
+* Prototype EDA Ideas Quickly:
+
+  * Use an intuitive API to experiment with new EDA concepts and workflows.
+
+* Develop Custom EDA Tools:
+
+  * Build fast, tailored tools for solving specific challenges without relying on costly, proprietary EDA software.
+
+Naja EDA empowers developers to innovate, adapt, and accelerate their EDA
+processes with minimal overhead.
+
+Naja EDA is the Python counterpart of the `Naja C++ project <https://github.com/najaeda/naja>`_.
+
+If you’re interested in this project, please consider starring it on GitHub.
+Feel free to reach out to us anytime at `contact@keplertech.io <mailto:contact@keplertech.io>`_.
+
+Installation
+------------
+
+Install Naja EDA using pip:
+
+.. code-block:: bash
+
+    pip install najaeda
+
+Documentation
+-------------
+
+Naja EDA online documentation is available `here <https://najaeda.readthedocs.io/en/latest/index.html>`_.
+
+Examples
+--------
+
+A list of examples can be found in this
+documentation `section <https://najaeda.readthedocs.io/en/latest/examples.html>`_.
+
+Support
+-------
+If you encounter any issues or have questions, please report them on the
+`Naja issue tracker <https://github.com/najaeda/naja/issues>`_.
+
+License
+-------
+This project is licensed under the Apache License 2.0. \
+See the `LICENSE <https://github.com/najaeda/naja/blob/main/LICENSE>`_ file for details.

{najaeda-0.1.11.dist-info → najaeda-0.1.13.dist-info}/RECORD

@@ -1,19 +1,20 @@
-najaeda-0.1.11.dist-info/RECORD,,
-najaeda-0.1.11.dist-info/WHEEL,sha256=PJzLOGr1UQbVJ9ClJnwqiFhnlyWYjSsyNgebnLgIQKg,114
-najaeda-0.1.11.dist-info/METADATA,sha256=Kl445PNmMAaclhm5MqkBms6A5AmGvDpGs8aFr36wyMw,7218
-najaeda-0.1.11.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
-najaeda-0.1.11.dist-info/licenses/AUTHORS,sha256=7NYEGDAX_1QZvCCHfq8YVXC5ZbwH_pbNI8DcSmm70GU,377
-najaeda/netlist.py,sha256=xutSwtSsMHtXefn8vG1JVMUm_XZMOv_6wQfxywDvF8U,46275
-najaeda/libnaja_snl_python.dylib,sha256=68PJlYLdLZ_ECcHT3_IIF1gTvJ6Q3hnD3h0xrm9by3g,825616
+najaeda-0.1.13.dist-info/RECORD,,
+najaeda-0.1.13.dist-info/WHEEL,sha256=PJzLOGr1UQbVJ9ClJnwqiFhnlyWYjSsyNgebnLgIQKg,114
+najaeda-0.1.13.dist-info/METADATA,sha256=_MF_KzBJGkauW1DVSxFnM0A-0BmFqz1L3vr0WyDBeVA,2475
+najaeda-0.1.13.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
+najaeda-0.1.13.dist-info/licenses/AUTHORS,sha256=7NYEGDAX_1QZvCCHfq8YVXC5ZbwH_pbNI8DcSmm70GU,377
+najaeda/netlist.py,sha256=8HvicL1VCsozjMZ8Fl0SS8OQyI4XREEhSwMQ5xKqVBc,49050
+najaeda/libnaja_snl_python.dylib,sha256=ArFvLzetWBUGctsNZ-Kwb6MnH1SWOyV8mbVKDXjqDQM,887360
 najaeda/pandas_stats.py,sha256=yOb4ka965U7rN4D6AwvSGmRyeT_O7Ed-5cmT8BFbfeo,1070
 najaeda/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-najaeda/libnaja_snl.dylib,sha256=Vnih_WkRfWljfXKCkqkDY43NQ7RtHgCI7-YfS7i0vQY,574176
-najaeda/snl.so,sha256=jLLEWjnuzaSCSJsHYEeIVir026oaLAqBs7KKty0koBA,98272
-najaeda/stats.py,sha256=xWiIHa-S9yCHgAjyi6fVtx9C96o9v4MkYU7x5GdRKwA,16250
+najaeda/net_visitor.py,sha256=P_esjibYb-wBDuF-AyF7es9sJYw1Ha8RhTPu-qKe7G4,1940
+najaeda/libnaja_snl.dylib,sha256=_W6nRABcp6q9xoBF0hTOBDWwHBUB6-n8anUoTyNkn-s,574288
+najaeda/snl.so,sha256=VpKDYKLX0RzGO3gC9OGY-owFF_JRe7t9iiCFJ5fgtZE,98272
+najaeda/stats.py,sha256=wackXsf0x24ic9v-UifECHj4t5yveUWssMDZp2B057A,16187
 najaeda/instance_visitor.py,sha256=JMsPSQaWNiDjxS05rxg83a0PIsrOIuTi9G35hkwdibs,1530
 najaeda/docs/requirements.txt,sha256=1XIBGTIplm2arC9HhDCfLuAjozGdVSXkqmOj8ybuT6U,121
 najaeda/docs/.readthedocs.yaml,sha256=nN_Psro-YdfPcIiueZkJcZepts68g23rqVThhKnmVRw,790
-najaeda/docs/source/index.rst,sha256=otNU_o72UQp2jEiF4ymADbfU8OeZqQme0K_JQz4kfSU,394
+najaeda/docs/source/index.rst,sha256=80VMfeEGHObnOUXRBxIzISQsG_HNkgT-pUpsDZsCfOY,387
 najaeda/docs/source/instance.rst,sha256=7B2IBB0p32Tb4qvOCE77OlrQaYpFADvmTlq1q8eyVqw,458
 najaeda/docs/source/conf.py,sha256=iSeerg2pJlZlhtwkJ9edRRYrLEdx3R1p7GWi78dHP1o,2019
 najaeda/docs/source/preprocessor.py,sha256=TK4LsTdNbv2dxkKQaJ7cEyo9PU5v_56vlrFCJYIPKf8,2625
@@ -21,8 +22,12 @@ najaeda/docs/source/term.rst,sha256=QKWT6u1xjEjusvcZYknKQ-M83ibohO5y1EYTQnnXqak,
 najaeda/docs/source/net.rst,sha256=i6YEir8ZOldSY8-UmPxgVJ4Ot3y-Q6seRkBr2H-KmXc,732
 najaeda/docs/source/visitors.rst,sha256=KScCr7BytrhFxWfZPyYWIrr3CEJuk5Tx-LjEuDnnBaA,227
 najaeda/docs/source/examples.rst.in,sha256=4ZStOA3N5VHbKZgdn2kaEQZL7wPoJwODS2E1BO54uFY,2091
+najaeda/docs/source/common_classes.rst,sha256=o20u3mcpFYINwy0sVdye90ZPMQcPqoH3V4ERKcG7SZI,181
 najaeda/docs/source/equipotential.rst,sha256=0MDi-4fPEsX7K_ezWj5DB3mCalnhqN-sicYbQKYQfNc,335
+najaeda/docs/source/netlist_classes.rst,sha256=Zrha9MQVEdEwxmP2zhgC0K3iioZXXerzeFoOz5SrOXM,132
 najaeda/docs/source/introduction.rst,sha256=kE4qxEJCgcAswiT3rIJS21oBYIMg1cyT_rKmOzQgvsI,2095
 najaeda/docs/source/api.rst,sha256=47VCPyF4Py_1cklZ3q9fmOMhqqI17rxwU_VUJETfCwY,151
+najaeda/.dylibs/libcapnp-1.1.0.dylib,sha256=l9SvRdxPrCI2mB_UitO7QjsaC7I5mq2R3rZjoIQKEYI,709328
+najaeda/.dylibs/libkj-1.1.0.dylib,sha256=pB7dMks8b8ybJ6xKWqFR_hHjKsmpf7wzbcunZaS7gO4,578320
 najaeda/primitives/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-najaeda/primitives/xilinx.py,sha256=fuu4KxEIuC0ueCK4C_gds6hzgtJsLE3tjDtOHtY9McM,25947
+najaeda/primitives/xilinx.py,sha256=_VPQfWAp3oc4EgOzW-gy96BXdFZK6E4C7aOSdCn4JRU,26008

najaeda-0.1.11.dist-info/METADATA

@@ -1,203 +0,0 @@
-Metadata-Version: 2.1
-Name: najaeda
-Version: 0.1.11
-Summary: Naja EDA Python package
-Author-Email: Naja Authors <contact@keplertech.io>
-License: Apache License 2.0
-Project-URL: Homepage, https://github.com/najaeda/naja
-Requires-Python: >=3.8
-Description-Content-Type: text/x-rst
-
-Naja EDA Python Package
-=======================
-
-Naja EDA is a Python package that provides data structures and APIs for developing post-synthesis Electronic Design Automation (EDA) algorithms.
-
-Naja EDA provides a powerful yet simple framework designed to help software
-and hardware developers efficiently navigate and manipulate electronic
-design automation (EDA) workflows.
-
-With Naja EDA, you can:
-
-* Explore Netlists with Ease:
-
-  * Navigate netlist hierarchy and connectivity effortlessly.
-  * Browse at multiple levels of detail:
-
-    * Bit-level or bus-level granularity.
-    * Instance-by-instance exploration or flattened views at the primitives level.
-    * Localized per-instance connections or comprehensive equipotential views.
-
-* Perform ECO (Engineering Change Order) Transformations:
-
-  * Seamlessly apply and manage changes to your designs.
-
-* Prototype EDA Ideas Quickly:
-
-  * Use an intuitive API to experiment with new EDA concepts and workflows.
-
-* Develop Custom EDA Tools:
-
-  * Build fast, tailored tools for solving specific challenges without relying on costly, proprietary EDA software.
-
-Naja EDA empowers developers to innovate, adapt, and accelerate their EDA
-processes with minimal overhead.
-
-Naja EDA is the Python counterpart of the `Naja C++ project <https://github.com/najaeda/naja>`_.
-
-Installation
-------------
-
-Install Naja EDA using pip:
-
-.. code-block:: bash
-
-    pip install najaeda
-
-Documentation
--------------
-
-Naja EDA online documentation is available `here <https://najaeda.readthedocs.io/en/latest/index.html>`_.
-
-Examples
---------
-
-Load a design from a liberty file and a Verilog file
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-Following snippet shows how to load primitive cells from a liberty file and
-a netlist from a Verilog file.
-
-.. code-block:: python
-
-    benchmarks = path.join('..','benchmarks')
-    liberty_files = [
-        'NangateOpenCellLibrary_typical.lib',
-        'fakeram45_1024x32.lib',
-        'fakeram45_64x32.lib'
-    ]
-    liberty_files = list(map(lambda p:path.join(benchmarks, 'liberty', p), liberty_files))
-        
-    netlist.load_liberty(liberty_files)
-    top = netlist.load_verilog([path.join(benchmarks, 'verilog', 'tinyrocket.v')])
-    
-    top.dump_verilog('.', 'tinyrocket_naja.v')
-
-Load a design with pre-existing libraries
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-In FPGA design environments, Liberty files are often unavailable.
-
-To address this, the following example demonstrates how to load primitives
-without relying on Liberty files.
-
-Naja EDA comes with pre-configured libraries to simplify this process.
-Currently, it includes support for partial Xilinx primitives, but this can be
-easily extended in the future. Don't hesitate to reach out if you need help.
-
-.. code-block:: python
-
-    netlist.load_primitives('xilinx')
-    benchmarks = path.join('..','benchmarks')
-    top = netlist.load_verilog([path.join(benchmarks, 'verilog', 'vexriscv.v')])
-
-Print all the instances in the netlist
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-Next example shows how to browse all the netlist and print all its content recursively.
-
-.. code-block:: python
-
-    def print_netlist(instance):
-        for child_instance in instance.get_child_instances():
-            print(f"{child_instance}:{child_instance.get_model_name()}")
-            print_netlist(child_instance)
-
-Similar to the previous example, but utilizing an instance visitor.
-This approach allows you to perform operations on each instance while
-also defining conditions for stopping or continuing exploration.
-
-.. code-block:: python
-
-    def print_instance(instance):
-        print(f"{instance}:{instance.get_model_name()}")
-    visitor_config = instance_visitor.VisitorConfig(callback=print_instance)
-    instance_visitor.visit(top, visitor_config)
-
-Counting the Number of Leaves in a Netlist
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-The instance visitor provides a tool for collecting various types of information
-about a netlist.
-
-The following example demonstrates how to use the visitor’s callback
-function to transmit user-defined arguments, allowing for flexible data processing.
-
-This specific use case shows how to count the number of leaf instances in a netlist.
-
-.. code-block:: python
-
-    leaves = {"count": 0, "assigns": 0, "constants": 0}
-    def count_leaves(instance, leaves):
-        if instance.is_leaf():
-            if instance.is_assign():
-                leaves["assigns"] += 1
-            elif instance.is_const():
-                leaves["constants"] += 1
-            else:
-                leaves["count"] += 1
-    visitor_config = instance_visitor.VisitorConfig(callback=count_leaves, args=(leaves,))
-    instance_visitor.visit(top, visitor_config)
-    print(f"{top} leaves count")
-    print(f"nb_assigns={leaves['assigns']}")
-    print(f"nb constants={leaves['constants']}")
-    print(f"nb other leaves={leaves['count']}")
-
-DLE (Dead Logic Elimination)
-~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-This example demonstrates how to perform Dead Logic Elimination (DLE) on a netlist.
-
-.. code-block:: python
-
-    def apply_dle(top):
-        # Trace back from design outputs
-        visited = set()
-        traced_terms = top.get_flat_output_terms()
-        for leaf in top.get_leaf_children():
-            atrributes =  list(leaf.get_attributes())
-            for attr in atrributes:
-                if attr.get_name() == 'DONT_TOUCH' or attr.get_name() == 'KEEP' or attr.get_name() == 'preserve' or attr.get_name() == 'noprune':
-                    for term in leaf.get_flat_input_terms():
-                        traced_terms.append(term)
-        for termToTrace in traced_terms:
-            queue = deque([termToTrace])
-            while queue:
-                term = queue.popleft()
-                if term in visited:
-                    continue
-                visited.add(term)
-                equipotential = term.get_equipotential()
-                leaf_drivers = equipotential.get_leaf_drivers()
-                for driver in leaf_drivers:
-                    instance = driver.get_instance()
-                    instances.add(instance)
-                    input_terms = instance.get_flat_input_terms()
-                    queue.extend(input_terms)
-        
-        
-        to_delete = [leaf for leaf in top.get_leaf_children() if leaf not in instances]
-        for leaf in to_delete:
-            leaf.delete()
-        return to_delete
-
-Documentation
--------------
-Naja EDA is a work in progress, and the documentation is still under development.
-
-Naja documentation is available on the `Naja GitHub repository <https://github.com/najaeda/naja>`_.
-
-Support
--------
-If you encounter any issues or have questions, please report them on the
-`Naja issue tracker <https://github.com/najaeda/naja/issues>`_.
-
-License
--------
-This project is licensed under the Apache License 2.0. \
-See the `LICENSE <https://github.com/najaeda/naja/blob/main/LICENSE>`_ file for details.