Method and apparatus for efficient storage of hierarchical signal names
First Claim
1. A computer-implemented method comprising:
- inserting an instance name into a first trie, wherein inserting the instance name results in a particular node in the trie corresponding to the instance name; and
associating said particular node with a second trie by causing said particular node to point to a root node of the second trie.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, computer program product, and data processing system for efficiently storing a set of hierarchically-specified names in a modular hardware design are disclosed. In accordance with a preferred embodiment of the present invention, a data structure for storing the names is built from a master trie. The master trie is used to store names of instances of modules contained within the design. The node in the master trie corresponding to a particular instance name is associated with an additional trie (“class trie”) corresponding to the class of module to which that instance belongs. In this additional trie are stored the names of the individual signals associated with that class of module. Where there are multiple instances of the same class of module within a design, each instance name may be associated with a single class trie storing each of the individual signal names associated with that class of module.
176 Citations
20 Claims
-
1. A computer-implemented method comprising:
-
inserting an instance name into a first trie, wherein inserting the instance name results in a particular node in the trie corresponding to the instance name; and
associating said particular node with a second trie by causing said particular node to point to a root node of the second trie. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer program product in a computer readable medium comprising functional descriptive material that, when executed by a computer, causes the computer to perform actions that include:
-
inserting an instance name into a first trie, wherein inserting the instance name results in a particular node in the trie corresponding to the instance name; and
associating said particular node with a second trie by causing said particular node to point to a root node of the second trie. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A data processing system comprising:
-
at least one processor;
storage associated with the at least one processor; and
a set of instructions in the storage, wherein the at least one processor executes the set of instructions to perform actions that include;
inserting an instance name into a first trie, wherein inserting the instance name results in a particular node in the trie corresponding to the instance name; and
associating said particular node with a second trie by causing said particular node to point to a root node of the second trie. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification