najaeda 0.1.9__cp313-cp313-macosx_11_0_arm64.whl → 0.1.12__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/netlist.py

@@ -8,6 +8,7 @@ import time
 import logging
 import hashlib
 import struct
+from enum import Enum
 
 from najaeda import snl
 
@@ -165,6 +166,13 @@ class Equipotential:
 
 
 class Net:
+    class Type(Enum):
+        STANDARD = snl.SNLNet.Type.Standard
+        ASSIGN0 = snl.SNLNet.Type.Assign0
+        ASSIGN1 = snl.SNLNet.Type.Assign1
+        SUPPLY0 = snl.SNLNet.Type.Supply0
+        SUPPLY1 = snl.SNLNet.Type.Supply1
+
     def __init__(self, path, net=None, net_concat=None):
         if net is not None and net_concat is not None:
             raise ValueError(
@@ -272,10 +280,21 @@ class Net:
         """
         if hasattr(self, "net"):
             return self.net.isConstant()
-        for net in self.net_concat:
-            if not net.isConstant():
-                return False
-        return True
+        else:
+            for net in self.net_concat:
+                if not net.isConstant():
+                    return False
+            return True
+
+    def set_type(self, net_type: Type):
+        """
+        :param Type net_type: the type of the net.
+        """
+        if hasattr(self, "net"):
+            self.net.setType(net_type.value)
+        else:
+            for net in self.net_concat:
+                net.setType(net_type.value)
 
     def get_width(self) -> int:
         """
@@ -300,7 +319,7 @@ class Net:
                 yield self
         else:
             for net in self.net_concat:
-                yield net
+                yield Net(net)
 
     def get_bit(self, index: int):
         """
@@ -685,19 +704,48 @@ def get_instance_by_path(names: list):
     return Instance(path)
 
 
-def refresh_path(path: snl.SNLPath):
-    pathlist = path.getPathIDs()
-    assert len(pathlist) > 0
-    path = snl.SNLPath()
-    instance = None
-    top = snl.SNLUniverse.get().getTopDesign()
-    design = top
-    for id in pathlist:
-        path = snl.SNLPath(path, design.getInstanceByID(id))
-        instance = design.getInstanceByID(id)
-        assert instance is not None
-        design = instance.getModel()
-    return path
+# def refresh_path(path: snl.SNLPath):
+#    pathlist = path.getPathIDs()
+#    assert len(pathlist) > 0
+#    path = snl.SNLPath()
+#    instance = None
+#    top = snl.SNLUniverse.get().getTopDesign()
+#    design = top
+#    for id in pathlist:
+#        path = snl.SNLPath(path, design.getInstanceByID(id))
+#        instance = design.getInstanceByID(id)
+#        assert instance is not None
+#        design = instance.getModel()
+#    return path
+
+
+class Attribute:
+    def __init__(self, snlAttribute):
+        self.snlAttribute = snlAttribute
+
+    def __str__(self):
+        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()
 
 
 class Instance:
@@ -738,6 +786,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]
         """
@@ -765,7 +814,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
@@ -829,6 +878,11 @@ class Instance:
         instance = get_snl_instance_from_id_list(self.pathIDs)
         return instance.getModel()
 
+    def __get_leaf_snl_object(self):
+        if self.is_top():
+            return snl.SNLUniverse.get().getTopDesign()
+        return get_snl_instance_from_id_list(self.pathIDs)
+
     def __find_snl_model(self, name: str) -> snl.SNLDesign:
         u = snl.SNLUniverse.get()
         for db in u.getUserDBs():
@@ -1000,8 +1054,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:
@@ -1011,6 +1068,16 @@ class Instance:
                 else:
                     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)
+
     def delete_instance(self, name: str):
         """Delete the child instance with the given name."""
         if name == "":
@@ -1145,6 +1212,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.
@@ -1282,7 +1350,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/pandas_stats.py

@@ -0,0 +1,32 @@
+# SPDX-FileCopyrightText: 2023 The Naja authors <https://github.com/najaeda/naja/blob/main/AUTHORS>
+#
+# SPDX-License-Identifier: Apache-2.0
+
+import argparse
+import pandas as pd
+
+if __name__ == "__main__":
+    parser = argparse.ArgumentParser(
+        description="Load JSON and generate statistics using Pandas."
+    )
+    parser.add_argument("json_file", type=str, help="Path to the input JSON file.")
+    parser.add_argument(
+        "--output",
+        type=str,
+        default="design_stats.png",
+        help="Optional: Save computed statistics to this JSON file.",
+    )
+    args = parser.parse_args()
+
+    df = pd.read_json(args.json_file)
+    pandas_data = pd.DataFrame(df.set_index("Name"))
+    plot = pandas_data.plot.bar(y=["terms", "nets", "instances"], stacked=True)
+
+    # Customize plot
+    plot.set_title("Design Statistics", fontsize=16, fontweight="bold")
+    plot.set_xlabel("Design Name", fontsize=12)
+    plot.set_ylabel("Count", fontsize=12)
+
+    plot_figure = plot.get_figure()
+    plot_figure.tight_layout()
+    plot_figure.savefig(args.output)

najaeda/stats.py

@@ -3,16 +3,121 @@
 # SPDX-License-Identifier: Apache-2.0
 
 import logging
+import json
+
 from najaeda import netlist
 
 
-class DesignsStats:
+class InstancesStats:
     def __init__(self):
         self.blackboxes = dict()
-        self.hier_designs = dict()
+        self.hier_instances = dict()
+
+    def dump_instance_stats_text(self, instance, stats_files):
+        dumped_models = set()
+        self.__dump_instance_stats_text(instance, stats_files, dumped_models)
+
+    def __dump_stats(self, file, value_name, value):
+        file.write(f"{value_name}: {value} \n")
+
+    def __dump_terms_stats_text(self, instance_stats, file):
+        file.write("Terms: ")
+        first = True
+        for terms in instance_stats.terms.items():
+            if not first:
+                file.write(", ")
+            else:
+                first = False
+            file.write(terms[0] + ":" + str(terms[1]))
+        file.write("\n")
+
+    def __dump_instances(self, stats_file, title, instances):
+        if len(instances) == 0:
+            return
+        sorted_instances = sorted(
+            instances.items(), key=lambda item: netlist.get_model_name(item[0])
+        )
+        stats_file.write(title + " " + str(sum(j for i, j in sorted_instances)) + "\n")
+        line_char = 0
+        for instance in sorted_instances:
+            model_name = netlist.get_model_name(instance[0])
+            if line_char != 0:
+                stats_file.write(",")
+                line_char += 1
+            if line_char > 80:
+                stats_file.write("\n")
+                line_char = 0
+            elif line_char != 0:
+                stats_file.write(" ")
+                line_char += 1
+            instance_char = model_name + ":" + str(instance[1])
+            line_char += len(instance_char)
+            stats_file.write(instance_char)
+        stats_file.write("\n\n")
+
+    def __dump_instance_stats_text(self, instance, file, dumped_models):
+        if instance.is_primitive() or instance.is_blackbox():
+            return
+        # Only dump once each model
+        model_id = instance.get_model_id()
+        if model_id in dumped_models:
+            return
+        dumped_models.add(model_id)
+
+        file.write("*** " + instance.get_name() + " ***\n")
 
+        instance_stats = self.hier_instances.get(model_id)
+        if instance_stats is None:
+            print(
+                "Cannot find " + str(instance.get_model_name()) + " in instance_stats"
+            )
+            raise
+
+        if len(instance_stats.terms) > 0:
+            self.__dump_terms_stats_text(instance_stats, file)
+
+        # self.__dump_instances(stats_file, "Instances:", design_stats.ins)
+        nb_primitives = sum(instance_stats.basic_primitives.values()) + sum(
+            instance_stats.primitives.values()
+        )
+        if nb_primitives > 1:
+            self.__dump_stats(file, "Primitives", nb_primitives)
+
+        self.__dump_instances(
+            file, "Simple Primitives:", instance_stats.basic_primitives
+        )
+        self.__dump_instances(file, "Other Primitives:", instance_stats.primitives)
+        self.__dump_instances(file, "Blackboxes:", instance_stats.blackboxes)
+
+        if instance_stats.assigns > 0:
+            self.__dump_stats(file, "Assigns", instance_stats.assigns)
+
+        self.__dump_instances(file, "Flat Instances:", instance_stats.flat_ins)
+        self.__dump_instances(file, "Flat Blackboxes:", instance_stats.flat_blackboxes)
+
+        nb_primitives = sum(instance_stats.flat_basic_primitives.values()) + sum(
+            instance_stats.flat_primitives.values()
+        )
+        if nb_primitives > 1:
+            self.__dump_stats(file, "Flat Primitives", nb_primitives)
+
+        self.__dump_instances(
+            file, "Flat Simple Primitives:", instance_stats.flat_basic_primitives
+        )
+        self.__dump_instances(
+            file, "Flat Other Primitives:", instance_stats.flat_primitives
+        )
 
-class DesignStats:
+        if instance_stats.flat_assigns > 0:
+            self.__dump_stats(file, "Flat Assigns", instance_stats.flat_assigns)
+
+        file.write("\n")
+
+        for child_instance in instance.get_child_instances():
+            self.__dump_instance_stats_text(child_instance, file, dumped_models)
+
+
+class InstanceStats:
     def __init__(self):
         self.name = ""
         self.assigns = 0
@@ -51,92 +156,96 @@ def is_basic_primitive(design):
     )
 
 
-def compute_design_stats(design, designs_stats):
-    if design.get_model_id() in designs_stats.hier_designs:
-        return designs_stats.hier_designs.get(design.get_model_id())
-    design_stats = DesignStats()
-    design_stats.name = design.get_model_name()
-    for ins in design.get_child_instances():
+def compute_instance_stats(instance, instances_stats):
+    if instance.get_model_id() in instances_stats.hier_instances:
+        return instances_stats.hier_instances.get(instance.get_model_id())
+    instance_stats = InstanceStats()
+    instance_stats.name = instance.get_model_name()
+    for ins in instance.get_child_instances():
         model_id = ins.get_model_id()
         if ins.is_assign():
-            design_stats.assigns += 1
-            design_stats.flat_assigns += 1
+            instance_stats.assigns += 1
+            instance_stats.flat_assigns += 1
         elif ins.is_primitive():
             if is_basic_primitive(ins):
-                design_stats.basic_primitives[model_id] = (
-                    design_stats.basic_primitives.get(model_id, 0) + 1
+                instance_stats.basic_primitives[model_id] = (
+                    instance_stats.basic_primitives.get(model_id, 0) + 1
                 )
-                design_stats.flat_basic_primitives[model_id] = (
-                    design_stats.flat_basic_primitives.get(model_id, 0) + 1
+                instance_stats.flat_basic_primitives[model_id] = (
+                    instance_stats.flat_basic_primitives.get(model_id, 0) + 1
                 )
             else:
-                design_stats.primitives[model_id] = (
-                    design_stats.primitives.get(model_id, 0) + 1
+                instance_stats.primitives[model_id] = (
+                    instance_stats.primitives.get(model_id, 0) + 1
                 )
-                design_stats.flat_primitives[model_id] = (
-                    design_stats.flat_primitives.get(model_id, 0) + 1
+                instance_stats.flat_primitives[model_id] = (
+                    instance_stats.flat_primitives.get(model_id, 0) + 1
                 )
         elif ins.is_blackbox():
-            design_stats.blackboxes[model_id] = (
-                design_stats.blackboxes.get(model_id, 0) + 1
+            instance_stats.blackboxes[model_id] = (
+                instance_stats.blackboxes.get(model_id, 0) + 1
             )
-            design_stats.flat_blackboxes[model_id] = (
-                design_stats.flat_blackboxes.get(model_id, 0) + 1
+            instance_stats.flat_blackboxes[model_id] = (
+                instance_stats.flat_blackboxes.get(model_id, 0) + 1
             )
-            if model_id not in designs_stats.blackboxes:
-                designs_stats.blackboxes[model_id] = dict()
-                compute_design_terms(model_id, designs_stats.blackboxes[model_id])
+            if model_id not in instance_stats.blackboxes:
+                instance_stats.blackboxes[model_id] = dict()
+                compute_instance_terms(model_id, instance_stats.blackboxes[model_id])
         else:
-            if model_id in designs_stats.hier_designs:
-                model_stats = designs_stats.hier_designs[model_id]
+            if model_id in instances_stats.hier_instances:
+                model_stats = instances_stats.hier_instances[model_id]
             else:
-                model_stats = compute_design_stats(ins, designs_stats)
-            design_stats.ins[model_id] = design_stats.ins.get(model_id, 0) + 1
-            design_stats.flat_ins[model_id] = design_stats.flat_ins.get(model_id, 0) + 1
-            design_stats.add_ins_stats(model_stats)
-    compute_design_terms(design, design_stats)
-    compute_design_net_stats(design, design_stats)
-    designs_stats.hier_designs[design.get_model_id()] = design_stats
-    return design_stats
-
-
-def compute_design_terms(design, design_stats):
-    for term in design.get_terms():
+                model_stats = compute_instance_stats(ins, instances_stats)
+            instance_stats.ins[model_id] = instance_stats.ins.get(model_id, 0) + 1
+            instance_stats.flat_ins[model_id] = (
+                instance_stats.flat_ins.get(model_id, 0) + 1
+            )
+            instance_stats.add_ins_stats(model_stats)
+    compute_instance_terms(instance, instance_stats)
+    compute_instance_net_stats(instance, instance_stats)
+    instances_stats.hier_instances[instance.get_model_id()] = instance_stats
+    return instance_stats
+
+
+def compute_instance_terms(instance, instance_stats):
+    for term in instance.get_terms():
         if term.get_direction() == netlist.Term.INPUT:
-            design_stats.terms["inputs"] = design_stats.terms.get("inputs", 0) + 1
+            instance_stats.terms["inputs"] = instance_stats.terms.get("inputs", 0) + 1
             bit_terms = sum(1 for _ in term.get_bits())
-            design_stats.bit_terms["inputs"] = (
-                design_stats.bit_terms.get("inputs", 0) + bit_terms
+            instance_stats.bit_terms["inputs"] = (
+                instance_stats.bit_terms.get("inputs", 0) + bit_terms
             )
         elif term.get_direction() == netlist.Term.OUTPUT:
-            design_stats.terms["outputs"] = design_stats.terms.get("outputs", 0) + 1
+            instance_stats.terms["outputs"] = instance_stats.terms.get("outputs", 0) + 1
             bit_terms = sum(1 for _ in term.get_bits())
-            design_stats.bit_terms["outputs"] = (
-                design_stats.bit_terms.get("outputs", 0) + bit_terms
+            instance_stats.bit_terms["outputs"] = (
+                instance_stats.bit_terms.get("outputs", 0) + bit_terms
             )
         elif term.get_direction() == netlist.Term.INOUT:
-            design_stats.terms["inouts"] = design_stats.terms.get("inouts", 0) + 1
+            instance_stats.terms["inouts"] = instance_stats.terms.get("inouts", 0) + 1
             bit_terms = sum(1 for _ in term.get_bits())
-            design_stats.bit_terms["inouts"] = (
-                design_stats.bit_terms.get("inouts", 0) + bit_terms
+            instance_stats.bit_terms["inouts"] = (
+                instance_stats.bit_terms.get("inouts", 0) + bit_terms
             )
         else:
-            design_stats.terms["unknowns"] = design_stats.terms.get("unknowns", 0) + 1
+            instance_stats.terms["unknowns"] = (
+                instance_stats.terms.get("unknowns", 0) + 1
+            )
             bit_terms = sum(1 for _ in term.get_bits())
-            design_stats.bit_terms["unknowns"] = (
-                design_stats.bit_terms.get("unknowns", 0) + bit_terms
+            instance_stats.bit_terms["unknowns"] = (
+                instance_stats.bit_terms.get("unknowns", 0) + bit_terms
             )
 
 
-def compute_design_net_stats(design, design_stats):
-    for net in design.get_flat_nets():
+def compute_instance_net_stats(instance, instance_stats):
+    for net in instance.get_flat_nets():
         if net.is_const():
             pass
         nb_components = sum(1 for c in net.get_terms())
-        design_stats.net_stats[nb_components] = (
-            design_stats.net_stats.get(nb_components, 0) + 1
+        instance_stats.net_stats[nb_components] = (
+            instance_stats.net_stats.get(nb_components, 0) + 1
         )
-        design_stats.net_stats = dict(sorted(design_stats.net_stats.items()))
+        instance_stats.net_stats = dict(sorted(instance_stats.net_stats.items()))
 
 
 def dump_instances(stats_file, title, instances):
@@ -184,57 +293,6 @@ def dump_blackboxes_stats(stats_file, design_stats):
             stats_file.write("\n")
 
 
-def dump_stats(design, stats_file, designs_stats, dumped_models):
-    if design.is_primitive() or design.is_blackbox():
-        return
-    if design in dumped_models:
-        return
-    dumped_models.add(design)
-    stats_file.write("*** " + design.get_name() + " ***\n")
-    design_stats = designs_stats.hier_designs.get(design.get_model_id())
-    if design_stats is None:
-        print("Cannot find " + str(design) + " in design_stats")
-        raise
-    if len(design_stats.terms) > 0:
-        stats_file.write("Terms: ")
-        first = True
-        for terms in design_stats.terms.items():
-            if not first:
-                stats_file.write(", ")
-            else:
-                first = False
-            stats_file.write(terms[0] + ":" + str(terms[1]))
-        stats_file.write("\n")
-
-    dump_instances(stats_file, "Instances:", design_stats.ins)
-    nb_primitives = sum(design_stats.basic_primitives.values()) + sum(
-        design_stats.primitives.values()
-    )
-    if nb_primitives > 1:
-        stats_file.write("Primitives: " + str(nb_primitives) + "\n")
-    dump_instances(stats_file, "Simple Primitives:", design_stats.basic_primitives)
-    dump_instances(stats_file, "Other Primitives:", design_stats.primitives)
-    dump_instances(stats_file, "Blackboxes:", design_stats.blackboxes)
-    if design_stats.assigns > 0:
-        stats_file.write("Assigns: " + str(design_stats.assigns) + "\n")
-    dump_instances(stats_file, "Flat Instances:", design_stats.flat_ins)
-    dump_instances(stats_file, "Flat Blackboxes:", design_stats.flat_blackboxes)
-    nb_primitives = sum(design_stats.flat_basic_primitives.values()) + sum(
-        design_stats.flat_primitives.values()
-    )
-    if nb_primitives > 1:
-        stats_file.write("Flat Primitives: " + str(nb_primitives) + "\n")
-    dump_instances(
-        stats_file, "Flat Simple Primitives:", design_stats.flat_basic_primitives
-    )
-    dump_instances(stats_file, "Flat Other Primitives:", design_stats.flat_primitives)
-    if design_stats.flat_assigns > 0:
-        stats_file.write("Flat Assigns: " + str(design_stats.flat_assigns) + "\n")
-    stats_file.write("\n")
-    for ins in design.get_child_instances():
-        dump_stats(ins, stats_file, designs_stats, dumped_models)
-
-
 # def dump_pandas(designs_stats):
 #  import pandas
 #  import matplotlib.pyplot as plt
@@ -286,14 +344,51 @@ def dump_stats(design, stats_file, designs_stats, dumped_models):
 #  primitives_figure.savefig('figures/flat_primitives_' + design.getName() + '.png')
 
 
-def dump_design_stats(design, stats_file, with_pandas=False):
-    designs_stats = DesignsStats()
-    compute_design_stats(design, designs_stats)
-    dumped_models = set()
-    dump_stats(design, stats_file, designs_stats, dumped_models)
-    dump_blackboxes_stats(stats_file, designs_stats)
-    # if with_pandas:
-    #   dump_pandas(designs_stats)
+def convert_instance_stats_to_json(instance_stats):
+    json_top = list()
+    for _, value in instance_stats.hier_instances.items():
+        nb_primitives = sum(value.basic_primitives.values())
+        +sum(value.primitives.values())
+        nb_terms = sum(value.terms.values())
+        nb_nets = sum(value.net_stats.keys())
+        nb_ins = sum(value.ins.values()) + nb_primitives
+        json_top.append(
+            {
+                "Name": value.name,
+                "primitives": nb_primitives,
+                "instances": nb_ins,
+                "terms": nb_terms,
+                "nets": nb_nets,
+                # "primitives": value.primitives,
+                # "flat_basic_primitives": value.flat_basic_primitives,
+                # "flat_primitives": value.flat_primitives,
+                # "blackboxes": value.blackboxes,
+                # "flat_blackboxes": value.flat_blackboxes,
+                # "ins": value.ins,
+                # "flat_ins": value.flat_ins,
+                # "terms": value.terms,
+                # "bit_terms": value.bit_terms,
+                # "net_stats": value.net_stats,
+            }
+        )
+    return json_top
+
+
+def dump_instance_stats_json(instance, stats_file):
+    # stats_files = [(InstanceStats.ReportType.JSON, stats_file)]
+    # stats_file.write("[\n")
+    # dump_instance_stats(design, stats_files)
+    # stats_file.write("]")
+    instances_stats = InstancesStats()
+    compute_instance_stats(instance, instances_stats)
+    json_dict = convert_instance_stats_to_json(instances_stats)
+    json.dump(json_dict, stats_file, indent=4)
+
+
+def dump_instance_stats_text(instance, file):
+    instances_stats = InstancesStats()
+    compute_instance_stats(instance, instances_stats)
+    instances_stats.dump_instance_stats_text(instance, file)
 
 
 def dump_constants(design, analyzed_models):

najaeda-0.1.12.dist-info/METADATA

@@ -0,0 +1,79 @@
+Metadata-Version: 2.1
+Name: najaeda
+Version: 0.1.12
+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.9.dist-info → najaeda-0.1.12.dist-info}/RECORD

@@ -1,18 +1,14 @@
-najaeda-0.1.9.dist-info/RECORD,,
-najaeda-0.1.9.dist-info/WHEEL,sha256=PJzLOGr1UQbVJ9ClJnwqiFhnlyWYjSsyNgebnLgIQKg,114
-najaeda-0.1.9.dist-info/METADATA,sha256=mLCLaVsZwtrgbmzHBHz5w9mjqDzjNev79QSgW4VD9I0,6854
-najaeda-0.1.9.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
-najaeda-0.1.9.dist-info/licenses/AUTHORS,sha256=7NYEGDAX_1QZvCCHfq8YVXC5ZbwH_pbNI8DcSmm70GU,377
-najaeda/netlist.py,sha256=SYVF3z_koUwaRczDTVeDsVo9fT1OMw77R-1U3cLahk0,44955
-najaeda/libnaja_snl_python.dylib,sha256=L1wX3e5lmPyqhN1rkKPGyV7lj4E_kHqk0z2DMujk4ek,808208
+najaeda/netlist.py,sha256=8p0iHWDNbsMo-DndUBKLc43j7agtgb_jhlQdgkoYpvU,46750
+najaeda/libnaja_snl_python.dylib,sha256=HE3O04AAj9qVLJN0DWRC1sp27t3vaZJy2Q0qNvsPInA,825616
+najaeda/pandas_stats.py,sha256=yOb4ka965U7rN4D6AwvSGmRyeT_O7Ed-5cmT8BFbfeo,1070
 najaeda/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
-najaeda/libnaja_snl.dylib,sha256=AFqR64aX6KnzkX6lrLGCuscx2f5E07umNC_7E9cNrT0,574272
-najaeda/snl.so,sha256=nwbhD_k8zYEQZh-LsCexOj9j2uSibNAeUnWTxwUy1iM,97888
-najaeda/stats.py,sha256=FoNdmu7bf-Iy1RW1WO-4Ue-i7O7CRqEDbGAuyhfVxf4,12879
+najaeda/libnaja_snl.dylib,sha256=T76kBcwP4dGXUXS5aD1mcNr5hBAL8ou-nJGQNg7tXIA,574160
+najaeda/snl.so,sha256=jLLEWjnuzaSCSJsHYEeIVir026oaLAqBs7KKty0koBA,98272
+najaeda/stats.py,sha256=xWiIHa-S9yCHgAjyi6fVtx9C96o9v4MkYU7x5GdRKwA,16250
 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
@@ -20,8 +16,15 @@ 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/primitives/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
 najaeda/primitives/xilinx.py,sha256=fuu4KxEIuC0ueCK4C_gds6hzgtJsLE3tjDtOHtY9McM,25947
+najaeda-0.1.12.dist-info/RECORD,,
+najaeda-0.1.12.dist-info/WHEEL,sha256=PJzLOGr1UQbVJ9ClJnwqiFhnlyWYjSsyNgebnLgIQKg,114
+najaeda-0.1.12.dist-info/METADATA,sha256=SlRgiK7xMLvNflXb_hKnXr7WamPV2wijr-qtmyqUH20,2475
+najaeda-0.1.12.dist-info/licenses/LICENSE,sha256=xx0jnfkXJvxRnG63LTGOxlggYnIysveWIZ6H3PNdCrQ,11357
+najaeda-0.1.12.dist-info/licenses/AUTHORS,sha256=7NYEGDAX_1QZvCCHfq8YVXC5ZbwH_pbNI8DcSmm70GU,377

najaeda-0.1.9.dist-info/METADATA

@@ -1,197 +0,0 @@
-Metadata-Version: 2.1
-Name: najaeda
-Version: 0.1.9
-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()
-        output_terms = top.get_flat_output_terms()
-        for termToTrace in output_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)
-        
-        leaf_children = top.get_leaf_children()
-        to_delete = [leaf for leaf in 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.